Related:

• wizzle v. To convert external names, array indice
  or references within a data structure into address pointers when the data structure is brought into main memory from external storage (also called `pointer swizzling')...
• chase pointers: 1. vi. To go through multiple levels of indirection, as in traversing a linked list or graph structure.
  Used esp. by programmers in C, where explicit pointers are a very common data type....
• ap: v. To replace a pointer to a pointer with a direct pointe
  to replace an old address with the forwarding address found there....
• mash the stack: [C programming] n. To corrupt the execution stack by writing past the end of a local array or other data structure.
  Code that smashes the stack can cause a return from the routine to jump to a random address, resulting in some of the most insidious data-dependent bugs known to mankind....
• walk: n.,vt. Traversal of a data structure, especially an array or linked-list data structure in {core}.
  See also {codewalker}, {silly walk}, {clobber}. -- The AI Hackers Dictionary...
• aliasing bug: n. A class of subtle programming errors that can arise in code that does dynamic allocation, esp.
  via `malloc(3)' or equivalent. If several pointers address (`aliases for') a given hunk of storage, it may happen that the storage is freed or reallocated (and thus moved) through one alias and then referenced through another, which may lead to subtle (and possibly intermittent) lossage depending on the state and the allocation history of the malloc {arena}....
• handle: n. 1. [from CB slang] An electronic pseudonym
  a `nom de guerre' intended to conceal the user's true identity....
• ap v. To replace a pointer to a pointer with a direct pointe
  o replace an old address with the forwarding address found there....
• him: n. A small piece of data inserted in order to achieve a desired memory alignment or other addressing property.
  For example, the PDP-11 UNIX linker, in split I&D (instructions and data) mode, inserts a two-byte shim at location 0 in data space so that no data object will have an address of 0 (and be confused with the C null pointer)....