148 	return he->has_children ? tree__folded_sign(he->unfolded) : ' ';  in hist_entry__folded()
153 	return cl->has_children ? tree__folded_sign(cl->unfolded) : ' ';  in callchain_list__folded()
158 	cl->unfolded = unfold ? cl->has_children : false;  in callchain_list__set_folding()
294 	if (!he->has_children)  in hist_entry__toggle_fold()
306 	if (!cl->has_children)  in callchain_list__toggle_fold()
325 				chain->has_children = chain->list.next != &child->val ||  in callchain_node__init_have_children_rb_tree()
328 				chain->has_children = chain->list.next == &child->val &&  in callchain_node__init_have_children_rb_tree()
342 	chain->has_children = has_sibling;  in callchain_node__init_have_children()
346 		chain->has_children = !RB_EMPTY_ROOT(&node->rb_root);  in callchain_node__init_have_children()
372 		he->has_children = !RB_EMPTY_ROOT(&he->sorted_chain);  in hist_entry__init_have_children()
375 		he->has_children = !RB_EMPTY_ROOT(&he->hroot_out);  in hist_entry__init_have_children()
386 	bool has_children;  in hist_browser__toggle_fold()  local
392 		has_children = hist_entry__toggle_fold(he);  in hist_browser__toggle_fold()
394 		has_children = callchain_list__toggle_fold(cl);  in hist_browser__toggle_fold()
396 	if (has_children) {  in hist_browser__toggle_fold()
457 		bool has_children = false;  in callchain_node__set_folding_rb_tree()  local
462 			has_children = chain->has_children;  in callchain_node__set_folding_rb_tree()
465 		if (has_children)  in callchain_node__set_folding_rb_tree()
475 	bool has_children = false;  in callchain_node__set_folding()  local
481 		has_children = chain->has_children;  in callchain_node__set_folding()
484 	if (has_children)  in callchain_node__set_folding()
525 	he->unfolded = unfold ? he->has_children : false;  in __hist_entry__set_folding()
527 	if (he->has_children) {  in __hist_entry__set_folding()