| Index: src/ic.cc
|
| diff --git a/src/ic.cc b/src/ic.cc
|
| index 96f1804f57b58cae3d707c85bcbbc615cd03ccaa..25f875a8379308e3230592f8a74348dffa5672df 100644
|
| --- a/src/ic.cc
|
| +++ b/src/ic.cc
|
| @@ -89,9 +89,10 @@ void IC::TraceIC(const char* type,
|
| }
|
| }
|
| JavaScriptFrame::PrintTop(isolate(), stdout, false, true);
|
| - Code::ExtraICState extra_state = new_target->extra_ic_state();
|
| + ExtraICState extra_state = new_target->extra_ic_state();
|
| const char* modifier =
|
| - GetTransitionMarkModifier(Code::GetKeyedAccessStoreMode(extra_state));
|
| + GetTransitionMarkModifier(
|
| + KeyedStoreIC::GetKeyedAccessStoreMode(extra_state));
|
| PrintF(" (%c->%c%s)",
|
| TransitionMarkFromState(state()),
|
| TransitionMarkFromState(new_state),
|
| @@ -439,9 +440,6 @@ static int ComputeTypeInfoCountDelta(IC::State old_state, IC::State new_state) {
|
|
|
|
|
| void IC::PostPatching(Address address, Code* target, Code* old_target) {
|
| - if (FLAG_type_info_threshold == 0 && !FLAG_watch_ic_patching) {
|
| - return;
|
| - }
|
| Isolate* isolate = target->GetHeap()->isolate();
|
| Code* host = isolate->
|
| inner_pointer_to_code_cache()->GetCacheEntry(address)->code;
|
| @@ -464,10 +462,8 @@ void IC::PostPatching(Address address, Code* target, Code* old_target) {
|
| TypeFeedbackInfo::cast(host->type_feedback_info());
|
| info->change_own_type_change_checksum();
|
| }
|
| - if (FLAG_watch_ic_patching) {
|
| - host->set_profiler_ticks(0);
|
| - isolate->runtime_profiler()->NotifyICChanged();
|
| - }
|
| + host->set_profiler_ticks(0);
|
| + isolate->runtime_profiler()->NotifyICChanged();
|
| // TODO(2029): When an optimized function is patched, it would
|
| // be nice to propagate the corresponding type information to its
|
| // unoptimized version for the benefit of later inlining.
|
| @@ -532,7 +528,7 @@ void StoreIC::Clear(Isolate* isolate, Address address, Code* target) {
|
| if (IsCleared(target)) return;
|
| SetTargetAtAddress(address,
|
| *pre_monomorphic_stub(
|
| - isolate, Code::GetStrictMode(target->extra_ic_state())));
|
| + isolate, StoreIC::GetStrictMode(target->extra_ic_state())));
|
| }
|
|
|
|
|
| @@ -540,7 +536,7 @@ void KeyedStoreIC::Clear(Isolate* isolate, Address address, Code* target) {
|
| if (IsCleared(target)) return;
|
| SetTargetAtAddress(address,
|
| *pre_monomorphic_stub(
|
| - isolate, Code::GetStrictMode(target->extra_ic_state())));
|
| + isolate, StoreIC::GetStrictMode(target->extra_ic_state())));
|
| }
|
|
|
|
|
| @@ -783,7 +779,7 @@ void CallICBase::UpdateCaches(LookupResult* lookup,
|
| : Handle<JSObject>(JSObject::cast(object->GetPrototype(isolate())),
|
| isolate());
|
|
|
| - PatchCache(handle(Type::OfCurrently(cache_object), isolate()), name, code);
|
| + PatchCache(CurrentTypeOf(cache_object, isolate()), name, code);
|
| TRACE_IC("CallIC", name);
|
| }
|
|
|
| @@ -822,7 +818,7 @@ MaybeObject* KeyedCallIC::LoadFunction(Handle<Object> object,
|
|
|
| if (stub.is_null()) {
|
| stub = isolate()->stub_cache()->ComputeCallMegamorphic(
|
| - argc, Code::KEYED_CALL_IC, Code::kNoExtraICState);
|
| + argc, Code::KEYED_CALL_IC, kNoExtraICState);
|
| if (object->IsJSObject()) {
|
| Handle<JSObject> receiver = Handle<JSObject>::cast(object);
|
| if (receiver->elements()->map() ==
|
| @@ -879,9 +875,7 @@ MaybeObject* LoadIC::Load(Handle<Object> object,
|
| }
|
| if (!stub.is_null()) {
|
| set_target(*stub);
|
| -#ifdef DEBUG
|
| if (FLAG_trace_ic) PrintF("[LoadIC : +#length /stringwrapper]\n");
|
| -#endif
|
| }
|
| // Get the string if we have a string wrapper object.
|
| String* string = String::cast(JSValue::cast(*object)->value());
|
| @@ -904,9 +898,7 @@ MaybeObject* LoadIC::Load(Handle<Object> object,
|
| }
|
| if (!stub.is_null()) {
|
| set_target(*stub);
|
| -#ifdef DEBUG
|
| if (FLAG_trace_ic) PrintF("[LoadIC : +#prototype /function]\n");
|
| -#endif
|
| }
|
| return *Accessors::FunctionGetPrototype(Handle<JSFunction>::cast(object));
|
| }
|
| @@ -989,7 +981,7 @@ bool IC::UpdatePolymorphicIC(Handle<Type> type,
|
| // If the receiver type is already in the polymorphic IC, this indicates
|
| // there was a prototoype chain failure. In that case, just overwrite the
|
| // handler.
|
| - } else if (type->Is(current_type)) {
|
| + } else if (type->IsCurrently(current_type)) {
|
| ASSERT(handler_to_overwrite == -1);
|
| number_of_valid_types--;
|
| handler_to_overwrite = i;
|
| @@ -1009,15 +1001,26 @@ bool IC::UpdatePolymorphicIC(Handle<Type> type,
|
| }
|
|
|
| Handle<Code> ic = isolate()->stub_cache()->ComputePolymorphicIC(
|
| - &types, &handlers, number_of_valid_types, name, strict_mode());
|
| + &types, &handlers, number_of_valid_types, name, extra_ic_state());
|
| set_target(*ic);
|
| return true;
|
| }
|
|
|
|
|
| +Handle<Type> IC::CurrentTypeOf(Handle<Object> object, Isolate* isolate) {
|
| + Type* type = object->IsJSGlobalObject()
|
| + ? Type::Constant(Handle<JSGlobalObject>::cast(object))
|
| + : Type::OfCurrently(object);
|
| + return handle(type, isolate);
|
| +}
|
| +
|
| +
|
| Handle<Map> IC::TypeToMap(Type* type, Isolate* isolate) {
|
| if (type->Is(Type::Number())) return isolate->factory()->heap_number_map();
|
| if (type->Is(Type::Boolean())) return isolate->factory()->oddball_map();
|
| + if (type->IsConstant()) {
|
| + return handle(Handle<JSGlobalObject>::cast(type->AsConstant())->map());
|
| + }
|
| ASSERT(type->IsClass());
|
| return type->AsClass();
|
| }
|
| @@ -1036,7 +1039,7 @@ void IC::UpdateMonomorphicIC(Handle<Type> type,
|
| Handle<String> name) {
|
| if (!handler->is_handler()) return set_target(*handler);
|
| Handle<Code> ic = isolate()->stub_cache()->ComputeMonomorphicIC(
|
| - name, type, handler, strict_mode());
|
| + name, type, handler, extra_ic_state());
|
| set_target(*ic);
|
| }
|
|
|
| @@ -1134,13 +1137,14 @@ void LoadIC::UpdateCaches(LookupResult* lookup,
|
| return;
|
| }
|
|
|
| + Handle<Type> type = CurrentTypeOf(object, isolate());
|
| Handle<Code> code;
|
| if (!lookup->IsCacheable()) {
|
| // Bail out if the result is not cacheable.
|
| code = slow_stub();
|
| } else if (!lookup->IsProperty()) {
|
| if (kind() == Code::LOAD_IC) {
|
| - code = isolate()->stub_cache()->ComputeLoadNonexistent(name, object);
|
| + code = isolate()->stub_cache()->ComputeLoadNonexistent(name, type);
|
| } else {
|
| code = slow_stub();
|
| }
|
| @@ -1148,7 +1152,7 @@ void LoadIC::UpdateCaches(LookupResult* lookup,
|
| code = ComputeHandler(lookup, object, name);
|
| }
|
|
|
| - PatchCache(handle(Type::OfCurrently(object), isolate()), name, code);
|
| + PatchCache(type, name, code);
|
| TRACE_IC("LoadIC", name);
|
| }
|
|
|
| @@ -1170,7 +1174,7 @@ Handle<Code> IC::ComputeHandler(LookupResult* lookup,
|
| isolate(), *object, cache_holder));
|
|
|
| Handle<Code> code = isolate()->stub_cache()->FindHandler(
|
| - name, stub_holder, kind(), cache_holder, strict_mode());
|
| + name, handle(stub_holder->map()), kind(), cache_holder);
|
| if (!code.is_null()) return code;
|
|
|
| code = CompileHandler(lookup, object, name, value, cache_holder);
|
| @@ -1194,8 +1198,9 @@ Handle<Code> LoadIC::CompileHandler(LookupResult* lookup,
|
| return SimpleFieldLoad(length_index);
|
| }
|
|
|
| + Handle<Type> type = CurrentTypeOf(object, isolate());
|
| Handle<JSObject> holder(lookup->holder());
|
| - LoadStubCompiler compiler(isolate(), cache_holder, kind());
|
| + LoadStubCompiler compiler(isolate(), kNoExtraICState, cache_holder, kind());
|
|
|
| switch (lookup->type()) {
|
| case FIELD: {
|
| @@ -1206,14 +1211,14 @@ Handle<Code> LoadIC::CompileHandler(LookupResult* lookup,
|
| lookup->representation());
|
| }
|
| return compiler.CompileLoadField(
|
| - object, holder, name, field, lookup->representation());
|
| + type, holder, name, field, lookup->representation());
|
| }
|
| case CONSTANT: {
|
| Handle<Object> constant(lookup->GetConstant(), isolate());
|
| // TODO(2803): Don't compute a stub for cons strings because they cannot
|
| // be embedded into code.
|
| if (constant->IsConsString()) break;
|
| - return compiler.CompileLoadConstant(object, holder, name, constant);
|
| + return compiler.CompileLoadConstant(type, holder, name, constant);
|
| }
|
| case NORMAL:
|
| if (kind() != Code::LOAD_IC) break;
|
| @@ -1222,7 +1227,7 @@ Handle<Code> LoadIC::CompileHandler(LookupResult* lookup,
|
| Handle<PropertyCell> cell(
|
| global->GetPropertyCell(lookup), isolate());
|
| Handle<Code> code = compiler.CompileLoadGlobal(
|
| - object, global, cell, name, lookup->IsDontDelete());
|
| + type, global, cell, name, lookup->IsDontDelete());
|
| // TODO(verwaest): Move caching of these NORMAL stubs outside as well.
|
| Handle<HeapObject> stub_holder(GetCodeCacheHolder(
|
| isolate(), *object, cache_holder));
|
| @@ -1252,7 +1257,7 @@ Handle<Code> LoadIC::CompileHandler(LookupResult* lookup,
|
| Handle<ExecutableAccessorInfo>::cast(callback);
|
| if (v8::ToCData<Address>(info->getter()) == 0) break;
|
| if (!info->IsCompatibleReceiver(*object)) break;
|
| - return compiler.CompileLoadCallback(object, holder, name, info);
|
| + return compiler.CompileLoadCallback(type, holder, name, info);
|
| } else if (callback->IsAccessorPair()) {
|
| Handle<Object> getter(Handle<AccessorPair>::cast(callback)->getter(),
|
| isolate());
|
| @@ -1271,9 +1276,9 @@ Handle<Code> LoadIC::CompileHandler(LookupResult* lookup,
|
| if (call_optimization.is_simple_api_call() &&
|
| call_optimization.IsCompatibleReceiver(*object)) {
|
| return compiler.CompileLoadCallback(
|
| - object, holder, name, call_optimization);
|
| + type, holder, name, call_optimization);
|
| }
|
| - return compiler.CompileLoadViaGetter(object, holder, name, function);
|
| + return compiler.CompileLoadViaGetter(type, holder, name, function);
|
| }
|
| // TODO(dcarney): Handle correctly.
|
| if (callback->IsDeclaredAccessorInfo()) break;
|
| @@ -1283,7 +1288,7 @@ Handle<Code> LoadIC::CompileHandler(LookupResult* lookup,
|
| }
|
| case INTERCEPTOR:
|
| ASSERT(HasInterceptorGetter(*holder));
|
| - return compiler.CompileLoadInterceptor(object, holder, name);
|
| + return compiler.CompileLoadInterceptor(type, holder, name);
|
| default:
|
| break;
|
| }
|
| @@ -1444,7 +1449,8 @@ static bool LookupForWrite(Handle<JSObject> receiver,
|
| }
|
|
|
| if (lookup->IsPropertyCallbacks()) return true;
|
| -
|
| + // JSGlobalProxy always goes via the runtime, so it's safe to cache.
|
| + if (receiver->IsJSGlobalProxy()) return true;
|
| // Currently normal holders in the prototype chain are not supported. They
|
| // would require a runtime positive lookup and verification that the details
|
| // have not changed.
|
| @@ -1551,20 +1557,6 @@ MaybeObject* StoreIC::Store(Handle<Object> object,
|
| return *result;
|
| }
|
|
|
| - if (receiver->IsJSGlobalProxy()) {
|
| - if (FLAG_use_ic && kind() != Code::KEYED_STORE_IC) {
|
| - // Generate a generic stub that goes to the runtime when we see a global
|
| - // proxy as receiver.
|
| - Handle<Code> stub = global_proxy_stub();
|
| - set_target(*stub);
|
| - TRACE_IC("StoreIC", name);
|
| - }
|
| - Handle<Object> result = JSReceiver::SetProperty(
|
| - receiver, name, value, NONE, strict_mode(), store_mode);
|
| - RETURN_IF_EMPTY_HANDLE(isolate(), result);
|
| - return *result;
|
| - }
|
| -
|
| LookupResult lookup(isolate());
|
| bool can_store = LookupForWrite(receiver, name, value, &lookup, this);
|
| if (!can_store &&
|
| @@ -1601,7 +1593,6 @@ void StoreIC::UpdateCaches(LookupResult* lookup,
|
| Handle<JSObject> receiver,
|
| Handle<String> name,
|
| Handle<Object> value) {
|
| - ASSERT(!receiver->IsJSGlobalProxy());
|
| ASSERT(lookup->IsFound());
|
|
|
| // These are not cacheable, so we never see such LookupResults here.
|
| @@ -1609,7 +1600,7 @@ void StoreIC::UpdateCaches(LookupResult* lookup,
|
|
|
| Handle<Code> code = ComputeHandler(lookup, receiver, name, value);
|
|
|
| - PatchCache(handle(Type::OfCurrently(receiver), isolate()), name, code);
|
| + PatchCache(CurrentTypeOf(receiver, isolate()), name, code);
|
| TRACE_IC("StoreIC", name);
|
| }
|
|
|
| @@ -1619,12 +1610,14 @@ Handle<Code> StoreIC::CompileHandler(LookupResult* lookup,
|
| Handle<String> name,
|
| Handle<Object> value,
|
| InlineCacheHolderFlag cache_holder) {
|
| + if (object->IsJSGlobalProxy()) return slow_stub();
|
| ASSERT(cache_holder == OWN_MAP);
|
| // This is currently guaranteed by checks in StoreIC::Store.
|
| Handle<JSObject> receiver = Handle<JSObject>::cast(object);
|
|
|
| Handle<JSObject> holder(lookup->holder());
|
| - StoreStubCompiler compiler(isolate(), strict_mode(), kind());
|
| + // Handlers do not use strict mode.
|
| + StoreStubCompiler compiler(isolate(), kNonStrictMode, kind());
|
| switch (lookup->type()) {
|
| case FIELD:
|
| return compiler.CompileStoreField(receiver, lookup, name);
|
| @@ -1652,7 +1645,7 @@ Handle<Code> StoreIC::CompileHandler(LookupResult* lookup,
|
| Handle<GlobalObject> global = Handle<GlobalObject>::cast(receiver);
|
| Handle<PropertyCell> cell(global->GetPropertyCell(lookup), isolate());
|
| Handle<Type> union_type = PropertyCell::UpdatedType(cell, value);
|
| - StoreGlobalStub stub(strict_mode(), union_type->IsConstant());
|
| + StoreGlobalStub stub(union_type->IsConstant());
|
|
|
| Handle<Code> code = stub.GetCodeCopyFromTemplate(
|
| isolate(), receiver->map(), *cell);
|
| @@ -1661,9 +1654,7 @@ Handle<Code> StoreIC::CompileHandler(LookupResult* lookup,
|
| return code;
|
| }
|
| ASSERT(holder.is_identical_to(receiver));
|
| - return strict_mode() == kStrictMode
|
| - ? isolate()->builtins()->StoreIC_Normal_Strict()
|
| - : isolate()->builtins()->StoreIC_Normal();
|
| + return isolate()->builtins()->StoreIC_Normal();
|
| case CALLBACKS: {
|
| if (kind() == Code::KEYED_STORE_IC) break;
|
| Handle<Object> callback(lookup->GetCallbackObject(), isolate());
|
| @@ -1745,7 +1736,7 @@ Handle<Code> KeyedStoreIC::StoreElementStub(Handle<JSObject> receiver,
|
| // superset of the original IC. Handle those here if the receiver map hasn't
|
| // changed or it has transitioned to a more general kind.
|
| KeyedAccessStoreMode old_store_mode =
|
| - Code::GetKeyedAccessStoreMode(target()->extra_ic_state());
|
| + KeyedStoreIC::GetKeyedAccessStoreMode(target()->extra_ic_state());
|
| Handle<Map> previous_receiver_map = target_receiver_maps.at(0);
|
| if (state() == MONOMORPHIC) {
|
| // If the "old" and "new" maps are in the same elements map family, stay
|
| @@ -2321,80 +2312,464 @@ RUNTIME_FUNCTION(MaybeObject*, ElementsTransitionAndStoreIC_Miss) {
|
| }
|
|
|
|
|
| -const char* BinaryOpIC::GetName(TypeInfo type_info) {
|
| - switch (type_info) {
|
| - case UNINITIALIZED: return "Uninitialized";
|
| +BinaryOpIC::State::State(ExtraICState extra_ic_state) {
|
| + // We don't deserialize the SSE2 Field, since this is only used to be able
|
| + // to include SSE2 as well as non-SSE2 versions in the snapshot. For code
|
| + // generation we always want it to reflect the current state.
|
| + op_ = static_cast<Token::Value>(
|
| + FIRST_TOKEN + OpField::decode(extra_ic_state));
|
| + mode_ = OverwriteModeField::decode(extra_ic_state);
|
| + fixed_right_arg_ = Maybe<int>(
|
| + HasFixedRightArgField::decode(extra_ic_state),
|
| + 1 << FixedRightArgValueField::decode(extra_ic_state));
|
| + left_kind_ = LeftKindField::decode(extra_ic_state);
|
| + if (fixed_right_arg_.has_value) {
|
| + right_kind_ = Smi::IsValid(fixed_right_arg_.value) ? SMI : INT32;
|
| + } else {
|
| + right_kind_ = RightKindField::decode(extra_ic_state);
|
| + }
|
| + result_kind_ = ResultKindField::decode(extra_ic_state);
|
| + ASSERT_LE(FIRST_TOKEN, op_);
|
| + ASSERT_LE(op_, LAST_TOKEN);
|
| +}
|
| +
|
| +
|
| +ExtraICState BinaryOpIC::State::GetExtraICState() const {
|
| + bool sse2 = (Max(result_kind_, Max(left_kind_, right_kind_)) > SMI &&
|
| + CpuFeatures::IsSafeForSnapshot(SSE2));
|
| + ExtraICState extra_ic_state =
|
| + SSE2Field::encode(sse2) |
|
| + OpField::encode(op_ - FIRST_TOKEN) |
|
| + OverwriteModeField::encode(mode_) |
|
| + LeftKindField::encode(left_kind_) |
|
| + ResultKindField::encode(result_kind_) |
|
| + HasFixedRightArgField::encode(fixed_right_arg_.has_value);
|
| + if (fixed_right_arg_.has_value) {
|
| + extra_ic_state = FixedRightArgValueField::update(
|
| + extra_ic_state, WhichPowerOf2(fixed_right_arg_.value));
|
| + } else {
|
| + extra_ic_state = RightKindField::update(extra_ic_state, right_kind_);
|
| + }
|
| + return extra_ic_state;
|
| +}
|
| +
|
| +
|
| +// static
|
| +void BinaryOpIC::State::GenerateAheadOfTime(
|
| + Isolate* isolate, void (*Generate)(Isolate*, const State&)) {
|
| + // TODO(olivf) We should investigate why adding stubs to the snapshot is so
|
| + // expensive at runtime. When solved we should be able to add most binops to
|
| + // the snapshot instead of hand-picking them.
|
| + // Generated list of commonly used stubs
|
| +#define GENERATE(op, left_kind, right_kind, result_kind, mode) \
|
| + do { \
|
| + State state(op, mode); \
|
| + state.left_kind_ = left_kind; \
|
| + state.fixed_right_arg_.has_value = false; \
|
| + state.right_kind_ = right_kind; \
|
| + state.result_kind_ = result_kind; \
|
| + Generate(isolate, state); \
|
| + } while (false)
|
| + GENERATE(Token::ADD, INT32, INT32, INT32, NO_OVERWRITE);
|
| + GENERATE(Token::ADD, INT32, INT32, INT32, OVERWRITE_LEFT);
|
| + GENERATE(Token::ADD, INT32, INT32, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::ADD, INT32, INT32, NUMBER, OVERWRITE_LEFT);
|
| + GENERATE(Token::ADD, INT32, NUMBER, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::ADD, INT32, NUMBER, NUMBER, OVERWRITE_LEFT);
|
| + GENERATE(Token::ADD, INT32, NUMBER, NUMBER, OVERWRITE_RIGHT);
|
| + GENERATE(Token::ADD, INT32, SMI, INT32, NO_OVERWRITE);
|
| + GENERATE(Token::ADD, INT32, SMI, INT32, OVERWRITE_LEFT);
|
| + GENERATE(Token::ADD, INT32, SMI, INT32, OVERWRITE_RIGHT);
|
| + GENERATE(Token::ADD, NUMBER, INT32, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::ADD, NUMBER, INT32, NUMBER, OVERWRITE_LEFT);
|
| + GENERATE(Token::ADD, NUMBER, INT32, NUMBER, OVERWRITE_RIGHT);
|
| + GENERATE(Token::ADD, NUMBER, NUMBER, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::ADD, NUMBER, NUMBER, NUMBER, OVERWRITE_LEFT);
|
| + GENERATE(Token::ADD, NUMBER, NUMBER, NUMBER, OVERWRITE_RIGHT);
|
| + GENERATE(Token::ADD, NUMBER, SMI, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::ADD, NUMBER, SMI, NUMBER, OVERWRITE_LEFT);
|
| + GENERATE(Token::ADD, NUMBER, SMI, NUMBER, OVERWRITE_RIGHT);
|
| + GENERATE(Token::ADD, SMI, INT32, INT32, NO_OVERWRITE);
|
| + GENERATE(Token::ADD, SMI, INT32, INT32, OVERWRITE_LEFT);
|
| + GENERATE(Token::ADD, SMI, INT32, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::ADD, SMI, NUMBER, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::ADD, SMI, NUMBER, NUMBER, OVERWRITE_LEFT);
|
| + GENERATE(Token::ADD, SMI, NUMBER, NUMBER, OVERWRITE_RIGHT);
|
| + GENERATE(Token::ADD, SMI, SMI, INT32, OVERWRITE_LEFT);
|
| + GENERATE(Token::ADD, SMI, SMI, SMI, OVERWRITE_RIGHT);
|
| + GENERATE(Token::BIT_AND, INT32, INT32, INT32, NO_OVERWRITE);
|
| + GENERATE(Token::BIT_AND, INT32, INT32, INT32, OVERWRITE_LEFT);
|
| + GENERATE(Token::BIT_AND, INT32, INT32, INT32, OVERWRITE_RIGHT);
|
| + GENERATE(Token::BIT_AND, INT32, INT32, SMI, NO_OVERWRITE);
|
| + GENERATE(Token::BIT_AND, INT32, INT32, SMI, OVERWRITE_RIGHT);
|
| + GENERATE(Token::BIT_AND, INT32, SMI, INT32, NO_OVERWRITE);
|
| + GENERATE(Token::BIT_AND, INT32, SMI, INT32, OVERWRITE_RIGHT);
|
| + GENERATE(Token::BIT_AND, INT32, SMI, SMI, NO_OVERWRITE);
|
| + GENERATE(Token::BIT_AND, INT32, SMI, SMI, OVERWRITE_LEFT);
|
| + GENERATE(Token::BIT_AND, INT32, SMI, SMI, OVERWRITE_RIGHT);
|
| + GENERATE(Token::BIT_AND, NUMBER, INT32, INT32, OVERWRITE_RIGHT);
|
| + GENERATE(Token::BIT_AND, NUMBER, SMI, SMI, NO_OVERWRITE);
|
| + GENERATE(Token::BIT_AND, NUMBER, SMI, SMI, OVERWRITE_RIGHT);
|
| + GENERATE(Token::BIT_AND, SMI, INT32, INT32, NO_OVERWRITE);
|
| + GENERATE(Token::BIT_AND, SMI, INT32, SMI, OVERWRITE_RIGHT);
|
| + GENERATE(Token::BIT_AND, SMI, NUMBER, SMI, OVERWRITE_RIGHT);
|
| + GENERATE(Token::BIT_AND, SMI, SMI, SMI, NO_OVERWRITE);
|
| + GENERATE(Token::BIT_AND, SMI, SMI, SMI, OVERWRITE_LEFT);
|
| + GENERATE(Token::BIT_AND, SMI, SMI, SMI, OVERWRITE_RIGHT);
|
| + GENERATE(Token::BIT_OR, INT32, INT32, INT32, OVERWRITE_LEFT);
|
| + GENERATE(Token::BIT_OR, INT32, INT32, INT32, OVERWRITE_RIGHT);
|
| + GENERATE(Token::BIT_OR, INT32, INT32, SMI, OVERWRITE_LEFT);
|
| + GENERATE(Token::BIT_OR, INT32, SMI, INT32, NO_OVERWRITE);
|
| + GENERATE(Token::BIT_OR, INT32, SMI, INT32, OVERWRITE_LEFT);
|
| + GENERATE(Token::BIT_OR, INT32, SMI, INT32, OVERWRITE_RIGHT);
|
| + GENERATE(Token::BIT_OR, INT32, SMI, SMI, NO_OVERWRITE);
|
| + GENERATE(Token::BIT_OR, INT32, SMI, SMI, OVERWRITE_RIGHT);
|
| + GENERATE(Token::BIT_OR, NUMBER, SMI, INT32, NO_OVERWRITE);
|
| + GENERATE(Token::BIT_OR, NUMBER, SMI, INT32, OVERWRITE_LEFT);
|
| + GENERATE(Token::BIT_OR, NUMBER, SMI, INT32, OVERWRITE_RIGHT);
|
| + GENERATE(Token::BIT_OR, NUMBER, SMI, SMI, NO_OVERWRITE);
|
| + GENERATE(Token::BIT_OR, NUMBER, SMI, SMI, OVERWRITE_LEFT);
|
| + GENERATE(Token::BIT_OR, SMI, INT32, INT32, OVERWRITE_LEFT);
|
| + GENERATE(Token::BIT_OR, SMI, INT32, INT32, OVERWRITE_RIGHT);
|
| + GENERATE(Token::BIT_OR, SMI, INT32, SMI, OVERWRITE_RIGHT);
|
| + GENERATE(Token::BIT_OR, SMI, SMI, SMI, OVERWRITE_LEFT);
|
| + GENERATE(Token::BIT_OR, SMI, SMI, SMI, OVERWRITE_RIGHT);
|
| + GENERATE(Token::BIT_XOR, INT32, INT32, INT32, NO_OVERWRITE);
|
| + GENERATE(Token::BIT_XOR, INT32, INT32, INT32, OVERWRITE_LEFT);
|
| + GENERATE(Token::BIT_XOR, INT32, INT32, INT32, OVERWRITE_RIGHT);
|
| + GENERATE(Token::BIT_XOR, INT32, INT32, SMI, NO_OVERWRITE);
|
| + GENERATE(Token::BIT_XOR, INT32, INT32, SMI, OVERWRITE_LEFT);
|
| + GENERATE(Token::BIT_XOR, INT32, NUMBER, SMI, NO_OVERWRITE);
|
| + GENERATE(Token::BIT_XOR, INT32, SMI, INT32, NO_OVERWRITE);
|
| + GENERATE(Token::BIT_XOR, INT32, SMI, INT32, OVERWRITE_LEFT);
|
| + GENERATE(Token::BIT_XOR, INT32, SMI, INT32, OVERWRITE_RIGHT);
|
| + GENERATE(Token::BIT_XOR, NUMBER, INT32, INT32, NO_OVERWRITE);
|
| + GENERATE(Token::BIT_XOR, NUMBER, SMI, INT32, NO_OVERWRITE);
|
| + GENERATE(Token::BIT_XOR, NUMBER, SMI, SMI, NO_OVERWRITE);
|
| + GENERATE(Token::BIT_XOR, SMI, INT32, INT32, NO_OVERWRITE);
|
| + GENERATE(Token::BIT_XOR, SMI, INT32, INT32, OVERWRITE_LEFT);
|
| + GENERATE(Token::BIT_XOR, SMI, INT32, SMI, OVERWRITE_LEFT);
|
| + GENERATE(Token::BIT_XOR, SMI, SMI, SMI, NO_OVERWRITE);
|
| + GENERATE(Token::BIT_XOR, SMI, SMI, SMI, OVERWRITE_LEFT);
|
| + GENERATE(Token::BIT_XOR, SMI, SMI, SMI, OVERWRITE_RIGHT);
|
| + GENERATE(Token::DIV, INT32, INT32, INT32, NO_OVERWRITE);
|
| + GENERATE(Token::DIV, INT32, INT32, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::DIV, INT32, NUMBER, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::DIV, INT32, NUMBER, NUMBER, OVERWRITE_LEFT);
|
| + GENERATE(Token::DIV, INT32, SMI, INT32, NO_OVERWRITE);
|
| + GENERATE(Token::DIV, INT32, SMI, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::DIV, NUMBER, INT32, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::DIV, NUMBER, INT32, NUMBER, OVERWRITE_LEFT);
|
| + GENERATE(Token::DIV, NUMBER, NUMBER, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::DIV, NUMBER, NUMBER, NUMBER, OVERWRITE_LEFT);
|
| + GENERATE(Token::DIV, NUMBER, NUMBER, NUMBER, OVERWRITE_RIGHT);
|
| + GENERATE(Token::DIV, NUMBER, SMI, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::DIV, NUMBER, SMI, NUMBER, OVERWRITE_LEFT);
|
| + GENERATE(Token::DIV, SMI, INT32, INT32, NO_OVERWRITE);
|
| + GENERATE(Token::DIV, SMI, INT32, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::DIV, SMI, INT32, NUMBER, OVERWRITE_LEFT);
|
| + GENERATE(Token::DIV, SMI, NUMBER, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::DIV, SMI, NUMBER, NUMBER, OVERWRITE_LEFT);
|
| + GENERATE(Token::DIV, SMI, NUMBER, NUMBER, OVERWRITE_RIGHT);
|
| + GENERATE(Token::DIV, SMI, SMI, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::DIV, SMI, SMI, NUMBER, OVERWRITE_LEFT);
|
| + GENERATE(Token::DIV, SMI, SMI, NUMBER, OVERWRITE_RIGHT);
|
| + GENERATE(Token::DIV, SMI, SMI, SMI, NO_OVERWRITE);
|
| + GENERATE(Token::DIV, SMI, SMI, SMI, OVERWRITE_LEFT);
|
| + GENERATE(Token::DIV, SMI, SMI, SMI, OVERWRITE_RIGHT);
|
| + GENERATE(Token::MOD, NUMBER, SMI, NUMBER, OVERWRITE_LEFT);
|
| + GENERATE(Token::MOD, SMI, SMI, SMI, NO_OVERWRITE);
|
| + GENERATE(Token::MOD, SMI, SMI, SMI, OVERWRITE_LEFT);
|
| + GENERATE(Token::MUL, INT32, INT32, INT32, NO_OVERWRITE);
|
| + GENERATE(Token::MUL, INT32, INT32, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::MUL, INT32, NUMBER, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::MUL, INT32, NUMBER, NUMBER, OVERWRITE_LEFT);
|
| + GENERATE(Token::MUL, INT32, SMI, INT32, NO_OVERWRITE);
|
| + GENERATE(Token::MUL, INT32, SMI, INT32, OVERWRITE_LEFT);
|
| + GENERATE(Token::MUL, INT32, SMI, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::MUL, NUMBER, INT32, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::MUL, NUMBER, INT32, NUMBER, OVERWRITE_LEFT);
|
| + GENERATE(Token::MUL, NUMBER, INT32, NUMBER, OVERWRITE_RIGHT);
|
| + GENERATE(Token::MUL, NUMBER, NUMBER, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::MUL, NUMBER, NUMBER, NUMBER, OVERWRITE_LEFT);
|
| + GENERATE(Token::MUL, NUMBER, SMI, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::MUL, NUMBER, SMI, NUMBER, OVERWRITE_LEFT);
|
| + GENERATE(Token::MUL, NUMBER, SMI, NUMBER, OVERWRITE_RIGHT);
|
| + GENERATE(Token::MUL, SMI, INT32, INT32, NO_OVERWRITE);
|
| + GENERATE(Token::MUL, SMI, INT32, INT32, OVERWRITE_LEFT);
|
| + GENERATE(Token::MUL, SMI, INT32, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::MUL, SMI, NUMBER, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::MUL, SMI, NUMBER, NUMBER, OVERWRITE_LEFT);
|
| + GENERATE(Token::MUL, SMI, NUMBER, NUMBER, OVERWRITE_RIGHT);
|
| + GENERATE(Token::MUL, SMI, SMI, INT32, NO_OVERWRITE);
|
| + GENERATE(Token::MUL, SMI, SMI, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::MUL, SMI, SMI, NUMBER, OVERWRITE_LEFT);
|
| + GENERATE(Token::MUL, SMI, SMI, SMI, NO_OVERWRITE);
|
| + GENERATE(Token::MUL, SMI, SMI, SMI, OVERWRITE_LEFT);
|
| + GENERATE(Token::MUL, SMI, SMI, SMI, OVERWRITE_RIGHT);
|
| + GENERATE(Token::SAR, INT32, SMI, INT32, OVERWRITE_RIGHT);
|
| + GENERATE(Token::SAR, INT32, SMI, SMI, NO_OVERWRITE);
|
| + GENERATE(Token::SAR, INT32, SMI, SMI, OVERWRITE_RIGHT);
|
| + GENERATE(Token::SAR, NUMBER, SMI, SMI, NO_OVERWRITE);
|
| + GENERATE(Token::SAR, NUMBER, SMI, SMI, OVERWRITE_RIGHT);
|
| + GENERATE(Token::SAR, SMI, SMI, SMI, OVERWRITE_LEFT);
|
| + GENERATE(Token::SAR, SMI, SMI, SMI, OVERWRITE_RIGHT);
|
| + GENERATE(Token::SHL, INT32, SMI, INT32, NO_OVERWRITE);
|
| + GENERATE(Token::SHL, INT32, SMI, INT32, OVERWRITE_RIGHT);
|
| + GENERATE(Token::SHL, INT32, SMI, SMI, NO_OVERWRITE);
|
| + GENERATE(Token::SHL, INT32, SMI, SMI, OVERWRITE_RIGHT);
|
| + GENERATE(Token::SHL, NUMBER, SMI, SMI, OVERWRITE_RIGHT);
|
| + GENERATE(Token::SHL, SMI, SMI, INT32, NO_OVERWRITE);
|
| + GENERATE(Token::SHL, SMI, SMI, INT32, OVERWRITE_LEFT);
|
| + GENERATE(Token::SHL, SMI, SMI, INT32, OVERWRITE_RIGHT);
|
| + GENERATE(Token::SHL, SMI, SMI, SMI, NO_OVERWRITE);
|
| + GENERATE(Token::SHL, SMI, SMI, SMI, OVERWRITE_LEFT);
|
| + GENERATE(Token::SHL, SMI, SMI, SMI, OVERWRITE_RIGHT);
|
| + GENERATE(Token::SHR, INT32, SMI, SMI, NO_OVERWRITE);
|
| + GENERATE(Token::SHR, INT32, SMI, SMI, OVERWRITE_LEFT);
|
| + GENERATE(Token::SHR, INT32, SMI, SMI, OVERWRITE_RIGHT);
|
| + GENERATE(Token::SHR, NUMBER, SMI, SMI, NO_OVERWRITE);
|
| + GENERATE(Token::SHR, NUMBER, SMI, SMI, OVERWRITE_LEFT);
|
| + GENERATE(Token::SHR, NUMBER, SMI, INT32, OVERWRITE_RIGHT);
|
| + GENERATE(Token::SHR, SMI, SMI, SMI, NO_OVERWRITE);
|
| + GENERATE(Token::SHR, SMI, SMI, SMI, OVERWRITE_LEFT);
|
| + GENERATE(Token::SHR, SMI, SMI, SMI, OVERWRITE_RIGHT);
|
| + GENERATE(Token::SUB, INT32, INT32, INT32, NO_OVERWRITE);
|
| + GENERATE(Token::SUB, INT32, INT32, INT32, OVERWRITE_LEFT);
|
| + GENERATE(Token::SUB, INT32, NUMBER, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::SUB, INT32, NUMBER, NUMBER, OVERWRITE_RIGHT);
|
| + GENERATE(Token::SUB, INT32, SMI, INT32, OVERWRITE_LEFT);
|
| + GENERATE(Token::SUB, INT32, SMI, INT32, OVERWRITE_RIGHT);
|
| + GENERATE(Token::SUB, NUMBER, INT32, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::SUB, NUMBER, INT32, NUMBER, OVERWRITE_LEFT);
|
| + GENERATE(Token::SUB, NUMBER, NUMBER, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::SUB, NUMBER, NUMBER, NUMBER, OVERWRITE_LEFT);
|
| + GENERATE(Token::SUB, NUMBER, NUMBER, NUMBER, OVERWRITE_RIGHT);
|
| + GENERATE(Token::SUB, NUMBER, SMI, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::SUB, NUMBER, SMI, NUMBER, OVERWRITE_LEFT);
|
| + GENERATE(Token::SUB, NUMBER, SMI, NUMBER, OVERWRITE_RIGHT);
|
| + GENERATE(Token::SUB, SMI, INT32, INT32, NO_OVERWRITE);
|
| + GENERATE(Token::SUB, SMI, NUMBER, NUMBER, NO_OVERWRITE);
|
| + GENERATE(Token::SUB, SMI, NUMBER, NUMBER, OVERWRITE_LEFT);
|
| + GENERATE(Token::SUB, SMI, NUMBER, NUMBER, OVERWRITE_RIGHT);
|
| + GENERATE(Token::SUB, SMI, SMI, SMI, NO_OVERWRITE);
|
| + GENERATE(Token::SUB, SMI, SMI, SMI, OVERWRITE_LEFT);
|
| + GENERATE(Token::SUB, SMI, SMI, SMI, OVERWRITE_RIGHT);
|
| +#undef GENERATE
|
| +#define GENERATE(op, left_kind, fixed_right_arg_value, result_kind, mode) \
|
| + do { \
|
| + State state(op, mode); \
|
| + state.left_kind_ = left_kind; \
|
| + state.fixed_right_arg_.has_value = true; \
|
| + state.fixed_right_arg_.value = fixed_right_arg_value; \
|
| + state.right_kind_ = SMI; \
|
| + state.result_kind_ = result_kind; \
|
| + Generate(isolate, state); \
|
| + } while (false)
|
| + GENERATE(Token::MOD, SMI, 2, SMI, NO_OVERWRITE);
|
| + GENERATE(Token::MOD, SMI, 4, SMI, NO_OVERWRITE);
|
| + GENERATE(Token::MOD, SMI, 4, SMI, OVERWRITE_LEFT);
|
| + GENERATE(Token::MOD, SMI, 8, SMI, NO_OVERWRITE);
|
| + GENERATE(Token::MOD, SMI, 16, SMI, OVERWRITE_LEFT);
|
| + GENERATE(Token::MOD, SMI, 32, SMI, NO_OVERWRITE);
|
| + GENERATE(Token::MOD, SMI, 2048, SMI, NO_OVERWRITE);
|
| +#undef GENERATE
|
| +}
|
| +
|
| +
|
| +Handle<Type> BinaryOpIC::State::GetResultType(Isolate* isolate) const {
|
| + Kind result_kind = result_kind_;
|
| + if (HasSideEffects()) {
|
| + result_kind = NONE;
|
| + } else if (result_kind == GENERIC && op_ == Token::ADD) {
|
| + return handle(Type::Union(handle(Type::Number(), isolate),
|
| + handle(Type::String(), isolate)), isolate);
|
| + } else if (result_kind == NUMBER && op_ == Token::SHR) {
|
| + return handle(Type::Unsigned32(), isolate);
|
| + }
|
| + ASSERT_NE(GENERIC, result_kind);
|
| + return KindToType(result_kind, isolate);
|
| +}
|
| +
|
| +
|
| +void BinaryOpIC::State::Print(StringStream* stream) const {
|
| + stream->Add("(%s", Token::Name(op_));
|
| + if (mode_ == OVERWRITE_LEFT) stream->Add("_ReuseLeft");
|
| + else if (mode_ == OVERWRITE_RIGHT) stream->Add("_ReuseRight");
|
| + stream->Add(":%s*", KindToString(left_kind_));
|
| + if (fixed_right_arg_.has_value) {
|
| + stream->Add("%d", fixed_right_arg_.value);
|
| + } else {
|
| + stream->Add("%s", KindToString(right_kind_));
|
| + }
|
| + stream->Add("->%s)", KindToString(result_kind_));
|
| +}
|
| +
|
| +
|
| +void BinaryOpIC::State::Update(Handle<Object> left,
|
| + Handle<Object> right,
|
| + Handle<Object> result) {
|
| + ExtraICState old_extra_ic_state = GetExtraICState();
|
| +
|
| + left_kind_ = UpdateKind(left, left_kind_);
|
| + right_kind_ = UpdateKind(right, right_kind_);
|
| +
|
| + int32_t fixed_right_arg_value = 0;
|
| + bool has_fixed_right_arg =
|
| + op_ == Token::MOD &&
|
| + right->ToInt32(&fixed_right_arg_value) &&
|
| + fixed_right_arg_value > 0 &&
|
| + IsPowerOf2(fixed_right_arg_value) &&
|
| + FixedRightArgValueField::is_valid(WhichPowerOf2(fixed_right_arg_value)) &&
|
| + (left_kind_ == SMI || left_kind_ == INT32) &&
|
| + (result_kind_ == NONE || !fixed_right_arg_.has_value);
|
| + fixed_right_arg_ = Maybe<int32_t>(has_fixed_right_arg,
|
| + fixed_right_arg_value);
|
| +
|
| + result_kind_ = UpdateKind(result, result_kind_);
|
| +
|
| + if (!Token::IsTruncatingBinaryOp(op_)) {
|
| + Kind input_kind = Max(left_kind_, right_kind_);
|
| + if (result_kind_ < input_kind && input_kind <= NUMBER) {
|
| + result_kind_ = input_kind;
|
| + }
|
| + }
|
| +
|
| + // Reset overwrite mode unless we can actually make use of it, or may be able
|
| + // to make use of it at some point in the future.
|
| + if ((mode_ == OVERWRITE_LEFT && left_kind_ > NUMBER) ||
|
| + (mode_ == OVERWRITE_RIGHT && right_kind_ > NUMBER) ||
|
| + result_kind_ > NUMBER) {
|
| + mode_ = NO_OVERWRITE;
|
| + }
|
| +
|
| + if (old_extra_ic_state == GetExtraICState()) {
|
| + // Tagged operations can lead to non-truncating HChanges
|
| + if (left->IsUndefined() || left->IsBoolean()) {
|
| + left_kind_ = GENERIC;
|
| + } else if (right->IsUndefined() || right->IsBoolean()) {
|
| + right_kind_ = GENERIC;
|
| + } else {
|
| + // Since the X87 is too precise, we might bail out on numbers which
|
| + // actually would truncate with 64 bit precision.
|
| + ASSERT(!CpuFeatures::IsSupported(SSE2));
|
| + ASSERT(result_kind_ < NUMBER);
|
| + result_kind_ = NUMBER;
|
| + }
|
| + }
|
| +}
|
| +
|
| +
|
| +BinaryOpIC::State::Kind BinaryOpIC::State::UpdateKind(Handle<Object> object,
|
| + Kind kind) const {
|
| + Kind new_kind = GENERIC;
|
| + bool is_truncating = Token::IsTruncatingBinaryOp(op());
|
| + if (object->IsBoolean() && is_truncating) {
|
| + // Booleans will be automatically truncated by HChange.
|
| + new_kind = INT32;
|
| + } else if (object->IsUndefined()) {
|
| + // Undefined will be automatically truncated by HChange.
|
| + new_kind = is_truncating ? INT32 : NUMBER;
|
| + } else if (object->IsSmi()) {
|
| + new_kind = SMI;
|
| + } else if (object->IsHeapNumber()) {
|
| + double value = Handle<HeapNumber>::cast(object)->value();
|
| + new_kind = TypeInfo::IsInt32Double(value) ? INT32 : NUMBER;
|
| + } else if (object->IsString() && op() == Token::ADD) {
|
| + new_kind = STRING;
|
| + }
|
| + if (new_kind == INT32 && SmiValuesAre32Bits()) {
|
| + new_kind = NUMBER;
|
| + }
|
| + if (kind != NONE &&
|
| + ((new_kind <= NUMBER && kind > NUMBER) ||
|
| + (new_kind > NUMBER && kind <= NUMBER))) {
|
| + new_kind = GENERIC;
|
| + }
|
| + return Max(kind, new_kind);
|
| +}
|
| +
|
| +
|
| +// static
|
| +const char* BinaryOpIC::State::KindToString(Kind kind) {
|
| + switch (kind) {
|
| + case NONE: return "None";
|
| case SMI: return "Smi";
|
| case INT32: return "Int32";
|
| case NUMBER: return "Number";
|
| - case ODDBALL: return "Oddball";
|
| case STRING: return "String";
|
| case GENERIC: return "Generic";
|
| - default: return "Invalid";
|
| }
|
| + UNREACHABLE();
|
| + return NULL;
|
| +}
|
| +
|
| +
|
| +// static
|
| +Handle<Type> BinaryOpIC::State::KindToType(Kind kind, Isolate* isolate) {
|
| + Type* type = NULL;
|
| + switch (kind) {
|
| + case NONE: type = Type::None(); break;
|
| + case SMI: type = Type::Smi(); break;
|
| + case INT32: type = Type::Signed32(); break;
|
| + case NUMBER: type = Type::Number(); break;
|
| + case STRING: type = Type::String(); break;
|
| + case GENERIC: type = Type::Any(); break;
|
| + }
|
| + return handle(type, isolate);
|
| }
|
|
|
|
|
| MaybeObject* BinaryOpIC::Transition(Handle<Object> left, Handle<Object> right) {
|
| - Code::ExtraICState extra_ic_state = target()->extended_extra_ic_state();
|
| - BinaryOpStub stub(extra_ic_state);
|
| + State state(target()->extended_extra_ic_state());
|
|
|
| - Handle<Type> left_type = stub.GetLeftType(isolate());
|
| - Handle<Type> right_type = stub.GetRightType(isolate());
|
| - bool smi_was_enabled = left_type->Maybe(Type::Smi()) &&
|
| - right_type->Maybe(Type::Smi());
|
| + // Compute the actual result using the builtin for the binary operation.
|
| + Object* builtin = isolate()->js_builtins_object()->javascript_builtin(
|
| + TokenToJSBuiltin(state.op()));
|
| + Handle<JSFunction> function = handle(JSFunction::cast(builtin), isolate());
|
| + bool caught_exception;
|
| + Handle<Object> result = Execution::Call(
|
| + isolate(), function, left, 1, &right, &caught_exception);
|
| + if (caught_exception) return Failure::Exception();
|
|
|
| - Maybe<Handle<Object> > result = stub.Result(left, right, isolate());
|
| - if (!result.has_value) return Failure::Exception();
|
| + // Compute the new state.
|
| + State old_state = state;
|
| + state.Update(left, right, result);
|
| +
|
| + // Install the new stub.
|
| + BinaryOpICStub stub(state);
|
| + set_target(*stub.GetCode(isolate()));
|
|
|
| -#ifdef DEBUG
|
| if (FLAG_trace_ic) {
|
| - char buffer[100];
|
| - NoAllocationStringAllocator allocator(buffer,
|
| - static_cast<unsigned>(sizeof(buffer)));
|
| + char buffer[150];
|
| + NoAllocationStringAllocator allocator(
|
| + buffer, static_cast<unsigned>(sizeof(buffer)));
|
| StringStream stream(&allocator);
|
| - stream.Add("[");
|
| - stub.PrintName(&stream);
|
| -
|
| - stub.UpdateStatus(left, right, result);
|
| -
|
| + stream.Add("[BinaryOpIC");
|
| + old_state.Print(&stream);
|
| stream.Add(" => ");
|
| - stub.PrintState(&stream);
|
| - stream.Add(" ");
|
| + state.Print(&stream);
|
| + stream.Add(" @ %p <- ", static_cast<void*>(*target()));
|
| stream.OutputToStdOut();
|
| - PrintF(" @ %p <- ", static_cast<void*>(*stub.GetCode(isolate())));
|
| JavaScriptFrame::PrintTop(isolate(), stdout, false, true);
|
| PrintF("]\n");
|
| - } else {
|
| - stub.UpdateStatus(left, right, result);
|
| }
|
| -#else
|
| - stub.UpdateStatus(left, right, result);
|
| -#endif
|
| -
|
| - Handle<Code> code = stub.GetCode(isolate());
|
| - set_target(*code);
|
|
|
| - left_type = stub.GetLeftType(isolate());
|
| - right_type = stub.GetRightType(isolate());
|
| - bool enable_smi = left_type->Maybe(Type::Smi()) &&
|
| - right_type->Maybe(Type::Smi());
|
| -
|
| - if (!smi_was_enabled && enable_smi) {
|
| + // Patch the inlined smi code as necessary.
|
| + if (!old_state.UseInlinedSmiCode() && state.UseInlinedSmiCode()) {
|
| PatchInlinedSmiCode(address(), ENABLE_INLINED_SMI_CHECK);
|
| - } else if (smi_was_enabled && !enable_smi) {
|
| + } else if (old_state.UseInlinedSmiCode() && !state.UseInlinedSmiCode()) {
|
| PatchInlinedSmiCode(address(), DISABLE_INLINED_SMI_CHECK);
|
| }
|
|
|
| - ASSERT(result.has_value);
|
| - return static_cast<MaybeObject*>(*result.value);
|
| + return *result;
|
| }
|
|
|
|
|
| RUNTIME_FUNCTION(MaybeObject*, BinaryOpIC_Miss) {
|
| HandleScope scope(isolate);
|
| - Handle<Object> left = args.at<Object>(0);
|
| - Handle<Object> right = args.at<Object>(1);
|
| + Handle<Object> left = args.at<Object>(BinaryOpICStub::kLeft);
|
| + Handle<Object> right = args.at<Object>(BinaryOpICStub::kRight);
|
| BinaryOpIC ic(isolate);
|
| return ic.Transition(left, right);
|
| }
|
| @@ -2599,7 +2974,6 @@ Code* CompareIC::UpdateCaches(Handle<Object> x, Handle<Object> y) {
|
| Handle<Code> new_target = stub.GetCode(isolate());
|
| set_target(*new_target);
|
|
|
| -#ifdef DEBUG
|
| if (FLAG_trace_ic) {
|
| PrintF("[CompareIC in ");
|
| JavaScriptFrame::PrintTop(isolate(), stdout, false, true);
|
| @@ -2613,7 +2987,6 @@ Code* CompareIC::UpdateCaches(Handle<Object> x, Handle<Object> y) {
|
| Token::Name(op_),
|
| static_cast<void*>(*stub.GetCode(isolate())));
|
| }
|
| -#endif
|
|
|
| // Activate inlined smi code.
|
| if (previous_state == UNINITIALIZED) {
|
| @@ -2635,7 +3008,7 @@ RUNTIME_FUNCTION(Code*, CompareIC_Miss) {
|
|
|
| void CompareNilIC::Clear(Address address, Code* target) {
|
| if (IsCleared(target)) return;
|
| - Code::ExtraICState state = target->extended_extra_ic_state();
|
| + ExtraICState state = target->extended_extra_ic_state();
|
|
|
| CompareNilICStub stub(state, HydrogenCodeStub::UNINITIALIZED);
|
| stub.ClearState();
|
| @@ -2657,7 +3030,7 @@ MaybeObject* CompareNilIC::DoCompareNilSlow(NilValue nil,
|
|
|
|
|
| MaybeObject* CompareNilIC::CompareNil(Handle<Object> object) {
|
| - Code::ExtraICState extra_ic_state = target()->extended_extra_ic_state();
|
| + ExtraICState extra_ic_state = target()->extended_extra_ic_state();
|
|
|
| CompareNilICStub stub(extra_ic_state);
|
|
|
|
|