Lines Matching defs:stack
34 Added new multiple giant stack mechanism
44 newGiant() no longer modifies CurrentMaxShorts or giant stack
123 * Log interesting giant stack events
128 * Log allocation of giant larger than stack size
181 /* ------ giant stack package ------ */
184 * The giant stack package is a local cache which allows us to avoid calls
186 * giant stack package shows about a 1.35 speedup factor over an identical
199 unsigned numDigits; // capacity of giants in this stack
200 unsigned numFree; // number of free giants in stack
201 unsigned totalGiants; // total number in *stack
202 giant *stack;
209 #define INIT_NUM_GIANTS 16 /* initial # of giants / stack */
268 freeGiant(gs->stack[j]);
269 gs->stack[j] = NULL;
271 /* and the stack itself - may be null if this was never used */
272 if(gs->stack != NULL) {
273 ffree(gs->stack);
274 gs->stack = NULL;
301 * Find appropriate stack
329 if((gs->numFree != 0) && (gs->stack == NULL)) {
330 dblog0("borrowGiant: null stack!\n");
335 result = gs->stack[--gs->numFree];
377 * Find appropriate stack. Note we expect exact match of
378 * capacity and stack's giant size.
428 gs->stack = (giantstruct**) frealloc(gs->stack, gs->totalGiants*sizeof(giant));
431 gs->stack[gs->numFree++] = g;
434 if((gs->numFree != 0) && (gs->stack == NULL)) {
435 dblog0("borrowGiant: null stack!\n");