90 	 * +2 accounts for 0x prefix on raw addresses  in hists__calc_col_len()
96 			symlen += BITS_PER_LONG / 4 + 2 + 3;  in hists__calc_col_len()
99 		symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
120 				symlen += BITS_PER_LONG / 4 + 2 + 3;  in hists__calc_col_len()
126 			symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
135 				symlen += BITS_PER_LONG / 4 + 2 + 3;  in hists__calc_col_len()
141 			symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
158 			       + unresolved_col_width + 2;  in hists__calc_col_len()
164 			symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
173 			       + unresolved_col_width + 2;  in hists__calc_col_len()
177 			symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
187 			symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
192 				   unresolved_col_width + 4 + 2);  in hists__calc_col_len()
195 				   unresolved_col_width + 4 + 2);  in hists__calc_col_len()
198 		symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
219 	hists__new_col_len(hists, HISTC_ADDR, BITS_PER_LONG / 4 + 2);  in hists__calc_col_len()
2180 	struct rb_node *nd;  in hists__filter_by_type()  local
2187 	for (nd = rb_first_cached(&hists->entries); nd; nd = rb_next(nd)) {  in hists__filter_by_type()
2188 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hists__filter_by_type()
2204 	struct rb_node *nd;  in resort_filtered_entry()  local
2225 	nd = rb_first_cached(&he->hroot_out);  in resort_filtered_entry()
2226 	while (nd) {  in resort_filtered_entry()
2227 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in resort_filtered_entry()
2229 		nd = rb_next(nd);  in resort_filtered_entry()
2240 	struct rb_node *nd;  in hists__filter_hierarchy()  local
2248 	nd = rb_first_cached(&hists->entries);  in hists__filter_hierarchy()
2249 	while (nd) {  in hists__filter_hierarchy()
2250 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hists__filter_hierarchy()
2263 			nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_CHILD);  in hists__filter_hierarchy()
2266 		 * case 2. matched type (filter out)  in hists__filter_hierarchy()
2272 			nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING);  in hists__filter_hierarchy()
2282 			nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING);  in hists__filter_hierarchy()
2292 	nd = rb_first_cached(&hists->entries);  in hists__filter_hierarchy()
2293 	while (nd) {  in hists__filter_hierarchy()
2294 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hists__filter_hierarchy()
2296 		nd = rb_next(nd);  in hists__filter_hierarchy()
2525 	struct rb_node *nd;  in hists__match_hierarchy()  local
2528 	for (nd = rb_first_cached(leader_root); nd; nd = rb_next(nd)) {  in hists__match_hierarchy()
2529 		pos  = rb_entry(nd, struct hist_entry, rb_node_in);  in hists__match_hierarchy()
2545 	struct rb_node *nd;  in hists__match()  local
2559 	for (nd = rb_first_cached(root); nd; nd = rb_next(nd)) {  in hists__match()
2560 		pos  = rb_entry(nd, struct hist_entry, rb_node_in);  in hists__match()
2573 	struct rb_node *nd;  in hists__link_hierarchy()  local
2576 	for (nd = rb_first_cached(other_root); nd; nd = rb_next(nd)) {  in hists__link_hierarchy()
2577 		pos = rb_entry(nd, struct hist_entry, rb_node_in);  in hists__link_hierarchy()
2620 	struct rb_node *nd;  in hists__link()  local
2635 	for (nd = rb_first_cached(root); nd; nd = rb_next(nd)) {  in hists__link()
2636 		pos = rb_entry(nd, struct hist_entry, rb_node_in);  in hists__link()
2652 	struct rb_node *nd;  in hists__unlink()  local
2660 	for (nd = rb_first_cached(root); nd; nd = rb_next(nd)) {  in hists__unlink()
2661 		pos = rb_entry(nd, struct hist_entry, rb_node_in);  in hists__unlink()