Home
last modified time | relevance | path

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

12345678910>>...18

/dragonfly/lib/libc/gmon/
H A Dmcount.c91 top->selfpc = selfpc; in _MCOUNT_DECL()
92 top->count = 1; in _MCOUNT_DECL()
93 top->link = 0; in _MCOUNT_DECL()
96 top = &p->tos[toindex]; in _MCOUNT_DECL()
101 top->count++; in _MCOUNT_DECL()
111 if (top->link == 0) { in _MCOUNT_DECL()
123 top->selfpc = selfpc; in _MCOUNT_DECL()
124 top->count = 1; in _MCOUNT_DECL()
132 prevtop = top; in _MCOUNT_DECL()
133 top = &p->tos[top->link]; in _MCOUNT_DECL()
[all …]
/dragonfly/contrib/gcc-4.7/libcpp/
H A Dexpr.c1265 top[-1].loc = top->loc; in reduce()
1275 top[-1].loc = top->loc; in reduce()
1284 top[-1].loc = top->loc; in reduce()
1291 top[-1].loc = top->loc; in reduce()
1299 top[-1].loc = top->loc; in reduce()
1304 top[-1].loc = top->loc; in reduce()
1310 top->value, top->op, top->loc); in reduce()
1311 top[-1].loc = top->loc; in reduce()
1323 top->loc = top[1].loc; in reduce()
1335 top->loc = top[1].loc; in reduce()
[all …]
/dragonfly/crypto/libressl/crypto/bn/
H A Dbn_lib.c105 ret->top = 0; in BN_new()
126 a->top = 0; in BN_clear()
363 r->top = b->top; in bn_dup_expand()
489 a->top = b->top; in BN_copy()
514 a->top = b->top; in BN_swap()
758 i = a->top - b->top; in BN_ucmp()
805 if (a->top > b->top) in BN_cmp()
807 if (a->top < b->top) in BN_cmp()
981 t = (a->top^b->top) & condition; in BN_consttime_swap()
1031 if (a->top > words || b->top > words) { in BN_swap_ct()
[all …]
H A Dbn_exp.c575 if (top > b->top) in MOD_EXP_CTIME_COPY_TO_PREBUF()
633 b->top = top; in MOD_EXP_CTIME_COPY_FROM_PREBUF()
653 int top; in BN_mod_exp_mont_consttime() local
670 top = m->top; in BN_mod_exp_mont_consttime()
709 ((2*top) > numPowers ? (2*top) : numPowers)); in BN_mod_exp_mont_consttime()
718 tmp.top = am.top = 0; in BN_mod_exp_mont_consttime()
731 tmp.top = top; in BN_mod_exp_mont_consttime()
763 for (i = am.top; i < top; i++) in BN_mod_exp_mont_consttime()
765 for (i = tmp.top; i < top; i++) in BN_mod_exp_mont_consttime()
829 tmp.top = top; in BN_mod_exp_mont_consttime()
[all …]
H A Dbn_shift.c79 r->top = a->top; in BN_lshift1()
87 for (i = 0; i < a->top; i++) { in BN_lshift1()
94 r->top++; in BN_lshift1()
113 i = a->top; in BN_rshift1()
131 r->top = j; in BN_rshift1()
159 t[a->top + nw] = 0; in BN_lshift()
161 for (i = a->top - 1; i >= 0; i--) in BN_lshift()
172 r->top = a->top + nw + 1; in BN_lshift()
196 if (nw >= a->top || a->top == 0) { in BN_rshift()
212 j = a->top - nw; in BN_rshift()
[all …]
H A Dbn_word.c92 for (i = a->top - 1; i >= 0; i--) { in BN_mod_word()
117 if (a->top == 0) in BN_div_word()
126 for (i = a->top - 1; i >= 0; i--) { in BN_div_word()
134 if ((a->top > 0) && (a->d[a->top - 1] == 0)) in BN_div_word()
135 a->top--; in BN_div_word()
168 if (w && i == a->top) { in BN_add_word()
171 a->top++; in BN_add_word()
204 if ((a->top == 1) && (a->d[0] < w)) { in BN_sub_word()
221 a->top--; in BN_sub_word()
233 if (a->top) { in BN_mul_word()
[all …]
H A Dbn_div.c133 if (num->top > 0 && num->d[num->top - 1] == 0) { in BN_div_internal()
189 if (snum->top <= sdiv->top + 1) { in BN_div_internal()
192 for (i = snum->top; i < sdiv->top + 2; i++) in BN_div_internal()
194 snum->top = sdiv->top + 2; in BN_div_internal()
198 snum->d[snum->top] = 0; in BN_div_internal()
199 snum->top ++; in BN_div_internal()
203 div_n = sdiv->top; in BN_div_internal()
204 num_n = snum->top; in BN_div_internal()
211 wnum.top = div_n; in BN_div_internal()
244 res->top--; in BN_div_internal()
[all …]
H A Dbn_rand.c122 bnrand(int pseudorand, BIGNUM *rnd, int bits, int top, int bottom) in bnrand() argument
132 if (bits < 0 || (bits == 1 && top > 0)) { in bnrand()
174 if (top > 0) { in bnrand()
182 if (top == 0) in bnrand()
198 BN_rand(BIGNUM *rnd, int bits, int top, int bottom) in BN_rand() argument
200 return bnrand(0, rnd, bits, top, bottom); in BN_rand()
204 BN_pseudo_rand(BIGNUM *rnd, int bits, int top, int bottom) in BN_pseudo_rand() argument
206 return bnrand(1, rnd, bits, top, bottom); in BN_pseudo_rand()
211 BN_bntest_rand(BIGNUM *rnd, int bits, int top, int bottom) in BN_bntest_rand() argument
213 return bnrand(2, rnd, bits, top, bottom); in BN_bntest_rand()
H A Dbn_mont.c139 if (num > 1 && a->top == num && b->top == num) { in BN_mod_mul_montgomery()
144 r->top = num; in BN_mod_mul_montgomery()
193 nl = n->top; in BN_from_montgomery_word()
195 ret->top = 0; in BN_from_montgomery_word()
212 memset(&(rp[r->top]), 0, (max - r->top) * sizeof(BN_ULONG)); in BN_from_montgomery_word()
215 r->top = max; in BN_from_montgomery_word()
231 ret->top = nl; in BN_from_montgomery_word()
406 tmod.top = 0; in BN_MONT_CTX_set()
408 tmod.top = 1; in BN_MONT_CTX_set()
410 tmod.top = 2; in BN_MONT_CTX_set()
[all …]
H A Dbn_gf2m.c331 if (a->top < b->top) { in BN_GF2m_add()
349 r->top = at->top; in BN_GF2m_add()
388 r->top = a->top; in BN_GF2m_mod_arr()
504 zlen = a->top + b->top + 4; in BN_GF2m_mod_mul_arr()
507 s->top = zlen; in BN_GF2m_mod_mul_arr()
587 s->top = 2 * a->top; in BN_GF2m_mod_sqr_arr()
701 top = p->top; in BN_GF2m_mod_inv() local
707 for (i = u->top; i < top; i++) in BN_GF2m_mod_inv()
709 u->top = top; in BN_GF2m_mod_inv()
716 b->top = top; in BN_GF2m_mod_inv()
[all …]
H A Dbn_add.c107 if (a->top < b->top) { in BN_uadd()
114 max = a->top; in BN_uadd()
115 min = b->top; in BN_uadd()
121 r->top = max; in BN_uadd()
139 r->top += carry; in BN_uadd()
156 max = a->top; in BN_usub()
157 min = b->top; in BN_usub()
187 r->top = max; in BN_usub()
H A Dbn_nist.c291 .top = BN_NIST_192_TOP,
307 .top = BN_NIST_224_TOP,
323 .top = BN_NIST_256_TOP,
339 .top = BN_NIST_384_TOP,
355 .top = BN_NIST_521_TOP,
407 for (i = 0; i < top; i++) in nist_cp_bn_0()
472 int top = a->top; in BN_nist_mod_192() local
621 int top = a->top; in BN_nist_mod_224() local
805 int top = a->top; in BN_nist_mod_256() local
1037 int top = a->top; in BN_nist_mod_384() local
[all …]
/dragonfly/crypto/openssh/
H A Dbitmap.c49 ret->top = 0; in bitmap_new()
68 b->top = 0; in bitmap_zero()
74 if (b->top >= b->len) in bitmap_test_bit()
109 if (offset > b->top) in bitmap_set_bit()
110 b->top = offset; in bitmap_set_bit()
119 if (b->top >= b->len) in retop()
121 while (b->top > 0 && b->d[b->top] == 0) in retop()
122 b->top--; in retop()
133 if (offset > b->top) in bitmap_clear_bit()
147 if (b->top >= b->len) in bitmap_nbits()
[all …]
/dragonfly/contrib/gcc-8.0/libcpp/
H A Dexpr.c1494 top[-1].loc = top->loc; in reduce()
1504 top[-1].loc = top->loc; in reduce()
1513 top[-1].loc = top->loc; in reduce()
1520 top[-1].loc = top->loc; in reduce()
1528 top[-1].loc = top->loc; in reduce()
1533 top[-1].loc = top->loc; in reduce()
1539 top->value, top->op, top->loc); in reduce()
1540 top[-1].loc = top->loc; in reduce()
1552 top->loc = top[1].loc; in reduce()
1564 top->loc = top[1].loc; in reduce()
[all …]
/dragonfly/contrib/gcc-4.7/gcc/
H A Dreg-stack.c363 int top; in straighten_stack() local
374 for (top = temp_stack.top = regstack->top; top >= 0; top--) in straighten_stack()
375 temp_stack.reg[top] = FIRST_STACK_REG + temp_stack.top - top; in straighten_stack()
385 int top = regstack->top; in pop_stack() local
2306 int top = regstack->top; in subst_stack_regs() local
2467 for (reg = old->top; reg > new_stack->top; reg--) in change_stack()
2504 for (reg = old->top; reg > new_stack->top; reg--) in change_stack()
2549 new_stack->top = old->top; in change_stack()
2561 gcc_assert (old->top == new_stack->top); in change_stack()
2679 bi->stack_in.top = top; in convert_regs_entry()
[all …]
/dragonfly/contrib/gcc-8.0/gcc/
H A Dreg-stack.c361 int top; in straighten_stack() local
372 for (top = temp_stack.top = regstack->top; top >= 0; top--) in straighten_stack()
373 temp_stack.reg[top] = FIRST_STACK_REG + temp_stack.top - top; in straighten_stack()
383 int top = regstack->top; in pop_stack() local
2387 int top = regstack->top; in subst_stack_regs() local
2549 for (reg = old->top; reg > new_stack->top; reg--) in change_stack()
2586 for (reg = old->top; reg > new_stack->top; reg--) in change_stack()
2631 new_stack->top = old->top; in change_stack()
2643 gcc_assert (old->top == new_stack->top); in change_stack()
2769 bi->stack_in.top = top; in convert_regs_entry()
[all …]
/dragonfly/contrib/gcc-4.7/libgcc/config/
H A Dgmon-sol2.c307 struct tostruct *top; in internal_mcount() local
367 top = &tos[toindex]; in internal_mcount()
368 top->selfpc = selfpc; in internal_mcount()
369 top->count = 1; in internal_mcount()
370 top->link = 0; in internal_mcount()
373 top = &tos[toindex]; in internal_mcount()
376 top->count++; in internal_mcount()
393 top->count = 1; in internal_mcount()
399 prevtop = top; in internal_mcount()
400 top = &tos[top->link]; in internal_mcount()
[all …]
/dragonfly/crypto/libressl/crypto/err/
H A Derr.c737 es->top = (es->top + 1) % ERR_NUM_ERRORS; in ERR_put_error()
831 if (inc && top) { in get_error_values()
846 if (top) in get_error_values()
1066 ret->top = 0; in ERR_get_state()
1101 i = es->top; in ERR_set_error_data()
1178 es->top -= 1; in ERR_pop_to_mark()
1179 if (es->top == -1) in ERR_pop_to_mark()
1193 int top; in err_clear_last_constant_time() local
1199 top = es->top; in err_clear_last_constant_time()
1203 es->err_file[top] = (const char *)((uintptr_t)es->err_file[top] & in err_clear_last_constant_time()
[all …]
/dragonfly/contrib/ncurses/ncurses/base/
H A Dlib_scroll.c52 int const top, in NCURSES_EXPORT()
62 (void *) win, n, (long) top, (long) bottom)); in NCURSES_EXPORT()
64 if (top < 0 in NCURSES_EXPORT()
65 || bottom < top in NCURSES_EXPORT()
81 #define BottomLimit(n) ((n) >= 0 && (n) >= top) in NCURSES_EXPORT()
86 limit = top - n; in NCURSES_EXPORT()
95 for (line = top; line < limit && TopLimit(line); line++) { in NCURSES_EXPORT()
106 for (line = top; line <= limit && TopLimit(line); line++) { in NCURSES_EXPORT()
119 touchline(win, top, bottom - top + 1); in NCURSES_EXPORT()
H A Dlib_scrreg.c47 wsetscrreg(WINDOW *win, int top, int bottom) in NCURSES_EXPORT()
49 T((T_CALLED("wsetscrreg(%p,%d,%d)"), (void *) win, top, bottom)); in NCURSES_EXPORT()
52 top >= 0 && top <= win->_maxy && in NCURSES_EXPORT()
54 bottom > top) { in NCURSES_EXPORT()
55 win->_regtop = (NCURSES_SIZE_T) top; in NCURSES_EXPORT()
/dragonfly/usr.bin/window/
H A Dwwscroll.c46 int top; in wwscroll() local
51 top = w->ww_b.t - n; in wwscroll()
52 if (top > w->ww_w.t) in wwscroll()
53 top = w->ww_w.t; in wwscroll()
54 else if (top + w->ww_b.nr < w->ww_w.b) in wwscroll()
55 top = w->ww_w.b - w->ww_b.nr; in wwscroll()
56 n = abs(top - w->ww_b.t); in wwscroll()
65 w->ww_buf -= top - w->ww_b.t; in wwscroll()
66 w->ww_b.t = top; in wwscroll()
67 w->ww_b.b = top + w->ww_b.nr; in wwscroll()
/dragonfly/contrib/dialog/
H A Darrows.c103 int top, in dlg_draw_arrows2() argument
119 if (dialog_vars.title && is_toplevel && (top - getbegy(win)) < MARGIN) { in dlg_draw_arrows2()
127 (void) wmove(win, top, x); in dlg_draw_arrows2()
137 mouse_mkbutton(top, x - 1, 6, KEY_PPAGE); in dlg_draw_arrows2()
164 int top, in dlg_draw_scrollbar() argument
206 int all_high = (bottom - top - 1); in dlg_draw_scrollbar()
223 wmove(win, top + 1, right); in dlg_draw_scrollbar()
235 wmove(win, top + 1 + bar_y, right); in dlg_draw_scrollbar()
251 top, in dlg_draw_scrollbar()
265 int top, in dlg_draw_arrows() argument
[all …]
/dragonfly/usr.bin/mail/
H A Dnames.c92 top = NULL; in extract()
98 top = t; in extract()
105 return (top); in extract()
115 char *cp, *top; in detract() local
136 cp = top; in detract()
148 return (top); in detract()
285 top = names; in outof()
418 return (top); in outof()
570 top = (char **)salloc((t + extra) * sizeof(*top)); in unpack()
571 ap = top; in unpack()
[all …]
/dragonfly/lib/libc/db/recno/
H A Drec_get.c113 __rec_fpipe(BTREE *t, recno_t top) in __rec_fpipe() argument
130 for (nrec = t->bt_nrecs; nrec < top;) { in __rec_fpipe()
147 if (nrec < top) { in __rec_fpipe()
165 __rec_vpipe(BTREE *t, recno_t top) in __rec_vpipe() argument
175 for (nrec = t->bt_nrecs; nrec < top; ++nrec) { in __rec_vpipe()
202 if (nrec < top) { in __rec_vpipe()
220 __rec_fmap(BTREE *t, recno_t top) in __rec_fmap() argument
238 for (nrec = t->bt_nrecs; nrec < top; ++nrec) { in __rec_fmap()
266 __rec_vmap(BTREE *t, recno_t top) in __rec_vmap() argument
277 for (nrec = t->bt_nrecs; nrec < top; ++nrec) { in __rec_vmap()
/dragonfly/contrib/gcc-8.0/gcc/config/i386/
H A Dx86-tune-sched-atom.c125 rtx_insn *top = ready[n_ready - 1]; in swap_top_of_ready_list() local
137 if (!NONDEBUG_INSN_P (top)) in swap_top_of_ready_list()
139 if (!NONJUMP_INSN_P (top)) in swap_top_of_ready_list()
145 set = single_set (top); in swap_top_of_ready_list()
152 if (INSN_PRIORITY_KNOWN (top) && INSN_PRIORITY_KNOWN (next)) in swap_top_of_ready_list()
154 if (INSN_PRIORITY (top) != INSN_PRIORITY (next)) in swap_top_of_ready_list()
157 FOR_EACH_DEP (top, SD_LIST_RES_BACK, sd_it, dep) in swap_top_of_ready_list()
180 memory1 = get_attr_memory (top); in swap_top_of_ready_list()

12345678910>>...18