Searched refs:top (Results 151 - 175 of 493) sorted by relevance

1234567891011>>

/freebsd-12-stable/contrib/gdb/gdb/
H A Dcp-abi.c90 value_rtti_type (struct value *v, int *full, int *top, int *using_enc) argument
94 return (*current_cp_abi.rtti_type) (v, full, top, using_enc);
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-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/rc_binomial_heap_/
H A Drc.hpp108 top() const;
197 top() const
/freebsd-12-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/lua/
H A Dlstate.h71 StkId top; /* top for this function */ member in struct:CallInfo
157 StkId top; /* first free slot in the stack */ member in struct:lua_State
/freebsd-12-stable/sys/compat/ndis/
H A Dwinx64_wrap.S101 lea 56+8(%rbp),%rsi # source == old stack top (stack+56)
102 mov %rsp,%rdi # destination == new stack top
/freebsd-12-stable/crypto/heimdal/lib/wind/
H A Dgen-normalize.py163 top = createTable() variable
166 add(tables[top], k, v)
/freebsd-12-stable/crypto/openssl/crypto/bn/
H A Dbn_local.h127 * - bn_check_top() tries to pollute unused words even if the bignum 'top' is
158 if (_bnum1->top < _bnum1->dmax) { \
162 * wouldn't be constructed with top!=dmax. */ \
166 memset(_not_const + _bnum1->top, _tmp_char, \
167 sizeof(*_not_const) * (_bnum1->dmax - _bnum1->top)); \
177 int _top = _bnum2->top; \
192 (words) >= (_bnum2)->top); \
221 int top; /* Index of last used d +1. */ member in struct:bignum_st
455 int ind = (a)->dmax - (a)->top; \
456 BN_ULONG *ftl = &(a)->d[(a)->top
[all...]
H A Dbn_blind.c181 if (n->dmax >= r->top) {
182 size_t i, rtop = r->top, ntop = n->top;
190 /* always true, if (rtop >= ntop) n->top = r->top; */
191 n->top = (int)(rtop & ~mask) | (ntop & mask);
H A Dbn_kron.c14 #define BN_lsw(n) (((n)->top == 0) ? (BN_ULONG) 0 : (n)->d[0])
/freebsd-12-stable/contrib/llvm-project/libcxx/src/filesystem/
H A Ddirectory_iterator.cpp314 return __imp_->__stack_.top().__entry_;
337 if (stack.top().advance(m_ec))
345 path root = move(stack.top().__root_);
358 auto& curr_it = __imp_->__stack_.top();
/freebsd-12-stable/contrib/llvm-project/clang/lib/AST/Interp/
H A DInterpStack.h29 /// Constructs a value in place on the top of the stack.
34 /// Returns the value from the top of the stack and removes it.
43 /// Discards the top value from the stack.
50 /// Returns a reference to the value on the top of the stack.
55 /// Returns a pointer to the top object.
56 void *top() { return Chunk ? peek(0) : nullptr; } function in class:clang::interp::final
74 /// Returns a pointer from the top of the stack.
/freebsd-12-stable/contrib/lua/src/
H A Dldo.h24 if (L->stack_last - L->top <= (n)) \
/freebsd-12-stable/cddl/contrib/opensolaris/cmd/zpool/
H A Dzpool_vdev.c604 nvlist_t **top; local
619 &top, &toplevels) == 0);
624 nv = top[t];
627 * For separate logs we ignore the top level vdev replication
1329 nvlist_t *nvroot, *nv, **top, **spares, **l2cache; local
1335 top = NULL;
1469 /* create a top-level vdev with children */
1527 top = realloc(top, toplevels * sizeof (nvlist_t *));
1528 if (top
1636 nvlist_t **top; local
[all...]
/freebsd-12-stable/lib/libc/db/btree/
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-12-stable/sys/net80211/
H A Dieee80211_rssadapt.c224 int i, top, thridx; local
226 for (i = 0, top = IEEE80211_RSSADAPT_BKT0;
228 i++, top <<= IEEE80211_RSSADAPT_BKTPOWER) {
230 if (pktlen <= top)
/freebsd-12-stable/usr.sbin/mpsutil/
H A Dmps_set.c43 MPS_TABLE(top, set);
/freebsd-12-stable/usr.sbin/ppp/
H A Dmbuf.h45 struct mbuf *top; member in struct:mqueue
/freebsd-12-stable/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_symbolizer_report.cpp101 uptr top = 0; local
107 GetThreadStackTopAndBottom(false, &top, &bottom);
108 stack->Unwind(kStackTraceMax, pc, bp, nullptr, top, bottom, true);
/freebsd-12-stable/contrib/mandoc/
H A Deqn_term.c64 ((bp->top != NULL || bp->bottom != NULL) &&
157 if (bp->top != NULL) {
159 term_word(p, bp->top);
/freebsd-12-stable/contrib/gdb/gdb/gdbserver/
H A Di387-fp.c247 int i, top; local
269 top = (fp->fstat >> 11) & 0x7;
275 tag = i387_ftag (fp, (i + 8 - top) % 8);
/freebsd-12-stable/contrib/bmake/mk/
H A Dmeta2deps.sh132 for top in "$@"
135 *"$sep$top$suffix$sep"*) continue;;
137 list="${list:+$list$sep}$top$suffix"
/freebsd-12-stable/sys/dev/vt/
H A Dvt_cpulogos.c75 vt_draw_1_logo(struct vt_device *vd, vt_axis_t top, vt_axis_t left) argument
103 top + (xy / vt_logo_sprite_width),
109 top + (xy / vt_logo_sprite_width), data[i]);
/freebsd-12-stable/sys/net/
H A Dradix.c285 struct radix_node *saved_t, *top = t; local
290 * Open code rn_search(v, top) to avoid overhead of extra
375 } while (t != top);
432 struct radix_node *top = head->rnh_treetop; local
433 int head_off = top->rn_offset, vlen = LEN(v);
434 struct radix_node *t = rn_search(v_arg, top);
456 x = top;
605 struct radix_node *saved_tt, *top = head->rnh_treetop; local
619 x = rn_addmask(netmask, head->rnh_masks, 0, top->rn_offset);
737 } while (b <= t->rn_bit && x != top);
778 struct radix_node *dupedkey, *saved_tt, *top; local
[all...]
/freebsd-12-stable/share/mk/
H A Dmeta2deps.sh133 for top in "$@"
136 *"$sep$top$suffix$sep"*) continue;;
138 list="${list:+$list$sep}$top$suffix"
/freebsd-12-stable/sbin/routed/
H A Dradix.c215 struct radix_node *saved_t, *top = t; local
220 * Open code rn_search(v, top) to avoid overhead of extra
320 } while (t != top);
353 struct radix_node *top = head->rnh_treetop; local
354 int head_off = top->rn_off, vlen = (int)*((u_char *)v);
355 struct radix_node *t = rn_search(v_arg, top);
383 struct radix_node *p, *x = top;
530 struct radix_node *saved_tt, *top = head->rnh_treetop; local
544 if ((x = rn_addmask(netmask, 0, top->rn_off)) == NULL)
632 } while (b <= t->rn_b && x != top);
672 struct radix_node *dupedkey, *saved_tt, *top; local
[all...]

Completed in 185 milliseconds

1234567891011>>