Searched refs:BTREE (Results 1 – 11 of 11) sorted by relevance
181 BTREE = 2, enumerator202 static_assert(RING == BTREE + 1, "BTREE and RING not consecutive");235 constexpr bool IsBtree() const { return tag == BTREE; } in IsBtree()
55 } else if (rep->tag == BTREE) { in Destroy()
125 if (rep->tag == cord_internal::BTREE) { in CordToString()
90 } else if (repref.rep->tag == BTREE) { in AnalyzeCordRep()
292 if (result.tree->tag == BTREE) { in TEST_P()
89 if (arg->tag != BTREE) {801 ASSERT_THAT(result->tag, Eq(BTREE)); in TEST()1296 edge->tag = BTREE; in TEST()
527 tag = BTREE; in InitInstance()
150 } else if (rep->tag == BTREE) { in FairShareImpl()
74 if (s->mode == BTREE || s->mode == DTREE) in inflate_blocks_reset()237 s->mode = BTREE; in inflate_blocks()239 case BTREE: in inflate_blocks()
19 BTREE, /* get bit lengths tree for a dynamic block */ enumerator
1251 if (tree->tag == cord_internal::BTREE) { in InitTree()