test-hydrogen-types.cc 4.2 KB
Newer Older
1 2 3 4
// 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.

5
#include "src/crankshaft/hydrogen-types.h"
6

7
#include "test/cctest/cctest.h"
8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167

using namespace v8::internal;

static const HType kTypes[] = {
  #define DECLARE_TYPE(Name, mask) HType::Name(),
  HTYPE_LIST(DECLARE_TYPE)
  #undef DECLARE_TYPE
};

static const int kNumberOfTypes = sizeof(kTypes) / sizeof(kTypes[0]);


TEST(HTypeDistinct) {
  for (int i = 0; i < kNumberOfTypes; ++i) {
    for (int j = 0; j < kNumberOfTypes; ++j) {
      CHECK(i == j || !kTypes[i].Equals(kTypes[j]));
    }
  }
}


TEST(HTypeReflexivity) {
  // Reflexivity of =
  for (int i = 0; i < kNumberOfTypes; ++i) {
    CHECK(kTypes[i].Equals(kTypes[i]));
  }

  // Reflexivity of <
  for (int i = 0; i < kNumberOfTypes; ++i) {
    CHECK(kTypes[i].IsSubtypeOf(kTypes[i]));
  }
}


TEST(HTypeTransitivity) {
  // Transitivity of =
  for (int i = 0; i < kNumberOfTypes; ++i) {
    for (int j = 0; j < kNumberOfTypes; ++j) {
      for (int k = 0; k < kNumberOfTypes; ++k) {
        HType ti = kTypes[i];
        HType tj = kTypes[j];
        HType tk = kTypes[k];
        CHECK(!ti.Equals(tj) || !tj.Equals(tk) || ti.Equals(tk));
      }
    }
  }

  // Transitivity of <
  for (int i = 0; i < kNumberOfTypes; ++i) {
    for (int j = 0; j < kNumberOfTypes; ++j) {
      for (int k = 0; k < kNumberOfTypes; ++k) {
        HType ti = kTypes[i];
        HType tj = kTypes[j];
        HType tk = kTypes[k];
        CHECK(!ti.IsSubtypeOf(tj) || !tj.IsSubtypeOf(tk) || ti.IsSubtypeOf(tk));
      }
    }
  }
}


TEST(HTypeCombine) {
  // T < T /\ T' and T' < T /\ T' for all T,T'
  for (int i = 0; i < kNumberOfTypes; ++i) {
    for (int j = 0; j < kNumberOfTypes; ++j) {
      HType ti = kTypes[i];
      HType tj = kTypes[j];
      CHECK(ti.IsSubtypeOf(ti.Combine(tj)));
      CHECK(tj.IsSubtypeOf(ti.Combine(tj)));
    }
  }
}


TEST(HTypeAny) {
  // T < Any for all T
  for (int i = 0; i < kNumberOfTypes; ++i) {
    HType ti = kTypes[i];
    CHECK(ti.IsAny());
  }

  // Any < T implies T = Any for all T
  for (int i = 0; i < kNumberOfTypes; ++i) {
    HType ti = kTypes[i];
    CHECK(!HType::Any().IsSubtypeOf(ti) || HType::Any().Equals(ti));
  }
}


TEST(HTypeTagged) {
  // T < Tagged for all T \ {Any}
  for (int i = 0; i < kNumberOfTypes; ++i) {
    HType ti = kTypes[i];
    CHECK(ti.IsTagged() || HType::Any().Equals(ti));
  }

  // Tagged < T implies T = Tagged or T = Any
  for (int i = 0; i < kNumberOfTypes; ++i) {
    HType ti = kTypes[i];
    CHECK(!HType::Tagged().IsSubtypeOf(ti) ||
          HType::Tagged().Equals(ti) ||
          HType::Any().Equals(ti));
  }
}


TEST(HTypeSmi) {
  // T < Smi implies T = None or T = Smi for all T
  for (int i = 0; i < kNumberOfTypes; ++i) {
    HType ti = kTypes[i];
    CHECK(!ti.IsSmi() ||
          ti.Equals(HType::Smi()) ||
          ti.Equals(HType::None()));
  }
}


TEST(HTypeHeapObject) {
  CHECK(!HType::TaggedPrimitive().IsHeapObject());
  CHECK(!HType::TaggedNumber().IsHeapObject());
  CHECK(!HType::Smi().IsHeapObject());
  CHECK(HType::HeapObject().IsHeapObject());
  CHECK(HType::HeapPrimitive().IsHeapObject());
  CHECK(HType::Null().IsHeapObject());
  CHECK(HType::HeapNumber().IsHeapObject());
  CHECK(HType::String().IsHeapObject());
  CHECK(HType::Boolean().IsHeapObject());
  CHECK(HType::Undefined().IsHeapObject());
  CHECK(HType::JSObject().IsHeapObject());
  CHECK(HType::JSArray().IsHeapObject());
}


TEST(HTypePrimitive) {
  CHECK(HType::TaggedNumber().IsTaggedPrimitive());
  CHECK(HType::Smi().IsTaggedPrimitive());
  CHECK(!HType::HeapObject().IsTaggedPrimitive());
  CHECK(HType::HeapPrimitive().IsTaggedPrimitive());
  CHECK(HType::Null().IsHeapPrimitive());
  CHECK(HType::HeapNumber().IsHeapPrimitive());
  CHECK(HType::String().IsHeapPrimitive());
  CHECK(HType::Boolean().IsHeapPrimitive());
  CHECK(HType::Undefined().IsHeapPrimitive());
  CHECK(!HType::JSObject().IsTaggedPrimitive());
  CHECK(!HType::JSArray().IsTaggedPrimitive());
}


TEST(HTypeJSObject) {
  CHECK(HType::JSArray().IsJSObject());
}


TEST(HTypeNone) {
  // None < T for all T
  for (int i = 0; i < kNumberOfTypes; ++i) {
    HType ti = kTypes[i];
    CHECK(HType::None().IsSubtypeOf(ti));
  }
}