enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Stack-based memory allocation - Wikipedia

    en.wikipedia.org/wiki/Stack-based_memory_allocation

    The stack is often used to store variables of fixed length local to the currently active functions. Programmers may further choose to explicitly use the stack to store local data of variable length. If a region of memory lies on the thread's stack, that memory is said to have been allocated on the stack, i.e. stack-based memory allocation (SBMA).

  3. x86 calling conventions - Wikipedia

    en.wikipedia.org/wiki/X86_calling_conventions

    Windows (Microsoft Visual C++, GCC, Intel C++ Compiler, Delphi), UEFI: RCX/XMM0, RDX/XMM1, R8/XMM2, R9/XMM3: RTL (C) Caller Stack aligned on 16 bytes. 32 bytes shadow space on stack. The specified 8 registers can only be used for parameters 1 through 4. For C++ classes, the hidden this parameter is the first parameter, and is passed in RCX. [31 ...

  4. Stack machine - Wikipedia

    en.wikipedia.org/wiki/Stack_machine

    The stack easily holds more than two inputs or more than one result, so a rich set of operations can be computed. In stack machine code (sometimes called p-code), instructions will frequently have only an opcode commanding an operation, with no additional fields identifying a constant, register or memory cell, known as a zero address format. [1]

  5. Memory ordering - Wikipedia

    en.wikipedia.org/wiki/Memory_ordering

    Memory ordering is the order of accesses to computer memory by a CPU.Memory ordering depends on both the order of the instructions generated by the compiler at compile time and the execution order of the CPU at runtime.

  6. C standard library - Wikipedia

    en.wikipedia.org/wiki/C_standard_library

    On Microsoft Windows, the core system dynamic libraries provide an implementation of the C standard library for the Microsoft Visual C++ compiler v6.0; the C standard library for newer versions of the Microsoft Visual C++ compiler is provided by each compiler individually, as well as redistributable packages. Compiled applications written in C ...

  7. Stack (abstract data type) - Wikipedia

    en.wikipedia.org/wiki/Stack_(abstract_data_type)

    A stack may be implemented as, for example, a singly linked list with a pointer to the top element. A stack may be implemented to have a bounded capacity. If the stack is full and does not contain enough space to accept another element, the stack is in a state of stack overflow. A stack is needed to implement depth-first search.

  8. Call stack - Wikipedia

    en.wikipedia.org/wiki/Call_stack

    This type of stack is also known as an execution stack, program stack, control stack, run-time stack, or machine stack, and is often shortened to simply the "stack". Although maintenance of the call stack is important for the proper functioning of most software , the details are normally hidden and automatic in high-level programming languages .

  9. Stack trace - Wikipedia

    en.wikipedia.org/wiki/Stack_trace

    Both C and C++ (pre-C++23) do not have native support for obtaining stack traces, but libraries such as glibc and boost provide this functionality. [6] [7] In these languages, some compiler optimizations may interfere with the call stack information that can be recovered at runtime.