/freebsd-12-stable/crypto/openssl/crypto/bn/ |
H A D | bn_intern.c | 54 if (scalar->d == NULL || scalar->top == 0) { 143 return a->top; 155 for (i = a->top; i < a->dmax; i++) 161 if (in->top > size) 166 memcpy(out, in->d, sizeof(*out) * in->top); 182 a->dmax = a->top = size; 196 a->top = num_words;
|
H A D | bn_gf2m.c | 113 /* compensate for the top two bits of a */ 206 /* compensate for the top three bits of a */ 260 if (a->top < b->top) { 268 if (bn_wexpand(r, at->top) == NULL) 271 for (i = 0; i < bt->top; i++) { 274 for (; i < at->top; i++) { 278 r->top = at->top; 311 if (!bn_wexpand(r, a->top)) 617 int top = p->top; local [all...] |
H A D | bn_gcd.c | 456 } else if (D->top == 1) { 545 * since access to top potentially leaks this information. 551 int i, j, top, rlen, glen, m, bit = 1, delta = 1, cond = 0, shifts = 0, ret = 0; local 596 top = 1 + ((r->top >= g->top) ? r->top : g->top); 597 if (bn_wexpand(r, top) == NULL 598 || bn_wexpand(g, top) [all...] |
/freebsd-12-stable/contrib/gcclibs/libdecnumber/ |
H A D | decimal128.c | 109 uByte top; /* work */ local 111 top = DECIMAL_Inf; 120 top = DECIMAL_NaN; 122 top = DECIMAL_sNaN; 124 d128->bytes[0] = top; 138 { /* top clamp */ 164 /* save and clear the top digit */ 165 msd = ((unsigned) d128->bytes[1] << 2) & 0x0c; /* top 2 bits */ 200 uInt top = d128->bytes[0] & 0x7f; /* top byt local [all...] |
H A D | decimal32.c | 109 uByte top; /* work */ local 111 top = DECIMAL_Inf; 120 top = DECIMAL_NaN; 122 top = DECIMAL_sNaN; 124 d32->bytes[0] = top; 138 { /* top clamp */ 164 /* save and clear the top digit */ 197 uInt top = d32->bytes[0] & 0x7f; /* top byte, less sign bit */ local 203 if (top > [all...] |
H A D | decimal64.c | 109 uByte top; /* work */ local 111 top = DECIMAL_Inf; 120 top = DECIMAL_NaN; 122 top = DECIMAL_sNaN; 124 d64->bytes[0] = top; 138 { /* top clamp */ 163 /* save and clear the top digit */ 196 uInt top = d64->bytes[0] & 0x7f; /* top byte, less sign bit */ local 202 if (top > [all...] |
/freebsd-12-stable/lib/libc/db/recno/ |
H A D | rec_get.c | 118 __rec_fpipe(BTREE *t, recno_t top) argument 135 for (nrec = t->bt_nrecs; nrec < top;) { 152 if (nrec < top) { 170 __rec_vpipe(BTREE *t, recno_t top) argument 180 for (nrec = t->bt_nrecs; nrec < top; ++nrec) { 205 if (nrec < top) { 223 __rec_fmap(BTREE *t, recno_t top) argument 241 for (nrec = t->bt_nrecs; nrec < top; ++nrec) { 269 __rec_vmap(BTREE *t, recno_t top) argument 280 for (nrec = t->bt_nrecs; nrec < top; [all...] |
H A D | rec_search.c | 71 indx_t top; local 84 for (idx = 0, top = NEXTINDEX(h);;) { 86 if (++idx == top || total + r->nrecs > recno)
|
/freebsd-12-stable/lib/libc/stdlib/ |
H A D | radixsort.c | 137 const u_char **an, *t, **aj, **top[256]; local 179 * Set top[]; push incompletely sorted bins onto stack. 180 * top[] = pointers to last out-of-place element in bins. 182 * Before permuting: top[c-1] + count[c] = top[c]; 183 * during deal: top[c] counts down to top[c-1]. 187 if (endch == 0) /* Special case: set top[eos]. */ 188 top[0] = ak = a + count[0]; 191 top[25 235 const u_char **top[256]; local [all...] |
/freebsd-12-stable/usr.bin/dtc/ |
H A D | input_buffer.hh | 287 * The current stack of includes. The current input is always from the top 356 ((input_stack.size() == 1) && input_stack.top()->finished()); 359 * Dereferencing operator. Returns the current character in the top input buffer. 367 return *(*input_stack.top()); 379 auto &top = *input_stack.top(); local 380 ++top; 381 if (top.finished()) 415 return input_stack.top()->consume(str); 432 return input_stack.top() [all...] |
/freebsd-12-stable/tools/regression/geom/ConfCmp/ |
H A D | ConfCmp.c | 65 struct node *top; member in struct:mytree 182 mt->top = new_node(); 183 mt->top->name = "(top)"; 184 mt->top->parent = mt->top; 185 mt->cur = mt->top; 186 sbuf_finish(mt->top->key); 187 sbuf_finish(mt->top->cont); 202 sbuf_finish(mt->top [all...] |
/freebsd-12-stable/contrib/lua/src/ |
H A D | lvm.c | 448 luaT_callTM(L, tm, t1, t2, L->top, 1); /* call TM */ 449 return !l_isfalse(L->top); 459 /* copy strings in stack from top - n up to top - 1 to buffer */ 460 static void copy2buff (StkId top, int n, char *buff) { argument 463 size_t l = vslen(top - n); /* length of string being copied */ 464 memcpy(buff + tl, svalue(top - n), l * sizeof(char)); 472 ** from 'L->top - total' up to 'L->top - 1'. 477 StkId top local 684 StkId top = L->top - 1; /* top when 'luaT_trybinTM' was called */ local [all...] |
H A D | ltm.c | 105 StkId func = L->top; 109 L->top += 3; 111 setobj2s(L, L->top++, p3); /* 3rd argument */ 119 setobjs2s(L, p3, --L->top); 160 if (!luaT_callbinTM(L, p1, p2, L->top, event)) 163 return !l_isfalse(L->top);
|
/freebsd-12-stable/share/examples/ppp/ |
H A D | login-auth | 56 pack .l -side top -padx $fxpad -pady $fypad; 67 pack .p -side top -padx $fxpad -pady $fypad; 74 pack .b -side top -padx $fxpad -pady $fypad;
|
/freebsd-12-stable/usr.sbin/mfiutil/ |
H A D | mfiutil.c | 42 SET_DECLARE(MFI_DATASET(top), struct mfiutil_command); 44 MFI_TABLE(top, start); 45 MFI_TABLE(top, stop); 46 MFI_TABLE(top, abort); 118 MFI_COMMAND(top, version, version); 149 SET_FOREACH(cmd, MFI_DATASET(top)) {
|
/freebsd-12-stable/contrib/llvm-project/lldb/source/Plugins/Language/CPlusPlus/ |
H A D | MSVCUndecoratedNameParser.cpp | 32 if (!stack.empty() && name[stack.top()] == '<') { 44 std::size_t top = stack.top(); local 45 if (name[top] == '<') 50 if (name[top] == '`')
|
/freebsd-12-stable/contrib/mandoc/ |
H A D | eqn.h | 63 char *top; /* Symbol above. */ member in struct:eqn_box
|
/freebsd-12-stable/contrib/libstdc++/include/ext/pb_ds/detail/binary_heap_/ |
H A D | find_fn_imps.hpp | 50 top() const function in class:PB_DS_CLASS_C_DEC
|
/freebsd-12-stable/contrib/gdb/gdb/ |
H A D | gcore.c | 165 derive_stack_segment (bfd_vma *bottom, bfd_vma *top) argument 170 gdb_assert (top); 182 *top = get_frame_base (fi); 184 if (INNER_THAN (read_sp (), *top)) 185 *top = read_sp (); 196 if (*bottom > *top) 200 tmp_vma = *top; 201 *top = *bottom; 213 derive_heap_segment (bfd *abfd, bfd_vma *bottom, bfd_vma *top) argument 223 gdb_assert (top); [all...] |
H A D | cp-abi.h | 135 int *full, int *top, int *using_enc); 161 struct type *(*rtti_type) (struct value *v, int *full, int *top,
|
/freebsd-12-stable/contrib/libucl/include/ |
H A D | ucl.h | 381 * Insert a object 'elt' to the hash 'top' and associate it with key 'key' 382 * @param top destination object (must be of type UCL_OBJECT) 389 UCL_EXTERN bool ucl_object_insert_key (ucl_object_t *top, ucl_object_t *elt, 393 * Replace a object 'elt' to the hash 'top' and associate it with key 'key', old object will be unrefed, 395 * @param top destination object (must be of type UCL_OBJECT) 402 UCL_EXTERN bool ucl_object_replace_key (ucl_object_t *top, ucl_object_t *elt, 407 * @param top destination object (must be of type UCL_OBJECT) 412 UCL_EXTERN bool ucl_object_merge (ucl_object_t *top, ucl_object_t *elt, bool copy); 416 * @param top object 420 UCL_EXTERN bool ucl_object_delete_keyl (ucl_object_t *top, 1440 const ucl_object_t *top; member in struct:ucl_emitter_context [all...] |
/freebsd-12-stable/crypto/heimdal/appl/telnet/telnet/ |
H A D | ring.c | 54 #define ring_increment(d,a,c) (((a)+(c) < (d)->top)? \ 91 ring->top = ring->bottom+ring->size; 163 else if (ring->consume + count > ring->top && 165 ring->bottom + ((ring->consume + count) - ring->top)) 201 * return distance to the top 203 return ring_subtract(ring, ring->top, ring->supply); 239 return ring_subtract(ring, ring->top, ring->consume); 245 return ring_subtract(ring, ring->top, ring->consume); 304 (*encryptor)(c, ring->top - c);
|
/freebsd-12-stable/contrib/sendmail/libsm/ |
H A D | ldap.c | 6 * forth in the LICENSE file which can be found at the top level of 737 sm_ldap_add_recurse(top, item, type, rpool) 738 SM_LDAP_RECURSE_LIST **top; 759 if (*top == NULL) 762 *top = sm_rpool_malloc_x(rpool, sizeof **top); 763 (*top)->lrl_cnt = 0; 764 (*top)->lrl_size = 0; 765 (*top)->lrl_data = NULL; 768 if ((*top) [all...] |
/freebsd-12-stable/contrib/telnet/telnet/ |
H A D | ring.c | 75 #define ring_increment(d,a,c) (((a)+(c) < (d)->top)? \ 108 ring->top = ring->bottom+ring->size; 180 else if (ring->consume + count > ring->top && 182 ring->bottom + ((ring->consume + count) - ring->top)) 218 * return distance to the top 220 return ring_subtract(ring, ring->top, ring->supply); 256 return ring_subtract(ring, ring->top, ring->consume); 262 return ring_subtract(ring, ring->top, ring->consume); 301 (*encryptor)(c, ring->top - c);
|
/freebsd-12-stable/contrib/libucl/python/src/ |
H A D | uclmodule.c | 162 ucl_object_t *top, *elm; local 165 top = ucl_object_typed_new (UCL_OBJECT); 185 ucl_object_insert_key (top, elm, keystr, 0, true); 188 return top; 193 ucl_object_t *top, *elm; local 196 top = ucl_object_typed_new (UCL_ARRAY); 201 ucl_array_append(top, elm); 204 return top;
|