Begin with installing windbg: http://www.microsoft.com/whdc/Devtools/Debugging/default.mspx Then turn on the pageheap like this: gflags.exe /p /enable yourexecutable.exe /full This will insert a non writable page after each heap allocation. After this launch the executable from inside windbg, any writes outside the heap will now be caught by this debugger. To turn of the pageheap afterwards use … Read more
Contacted heroku support, here I solved the issue: The error has occurred because the node can only address 1.5GB of memory before hitting the JavaScript heap out of memory error, a default limit that it inherits from the V8 engine. We tweak this default setting on Heroku through the NODE_OPTIONS env var so that the … Read more
You need to give more memory to the Gradle JVM, not to the compile task/JVM. One way to do so is via the GRADLE_OPTS environment variable (GRADLE_OPTS=-Xmx512m).
An iterative function to free your list: void freeList(struct node* head) { struct node* tmp; while (head != NULL) { tmp = head; head = head->next; free(tmp); } } What the function is doing is the follow: check if head is NULL, if yes the list is empty and we just return Save the head … Read more
To disable it for a single application Go to the HKEY_LOCAL_MACHINE and HKEY_CURRENT_USER versions of Software\Microsoft\Windows NT\CurrentVersion\AppCompatFlags\Layers\your_application.exe and delete the FaultTolerantHeap entry. From here (actually here)
First, note that all of this is an implementation detail. The only thing the runtime guarantees is: When you ask for a static field, it’s there A static constructor is executed at some point before you use the type That’s pretty much it. Everything else is an implementation detail – the specification doesn’t care about … Read more
Stack: The stack is used as a sort of temporary scratch pad for use by the block of code that’s currently executing, and whatever block called the current one, and whatever block called that one, and so on. When the current block exits, the local variables it was using are forgotten. As the name indicates, … Read more
A hacky way to do it: struct Detect { Detect() { int i; check(&i); } private: void check(int *i) { int j; if ((i < &j) == ((void*)this < (void*)&j)) std::cout << “Stack” << std::endl; else std::cout << “Heap” << std::endl; } }; If the object was created on the stack it must live somewhere … Read more
The majority of the technical information about the architecture and approach of the GHC system is in their wiki. I’ll link to the key pieces, and some related papers that people may not know about. What typical optimizations are applied? The key paper on this is: A transformation-based optimiser for Haskell, SL Peyton Jones and … Read more
There are several reasons for this. Using “opaque” pointers Lack of destructors Embedded systems (stack overflow problem) Containers Inertia “Laziness” Let’s discuss them briefly. For opaque pointers, it enables you to do something like: struct CClass_; typedef struct CClass_ CClass; // the rest as in your example So, the user doesn’t see the definition of … Read more