Are there stackless or heapless implementation of C++?

by

Others have already given good answers about the heap, so I’ll leave that alone.

Some implementations (e.g., on IBM mainframes) don’t use a stack as most people would think of it, for the simple reason that the hardware doesn’t support it. Instead, when you call a function, an activation record (i.e., space for the locals, arguments, and return address) is allocated from (their version of) the heap. These activation records are built into a linked list.

From a purely abstract viewpoint, this is certainly a stack — it supports last-in, first-out semantics, just like any other stack. You do have to look at it pretty abstractly to call it a stack though. If you showed people a diagram of the memory blocks linked together, I think it’s safe to guess most programmers would describe it as a linked list. If you pushed them, I think most would judge it something like “yeah, you can use it in a stack-like manner, but it’s still a linked list.”

More Related Contents:

  1. Why are the terms “automatic” and “dynamic” preferred over the terms “stack” and “heap” in C++ memory management?
  2. When vectors are allocated, do they use memory on the heap or the stack?
  3. Object creation on the stack/heap?
  4. Why not use pointers for everything in C++?
  5. Where are temporary object stored?
  6. How is heap and stack memories managed, implemented, allocated?
  7. Is accessing data in the heap faster than from the stack?
  8. What happens if I increment an array variable?
  9. How to find if a variable is allocated in stack or heap?
  10. Class members and explicit stack/heap allocation
  11. Are global variables in C++ stored on the stack, heap or neither of them?
  12. Using paragraphs 8.5.3p4 and p5 in the C++11 Standard, how do I prove that the snippet below doesn’t compile?
  13. Why aren’t variable-length arrays part of the C++ standard?
  14. Where do I find the current C or C++ standard documents?
  15. What are the new features in C++17?
  16. Which is faster: Stack allocation or Heap allocation
  17. Where exactly does C++ standard say dereferencing an uninitialized pointer is undefined behavior?
  18. C++ Static member method call on class instance
  19. Why do const references extend the lifetime of rvalues?
  20. Is right shift undefined behavior if the count is larger than the width of the type?
  21. Why an unnamed namespace is a “superior” alternative to static? [duplicate]
  22. Defining a variable in the condition part of an if-statement?
  23. Critique my non-intrusive heap debugger
  24. How is the array stored in memory?
  25. Base pointer to array of derived objects
  26. Does this type of memory get allocated on the heap or the stack?
  27. Can I legally reinterpret_cast between layout-compatible standard-layout types?
  28. Why do we even need the “delete[]” operator?
  29. Can we apply content not explicitly cited from the normative references to the C++ standard?
  30. C++ delete does not free all memory (Windows)

Leave a Comment