1 // Copyright 2012 the V8 project authors. All rights reserved.
2 // Redistribution and use in source and binary forms, with or without
3 // modification, are permitted provided that the following conditions are
6 // * Redistributions of source code must retain the above copyright
7 // notice, this list of conditions and the following disclaimer.
8 // * Redistributions in binary form must reproduce the above
9 // copyright notice, this list of conditions and the following
10 // disclaimer in the documentation and/or other materials provided
11 // with the distribution.
12 // * Neither the name of Google Inc. nor the names of its
13 // contributors may be used to endorse or promote products derived
14 // from this software without specific prior written permission.
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 #include <cmath> // For isfinite.
32 #include "code-stubs.h"
34 #include "conversions.h"
37 #include "property-details.h"
40 #include "string-stream.h"
41 #include "type-info.h"
46 // ----------------------------------------------------------------------------
47 // All the Accept member functions for each syntax tree node type.
49 #define DECL_ACCEPT(type) \
50 void type::Accept(AstVisitor* v) { v->Visit##type(this); }
51 AST_NODE_LIST(DECL_ACCEPT)
55 // ----------------------------------------------------------------------------
56 // Implementation of other node functionality.
59 bool Expression::IsSmiLiteral() {
60 return AsLiteral() != NULL && AsLiteral()->value()->IsSmi();
64 bool Expression::IsStringLiteral() {
65 return AsLiteral() != NULL && AsLiteral()->value()->IsString();
69 bool Expression::IsNullLiteral() {
70 return AsLiteral() != NULL && AsLiteral()->value()->IsNull();
74 bool Expression::IsUndefinedLiteral(Isolate* isolate) {
75 VariableProxy* var_proxy = AsVariableProxy();
76 if (var_proxy == NULL) return false;
77 Variable* var = var_proxy->var();
78 // The global identifier "undefined" is immutable. Everything
79 // else could be reassigned.
80 return var != NULL && var->location() == Variable::UNALLOCATED &&
81 var_proxy->name()->Equals(isolate->heap()->undefined_string());
85 VariableProxy::VariableProxy(Zone* zone, Variable* var, int position)
86 : Expression(zone, position),
88 var_(NULL), // Will be set by the call to BindTo.
89 is_this_(var->is_this()),
92 interface_(var->interface()) {
97 VariableProxy::VariableProxy(Zone* zone,
100 Interface* interface,
102 : Expression(zone, position),
108 interface_(interface) {
109 // Names must be canonicalized for fast equality checks.
110 ASSERT(name->IsInternalizedString());
114 void VariableProxy::BindTo(Variable* var) {
115 ASSERT(var_ == NULL); // must be bound only once
116 ASSERT(var != NULL); // must bind
117 ASSERT(!FLAG_harmony_modules || interface_->IsUnified(var->interface()));
118 ASSERT((is_this() && var->is_this()) || name_.is_identical_to(var->name()));
119 // Ideally CONST-ness should match. However, this is very hard to achieve
120 // because we don't know the exact semantics of conflicting (const and
121 // non-const) multiple variable declarations, const vars introduced via
122 // eval() etc. Const-ness and variable declarations are a complete mess
125 var->set_is_used(true);
129 Assignment::Assignment(Zone* zone,
134 : Expression(zone, pos),
138 binary_operation_(NULL),
139 assignment_id_(GetNextId(zone)),
140 is_uninitialized_(false),
141 store_mode_(STANDARD_STORE) { }
144 Token::Value Assignment::binary_op() const {
146 case Token::ASSIGN_BIT_OR: return Token::BIT_OR;
147 case Token::ASSIGN_BIT_XOR: return Token::BIT_XOR;
148 case Token::ASSIGN_BIT_AND: return Token::BIT_AND;
149 case Token::ASSIGN_SHL: return Token::SHL;
150 case Token::ASSIGN_SAR: return Token::SAR;
151 case Token::ASSIGN_SHR: return Token::SHR;
152 case Token::ASSIGN_ADD: return Token::ADD;
153 case Token::ASSIGN_SUB: return Token::SUB;
154 case Token::ASSIGN_MUL: return Token::MUL;
155 case Token::ASSIGN_DIV: return Token::DIV;
156 case Token::ASSIGN_MOD: return Token::MOD;
157 default: UNREACHABLE();
159 return Token::ILLEGAL;
163 bool FunctionLiteral::AllowsLazyCompilation() {
164 return scope()->AllowsLazyCompilation();
168 bool FunctionLiteral::AllowsLazyCompilationWithoutContext() {
169 return scope()->AllowsLazyCompilationWithoutContext();
173 int FunctionLiteral::start_position() const {
174 return scope()->start_position();
178 int FunctionLiteral::end_position() const {
179 return scope()->end_position();
183 LanguageMode FunctionLiteral::language_mode() const {
184 return scope()->language_mode();
188 void FunctionLiteral::InitializeSharedInfo(
189 Handle<Code> unoptimized_code) {
190 for (RelocIterator it(*unoptimized_code); !it.done(); it.next()) {
191 RelocInfo* rinfo = it.rinfo();
192 if (rinfo->rmode() != RelocInfo::EMBEDDED_OBJECT) continue;
193 Object* obj = rinfo->target_object();
194 if (obj->IsSharedFunctionInfo()) {
195 SharedFunctionInfo* shared = SharedFunctionInfo::cast(obj);
196 if (shared->start_position() == start_position()) {
197 shared_info_ = Handle<SharedFunctionInfo>(shared);
205 ObjectLiteralProperty::ObjectLiteralProperty(
206 Zone* zone, Literal* key, Expression* value) {
210 Object* k = *key->value();
211 if (k->IsInternalizedString() &&
212 zone->isolate()->heap()->proto_string()->Equals(String::cast(k))) {
214 } else if (value_->AsMaterializedLiteral() != NULL) {
215 kind_ = MATERIALIZED_LITERAL;
216 } else if (value_->AsLiteral() != NULL) {
224 ObjectLiteralProperty::ObjectLiteralProperty(
225 Zone* zone, bool is_getter, FunctionLiteral* value) {
228 kind_ = is_getter ? GETTER : SETTER;
232 bool ObjectLiteral::Property::IsCompileTimeValue() {
233 return kind_ == CONSTANT ||
234 (kind_ == MATERIALIZED_LITERAL &&
235 CompileTimeValue::IsCompileTimeValue(value_));
239 void ObjectLiteral::Property::set_emit_store(bool emit_store) {
240 emit_store_ = emit_store;
244 bool ObjectLiteral::Property::emit_store() {
249 void ObjectLiteral::CalculateEmitStore(Zone* zone) {
250 ZoneAllocationPolicy allocator(zone);
252 ZoneHashMap table(Literal::Match, ZoneHashMap::kDefaultHashMapCapacity,
254 for (int i = properties()->length() - 1; i >= 0; i--) {
255 ObjectLiteral::Property* property = properties()->at(i);
256 Literal* literal = property->key();
257 if (literal->value()->IsNull()) continue;
258 uint32_t hash = literal->Hash();
259 // If the key of a computed property is in the table, do not emit
260 // a store for the property later.
261 if ((property->kind() == ObjectLiteral::Property::MATERIALIZED_LITERAL ||
262 property->kind() == ObjectLiteral::Property::COMPUTED) &&
263 table.Lookup(literal, hash, false, allocator) != NULL) {
264 property->set_emit_store(false);
266 // Add key to the table.
267 table.Lookup(literal, hash, true, allocator);
273 bool ObjectLiteral::IsBoilerplateProperty(ObjectLiteral::Property* property) {
274 return property != NULL &&
275 property->kind() != ObjectLiteral::Property::PROTOTYPE;
279 void ObjectLiteral::BuildConstantProperties(Isolate* isolate) {
280 if (!constant_properties_.is_null()) return;
282 // Allocate a fixed array to hold all the constant properties.
283 Handle<FixedArray> constant_properties = isolate->factory()->NewFixedArray(
284 boilerplate_properties_ * 2, TENURED);
287 // Accumulate the value in local variables and store it at the end.
288 bool is_simple = true;
290 uint32_t max_element_index = 0;
291 uint32_t elements = 0;
292 for (int i = 0; i < properties()->length(); i++) {
293 ObjectLiteral::Property* property = properties()->at(i);
294 if (!IsBoilerplateProperty(property)) {
298 MaterializedLiteral* m_literal = property->value()->AsMaterializedLiteral();
299 if (m_literal != NULL) {
300 m_literal->BuildConstants(isolate);
301 if (m_literal->depth() >= depth_acc) depth_acc = m_literal->depth() + 1;
304 // Add CONSTANT and COMPUTED properties to boilerplate. Use undefined
305 // value for COMPUTED properties, the real value is filled in at
306 // runtime. The enumeration order is maintained.
307 Handle<Object> key = property->key()->value();
308 Handle<Object> value = GetBoilerplateValue(property->value(), isolate);
310 // Ensure objects that may, at any point in time, contain fields with double
311 // representation are always treated as nested objects. This is true for
312 // computed fields (value is undefined), and smi and double literals
313 // (value->IsNumber()).
314 // TODO(verwaest): Remove once we can store them inline.
315 if (FLAG_track_double_fields &&
316 (value->IsNumber() || value->IsUninitialized())) {
317 may_store_doubles_ = true;
320 is_simple = is_simple && !value->IsUninitialized();
322 // Keep track of the number of elements in the object literal and
323 // the largest element index. If the largest element index is
324 // much larger than the number of elements, creating an object
325 // literal with fast elements will be a waste of space.
326 uint32_t element_index = 0;
328 && Handle<String>::cast(key)->AsArrayIndex(&element_index)
329 && element_index > max_element_index) {
330 max_element_index = element_index;
332 } else if (key->IsSmi()) {
333 int key_value = Smi::cast(*key)->value();
335 && static_cast<uint32_t>(key_value) > max_element_index) {
336 max_element_index = key_value;
341 // Add name, value pair to the fixed array.
342 constant_properties->set(position++, *key);
343 constant_properties->set(position++, *value);
346 constant_properties_ = constant_properties;
348 (max_element_index <= 32) || ((2 * elements) >= max_element_index);
349 set_is_simple(is_simple);
350 set_depth(depth_acc);
354 void ArrayLiteral::BuildConstantElements(Isolate* isolate) {
355 if (!constant_elements_.is_null()) return;
357 // Allocate a fixed array to hold all the object literals.
358 Handle<JSArray> array =
359 isolate->factory()->NewJSArray(0, FAST_HOLEY_SMI_ELEMENTS);
360 isolate->factory()->SetElementsCapacityAndLength(
361 array, values()->length(), values()->length());
363 // Fill in the literals.
364 bool is_simple = true;
366 bool is_holey = false;
367 for (int i = 0, n = values()->length(); i < n; i++) {
368 Expression* element = values()->at(i);
369 MaterializedLiteral* m_literal = element->AsMaterializedLiteral();
370 if (m_literal != NULL) {
371 m_literal->BuildConstants(isolate);
372 if (m_literal->depth() + 1 > depth_acc) {
373 depth_acc = m_literal->depth() + 1;
376 Handle<Object> boilerplate_value = GetBoilerplateValue(element, isolate);
377 if (boilerplate_value->IsTheHole()) {
379 } else if (boilerplate_value->IsUninitialized()) {
381 JSObject::SetOwnElement(
382 array, i, handle(Smi::FromInt(0), isolate), kNonStrictMode);
384 JSObject::SetOwnElement(array, i, boilerplate_value, kNonStrictMode);
388 Handle<FixedArrayBase> element_values(array->elements());
390 // Simple and shallow arrays can be lazily copied, we transform the
391 // elements array to a copy-on-write array.
392 if (is_simple && depth_acc == 1 && values()->length() > 0 &&
393 array->HasFastSmiOrObjectElements()) {
394 element_values->set_map(isolate->heap()->fixed_cow_array_map());
397 // Remember both the literal's constant values as well as the ElementsKind
398 // in a 2-element FixedArray.
399 Handle<FixedArray> literals = isolate->factory()->NewFixedArray(2, TENURED);
401 ElementsKind kind = array->GetElementsKind();
402 kind = is_holey ? GetHoleyElementsKind(kind) : GetPackedElementsKind(kind);
404 literals->set(0, Smi::FromInt(kind));
405 literals->set(1, *element_values);
407 constant_elements_ = literals;
408 set_is_simple(is_simple);
409 set_depth(depth_acc);
413 Handle<Object> MaterializedLiteral::GetBoilerplateValue(Expression* expression,
415 if (expression->AsLiteral() != NULL) {
416 return expression->AsLiteral()->value();
418 if (CompileTimeValue::IsCompileTimeValue(expression)) {
419 return CompileTimeValue::GetValue(isolate, expression);
421 return isolate->factory()->uninitialized_value();
425 void MaterializedLiteral::BuildConstants(Isolate* isolate) {
426 if (IsArrayLiteral()) {
427 return AsArrayLiteral()->BuildConstantElements(isolate);
429 if (IsObjectLiteral()) {
430 return AsObjectLiteral()->BuildConstantProperties(isolate);
432 ASSERT(IsRegExpLiteral());
433 ASSERT(depth() >= 1); // Depth should be initialized.
437 void TargetCollector::AddTarget(Label* target, Zone* zone) {
438 // Add the label to the collector, but discard duplicates.
439 int length = targets_.length();
440 for (int i = 0; i < length; i++) {
441 if (targets_[i] == target) return;
443 targets_.Add(target, zone);
447 void UnaryOperation::RecordToBooleanTypeFeedback(TypeFeedbackOracle* oracle) {
448 // TODO(olivf) If this Operation is used in a test context, then the
449 // expression has a ToBoolean stub and we want to collect the type
450 // information. However the GraphBuilder expects it to be on the instruction
451 // corresponding to the TestContext, therefore we have to store it here and
452 // not on the operand.
453 set_to_boolean_types(oracle->ToBooleanTypes(expression()->test_id()));
457 void BinaryOperation::RecordToBooleanTypeFeedback(TypeFeedbackOracle* oracle) {
458 // TODO(olivf) If this Operation is used in a test context, then the right
459 // hand side has a ToBoolean stub and we want to collect the type information.
460 // However the GraphBuilder expects it to be on the instruction corresponding
461 // to the TestContext, therefore we have to store it here and not on the
462 // right hand operand.
463 set_to_boolean_types(oracle->ToBooleanTypes(right()->test_id()));
467 bool BinaryOperation::ResultOverwriteAllowed() {
492 static bool IsTypeof(Expression* expr) {
493 UnaryOperation* maybe_unary = expr->AsUnaryOperation();
494 return maybe_unary != NULL && maybe_unary->op() == Token::TYPEOF;
498 // Check for the pattern: typeof <expression> equals <string literal>.
499 static bool MatchLiteralCompareTypeof(Expression* left,
503 Handle<String>* check) {
504 if (IsTypeof(left) && right->IsStringLiteral() && Token::IsEqualityOp(op)) {
505 *expr = left->AsUnaryOperation()->expression();
506 *check = Handle<String>::cast(right->AsLiteral()->value());
513 bool CompareOperation::IsLiteralCompareTypeof(Expression** expr,
514 Handle<String>* check) {
515 return MatchLiteralCompareTypeof(left_, op_, right_, expr, check) ||
516 MatchLiteralCompareTypeof(right_, op_, left_, expr, check);
520 static bool IsVoidOfLiteral(Expression* expr) {
521 UnaryOperation* maybe_unary = expr->AsUnaryOperation();
522 return maybe_unary != NULL &&
523 maybe_unary->op() == Token::VOID &&
524 maybe_unary->expression()->AsLiteral() != NULL;
528 // Check for the pattern: void <literal> equals <expression> or
529 // undefined equals <expression>
530 static bool MatchLiteralCompareUndefined(Expression* left,
535 if (IsVoidOfLiteral(left) && Token::IsEqualityOp(op)) {
539 if (left->IsUndefinedLiteral(isolate) && Token::IsEqualityOp(op)) {
547 bool CompareOperation::IsLiteralCompareUndefined(
548 Expression** expr, Isolate* isolate) {
549 return MatchLiteralCompareUndefined(left_, op_, right_, expr, isolate) ||
550 MatchLiteralCompareUndefined(right_, op_, left_, expr, isolate);
554 // Check for the pattern: null equals <expression>
555 static bool MatchLiteralCompareNull(Expression* left,
559 if (left->IsNullLiteral() && Token::IsEqualityOp(op)) {
567 bool CompareOperation::IsLiteralCompareNull(Expression** expr) {
568 return MatchLiteralCompareNull(left_, op_, right_, expr) ||
569 MatchLiteralCompareNull(right_, op_, left_, expr);
573 // ----------------------------------------------------------------------------
576 bool Declaration::IsInlineable() const {
577 return proxy()->var()->IsStackAllocated();
580 bool FunctionDeclaration::IsInlineable() const {
585 // ----------------------------------------------------------------------------
586 // Recording of type feedback
588 // TODO(rossberg): all RecordTypeFeedback functions should disappear
589 // once we use the common type field in the AST consistently.
591 void Expression::RecordToBooleanTypeFeedback(TypeFeedbackOracle* oracle) {
592 to_boolean_types_ = oracle->ToBooleanTypes(test_id());
596 Call::CallType Call::GetCallType(Isolate* isolate) const {
597 VariableProxy* proxy = expression()->AsVariableProxy();
599 if (proxy->var()->is_possibly_eval(isolate)) {
600 return POSSIBLY_EVAL_CALL;
601 } else if (proxy->var()->IsUnallocated()) {
603 } else if (proxy->var()->IsLookupSlot()) {
604 return LOOKUP_SLOT_CALL;
608 Property* property = expression()->AsProperty();
609 return property != NULL ? PROPERTY_CALL : OTHER_CALL;
613 bool Call::ComputeGlobalTarget(Handle<GlobalObject> global,
614 LookupResult* lookup) {
615 target_ = Handle<JSFunction>::null();
616 cell_ = Handle<Cell>::null();
617 ASSERT(lookup->IsFound() &&
618 lookup->type() == NORMAL &&
619 lookup->holder() == *global);
620 cell_ = Handle<Cell>(global->GetPropertyCell(lookup));
621 if (cell_->value()->IsJSFunction()) {
622 Handle<JSFunction> candidate(JSFunction::cast(cell_->value()));
623 // If the function is in new space we assume it's more likely to
624 // change and thus prefer the general IC code.
625 if (!lookup->isolate()->heap()->InNewSpace(*candidate)) {
634 void CallNew::RecordTypeFeedback(TypeFeedbackOracle* oracle) {
636 oracle->GetCallNewAllocationSite(CallNewFeedbackId());
637 is_monomorphic_ = oracle->CallNewIsMonomorphic(CallNewFeedbackId());
638 if (is_monomorphic_) {
639 target_ = oracle->GetCallNewTarget(CallNewFeedbackId());
640 if (!allocation_site_.is_null()) {
641 elements_kind_ = allocation_site_->GetElementsKind();
647 void ObjectLiteral::Property::RecordTypeFeedback(TypeFeedbackOracle* oracle) {
648 TypeFeedbackId id = key()->LiteralFeedbackId();
650 oracle->CollectReceiverTypes(id, &maps);
651 receiver_type_ = maps.length() == 1 ? maps.at(0)
652 : Handle<Map>::null();
656 // ----------------------------------------------------------------------------
657 // Implementation of AstVisitor
659 void AstVisitor::VisitDeclarations(ZoneList<Declaration*>* declarations) {
660 for (int i = 0; i < declarations->length(); i++) {
661 Visit(declarations->at(i));
666 void AstVisitor::VisitStatements(ZoneList<Statement*>* statements) {
667 for (int i = 0; i < statements->length(); i++) {
668 Statement* stmt = statements->at(i);
670 if (stmt->IsJump()) break;
675 void AstVisitor::VisitExpressions(ZoneList<Expression*>* expressions) {
676 for (int i = 0; i < expressions->length(); i++) {
677 // The variable statement visiting code may pass NULL expressions
678 // to this code. Maybe this should be handled by introducing an
679 // undefined expression or literal? Revisit this code if this
681 Expression* expression = expressions->at(i);
682 if (expression != NULL) Visit(expression);
687 // ----------------------------------------------------------------------------
688 // Regular expressions
690 #define MAKE_ACCEPT(Name) \
691 void* RegExp##Name::Accept(RegExpVisitor* visitor, void* data) { \
692 return visitor->Visit##Name(this, data); \
694 FOR_EACH_REG_EXP_TREE_TYPE(MAKE_ACCEPT)
697 #define MAKE_TYPE_CASE(Name) \
698 RegExp##Name* RegExpTree::As##Name() { \
701 bool RegExpTree::Is##Name() { return false; }
702 FOR_EACH_REG_EXP_TREE_TYPE(MAKE_TYPE_CASE)
703 #undef MAKE_TYPE_CASE
705 #define MAKE_TYPE_CASE(Name) \
706 RegExp##Name* RegExp##Name::As##Name() { \
709 bool RegExp##Name::Is##Name() { return true; }
710 FOR_EACH_REG_EXP_TREE_TYPE(MAKE_TYPE_CASE)
711 #undef MAKE_TYPE_CASE
714 static Interval ListCaptureRegisters(ZoneList<RegExpTree*>* children) {
715 Interval result = Interval::Empty();
716 for (int i = 0; i < children->length(); i++)
717 result = result.Union(children->at(i)->CaptureRegisters());
722 Interval RegExpAlternative::CaptureRegisters() {
723 return ListCaptureRegisters(nodes());
727 Interval RegExpDisjunction::CaptureRegisters() {
728 return ListCaptureRegisters(alternatives());
732 Interval RegExpLookahead::CaptureRegisters() {
733 return body()->CaptureRegisters();
737 Interval RegExpCapture::CaptureRegisters() {
738 Interval self(StartRegister(index()), EndRegister(index()));
739 return self.Union(body()->CaptureRegisters());
743 Interval RegExpQuantifier::CaptureRegisters() {
744 return body()->CaptureRegisters();
748 bool RegExpAssertion::IsAnchoredAtStart() {
749 return assertion_type() == RegExpAssertion::START_OF_INPUT;
753 bool RegExpAssertion::IsAnchoredAtEnd() {
754 return assertion_type() == RegExpAssertion::END_OF_INPUT;
758 bool RegExpAlternative::IsAnchoredAtStart() {
759 ZoneList<RegExpTree*>* nodes = this->nodes();
760 for (int i = 0; i < nodes->length(); i++) {
761 RegExpTree* node = nodes->at(i);
762 if (node->IsAnchoredAtStart()) { return true; }
763 if (node->max_match() > 0) { return false; }
769 bool RegExpAlternative::IsAnchoredAtEnd() {
770 ZoneList<RegExpTree*>* nodes = this->nodes();
771 for (int i = nodes->length() - 1; i >= 0; i--) {
772 RegExpTree* node = nodes->at(i);
773 if (node->IsAnchoredAtEnd()) { return true; }
774 if (node->max_match() > 0) { return false; }
780 bool RegExpDisjunction::IsAnchoredAtStart() {
781 ZoneList<RegExpTree*>* alternatives = this->alternatives();
782 for (int i = 0; i < alternatives->length(); i++) {
783 if (!alternatives->at(i)->IsAnchoredAtStart())
790 bool RegExpDisjunction::IsAnchoredAtEnd() {
791 ZoneList<RegExpTree*>* alternatives = this->alternatives();
792 for (int i = 0; i < alternatives->length(); i++) {
793 if (!alternatives->at(i)->IsAnchoredAtEnd())
800 bool RegExpLookahead::IsAnchoredAtStart() {
801 return is_positive() && body()->IsAnchoredAtStart();
805 bool RegExpCapture::IsAnchoredAtStart() {
806 return body()->IsAnchoredAtStart();
810 bool RegExpCapture::IsAnchoredAtEnd() {
811 return body()->IsAnchoredAtEnd();
815 // Convert regular expression trees to a simple sexp representation.
816 // This representation should be different from the input grammar
817 // in as many cases as possible, to make it more difficult for incorrect
818 // parses to look as correct ones which is likely if the input and
819 // output formats are alike.
820 class RegExpUnparser V8_FINAL : public RegExpVisitor {
822 explicit RegExpUnparser(Zone* zone);
823 void VisitCharacterRange(CharacterRange that);
824 SmartArrayPointer<const char> ToString() { return stream_.ToCString(); }
825 #define MAKE_CASE(Name) virtual void* Visit##Name(RegExp##Name*, \
826 void* data) V8_OVERRIDE;
827 FOR_EACH_REG_EXP_TREE_TYPE(MAKE_CASE)
830 StringStream* stream() { return &stream_; }
831 HeapStringAllocator alloc_;
832 StringStream stream_;
837 RegExpUnparser::RegExpUnparser(Zone* zone) : stream_(&alloc_), zone_(zone) {
841 void* RegExpUnparser::VisitDisjunction(RegExpDisjunction* that, void* data) {
843 for (int i = 0; i < that->alternatives()->length(); i++) {
845 that->alternatives()->at(i)->Accept(this, data);
852 void* RegExpUnparser::VisitAlternative(RegExpAlternative* that, void* data) {
854 for (int i = 0; i < that->nodes()->length(); i++) {
856 that->nodes()->at(i)->Accept(this, data);
863 void RegExpUnparser::VisitCharacterRange(CharacterRange that) {
864 stream()->Add("%k", that.from());
865 if (!that.IsSingleton()) {
866 stream()->Add("-%k", that.to());
872 void* RegExpUnparser::VisitCharacterClass(RegExpCharacterClass* that,
874 if (that->is_negated())
877 for (int i = 0; i < that->ranges(zone_)->length(); i++) {
878 if (i > 0) stream()->Add(" ");
879 VisitCharacterRange(that->ranges(zone_)->at(i));
886 void* RegExpUnparser::VisitAssertion(RegExpAssertion* that, void* data) {
887 switch (that->assertion_type()) {
888 case RegExpAssertion::START_OF_INPUT:
889 stream()->Add("@^i");
891 case RegExpAssertion::END_OF_INPUT:
892 stream()->Add("@$i");
894 case RegExpAssertion::START_OF_LINE:
895 stream()->Add("@^l");
897 case RegExpAssertion::END_OF_LINE:
898 stream()->Add("@$l");
900 case RegExpAssertion::BOUNDARY:
903 case RegExpAssertion::NON_BOUNDARY:
911 void* RegExpUnparser::VisitAtom(RegExpAtom* that, void* data) {
913 Vector<const uc16> chardata = that->data();
914 for (int i = 0; i < chardata.length(); i++) {
915 stream()->Add("%k", chardata[i]);
922 void* RegExpUnparser::VisitText(RegExpText* that, void* data) {
923 if (that->elements()->length() == 1) {
924 that->elements()->at(0).tree()->Accept(this, data);
927 for (int i = 0; i < that->elements()->length(); i++) {
929 that->elements()->at(i).tree()->Accept(this, data);
937 void* RegExpUnparser::VisitQuantifier(RegExpQuantifier* that, void* data) {
938 stream()->Add("(# %i ", that->min());
939 if (that->max() == RegExpTree::kInfinity) {
942 stream()->Add("%i ", that->max());
944 stream()->Add(that->is_greedy() ? "g " : that->is_possessive() ? "p " : "n ");
945 that->body()->Accept(this, data);
951 void* RegExpUnparser::VisitCapture(RegExpCapture* that, void* data) {
952 stream()->Add("(^ ");
953 that->body()->Accept(this, data);
959 void* RegExpUnparser::VisitLookahead(RegExpLookahead* that, void* data) {
960 stream()->Add("(-> ");
961 stream()->Add(that->is_positive() ? "+ " : "- ");
962 that->body()->Accept(this, data);
968 void* RegExpUnparser::VisitBackReference(RegExpBackReference* that,
970 stream()->Add("(<- %i)", that->index());
975 void* RegExpUnparser::VisitEmpty(RegExpEmpty* that, void* data) {
981 SmartArrayPointer<const char> RegExpTree::ToString(Zone* zone) {
982 RegExpUnparser unparser(zone);
983 Accept(&unparser, NULL);
984 return unparser.ToString();
988 RegExpDisjunction::RegExpDisjunction(ZoneList<RegExpTree*>* alternatives)
989 : alternatives_(alternatives) {
990 ASSERT(alternatives->length() > 1);
991 RegExpTree* first_alternative = alternatives->at(0);
992 min_match_ = first_alternative->min_match();
993 max_match_ = first_alternative->max_match();
994 for (int i = 1; i < alternatives->length(); i++) {
995 RegExpTree* alternative = alternatives->at(i);
996 min_match_ = Min(min_match_, alternative->min_match());
997 max_match_ = Max(max_match_, alternative->max_match());
1002 static int IncreaseBy(int previous, int increase) {
1003 if (RegExpTree::kInfinity - previous < increase) {
1004 return RegExpTree::kInfinity;
1006 return previous + increase;
1010 RegExpAlternative::RegExpAlternative(ZoneList<RegExpTree*>* nodes)
1012 ASSERT(nodes->length() > 1);
1015 for (int i = 0; i < nodes->length(); i++) {
1016 RegExpTree* node = nodes->at(i);
1017 int node_min_match = node->min_match();
1018 min_match_ = IncreaseBy(min_match_, node_min_match);
1019 int node_max_match = node->max_match();
1020 max_match_ = IncreaseBy(max_match_, node_max_match);
1025 CaseClause::CaseClause(Zone* zone,
1027 ZoneList<Statement*>* statements,
1029 : Expression(zone, pos),
1031 statements_(statements),
1032 compare_type_(Type::None(zone)),
1033 compare_id_(AstNode::GetNextId(zone)),
1034 entry_id_(AstNode::GetNextId(zone)) {
1038 #define REGULAR_NODE(NodeType) \
1039 void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \
1040 increase_node_count(); \
1042 #define DONT_OPTIMIZE_NODE(NodeType) \
1043 void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \
1044 increase_node_count(); \
1045 set_dont_optimize_reason(k##NodeType); \
1046 add_flag(kDontInline); \
1047 add_flag(kDontSelfOptimize); \
1049 #define DONT_SELFOPTIMIZE_NODE(NodeType) \
1050 void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \
1051 increase_node_count(); \
1052 add_flag(kDontSelfOptimize); \
1054 #define DONT_CACHE_NODE(NodeType) \
1055 void AstConstructionVisitor::Visit##NodeType(NodeType* node) { \
1056 increase_node_count(); \
1057 set_dont_optimize_reason(k##NodeType); \
1058 add_flag(kDontInline); \
1059 add_flag(kDontSelfOptimize); \
1060 add_flag(kDontCache); \
1063 REGULAR_NODE(VariableDeclaration)
1064 REGULAR_NODE(FunctionDeclaration)
1066 REGULAR_NODE(ExpressionStatement)
1067 REGULAR_NODE(EmptyStatement)
1068 REGULAR_NODE(IfStatement)
1069 REGULAR_NODE(ContinueStatement)
1070 REGULAR_NODE(BreakStatement)
1071 REGULAR_NODE(ReturnStatement)
1072 REGULAR_NODE(SwitchStatement)
1073 REGULAR_NODE(CaseClause)
1074 REGULAR_NODE(Conditional)
1075 REGULAR_NODE(Literal)
1076 REGULAR_NODE(ArrayLiteral)
1077 REGULAR_NODE(ObjectLiteral)
1078 REGULAR_NODE(RegExpLiteral)
1079 REGULAR_NODE(FunctionLiteral)
1080 REGULAR_NODE(Assignment)
1082 REGULAR_NODE(Property)
1083 REGULAR_NODE(UnaryOperation)
1084 REGULAR_NODE(CountOperation)
1085 REGULAR_NODE(BinaryOperation)
1086 REGULAR_NODE(CompareOperation)
1087 REGULAR_NODE(ThisFunction)
1089 REGULAR_NODE(CallNew)
1090 // In theory, for VariableProxy we'd have to add:
1091 // if (node->var()->IsLookupSlot()) add_flag(kDontInline);
1092 // But node->var() is usually not bound yet at VariableProxy creation time, and
1093 // LOOKUP variables only result from constructs that cannot be inlined anyway.
1094 REGULAR_NODE(VariableProxy)
1096 // We currently do not optimize any modules.
1097 DONT_OPTIMIZE_NODE(ModuleDeclaration)
1098 DONT_OPTIMIZE_NODE(ImportDeclaration)
1099 DONT_OPTIMIZE_NODE(ExportDeclaration)
1100 DONT_OPTIMIZE_NODE(ModuleVariable)
1101 DONT_OPTIMIZE_NODE(ModulePath)
1102 DONT_OPTIMIZE_NODE(ModuleUrl)
1103 DONT_OPTIMIZE_NODE(ModuleStatement)
1104 DONT_OPTIMIZE_NODE(Yield)
1105 DONT_OPTIMIZE_NODE(WithStatement)
1106 DONT_OPTIMIZE_NODE(TryCatchStatement)
1107 DONT_OPTIMIZE_NODE(TryFinallyStatement)
1108 DONT_OPTIMIZE_NODE(DebuggerStatement)
1109 DONT_OPTIMIZE_NODE(NativeFunctionLiteral)
1111 DONT_SELFOPTIMIZE_NODE(DoWhileStatement)
1112 DONT_SELFOPTIMIZE_NODE(WhileStatement)
1113 DONT_SELFOPTIMIZE_NODE(ForStatement)
1114 DONT_SELFOPTIMIZE_NODE(ForInStatement)
1115 DONT_SELFOPTIMIZE_NODE(ForOfStatement)
1117 DONT_CACHE_NODE(ModuleLiteral)
1119 void AstConstructionVisitor::VisitCallRuntime(CallRuntime* node) {
1120 increase_node_count();
1121 if (node->is_jsruntime()) {
1122 // Don't try to inline JS runtime calls because we don't (currently) even
1124 add_flag(kDontInline);
1125 } else if (node->function()->intrinsic_type == Runtime::INLINE &&
1126 (node->name()->IsOneByteEqualTo(
1127 STATIC_ASCII_VECTOR("_ArgumentsLength")) ||
1128 node->name()->IsOneByteEqualTo(STATIC_ASCII_VECTOR("_Arguments")))) {
1129 // Don't inline the %_ArgumentsLength or %_Arguments because their
1130 // implementation will not work. There is no stack frame to get them
1132 add_flag(kDontInline);
1137 #undef DONT_OPTIMIZE_NODE
1138 #undef DONT_SELFOPTIMIZE_NODE
1139 #undef DONT_CACHE_NODE
1142 Handle<String> Literal::ToString() {
1143 if (value_->IsString()) return Handle<String>::cast(value_);
1144 ASSERT(value_->IsNumber());
1146 Vector<char> buffer(arr, ARRAY_SIZE(arr));
1148 if (value_->IsSmi()) {
1149 // Optimization only, the heap number case would subsume this.
1150 OS::SNPrintF(buffer, "%d", Smi::cast(*value_)->value());
1153 str = DoubleToCString(value_->Number(), buffer);
1155 return isolate_->factory()->NewStringFromAscii(CStrVector(str));
1159 } } // namespace v8::internal