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()
37 ASSERT_TRUE(NULL != root->left_child()); in TEST()39 EXPECT_EQ(3u, root->left_child()->this_size()); in TEST()42 EXPECT_FALSE(root->left_child()->packet_start()); in TEST()73 EXPECT_TRUE(opt == root->left_child()->right_child()->left_child()-> in TEST()74 right_child()->left_child()->right_child()->left_child()); in TEST()
58 PartitionTreeNode* left_child() const { return children_[kLeftChild]; } in left_child() function
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. */
176 bool avb_aftl_rfc6962_hash_children(uint8_t* left_child, in avb_aftl_rfc6962_hash_children() argument185 avb_assert(left_child != NULL && right_child != NULL && hash != NULL); in avb_aftl_rfc6962_hash_children()201 if (left_child_size > 0) avb_memcpy(buffer + 1, left_child, left_child_size); in avb_aftl_rfc6962_hash_children()
2860 NodeDef* left_child = node_map_->GetNode(parent.input(0)); in PrepareConstantPushDown() local2862 ctx->left_child_is_const = IsReallyConstant(*left_child); in PrepareConstantPushDown()2864 ctx->op_child = ctx->left_child_is_const ? right_child : left_child; in PrepareConstantPushDown()2865 ctx->const_child = ctx->left_child_is_const ? left_child : right_child; in PrepareConstantPushDown()2930 << parent.op() << "(" << left_child->op() << ", " << right_child->op() in PrepareConstantPushDown()