|
| 1 | +from graph_net.sample_pass.sample_pass import SamplePass |
| 2 | +from graph_net.sample_pass.resumable_sample_pass_mixin import ResumableSamplePassMixin |
| 3 | +from pathlib import Path |
| 4 | +import json |
| 5 | +from itertools import groupby |
| 6 | +from dataclasses import dataclass |
| 7 | + |
| 8 | + |
| 9 | +class FusibleSubgraphRangesGenerator(SamplePass, ResumableSamplePassMixin): |
| 10 | + def __init__(self, config): |
| 11 | + super().__init__(config) |
| 12 | + |
| 13 | + def declare_config( |
| 14 | + self, |
| 15 | + model_path_prefix: str, |
| 16 | + output_dir: str, |
| 17 | + input_json_file_name: str, |
| 18 | + resume: bool = False, |
| 19 | + limits_handled_models: int = None, |
| 20 | + output_json_file_name: str = "fusible_subgraph_ranges.json", |
| 21 | + ): |
| 22 | + pass |
| 23 | + |
| 24 | + def __call__(self, rel_model_path: str): |
| 25 | + self.resumable_handle_sample(rel_model_path) |
| 26 | + |
| 27 | + def sample_handled(self, rel_model_path: str) -> bool: |
| 28 | + file_name = self.config["output_json_file_name"] |
| 29 | + return self.naive_sample_handled(rel_model_path, search_file_name=file_name) |
| 30 | + |
| 31 | + def resume(self, rel_model_path: str): |
| 32 | + analyzer = self._make_analyzer(rel_model_path) |
| 33 | + output_obj = { |
| 34 | + "subgraph_ranges": analyzer.analyze(), |
| 35 | + } |
| 36 | + self._save_output(rel_model_path, output_obj) |
| 37 | + |
| 38 | + def _save_output(self, rel_model_path, output_obj): |
| 39 | + output_json = json.dumps(output_obj, indent=4) |
| 40 | + output_dir_path = Path(self.config["output_dir"]) / rel_model_path |
| 41 | + output_dir_path.mkdir(parents=True, exist_ok=True) |
| 42 | + output_file_path = output_dir_path / self.config["output_json_file_name"] |
| 43 | + output_file_path.write_text(output_json) |
| 44 | + |
| 45 | + def _make_analyzer(self, rel_model_path: str): |
| 46 | + model_path = ( |
| 47 | + Path(self.config["model_path_prefix"]) |
| 48 | + / rel_model_path |
| 49 | + / self.config["input_json_file_name"] |
| 50 | + ) |
| 51 | + json_ctx = self._make_json_ctx(model_path) |
| 52 | + return FusibleSubgraphRangesAnalyzer( |
| 53 | + num_subgraph_kernels_list=self._get_num_subgraph_kernels_list(json_ctx), |
| 54 | + num_subgraph_ops_list=self._get_num_subgraph_ops_list(json_ctx), |
| 55 | + start_offset_in_original_graph=self._get_start_offset_in_original_graph( |
| 56 | + json_ctx |
| 57 | + ), |
| 58 | + ) |
| 59 | + |
| 60 | + def _get_start_offset_in_original_graph(self, json_ctx): |
| 61 | + return json_ctx["start_offset_in_original_graph"] |
| 62 | + |
| 63 | + def _get_num_subgraph_kernels_list(self, json_ctx): |
| 64 | + return json_ctx["num_subgraph_kernels"] |
| 65 | + |
| 66 | + def _get_num_subgraph_ops_list(self, json_ctx): |
| 67 | + return json_ctx["num_subgraph_ops"] |
| 68 | + |
| 69 | + def _make_json_ctx(self, model_path: Path): |
| 70 | + obj = json.loads(model_path.read_text()) |
| 71 | + assert len(obj["num_subgraph_kernels"]) == len(obj["num_subgraph_ops"]) |
| 72 | + return obj |
| 73 | + |
| 74 | + |
| 75 | +class FusibleSubgraphRangesAnalyzer: |
| 76 | + def __init__( |
| 77 | + self, |
| 78 | + num_subgraph_kernels_list: list[int], |
| 79 | + num_subgraph_ops_list: list[int], |
| 80 | + start_offset_in_original_graph: int, |
| 81 | + ): |
| 82 | + assert len(num_subgraph_kernels_list) == len(num_subgraph_ops_list) |
| 83 | + self.num_subgraph_kernels_list = num_subgraph_kernels_list |
| 84 | + self.num_subgraph_ops_list = num_subgraph_ops_list |
| 85 | + self.start_offset_in_original_graph = start_offset_in_original_graph |
| 86 | + |
| 87 | + def analyze(self): |
| 88 | + analysis_ctx = self._make_analysis_ctx() |
| 89 | + num_kernels_and_num_ops_list = analysis_ctx.num_kernels_and_num_ops_list |
| 90 | + # The tail num_kernels equals the head num_kernels for each num_ops_list |
| 91 | + naive_proposal_fused_num_ops_lists = [ |
| 92 | + sorted(set(num_ops_list)) |
| 93 | + for _, num_ops_list in num_kernels_and_num_ops_list |
| 94 | + if len(set(num_ops_list)) > 1 |
| 95 | + ] |
| 96 | + proposal_fused_num_ops_lists = self._merge_all_decreasing_num_ops_lists( |
| 97 | + analysis_ctx, naive_proposal_fused_num_ops_lists |
| 98 | + ) |
| 99 | + return self._create_subgraph_ranges_from_proposal( |
| 100 | + analysis_ctx, |
| 101 | + proposal_fused_num_ops_lists, |
| 102 | + ) |
| 103 | + |
| 104 | + def _merge_all_decreasing_num_ops_lists(self, analysis_ctx, num_ops_lists): |
| 105 | + dead_loop_detect_cnt = 0 |
| 106 | + kLimit = 99999 |
| 107 | + while True: |
| 108 | + last_len_num_ops_lists = len(num_ops_lists) |
| 109 | + num_ops_lists = self._merge_one_decreasing_num_ops_lists( |
| 110 | + analysis_ctx, num_ops_lists |
| 111 | + ) |
| 112 | + assert last_len_num_ops_lists >= len(num_ops_lists) |
| 113 | + if last_len_num_ops_lists == len(num_ops_lists): |
| 114 | + break |
| 115 | + dead_loop_detect_cnt += 1 |
| 116 | + assert dead_loop_detect_cnt < kLimit, f"{dead_loop_detect_cnt=}" |
| 117 | + return num_ops_lists |
| 118 | + |
| 119 | + def _merge_one_decreasing_num_ops_lists(self, analysis_ctx, num_ops_lists): |
| 120 | + merge_pos = self._detect_mergable_decreasing_position( |
| 121 | + analysis_ctx, num_ops_lists |
| 122 | + ) |
| 123 | + if merge_pos is None: |
| 124 | + return num_ops_lists |
| 125 | + assert merge_pos >= 0 |
| 126 | + assert merge_pos < len(num_ops_lists) - 1 |
| 127 | + return [ |
| 128 | + *num_ops_lists[:merge_pos], |
| 129 | + [*num_ops_lists[merge_pos], *num_ops_lists[merge_pos + 1]], |
| 130 | + *num_ops_lists[merge_pos + 2 :], |
| 131 | + ] |
| 132 | + |
| 133 | + def _detect_mergable_decreasing_position(self, analysis_ctx, num_ops_lists): |
| 134 | + def get_cur_tail_num_kernels(i): |
| 135 | + return analysis_ctx.num_kernels4num_ops(num_ops_lists[i][-1]) |
| 136 | + |
| 137 | + def get_next_head_num_kernels(i): |
| 138 | + return analysis_ctx.num_kernels4num_ops(num_ops_lists[i + 1][0]) |
| 139 | + |
| 140 | + for i in range(len(num_ops_lists) - 1): |
| 141 | + assert len(num_ops_lists[i]) > 1 |
| 142 | + if get_cur_tail_num_kernels(i) >= get_next_head_num_kernels(i): |
| 143 | + return i |
| 144 | + return None |
| 145 | + |
| 146 | + def _create_subgraph_ranges_from_proposal( |
| 147 | + self, analysis_ctx, proposal_fused_num_ops_lists |
| 148 | + ): |
| 149 | + # filter valid num_ops_list |
| 150 | + |
| 151 | + def is_a_range(int_list): |
| 152 | + assert len(int_list) > 1 |
| 153 | + return (int_list[-1] + 1) - int_list[0] == len(int_list) |
| 154 | + |
| 155 | + def have_any_increasing(num_ops_list: list[int]): |
| 156 | + for i, cur_num_ops in enumerate(num_ops_list): |
| 157 | + if i == 0: |
| 158 | + continue |
| 159 | + cur_num_kernels = analysis_ctx.num_kernels4num_ops(cur_num_ops) |
| 160 | + last_num_kernels = analysis_ctx.num_kernels4num_ops(num_ops_list[i - 1]) |
| 161 | + if cur_num_kernels > last_num_kernels: |
| 162 | + return True |
| 163 | + return False |
| 164 | + |
| 165 | + def head_eq_tail(num_ops_list: list[int]): |
| 166 | + return analysis_ctx.num_kernels4num_ops( |
| 167 | + num_ops_list[0] |
| 168 | + ) == analysis_ctx.num_kernels4num_ops(num_ops_list[-1]) |
| 169 | + |
| 170 | + def head_gt_tail(num_ops_list: list[int]): |
| 171 | + return analysis_ctx.num_kernels4num_ops( |
| 172 | + num_ops_list[0] |
| 173 | + ) > analysis_ctx.num_kernels4num_ops(num_ops_list[-1]) |
| 174 | + |
| 175 | + def valid_fused_ops(num_ops_list: list[int]): |
| 176 | + if head_gt_tail(num_ops_list): |
| 177 | + return True |
| 178 | + if head_eq_tail(num_ops_list): |
| 179 | + return not have_any_increasing(num_ops_list) |
| 180 | + return False |
| 181 | + |
| 182 | + proposal_fused_num_ops_lists = [ |
| 183 | + sorted(set(num_ops_list)) for num_ops_list in proposal_fused_num_ops_lists |
| 184 | + ] |
| 185 | + num_ops_lists = [ |
| 186 | + num_ops_list |
| 187 | + for num_ops_list in proposal_fused_num_ops_lists |
| 188 | + if len(num_ops_list) > 1 |
| 189 | + if is_a_range(num_ops_list) |
| 190 | + if valid_fused_ops(num_ops_list) |
| 191 | + ] |
| 192 | + fusible_subgraph_ranges = [ |
| 193 | + (start, end) |
| 194 | + for num_ops_list in num_ops_lists |
| 195 | + for start in [num_ops_list[0] - 1] |
| 196 | + for end in [num_ops_list[-1]] |
| 197 | + ] |
| 198 | + |
| 199 | + # sorted by `start` |
| 200 | + def range_sort_key(pair): |
| 201 | + start, end = pair |
| 202 | + # smaller `start` first |
| 203 | + # bigger `end` first |
| 204 | + return (start, -end) |
| 205 | + |
| 206 | + fusible_subgraph_ranges = sorted(fusible_subgraph_ranges, key=range_sort_key) |
| 207 | + # remove shadowed |
| 208 | + fusible_subgraph_ranges = [ |
| 209 | + fusible_subgraph_ranges[i] |
| 210 | + for i in range(len(fusible_subgraph_ranges)) |
| 211 | + if i == 0 |
| 212 | + or (fusible_subgraph_ranges[i][0] >= fusible_subgraph_ranges[i - 1][1]) |
| 213 | + ] |
| 214 | + return fusible_subgraph_ranges |
| 215 | + |
| 216 | + def _make_analysis_ctx(self): |
| 217 | + return AnalysisContext( |
| 218 | + num_kernels_and_num_ops_list=self._make_num_kernels_and_num_ops_list(), |
| 219 | + num_ops2num_kernels=self._make_num_ops2num_kernels(), |
| 220 | + ) |
| 221 | + |
| 222 | + def _make_num_ops2num_kernels(self): |
| 223 | + return dict(zip(self.num_subgraph_ops_list, self.num_subgraph_kernels_list)) |
| 224 | + |
| 225 | + def _make_num_kernels_and_num_ops_list(self): |
| 226 | + num_kernels_and_num_ops = zip( |
| 227 | + self.num_subgraph_kernels_list, |
| 228 | + self.num_subgraph_ops_list, |
| 229 | + ) |
| 230 | + |
| 231 | + def get_num_kernels(pair): |
| 232 | + return pair[0] |
| 233 | + |
| 234 | + def get_num_ops(pair): |
| 235 | + return pair[1] |
| 236 | + |
| 237 | + num_kernels_and_num_ops = sorted(num_kernels_and_num_ops, key=get_num_ops) |
| 238 | + grouped_num_kernels_and_num_ops = groupby( |
| 239 | + num_kernels_and_num_ops, key=get_num_kernels |
| 240 | + ) |
| 241 | + num_kernels_and_num_ops_list = [ |
| 242 | + (num_kernels, [num_ops for _, num_ops in group]) |
| 243 | + for num_kernels, group in grouped_num_kernels_and_num_ops |
| 244 | + ] |
| 245 | + return num_kernels_and_num_ops_list |
| 246 | + |
| 247 | + |
| 248 | +@dataclass |
| 249 | +class AnalysisContext: |
| 250 | + num_kernels_and_num_ops_list: list[(int, list[int])] |
| 251 | + num_ops2num_kernels: dict[int, int] |
| 252 | + |
| 253 | + def num_kernels4num_ops(self, num_ops: int): |
| 254 | + return self.num_ops2num_kernels[num_ops] |
0 commit comments