developer's mag
main page
article
part 1
part 2
part 3
part 4
part 5
part 6
part 7
part 8
8 - Conclusion
This code is basic, so feel free to modify it to your needs. One glaring omission is that new and delete handling is missing (and new[] and delete[]). On the ebm, new eventually calls a form of malloc(), so it is possible to add this checking. Unfortunately, this requires tinkering with the OS source, not a trivial task. Another problem is the code itself - memory allocations are stored as a linked list, necessitating an inefficient sequential search, and the extra bookkeeping code takes up a significant amount of memory. While these features can be adjusted (after all, you have the source code), they may not be much of a problem, since most testing is on the simulator, where memory is cheap. Also, sequential searching isn't a big issue for small lists, and most memory allocations are grouped in small blocks of allocations and deallocations, hopefully keeping the memory list small.This trio of tools has been invaluable in my own ebm coding, and I hope it helps in yours. Used as a group, you're ready to go about bulletproofing and turbo charging your code - onward ho!
Previous Section