Home | History | Annotate | Download | only in ia32

Lines Matching full:stack

34 #include "regexp-stack.h"
52 * - esp : points to tip of C stack.
53 * - ecx : points to tip of backtrack stack
58 * The stack will have the following structure:
63 * backtracking stack)
153 // Pop Code* offset from backtrack stack, add Code* and jump to location.
377 // Put arguments into allocated stack area, last argument highest on stack.
675 // Tell the system that we have a stack frame. Because the type is MANUAL, no
679 // Actually emit code to start a new stack frame.
689 // Check if we have space on the stack for registers.
697 // Handle it if the stack pointer is already below the stack limit.
700 // the stack limit.
703 // Exit with OutOfMemory exception. There is not enough space on the stack
718 // Allocate space on stack for registers.
741 // Fill in stack push order, to avoid accessing across an unwritten
751 // Ensure that we have written to each stack page, in order. Skipping a page
762 // Initialize backtrack stack pointer.
842 // Backtrack stack overflow code.
845 // Reached if the backtrack-stack limit has been hit.
863 // If return NULL, we have failed to grow the stack, and
864 // must exit with a stack-overflow exception.
867 // Otherwise use return value as new stack pointer.
1040 // Next address on the stack (will be address of return address).
1049 // Helper function for reading a value out of a stack frame.
1066 // If not real stack overflow the stack guard was used to interrupt
1092 // Overwrite the return address on the stack.
1122 // Update the start and end pointers in the stack frame to the current
1138 // addresses in the RegExp stack frame to match the new value.