forked from rubinius/rubinius
-
Notifications
You must be signed in to change notification settings - Fork 0
/
object.cpp
793 lines (647 loc) · 22.6 KB
/
object.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
#include <iostream>
#include <sstream>
#include <stdarg.h>
#include "builtin/object.hpp"
#include "builtin/bignum.hpp"
#include "builtin/class.hpp"
#include "builtin/compactlookuptable.hpp"
#include "builtin/fixnum.hpp"
#include "builtin/lookuptable.hpp"
#include "builtin/symbol.hpp"
#include "builtin/string.hpp"
#include "builtin/tuple.hpp"
#include "builtin/array.hpp"
#include "builtin/float.hpp"
#include "builtin/staticscope.hpp"
#include "builtin/system.hpp"
#include "builtin/methodtable.hpp"
#include "builtin/packed_object.hpp"
#include "builtin/location.hpp"
#include "objectmemory.hpp"
#include "arguments.hpp"
#include "dispatch.hpp"
#include "lookup_data.hpp"
#include "primitives.hpp"
#include "global_cache.hpp"
#include "vm/object_utils.hpp"
namespace rubinius {
void Object::bootstrap_methods(STATE) {
System::attach_primitive(state,
G(object), false,
state->symbol("metaclass"),
state->symbol("object_metaclass"));
}
Class* Object::class_object(STATE) const {
if(reference_p()) {
Module* mod = klass_;
while(!mod->nil_p() && !instance_of<Class>(mod)) {
mod = as<Module>(mod->superclass());
}
if(mod->nil_p()) {
Exception::assertion_error(state, "Object::class_object() failed to find a class");
}
return as<Class>(mod);
}
return state->globals().special_classes[((uintptr_t)this) & SPECIAL_CLASS_MASK].get();
}
Object* Object::duplicate(STATE) {
if(!reference_p()) return this;
Object* other = state->new_object_typed(
class_object(state), this->total_size(state), type_id());
return other->copy_object(state, this);
}
Object* Object::copy_metaclass(STATE, Object* other) {
if(MetaClass* mc = try_as<MetaClass>(other->klass())) {
MethodTable* source_methods = mc->method_table()->duplicate(state);
LookupTable* source_constants = mc->constants()->duplicate(state);
metaclass(state)->method_table(state, source_methods);
metaclass(state)->constants(state, source_constants);
// TODO inc the global serial here?
// This allows us to preserve included modules
metaclass(state)->superclass(state, mc->superclass());
}
return this;
}
Object* Object::copy_object_prim(STATE, Object* other, CallFrame* call_frame) {
if(!reference_p() || !other->reference_p() || type_id() != other->type_id() ||
class_object(state) != other->class_object(state)) {
Exception* exc =
Exception::make_type_error(state, type_id(), other);
exc->locations(state, Location::from_call_stack(state, call_frame));
state->thread_state()->raise_exception(exc);
return NULL;
}
return copy_object(state, other);
}
Object* Object::copy_object(STATE, Object* other) {
initialize_copy(other, age());
write_barrier(state, klass());
write_barrier(state, ivars());
#ifdef RBX_OBJECT_ID_IN_HEADER
// Don't inherit the object_id from the original.
set_object_id(0);
#endif
/* C extensions use Data objects for various purposes. The object
* usually is made an instance of some extension class. So, we
* have to check the object type to ensure we don't clobber the
* data caried in the new instance.
*/
if(type_id() != DataType) {
copy_body(state, other);
}
// Ensure that the metaclass is not shared
klass(state, other->class_object(state));
// HACK: If other is mature, remember it.
// We could inspect inspect the references we just copied to see
// if there are any young ones if other is mature, then and only
// then remember other. The up side to just remembering it like
// this is that other is rarely mature, and the remember_set is
// flushed on each collection anyway.
if(zone() == MatureObjectZone) {
state->om->remember_object(this);
}
// Copy ivars.
if(other->ivars()->reference_p()) {
// NOTE Don't combine these 2 branches even though they both just call
// ::copy. There is a special LookupTable::copy that can only be seen
// when the receiver is of LookupTable* type. Without the explicit cast
// and call, the wrong one will be called.
if(LookupTable* lt = try_as<LookupTable>(other->ivars())) {
ivars(state, lt->duplicate(state));
// We store the object_id in the ivar table, so nuke it.
#ifndef RBX_OBJECT_ID_IN_HEADER
LookupTable* ld = as<LookupTable>(ivars());
ld->remove(state, G(sym_object_id));
#endif
} else {
// Use as<> so that we throw a TypeError if there is something else
// here.
CompactLookupTable* clt = as<CompactLookupTable>(other->ivars());
ivars(state, clt->duplicate(state));
// We store the object_id in the ivar table, so nuke it.
#ifndef RBX_OBJECT_ID_IN_HEADER
CompactLookupTable* ld = as<CompactLookupTable>(ivars());
ld->remove(state, G(sym_object_id));
#endif
};
}
return this;
}
Object* Object::equal(STATE, Object* other) {
return this == other ? Qtrue : Qfalse;
}
Object* Object::freeze(STATE) {
if(reference_p()) set_frozen();
return this;
}
Object* Object::frozen_p(STATE) {
if(reference_p() && is_frozen_p()) return Qtrue;
return Qfalse;
}
Object* Object::get_field(STATE, size_t index) {
return type_info(state)->get_field(state, this, index);
}
Object* Object::get_table_ivar(STATE, Symbol* sym) {
if(CompactLookupTable* tbl = try_as<CompactLookupTable>(ivars())) {
return tbl->fetch(state, sym);
} else if(LookupTable* tbl = try_as<LookupTable>(ivars())) {
return tbl->fetch(state, sym);
}
return Qnil;
}
Object* Object::table_ivar_defined(STATE, Symbol* sym) {
bool found = false;
if(CompactLookupTable* tbl = try_as<CompactLookupTable>(ivars())) {
tbl->fetch(state, sym, &found);
} else if(LookupTable* tbl = try_as<LookupTable>(ivars())) {
tbl->fetch(state, sym, &found);
}
if(found) return Qtrue;
return Qfalse;
}
Object* Object::get_ivar_prim(STATE, Symbol* sym) {
if(sym->is_ivar_p(state)->false_p()) {
return reinterpret_cast<Object*>(kPrimitiveFailed);
}
return get_ivar(state, sym);
}
Object* Object::get_ivar(STATE, Symbol* sym) {
/* Implements the external ivars table for objects that don't
have their own space for ivars. */
if(!reference_p()) {
LookupTable* tbl = try_as<LookupTable>(G(external_ivars)->fetch(state, this));
if(tbl) return tbl->fetch(state, sym);
return Qnil;
}
switch(type_id()) {
case Object::type:
return get_table_ivar(state, sym);
case PackedObject::type:
{
LookupTable* tbl = this->reference_class()->packed_ivar_info();
LookupTableBucket* entry = tbl->find_entry(state, sym);
if(entry->nil_p()) {
return get_table_ivar(state, sym);
}
Fixnum* which = try_as<Fixnum>(entry->value());
Object** baa = reinterpret_cast<Object**>(pointer_to_body());
Object* obj = baa[which->to_native()];
if(obj == Qundef) return Qnil;
return obj;
}
default:
break;
}
/*
// Handle packed objects in a unique way.
if(PackedObject* po = try_as<PackedObject>(this)) {
return po->get_packed_ivar(state, sym);
}
*/
// We might be trying to access a slot, so try that first.
TypeInfo* ti = state->om->find_type_info(this);
if(ti) {
TypeInfo::Slots::iterator it = ti->slots.find(sym->index());
if(it != ti->slots.end()) {
return ti->get_field(state, this, it->second);
}
}
return get_table_ivar(state, sym);
}
Object* Object::ivar_defined_prim(STATE, Symbol* sym) {
if(!sym->is_ivar_p(state)->true_p()) {
return reinterpret_cast<Object*>(kPrimitiveFailed);
}
return ivar_defined(state, sym);
}
Object* Object::ivar_defined(STATE, Symbol* sym) {
/* Implements the external ivars table for objects that don't
have their own space for ivars. */
if(!reference_p()) {
LookupTable* tbl = try_as<LookupTable>(G(external_ivars)->fetch(state, this));
if(tbl) {
bool found = false;
tbl->fetch(state, sym, &found);
if(found) return Qtrue;
}
return Qfalse;
}
// Handle packed objects in a unique way.
if(PackedObject* po = try_as<PackedObject>(this)) {
return po->packed_ivar_defined(state, sym);
}
// We don't check slots, because we don't advertise them
// as normal ivars.
return table_ivar_defined(state, sym);
}
Array* Object::ivar_names(STATE) {
return ivar_names(state, Array::create(state, 3));
}
Array* Object::ivar_names(STATE, Array* ary) {
// We don't check slots, because we don't advertise them
// as normal ivars.
class ivar_match : public ObjectMatcher {
public:
virtual bool match_p(STATE, Object* match) {
if(Symbol* sym = try_as<Symbol>(match)) {
if(sym->is_ivar_p(state)->true_p()) return true;
}
return false;
}
} match;
if(!reference_p()) {
LookupTable* tbl = try_as<LookupTable>(G(external_ivars)->fetch(state, this));
if(tbl) {
tbl->filtered_keys(state, match, ary);
}
return ary;
}
// Handle packed objects in a unique way.
if(PackedObject* po = try_as<PackedObject>(this)) {
po->add_packed_ivars(state, ary);
}
if(CompactLookupTable* tbl = try_as<CompactLookupTable>(ivars())) {
tbl->filtered_keys(state, match, ary);
} else if(LookupTable* tbl = try_as<LookupTable>(ivars())) {
tbl->filtered_keys(state, match, ary);
}
return ary;
}
object_type Object::get_type() const {
if(reference_p()) return type_id();
if(fixnum_p()) return FixnumType;
if(symbol_p()) return SymbolType;
if(nil_p()) return NilType;
if(true_p()) return TrueType;
if(false_p()) return FalseType;
return ObjectType;
}
hashval Object::hash(STATE) {
if(!reference_p()) {
return reinterpret_cast<uintptr_t>(this) & FIXNUM_MAX;
#ifdef _LP64
uintptr_t key = reinterpret_cast<uintptr_t>(this);
key = (~key) + (key << 21); // key = (key << 21) - key - 1;
key = key ^ (key >> 24);
key = (key + (key << 3)) + (key << 8); // key * 265
key = key ^ (key >> 14);
key = (key + (key << 2)) + (key << 4); // key * 21
key = key ^ (key >> 28);
key = key + (key << 31);
return key & FIXNUM_MAX;
#else
// See http://burtleburtle.net/bob/hash/integer.html
uint32_t a = (uint32_t)this;
a = (a+0x7ed55d16) + (a<<12);
a = (a^0xc761c23c) ^ (a>>19);
a = (a+0x165667b1) + (a<<5);
a = (a+0xd3a2646c) ^ (a<<9);
a = (a+0xfd7046c5) + (a<<3);
a = (a^0xb55a4f09) ^ (a>>16);
return a & FIXNUM_MAX;
#endif
} else {
if(String* string = try_as<String>(this)) {
return string->hash_string(state);
} else if(Bignum* bignum = try_as<Bignum>(this)) {
return bignum->hash_bignum(state);
} else if(Float* flt = try_as<Float>(this)) {
return String::hash_str((unsigned char *)(&(flt->val)), sizeof(double));
} else {
return id(state)->to_native();
}
}
}
Integer* Object::hash_prim(STATE) {
return Integer::from(state, hash(state));
}
Integer* Object::id(STATE) {
if(reference_p()) {
#ifdef RBX_OBJECT_ID_IN_HEADER
if(object_id() == 0) {
set_object_id(++state->om->last_object_id);
}
// Shift it up so we don't waste the numeric range in the actual
// storage, but still present the id as always modulo 4, so it doesn't
// collide with the immediates, since immediates never have a tag
// ending in 00.
return Integer::from(state, object_id() << TAG_REF_WIDTH);
#else
Object* id = get_ivar(state, G(sym_object_id));
/* Lazy allocate object's ids, since most don't need them. */
if(id->nil_p()) {
/* All references have an even object_id. last_object_id starts out at 0
* but we don't want to use 0 as an object_id, so we just add before using */
id = Integer::from(state, ++state->om->last_object_id << TAG_REF_WIDTH);
set_ivar(state, G(sym_object_id), id);
}
return as<Integer>(id);
#endif
} else {
/* All non-references have the pointer directly as the object id */
return Integer::from(state, (uintptr_t)this);
}
}
bool Object::has_id(STATE) {
if(!reference_p()) return true;
#ifdef RBX_OBJECT_ID_IN_HEADER
return object_id() > 0;
#else
Object* id = get_ivar(state, G(sym_object_id));
return !id->nil_p();
#endif
}
void Object::infect(STATE, Object* other) {
if(this->tainted_p(state) == Qtrue) {
other->taint(state);
}
}
bool Object::kind_of_p(STATE, Object* module) {
Module* found = NULL;
if(!reference_p()) {
found = state->globals().special_classes[((uintptr_t)this) & SPECIAL_CLASS_MASK].get();
} else {
found = try_as<Module>(klass_);
}
while(found) {
if(found == module) return true;
if(IncludedModule* im = try_as<IncludedModule>(found)) {
if(im->module() == module) return true;
}
found = try_as<Module>(found->superclass());
}
return false;
}
Object* Object::kind_of_prim(STATE, Module* klass) {
return kind_of_p(state, klass) ? Qtrue : Qfalse;
}
Object* Object::instance_of_prim(STATE, Module* klass) {
return class_object(state) == klass ? Qtrue : Qfalse;
}
Class* Object::metaclass(STATE) {
if(reference_p()) {
if(MetaClass* mc = try_as<MetaClass>(klass())) {
// This test is very important! MetaClasses can get their
// klass() hooked up to the MetaClass of a parent class, so
// that the MOP works properly. BUT we should not return
// that parent metaclass, we need to only return a MetaClass
// that is for this!
if(mc->attached_instance() == this) return mc;
}
return MetaClass::attach(state, this);
}
return class_object(state);
}
Object* Object::send(STATE, CallFrame* caller, Symbol* name, Array* ary,
Object* block, bool allow_private) {
LookupData lookup(this, this->lookup_begin(state), allow_private);
Dispatch dis(name);
Arguments args(ary);
args.set_block(block);
args.set_recv(this);
return dis.send(state, caller, lookup, args);
}
Object* Object::send(STATE, CallFrame* caller, Symbol* name, bool allow_private) {
LookupData lookup(this, this->lookup_begin(state), allow_private);
Dispatch dis(name);
Arguments args;
args.set_block(Qnil);
args.set_recv(this);
return dis.send(state, caller, lookup, args);
}
Object* Object::send_prim(STATE, Executable* exec, CallFrame* call_frame, Dispatch& msg,
Arguments& args) {
if(args.total() < 1) return Primitives::failure();
// Don't shift the argument because we might fail and we need Arguments
// to be pristine in the fallback code.
Object* meth = args.get_argument(0);
Symbol* sym = try_as<Symbol>(meth);
if(!sym) {
if(String* str = try_as<String>(meth)) {
sym = str->to_sym(state);
} else {
return Primitives::failure();
}
}
// Discard the 1st argument.
args.shift(state);
Dispatch dis(sym);
LookupData lookup(this, this->lookup_begin(state), true);
return dis.send(state, call_frame, lookup, args);
}
void Object::set_field(STATE, size_t index, Object* val) {
type_info(state)->set_field(state, this, index, val);
}
Object* Object::set_table_ivar(STATE, Symbol* sym, Object* val) {
/* Lazy creation of a lookuptable to store instance variables. */
if(ivars()->nil_p()) {
CompactLookupTable* tbl = CompactLookupTable::create(state);
ivars(state, tbl);
tbl->store(state, sym, val);
return val;
}
if(CompactLookupTable* tbl = try_as<CompactLookupTable>(ivars())) {
if(tbl->store(state, sym, val) == Qtrue) {
return val;
}
/* No more room in the CompactLookupTable. */
ivars(state, tbl->to_lookuptable(state));
}
if(LookupTable* tbl = try_as<LookupTable>(ivars())) {
tbl->store(state, sym, val);
}
/* else.. what? */
return val;
}
Object* Object::set_ivar_prim(STATE, Symbol* sym, Object* val) {
if(sym->is_ivar_p(state)->false_p()) {
return reinterpret_cast<Object*>(kPrimitiveFailed);
}
return set_ivar(state, sym, val);
}
Object* Object::set_ivar(STATE, Symbol* sym, Object* val) {
LookupTable* tbl;
/* Implements the external ivars table for objects that don't
have their own space for ivars. */
if(!reference_p()) {
tbl = try_as<LookupTable>(G(external_ivars)->fetch(state, this));
if(!tbl) {
tbl = LookupTable::create(state);
G(external_ivars)->store(state, this, tbl);
}
tbl->store(state, sym, val);
return val;
}
if(type_id() == Object::type) return set_table_ivar(state, sym, val);
// Handle packed objects in a unique way.
if(PackedObject* po = try_as<PackedObject>(this)) {
return po->set_packed_ivar(state, sym, val);
}
/* We might be trying to access a field, so check there first. */
TypeInfo* ti = state->om->find_type_info(this);
if(ti) {
TypeInfo::Slots::iterator it = ti->slots.find(sym->index());
if(it != ti->slots.end()) {
ti->set_field(state, this, it->second, val);
return val;
}
}
return set_table_ivar(state, sym, val);
}
Object* Object::del_ivar(STATE, Symbol* sym) {
LookupTable* tbl;
bool removed = false;
/* Implements the external ivars table for objects that don't
have their own space for ivars. */
if(!reference_p()) {
tbl = try_as<LookupTable>(G(external_ivars)->fetch(state, this));
if(tbl) {
Object* val = tbl->remove(state, sym, &removed);
if(removed) return val;
}
return Primitives::failure();
}
// Handle packed objects in a unique way.
if(PackedObject* po = try_as<PackedObject>(this)) {
Object* val = po->packed_ivar_delete(state, sym, &removed);
if(removed) return val;
return Primitives::failure();
}
/* We might be trying to access a field, so check there first. */
TypeInfo* ti = state->om->find_type_info(this);
if(ti) {
TypeInfo::Slots::iterator it = ti->slots.find(sym->index());
// Can't remove a slot, so just bail.
if(it != ti->slots.end()) return Qnil;
}
Object* val = del_table_ivar(state, sym, &removed);
if(removed) return val;
return Primitives::failure();
}
Object* Object::del_table_ivar(STATE, Symbol* sym, bool* removed) {
/* No ivars, we're done! */
if(ivars()->nil_p()) return Qnil;
if(CompactLookupTable* tbl = try_as<CompactLookupTable>(ivars())) {
return tbl->remove(state, sym, removed);
} else if(LookupTable* tbl = try_as<LookupTable>(ivars())) {
return tbl->remove(state, sym, removed);
}
return Qnil;
}
String* Object::to_s(STATE, bool address) {
std::stringstream name;
if(!reference_p()) {
if(nil_p()) return String::create(state, "nil");
if(true_p()) return String::create(state, "true");
if(false_p()) return String::create(state, "false");
if(Fixnum* fix = try_as<Fixnum>(this)) {
name << fix->to_native();
return String::create(state, name.str().c_str());
} else if(Symbol* sym = try_as<Symbol>(this)) {
name << ":\"" << sym->c_str(state) << "\"";
return String::create(state, name.str().c_str());
}
}
if(String* str = try_as<String>(this)) {
return str;
} else {
name << "#<";
if(Module* mod = try_as<Module>(this)) {
if(mod->name()->nil_p()) {
name << "Class";
} else {
name << mod->name()->c_str(state);
}
name << "(" << this->class_object(state)->name()->c_str(state) << ")";
} else {
if(this->class_object(state)->name()->nil_p()) {
name << "Object";
} else {
name << this->class_object(state)->name()->c_str(state);
}
}
}
name << ":";
if(address) {
name << reinterpret_cast<void*>(this);
} else {
name << "0x" << std::hex << this->id(state)->to_native();
}
name << ">";
return String::create(state, name.str().c_str());
}
Object* Object::show(STATE) {
return show(state, 0);
}
Object* Object::show(STATE, int level) {
type_info(state)->show(state, this, level);
return Qnil;
}
Object* Object::show_simple(STATE) {
return show_simple(state, 0);
}
Object* Object::show_simple(STATE, int level) {
type_info(state)->show_simple(state, this, level);
return Qnil;
}
Object* Object::taint(STATE) {
if(reference_p()) set_tainted();
return this;
}
Object* Object::tainted_p(STATE) {
if(reference_p() && is_tainted_p()) return Qtrue;
return Qfalse;
}
TypeInfo* Object::type_info(STATE) const {
return state->om->type_info[get_type()];
}
Object* Object::untaint(STATE) {
if(reference_p()) set_tainted(0);
return this;
}
Object* Object::respond_to(STATE, Symbol* name, Object* priv) {
LookupData lookup(this, lookup_begin(state));
lookup.priv = RTEST(priv);
Dispatch dis(name);
if(!GlobalCache::resolve(state, name, dis, lookup)) {
return Qfalse;
}
return Qtrue;
}
Object* Object::respond_to_public(STATE, Object* obj) {
Symbol* name;
if(Symbol* sym = try_as<Symbol>(obj)) {
name = sym;
} else if(String* str = try_as<String>(obj)) {
name = str->to_sym(state);
} else {
return Primitives::failure();
}
LookupData lookup(this, lookup_begin(state));
lookup.priv = false;
Dispatch dis(name);
if(!GlobalCache::resolve(state, name, dis, lookup)) {
return Qfalse;
}
return Qtrue;
}
/**
* We use void* as the type for obj to work around C++'s type system
* that requires full definitions of classes to be present for it
* figure out if you can properly pass an object (the superclass
* has to be known).
*
* If we have Object* obj here, then we either have to cast to call
* write_barrier (which means we lose the ability to have type specific
* write_barrier versions, which we do), or we have to include
* every header up front. We opt for the former.
*/
void Object::inline_write_barrier_passed(STATE, void* obj) {
if(!remembered_p()) {
state->om->remember_object(this);
}
}
void Object::write_barrier(gc::WriteBarrier* wb, void* obj) {
wb->write_barrier(this, reinterpret_cast<Object*>(obj));
}
}