2373   TRP_RANGE **range_scans; /* array of ptrs to plans of intersected scans */  member in TRP_INDEX_INTERSECT
2389   for (TRP_RANGE **current= range_scans; current != range_scans_end;  in trace_basic_info()
2410   TRP_RANGE **range_scans; /* array of ptrs to plans of merged scans */  member in TRP_INDEX_MERGE
2423   for (TRP_RANGE **current= range_scans; current != range_scans_end; current++)  in trace_basic_info()
5111   TRP_RANGE **range_scans;  in get_best_disjunct_quick()  local
5150   if (!(range_scans= (TRP_RANGE**)alloc_root(param->mem_root,  in get_best_disjunct_quick()
5163   for (ptree= imerge->trees, cur_child= range_scans;  in get_best_disjunct_quick()
5230     roru_read_plans= (TABLE_READ_PLAN**)range_scans;  in get_best_disjunct_quick()
5301       imerge_trp->range_scans= range_scans;  in get_best_disjunct_quick()
5302       imerge_trp->range_scans_end= range_scans + n_child_scans;  in get_best_disjunct_quick()
5336   for (ptree= imerge->trees, cur_child= range_scans;  in get_best_disjunct_quick()
5467   for (tree= imerge->trees, cur_child= imerge_trp->range_scans;  in merge_same_index_scans()
6393   TRP_RANGE **range_scans;  in get_best_index_intersect()  local
6424   if (!(range_scans= (TRP_RANGE**)alloc_root(param->mem_root,  in get_best_index_intersect()
6429   for (i= 0, cur_range= range_scans; i < count; i++)  in get_best_index_intersect()
6469     intersect_trp->range_scans= range_scans;  in get_best_index_intersect()
7589   for (TRP_RANGE **range_scan= range_scans; range_scan != range_scans_end;  in make_quick()
7618   for (TRP_RANGE **range_scan= range_scans; range_scan != range_scans_end;  in make_quick()