Lines Matching full:stack
34 uptr stack[1]; // [size]
51 static u32 hash(const uptr *stack, uptr size) {
58 u32 k = stack[i];
101 uptr mem = (uptr)MmapOrDie(allocsz, "stack depot");
108 static u32 find(StackDesc *s, const uptr *stack, uptr size, u32 hash) {
109 // Searches linked list s for the stack, returns its id.
114 if (stack[i] != s->stack[i])
144 u32 StackDepotPut(const uptr *stack, uptr size) {
145 if (stack == 0 || size == 0)
147 uptr h = hash(stack, size);
151 // First, try to find the existing stack.
152 u32 id = find(s, stack, size, h);
158 id = find(s2, stack, size, h);
175 internal_memcpy(s->stack, stack, size * sizeof(uptr));
196 return s->stack;
