[builtins] Unify Atanh, Cbrt and Expm1 as exports from flibm.

src/compiler/js-builtin-reducer.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 "src/compiler/js-builtin-reducer.h"
 #include "src/compiler/js-graph.h"
 #include "src/compiler/node-matchers.h"
 #include "src/compiler/node-properties.h"
 #include "src/compiler/simplified-operator.h"
 #include "src/objects-inl.h"
@@ skipping 100 matching lines @@
     //            b:plain-primitive) -> NumberAtan2(ToNumber(a),
     //                                              ToNumber(b))
     Node* left = ToNumber(r.left());
     Node* right = ToNumber(r.right());
     Node* value = graph()->NewNode(simplified()->NumberAtan2(), left, right);
     return Replace(value);
   }
   return NoChange();
 }
 
+// ES6 section 20.2.2.7 Math.atanh ( x )
+Reduction JSBuiltinReducer::ReduceMathAtanh(Node* node) {
+  JSCallReduction r(node);
+  if (r.InputsMatchOne(Type::Number())) {
+    // Math.atanh(a:number) -> NumberAtanh(a)
+    Node* value = graph()->NewNode(simplified()->NumberAtanh(), r.left());
+    return Replace(value);
+  }
+  return NoChange();
+}
+
 // ES6 section 20.2.2.10 Math.ceil ( x )
 Reduction JSBuiltinReducer::ReduceMathCeil(Node* node) {
   JSCallReduction r(node);
   if (r.InputsMatchOne(Type::PlainPrimitive())) {
     // Math.ceil(a:plain-primitive) -> NumberCeil(ToNumber(a))
     Node* input = ToNumber(r.GetJSCallInput(0));
     Node* value = graph()->NewNode(simplified()->NumberCeil(), input);
     return Replace(value);
   }
   return NoChange();
@@ skipping 16 matching lines @@
   JSCallReduction r(node);
   if (r.InputsMatchOne(Type::PlainPrimitive())) {
     // Math.exp(a:plain-primitive) -> NumberExp(ToNumber(a))
     Node* input = ToNumber(r.GetJSCallInput(0));
     Node* value = graph()->NewNode(simplified()->NumberExp(), input);
     return Replace(value);
   }
   return NoChange();
 }
 
+// ES6 section 20.2.2.15 Math.expm1 ( x )
+Reduction JSBuiltinReducer::ReduceMathExpm1(Node* node) {
+  JSCallReduction r(node);
+  if (r.InputsMatchOne(Type::Number())) {
+    // Math.expm1(a:number) -> NumberExpm1(a)
+    Node* value = graph()->NewNode(simplified()->NumberExpm1(), r.left());
+    return Replace(value);
+  }
+  return NoChange();
+}
+
 // ES6 section 20.2.2.16 Math.floor ( x )
 Reduction JSBuiltinReducer::ReduceMathFloor(Node* node) {
   JSCallReduction r(node);
   if (r.InputsMatchOne(Type::PlainPrimitive())) {
     // Math.floor(a:plain-primitive) -> NumberFloor(ToNumber(a))
     Node* input = ToNumber(r.GetJSCallInput(0));
     Node* value = graph()->NewNode(simplified()->NumberFloor(), input);
     return Replace(value);
   }
   return NoChange();
@@ skipping 119 matching lines @@
 Reduction JSBuiltinReducer::ReduceMathLog10(Node* node) {
   JSCallReduction r(node);
   if (r.InputsMatchOne(Type::Number())) {
     // Math.log10(a:number) -> NumberLog10(a)
     Node* value = graph()->NewNode(simplified()->NumberLog10(), r.left());
     return Replace(value);
   }
   return NoChange();
 }
 
+// ES6 section 20.2.2.9 Math.cbrt ( x )
+Reduction JSBuiltinReducer::ReduceMathCbrt(Node* node) {
+  JSCallReduction r(node);
+  if (r.InputsMatchOne(Type::Number())) {
+    // Math.cbrt(a:number) -> NumberCbrt(a)
+    Node* value = graph()->NewNode(simplified()->NumberCbrt(), r.left());
+    return Replace(value);
+  }
+  return NoChange();
+}
+
 // ES6 section 20.2.2.28 Math.round ( x )
 Reduction JSBuiltinReducer::ReduceMathRound(Node* node) {
   JSCallReduction r(node);
   if (r.InputsMatchOne(Type::PlainPrimitive())) {
     // Math.round(a:plain-primitive) -> NumberRound(ToNumber(a))
     Node* input = ToNumber(r.GetJSCallInput(0));
     Node* value = graph()->NewNode(simplified()->NumberRound(), input);
     return Replace(value);
   }
   return NoChange();
@@ skipping 41 matching lines @@
 
   // Dispatch according to the BuiltinFunctionId if present.
   if (!r.HasBuiltinFunctionId()) return NoChange();
   switch (r.GetBuiltinFunctionId()) {
     case kMathAtan:
       reduction = ReduceMathAtan(node);
       break;
     case kMathAtan2:
       reduction = ReduceMathAtan2(node);
       break;
+    case kMathAtanh:
+      reduction = ReduceMathAtanh(node);
+      break;
     case kMathClz32:
       reduction = ReduceMathClz32(node);
       break;
     case kMathCeil:
       reduction = ReduceMathCeil(node);
       break;
     case kMathExp:
       reduction = ReduceMathExp(node);
       break;
+    case kMathExpm1:
+      reduction = ReduceMathExpm1(node);
+      break;
     case kMathFloor:
       reduction = ReduceMathFloor(node);
       break;
     case kMathFround:
       reduction = ReduceMathFround(node);
       break;
     case kMathImul:
       reduction = ReduceMathImul(node);
       break;
     case kMathLog:
       reduction = ReduceMathLog(node);
       break;
     case kMathLog1p:
       reduction = ReduceMathLog1p(node);
       break;
     case kMathLog2:
       reduction = ReduceMathLog2(node);
       break;
     case kMathLog10:
       reduction = ReduceMathLog10(node);
       break;
     case kMathMax:
       reduction = ReduceMathMax(node);
       break;
     case kMathMin:
       reduction = ReduceMathMin(node);
       break;
+    case kMathCbrt:
+      reduction = ReduceMathCbrt(node);
+      break;
     case kMathRound:
       reduction = ReduceMathRound(node);
       break;
     case kMathSqrt:
       reduction = ReduceMathSqrt(node);
       break;
     case kMathTrunc:
       reduction = ReduceMathTrunc(node);
       break;
     case kStringFromCharCode:
@@ skipping 34 matching lines @@
 }
 
 
 SimplifiedOperatorBuilder* JSBuiltinReducer::simplified() const {
   return jsgraph()->simplified();
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8