Searched refs:right_child (Results 1 – 8 of 8) sorted by relevance
56 uint32_t right_child = left_child + 1; in adjust_downwards() local57 uint32_t next_i = right_child < length && first[left_child]->deadline > in adjust_downwards()58 first[right_child]->deadline in adjust_downwards()59 ? right_child in adjust_downwards()
56 size_t right_child = left_child + 1u; in check_valid() local60 if (right_child < pq->timer_count) { in check_valid()61 GPR_ASSERT(pq->timers[i]->deadline <= pq->timers[right_child]->deadline); in check_valid()
600 def right_child(self, node): member in RBTreeUtils641 return parent is not None and self.right_child(parent) == node671 right_child = self.util.right_child(current)672 if right_child:673 current = right_child
66 uint8_t* right_child, /* The right child node data. */
79 uint8_t* right_child, in avb_aftl_rfc6962_hash_children() argument86 avb_assert(left_child != NULL && right_child != NULL && hash != NULL); in avb_aftl_rfc6962_hash_children()105 avb_memcpy(buffer + 1 + left_child_size, right_child, right_child_size); in avb_aftl_rfc6962_hash_children()
497 ; CHECK-NEXT: to label %[[unreach]] unwind label %[[right_child:.+]]503 ; CHECK: [[right_child]]:
3100 NodeDef* right_child = node_map_->GetNode(parent.input(1)); in PrepareConstantPushDown() local3102 ctx->right_child_is_const = IsReallyConstant(*right_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()