vm/words.cpp

   1 #include "master.hpp"
   2
   3 namespace factor
   4 {
   5
   6 /* Compile a word definition with the non-optimizing compiler. Allocates memory */
   7 void factor_vm::jit_compile_word(cell word_, cell def_, bool relocating)
   8 {
   9         data_root<word> word(word_,this);
  10         data_root<quotation> def(def_,this);
  11
  12         /* Refuse to compile this word more than once, because quot_compiled_p()
  13         depends on the identity of its code block */
  14         if(word->entry_point && word.value() == special_objects[LAZY_JIT_COMPILE_WORD])
  15                 return;
  16
  17         code_block *compiled = jit_compile_quot(word.value(),def.value(),relocating);
  18         word->entry_point = compiled->entry_point();
  19
  20         if(to_boolean(word->pic_def)) jit_compile_quot(word->pic_def,relocating);
  21         if(to_boolean(word->pic_tail_def)) jit_compile_quot(word->pic_tail_def,relocating);
  22 }
  23
  24 cell factor_vm::find_all_words()
  25 {
  26         return instances(WORD_TYPE);
  27 }
  28
  29 void factor_vm::compile_all_words()
  30 {
  31         data_root<array> words(find_all_words(),this);
  32
  33         cell length = array_capacity(words.untagged());
  34         for(cell i = 0; i < length; i++)
  35         {
  36                 data_root<word> word(array_nth(words.untagged(),i),this);
  37
  38                 if(!word->entry_point || !word->code()->optimized_p())
  39                         jit_compile_word(word.value(),word->def,false);
  40         }
  41 }
  42
  43 /* Allocates memory */
  44 word *factor_vm::allot_word(cell name_, cell vocab_, cell hashcode_)
  45 {
  46         data_root<object> vocab(vocab_,this);
  47         data_root<object> name(name_,this);
  48
  49         data_root<word> new_word(allot<word>(sizeof(word)),this);
  50
  51         new_word->hashcode = hashcode_;
  52         new_word->vocabulary = vocab.value();
  53         new_word->name = name.value();
  54         new_word->def = special_objects[OBJ_UNDEFINED];
  55         new_word->props = false_object;
  56         new_word->pic_def = false_object;
  57         new_word->pic_tail_def = false_object;
  58         new_word->subprimitive = false_object;
  59         new_word->entry_point = NULL;
  60
  61         jit_compile_word(new_word.value(),new_word->def,true);
  62
  63         return new_word.untagged();
  64 }
  65
  66 /* Allocates memory */
  67 /* (word) ( name vocabulary hashcode -- word ) */
  68 void factor_vm::primitive_word()
  69 {
  70         cell hashcode = ctx->pop();
  71         cell vocab = ctx->pop();
  72         cell name = ctx->pop();
  73         ctx->push(tag<word>(allot_word(name,vocab,hashcode)));
  74 }
  75
  76 /* Allocates memory (from_unsigned_cell allocates) */
  77 /* word-code ( word -- start end ) */
  78 void factor_vm::primitive_word_code()
  79 {
  80         data_root<word> w(ctx->pop(),this);
  81         w.untag_check(this);
  82
  83         ctx->push(from_unsigned_cell((cell)w->entry_point));
  84         ctx->push(from_unsigned_cell((cell)w->code() + w->code()->size()));
  85 }
  86
  87 void factor_vm::primitive_optimized_p()
  88 {
  89         word *w = untag_check<word>(ctx->peek());
  90         ctx->replace(tag_boolean(w->code()->optimized_p()));
  91 }
  92
  93 /* Allocates memory */
  94 void factor_vm::primitive_wrapper()
  95 {
  96         wrapper *new_wrapper = allot<wrapper>(sizeof(wrapper));
  97         new_wrapper->object = ctx->peek();
  98         ctx->replace(tag<wrapper>(new_wrapper));
  99 }
 100
 101 }