Generate code for choice nodes.

src/jsregexp.h

 // Copyright 2006-2008 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 386 matching lines @@
 
 
 class RegExpNode: public ZoneObject {
  public:
   virtual ~RegExpNode() { }
   virtual void Accept(NodeVisitor* visitor) = 0;
   // Generates a goto to this node or actually generates the code at this point.
   // Until the implementation is complete we will return true for success and
   // false for failure.
   bool GoTo(RegExpCompiler* compiler);
-  void EmitAddress(RegExpCompiler* compiler);
+  Label* GetLabel();

[Christian Plesner Hansen, 2008/11/14 13:28:34]

Since this is a simple accessor you could just call it label() and write the
implementation inline.

   // Until the implementation is complete we will return true for success and
   // false for failure.
   virtual bool Emit(RegExpCompiler* compiler) = 0;
  private:
   Label label;
 };
 
 
 class SeqRegExpNode: public RegExpNode {
  public:
@@ skipping 164 matching lines @@
       visited_(false) { }
   virtual void Accept(NodeVisitor* visitor);
   void AddChild(GuardedAlternative node) { choices()->Add(node); }
   ZoneList<GuardedAlternative>* choices() { return choices_; }
   DispatchTable* table() { return &table_; }
   RegExpNode* on_failure() { return on_failure_; }
   virtual bool Emit(RegExpCompiler* compiler);
   bool visited() { return visited_; }
   void set_visited(bool value) { visited_ = value; }
  private:
+  void GenerateGuard(RegExpCompiler* compiler,
+                     Guard *guard,
+                     Label* on_failure);
   RegExpNode* on_failure_;
   ZoneList<GuardedAlternative>* choices_;
   DispatchTable table_;
   bool visited_;
 };
 
 
 struct RegExpParseResult {
   RegExpTree* tree;
   bool has_character_escapes;
@@ skipping 10 matching lines @@
   static void DotPrint(const char* label, RegExpNode* node);
 };
 
 
 class RegExpCompiler;
 
 
 } }  // namespace v8::internal
 
 #endif  // V8_JSREGEXP_H_