96 	 * +2 accounts for 0x prefix on raw addresses  in hists__calc_col_len()
102 			symlen += BITS_PER_LONG / 4 + 2 + 3;  in hists__calc_col_len()
105 		symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
126 				symlen += BITS_PER_LONG / 4 + 2 + 3;  in hists__calc_col_len()
132 			symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
141 				symlen += BITS_PER_LONG / 4 + 2 + 3;  in hists__calc_col_len()
147 			symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
164 			       + unresolved_col_width + 2;  in hists__calc_col_len()
170 			symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
179 			       + unresolved_col_width + 2;  in hists__calc_col_len()
183 			symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
193 			symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
198 				   unresolved_col_width + 4 + 2);  in hists__calc_col_len()
201 				   unresolved_col_width + 4 + 2);  in hists__calc_col_len()
204 		symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
226 	hists__new_col_len(hists, HISTC_ADDR, BITS_PER_LONG / 4 + 2);  in hists__calc_col_len()
2259 	struct rb_node *nd;  in hists__filter_by_type()  local
2266 	for (nd = rb_first_cached(&hists->entries); nd; nd = rb_next(nd)) {  in hists__filter_by_type()
2267 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hists__filter_by_type()
2283 	struct rb_node *nd;  in resort_filtered_entry()  local
2304 	nd = rb_first_cached(&he->hroot_out);  in resort_filtered_entry()
2305 	while (nd) {  in resort_filtered_entry()
2306 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in resort_filtered_entry()
2308 		nd = rb_next(nd);  in resort_filtered_entry()
2319 	struct rb_node *nd;  in hists__filter_hierarchy()  local
2327 	nd = rb_first_cached(&hists->entries);  in hists__filter_hierarchy()
2328 	while (nd) {  in hists__filter_hierarchy()
2329 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hists__filter_hierarchy()
2342 			nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_CHILD);  in hists__filter_hierarchy()
2345 		 * case 2. matched type (filter out)  in hists__filter_hierarchy()
2351 			nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING);  in hists__filter_hierarchy()
2361 			nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING);  in hists__filter_hierarchy()
2371 	nd = rb_first_cached(&hists->entries);  in hists__filter_hierarchy()
2372 	while (nd) {  in hists__filter_hierarchy()
2373 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hists__filter_hierarchy()
2375 		nd = rb_next(nd);  in hists__filter_hierarchy()
2607 	struct rb_node *nd;  in hists__match_hierarchy()  local
2610 	for (nd = rb_first_cached(leader_root); nd; nd = rb_next(nd)) {  in hists__match_hierarchy()
2611 		pos  = rb_entry(nd, struct hist_entry, rb_node_in);  in hists__match_hierarchy()
2627 	struct rb_node *nd;  in hists__match()  local
2641 	for (nd = rb_first_cached(root); nd; nd = rb_next(nd)) {  in hists__match()
2642 		pos  = rb_entry(nd, struct hist_entry, rb_node_in);  in hists__match()
2655 	struct rb_node *nd;  in hists__link_hierarchy()  local
2658 	for (nd = rb_first_cached(other_root); nd; nd = rb_next(nd)) {  in hists__link_hierarchy()
2659 		pos = rb_entry(nd, struct hist_entry, rb_node_in);  in hists__link_hierarchy()
2702 	struct rb_node *nd;  in hists__link()  local
2717 	for (nd = rb_first_cached(root); nd; nd = rb_next(nd)) {  in hists__link()
2718 		pos = rb_entry(nd, struct hist_entry, rb_node_in);  in hists__link()
2734 	struct rb_node *nd;  in hists__unlink()  local
2742 	for (nd = rb_first_cached(root); nd; nd = rb_next(nd)) {  in hists__unlink()
2743 		pos = rb_entry(nd, struct hist_entry, rb_node_in);  in hists__unlink()