OLD | NEW |
1 // Copyright 2006-2008 the V8 project authors. All rights reserved. | 1 // Copyright 2006-2008 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 33 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
44 | 44 |
45 | 45 |
46 // ---------------------------------------------------------------------------- | 46 // ---------------------------------------------------------------------------- |
47 // All the Accept member functions for each syntax tree node type. | 47 // All the Accept member functions for each syntax tree node type. |
48 | 48 |
49 #define DECL_ACCEPT(type) \ | 49 #define DECL_ACCEPT(type) \ |
50 void type::Accept(AstVisitor* v) { \ | 50 void type::Accept(AstVisitor* v) { \ |
51 if (v->CheckStackOverflow()) return; \ | 51 if (v->CheckStackOverflow()) return; \ |
52 v->Visit##type(this); \ | 52 v->Visit##type(this); \ |
53 } | 53 } |
54 NODE_LIST(DECL_ACCEPT) | 54 AST_NODE_LIST(DECL_ACCEPT) |
55 #undef DECL_ACCEPT | 55 #undef DECL_ACCEPT |
56 | 56 |
57 | 57 |
58 // ---------------------------------------------------------------------------- | 58 // ---------------------------------------------------------------------------- |
59 // Implementation of other node functionality. | 59 // Implementation of other node functionality. |
60 | 60 |
61 VariableProxy::VariableProxy(Handle<String> name, | 61 VariableProxy::VariableProxy(Handle<String> name, |
62 bool is_this, | 62 bool is_this, |
63 bool inside_with) | 63 bool inside_with) |
64 : name_(name), | 64 : name_(name), |
(...skipping 438 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
503 if (kInfinity - max_match_ < node_max_match) { | 503 if (kInfinity - max_match_ < node_max_match) { |
504 max_match_ = kInfinity; | 504 max_match_ = kInfinity; |
505 } else { | 505 } else { |
506 max_match_ += node->max_match(); | 506 max_match_ += node->max_match(); |
507 } | 507 } |
508 } | 508 } |
509 } | 509 } |
510 | 510 |
511 | 511 |
512 } } // namespace v8::internal | 512 } } // namespace v8::internal |
OLD | NEW |