OLD | NEW |
1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 50 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
61 | 61 |
62 TypeFeedbackOracle* oracle() { return &oracle_; } | 62 TypeFeedbackOracle* oracle() { return &oracle_; } |
63 Zone* zone() const { return info_->zone(); } | 63 Zone* zone() const { return info_->zone(); } |
64 | 64 |
65 void MergeLowerType(Expression* e, Handle<Type> t) { | 65 void MergeLowerType(Expression* e, Handle<Type> t) { |
66 e->set_lower_type(handle(Type::Union(e->lower_type(), t), isolate_)); | 66 e->set_lower_type(handle(Type::Union(e->lower_type(), t), isolate_)); |
67 } | 67 } |
68 void MergeUpperType(Expression* e, Handle<Type> t) { | 68 void MergeUpperType(Expression* e, Handle<Type> t) { |
69 e->set_upper_type(handle(Type::Intersect(e->upper_type(), t), isolate_)); | 69 e->set_upper_type(handle(Type::Intersect(e->upper_type(), t), isolate_)); |
70 } | 70 } |
| 71 void MergeLowerType(Expression* e, Type* t) { |
| 72 MergeLowerType(e, handle(t, isolate_)); |
| 73 } |
| 74 void MergeUpperType(Expression* e, Type* t) { |
| 75 MergeUpperType(e, handle(t, isolate_)); |
| 76 } |
| 77 |
| 78 static Type* BoundedType(Type* bound, Handle<Type> type) { |
| 79 return type->Is(bound) ? *type : bound; |
| 80 } |
| 81 static Type* AdditionType(Handle<Type> type) { |
| 82 return type->Is(Type::Number()) ? Type::Number() : |
| 83 type->Is(Type::String()) ? Type::String() : Type::NumberOrString(); |
| 84 } |
71 | 85 |
72 void VisitDeclarations(ZoneList<Declaration*>* declarations); | 86 void VisitDeclarations(ZoneList<Declaration*>* declarations); |
73 void VisitStatements(ZoneList<Statement*>* statements); | 87 void VisitStatements(ZoneList<Statement*>* statements); |
74 | 88 |
75 #define DECLARE_VISIT(type) virtual void Visit##type(type* node); | 89 #define DECLARE_VISIT(type) virtual void Visit##type(type* node); |
76 AST_NODE_LIST(DECLARE_VISIT) | 90 AST_NODE_LIST(DECLARE_VISIT) |
77 #undef DECLARE_VISIT | 91 #undef DECLARE_VISIT |
78 | 92 |
79 DISALLOW_COPY_AND_ASSIGN(AstTyper); | 93 DISALLOW_COPY_AND_ASSIGN(AstTyper); |
80 }; | 94 }; |
81 | 95 |
82 } } // namespace v8::internal | 96 } } // namespace v8::internal |
83 | 97 |
84 #endif // V8_TYPING_H_ | 98 #endif // V8_TYPING_H_ |
OLD | NEW |