factor/vm/dispatch.cpp

208 lines
4.9 KiB
C++
Raw Normal View History

2009-05-02 05:04:19 -04:00
#include "master.hpp"
2009-05-04 02:46:13 -04:00
namespace factor
{
2009-09-23 14:05:46 -04:00
cell factor_vm::search_lookup_alist(cell table, cell klass)
2009-05-02 05:04:19 -04:00
{
array *elements = untag<array>(table);
fixnum index = array_capacity(elements) - 2;
2009-05-02 05:04:19 -04:00
while(index >= 0)
{
if(array_nth(elements,index) == klass)
return array_nth(elements,index + 1);
2009-05-02 05:04:19 -04:00
else
index -= 2;
2009-05-02 05:04:19 -04:00
}
return false_object;
2009-05-02 05:04:19 -04:00
}
2009-09-23 14:05:46 -04:00
cell factor_vm::search_lookup_hash(cell table, cell klass, cell hashcode)
2009-05-02 05:04:19 -04:00
{
2009-05-04 05:50:24 -04:00
array *buckets = untag<array>(table);
cell bucket = array_nth(buckets,hashcode & (array_capacity(buckets) - 1));
if(tagged<object>(bucket).type_p(WORD_TYPE) || !to_boolean(bucket))
2009-05-02 05:04:19 -04:00
return bucket;
else
return search_lookup_alist(bucket,klass);
}
2009-09-23 14:05:46 -04:00
cell factor_vm::nth_superclass(tuple_layout *layout, fixnum echelon)
2009-05-02 05:04:19 -04:00
{
2009-05-04 05:50:24 -04:00
cell *ptr = (cell *)(layout + 1);
2009-05-02 05:04:19 -04:00
return ptr[echelon * 2];
}
2009-09-23 14:05:46 -04:00
cell factor_vm::nth_hashcode(tuple_layout *layout, fixnum echelon)
2009-05-02 05:04:19 -04:00
{
2009-05-04 05:50:24 -04:00
cell *ptr = (cell *)(layout + 1);
2009-05-02 05:04:19 -04:00
return ptr[echelon * 2 + 1];
}
2009-09-23 14:05:46 -04:00
cell factor_vm::lookup_tuple_method(cell obj, cell methods)
2009-05-02 05:04:19 -04:00
{
2009-05-04 05:50:24 -04:00
tuple_layout *layout = untag<tuple_layout>(untag<tuple>(obj)->layout);
2009-05-02 05:04:19 -04:00
2009-05-04 05:50:24 -04:00
array *echelons = untag<array>(methods);
2009-05-02 05:04:19 -04:00
2009-05-04 05:50:24 -04:00
fixnum echelon = untag_fixnum(layout->echelon);
fixnum max_echelon = array_capacity(echelons) - 1;
2009-05-02 05:04:19 -04:00
if(echelon > max_echelon) echelon = max_echelon;
while(echelon >= 0)
{
2009-05-04 05:50:24 -04:00
cell echelon_methods = array_nth(echelons,echelon);
2009-05-02 05:04:19 -04:00
2009-05-04 05:50:24 -04:00
if(tagged<object>(echelon_methods).type_p(WORD_TYPE))
2009-05-02 05:04:19 -04:00
return echelon_methods;
else if(to_boolean(echelon_methods))
2009-05-02 05:04:19 -04:00
{
2009-05-04 05:50:24 -04:00
cell klass = nth_superclass(layout,echelon);
cell hashcode = untag_fixnum(nth_hashcode(layout,echelon));
cell result = search_lookup_hash(echelon_methods,klass,hashcode);
if(to_boolean(result))
2009-05-02 05:04:19 -04:00
return result;
}
echelon--;
}
critical_error("Cannot find tuple method",methods);
return false_object;
2009-05-02 05:04:19 -04:00
}
2009-09-23 14:05:46 -04:00
cell factor_vm::lookup_hi_tag_method(cell obj, cell methods)
2009-05-02 05:04:19 -04:00
{
2009-05-04 05:50:24 -04:00
array *hi_tag_methods = untag<array>(methods);
cell tag = untag<object>(obj)->h.hi_tag() - HEADER_TYPE;
2009-05-02 05:04:19 -04:00
#ifdef FACTOR_DEBUG
assert(tag < TYPE_COUNT - HEADER_TYPE);
#endif
return array_nth(hi_tag_methods,tag);
}
2009-09-23 14:05:46 -04:00
cell factor_vm::lookup_hairy_method(cell obj, cell methods)
2009-05-02 05:04:19 -04:00
{
2009-05-04 05:50:24 -04:00
cell method = array_nth(untag<array>(methods),TAG(obj));
if(tagged<object>(method).type_p(WORD_TYPE))
2009-05-02 05:04:19 -04:00
return method;
else
{
2009-05-04 05:50:24 -04:00
switch(TAG(obj))
2009-05-02 05:04:19 -04:00
{
case TUPLE_TYPE:
2009-05-04 05:50:24 -04:00
return lookup_tuple_method(obj,method);
2009-05-02 05:04:19 -04:00
break;
case OBJECT_TYPE:
2009-05-04 05:50:24 -04:00
return lookup_hi_tag_method(obj,method);
2009-05-02 05:04:19 -04:00
break;
default:
critical_error("Bad methods array",methods);
return 0;
2009-05-02 05:04:19 -04:00
}
}
}
2009-09-23 14:05:46 -04:00
cell factor_vm::lookup_method(cell obj, cell methods)
2009-05-02 05:04:19 -04:00
{
2009-05-04 05:50:24 -04:00
cell tag = TAG(obj);
if(tag == TUPLE_TYPE || tag == OBJECT_TYPE)
2009-05-04 05:50:24 -04:00
return lookup_hairy_method(obj,methods);
else
2009-05-04 05:50:24 -04:00
return array_nth(untag<array>(methods),TAG(obj));
2009-05-02 05:04:19 -04:00
}
void factor_vm::primitive_lookup_method()
2009-05-02 05:04:19 -04:00
{
2009-05-04 05:50:24 -04:00
cell methods = dpop();
cell obj = dpop();
dpush(lookup_method(obj,methods));
2009-05-02 05:04:19 -04:00
}
2009-09-23 14:05:46 -04:00
cell factor_vm::object_class(cell obj)
2009-05-02 05:04:19 -04:00
{
2009-05-04 05:50:24 -04:00
switch(TAG(obj))
{
case TUPLE_TYPE:
2009-05-04 05:50:24 -04:00
return untag<tuple>(obj)->layout;
case OBJECT_TYPE:
2009-05-04 05:50:24 -04:00
return untag<object>(obj)->h.value;
default:
2009-05-04 05:50:24 -04:00
return tag_fixnum(TAG(obj));
}
2009-05-02 05:04:19 -04:00
}
2009-09-23 14:05:46 -04:00
cell factor_vm::method_cache_hashcode(cell klass, array *array)
2009-05-02 05:04:19 -04:00
{
2009-05-04 05:50:24 -04:00
cell capacity = (array_capacity(array) >> 1) - 1;
2009-05-02 05:04:19 -04:00
return ((klass >> TAG_BITS) & capacity) << 1;
}
2009-09-23 14:05:46 -04:00
void factor_vm::update_method_cache(cell cache, cell klass, cell method)
2009-05-02 05:04:19 -04:00
{
2009-05-04 05:50:24 -04:00
array *cache_elements = untag<array>(cache);
cell hashcode = method_cache_hashcode(klass,cache_elements);
set_array_nth(cache_elements,hashcode,klass);
set_array_nth(cache_elements,hashcode + 1,method);
2009-05-02 05:04:19 -04:00
}
void factor_vm::primitive_mega_cache_miss()
2009-05-02 05:04:19 -04:00
{
megamorphic_cache_misses++;
2009-05-04 05:50:24 -04:00
cell cache = dpop();
fixnum index = untag_fixnum(dpop());
cell methods = dpop();
2009-05-02 05:04:19 -04:00
2009-05-04 05:50:24 -04:00
cell object = ((cell *)ds)[-index];
cell klass = object_class(object);
cell method = lookup_method(object,methods);
2009-05-02 05:04:19 -04:00
update_method_cache(cache,klass,method);
dpush(method);
}
void factor_vm::primitive_reset_dispatch_stats()
2009-05-02 05:04:19 -04:00
{
megamorphic_cache_hits = megamorphic_cache_misses = 0;
}
void factor_vm::primitive_dispatch_stats()
2009-05-02 05:04:19 -04:00
{
growable_array stats(this);
2009-05-02 10:19:09 -04:00
stats.add(allot_cell(megamorphic_cache_hits));
stats.add(allot_cell(megamorphic_cache_misses));
stats.trim();
2009-05-04 05:50:24 -04:00
dpush(stats.elements.value());
2009-05-02 05:04:19 -04:00
}
2009-05-04 05:50:24 -04:00
void quotation_jit::emit_mega_cache_lookup(cell methods_, fixnum index, cell cache_)
2009-05-02 05:04:19 -04:00
{
gc_root<array> methods(methods_,parent_vm);
gc_root<array> cache(cache_,parent_vm);
2009-05-02 05:04:19 -04:00
/* Generate machine code to determine the object's class. */
2009-05-02 10:19:09 -04:00
emit_class_lookup(index,PIC_HI_TAG_TUPLE);
2009-05-02 05:04:19 -04:00
/* Do a cache lookup. */
emit_with(parent_vm->userenv[MEGA_LOOKUP],cache.value());
2009-05-02 05:04:19 -04:00
/* If we end up here, the cache missed. */
emit(parent_vm->userenv[JIT_PROLOG]);
2009-05-02 05:04:19 -04:00
/* Push index, method table and cache on the stack. */
2009-05-02 10:19:09 -04:00
push(methods.value());
push(tag_fixnum(index));
push(cache.value());
word_call(parent_vm->userenv[MEGA_MISS_WORD]);
2009-05-02 05:04:19 -04:00
/* Now the new method has been stored into the cache, and its on
the stack. */
emit(parent_vm->userenv[JIT_EPILOG]);
emit(parent_vm->userenv[JIT_EXECUTE_JUMP]);
2009-05-02 05:04:19 -04:00
}
2009-05-04 02:46:13 -04:00
}