Searched refs:children_size (Results 1 – 3 of 3) sorted by relevance
53 if (root.children_size() == 0) { in CheckOpView()58 for (int i = 0; i < 3 && node->children_size() > 0; ++i) { in CheckOpView()83 while (node->children_size() == 1) { in CheckCodeView()86 if (node->children_size() == 0) { in CheckCodeView()99 if (root.children_size() == 0) { in CheckScopeView()103 for (int i = 0; i < 3 && i < root.children_size(); ++i) { in CheckScopeView()116 if (node->children_size() <= 1 || depth > 3) { in CodeViewHelper()119 for (int j = 0; j < 3 && j < node->children_size(); ++j) { in CodeViewHelper()
504 CHECK(split_info.children_size() % 2 == 0) in FindBestSplitOblivious()506 << split_info.children_size(); in FindBestSplitOblivious()510 for (int idx = 0; idx < split_info.children_size(); idx += 2) { in FindBestSplitOblivious()782 CHECK(num_children >= split_info.children_size()) in SplitTreeLayer()784 << split_info.children_size(); in SplitTreeLayer()
384 int64 children_size() { return children_.size(); } in children_size() function529 DCHECK_LT(i, piece->children_size()); in piece()