Home
last modified time | relevance | path

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

/external/v8/src/compiler/
Dtypes.cc74 for (int i = 0, n = this->AsUnion()->Length(); i < n; ++i) { in Min()
75 min = std::min(min, this->AsUnion()->Get(i)->Min()); in Min()
91 for (int i = 0, n = this->AsUnion()->Length(); i < n; ++i) { in Max()
92 max = std::max(max, this->AsUnion()->Get(i)->Max()); in Max()
113 SLOW_DCHECK(type->AsUnion()->Wellformed()); in Glb()
114 return type->AsUnion()->Get(0)->BitsetGlb() | in Glb()
115 type->AsUnion()->Get(1)->BitsetGlb(); // Shortcut. in Glb()
132 int bitset = type->AsUnion()->Get(0)->BitsetLub(); in Lub()
133 for (int i = 0, n = type->AsUnion()->Length(); i < n; ++i) { in Lub()
135 bitset |= type->AsUnion()->Get(i)->BitsetLub(); in Lub()
[all …]
Dtypes.h620 UnionType* AsUnionForTesting() { return AsUnion(); } in AsUnionForTesting()
641 UnionType* AsUnion() { return UnionType::cast(this); } in AsUnion() function
/external/v8/src/ast/
Dast-types.cc79 for (int i = 0, n = this->AsUnion()->Length(); i < n; ++i) { in Min()
80 min = std::min(min, this->AsUnion()->Get(i)->Min()); in Min()
95 for (int i = 0, n = this->AsUnion()->Length(); i < n; ++i) { in Max()
96 max = std::max(max, this->AsUnion()->Get(i)->Max()); in Max()
116 SLOW_DCHECK(type->AsUnion()->Wellformed()); in Glb()
117 return type->AsUnion()->Get(0)->BitsetGlb() | in Glb()
118 AST_SEMANTIC(type->AsUnion()->Get(1)->BitsetGlb()); // Shortcut. in Glb()
135 int bitset = type->AsUnion()->Get(0)->BitsetLub(); in Lub()
136 for (int i = 0, n = type->AsUnion()->Length(); i < n; ++i) { in Lub()
138 bitset |= AST_SEMANTIC(type->AsUnion()->Get(i)->BitsetLub()); in Lub()
[all …]
Dast-types.h898 AstUnionType* AsUnionForTesting() { return AsUnion(); } in AsUnionForTesting()
921 AstUnionType* AsUnion() { return AstUnionType::cast(this); } in AsUnion() function