5 void factor_vm::primitive_special_object() {
6 fixnum n = untag_fixnum(ctx->peek());
7 ctx->replace(special_objects[n]);
10 void factor_vm::primitive_set_special_object() {
11 fixnum n = untag_fixnum(ctx->pop());
12 cell value = ctx->pop();
13 special_objects[n] = value;
16 void factor_vm::primitive_identity_hashcode() {
17 cell tagged = ctx->peek();
18 object* obj = untag<object>(tagged);
19 ctx->replace(tag_fixnum(obj->hashcode()));
22 void factor_vm::compute_identity_hashcode(object* obj) {
24 if (object_counter == 0)
26 obj->set_hashcode((cell)obj ^ object_counter);
29 void factor_vm::primitive_compute_identity_hashcode() {
30 object* obj = untag<object>(ctx->pop());
31 compute_identity_hashcode(obj);
34 void factor_vm::primitive_set_slot() {
35 fixnum slot = untag_fixnum(ctx->pop());
36 object* obj = untag<object>(ctx->pop());
37 cell value = ctx->pop();
39 cell* slot_ptr = &obj->slots()[slot];
41 write_barrier(slot_ptr);
44 /* Allocates memory */
45 cell factor_vm::clone_object(cell obj_) {
46 data_root<object> obj(obj_, this);
48 if (immediate_p(obj.value()))
51 cell size = object_size(obj.value());
52 object* new_obj = allot_object(obj.type(), size);
53 memcpy(new_obj, obj.untagged(), size);
54 new_obj->set_hashcode(0);
55 return tag_dynamic(new_obj);
59 /* Allocates memory */
60 void factor_vm::primitive_clone() { ctx->replace(clone_object(ctx->peek())); }
62 /* Size of the object pointed to by a tagged pointer */
63 cell factor_vm::object_size(cell tagged) {
64 if (immediate_p(tagged))
67 return untag<object>(tagged)->size();
70 /* Allocates memory */
71 void factor_vm::primitive_size() {
72 ctx->replace(from_unsigned_cell(object_size(ctx->peek())));
75 struct slot_become_fixup : no_fixup {
76 std::map<object*, object*>* become_map;
78 slot_become_fixup(std::map<object*, object*>* become_map)
79 : become_map(become_map) {}
81 object* fixup_data(object* old) {
82 std::map<object*, object*>::const_iterator iter = become_map->find(old);
83 if (iter != become_map->end())
90 struct object_become_visitor {
91 slot_visitor<slot_become_fixup>* workhorse;
93 explicit object_become_visitor(slot_visitor<slot_become_fixup>* workhorse)
94 : workhorse(workhorse) {}
96 void operator()(object* obj) { workhorse->visit_slots(obj); }
99 struct code_block_become_visitor {
100 slot_visitor<slot_become_fixup>* workhorse;
102 explicit code_block_become_visitor(
103 slot_visitor<slot_become_fixup>* workhorse)
104 : workhorse(workhorse) {}
106 void operator()(code_block* compiled, cell size) {
107 workhorse->visit_code_block_objects(compiled);
108 workhorse->visit_embedded_literals(compiled);
112 struct code_block_write_barrier_visitor {
115 explicit code_block_write_barrier_visitor(code_heap* code) : code(code) {}
117 void operator()(code_block* compiled, cell size) {
118 code->write_barrier(compiled);
122 /* classes.tuple uses this to reshape tuples; tools.deploy.shaker uses this
123 to coalesce equal but distinct quotations and wrappers. */
125 void factor_vm::primitive_become() {
126 primitive_minor_gc();
127 array* new_objects = untag_check<array>(ctx->pop());
128 array* old_objects = untag_check<array>(ctx->pop());
130 cell capacity = array_capacity(new_objects);
131 if (capacity != array_capacity(old_objects))
132 critical_error("bad parameters to become", 0);
134 /* Build the forwarding map */
135 std::map<object*, object*> become_map;
137 for (cell i = 0; i < capacity; i++) {
138 tagged<object> old_obj(array_nth(old_objects, i));
139 tagged<object> new_obj(array_nth(new_objects, i));
141 if (old_obj != new_obj)
142 become_map[old_obj.untagged()] = new_obj.untagged();
145 /* Update all references to old objects to point to new objects */
147 slot_visitor<slot_become_fixup> workhorse(this,
148 slot_become_fixup(&become_map));
149 workhorse.visit_all_roots();
151 object_become_visitor object_visitor(&workhorse);
152 each_object(object_visitor);
154 code_block_become_visitor code_block_visitor(&workhorse);
155 each_code_block(code_block_visitor);
158 /* Since we may have introduced old->new references, need to revisit
159 all objects and code blocks on a minor GC. */
160 data->mark_all_cards();
163 code_block_write_barrier_visitor code_block_visitor(code);
164 each_code_block(code_block_visitor);