143 	return he->has_children ? tree__folded_sign(he->unfolded) : ' ';  in hist_entry__folded()
148 	return cl->has_children ? tree__folded_sign(cl->unfolded) : ' ';  in callchain_list__folded()
153 	cl->unfolded = unfold ? cl->has_children : false;  in callchain_list__set_folding()
216 	if (!he->has_children)  in hist_entry__toggle_fold()
228 	if (!cl->has_children)  in callchain_list__toggle_fold()
247 				chain->has_children = chain->list.next != &child->val ||  in callchain_node__init_have_children_rb_tree()
250 				chain->has_children = chain->list.next == &child->val &&  in callchain_node__init_have_children_rb_tree()
264 	chain->has_children = has_sibling;  in callchain_node__init_have_children()
268 		chain->has_children = !RB_EMPTY_ROOT(&node->rb_root);  in callchain_node__init_have_children()
288 		he->has_children = !RB_EMPTY_ROOT(&he->sorted_chain);  in hist_entry__init_have_children()
299 	bool has_children;  in hist_browser__toggle_fold()  local
305 		has_children = hist_entry__toggle_fold(he);  in hist_browser__toggle_fold()
307 		has_children = callchain_list__toggle_fold(cl);  in hist_browser__toggle_fold()
309 	if (has_children) {  in hist_browser__toggle_fold()
337 		bool has_children = false;  in callchain_node__set_folding_rb_tree()  local
342 			has_children = chain->has_children;  in callchain_node__set_folding_rb_tree()
345 		if (has_children)  in callchain_node__set_folding_rb_tree()
355 	bool has_children = false;  in callchain_node__set_folding()  local
361 		has_children = chain->has_children;  in callchain_node__set_folding()
364 	if (has_children)  in callchain_node__set_folding()
386 	he->unfolded = unfold ? he->has_children : false;  in hist_entry__set_folding()
388 	if (he->has_children) {  in hist_entry__set_folding()