/barrelfish-2018-10-04/lib/lua/src/ |
H A D | lapi.h | 14 #define api_incr_top(L) {L->top++; api_check(L, L->top <= L->ci->top, \ 18 { if ((nres) == LUA_MULTRET && L->ci->top < L->top) L->ci->top = L->top; } 20 #define api_checknelems(L,n) api_check(L, (n) < (L->top - L->ci->func), \
|
H A D | lapi.c | 59 api_check(L, idx <= ci->top - (ci->func + 1), "unacceptable index"); 60 if (o >= L->top) return NONVALIDVALUE; 64 api_check(L, idx != 0 && -idx <= L->top - (ci->func + 1), "invalid index"); 65 return L->top + idx; 96 if (L->stack_last - L->top > size) /* stack large enough? */ 99 int inuse = cast_int(L->top - L->stack) + EXTRA_STACK; 105 if (res && ci->top < L->top + size) 106 ci->top = L->top [all...] |
H A D | lvm.c | 87 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 449 StkId top = L->top - 1; /* top when 'call_binTM' was called */ local [all...] |
H A D | ldo.c | 95 setobjs2s(L, oldtop, L->top - 1); /* error message on current top */ 99 L->top = oldtop + 1; 111 setobjs2s(L, G(L)->mainthread->top++, L->top - 1); /* copy error obj. */ 145 L->top = (L->top - oldstack) + L->stack; 149 ci->top = (ci->top - oldstack) + L->stack; 180 int needed = cast_int(L->top 221 ptrdiff_t top = savestack(L, L->top); local [all...] |
/barrelfish-2018-10-04/lib/bulk_transfer/backends/net/ |
H A D | stack_allocator.c | 19 alloc->top = 0; 25 if (alloc->top >= alloc->size) { 29 alloc->stack[alloc->top++] = el; 35 if (alloc->top == 0) { 38 return alloc->stack[--alloc->top];
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/test/ |
H A D | methtest.c | 70 METHOD_CTX *top,*tmp1,*tmp2; local 72 top=METH_new(x509_lookup()); /* get a top level context */ 73 if (top == NULL) goto err; 76 if (top == NULL) goto err; 79 METH_push(top,METH_X509_CA_BY_SUBJECT,tmp1); 85 METH_push(top,METH_X509_CA_BY_SUBJECT,tmp2); 89 METH_push(top,METH_X509_BY_ISSUER,tmp); 93 METH_push(top,METH_X509_BY_ISSUER,tmp); 96 METH_init(top); [all...] |
/barrelfish-2018-10-04/lib/tommath/ |
H A D | bn_mp_rshd.c | 35 register mp_digit *bottom, *top; local 42 /* top [offset into digits] */ 43 top = a->dp + b; 47 * the top of the window are copied to the bottom 56 *bottom++ = *top++; 59 /* zero the top digits */
|
H A D | bn_mp_lshd.c | 36 register mp_digit *top, *bottom; local 41 /* top */ 42 top = a->dp + a->used - 1; 49 * the bottom to the top. see bn_mp_rshd.c for more info. 52 *top-- = *bottom--; 56 top = a->dp; 58 *top++ = 0;
|
H A D | bn_mp_reduce_2k.c | 29 top: 49 goto top;
|
H A D | bn_mp_reduce_2k_l.c | 32 top: 50 goto top;
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/util/ |
H A D | mkfiles.pl | 73 %top; 118 $o =~ s/\$[({]([^)}]+)[)}]/$top{$1} or $sym{$1}/ge; 119 $sym{$s}=($top{$s} or $o); 134 $top{$1}=$sym{$1};
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/bn/ |
H A D | bn_shift.c | 74 if (bn_wexpand(r,a->top+1) == NULL) return(0); 75 r->top=a->top; 79 if (bn_wexpand(r,a->top+1) == NULL) return(0); 84 for (i=0; i<a->top; i++) 93 r->top++; 114 if (bn_wexpand(r,a->top) == NULL) return(0); 115 r->top=a->top; 121 for (i=a->top [all...] |
H A D | bn_word.c | 77 for (i=a->top-1; i>=0; i--) 101 if (a->top == 0) 110 for (i=a->top-1; i>=0; i--) 119 if ((a->top > 0) && (a->d[a->top-1] == 0)) 120 a->top--; 148 if (((BN_ULONG)(a->d[a->top - 1] + 1) == 0) && 149 (bn_wexpand(a,a->top+1) == NULL)) 154 if (i >= a->top) 165 if (i >= a->top) [all...] |
H A D | bn_lib.c | 250 int i = a->top - 1; 308 ret->top=0; 347 for (i=b->top>>2; i>0; i--,A+=4,B+=4) 362 switch (b->top&3) 368 * the switch table by doing a=top&3; a--; goto jump_table[a]; 369 * which fails for top== 0 */ 376 memcpy(A,b->d,sizeof(b->d[0])*b->top); 401 * words <= b->dmax && top < words 415 r->top = b->top; [all...] |
H A D | bn_rand.c | 118 static int bnrand(int pseudorand, BIGNUM *rnd, int bits, int top, int bottom) argument 141 /* make a random number and set the top and bottom bits */ 177 if (top != -1) 179 if (top) 211 int BN_rand(BIGNUM *rnd, int bits, int top, int bottom) argument 213 return bnrand(0, rnd, bits, top, bottom); 216 int BN_pseudo_rand(BIGNUM *rnd, int bits, int top, int bottom) argument 218 return bnrand(1, rnd, bits, top, bottom); 222 int BN_bntest_rand(BIGNUM *rnd, int bits, int top, int bottom) argument 224 return bnrand(2, rnd, bits, top, botto [all...] |
H A D | bn_add.c | 114 if (a->top < b->top) 116 max = a->top; 117 min = b->top; 123 r->top=max; 153 r->top++; 178 max = a->top; 179 min = b->top; 257 r->top=max; 298 max=(a->top > [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/src/ |
H A D | external.c | 53 p1.top = B.top - 1; 54 i = p1.args - ((pword *) (p1.top->frame.chp + 1)); 57 p1.any_frame = p1.top->frame; 82 (B.top-1)->backtrack = external_fail_code_;
|
H A D | gc_stacks.c | 136 #define Chp_Tg(b) (((b).top - 1)->frame.chp->tg) 137 #define Chp_Tt(b) (((b).top - 1)->frame.chp->tt) 138 #define Chp_Sp(b) (((b).top - 1)->frame.chp->sp) 139 #define Chp_E(b) (((b).top - 1)->frame.chp->e) 445 * We assume that on top of the local stack there is a return 544 if (GCB.top < B.top && IsGcFrame(GCB.top - 1)) 547 GCB.chp = (GCB.top - 1)->frame.chp; /* set GCB one deeper */ 549 chp.top 708 top_ptr top; local 746 top_ptr top; local 1318 control_ptr fp, top, pfp; local 1501 control_ptr fp, top; local 2180 register control_ptr fp, top; local 2580 control_ptr fp, top; local 2653 control_ptr top; local [all...] |
H A D | mem.h | 50 #define StackEmpty(Stack) ((Stack)->top == (Stack)->limit) 52 #define StackTop(Stack) ((Stack)->top) 57 if (((Stack)->top -= (WordsNeeded)) < (uword *)((Stack) + 1)) \ 62 if (((Stack)->top += (NumberWords)) >= (Stack)->limit) \ 68 (Stack)->top = (Stack)->limit; \ 77 uword *top, /* stack top inside this segment */ member in struct:stack_header 102 (Temp)->top = (char *)((Temp)+1); \ 109 char *top, member in struct:temp_header 132 #define BufWriteZ(Buf) (Buf).write_block->top 179 uword *top; member in struct:buffer_block_header [all...] |
H A D | term_copy.c | 172 * using the top pointer. top is incremented and the new value is the 183 #define Copy_Term_To_Heap(v, t, top, handle_slot, dest) \ 188 top = _copy_term_to_heap(v, t, top, handle_slot, dest);\ 189 if (!top) return top;\ 193 _copy_term_to_heap(value v, type t, register pword *top, value **handle_slot, register pword *dest) argument 216 return top; 221 return top; 1116 pword *pw = (pword*) 0, *top; local [all...] |
/barrelfish-2018-10-04/lib/libc/gmon/ |
H A D | mcount.c | 73 struct tostruct *top, *prevtop; local 198 top = &p->tos[toindex]; 199 top->selfpc = selfpc; 200 top->count = 1; 201 top->link = 0; 204 top = &p->tos[toindex]; 205 if (top->selfpc == selfpc) { 209 top->count++; 214 * top points to what we are looking at, 215 * prevtop points to previous top [all...] |
/barrelfish-2018-10-04/lib/virtio/ |
H A D | vbuffer.h | 22 uint16_t top; ///< pointer to the top slot member in struct:virtio_buffer_allocator
|
/barrelfish-2018-10-04/lib/libc/db/btree/ |
H A D | bt_conv.c | 62 indx_t i, top; local 81 top = NEXTINDEX(h); 83 for (i = 0; i < top; i++) { 98 for (i = 0; i < top; i++) { 127 indx_t i, top; local 139 top = NEXTINDEX(h); 141 for (i = 0; i < top; i++) { 156 for (i = 0; i < top; i++) {
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/ |
H A D | makerefs.pl | 72 ( top(List, []) -> 83 top --> 91 top. 92 top --> 103 top. 104 top --> 115 top. 116 %top --> 124 % top. 125 top [all...] |
/barrelfish-2018-10-04/lib/pcre/ |
H A D | pcre_get.c | 81 int top, bot; local 85 if ((rc = pcre_fullinfo(code, NULL, PCRE_INFO_NAMECOUNT, &top)) != 0) 87 if (top <= 0) return PCRE_ERROR_NOSUBSTRING; 95 if ((rc = pcre16_fullinfo(code, NULL, PCRE_INFO_NAMECOUNT, &top)) != 0) 97 if (top <= 0) return PCRE_ERROR_NOSUBSTRING; 105 if ((rc = pcre32_fullinfo(code, NULL, PCRE_INFO_NAMECOUNT, &top)) != 0) 107 if (top <= 0) return PCRE_ERROR_NOSUBSTRING; 116 while (top > bot) 118 int mid = (top + bot) / 2; 123 if (c > 0) bot = mid + 1; else top 164 int top, bot; local [all...] |