Searched refs:left_child (Results 1 – 7 of 7) sorted by relevance
54 uint32_t left_child = 1u + 2u * i; in adjust_downwards() local55 if (left_child >= length) break; in adjust_downwards()56 uint32_t right_child = left_child + 1; in adjust_downwards()57 uint32_t next_i = right_child < length && first[left_child]->deadline > in adjust_downwards()60 : left_child; in adjust_downwards()
55 size_t left_child = 1u + 2u * i; in check_valid() local56 size_t right_child = left_child + 1u; in check_valid()57 if (left_child < pq->timer_count) { in check_valid()58 GPR_ASSERT(pq->timers[i]->deadline <= pq->timers[left_child]->deadline); in check_valid()
64 uint8_t* left_child, /* The left child node data. */
77 bool avb_aftl_rfc6962_hash_children(uint8_t* left_child, in avb_aftl_rfc6962_hash_children() argument86 avb_assert(left_child != NULL && right_child != NULL && hash != NULL); in avb_aftl_rfc6962_hash_children()102 if (left_child_size > 0) avb_memcpy(buffer + 1, left_child, left_child_size); in avb_aftl_rfc6962_hash_children()
596 def left_child(self, node): member in RBTreeUtils618 if self.left_child(node) == self.root:637 return parent is not None and self.left_child(parent) == node665 if not skip_left_child and self.util.left_child(current):666 current = self.util.left_child(current)
3099 NodeDef* left_child = node_map_->GetNode(parent.input(0)); in PrepareConstantPushDown() local3101 ctx->left_child_is_const = IsReallyConstant(*left_child); in PrepareConstantPushDown()3103 ctx->op_child = ctx->left_child_is_const ? right_child : left_child; in PrepareConstantPushDown()3104 ctx->const_child = ctx->left_child_is_const ? left_child : right_child; in PrepareConstantPushDown()3169 << parent.op() << "(" << left_child->op() << ", " << right_child->op() in PrepareConstantPushDown()