overflow pdl n.
[MIT] The place where you put things when
your PDL is full. If you don't have one and too many things
get pushed, you forget something. The overflow pdl for a person's
memory might be a memo pad. This usage inspired the following
doggerel:
Hey, diddle, diddle
The overflow pdl
To get a little more stack;
If that's not enough
Then you lose it all,
And have to pop all the way back.
-The Great Quux
The term `pdl' (see PDL) seems to be primarily an MITism;
outside MIT this term is replaced by `overflow stack' (but
that wouldn't rhyme with `diddle').
[MIT] The place where you put things when
your PDL is full. If you don't have one and too many things
get pushed, you forget something. The overflow pdl for a person's
memory might be a memo pad. This usage inspired the following
doggerel:
Hey, diddle, diddle
The overflow pdl
To get a little more stack;
If that's not enough
Then you lose it all,
And have to pop all the way back.
-The Great Quux
The term `pdl' (see PDL) seems to be primarily an MITism;
outside MIT this term is replaced by `overflow stack' (but
that wouldn't rhyme with `diddle').
Related:
- overflow pdl: [MIT] n. The place where you put things when your
{pdl} is full
If you don't have one and too many things get pushed... - Hey, diddle, diddle the overflow pdl
To get a little more stack
If that's not enough then you lose it all And have... - stack n.
The set of things a person has to do in the
future
One speaks of the next project to be attacked as having... - PDL /P-D-L/, /pid'l/, /p*d'l/ or /puhd'l/
1. n. `Program Design Language'
Any of a large class of formal and profoundly useless... - push
[from the operation that puts the current information
on a stack
and the fact that procedure return addresses are saved... - push: [from the operation that puts the current information on a
stack
and the fact that procedure return addresses are saved... - pop: /pop/ [from the operation that removes the top of a stack
and the fact that procedure return addresses are usually... - pop /pop/
[from the operation that removes the top of a
stack
and the fact that procedure return addresses are usually... - buffer overflow: n. What happens when you try to stuff more data
into a buffer (holding area) than it can handle
This may be due to a mismatch in the processing...
