140     Node** values, size_t count, const BitVector* liveness,  in FillBufferWithValues()  argument
152     if (liveness == nullptr ||  in FillBufferWithValues()
153         liveness->Contains(liveness_offset + static_cast<int>(*values_idx))) {  in FillBufferWithValues()
172                                   size_t count, const BitVector* liveness,  in BuildTree()  argument
180                                       values, count, liveness, liveness_offset);  in BuildTree()
194                                  count, liveness, liveness_offset);  in BuildTree()
210         Node* subtree = BuildTree(values_idx, values, count, liveness,  in BuildTree()
234                              const BitVector* liveness, int liveness_offset) {  in CheckTreeContainsValues()  argument
242     if (liveness == nullptr || liveness->Contains(liveness_offset + i)) {  in CheckTreeContainsValues()
255                                          const BitVector* liveness,  in GetNodeForValues()  argument
265   if (liveness != nullptr) {  in GetNodeForValues()
266     DCHECK_LE(liveness_offset + count, static_cast<size_t>(liveness->length()));  in GetNodeForValues()
269       if (liveness->Contains(liveness_offset + static_cast<int>(i))) {  in GetNodeForValues()
293       BuildTree(&values_idx, values, count, liveness, liveness_offset, height);  in GetNodeForValues()
301   CheckTreeContainsValues(tree, values, count, liveness, liveness_offset);  in GetNodeForValues()