141 	return ms->has_children ? tree__folded_sign(ms->unfolded) : ' ';  in map_symbol__folded()
156 	ms->unfolded = unfold ? ms->has_children : false;  in map_symbol__set_folding()
219 	if (!ms->has_children)  in map_symbol__toggle_fold()
238 				chain->ms.has_children = chain->list.next != &child->val ||  in callchain_node__init_have_children_rb_tree()
241 				chain->ms.has_children = chain->list.next == &child->val &&  in callchain_node__init_have_children_rb_tree()
255 	chain->ms.has_children = has_sibling;  in callchain_node__init_have_children()
259 		chain->ms.has_children = !RB_EMPTY_ROOT(&node->rb_root);  in callchain_node__init_have_children()
279 		he->ms.has_children = !RB_EMPTY_ROOT(&he->sorted_chain);  in hist_entry__init_have_children()
317 		bool has_children = false;  in callchain_node__set_folding_rb_tree()  local
322 			has_children = chain->ms.has_children;  in callchain_node__set_folding_rb_tree()
325 		if (has_children)  in callchain_node__set_folding_rb_tree()
335 	bool has_children = false;  in callchain_node__set_folding()  local
341 		has_children = chain->ms.has_children;  in callchain_node__set_folding()
344 	if (has_children)  in callchain_node__set_folding()
368 	if (he->ms.has_children) {  in hist_entry__set_folding()