| 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 980 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 991 #undef DEFINE_ACCEPT | 991 #undef DEFINE_ACCEPT |
| 992 | 992 |
| 993 | 993 |
| 994 // ------------------------------------------------------------------- | 994 // ------------------------------------------------------------------- |
| 995 // Emit code. | 995 // Emit code. |
| 996 | 996 |
| 997 | 997 |
| 998 void ChoiceNode::GenerateGuard(RegExpCompiler* compiler, | 998 void ChoiceNode::GenerateGuard(RegExpCompiler* compiler, |
| 999 Guard *guard, | 999 Guard *guard, |
| 1000 Label* on_failure) { | 1000 Label* on_failure) { |
| 1001 | |
| 1002 } | 1001 } |
| 1003 | 1002 |
| 1004 | 1003 |
| 1005 bool ChoiceNode::Emit(RegExpCompiler* compiler) { | 1004 bool ChoiceNode::Emit(RegExpCompiler* compiler) { |
| 1006 int choice_count = alternatives_->length(); | 1005 int choice_count = alternatives_->length(); |
| 1007 RegExpMacroAssembler* macro_assembler = compiler->macro_assembler(); | 1006 RegExpMacroAssembler* macro_assembler = compiler->macro_assembler(); |
| 1008 // For now we just call all choices one after the other. The idea ultimately | 1007 // For now we just call all choices one after the other. The idea ultimately |
| 1009 // is to use the Dispatch table to try only the relevant ones. | 1008 // is to use the Dispatch table to try only the relevant ones. |
| 1010 for (int i = 0; i < choice_count; i++) { | 1009 for (int i = 0; i < choice_count; i++) { |
| 1011 GuardedAlternative alternative = (*alternatives_)[i]; | 1010 GuardedAlternative alternative = (*alternatives_)[i]; |
| (...skipping 966 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1978 } | 1977 } |
| 1979 | 1978 |
| 1980 RegExpMacroAssembler::RegExpMacroAssembler() { | 1979 RegExpMacroAssembler::RegExpMacroAssembler() { |
| 1981 } | 1980 } |
| 1982 | 1981 |
| 1983 RegExpMacroAssembler::~RegExpMacroAssembler() { | 1982 RegExpMacroAssembler::~RegExpMacroAssembler() { |
| 1984 } | 1983 } |
| 1985 | 1984 |
| 1986 | 1985 |
| 1987 }} // namespace v8::internal | 1986 }} // namespace v8::internal |
| OLD | NEW |