| /dports/math/suitesparse-umfpack/SuiteSparse-5.10.1/CSparse/Source/ |
| H A D | cs_dfs.c | 3 csi cs_dfs (csi j, cs *G, csi top, csi *xi, csi *pstack, const csi *pinv) in cs_dfs() argument
6 if (!CS_CSC (G) || !xi || !pstack) return (-1) ; /* check inputs */ in cs_dfs()
16 pstack [head] = (jnew < 0) ? 0 : CS_UNFLIP (Gp [jnew]) ; in cs_dfs()
20 for (p = pstack [head] ; p < p2 ; p++) /* examine all neighbors of j */ in cs_dfs()
24 pstack [head] = p ; /* pause depth-first search of node j */ in cs_dfs()
|
| /dports/math/suitesparse-umfpack/SuiteSparse-5.10.1/CXSparse/Source/ |
| H A D | cs_dfs.c | 3 CS_INT cs_dfs (CS_INT j, cs *G, CS_INT top, CS_INT *xi, CS_INT *pstack, const CS_INT *pinv) in cs_dfs() argument
6 if (!CS_CSC (G) || !xi || !pstack) return (-1) ; /* check inputs */ in cs_dfs()
16 pstack [head] = (jnew < 0) ? 0 : CS_UNFLIP (Gp [jnew]) ; in cs_dfs()
20 for (p = pstack [head] ; p < p2 ; p++) /* examine all neighbors of j */ in cs_dfs()
24 pstack [head] = p ; /* pause depth-first search of node j */ in cs_dfs()
|
| /dports/math/suitesparse-slip_lu/SuiteSparse-5.10.1/CSparse/Source/ |
| H A D | cs_dfs.c | 3 csi cs_dfs (csi j, cs *G, csi top, csi *xi, csi *pstack, const csi *pinv) in cs_dfs() argument
6 if (!CS_CSC (G) || !xi || !pstack) return (-1) ; /* check inputs */ in cs_dfs()
16 pstack [head] = (jnew < 0) ? 0 : CS_UNFLIP (Gp [jnew]) ; in cs_dfs()
20 for (p = pstack [head] ; p < p2 ; p++) /* examine all neighbors of j */ in cs_dfs()
24 pstack [head] = p ; /* pause depth-first search of node j */ in cs_dfs()
|
| /dports/math/suitesparse-spqr/SuiteSparse-5.10.1/CSparse/Source/ |
| H A D | cs_dfs.c | 3 csi cs_dfs (csi j, cs *G, csi top, csi *xi, csi *pstack, const csi *pinv) in cs_dfs() argument
6 if (!CS_CSC (G) || !xi || !pstack) return (-1) ; /* check inputs */ in cs_dfs()
16 pstack [head] = (jnew < 0) ? 0 : CS_UNFLIP (Gp [jnew]) ; in cs_dfs()
20 for (p = pstack [head] ; p < p2 ; p++) /* examine all neighbors of j */ in cs_dfs()
24 pstack [head] = p ; /* pause depth-first search of node j */ in cs_dfs()
|
| /dports/misc/openmvg/openMVG-2.0/src/third_party/cxsparse/Source/ |
| H A D | cs_dfs.c | 3 CS_INT cs_dfs (CS_INT j, cs *G, CS_INT top, CS_INT *xi, CS_INT *pstack, const CS_INT *pinv) in cs_dfs() argument
6 if (!CS_CSC (G) || !xi || !pstack) return (-1) ; /* check inputs */ in cs_dfs()
16 pstack [head] = (jnew < 0) ? 0 : CS_UNFLIP (Gp [jnew]) ; in cs_dfs()
20 for (p = pstack [head] ; p < p2 ; p++) /* examine all neighbors of j */ in cs_dfs()
24 pstack [head] = p ; /* pause depth-first search of node j */ in cs_dfs()
|
| /dports/math/suitesparse-camd/SuiteSparse-5.10.1/CXSparse/Source/ |
| H A D | cs_dfs.c | 3 CS_INT cs_dfs (CS_INT j, cs *G, CS_INT top, CS_INT *xi, CS_INT *pstack, const CS_INT *pinv) in cs_dfs() argument
6 if (!CS_CSC (G) || !xi || !pstack) return (-1) ; /* check inputs */ in cs_dfs()
16 pstack [head] = (jnew < 0) ? 0 : CS_UNFLIP (Gp [jnew]) ; in cs_dfs()
20 for (p = pstack [head] ; p < p2 ; p++) /* examine all neighbors of j */ in cs_dfs()
24 pstack [head] = p ; /* pause depth-first search of node j */ in cs_dfs()
|
| /dports/math/suitesparse-camd/SuiteSparse-5.10.1/CSparse/Source/ |
| H A D | cs_dfs.c | 3 csi cs_dfs (csi j, cs *G, csi top, csi *xi, csi *pstack, const csi *pinv) in cs_dfs() argument
6 if (!CS_CSC (G) || !xi || !pstack) return (-1) ; /* check inputs */ in cs_dfs()
16 pstack [head] = (jnew < 0) ? 0 : CS_UNFLIP (Gp [jnew]) ; in cs_dfs()
20 for (p = pstack [head] ; p < p2 ; p++) /* examine all neighbors of j */ in cs_dfs()
24 pstack [head] = p ; /* pause depth-first search of node j */ in cs_dfs()
|
| /dports/math/suitesparse-csparse/SuiteSparse-5.10.1/CXSparse/Source/ |
| H A D | cs_dfs.c | 3 CS_INT cs_dfs (CS_INT j, cs *G, CS_INT top, CS_INT *xi, CS_INT *pstack, const CS_INT *pinv) in cs_dfs() argument
6 if (!CS_CSC (G) || !xi || !pstack) return (-1) ; /* check inputs */ in cs_dfs()
16 pstack [head] = (jnew < 0) ? 0 : CS_UNFLIP (Gp [jnew]) ; in cs_dfs()
20 for (p = pstack [head] ; p < p2 ; p++) /* examine all neighbors of j */ in cs_dfs()
24 pstack [head] = p ; /* pause depth-first search of node j */ in cs_dfs()
|
| /dports/math/suitesparse-csparse/SuiteSparse-5.10.1/CSparse/Source/ |
| H A D | cs_dfs.c | 3 csi cs_dfs (csi j, cs *G, csi top, csi *xi, csi *pstack, const csi *pinv) in cs_dfs() argument
6 if (!CS_CSC (G) || !xi || !pstack) return (-1) ; /* check inputs */ in cs_dfs()
16 pstack [head] = (jnew < 0) ? 0 : CS_UNFLIP (Gp [jnew]) ; in cs_dfs()
20 for (p = pstack [head] ; p < p2 ; p++) /* examine all neighbors of j */ in cs_dfs()
24 pstack [head] = p ; /* pause depth-first search of node j */ in cs_dfs()
|
| /dports/math/suitesparse-cxsparse/SuiteSparse-5.10.1/CSparse/Source/ |
| H A D | cs_dfs.c | 3 csi cs_dfs (csi j, cs *G, csi top, csi *xi, csi *pstack, const csi *pinv) in cs_dfs() argument
6 if (!CS_CSC (G) || !xi || !pstack) return (-1) ; /* check inputs */ in cs_dfs()
16 pstack [head] = (jnew < 0) ? 0 : CS_UNFLIP (Gp [jnew]) ; in cs_dfs()
20 for (p = pstack [head] ; p < p2 ; p++) /* examine all neighbors of j */ in cs_dfs()
24 pstack [head] = p ; /* pause depth-first search of node j */ in cs_dfs()
|
| /dports/math/suitesparse-cxsparse/SuiteSparse-5.10.1/CXSparse/Source/ |
| H A D | cs_dfs.c | 3 CS_INT cs_dfs (CS_INT j, cs *G, CS_INT top, CS_INT *xi, CS_INT *pstack, const CS_INT *pinv) in cs_dfs() argument
6 if (!CS_CSC (G) || !xi || !pstack) return (-1) ; /* check inputs */ in cs_dfs()
16 pstack [head] = (jnew < 0) ? 0 : CS_UNFLIP (Gp [jnew]) ; in cs_dfs()
20 for (p = pstack [head] ; p < p2 ; p++) /* examine all neighbors of j */ in cs_dfs()
24 pstack [head] = p ; /* pause depth-first search of node j */ in cs_dfs()
|
| /dports/math/suitesparse-graphblas/SuiteSparse-5.10.1/CXSparse/Source/ |
| H A D | cs_dfs.c | 3 CS_INT cs_dfs (CS_INT j, cs *G, CS_INT top, CS_INT *xi, CS_INT *pstack, const CS_INT *pinv) in cs_dfs() argument
6 if (!CS_CSC (G) || !xi || !pstack) return (-1) ; /* check inputs */ in cs_dfs()
16 pstack [head] = (jnew < 0) ? 0 : CS_UNFLIP (Gp [jnew]) ; in cs_dfs()
20 for (p = pstack [head] ; p < p2 ; p++) /* examine all neighbors of j */ in cs_dfs()
24 pstack [head] = p ; /* pause depth-first search of node j */ in cs_dfs()
|
| /dports/math/suitesparse-graphblas/SuiteSparse-5.10.1/CSparse/Source/ |
| H A D | cs_dfs.c | 3 csi cs_dfs (csi j, cs *G, csi top, csi *xi, csi *pstack, const csi *pinv) in cs_dfs() argument
6 if (!CS_CSC (G) || !xi || !pstack) return (-1) ; /* check inputs */ in cs_dfs()
16 pstack [head] = (jnew < 0) ? 0 : CS_UNFLIP (Gp [jnew]) ; in cs_dfs()
20 for (p = pstack [head] ; p < p2 ; p++) /* examine all neighbors of j */ in cs_dfs()
24 pstack [head] = p ; /* pause depth-first search of node j */ in cs_dfs()
|
| /dports/lang/onyx/onyx-5.1.2/bin/onyx/test/ |
| H A D | count_a.nx.exp | 2 `count pstack clear'
4 `1 count pstack clear'
7 `1 2 count pstack clear'
11 `1 2 3 count pstack clear'
|
| H A D | copy_a.nx.in | 44 pstack `---\n' print
46 pstack `---\n' print clear
51 `vvvv\n' print pstack `^^^^\n' print
55 `vvvv\n' print pstack `^^^^\n' print
60 pstack `---\n' print
64 pstack `---\n' print
66 pstack `---\n' print
|
| /dports/www/firefox-legacy/firefox-52.8.0esr/js/src/jsapi-tests/ |
| H A D | testProfileStrings.cpp | 14 static js::ProfileEntry pstack[10]; variable
22 memset(pstack, 0, sizeof(pstack)); in reset()
83 js::SetContextProfilingStack(cx, pstack, &psize, 10); in initialize()
130 js::SetContextProfilingStack(cx, pstack, &psize, 3); in BEGIN_TEST()
134 pstack[3].setLabel((char*) 1234); in BEGIN_TEST()
137 CHECK((size_t) pstack[3].label() == 1234); in BEGIN_TEST()
181 js::SetContextProfilingStack(cx, pstack, &psize, 3); in BEGIN_TEST()
186 pstack[3].setLabel((char*) 1234); in BEGIN_TEST()
191 CHECK((size_t) pstack[3].label() == 1234); in BEGIN_TEST()
|
| /dports/textproc/miller/miller-5.10.2/c/containers/ |
| H A D | local_stack.c | 70 local_stack_t* pstack = mlr_malloc_or_die(sizeof(local_stack_t)); in local_stack_alloc() local
72 pstack->pframes = sllv_alloc(); in local_stack_alloc()
74 return pstack; in local_stack_alloc()
78 void local_stack_free(local_stack_t* pstack) { in local_stack_free() argument
79 if (pstack == NULL) in local_stack_free()
81 for (sllve_t* pe = pstack->pframes->phead; pe != NULL; pe = pe->pnext) { in local_stack_free()
84 sllv_free(pstack->pframes); in local_stack_free()
85 free(pstack); in local_stack_free()
90 sllv_push(pstack->pframes, pframe); in local_stack_push()
93 local_stack_frame_t* local_stack_pop(local_stack_t* pstack) { in local_stack_pop() argument
[all …]
|
| /dports/textproc/p5-XML-DOMHandler/XML-DOMHandler-1.0/ |
| H A D | DOMHandler.pm | 40 my @pstack; # position stack
62 @pstack = (0);
165 $pstack[1] = 1;
184 $pstack[ $level ] = 0;
186 $pstack[ $level ] ++;
187 $position = $pstack[ $level ];
|
| /dports/lang/gcc12-devel/gcc-12-20211205/libphobos/libdruntime/core/thread/ |
| H A D | fiber.d | 1159 void* pstack = m_ctxt.tstack; variable
1166 pstack -= size_t.sizeof; in push()
1171 pstack += size_t.sizeof; in push()
1183 pstack = cast(void*)(cast(size_t)(pstack) - (cast(size_t)(pstack) & 0x0F)); in version()
1187 pstack = cast(void*)(cast(size_t)(pstack) + (cast(size_t)(pstack) & 0x0F)); in version()
1252 pstack -= reserve; in version()
1255 auto pChainEnd = pstack; in version()
1387 pstack -= wsize * 6; in version()
1389 pstack -= wsize * 22; in version()
1436 pstack -= ABOVE; in version()
[all …]
|
| /dports/lang/gcc11-devel/gcc-11-20211009/libphobos/libdruntime/core/thread/ |
| H A D | fiber.d | 1149 void* pstack = m_ctxt.tstack; variable
1156 pstack -= size_t.sizeof; in push()
1161 pstack += size_t.sizeof; in push()
1173 pstack = cast(void*)(cast(size_t)(pstack) - (cast(size_t)(pstack) & 0x0F)); in version()
1177 pstack = cast(void*)(cast(size_t)(pstack) + (cast(size_t)(pstack) & 0x0F)); in version()
1242 pstack -= reserve; in version()
1245 auto pChainEnd = pstack; in version()
1377 pstack -= wsize * 6; in version()
1379 pstack -= wsize * 22; in version()
1426 pstack -= ABOVE; in version()
[all …]
|
| /dports/lang/gcc11/gcc-11.2.0/libphobos/libdruntime/core/thread/ |
| H A D | fiber.d | 1149 void* pstack = m_ctxt.tstack; variable
1156 pstack -= size_t.sizeof; in push()
1161 pstack += size_t.sizeof; in push()
1173 pstack = cast(void*)(cast(size_t)(pstack) - (cast(size_t)(pstack) & 0x0F)); in version()
1177 pstack = cast(void*)(cast(size_t)(pstack) + (cast(size_t)(pstack) & 0x0F)); in version()
1242 pstack -= reserve; in version()
1245 auto pChainEnd = pstack; in version()
1377 pstack -= wsize * 6; in version()
1379 pstack -= wsize * 22; in version()
1426 pstack -= ABOVE; in version()
[all …]
|
| /dports/misc/cxx_atomics_pic/gcc-11.2.0/libphobos/libdruntime/core/thread/ |
| H A D | fiber.d | 1149 void* pstack = m_ctxt.tstack; variable
1156 pstack -= size_t.sizeof; in push()
1161 pstack += size_t.sizeof; in push()
1173 pstack = cast(void*)(cast(size_t)(pstack) - (cast(size_t)(pstack) & 0x0F)); in version()
1177 pstack = cast(void*)(cast(size_t)(pstack) + (cast(size_t)(pstack) & 0x0F)); in version()
1242 pstack -= reserve; in version()
1245 auto pChainEnd = pstack; in version()
1377 pstack -= wsize * 6; in version()
1379 pstack -= wsize * 22; in version()
1426 pstack -= ABOVE; in version()
[all …]
|
| /dports/devel/universal-ctags/ctags-p5.9.20211128.0/Tmain/roles-field-optscript.d/ |
| H A D | foo.ctags | 14 \1 . :roles pstack clear
18 \1 . :roles pstack clear
22 \1 . :roles pstack clear
26 \1 . :roles pstack clear
|
| /dports/math/suitesparse-klu/SuiteSparse-5.10.1/SLIP_LU/Source/ |
| H A D | slip_dfs.c | 24 int64_t* pstack, // workspace vector in slip_dfs() argument
57 pstack[head] = (jnew < 0) ? 0 : SLIP_UNFLIP(L->p[jnew]); in slip_dfs()
67 for (p = pstack[head]; p < p2; p++) in slip_dfs()
75 pstack[head] = p; in slip_dfs()
|
| /dports/math/suitesparse-graphblas/SuiteSparse-5.10.1/SLIP_LU/Source/ |
| H A D | slip_dfs.c | 24 int64_t* pstack, // workspace vector in slip_dfs() argument
57 pstack[head] = (jnew < 0) ? 0 : SLIP_UNFLIP(L->p[jnew]); in slip_dfs()
67 for (p = pstack[head]; p < p2; p++) in slip_dfs()
75 pstack[head] = p; in slip_dfs()
|