5 /* Size of the object pointed to by a tagged pointer */
6 cell object_size(cell tagged) {
7 if (immediate_p(tagged))
9 return untag<object>(tagged)->size();
12 void factor_vm::primitive_special_object() {
13 fixnum n = untag_fixnum(ctx->peek());
14 ctx->replace(special_objects[n]);
17 void factor_vm::primitive_set_special_object() {
18 fixnum n = untag_fixnum(ctx->pop());
19 cell value = ctx->pop();
20 special_objects[n] = value;
23 void factor_vm::primitive_identity_hashcode() {
24 cell tagged = ctx->peek();
25 object* obj = untag<object>(tagged);
26 ctx->replace(tag_fixnum(obj->hashcode()));
29 void factor_vm::compute_identity_hashcode(object* obj) {
31 if (object_counter == 0)
33 obj->set_hashcode((cell)obj ^ object_counter);
36 void factor_vm::primitive_compute_identity_hashcode() {
37 object* obj = untag<object>(ctx->pop());
38 compute_identity_hashcode(obj);
41 void factor_vm::primitive_set_slot() {
42 fixnum slot = untag_fixnum(ctx->pop());
43 object* obj = untag<object>(ctx->pop());
44 cell value = ctx->pop();
46 cell* slot_ptr = &obj->slots()[slot];
48 write_barrier(slot_ptr);
51 /* Allocates memory */
52 cell factor_vm::clone_object(cell obj_) {
53 data_root<object> obj(obj_, this);
55 if (immediate_p(obj.value()))
57 cell size = object_size(obj.value());
58 object* new_obj = allot_object(obj.type(), size);
59 memcpy(new_obj, obj.untagged(), size);
60 new_obj->set_hashcode(0);
61 return tag_dynamic(new_obj);
64 /* Allocates memory */
65 void factor_vm::primitive_clone() { ctx->replace(clone_object(ctx->peek())); }
67 /* Allocates memory */
68 void factor_vm::primitive_size() {
69 ctx->replace(from_unsigned_cell(object_size(ctx->peek())));
72 struct slot_become_fixup : no_fixup {
73 std::map<object*, object*>* become_map;
75 slot_become_fixup(std::map<object*, object*>* become_map)
76 : become_map(become_map) {}
78 object* fixup_data(object* old) {
79 std::map<object*, object*>::const_iterator iter = become_map->find(old);
80 if (iter != become_map->end())
86 /* classes.tuple uses this to reshape tuples; tools.deploy.shaker uses this
87 to coalesce equal but distinct quotations and wrappers. */
89 void factor_vm::primitive_become() {
91 array* new_objects = untag_check<array>(ctx->pop());
92 array* old_objects = untag_check<array>(ctx->pop());
94 cell capacity = array_capacity(new_objects);
95 if (capacity != array_capacity(old_objects))
96 critical_error("bad parameters to become", 0);
98 /* Build the forwarding map */
99 std::map<object*, object*> become_map;
101 for (cell i = 0; i < capacity; i++) {
102 cell old_ptr = array_nth(old_objects, i);
103 cell new_ptr = array_nth(new_objects, i);
104 if (old_ptr != new_ptr)
105 become_map[untag<object>(old_ptr)] = untag<object>(new_ptr);
108 /* Update all references to old objects to point to new objects */
110 slot_visitor<slot_become_fixup> visitor(this,
111 slot_become_fixup(&become_map));
112 visitor.visit_all_roots();
114 auto object_become_func = [&](object* obj) {
115 visitor.visit_slots(obj);
117 each_object(object_become_func);
119 auto code_block_become_func = [&](code_block* compiled, cell size) {
120 visitor.visit_code_block_objects(compiled);
121 visitor.visit_embedded_literals(compiled);
122 code->write_barrier(compiled);
124 each_code_block(code_block_become_func);
127 /* Since we may have introduced old->new references, need to revisit
128 all objects and code blocks on a minor GC. */
129 data->mark_all_cards();