Lines Matching defs:word
116 isPrimitive(ficlWord *word)
118 ficlWordKind wk = ficlWordClassify(word);
143 ficlWord *word;
161 word = hash[i];
163 while (word) {
166 word = word->link;
198 * CFA of the word to decompile for each kind of
199 * known word-builder code, and tries to do
206 ficlWord *word;
209 word = (ficlWord *)ficlStackPopPointer(vm->dataStack);
210 kind = ficlWordClassify(word);
214 sprintf(vm->pad, ": %.*s\n", word->length, word->name);
216 ficlDictionarySee(ficlVmGetDictionary(vm), word,
222 (ficlWord *)word->param->p, &(vm->callback));
229 (long)word->param->i, (long unsigned)word->param->u);
235 (long)word->param->i, (long unsigned)word->param->u);
241 (long)word->param->i, (long unsigned)word->param->u);
246 (long)word->param[1].i, (long)word->param->i,
247 (long unsigned)word->param[1].u,
248 (long unsigned)word->param->u);
253 sprintf(vm->pad, "%.*s is a primitive\n", word->length,
254 word->name);
259 if (word->flags & FICL_WORD_IMMEDIATE) {
263 if (word->flags & FICL_WORD_COMPILE_ONLY) {
278 * Given an xt of a colon definition or a word defined by DOES>, set the
279 * VM up to debug the word: push IP, set the xt as the next thing to execute,
281 * Note: the semantics of this word are equivalent to "step in"
312 * or a does> word. This is the easy kind of step.
333 * in this word, and run until we hit it
338 ficlWord *word;
343 word = *vm->ip;
344 kind = ficlWordClassify(word);
376 * q (quit) - abort current word
386 ficlWord *word;
412 word = vm->callback.system->breakpoint.oldXT;
414 if ((((ficlInstruction)word) > ficlInstructionInvalid) &&
415 (((ficlInstruction)word) < ficlInstructionLast))
417 ficlDictionaryInstructionNames[(long)word],
418 (long)word);
420 sprintf(vm->pad, "next: %s\n", word->name);
421 if (strcmp(word->name, "interpret") == 0)
640 * Attempt to find the word that contains the return
642 * If this works, also print the name of the word.
645 ficlWord *word;
646 word = ficlDictionaryFindEnclosingWord(context->dictionary,
648 if (word) {
649 int offset = (ficlCell *)cell->p - &word->param[0];
651 word->name, offset);
691 * If the Search-Order word set is present, FORGET searches the
692 * compilation word list. An ambiguous condition exists if the
693 * compilation word list is deleted.
811 ficlWord *word;
817 for (word = hash->table[i]; word != NULL;
818 word = word->link, counter++) {
819 sprintf(vm->pad, "%s\n", word->name);
835 * This word lists the parse steps in order
889 * Builds wordset for debugger and TOOLS optional word set