realloc

问题 Question says it all but here is an example: typedef struct mutable_t{ int count, max; void **data; } mutable_t; void pushMutable(mutable_t *m, void *object) { if(m->count == m->max){ m->max *= 2; m->data = realloc(m->data, m->max * sizeof(void*)); } // how to handle oom?? m->data[m->count++] = object; } How can I handle running out of memory and not NULL out all of my data? edit - let\'s assume there is something which could be done e.g. free up some memory somewhere or at least tell the

问题 A different question inspired the following thought: Does std::vector<T> have to move all the elements when it increases its capacity? As far as I understand, the standard behaviour is for the underlying allocator to request an entire chunk of the new size, then move all the old elements over, then destroy the old elements and then deallocate the old memory. This behaviour appears to be the only possible correct solution given the standard allocator interface. But I was wondering, would it

问题 This question already has an answer here: what's the point in malloc(0)? 17 answers What does malloc(0) returns? Would the answer be same for realloc(malloc(0),0) ? #include<stdio.h> #include<malloc.h> int main() { printf(\"%p\\n\", malloc(0)); printf(\"%p\\n\", realloc(malloc(0), 0)); return 0; } Output from linux gcc: manav@manav-workstation:~$ gcc -Wall mal.c manav@manav-workstation:~$ ./a.out 0x9363008 (nil) manav@manav-workstation:~$ The output keep changing everytime for malloc(0) . Is