Home
last modified time | relevance | path

Searched refs:top (Results 1 – 25 of 1301) sorted by relevance

12345678910>>...53

/openbsd/regress/usr.bin/mandoc/tbl/layout/
H A Dlines-nogroff.out_ascii7 vline top left:
12 hline and vline top left:
17 vline and hline top left:
22 vline top:
27 vline and hline top:
32 hline and vline top:
37 hline, vline, hline top:
42 vline top right:
57 double vline top left:
72 double vline top:
[all …]
H A Dlines.out_ascii7 hline top left:
10 hline top:
13 double hline top:
16 hline top right:
497 vline top:
587 hline top:
1277 vline top:
1385 hline top:
2348 vline top:
2474 hline top:
[all …]
/openbsd/lib/libc/gmon/
H A Dmcount.c110 top->selfpc = selfpc; in _MCOUNT_DECL()
111 top->count = 1; in _MCOUNT_DECL()
112 top->link = 0; in _MCOUNT_DECL()
115 top = &p->tos[toindex]; in _MCOUNT_DECL()
120 top->count++; in _MCOUNT_DECL()
130 if (top->link == 0) { in _MCOUNT_DECL()
142 top->selfpc = selfpc; in _MCOUNT_DECL()
143 top->count = 1; in _MCOUNT_DECL()
151 prevtop = top; in _MCOUNT_DECL()
152 top = &p->tos[top->link]; in _MCOUNT_DECL()
[all …]
/openbsd/sys/lib/libkern/
H A Dmcount.c112 top->selfpc = selfpc; in _MCOUNT_DECL()
113 top->count = 1; in _MCOUNT_DECL()
114 top->link = 0; in _MCOUNT_DECL()
117 top = &p->tos[toindex]; in _MCOUNT_DECL()
122 top->count++; in _MCOUNT_DECL()
132 if (top->link == 0) { in _MCOUNT_DECL()
144 top->selfpc = selfpc; in _MCOUNT_DECL()
145 top->count = 1; in _MCOUNT_DECL()
153 prevtop = top; in _MCOUNT_DECL()
154 top = &p->tos[top->link]; in _MCOUNT_DECL()
[all …]
/openbsd/sys/ddb/
H A Ddb_prof.c136 top->selfpc = selfpc; in db_prof_count()
137 top->count = 1; in db_prof_count()
138 top->link = 0; in db_prof_count()
141 top = &p->tos[toindex]; in db_prof_count()
146 top->count++; in db_prof_count()
156 if (top->link == 0) { in db_prof_count()
168 top->selfpc = selfpc; in db_prof_count()
169 top->count = 1; in db_prof_count()
177 prevtop = top; in db_prof_count()
178 top = &p->tos[top->link]; in db_prof_count()
[all …]
/openbsd/gnu/usr.bin/perl/ext/B/B/
H A DXref.pm275 $top = UNKNOWN;
313 $top = UNKNOWN unless $top;
314 $top->[1] = '$';
329 $top = UNKNOWN unless $top;
330 $top->[1] = '*';
350 $top = ["?", "",
355 $top = $pad[$op->targ];
356 $top = UNKNOWN unless $top;
362 $top = ["(method)", "->".$top->[1], $top->[2]];
368 process($top, "meth");
[all …]
/openbsd/usr.bin/ssh/
H A Dbitmap.c47 ret->top = 0; in bitmap_new()
66 b->top = 0; in bitmap_zero()
72 if (b->top >= b->len) in bitmap_test_bit()
107 if (offset > b->top) in bitmap_set_bit()
108 b->top = offset; in bitmap_set_bit()
117 if (b->top >= b->len) in retop()
119 while (b->top > 0 && b->d[b->top] == 0) in retop()
120 b->top--; in retop()
131 if (offset > b->top) in bitmap_clear_bit()
145 if (b->top >= b->len) in bitmap_nbits()
[all …]
/openbsd/lib/libcrypto/bn/
H A Dbn_lib.c97 a->top = 0; in BN_clear()
157 .top = 1,
187 while (a->top > 0 && a->d[a->top - 1] == 0) in bn_correct_top()
188 a->top--; in bn_correct_top()
303 a->top = b->top; in BN_copy()
333 a->top = b->top; in BN_swap()
378 if (a->top < b->top) in BN_ucmp()
380 if (a->top > b->top) in BN_ucmp()
527 t = (a->top^b->top) & condition; in BN_consttime_swap()
578 if (a->top > words || b->top > words) { in BN_swap_ct()
[all …]
H A Dbn_word.c91 for (i = a->top - 1; i >= 0; i--) { in BN_mod_word()
116 if (a->top == 0) in BN_div_word()
132 if ((a->top > 0) && (a->d[a->top - 1] == 0)) in BN_div_word()
133 a->top--; in BN_div_word()
168 if (w && i == a->top) { in BN_add_word()
169 if (!bn_wexpand(a, a->top + 1)) in BN_add_word()
171 a->top++; in BN_add_word()
220 a->top--; in BN_sub_word()
231 if (a->top) { in BN_mul_word()
237 if (!bn_wexpand(a, a->top + 1)) in BN_mul_word()
[all …]
H A Dbn_mont.c217 if (mod->top > 1) { in BN_MONT_CTX_set()
242 if (Ninv->top > 0) in BN_MONT_CTX_set()
246 if (Ninv->top > 1) in BN_MONT_CTX_set()
316 n_len = mctx->N.top; in bn_montgomery_reduce()
334 for (i = a->top; i < max; i++) in bn_montgomery_reduce()
364 r->top = n_len; in bn_montgomery_reduce()
496 if (mctx->N.top <= 1 || a->top != mctx->N.top || b->top != mctx->N.top) in bn_montgomery_multiply()
509 r->top = mctx->N.top; in bn_montgomery_multiply()
526 if (mctx->N.top <= 1 || a->top != mctx->N.top || b->top != mctx->N.top) in bn_mod_mul_montgomery()
537 if (mctx->N.top <= 1 || a->top != mctx->N.top || b->top != mctx->N.top) in bn_mod_mul_montgomery()
[all …]
H A Dbn_exp.c321 if (top > b->top) in MOD_EXP_CTIME_COPY_TO_PREBUF()
379 b->top = top; in MOD_EXP_CTIME_COPY_FROM_PREBUF()
399 int top; in BN_mod_exp_mont_consttime() local
413 top = m->top; in BN_mod_exp_mont_consttime()
453 ((2*top) > numPowers ? (2*top) : numPowers)); in BN_mod_exp_mont_consttime()
462 tmp.top = am.top = 0; in BN_mod_exp_mont_consttime()
475 tmp.top = top; in BN_mod_exp_mont_consttime()
504 for (i = am.top; i < top; i++) in BN_mod_exp_mont_consttime()
506 for (i = tmp.top; i < top; i++) in BN_mod_exp_mont_consttime()
570 tmp.top = top; in BN_mod_exp_mont_consttime()
[all …]
/openbsd/gnu/usr.bin/gcc/gcc/
H A Dgmon.c236 top = &tos[toindex]; in mcount()
237 top->selfpc = selfpc; in mcount()
238 top->count = 1; in mcount()
239 top->link = 0; in mcount()
242 top = &tos[toindex]; in mcount()
247 top->count++; in mcount()
257 if (top->link == 0) { in mcount()
270 top->count = 1; in mcount()
278 prevtop = top; in mcount()
279 top = &tos[top->link]; in mcount()
[all …]
H A Dcppexp.c830 top = reduce (pfile, top, op.op);
923 top[-1].value = num_unary_op (pfile, top->value, top->op);
934 top->value, top->op);
942 = num_inequality_op (pfile, top[-1].value, top->value, top->op);
948 = num_equality_op (pfile, top[-1].value, top->value, top->op);
955 = num_bitwise_op (pfile, top[-1].value, top->value, top->op);
959 top[-1].value = num_mul (pfile, top[-1].value, top->value);
965 top->value, top->op);
997 top->value = top[1].value;
1005 top->value = top[1].value;
[all …]
/openbsd/gnu/gcc/libcpp/
H A Dexpr.c838 top = reduce (pfile, top, op.op); in _cpp_parse_expr()
928 top[-1].value = num_unary_op (pfile, top->value, top->op); in reduce()
937 top->value, top->op); in reduce()
945 = num_inequality_op (pfile, top[-1].value, top->value, top->op); in reduce()
951 = num_equality_op (pfile, top[-1].value, top->value, top->op); in reduce()
958 = num_bitwise_op (pfile, top[-1].value, top->value, top->op); in reduce()
962 top[-1].value = num_mul (pfile, top[-1].value, top->value); in reduce()
968 top->value, top->op); in reduce()
1000 top->value = top[1].value; in reduce()
1008 top->value = top[1].value; in reduce()
[all …]
/openbsd/gnu/gcc/gcc/config/i386/
H A Dgmon-sol2.c307 top = &tos[toindex]; in internal_mcount()
308 top->selfpc = selfpc; in internal_mcount()
309 top->count = 1; in internal_mcount()
310 top->link = 0; in internal_mcount()
313 top = &tos[toindex]; in internal_mcount()
318 top->count++; in internal_mcount()
328 if (top->link == 0) { in internal_mcount()
341 top->count = 1; in internal_mcount()
349 prevtop = top; in internal_mcount()
350 top = &tos[top->link]; in internal_mcount()
[all …]
/openbsd/gnu/gcc/gcc/config/sparc/
H A Dgmon-sol2.c332 top = &tos[toindex]; in internal_mcount()
333 top->selfpc = selfpc; in internal_mcount()
334 top->count = 1; in internal_mcount()
335 top->link = 0; in internal_mcount()
338 top = &tos[toindex]; in internal_mcount()
343 top->count++; in internal_mcount()
353 if (top->link == 0) { in internal_mcount()
366 top->count = 1; in internal_mcount()
374 prevtop = top; in internal_mcount()
375 top = &tos[top->link]; in internal_mcount()
[all …]
/openbsd/gnu/usr.bin/gcc/gcc/config/i386/
H A Dgmon-sol2.c313 top = &tos[toindex]; in internal_mcount()
314 top->selfpc = selfpc; in internal_mcount()
315 top->count = 1; in internal_mcount()
316 top->link = 0; in internal_mcount()
319 top = &tos[toindex]; in internal_mcount()
324 top->count++; in internal_mcount()
334 if (top->link == 0) { in internal_mcount()
347 top->count = 1; in internal_mcount()
355 prevtop = top; in internal_mcount()
356 top = &tos[top->link]; in internal_mcount()
[all …]
/openbsd/gnu/usr.bin/gcc/gcc/config/sparc/
H A Dgmon-sol2.c333 top = &tos[toindex];
334 top->selfpc = selfpc;
335 top->count = 1;
336 top->link = 0;
339 top = &tos[toindex];
344 top->count++;
354 if (top->link == 0) {
367 top->count = 1;
375 prevtop = top;
376 top = &tos[top->link];
[all …]
/openbsd/gnu/llvm/compiler-rt/lib/msan/
H A Dmsan_thread.cpp27 stack_.top = stack_.bottom + stack_size; in SetThreadStackAndTls()
48 CHECK(MEM_IS_APP(stack_.top - 1)); in Init()
83 return {stack_.bottom, stack_.top}; in GetStackBounds()
89 return {next_stack_.bottom, next_stack_.top}; in GetStackBounds()
90 return {stack_.bottom, stack_.top}; in GetStackBounds()
93 uptr MsanThread::stack_top() { return GetStackBounds().top; } in stack_top()
99 return addr >= bounds.bottom && addr < bounds.top; in AddrIsInStack()
105 next_stack_.top = bottom + size; in StartSwitchFiber()
114 *size_old = stack_.top - stack_.bottom; in FinishSwitchFiber()
116 stack_.top = next_stack_.top; in FinishSwitchFiber()
[all …]
/openbsd/lib/libcbor/src/cbor/internal/
H A Dbuilder_callbacks.c32 switch (ctx->stack->top->item->type) { in _cbor_builder_append()
41 CBOR_ASSERT(ctx->stack->top->subitems > 0); in _cbor_builder_append()
50 ctx->stack->top->subitems--; in _cbor_builder_append()
51 if (ctx->stack->top->subitems == 0) { in _cbor_builder_append()
69 if (ctx->stack->top->subitems % 2) { in _cbor_builder_append()
86 CBOR_ASSERT(ctx->stack->top->subitems > 0); in _cbor_builder_append()
87 ctx->stack->top->subitems--; in _cbor_builder_append()
88 if (ctx->stack->top->subitems == 0) { in _cbor_builder_append()
94 ctx->stack->top->subitems ^= in _cbor_builder_append()
100 CBOR_ASSERT(ctx->stack->top->subitems == 1); in _cbor_builder_append()
[all …]
H A Dstack.c11 return (struct _cbor_stack){.top = NULL, .size = 0}; in _cbor_stack_init()
15 struct _cbor_stack_record *top = stack->top; in _cbor_stack_pop() local
16 stack->top = stack->top->lower; in _cbor_stack_pop()
17 _cbor_free(top); in _cbor_stack_pop()
29 *new_top = (struct _cbor_stack_record){stack->top, item, subitems}; in _cbor_stack_push()
30 stack->top = new_top; in _cbor_stack_push()
/openbsd/gnu/gcc/gcc/
H A Dreg-stack.c368 int top; in straighten_stack() local
379 for (top = temp_stack.top = regstack->top; top >= 0; top--) in straighten_stack()
380 temp_stack.reg[top] = FIRST_STACK_REG + temp_stack.top - top; in straighten_stack()
390 int top = regstack->top; in pop_stack() local
2232 int top = regstack->top; in subst_stack_regs() local
2381 for (reg = old->top; reg > new->top; reg--) in change_stack()
2418 for (reg = old->top; reg > new->top; reg--) in change_stack()
2463 new->top = old->top; in change_stack()
2477 gcc_assert (old->top == new->top); in change_stack()
2595 bi->stack_in.top = top; in convert_regs_entry()
[all …]
/openbsd/gnu/usr.bin/perl/cpan/Test-Simple/t/Test2/modules/API/
H A DStack.t54 is($stack->top, $hub, "got the hub");
64 ok(my $top = $stack->top, "Generated a top hub");
65 is($top->ipc, test2_ipc, "Used sync's ipc");
66 ok($top->format, 'Got formatter');
68 is($stack->top, $stack->top, "do not generate a new top if there is already a top");
71 is($stack->top, $new, "new one is on top");
72 is($new->ipc, $top->ipc, "inherited ipc");
73 is($new->format, $top->format, "inherited formatter");
/openbsd/gnu/llvm/clang/www/analyzer/
H A Dcontent.css14 h1 { padding-top:0px; margin-top:0px;}
15 h2 { color:#333333; padding-top:0.5em; }
16 h3 { padding-top: 0.5em; margin-bottom: -0.25em; color:#2d58b7 }
49 tr { vertical-align:top }
55 border-top: 2px solid #cccccc;
61 table.options { margin-left:0px; margin-top:20px; margin-bottom:20px }
69 margin:0px; margin-top:20px; margin-bottom:20px;
78 border-top: 2px solid #cccccc;
91 table.checkers div.example { border-top:1px #cccccc dashed; width:100%; padding-top: 5px; margin-to…
92 table.checkers div.example:first-child { border-top:none; padding-top: 0px; margin-top: 0px }
[all …]
/openbsd/gnu/usr.bin/perl/cpan/Test-Simple/t/Test2/behavior/
H A DSubtest_buffer_formatter.t31 my $hub = test2_stack->top;
37 my $hub = test2_stack->top;
44 test2_stack->top->format(bless {}, 'Formatter::Hide');
46 my $hub = test2_stack->top;
52 my $hub = test2_stack->top;
59 test2_stack->top->format(bless {}, 'Formatter::Show');
61 my $hub = test2_stack->top;
67 my $hub = test2_stack->top;
75 my $hub = test2_stack->top;
80 test2_stack->top->format(bless {}, 'Formatter::NA');
[all …]

12345678910>>...53