Home
last modified time | relevance | path

Searched refs:AsUnion (Results 1 – 4 of 4) sorted by relevance

/external/v8/src/compiler/
Dtypes.cc73 for (int i = 0, n = this->AsUnion()->Length(); i < n; ++i) { in Min()
74 min = std::min(min, this->AsUnion()->Get(i)->Min()); in Min()
90 for (int i = 0, n = this->AsUnion()->Length(); i < n; ++i) { in Max()
91 max = std::max(max, this->AsUnion()->Get(i)->Max()); in Max()
112 SLOW_DCHECK(type->AsUnion()->Wellformed()); in Glb()
113 return type->AsUnion()->Get(0)->BitsetGlb() | in Glb()
114 type->AsUnion()->Get(1)->BitsetGlb(); // Shortcut. in Glb()
131 int bitset = type->AsUnion()->Get(0)->BitsetLub(); in Lub()
132 for (int i = 0, n = type->AsUnion()->Length(); i < n; ++i) { in Lub()
134 bitset |= type->AsUnion()->Get(i)->BitsetLub(); in Lub()
[all …]
Dtypes.h601 UnionType* AsUnionForTesting() { return AsUnion(); } in AsUnionForTesting()
622 UnionType* AsUnion() { return UnionType::cast(this); } in AsUnion() function
/external/v8/src/ast/
Dast-types.cc78 for (int i = 0, n = this->AsUnion()->Length(); i < n; ++i) { in Min()
79 min = std::min(min, this->AsUnion()->Get(i)->Min()); in Min()
94 for (int i = 0, n = this->AsUnion()->Length(); i < n; ++i) { in Max()
95 max = std::max(max, this->AsUnion()->Get(i)->Max()); in Max()
115 SLOW_DCHECK(type->AsUnion()->Wellformed()); in Glb()
116 return type->AsUnion()->Get(0)->BitsetGlb() | in Glb()
117 AST_SEMANTIC(type->AsUnion()->Get(1)->BitsetGlb()); // Shortcut. in Glb()
134 int bitset = type->AsUnion()->Get(0)->BitsetLub(); in Lub()
135 for (int i = 0, n = type->AsUnion()->Length(); i < n; ++i) { in Lub()
137 bitset |= AST_SEMANTIC(type->AsUnion()->Get(i)->BitsetLub()); in Lub()
[all …]
Dast-types.h905 AstUnionType* AsUnionForTesting() { return AsUnion(); } in AsUnionForTesting()
928 AstUnionType* AsUnion() { return AstUnionType::cast(this); } in AsUnion() function