89 	 * +2 accounts for 0x prefix on raw addresses  in hists__calc_col_len()
95 			symlen += BITS_PER_LONG / 4 + 2 + 3;  in hists__calc_col_len()
98 		symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
119 				symlen += BITS_PER_LONG / 4 + 2 + 3;  in hists__calc_col_len()
125 			symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
133 				symlen += BITS_PER_LONG / 4 + 2 + 3;  in hists__calc_col_len()
139 			symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
155 			       + unresolved_col_width + 2;  in hists__calc_col_len()
161 			symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
170 			       + unresolved_col_width + 2;  in hists__calc_col_len()
174 			symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
184 			symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
189 				   unresolved_col_width + 4 + 2);  in hists__calc_col_len()
192 		symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
2140 	struct rb_node *nd;  in hists__filter_by_type()  local
2147 	for (nd = rb_first_cached(&hists->entries); nd; nd = rb_next(nd)) {  in hists__filter_by_type()
2148 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hists__filter_by_type()
2164 	struct rb_node *nd;  in resort_filtered_entry()  local
2185 	nd = rb_first_cached(&he->hroot_out);  in resort_filtered_entry()
2186 	while (nd) {  in resort_filtered_entry()
2187 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in resort_filtered_entry()
2189 		nd = rb_next(nd);  in resort_filtered_entry()
2200 	struct rb_node *nd;  in hists__filter_hierarchy()  local
2208 	nd = rb_first_cached(&hists->entries);  in hists__filter_hierarchy()
2209 	while (nd) {  in hists__filter_hierarchy()
2210 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hists__filter_hierarchy()
2223 			nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_CHILD);  in hists__filter_hierarchy()
2226 		 * case 2. matched type (filter out)  in hists__filter_hierarchy()
2232 			nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING);  in hists__filter_hierarchy()
2242 			nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING);  in hists__filter_hierarchy()
2252 	nd = rb_first_cached(&hists->entries);  in hists__filter_hierarchy()
2253 	while (nd) {  in hists__filter_hierarchy()
2254 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hists__filter_hierarchy()
2256 		nd = rb_next(nd);  in hists__filter_hierarchy()
2475 	struct rb_node *nd;  in hists__match_hierarchy()  local
2478 	for (nd = rb_first_cached(leader_root); nd; nd = rb_next(nd)) {  in hists__match_hierarchy()
2479 		pos  = rb_entry(nd, struct hist_entry, rb_node_in);  in hists__match_hierarchy()
2495 	struct rb_node *nd;  in hists__match()  local
2509 	for (nd = rb_first_cached(root); nd; nd = rb_next(nd)) {  in hists__match()
2510 		pos  = rb_entry(nd, struct hist_entry, rb_node_in);  in hists__match()
2523 	struct rb_node *nd;  in hists__link_hierarchy()  local
2526 	for (nd = rb_first_cached(other_root); nd; nd = rb_next(nd)) {  in hists__link_hierarchy()
2527 		pos = rb_entry(nd, struct hist_entry, rb_node_in);  in hists__link_hierarchy()
2570 	struct rb_node *nd;  in hists__link()  local
2585 	for (nd = rb_first_cached(root); nd; nd = rb_next(nd)) {  in hists__link()
2586 		pos = rb_entry(nd, struct hist_entry, rb_node_in);  in hists__link()
2602 	struct rb_node *nd;  in hists__unlink()  local
2610 	for (nd = rb_first_cached(root); nd; nd = rb_next(nd)) {  in hists__unlink()
2611 		pos = rb_entry(nd, struct hist_entry, rb_node_in);  in hists__unlink()