94 	 * +2 accounts for 0x prefix on raw addresses  in hists__calc_col_len()
100 			symlen += BITS_PER_LONG / 4 + 2 + 3;  in hists__calc_col_len()
103 		symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
124 				symlen += BITS_PER_LONG / 4 + 2 + 3;  in hists__calc_col_len()
130 			symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
139 				symlen += BITS_PER_LONG / 4 + 2 + 3;  in hists__calc_col_len()
145 			symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
162 			       + unresolved_col_width + 2;  in hists__calc_col_len()
168 			symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
177 			       + unresolved_col_width + 2;  in hists__calc_col_len()
181 			symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
191 			symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
196 				   unresolved_col_width + 4 + 2);  in hists__calc_col_len()
199 				   unresolved_col_width + 4 + 2);  in hists__calc_col_len()
202 		symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
223 	hists__new_col_len(hists, HISTC_ADDR, BITS_PER_LONG / 4 + 2);  in hists__calc_col_len()
2202 	struct rb_node *nd;  in hists__filter_by_type()  local
2209 	for (nd = rb_first_cached(&hists->entries); nd; nd = rb_next(nd)) {  in hists__filter_by_type()
2210 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hists__filter_by_type()
2226 	struct rb_node *nd;  in resort_filtered_entry()  local
2247 	nd = rb_first_cached(&he->hroot_out);  in resort_filtered_entry()
2248 	while (nd) {  in resort_filtered_entry()
2249 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in resort_filtered_entry()
2251 		nd = rb_next(nd);  in resort_filtered_entry()
2262 	struct rb_node *nd;  in hists__filter_hierarchy()  local
2270 	nd = rb_first_cached(&hists->entries);  in hists__filter_hierarchy()
2271 	while (nd) {  in hists__filter_hierarchy()
2272 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hists__filter_hierarchy()
2285 			nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_CHILD);  in hists__filter_hierarchy()
2288 		 * case 2. matched type (filter out)  in hists__filter_hierarchy()
2294 			nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING);  in hists__filter_hierarchy()
2304 			nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING);  in hists__filter_hierarchy()
2314 	nd = rb_first_cached(&hists->entries);  in hists__filter_hierarchy()
2315 	while (nd) {  in hists__filter_hierarchy()
2316 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hists__filter_hierarchy()
2318 		nd = rb_next(nd);  in hists__filter_hierarchy()
2540 	struct rb_node *nd;  in hists__match_hierarchy()  local
2543 	for (nd = rb_first_cached(leader_root); nd; nd = rb_next(nd)) {  in hists__match_hierarchy()
2544 		pos  = rb_entry(nd, struct hist_entry, rb_node_in);  in hists__match_hierarchy()
2560 	struct rb_node *nd;  in hists__match()  local
2574 	for (nd = rb_first_cached(root); nd; nd = rb_next(nd)) {  in hists__match()
2575 		pos  = rb_entry(nd, struct hist_entry, rb_node_in);  in hists__match()
2588 	struct rb_node *nd;  in hists__link_hierarchy()  local
2591 	for (nd = rb_first_cached(other_root); nd; nd = rb_next(nd)) {  in hists__link_hierarchy()
2592 		pos = rb_entry(nd, struct hist_entry, rb_node_in);  in hists__link_hierarchy()
2635 	struct rb_node *nd;  in hists__link()  local
2650 	for (nd = rb_first_cached(root); nd; nd = rb_next(nd)) {  in hists__link()
2651 		pos = rb_entry(nd, struct hist_entry, rb_node_in);  in hists__link()
2667 	struct rb_node *nd;  in hists__unlink()  local
2675 	for (nd = rb_first_cached(root); nd; nd = rb_next(nd)) {  in hists__unlink()
2676 		pos = rb_entry(nd, struct hist_entry, rb_node_in);  in hists__unlink()