GREAT IDEA FOR MAXIMUM PERFORMANCE IN C

IF OSes CAN UTILIZE THE MEMORY AND THERE ARE SOME CACHE BLAH BLAH THINGS, WHY DONT WE JUST CALL :
malloc(10000000)
AND PUT EVERYTHING IN THAT MEMORY SO THERE ARE NO CACHE MISSES, FRAGMENTATIONS OR "WIDE JUMPS" THAT FUCKS UP THE PROGRAM.

AMIRITE ?

>>1
Most video games do exactly this, because they have fixed budget, so all assets are pre-baked for specific resolution.

Too bad I'm gonna steal this great idea and become Earth's savior/Steve Jobs's legacy

malloc
Shalom!

>>4
well le pedophile sager, which language should I use that is not made by jews ?

>>5
Ruby.

>>6
slow as shit.

my new method malloc(10000000) is the fastest in the universe.

>>5
Forth

>>7
But not made by Jews!

>>8
>le pedophile sage

he is the pedophile reporting all the threads
he recently got the shill thread deleted

kike afraid of goyim knowing the truth

This Intel® GC is for goyim use only. See pages 1000-2000 in ``Le Intel algorithms manual'' for God's Chosen GC (GCGC) suitable for use on Sabbath. For more information, check out ``Electronic Goyim: They work so we don't have to'' in Israeli Transhumanism Journal.
#define top return
static char use_all_your_RAM_so_you_have_to_upgrade[10*1024*1024*1024];
static char *we_israel_now = use_all_your_RAM_so_you_have_to_upgrade;
void *malloc(size_t goyim_loan_size) {
  // we x86, alignment is for le fags XD
  char *lel = we_israel_now;
  we_israel_now += goyim_loan_size;
  top lel;
}
void free(void *pay_us_back) {
  // foreclosure already done and shit
  (void)pay_us_back; // accept payment
}

>>12
you don't return NULL in the case that you don't have more memory =(

o-oh you must be a master jew https://bugzilla.gnome.org/show_bug.cgi?id=674446 !!!!!! =)

>>1

Dear OP, there's more to performance than that.  Concentrating your memory usage with a single large malloc(and manually managing it) is a technique that is used in the industry, and helps with pagination and efficient ram usage. 

However there's a variety of things to consider and optimize for and no single technique is a magic bullet.  For instance, the processor has an L1,L2 and L3 cache, then RAM the next cache, and disk is the final cache.  You want to coax your computation to use those as efficiently as possible.   Performance optimizing is by nature a finicky beast and no one size fits all.  It's often unsurprising for the order of instructions and memory access' to have huge impacts on performance.

>>12
bullshit


#include <stddef.h>
#define top return

void *
malloc (size_t goyim_loan_size)
{
  static char use_all_your_RAM_so_you_have_to_upgrade[10*1024*1024*1024],
              *lel = use_all_your_RAM_so_you_have_to_upgrade;
  /* we x86, alignment is for le fags XD */
  lel += goyim_loan_size;
  top lel;
}

void
free (void *pay_us_back)
{
  /* foreclosure already done and shit */
  /* accept payment */
}