Searched refs:top (Results 26 - 50 of 493) sorted by relevance

1234567891011>>

/freebsd-12-stable/contrib/lua/src/
H A Dlapi.c64 api_check(L, idx <= ci->top - (ci->func + 1), "unacceptable index");
65 if (o >= L->top) return NONVALIDVALUE;
69 api_check(L, idx != 0 && -idx <= L->top - (ci->func + 1), "invalid index");
70 return L->top + idx;
102 if (L->stack_last - L->top > n) /* stack large enough? */
105 int inuse = cast_int(L->top - L->stack) + EXTRA_STACK;
111 if (res && ci->top < L->top + n)
112 ci->top = L->top
[all...]
H A Dldo.c102 setobjs2s(L, oldtop, L->top - 1); /* error message on current top */
106 L->top = oldtop + 1;
119 setobjs2s(L, g->mainthread->top++, L->top - 1); /* copy error obj. */
124 seterrorobj(L, errcode, L->top); /* assume EXTRA_STACK */
125 if (L->ci->top < L->top)
126 L->ci->top = L->top; /* pushin
257 ptrdiff_t top = savestack(L, L->top); local
[all...]
/freebsd-12-stable/sys/net/altq/
H A Daltq_cdnr.c126 * top level input function called from ip_input.
136 struct top_cdnr *top; local
146 top = ifp->if_snd.altq_cdnr;
162 cb = acc_classify(&top->tc_classifier, m, af);
167 tca = &top->tc_block.cb_action;
170 PKTCNTR_ADD(&top->tc_cnts[tca->tca_code], pktinfo.pkt_len);
210 struct top_cdnr *top; local
214 LIST_FOREACH(top, &tcb_list, tc_next)
215 if (top->tc_ifq->altq_ifp == ifp)
216 return (top);
422 struct top_cdnr *top; local
873 struct top_cdnr *top; local
890 struct top_cdnr *top; local
902 struct top_cdnr *top; local
920 struct top_cdnr *top; local
939 struct top_cdnr *top; local
956 struct top_cdnr *top; local
968 struct top_cdnr *top; local
1015 struct top_cdnr *top; local
1078 struct top_cdnr *top; local
1125 struct top_cdnr *top; local
1225 struct top_cdnr *top; local
1251 struct top_cdnr *top; local
[all...]
/freebsd-12-stable/contrib/processor-trace/libipt/internal/include/
H A Dpt_retstack.h49 /* The top of the stack. */
50 uint8_t top; member in struct:pt_retstack
/freebsd-12-stable/contrib/gdb/gdb/
H A Devent-top.h1 /* Definitions used by event-top.c, for GDB, the GNU debugger.
31 one on top of the stack. A stack is necessary because of cases in
38 as part of a command and not as part of the top level command loop.
51 stack: the usual one, w/o prefix and suffix (at top - 1), and the
52 'composite' one with prefix and suffix added (at top). At this
54 to 0 or 1, pops the top of the stack, resetting its size to one
70 int top; member in struct:prompts
73 #define PROMPT(X) the_prompts.prompt_stack[the_prompts.top + X].prompt
74 #define PREFIX(X) the_prompts.prompt_stack[the_prompts.top + X].prefix
75 #define SUFFIX(X) the_prompts.prompt_stack[the_prompts.top
[all...]
/freebsd-12-stable/usr.sbin/devctl/
H A Ddevctl.c65 SET_DECLARE(DEVCTL_DATASET(top), struct devctl_command);
67 DEVCTL_TABLE(top, clear);
68 DEVCTL_TABLE(top, set);
117 DEVCTL_COMMAND(top, help, help);
129 DEVCTL_COMMAND(top, attach, attach);
163 DEVCTL_COMMAND(top, detach, detach);
197 DEVCTL_COMMAND(top, disable, disable);
209 DEVCTL_COMMAND(top, enable, enable);
221 DEVCTL_COMMAND(top, suspend, suspend);
233 DEVCTL_COMMAND(top, resum
[all...]
/freebsd-12-stable/sys/crypto/aesni/
H A Daesni_wrap.c115 struct blocks8 *top; local
122 top = (struct blocks8 *)to;
126 top->blk[0] = tout[0];
127 top->blk[1] = tout[1];
128 top->blk[2] = tout[2];
129 top->blk[3] = tout[3];
130 top->blk[4] = tout[4];
131 top->blk[5] = tout[5];
132 top->blk[6] = tout[6];
133 top
155 struct blocks8 *top; local
216 struct blocks8 *top; local
333 __m128i *top; local
[all...]
/freebsd-12-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/lua/
H A Dlapi.c58 api_check(L, idx <= ci->top - (ci->func + 1), "unacceptable index");
59 if (o >= L->top) return NONVALIDVALUE;
63 api_check(L, idx != 0 && -idx <= L->top - (ci->func + 1), "invalid index");
64 return L->top + idx;
95 if (L->stack_last - L->top > size) /* stack large enough? */
98 int inuse = cast_int(L->top - L->stack) + EXTRA_STACK;
104 if (res && ci->top < L->top + size)
105 ci->top = L->top
[all...]
H A Dlvm.c87 ci->func = L->top - 1; /* protect stack below results */
96 setobj2s(L, L->top++, f); /* push function */
97 setobj2s(L, L->top++, p1); /* 1st argument */
98 setobj2s(L, L->top++, p2); /* 2nd argument */
100 setobj2s(L, L->top++, p3); /* 3rd argument */
102 luaD_call(L, L->top - (4 - hasres), hasres, isLua(L->ci));
105 setobjs2s(L, p3, --L->top);
202 if (!call_binTM(L, p1, p2, L->top, event))
205 return !l_isfalse(L->top);
288 callTM(L, tm, t1, t2, L->top,
296 StkId top = L->top; local
509 StkId top = L->top - 1; /* top when 'call_binTM' was called */ local
[all...]
H A Dldo.c105 setobjs2s(L, oldtop, L->top - 1); /* error message on current top */
109 L->top = oldtop + 1;
121 setobjs2s(L, G(L)->mainthread->top++, L->top - 1); /* copy error obj. */
155 L->top = (L->top - oldstack) + L->stack;
159 ci->top = (ci->top - oldstack) + L->stack;
190 int needed = cast_int(L->top
231 ptrdiff_t top = savestack(L, L->top); local
[all...]
/freebsd-12-stable/lib/libc/sparc64/fpu/
H A Dfpu_subr.c144 u_int m0, m1, m2, m3, top, sup, nrm; local
175 for (rsh = 1, top = m0 >> 1; top >= sup; rsh++) /* XXX slow */
176 top >>= 1;
182 m0 = top;
188 for (lsh = 1, top = m0 << 1; top < nrm; lsh++) /* XXX slow */
189 top <<= 1;
192 m0 = top | (m1 >> rsh);
/freebsd-12-stable/sys/powerpc/fpu/
H A Dfpu_subr.c144 u_int m0, m1, m2, m3, top, sup, nrm; local
175 for (rsh = 1, top = m0 >> 1; top >= sup; rsh++) /* XXX slow */
176 top >>= 1;
182 m0 = top;
188 for (lsh = 1, top = m0 << 1; top < nrm; lsh++) /* XXX slow */
189 top <<= 1;
192 m0 = top | (m1 >> rsh);
/freebsd-12-stable/crypto/openssl/crypto/bn/
H A Dbn_add.c85 if (a->top < b->top) {
92 max = a->top;
93 min = b->top;
99 r->top = max;
117 r->top += carry;
134 max = a->top;
135 min = b->top;
165 r->top = max;
H A Dbn_lib.c156 int i = a->top - 1;
179 int i = a->top - 1;
286 assert(b->top <= words);
287 if (b->top > 0)
288 memcpy(a, b->d, sizeof(*a) * b->top);
341 bn_words = BN_get_flags(b, BN_FLG_CONSTTIME) ? b->dmax : b->top;
348 if (b->top > 0)
352 a->top = b->top;
377 tmp_top = a->top;
[all...]
H A Dbn_rand.c21 static int bnrand(BNRAND_FLAG flag, BIGNUM *rnd, int bits, int top, int bottom) argument
27 if (top != BN_RAND_TOP_ANY || bottom != BN_RAND_BOTTOM_ANY)
32 if (bits < 0 || (bits == 1 && top > 0))
45 /* make a random number and set the top and bottom bits */
69 if (top >= 0) {
70 if (top) {
97 int BN_rand(BIGNUM *rnd, int bits, int top, int bottom) argument
99 return bnrand(NORMAL, rnd, bits, top, bottom);
102 int BN_bntest_rand(BIGNUM *rnd, int bits, int top, int bottom) argument
104 return bnrand(TESTING, rnd, bits, top, botto
107 BN_priv_rand(BIGNUM *rnd, int bits, int top, int bottom) argument
187 BN_pseudo_rand(BIGNUM *rnd, int bits, int top, int bottom) argument
[all...]
H A Dbn_mont.c42 int num = mont->N.top;
45 if (num > 1 && a->top == num && b->top == num) {
50 r->top = num;
57 if ((a->top + b->top) > 2 * num)
96 nl = n->top;
98 ret->top = 0;
110 /* clear the top words of T */
111 for (rtop = r->top,
[all...]
/freebsd-12-stable/sys/kern/
H A Dsubr_smp.c604 struct cpu_group *top; local
612 top = smp_topo_1level(CG_SHARE_NONE, 2, 0);
616 top = smp_topo_none();
620 top = smp_topo_1level(CG_SHARE_L2, 2, 0);
624 top = smp_topo_1level(CG_SHARE_L3, 4, 0);
628 top = smp_topo_2level(CG_SHARE_NONE, 2, CG_SHARE_L2, 2, 0);
632 top = smp_topo_1level(CG_SHARE_L1, 2, CG_FLAG_HTT);
636 top = smp_topo_2level(CG_SHARE_L3, 4, CG_SHARE_L2, 8,
641 top = cpu_topo();
647 if (top
680 struct cpu_group *top; local
730 struct cpu_group *top; local
749 struct cpu_group *top; local
776 smp_topo_find(struct cpu_group *top, int cpu) argument
1017 topo_next_node(struct topo_node *top, struct topo_node *node) argument
1039 topo_next_nonchild_node(struct topo_node *top, struct topo_node *node) argument
[all...]
/freebsd-12-stable/lib/libc/db/btree/
H A Dbt_conv.c64 indx_t i, top; local
83 top = NEXTINDEX(h);
85 for (i = 0; i < top; i++) {
100 for (i = 0; i < top; i++) {
129 indx_t i, top; local
141 top = NEXTINDEX(h);
143 for (i = 0; i < top; i++) {
158 for (i = 0; i < top; i++) {
/freebsd-12-stable/contrib/gcc/
H A Dreg-stack.c48 the current top of stack to the desired register. A reference to
49 FIRST_STACK_REG references the top of stack, FIRST_STACK_REG + 1,
58 will replace the existing stack top, not push a new value.
68 the top of the register stack. If there is no REG_DEAD note, then the
69 insn represents a "dup" or a push of the current top of stack onto the
94 If any non-popped input is closer to the top of the reg-stack than
99 All implicitly popped input regs must be closer to the top of
132 It makes no sense to push anywhere but the top of the reg-stack.
134 Output operands must start at the top of the reg-stack: output
194 that REG[TOP] is the top o
203 int top; /* index to top stack element */ member in struct:stack_def
368 int top; local
390 int top = regstack->top; local
2232 int top = regstack->top; local
2579 int reg, top = -1; local
[all...]
/freebsd-12-stable/contrib/gcc/config/
H A Ddarwin-crt2.c112 struct live_images *top, **lip, *destroy = NULL;
116 top = (struct live_images *)
118 for (lip = &top; *lip != NULL; lip = &(*lip)->next)
131 _keymgr_set_and_unlock_processwide_ptr (KEYMGR_GCC3_LIVE_IMAGE_LIST, top);
111 struct live_images *top, **lip, *destroy = NULL; local
/freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/binomial_heap_base_/
H A Dfind_fn_imps.hpp50 top() const function in class:PB_DS_CLASS_C_DEC
/freebsd-12-stable/contrib/llvm-project/compiler-rt/lib/tsan/rtl/
H A Dtsan_stack_trace.cpp55 uptr top = 0; local
58 GetThreadStackTopAndBottom(false, &top, &bottom);
59 Unwind(max_depth, pc, bp, nullptr, top, bottom, true);
/freebsd-12-stable/sys/dev/smartpqi/
H A Dsmartpqi_tag.c230 new_head.top.seq_no = cur_head.top.seq_no + 1;
231 /* update the index at the top of the stack with the new index */
232 new_head.top.index = index;
234 stack->next_index_array[index] = cur_head.top.index;
251 if (cur_head.top.index == 0) /* stack empty */
254 new_head.top.seq_no = cur_head.top.seq_no + 1;
255 /* update the index at the top of the stack with the next index */
256 new_head.top
[all...]
/freebsd-12-stable/usr.sbin/mptutil/
H A Dmptutil.c45 SET_DECLARE(MPT_DATASET(top), struct mptutil_command);
92 MPT_COMMAND(top, version, version);
121 SET_FOREACH(cmd, MPT_DATASET(top)) {
/freebsd-12-stable/contrib/dialog/
H A Darrows.c102 int top,
118 if (dialog_vars.title && is_toplevel && (top - getbegy(win)) < MARGIN) {
126 (void) wmove(win, top, x);
136 mouse_mkbutton(top, x - 1, 6, KEY_PPAGE);
163 int top,
204 int all_high = (bottom - top - 1);
221 wmove(win, top + 1, right);
233 wmove(win, top + 1 + bar_y, right);
249 top,
263 int top,
98 dlg_draw_arrows2(WINDOW *win, int top_arrow, int bottom_arrow, int x, int top, int bottom, chtype attr, chtype borderattr) argument
156 dlg_draw_scrollbar(WINDOW *win, long first_data, long this_data, long next_data, long total_data, int left, int right, int top, int bottom, chtype attr, chtype borderattr) argument
259 dlg_draw_arrows(WINDOW *win, int top_arrow, int bottom_arrow, int x, int top, int bottom) argument
[all...]

Completed in 211 milliseconds

1234567891011>>