Lines Matching defs:n
72 sprintf(buffer, "ASSERTION FAILED at %s:%d: \"%s\"\n",
160 int n = 0;
164 ++n;
169 avg += (double)(n * (n+1)) / 2.0;
171 if (n > nMax)
172 nMax = n;
173 if (n == 0)
187 "Max=%d, Avg=%2.1f, Best=%2.1f, Score: %2.0f%%\n",
214 sprintf(vm->pad, ": %.*s\n", word->length, word->name);
220 ficlVmTextOut(vm, "does>\n");
225 ficlVmTextOut(vm, "create\n");
228 sprintf(vm->pad, "variable = %ld (%#lx)\n",
234 sprintf(vm->pad, "user variable %ld (%#lx)\n",
240 sprintf(vm->pad, "constant = %ld (%#lx)\n",
245 sprintf(vm->pad, "constant = %ld %ld (%#lx %#lx)\n",
253 sprintf(vm->pad, "%.*s is a primitive\n", word->length,
260 ficlVmTextOut(vm, "immediate\n");
264 ficlVmTextOut(vm, "compile-only\n");
309 * s t e p I n
416 sprintf(vm->pad, "next: %s (instruction %ld)\n",
420 sprintf(vm->pad, "next: %s\n", word->name);
453 ficlVmTextOut(vm, "sorry - can't do that\n");
482 ficlVmTextOut(vm, "\n");
493 "i -- step In\n"
494 "o -- step Over\n"
495 "g -- Go (execute to completion)\n"
496 "l -- List source code\n"
497 "q -- Quit (stop debugging and abort)\n"
499 "as Ficl words\n");
540 snprintf(buffer, sizeof (buffer), "[0x%016lx %3d]: %20ld (0x%016lx)\n",
544 snprintf(buffer, sizeof (buffer), "[0x%08x %3d]: %12d (0x%08x)\n",
563 sprintf(buffer, "[%s stack has %d entries, top at 0x%016lx]\n",
566 sprintf(buffer, "[%s stack has %d entries, top at 0x%08x]\n",
580 sprintf(buffer, "[%s stack base at 0x%016lx]\n", stack->name,
583 sprintf(buffer, "[%s stack base at 0x%08x]\n", stack->name,
654 strcat(buffer, "\n");
753 pPad[nChars++] = '\n';
764 pPad[nChars++] = '\n';
776 pPad[nChars++] = '\n';
786 pPad[nChars++] = '\n';
792 sprintf(pPad, "Dictionary: %d words, %ld cells used of %u total\n",
803 * l i s t E n v
819 sprintf(vm->pad, "%s\n", word->name);
825 sprintf(vm->pad, "Environment: %d words, %ld cells used of %u total\n",
844 ficlVmTextOut(vm, "Parse steps:\n");
845 ficlVmTextOut(vm, "lookup\n");
850 ficlVmTextOut(vm, "\n");
857 * e n v C o n s t a n t