Case independent back references.

src/jsregexp.cc

 // 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 1456 matching lines @@
 
 
 bool BackReferenceNode::Emit(RegExpCompiler* compiler) {
   RegExpMacroAssembler* macro = compiler->macro_assembler();
   Bind(macro);
   // Check whether the registers are uninitialized and always
   // succeed if they are.
   macro->IfRegisterLT(start_reg_, 0, on_success()->label());
   macro->IfRegisterLT(end_reg_, 0, on_success()->label());
   ASSERT_EQ(start_reg_ + 1, end_reg_);
-  macro->CheckNotBackReference(start_reg_, on_failure_->label());
+  if (!compiler->is_case_independent()) {

[Christian Plesner Hansen, 2008/11/25 08:18:45]

Why negate the condition?

+    macro->CheckNotBackReference(start_reg_, on_failure_->label());
+  } else {
+    macro->CheckNotBackReferenceCaseIndependent(start_reg_,
+                                                on_failure_->label());
+  }
   return on_success()->GoTo(compiler);
 }
 
 
 // -------------------------------------------------------------------
 // Dot/dotty output
 
 
 #ifdef DEBUG
 
@@ skipping 1102 matching lines @@
   byte codes[1024];
   IrregexpAssembler assembler(Vector<byte>(codes, 1024));
   RegExpMacroAssemblerIrregexp macro_assembler(&assembler);
   return compiler.Assemble(&macro_assembler,
                            node,
                            input->capture_count);
 }
 
 
 }}  // namespace v8::internal