Lines Matching defs:vm

56 ficlPrimitiveDefinitions(ficlVm *vm)
58 ficlDictionary *dictionary = ficlVmGetDictionary(vm);
60 FICL_VM_ASSERT(vm, dictionary);
62 ficlVmThrowError(vm, "DEFINITIONS error - empty search order");
77 ficlPrimitiveForthWordlist(ficlVm *vm)
79 ficlHash *hash = ficlVmGetDictionary(vm)->forthWordlist;
80 ficlStackPushPointer(vm->dataStack, hash);
90 ficlPrimitiveGetCurrent(ficlVm *vm)
92 ficlDictionary *dictionary = ficlVmGetDictionary(vm);
94 ficlStackPushPointer(vm->dataStack, dictionary->compilationWordlist);
107 ficlPrimitiveGetOrder(ficlVm *vm)
109 ficlDictionary *dictionary = ficlVmGetDictionary(vm);
115 ficlStackPushPointer(vm->dataStack, dictionary->wordlists[i]);
118 ficlStackPushUnsigned(vm->dataStack, wordlistCount);
131 ficlPrimitiveSearchWordlist(ficlVm *vm)
136 ficlHash *hash = ficlStackPopPointer(vm->dataStack);
138 name.length = (ficlUnsigned8)ficlStackPopUnsigned(vm->dataStack);
139 name.text = ficlStackPopPointer(vm->dataStack);
142 ficlDictionaryLock(ficlVmGetDictionary(vm), FICL_TRUE);
144 ficlDictionaryLock(ficlVmGetDictionary(vm), FICL_FALSE);
147 ficlStackPushPointer(vm->dataStack, word);
148 ficlStackPushInteger(vm->dataStack,
151 ficlStackPushUnsigned(vm->dataStack, 0);
161 ficlPrimitiveSetCurrent(ficlVm *vm)
163 ficlHash *hash = ficlStackPopPointer(vm->dataStack);
164 ficlDictionary *dictionary = ficlVmGetDictionary(vm);
182 ficlPrimitiveSetOrder(ficlVm *vm)
185 int wordlistCount = ficlStackPopInteger(vm->dataStack);
186 ficlDictionary *dictionary = ficlVmGetDictionary(vm);
189 ficlVmThrowError(vm,
199 ficlStackPopPointer(vm->dataStack);
224 ficlPrimitiveFiclWordlist(ficlVm *vm)
226 ficlDictionary *dictionary = ficlVmGetDictionary(vm);
230 FICL_STACK_CHECK(vm->dataStack, 1, 1);
232 nBuckets = ficlStackPopUnsigned(vm->dataStack);
234 ficlStackPushPointer(vm->dataStack, hash);
243 ficlPrimitiveSearchPop(ficlVm *vm)
245 ficlDictionary *dictionary = ficlVmGetDictionary(vm);
251 ficlVmThrowError(vm, "search> error: empty search order");
253 ficlStackPushPointer(vm->dataStack,
264 ficlPrimitiveSearchPush(ficlVm *vm)
266 ficlDictionary *dictionary = ficlVmGetDictionary(vm);
270 ficlVmThrowError(vm, ">search error: search order overflow");
273 ficlStackPopPointer(vm->dataStack);
283 ficlPrimitiveWidGetName(ficlVm *vm)
290 hash = ficlVmPop(vm).p;
299 ficlVmPush(vm, c);
302 ficlVmPush(vm, c);
311 ficlPrimitiveWidSetName(ficlVm *vm)
313 char *name = (char *)ficlVmPop(vm).p;
314 ficlHash *hash = ficlVmPop(vm).p;
326 ficlPrimitiveSetParentWid(ficlVm *vm)
330 FICL_STACK_CHECK(vm->dataStack, 2, 0);
332 child = (ficlHash *)ficlStackPopPointer(vm->dataStack);
333 parent = (ficlHash *)ficlStackPopPointer(vm->dataStack);