/dports/databases/py-gdbm/Python-3.8.12/Parser/ |
H A D | parser.c | 32 s->s_top = &s->s_base[MAXSTACK]; in s_reset() 41 if (s->s_top == s->s_base) { in s_push() 45 top = --s->s_top; in s_push() 59 s->s_top++; in s_pop() 64 #define s_pop(s) (s)->s_top++ 117 s->s_top->s_state = newstate; in shift() 127 n = s->s_top->s_parent; in push() 133 s->s_top->s_state = newstate; in push() 191 node *n = ps->p_stack.s_top->s_parent; 249 const dfa *d = ps->p_stack.s_top->s_dfa; in PyParser_AddToken() [all …]
|
/dports/databases/py-sqlite3/Python-3.8.12/Parser/ |
H A D | parser.c | 32 s->s_top = &s->s_base[MAXSTACK]; in s_reset() 41 if (s->s_top == s->s_base) { in s_push() 45 top = --s->s_top; in s_push() 59 s->s_top++; in s_pop() 64 #define s_pop(s) (s)->s_top++ 117 s->s_top->s_state = newstate; in shift() 127 n = s->s_top->s_parent; in push() 133 s->s_top->s_state = newstate; in push() 191 node *n = ps->p_stack.s_top->s_parent; 249 const dfa *d = ps->p_stack.s_top->s_dfa; in PyParser_AddToken() [all …]
|
/dports/lang/python-legacy/Python-2.7.18/Parser/ |
H A D | parser.c | 32 s->s_top = &s->s_base[MAXSTACK]; in s_reset() 35 #define s_empty(s) ((s)->s_top == &(s)->s_base[MAXSTACK]) 41 if (s->s_top == s->s_base) { in s_push() 45 top = --s->s_top; in s_push() 59 s->s_top++; in s_pop() 64 #define s_pop(s) (s)->s_top++ 115 s->s_top->s_state = newstate; in shift() 124 n = s->s_top->s_parent; in push() 129 s->s_top->s_state = newstate; in push() 181 node *n = ps->p_stack.s_top->s_parent; in future_hack() [all …]
|
/dports/lang/python37/Python-3.7.12/Parser/ |
H A D | parser.c | 32 s->s_top = &s->s_base[MAXSTACK]; in s_reset() 41 if (s->s_top == s->s_base) { in s_push() 45 top = --s->s_top; in s_push() 59 s->s_top++; in s_pop() 64 #define s_pop(s) (s)->s_top++ 115 s->s_top->s_state = newstate; in shift() 124 n = s->s_top->s_parent; in push() 129 s->s_top->s_state = newstate; in push() 187 node *n = ps->p_stack.s_top->s_parent; 243 dfa *d = ps->p_stack.s_top->s_dfa; in PyParser_AddToken() [all …]
|
/dports/lang/python27/Python-2.7.18/Parser/ |
H A D | parser.c | 32 s->s_top = &s->s_base[MAXSTACK]; in s_reset() 35 #define s_empty(s) ((s)->s_top == &(s)->s_base[MAXSTACK]) 41 if (s->s_top == s->s_base) { in s_push() 45 top = --s->s_top; in s_push() 59 s->s_top++; in s_pop() 64 #define s_pop(s) (s)->s_top++ 115 s->s_top->s_state = newstate; in shift() 124 n = s->s_top->s_parent; in push() 129 s->s_top->s_state = newstate; in push() 181 node *n = ps->p_stack.s_top->s_parent; in future_hack() [all …]
|
/dports/lang/python-tools/Python-3.8.12/Parser/ |
H A D | parser.c | 32 s->s_top = &s->s_base[MAXSTACK]; in s_reset() 41 if (s->s_top == s->s_base) { in s_push() 45 top = --s->s_top; in s_push() 59 s->s_top++; in s_pop() 64 #define s_pop(s) (s)->s_top++ 117 s->s_top->s_state = newstate; in shift() 127 n = s->s_top->s_parent; in push() 133 s->s_top->s_state = newstate; in push() 191 node *n = ps->p_stack.s_top->s_parent; 249 const dfa *d = ps->p_stack.s_top->s_dfa; in PyParser_AddToken() [all …]
|
/dports/lang/python39/Python-3.9.9/Parser/ |
H A D | parser.c | 32 s->s_top = &s->s_base[MAXSTACK]; in s_reset() 41 if (s->s_top == s->s_base) { in s_push() 45 top = --s->s_top; in s_push() 60 s->s_top++; in s_pop() 65 #define s_pop(s) (s)->s_top++ 118 s->s_top->s_state = newstate; in shift() 128 n = s->s_top->s_parent; in push() 134 s->s_top->s_state = newstate; in push() 192 node *n = ps->p_stack.s_top->s_parent; 250 const dfa *d = ps->p_stack.s_top->s_dfa; in PyParser_AddToken() [all …]
|
/dports/lang/python38/Python-3.8.12/Parser/ |
H A D | parser.c | 32 s->s_top = &s->s_base[MAXSTACK]; in s_reset() 41 if (s->s_top == s->s_base) { in s_push() 45 top = --s->s_top; in s_push() 59 s->s_top++; in s_pop() 64 #define s_pop(s) (s)->s_top++ 117 s->s_top->s_state = newstate; in shift() 127 n = s->s_top->s_parent; in push() 133 s->s_top->s_state = newstate; in push() 191 node *n = ps->p_stack.s_top->s_parent; 249 const dfa *d = ps->p_stack.s_top->s_dfa; in PyParser_AddToken() [all …]
|
/dports/devel/py-typed-ast/typed_ast-1.5.0/ast27/Parser/ |
H A D | parser.c | 32 s->s_top = &s->s_base[MAXSTACK]; in s_reset() 35 #define s_empty(s) ((s)->s_top == &(s)->s_base[MAXSTACK]) 41 if (s->s_top == s->s_base) { in s_push() 45 top = --s->s_top; in s_push() 59 s->s_top++; in s_pop() 64 #define s_pop(s) (s)->s_top++ 115 s->s_top->s_state = newstate; in shift() 124 n = s->s_top->s_parent; in push() 129 s->s_top->s_state = newstate; in push() 181 node *n = ps->p_stack.s_top->s_parent; in future_hack() [all …]
|
/dports/devel/py-typed-ast/typed_ast-1.5.0/ast3/Parser/ |
H A D | parser.c | 32 s->s_top = &s->s_base[MAXSTACK]; in s_reset() 41 if (s->s_top == s->s_base) { in s_push() 45 top = --s->s_top; in s_push() 59 s->s_top++; in s_pop() 64 #define s_pop(s) (s)->s_top++ 115 s->s_top->s_state = newstate; in shift() 124 n = s->s_top->s_parent; in push() 129 s->s_top->s_state = newstate; in push() 187 node *n = ps->p_stack.s_top->s_parent; 243 dfa *d = ps->p_stack.s_top->s_dfa; in Ta3Parser_AddToken() [all …]
|
/dports/sysutils/uefi-edk2-bhyve-csm/uefi-edk2-aa8d718/AppPkg/Applications/Python/Python-2.7.2/Parser/ |
H A D | parser.c | 32 s->s_top = &s->s_base[MAXSTACK]; in s_reset() 35 #define s_empty(s) ((s)->s_top == &(s)->s_base[MAXSTACK]) 41 if (s->s_top == s->s_base) { in s_push() 45 top = --s->s_top; in s_push() 59 s->s_top++; in s_pop() 64 #define s_pop(s) (s)->s_top++ 115 s->s_top->s_state = newstate; in shift() 124 n = s->s_top->s_parent; in push() 129 s->s_top->s_state = newstate; in push() 181 node *n = ps->p_stack.s_top->s_parent; in future_hack() [all …]
|
/dports/x11-toolkits/py-tkinter/Python-3.8.12/Parser/ |
H A D | parser.c | 32 s->s_top = &s->s_base[MAXSTACK]; in s_reset() 41 if (s->s_top == s->s_base) { in s_push() 45 top = --s->s_top; in s_push() 59 s->s_top++; in s_pop() 64 #define s_pop(s) (s)->s_top++ 117 s->s_top->s_state = newstate; in shift() 127 n = s->s_top->s_parent; in push() 133 s->s_top->s_state = newstate; in push() 191 node *n = ps->p_stack.s_top->s_parent; 249 const dfa *d = ps->p_stack.s_top->s_dfa; in PyParser_AddToken() [all …]
|
/dports/devel/tex-web2c/texlive-20150521-source/texk/web2c/luatexdir/lua/ |
H A D | luanode.w | 65 int s_top = lua_gettop(L); 67 lua_settop(L, s_top); 71 lua_settop(L, s_top); 77 lua_settop(L, s_top); 81 lua_settop(L, s_top); 96 lua_settop(L, s_top); 100 lua_settop(L, s_top); 132 lua_settop(L, s_top); 170 lua_settop(L, s_top); 217 lua_settop(L, s_top); [all …]
|
/dports/devel/tex-synctex/texlive-20150521-source/texk/web2c/luatexdir/lua/ |
H A D | luanode.w | 65 int s_top = lua_gettop(L); 67 lua_settop(L, s_top); 71 lua_settop(L, s_top); 77 lua_settop(L, s_top); 81 lua_settop(L, s_top); 96 lua_settop(L, s_top); 100 lua_settop(L, s_top); 132 lua_settop(L, s_top); 170 lua_settop(L, s_top); 217 lua_settop(L, s_top); [all …]
|
/dports/japanese/tex-ptex/texlive-20150521-source/texk/web2c/luatexdir/lua/ |
H A D | luanode.w | 65 int s_top = lua_gettop(L); 67 lua_settop(L, s_top); 71 lua_settop(L, s_top); 77 lua_settop(L, s_top); 81 lua_settop(L, s_top); 96 lua_settop(L, s_top); 100 lua_settop(L, s_top); 132 lua_settop(L, s_top); 170 lua_settop(L, s_top); 217 lua_settop(L, s_top); [all …]
|
/dports/print/tex-basic-engines/texlive-20150521-source/texk/web2c/luatexdir/lua/ |
H A D | luanode.w | 65 int s_top = lua_gettop(L); 67 lua_settop(L, s_top); 71 lua_settop(L, s_top); 77 lua_settop(L, s_top); 81 lua_settop(L, s_top); 96 lua_settop(L, s_top); 100 lua_settop(L, s_top); 132 lua_settop(L, s_top); 170 lua_settop(L, s_top); 217 lua_settop(L, s_top); [all …]
|
/dports/print/tex-aleph/texlive-20150521-source/texk/web2c/luatexdir/lua/ |
H A D | luanode.w | 65 int s_top = lua_gettop(L); 67 lua_settop(L, s_top); 71 lua_settop(L, s_top); 77 lua_settop(L, s_top); 81 lua_settop(L, s_top); 96 lua_settop(L, s_top); 100 lua_settop(L, s_top); 132 lua_settop(L, s_top); 170 lua_settop(L, s_top); 217 lua_settop(L, s_top); [all …]
|
/dports/print/tex-luatex/texlive-20150521-source/texk/web2c/luatexdir/lua/ |
H A D | luanode.w | 65 int s_top = lua_gettop(L); 67 lua_settop(L, s_top); 71 lua_settop(L, s_top); 77 lua_settop(L, s_top); 81 lua_settop(L, s_top); 96 lua_settop(L, s_top); 100 lua_settop(L, s_top); 132 lua_settop(L, s_top); 170 lua_settop(L, s_top); 217 lua_settop(L, s_top); [all …]
|
/dports/print/tex-xetex/texlive-20150521-source/texk/web2c/luatexdir/lua/ |
H A D | luanode.w | 65 int s_top = lua_gettop(L); 67 lua_settop(L, s_top); 71 lua_settop(L, s_top); 77 lua_settop(L, s_top); 81 lua_settop(L, s_top); 96 lua_settop(L, s_top); 100 lua_settop(L, s_top); 132 lua_settop(L, s_top); 170 lua_settop(L, s_top); 217 lua_settop(L, s_top); [all …]
|
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/openmp/runtime/src/ |
H A D | kmp_error.cpp | 136 p->p_top = p->w_top = p->s_top = 0; in __kmp_allocate_cons_stack() 220 if (p->s_top > p->p_top) { in __kmp_check_workshare() 272 if (p->s_top > p->p_top && p->s_top > p->w_top) { 274 int index = p->s_top; 300 int index = p->s_top; 320 if (ct == ct_reduce && p->s_top > p->p_top) { 348 p->stack_data[tos].prev = p->s_top; 351 p->s_top = tos; 410 if (tos == 0 || p->s_top == 0) { 419 p->s_top = p->stack_data[tos].prev; [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/openmp/runtime/src/ |
H A D | kmp_error.cpp | 136 p->p_top = p->w_top = p->s_top = 0; in __kmp_allocate_cons_stack() 220 if (p->s_top > p->p_top) { in __kmp_check_workshare() 272 if (p->s_top > p->p_top && p->s_top > p->w_top) { 274 int index = p->s_top; 300 int index = p->s_top; 320 if (ct == ct_reduce && p->s_top > p->p_top) { 348 p->stack_data[tos].prev = p->s_top; 351 p->s_top = tos; 410 if (tos == 0 || p->s_top == 0) { 419 p->s_top = p->stack_data[tos].prev; [all …]
|
/dports/devel/llvm12/llvm-project-12.0.1.src/openmp/runtime/src/ |
H A D | kmp_error.cpp | 136 p->p_top = p->w_top = p->s_top = 0; in __kmp_allocate_cons_stack() 220 if (p->s_top > p->p_top) { in __kmp_check_workshare() 272 if (p->s_top > p->p_top && p->s_top > p->w_top) { 274 int index = p->s_top; 300 int index = p->s_top; 320 if (ct == ct_reduce && p->s_top > p->p_top) { 348 p->stack_data[tos].prev = p->s_top; 351 p->s_top = tos; 410 if (tos == 0 || p->s_top == 0) { 419 p->s_top = p->stack_data[tos].prev; [all …]
|
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/openmp/runtime/src/ |
H A D | kmp_error.cpp | 136 p->p_top = p->w_top = p->s_top = 0; in __kmp_allocate_cons_stack() 220 if (p->s_top > p->p_top) { in __kmp_check_workshare() 272 if (p->s_top > p->p_top && p->s_top > p->w_top) { 274 int index = p->s_top; 300 int index = p->s_top; 320 if (ct == ct_reduce && p->s_top > p->p_top) { 348 p->stack_data[tos].prev = p->s_top; 351 p->s_top = tos; 410 if (tos == 0 || p->s_top == 0) { 422 p->s_top = p->stack_data[tos].prev; [all …]
|
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/openmp/runtime/src/ |
H A D | kmp_error.cpp | 142 p->p_top = p->w_top = p->s_top = 0; in __kmp_allocate_cons_stack() 226 if (p->s_top > p->p_top) { in __kmp_check_workshare() 278 if (p->s_top > p->p_top && p->s_top > p->w_top) { 280 int index = p->s_top; 306 int index = p->s_top; 326 if (ct == ct_reduce && p->s_top > p->p_top) { 354 p->stack_data[tos].prev = p->s_top; 357 p->s_top = tos; 416 if (tos == 0 || p->s_top == 0) { 425 p->s_top = p->stack_data[tos].prev; [all …]
|
/dports/devel/llvm10/llvm-10.0.1.src/projects/openmp/runtime/src/ |
H A D | kmp_error.cpp | 136 p->p_top = p->w_top = p->s_top = 0; in __kmp_allocate_cons_stack() 220 if (p->s_top > p->p_top) { in __kmp_check_workshare() 272 if (p->s_top > p->p_top && p->s_top > p->w_top) { 274 int index = p->s_top; 300 int index = p->s_top; 320 if (ct == ct_reduce && p->s_top > p->p_top) { 348 p->stack_data[tos].prev = p->s_top; 351 p->s_top = tos; 410 if (tos == 0 || p->s_top == 0) { 422 p->s_top = p->stack_data[tos].prev; [all …]
|