/freebsd-10-stable/sys/boot/ficl/ |
H A D | stack.c | 75 FICL_STACK *pStack = pVM->pStack; local 76 int nFree = pStack->base + pStack->nCells - pStack->sp; 78 if (popCells > STKDEPTH(pStack)) 117 FICL_STACK *pStack = ficlMalloc(size); local 121 assert (pStack != NULL); 124 pStack->nCells = nCells; 125 pStack 136 stackDelete(FICL_STACK *pStack) argument 149 stackDepth(FICL_STACK *pStack) argument 159 stackDrop(FICL_STACK *pStack, int n) argument 174 stackFetch(FICL_STACK *pStack, int n) argument 179 stackStore(FICL_STACK *pStack, int n, CELL c) argument 191 stackGetTop(FICL_STACK *pStack) argument 206 stackLink(FICL_STACK *pStack, int nCells) argument 222 stackUnlink(FICL_STACK *pStack) argument 235 stackPick(FICL_STACK *pStack, int n) argument 247 stackPop(FICL_STACK *pStack) argument 252 stackPopPtr(FICL_STACK *pStack) argument 257 stackPopUNS(FICL_STACK *pStack) argument 262 stackPopINT(FICL_STACK *pStack) argument 268 stackPopFloat(FICL_STACK *pStack) argument 279 stackPush(FICL_STACK *pStack, CELL c) argument 284 stackPushPtr(FICL_STACK *pStack, void *ptr) argument 289 stackPushUNS(FICL_STACK *pStack, FICL_UNS u) argument 294 stackPushINT(FICL_STACK *pStack, FICL_INT i) argument 300 stackPushFloat(FICL_STACK *pStack, FICL_FLOAT f) argument 311 stackReset(FICL_STACK *pStack) argument 326 stackRoll(FICL_STACK *pStack, int n) argument 366 stackSetTop(FICL_STACK *pStack, CELL c) argument [all...] |
H A D | fileaccess.c | 27 stackPushINT(pVM->pStack, ior); 34 int fam = stackPopINT(pVM->pStack); 35 int length = stackPopINT(pVM->pStack); 36 void *address = (void *)stackPopPtr(pVM->pStack); 49 stackPushPtr(pVM->pStack, NULL); 50 stackPushINT(pVM->pStack, EINVAL); 68 stackPushPtr(pVM->pStack, NULL); 74 stackPushPtr(pVM->pStack, ff); 104 ficlFILE *ff = (ficlFILE *)stackPopPtr(pVM->pStack); 110 int length = stackPopINT(pVM->pStack); [all...] |
H A D | loader.c | 77 names = stackPopINT(pVM->pStack); 78 namep = (char*) stackPopPtr(pVM->pStack); 79 values = stackPopINT(pVM->pStack); 80 valuep = (char*) stackPopPtr(pVM->pStack); 114 overwrite = stackPopINT(pVM->pStack); 115 names = stackPopINT(pVM->pStack); 116 namep = (char*) stackPopPtr(pVM->pStack); 117 values = stackPopINT(pVM->pStack); 118 valuep = (char*) stackPopPtr(pVM->pStack); 152 names = stackPopINT(pVM->pStack); [all...] |
H A D | search.c | 83 stackPushPtr(pVM->pStack, pHash); 96 stackPushPtr(pVM->pStack, vmGetDict(pVM)->pCompile); 119 stackPushPtr(pVM->pStack, pDict->pSearch[i]); 122 stackPushUNS(pVM->pStack, nLists); 141 FICL_HASH *pHash = stackPopPtr(pVM->pStack); 143 si.count = (FICL_COUNT)stackPopUNS(pVM->pStack); 144 si.cp = stackPopPtr(pVM->pStack); 153 stackPushPtr(pVM->pStack, pFW); 154 stackPushINT(pVM->pStack, (wordIsImmediate(pFW) ? 1 : -1)); 158 stackPushUNS(pVM->pStack, [all...] |
H A D | math64.h | 58 void i64Push(FICL_STACK *pStack, DPINT i64); 59 DPINT i64Pop(FICL_STACK *pStack); 60 void u64Push(FICL_STACK *pStack, DPUNS u64); 61 DPUNS u64Pop(FICL_STACK *pStack);
|
H A D | ficl.h | 371 void stackDelete (FICL_STACK *pStack); 372 int stackDepth (FICL_STACK *pStack); 373 void stackDrop (FICL_STACK *pStack, int n); 374 CELL stackFetch (FICL_STACK *pStack, int n); 375 CELL stackGetTop (FICL_STACK *pStack); 376 void stackLink (FICL_STACK *pStack, int nCells); 377 void stackPick (FICL_STACK *pStack, int n); 378 CELL stackPop (FICL_STACK *pStack); 379 void *stackPopPtr (FICL_STACK *pStack); 380 FICL_UNS stackPopUNS (FICL_STACK *pStack); 487 FICL_STACK *pStack; /* param stack */ member in struct:vm [all...] |
H A D | words.c | 109 cp = (char *)stackPopPtr(pVM->pStack); 136 patchAddr = (CELL *)stackPopPtr(pVM->pStack); 159 patchAddr = (CELL *)stackPopPtr(pVM->pStack); 179 cp = stackPopPtr(pVM->pStack); 189 patchAddr = (CELL *)stackPopPtr(pVM->pStack); 285 i = stackPopINT(pVM->pStack); 286 i += stackGetTop(pVM->pStack).i; 287 stackSetTop(pVM->pStack, LVALUEtoCELL(i)); 297 i = stackPopINT(pVM->pStack); 298 i = stackGetTop(pVM->pStack) 4567 FICL_STACK pStack; local [all...] |
H A D | vm.c | 92 if (pVM->pStack) 93 stackDelete(pVM->pStack); 94 pVM->pStack = stackCreate(nPStack); 122 ficlFree(pVM->pStack); 199 FICL_STACK *pStack = pVM->pStack; 208 stackPushINT(pStack, 0); 211 stackPushINT(pStack, 1); 214 stackPushINT(pStack, 2); 217 stackPushINT(pStack, [all...] |
H A D | math64.c | 216 void i64Push(FICL_STACK *pStack, DPINT i64) argument 218 stackPushINT(pStack, i64.lo); 219 stackPushINT(pStack, i64.hi); 223 void u64Push(FICL_STACK *pStack, DPUNS u64) argument 225 stackPushINT(pStack, u64.lo); 226 stackPushINT(pStack, u64.hi); 237 DPINT i64Pop(FICL_STACK *pStack) argument 240 ret.hi = stackPopINT(pStack); 241 ret.lo = stackPopINT(pStack); 245 DPUNS u64Pop(FICL_STACK *pStack) argument [all...] |
H A D | testmain.c | 267 stackPushUNS(pVM->pStack, (FICL_UNS)now); 273 stackPushUNS(pVM->pStack, CLOCKS_PER_SEC); 285 pFW = stackPopPtr(pVM->pStack);
|
H A D | tools.c | 307 pFW = (FICL_WORD *)stackPopPtr(pVM->pStack); 384 FICL_WORD *xt = stackPopPtr(pVM->pStack); 387 stackPushPtr(pVM->pStack, xt); 550 stackPushPtr(pVM->pStack, xt); 625 FICL_STACK *pStk = pVM->pStack; 700 pHash = (FICL_HASH *)stackPopPtr(pVM->pStack); 726 where = ((FICL_WORD *)stackPopPtr(pVM->pStack))->name;
|
H A D | prefix.c | 135 int base = stackPopINT(pVM->pStack);
|
H A D | float.c | 792 stackPush(pVM->pStack, c); 805 c = stackPop(pVM->pStack);
|
/freebsd-10-stable/sys/boot/ficl/i386/ |
H A D | sysdep.c | 95 port=stackPopUNS(pVM->pStack); 96 c=(u_char)stackPopINT(pVM->pStack); 110 port=stackPopUNS(pVM->pStack); 112 stackPushINT(pVM->pStack,c);
|
/freebsd-10-stable/sys/boot/common/ |
H A D | interp_forth.c | 96 if (stackPopINT(vm->pStack)) { 104 nstrings = stackPopINT(vm->pStack); 106 len += stackFetch(vm->pStack, i * 2).i + 1; 112 len = stackPopINT(vm->pStack); 113 cp = stackPopPtr(vm->pStack); 159 stackPushINT(vm->pStack,result);
|
H A D | interp.c | 42 #define RETURN(x) stackPushINT(bf_vm->pStack,!x); return(x)
|