vm/objects.cpp

   1 #include "master.hpp"
   2
   3 namespace factor
   4 {
   5
   6 void factor_vm::primitive_special_object()
   7 {
   8         fixnum n = untag_fixnum(ctx->peek());
   9         ctx->replace(special_objects[n]);
  10 }
  11
  12 void factor_vm::primitive_set_special_object()
  13 {
  14         fixnum n = untag_fixnum(ctx->pop());
  15         cell value = ctx->pop();
  16         special_objects[n] = value;
  17 }
  18
  19 void factor_vm::primitive_identity_hashcode()
  20 {
  21         cell tagged = ctx->peek();
  22         object *obj = untag<object>(tagged);
  23         ctx->replace(tag_fixnum(obj->hashcode()));
  24 }
  25
  26 void factor_vm::compute_identity_hashcode(object *obj)
  27 {
  28         object_counter++;
  29         if(object_counter == 0) object_counter++;
  30         obj->set_hashcode((cell)obj ^ object_counter);
  31 }
  32
  33 void factor_vm::primitive_compute_identity_hashcode()
  34 {
  35         object *obj = untag<object>(ctx->pop());
  36         compute_identity_hashcode(obj);
  37 }
  38
  39 void factor_vm::primitive_set_slot()
  40 {
  41         fixnum slot = untag_fixnum(ctx->pop());
  42         object *obj = untag<object>(ctx->pop());
  43         cell value = ctx->pop();
  44
  45         cell *slot_ptr = &obj->slots()[slot];
  46         *slot_ptr = value;
  47         write_barrier(slot_ptr);
  48 }
  49
  50 cell factor_vm::clone_object(cell obj_)
  51 {
  52         data_root<object> obj(obj_,this);
  53
  54         if(immediate_p(obj.value()))
  55                 return obj.value();
  56         else
  57         {
  58                 cell size = object_size(obj.value());
  59                 object *new_obj = allot_object(obj.type(),size);
  60                 memcpy(new_obj,obj.untagged(),size);
  61                 new_obj->set_hashcode(0);
  62                 return tag_dynamic(new_obj);
  63         }
  64 }
  65
  66 void factor_vm::primitive_clone()
  67 {
  68         ctx->replace(clone_object(ctx->peek()));
  69 }
  70
  71 /* Size of the object pointed to by a tagged pointer */
  72 cell factor_vm::object_size(cell tagged)
  73 {
  74         if(immediate_p(tagged))
  75                 return 0;
  76         else
  77                 return untag<object>(tagged)->size();
  78 }
  79
  80 void factor_vm::primitive_size()
  81 {
  82         ctx->push(allot_cell(object_size(ctx->pop())));
  83 }
  84
  85 struct slot_become_visitor {
  86         std::map<object *,object *> *become_map;
  87
  88         explicit slot_become_visitor(std::map<object *,object *> *become_map_) :
  89                 become_map(become_map_) {}
  90
  91         object *operator()(object *old)
  92         {
  93                 std::map<object *,object *>::const_iterator iter = become_map->find(old);
  94                 if(iter != become_map->end())
  95                         return iter->second;
  96                 else
  97                         return old;
  98         }
  99 };
 100
 101 struct object_become_visitor {
 102         slot_visitor<slot_become_visitor> *workhorse;
 103
 104         explicit object_become_visitor(slot_visitor<slot_become_visitor> *workhorse_) :
 105                 workhorse(workhorse_) {}
 106
 107         void operator()(object *obj)
 108         {
 109                 workhorse->visit_slots(obj);
 110         }
 111 };
 112
 113 struct code_block_become_visitor {
 114         slot_visitor<slot_become_visitor> *workhorse;
 115
 116         explicit code_block_become_visitor(slot_visitor<slot_become_visitor> *workhorse_) :
 117                 workhorse(workhorse_) {}
 118
 119         void operator()(code_block *compiled, cell size)
 120         {
 121                 workhorse->visit_code_block_objects(compiled);
 122                 workhorse->visit_embedded_literals(compiled);
 123         }
 124 };
 125
 126 struct code_block_write_barrier_visitor {
 127         code_heap *code;
 128
 129         explicit code_block_write_barrier_visitor(code_heap *code_) :
 130                 code(code_) {}
 131
 132         void operator()(code_block *compiled, cell size)
 133         {
 134                 code->write_barrier(compiled);
 135         }
 136 };
 137
 138 /* classes.tuple uses this to reshape tuples; tools.deploy.shaker uses this
 139    to coalesce equal but distinct quotations and wrappers. */
 140 void factor_vm::primitive_become()
 141 {
 142         array *new_objects = untag_check<array>(ctx->pop());
 143         array *old_objects = untag_check<array>(ctx->pop());
 144
 145         cell capacity = array_capacity(new_objects);
 146         if(capacity != array_capacity(old_objects))
 147                 critical_error("bad parameters to become",0);
 148
 149         /* Build the forwarding map */
 150         std::map<object *,object *> become_map;
 151
 152         for(cell i = 0; i < capacity; i++)
 153         {
 154                 tagged<object> old_obj(array_nth(old_objects,i));
 155                 tagged<object> new_obj(array_nth(new_objects,i));
 156
 157                 if(old_obj != new_obj)
 158                         become_map[old_obj.untagged()] = new_obj.untagged();
 159         }
 160
 161         /* Update all references to old objects to point to new objects */
 162         {
 163                 slot_visitor<slot_become_visitor> workhorse(this,slot_become_visitor(&become_map));
 164                 workhorse.visit_roots();
 165                 workhorse.visit_contexts();
 166
 167                 object_become_visitor object_visitor(&workhorse);
 168                 each_object(object_visitor);
 169
 170                 code_block_become_visitor code_block_visitor(&workhorse);
 171                 each_code_block(code_block_visitor);
 172         }
 173
 174         /* Since we may have introduced old->new references, need to revisit
 175         all objects and code blocks on a minor GC. */
 176         data->mark_all_cards();
 177
 178         {
 179                 code_block_write_barrier_visitor code_block_visitor(code);
 180                 each_code_block(code_block_visitor);
 181         }
 182 }
 183
 184 }