Searched defs:top (Results 1 - 25 of 216) sorted by relevance

123456789

/freebsd-head/usr.bin/m4/
H A Dparser.y45 top : expr { end_result = $1; } label
/freebsd-head/contrib/ncurses/ncurses/base/
H A Dlib_scrreg.c47 wsetscrreg(WINDOW *win, int top, int bottom) argument
49 T((T_CALLED("wsetscrreg(%p,%d,%d)"), (void *) win, top, bottom));
52 top >= 0 && top <= win->_maxy &&
54 bottom > top) {
55 win->_regtop = (NCURSES_SIZE_T) top;
H A Dlib_scroll.c52 int const top,
62 (void *) win, n, (long) top, (long) bottom));
64 if (top < 0
65 || bottom < top
81 #define BottomLimit(n) ((n) >= 0 && (n) >= top)
86 limit = top - n;
95 for (line = top; line < limit && TopLimit(line); line++) {
106 for (line = top; line <= limit && TopLimit(line); line++) {
119 touchline(win, top, bottom - top
50 _nc_scroll_window(WINDOW *win, int const n, int const top, int const bottom, NCURSES_CH_T blank) argument
[all...]
/freebsd-head/lib/libc/i386/string/
H A Dwcscmp.S42 top: movl (%edi),%eax label
63 jnz top
/freebsd-head/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-head/contrib/netbsd-tests/usr.bin/xlint/lint1/
H A Dd_c99_recursive_init.c2 struct top { struct
/freebsd-head/stand/libsa/
H A Dsbrk.c42 setheap(void *base, void *top) argument
47 maxheap = (char *)top - (char *)heapbase;
/freebsd-head/contrib/processor-trace/libipt/src/
H A Dpt_retstack.c39 retstack->top = 0;
48 return (retstack->top == retstack->bottom ? 1 : 0);
53 uint8_t top; local
58 top = retstack->top;
60 if (top == retstack->bottom)
63 top = (!top ? pt_retstack_size : top - 1);
65 retstack->top
75 uint8_t top, bottom; local
[all...]
/freebsd-head/contrib/llvm-project/compiler-rt/lib/ubsan/
H A Dubsan_diag_standalone.cpp21 uptr top = 0; local
24 GetThreadStackTopAndBottom(false, &top, &bottom);
25 Unwind(max_depth, pc, bp, nullptr, top, bottom, true);
/freebsd-head/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...]
H A Dtypeprint.c124 int top = -1; local
145 real_type = value_rtti_target_type (val, &full, &top, &using_enc);
155 real_type = value_rtti_type (val, &full, &top, &using_enc);
/freebsd-head/contrib/binutils/binutils/
H A Dsysinfo.y53 top: { label
/freebsd-head/crypto/heimdal/appl/telnet/telnet/
H A Dring.h52 *top, /* highest address+1 in buffer */ member in struct:__anon4428
/freebsd-head/usr.sbin/ypldap/
H A Dparse.y517 top: label
550 goto top;
/freebsd-head/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++) {
H A Dbt_debug.c156 indx_t cur, top; local
180 top = NEXTINDEX(h);
182 h->lower, h->upper, top);
183 for (cur = 0; cur < top; cur++) {
/freebsd-head/lib/libc/db/recno/
H A Drec_search.c71 indx_t top; local
84 for (idx = 0, top = NEXTINDEX(h);;) {
86 if (++idx == top || total + r->nrecs > recno)
/freebsd-head/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-head/lib/libc/gmon/
H A Dmcount.c75 struct tostruct *top, *prevtop; local
200 top = &p->tos[toindex];
201 top->selfpc = selfpc;
202 top->count = 1;
203 top->link = 0;
206 top = &p->tos[toindex];
207 if (top->selfpc == selfpc) {
211 top->count++;
216 * top points to what we are looking at,
217 * prevtop points to previous top
[all...]
/freebsd-head/contrib/telnet/telnet/
H A Dring.h57 *top, /* highest address+1 in buffer */ member in struct:__anon5
/freebsd-head/contrib/llvm-project/lldb/source/Plugins/Language/CPlusPlus/
H A DMSVCUndecoratedNameParser.cpp32 if (!stack.empty() && name[stack.top()] == '<') {
44 std::size_t top = stack.top(); local
45 if (name[top] == '<')
50 if (name[top] == '`')
/freebsd-head/sys/libkern/
H A Dmcount.c69 struct tostruct *top, *prevtop; local
183 top = &p->tos[toindex];
184 top->selfpc = selfpc;
185 top->count = 1;
186 top->link = 0;
189 top = &p->tos[toindex];
190 if (top->selfpc == selfpc) {
194 top->count++;
199 * top points to what we are looking at,
200 * prevtop points to previous top
[all...]
/freebsd-head/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-head/contrib/binutils/libiberty/
H A Dsort.c87 digit_t *top; local
106 top = ((digit_t *) (pointers + n)) + j;
112 digit < top;
/freebsd-head/contrib/libucl/src/
H A Ducl_emitter_streamline.c52 const ucl_object_t *top; member in struct:ucl_emitter_context_streamline
82 sctx->top = obj;
95 struct ucl_emitter_streamline_stack *st, *top; local
98 /* Check top object presence */
99 if (sctx->top == NULL) {
100 sctx->top = obj;
103 top = sctx->containers;
106 if (top != NULL && !top->is_array) {

Completed in 108 milliseconds

123456789