| /dports/devel/tclcheck/tclcheck-9de3e5b12c5f453137305377344cb1d1c848e75e/ |
| H A D | tclCheck.c | 44 Stack *bstack = (Stack *) 0; variable
51 bstack = bstack->next; in pop()
283 tmp->next = bstack; in stack()
284 bstack = tmp; in stack()
294 if ((lch = ((bstack == (Stack *) 0) ? ' ' : bstack->expecting)) == ch) in unstack()
335 while ((bstack != (Stack *) 0) && bstack->expecting != cch) in unstack()
375 if (bstack != (Stack *) 0 && bstack->expecting != ']' && !comment) in openParen()
384 if (bstack != (Stack *) 0 && bstack->expecting != ']' && !comment) in closeParen()
401 switch (bstack->expecting) in newline()
432 bstack = (Stack *) 0; in process()
[all …]
|
| /dports/math/yices/yices-2.6.2/src/solvers/simplex/ |
| H A D | simplex_printer.c | 289 xq_print(f, solver->bstack.bound + lb); in print_avar_bounds()
295 xq_print(f, solver->bstack.bound + ub); in print_avar_bounds()
331 xq_print(f, solver->bstack.bound + lb); in print_avar_full()
337 xq_print(f, solver->bstack.bound + ub); in print_avar_full()
618 if (i < solver->bstack.top) { in print_simplex_bound()
625 xq_print(f, solver->bstack.bound + i); in print_simplex_bound()
656 arith_bstack_t *bstack; in print_simplex_reduced_row() local
664 bstack = &solver->bstack; in print_simplex_reduced_row()
674 if (l >= 0 && u >= 0 && xq_eq(bstack->bound + l, bstack->bound + u)) { in print_simplex_reduced_row()
695 if (l < 0 || u < 0 || xq_neq(bstack->bound + l, bstack->bound + u)) { in print_simplex_reduced_row()
[all …]
|
| H A D | simplex.c | 1483 bstack = &solver->bstack; in simplex_propagate_equalities()
3739 bstack = &solver->bstack; in simplex_fix_nonbasic_assignment()
4408 bstack = &solver->bstack; in simplex_build_explanation()
4605 bstack = &solver->bstack; in simplex_build_theory_explanation()
5214 bstack = &solver->bstack; in simplex_literal_propagation()
5293 bstack = &solver->bstack; in improved_lower_bound()
5306 bstack = &solver->bstack; in improved_upper_bound()
7583 bstack = &solver->bstack; in clear_antecedent_marks()
10161 bstack = &solver->bstack; in simplex_go_back()
10427 bstack = &solver->bstack; in roll_back_fix_ptr()
[all …]
|
| H A D | simplex_propagator0.h | 111 arith_bstack_t *bstack; in collect_relevant_prop_rows() local
121 bstack = &solver->bstack; in collect_relevant_prop_rows()
134 for (i = bstack->prop_ptr; i<bstack->top; i++) { in collect_relevant_prop_rows()
135 x = bstack->var[i]; in collect_relevant_prop_rows()
281 arith_bstack_t *bstack; in useful_lower_bound() local
284 bstack = &solver->bstack; in useful_lower_bound()
308 arith_bstack_t *bstack; in useful_upper_bound() local
311 bstack = &solver->bstack; in useful_upper_bound()
1134 arith_bstack_t *bstack; in full_upper_bound_propagation() local
1156 bstack = &solver->bstack; in full_upper_bound_propagation()
[all …]
|
| H A D | simplex_propagator1.h | 411 bound = solver->bstack.bound; in try_upper_bound_propagation()
526 bound = solver->bstack.bound; in try_lower_bound_propagation()
628 bound = solver->bstack.bound; in add_upper_bounds()
704 arith_bstack_t *bstack; in full_upper_bound_propagation() local
729 bstack = &solver->bstack; in full_upper_bound_propagation()
820 arith_bstack_t *bstack; in full_lower_bound_propagation() local
845 bstack = &solver->bstack; in full_lower_bound_propagation()
1079 arith_bstack_t *bstack; in collect_relevant_prop_rows() local
1087 bstack = &solver->bstack; in collect_relevant_prop_rows()
1099 for (i = bstack->prop_ptr; i<bstack->top; i++) { in collect_relevant_prop_rows()
[all …]
|
| /dports/graphics/rx/rx-0.4.0/cargo-crates/luminance-0.38.0/src/ |
| H A D | pipeline.rs | 425 let unit = bstack.next_texture_unit; in bind_texture()
426 bstack.next_texture_unit += 1; in bind_texture()
431 let mut state = bstack.state.borrow_mut(); in bind_texture()
450 let binding = bstack.next_buffer_binding; in bind_buffer()
451 bstack.next_buffer_binding += 1; in bind_buffer()
456 bstack in bind_buffer()
503 bstack.free_texture_units.push(self.unit); in drop()
571 bstack.free_buffer_bindings.push(self.binding); in drop()
606 let bstack = self.binding_stack.borrow_mut(); in shade() localVariable
639 let bstack = self.binding_stack.borrow_mut(); in render() localVariable
[all …]
|
| /dports/net-mgmt/observium/observium/html/includes/graphs/device/ |
| H A D | ucd_ss_cpu.inc.php | 64 $bstack = ''; variable
86 …at."_perc#".$colour.":'".rrdtool_escape(str_replace("ssCpuRaw", "", $stat), $descr_len)."'$bstack";
89 $bstack = ":STACK"; variable
100 unset($rrd_multi, $thingX, $plusesX, $bstack);
|
| /dports/www/grafana8/grafana-8.3.6/vendor/github.com/ohler55/ojg/jp/ |
| H A D | script.go | 95 copy(bstack, s.template)
97 for i := len(bstack) - 1; 0 <= i; i-- {
98 o, _ := bstack[i].(*op)
104 if 1 < len(bstack)-i {
105 left = bstack[i+1]
107 if 2 < len(bstack)-i {
108 right = bstack[i+2]
110 bstack[i] = s.appendOp(o, left, right)
111 if i+int(o.cnt)+1 <= len(bstack) {
112 copy(bstack[i+1:], bstack[i+int(o.cnt)+1:])
[all …]
|
| /dports/net-mgmt/observium/observium/html/includes/graphs/ |
| H A D | generic_multi.inc.php | 41 $bstack = ''; variable
102 $rrd_optionsb .= " AREA:".$id."#".$colour.":'$descr'".($rrd['stack'] === FALSE ? '' : $bstack);
105 $bstack = ":STACK"; variable
116 unset($cstack, $bstack);
|
| /dports/textproc/bat/bat-0.18.3/tests/syntax-tests/source/Fortran (Fixed Form)/ |
| H A D | quicksort_real_F77.F | 99 INTEGER a, d, i, j, k, s, lo, mid, hi, tstack, bstack(mstack) local
135 hi = bstack(tstack)
136 lo = bstack(tstack-1)
310 bstack(tstack) = hi
311 bstack(tstack-1) = MIN(j+d+1, hi)
314 bstack(tstack)=MAX(j-a,lo)
315 bstack(tstack-1)=lo
|
| /dports/lang/gcc12-devel/gcc-12-20211205/libphobos/libdruntime/core/thread/ |
| H A D | fiber.d | 214 obj.m_ctxt.tstack = obj.m_ctxt.bstack; in fiber_entryPoint()
766 m_ctxt.tstack = m_ctxt.bstack;
791 m_ctxt.tstack = m_ctxt.bstack;
1026 m_ctxt.bstack = pbase; in version()
1073 m_ctxt.bstack = m_pmem + sz; in version()
1079 m_ctxt.bstack = m_pmem;
1154 assert( m_ctxt.tstack && m_ctxt.tstack == m_ctxt.bstack ); in initStack()
1155 assert( cast(size_t) m_ctxt.bstack % (void*).sizeof == 0 ); in initStack()
1258 push( cast(size_t) m_ctxt.bstack - reserve ); // EBP in version()
1625 tobj.m_curr.tstack = tobj.m_curr.bstack; in switchIn()
[all …]
|
| /dports/lang/gcc11-devel/gcc-11-20211009/libphobos/libdruntime/core/thread/ |
| H A D | fiber.d | 214 obj.m_ctxt.tstack = obj.m_ctxt.bstack; in fiber_entryPoint()
756 m_ctxt.tstack = m_ctxt.bstack;
781 m_ctxt.tstack = m_ctxt.bstack;
1016 m_ctxt.bstack = pbase; in version()
1063 m_ctxt.bstack = m_pmem + sz; in version()
1069 m_ctxt.bstack = m_pmem;
1144 assert( m_ctxt.tstack && m_ctxt.tstack == m_ctxt.bstack ); in initStack()
1145 assert( cast(size_t) m_ctxt.bstack % (void*).sizeof == 0 ); in initStack()
1248 push( cast(size_t) m_ctxt.bstack - reserve ); // EBP in version()
1615 tobj.m_curr.tstack = tobj.m_curr.bstack; in switchIn()
[all …]
|
| /dports/lang/gcc11/gcc-11.2.0/libphobos/libdruntime/core/thread/ |
| H A D | fiber.d | 214 obj.m_ctxt.tstack = obj.m_ctxt.bstack; in fiber_entryPoint()
756 m_ctxt.tstack = m_ctxt.bstack;
781 m_ctxt.tstack = m_ctxt.bstack;
1016 m_ctxt.bstack = pbase; in version()
1063 m_ctxt.bstack = m_pmem + sz; in version()
1069 m_ctxt.bstack = m_pmem;
1144 assert( m_ctxt.tstack && m_ctxt.tstack == m_ctxt.bstack ); in initStack()
1145 assert( cast(size_t) m_ctxt.bstack % (void*).sizeof == 0 ); in initStack()
1248 push( cast(size_t) m_ctxt.bstack - reserve ); // EBP in version()
1615 tobj.m_curr.tstack = tobj.m_curr.bstack; in switchIn()
[all …]
|
| /dports/misc/cxx_atomics_pic/gcc-11.2.0/libphobos/libdruntime/core/thread/ |
| H A D | fiber.d | 214 obj.m_ctxt.tstack = obj.m_ctxt.bstack; in fiber_entryPoint()
756 m_ctxt.tstack = m_ctxt.bstack;
781 m_ctxt.tstack = m_ctxt.bstack;
1016 m_ctxt.bstack = pbase; in version()
1063 m_ctxt.bstack = m_pmem + sz; in version()
1069 m_ctxt.bstack = m_pmem;
1144 assert( m_ctxt.tstack && m_ctxt.tstack == m_ctxt.bstack ); in initStack()
1145 assert( cast(size_t) m_ctxt.bstack % (void*).sizeof == 0 ); in initStack()
1248 push( cast(size_t) m_ctxt.bstack - reserve ); // EBP in version()
1615 tobj.m_curr.tstack = tobj.m_curr.bstack; in switchIn()
[all …]
|
| /dports/math/ltl2ba/ltl2ba-1.3/ |
| H A D | buchi.c | 45 BState *bstack, *bstates, *bremoved; variable
353 s = bstack->nxt; /* in the stack */ in find_bstate()
354 bstack->gstate = *state; in find_bstate()
355 bstack->final = final; in find_bstate()
358 if(s != bstack) return s; in find_bstate()
381 s->nxt = bstack->nxt; in find_bstate()
382 bstack->nxt = s; in find_bstate()
607 bstack->nxt = bstack; in mk_buchi()
660 while(bstack->nxt != bstack) { /* solves all states in the stack until it is empty */ in mk_buchi()
661 s = bstack->nxt; in mk_buchi()
[all …]
|
| /dports/biology/babel/babel-1.6/ |
| H A D | smilesto.c | 29 int i, b, rno, loss, lastatom, maxbranches, bstackptr, *bstack = NULL, ringatom[MAXSMILESRINGS]; in smilestocontab() local
67 if(!(bstack = malloc(maxbranches * sizeof(int)))) in smilestocontab()
159 bstack[bstackptr++] = lastatom; in smilestocontab()
171 lastatom = bstack[--bstackptr]; in smilestocontab()
231 if (bstack) in smilestocontab()
233 free(bstack); in smilestocontab()
234 bstack = NULL; in smilestocontab()
|
| /dports/net-p2p/bazarr/bazarr-1.0.2/libs/cloudscraper/interpreters/ |
| H A D | native.py | 116 bstack = []
120 stack.append(bstack)
121 bstack = []
123 bstack.append(i)
124 stack.append(bstack)
|
| /dports/net/py-cloudscraper/cloudscraper-1.2.58/cloudscraper/interpreters/ |
| H A D | native.py | 116 bstack = []
120 stack.append(bstack)
121 bstack = []
123 bstack.append(i)
124 stack.append(bstack)
|
| /dports/lang/gcc9/gcc-9.4.0/gcc/testsuite/gcc.c-torture/compile/ |
| H A D | pr17906.c | 4 usc_recressive_func(int cnt, int max, struct usc_bigstack_t bstack) in usc_recressive_func() argument
6 usc_recressive_func(cnt+1, max, bstack); in usc_recressive_func()
|
| /dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/testsuite/gcc.c-torture/compile/ |
| H A D | pr17906.c | 4 usc_recressive_func(int cnt, int max, struct usc_bigstack_t bstack) in usc_recressive_func() argument
6 usc_recressive_func(cnt+1, max, bstack); in usc_recressive_func()
|
| /dports/devel/avr-gcc/gcc-10.2.0/gcc/testsuite/gcc.c-torture/compile/ |
| H A D | pr17906.c | 4 usc_recressive_func(int cnt, int max, struct usc_bigstack_t bstack) in usc_recressive_func() argument
6 usc_recressive_func(cnt+1, max, bstack); in usc_recressive_func()
|
| /dports/lang/gcc11-devel/gcc-11-20211009/gcc/testsuite/gcc.c-torture/compile/ |
| H A D | pr17906.c | 4 usc_recressive_func(int cnt, int max, struct usc_bigstack_t bstack) in usc_recressive_func() argument
6 usc_recressive_func(cnt+1, max, bstack); in usc_recressive_func()
|
| /dports/lang/gcc48/gcc-4.8.5/gcc/testsuite/gcc.c-torture/compile/ |
| H A D | pr17906.c | 4 usc_recressive_func(int cnt, int max, struct usc_bigstack_t bstack) in usc_recressive_func() argument
6 usc_recressive_func(cnt+1, max, bstack); in usc_recressive_func()
|
| /dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/testsuite/gcc.c-torture/compile/ |
| H A D | pr17906.c | 4 usc_recressive_func(int cnt, int max, struct usc_bigstack_t bstack) in usc_recressive_func() argument
6 usc_recressive_func(cnt+1, max, bstack); in usc_recressive_func()
|
| /dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/testsuite/gcc.c-torture/compile/ |
| H A D | pr17906.c | 4 usc_recressive_func(int cnt, int max, struct usc_bigstack_t bstack) in usc_recressive_func() argument
6 usc_recressive_func(cnt+1, max, bstack); in usc_recressive_func()
|