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()
134 				symlen += BITS_PER_LONG / 4 + 2 + 3;  in hists__calc_col_len()
140 			symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
157 			       + unresolved_col_width + 2;  in hists__calc_col_len()
163 			symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
172 			       + unresolved_col_width + 2;  in hists__calc_col_len()
176 			symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
186 			symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
191 				   unresolved_col_width + 4 + 2);  in hists__calc_col_len()
194 				   unresolved_col_width + 4 + 2);  in hists__calc_col_len()
197 		symlen = unresolved_col_width + 4 + 2;  in hists__calc_col_len()
218 	hists__new_col_len(hists, HISTC_ADDR, BITS_PER_LONG / 4 + 2);  in hists__calc_col_len()
2151 	struct rb_node *nd;  in hists__filter_by_type()  local
2158 	for (nd = rb_first_cached(&hists->entries); nd; nd = rb_next(nd)) {  in hists__filter_by_type()
2159 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hists__filter_by_type()
2175 	struct rb_node *nd;  in resort_filtered_entry()  local
2196 	nd = rb_first_cached(&he->hroot_out);  in resort_filtered_entry()
2197 	while (nd) {  in resort_filtered_entry()
2198 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in resort_filtered_entry()
2200 		nd = rb_next(nd);  in resort_filtered_entry()
2211 	struct rb_node *nd;  in hists__filter_hierarchy()  local
2219 	nd = rb_first_cached(&hists->entries);  in hists__filter_hierarchy()
2220 	while (nd) {  in hists__filter_hierarchy()
2221 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hists__filter_hierarchy()
2234 			nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_CHILD);  in hists__filter_hierarchy()
2237 		 * case 2. matched type (filter out)  in hists__filter_hierarchy()
2243 			nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING);  in hists__filter_hierarchy()
2253 			nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING);  in hists__filter_hierarchy()
2263 	nd = rb_first_cached(&hists->entries);  in hists__filter_hierarchy()
2264 	while (nd) {  in hists__filter_hierarchy()
2265 		struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);  in hists__filter_hierarchy()
2267 		nd = rb_next(nd);  in hists__filter_hierarchy()
2496 	struct rb_node *nd;  in hists__match_hierarchy()  local
2499 	for (nd = rb_first_cached(leader_root); nd; nd = rb_next(nd)) {  in hists__match_hierarchy()
2500 		pos  = rb_entry(nd, struct hist_entry, rb_node_in);  in hists__match_hierarchy()
2516 	struct rb_node *nd;  in hists__match()  local
2530 	for (nd = rb_first_cached(root); nd; nd = rb_next(nd)) {  in hists__match()
2531 		pos  = rb_entry(nd, struct hist_entry, rb_node_in);  in hists__match()
2544 	struct rb_node *nd;  in hists__link_hierarchy()  local
2547 	for (nd = rb_first_cached(other_root); nd; nd = rb_next(nd)) {  in hists__link_hierarchy()
2548 		pos = rb_entry(nd, struct hist_entry, rb_node_in);  in hists__link_hierarchy()
2591 	struct rb_node *nd;  in hists__link()  local
2606 	for (nd = rb_first_cached(root); nd; nd = rb_next(nd)) {  in hists__link()
2607 		pos = rb_entry(nd, struct hist_entry, rb_node_in);  in hists__link()
2623 	struct rb_node *nd;  in hists__unlink()  local
2631 	for (nd = rb_first_cached(root); nd; nd = rb_next(nd)) {  in hists__unlink()
2632 		pos = rb_entry(nd, struct hist_entry, rb_node_in);  in hists__unlink()