HomeSort by: relevance | last modified time | path
    Searched defs:top (Results 1 - 25 of 416) sorted by relevancy

1 2 3 4 5 6 7 8 91011>>

  /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/
find_fn_imps.hpp 46 top() const function in class:PB_DS_CLASS_C_DEC
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/
find_fn_imps.hpp 46 top() const function in class:PB_DS_CLASS_C_DEC
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/
find_fn_imps.hpp 46 top() const function in class:PB_DS_CLASS_C_DEC
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/
find_fn_imps.hpp 46 top() const function in class:PB_DS_CLASS_C_DEC
  /src/usr.bin/m4/
parser.y 46 top : expr { end_result = $1; } label
  /src/crypto/external/bsd/heimdal/dist/lib/hcrypto/libtommath/
bn_mp_rshd.c 37 register mp_digit *bottom, *top; local
44 /* top [offset into digits] */
45 top = a->dp + b;
49 * the top of the window are copied to the bottom
58 *bottom++ = *top++;
61 /* zero the top digits */
bn_mp_lshd.c 38 register mp_digit *top, *bottom; local
43 /* top */
44 top = a->dp + a->used - 1;
51 * the bottom to the top. see bn_mp_rshd.c for more info.
54 *top-- = *bottom--;
58 top = a->dp;
60 *top++ = 0;
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/
find_fn_imps.hpp 46 top() const function in class:PB_DS_CLASS_C_DEC
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/binomial_heap_base_/
find_fn_imps.hpp 46 top() const function in class:PB_DS_CLASS_C_DEC
  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.base/
mips_pro.c 19 top (int y) function
27 return top (-1) + top (1);
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.base/
mips_pro.c 19 top (int y) function
27 return top (-1) + top (1);
  /src/external/gpl3/gdb.old/dist/sim/testsuite/m32c/
blinky.s 26 top: label
34 jmp.w top
  /src/external/gpl3/gdb/dist/sim/testsuite/m32c/
blinky.s 26 top: label
34 jmp.w top
  /src/sys/external/bsd/compiler_rt/dist/lib/ubsan/
ubsan_diag_standalone.cc 23 uptr top = 0; local
27 __sanitizer::GetThreadStackTopAndBottom(false, &top, &bottom);
32 stack.Unwind(kStackTraceMax, pc, bp, nullptr, top, bottom,
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/
find_fn_imps.hpp 46 top() const function in class:PB_DS_CLASS_C_DEC
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/
find_fn_imps.hpp 46 top() const function in class:PB_DS_CLASS_C_DEC
  /src/external/lgpl3/gmp/dist/demos/calc/
calc.y 166 top: label
193 /* "e" leaves it's value on the top of the mpz stack. A rule like "e '+' e"
  /src/external/mit/libcbor/dist/src/cbor/internal/
stack.c 11 return (struct _cbor_stack){.top = NULL, .size = 0};
15 struct _cbor_stack_record *top = stack->top; local
16 stack->top = stack->top->lower;
17 _CBOR_FREE(top);
28 *new_top = (struct _cbor_stack_record){stack->top, item, subitems};
29 stack->top = new_top;
  /src/external/gpl3/gcc/dist/libsanitizer/ubsan/
ubsan_diag_standalone.cpp 21 uptr top = 0; local
23 GetThreadStackTopAndBottom(false, &top, &bottom);
25 Unwind(max_depth, pc, bp, context, top, bottom, fast);
  /src/external/gpl3/gcc.old/dist/libsanitizer/ubsan/
ubsan_diag_standalone.cpp 21 uptr top = 0; local
23 GetThreadStackTopAndBottom(false, &top, &bottom);
25 Unwind(max_depth, pc, bp, context, top, bottom, fast);
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.guile/
scm-error-2.scm 23 (define (top-func x)
  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.guile/
scm-error-2.scm 23 (define (top-func x)
  /src/lib/libc/db/btree/
bt_conv.c 65 indx_t i, top; local
85 top = NEXTINDEX(h);
87 for (i = 0; i < top; i++) {
102 for (i = 0; i < top; i++) {
132 indx_t i, top; local
145 top = NEXTINDEX(h);
147 for (i = 0; i < top; i++) {
162 for (i = 0; i < top; i++) {
  /src/lib/libc/db/recno/
rec_search.c 74 indx_t top; local
87 for (idx = 0, top = NEXTINDEX(h);;) {
89 if (++idx == top || total + r->nrecs > recno)
  /src/crypto/external/apache2/openssl/dist/crypto/err/
err_mark.c 23 if (es->bottom == es->top)
25 es->err_marks[es->top]++;
34 if (es == NULL || es->bottom == es->top)
37 err_clear(es, es->top, 0);
38 es->top = es->top > 0 ? es->top - 1 : ERR_NUM_ERRORS - 1;
50 while (es->bottom != es->top
51 && es->err_marks[es->top] == 0) {
52 err_clear(es, es->top, 0)
65 int count = 0, top; local
84 int top; local
    [all...]

Completed in 21 milliseconds

1 2 3 4 5 6 7 8 91011>>