Lower simplified StringLessThan[OrEqual] to runtime call.

test/cctest/compiler/test-simplified-lowering.cc

 // Copyright 2014 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include <limits>
 
 #include "src/compiler/access-builder.h"
 #include "src/compiler/control-builders.h"
 #include "src/compiler/generic-node-inl.h"
 #include "src/compiler/graph-visualizer.h"
@@ skipping 1033 matching lines @@
 
 
 TEST(LowerReferenceEqual_to_wordeq) {
   TestingGraph t(Type::Any(), Type::Any());
   IrOpcode::Value opcode =
       static_cast<IrOpcode::Value>(t.machine()->WordEqual()->opcode());
   t.CheckLoweringBinop(opcode, t.simplified()->ReferenceEqual(Type::Any()));
 }
 
 
-TEST(LowerStringOps_to_call_and_wordeq) {
+TEST(LowerStringOps_to_call_and_compare) {
   TestingGraph t(Type::String(), Type::String());
-  IrOpcode::Value opcode =
+  IrOpcode::Value compare_eq =
       static_cast<IrOpcode::Value>(t.machine()->WordEqual()->opcode());
-  t.CheckLoweringBinop(opcode, t.simplified()->StringEqual());
-  if (false) {  // TODO(titzer): lower StringOps to stub/runtime calls
-    t.CheckLoweringBinop(opcode, t.simplified()->StringLessThan());
-    t.CheckLoweringBinop(opcode, t.simplified()->StringLessThanOrEqual());
-  }
+  IrOpcode::Value compare_lt =
+      static_cast<IrOpcode::Value>(t.machine()->IntLessThan()->opcode());
+  IrOpcode::Value compare_le =
+      static_cast<IrOpcode::Value>(t.machine()->IntLessThanOrEqual()->opcode());
+  t.CheckLoweringBinop(compare_eq, t.simplified()->StringEqual());
+  t.CheckLoweringBinop(compare_lt, t.simplified()->StringLessThan());
+  t.CheckLoweringBinop(compare_le, t.simplified()->StringLessThanOrEqual());
   t.CheckLoweringBinop(IrOpcode::kCall, t.simplified()->StringAdd());
 }
 
 
 void CheckChangeInsertion(IrOpcode::Value expected, MachineType from,
                           MachineType to) {
   TestingGraph t(Type::Any());
   Node* in = t.ExampleWithOutput(from);
   Node* use = t.Use(in, to);
   t.Return(use);
@@ skipping 336 matching lines @@
 
   Node* store = t.graph()->NewNode(t.simplified()->StoreField(access), t.p0,
                                    t.p1, t.start, t.start);
   t.Effect(store);
   t.Lower();
 
   CHECK_EQ(IrOpcode::kStore, store->opcode());
   CHECK_EQ(t.p0, store->InputAt(0));
   CheckChangeOf(IrOpcode::kChangeTaggedToFloat64, t.p1, store->InputAt(2));
 }