@@ -203,8 +203,8 @@ void AddIfBlockToGraph(
203
203
auto cur_block_mapping = graph_and_mapping.second ;
204
204
std::unordered_map<torch::jit::Value*, torch::jit::Value*> block_graph_to_new_g;
205
205
for (auto & i : cur_block_mapping) {
206
- // for every pair in then_mapping, old_value => mini graph value, if old_value also appears in old_to_new_g, then it's
207
- // mini graph's input
206
+ // for every pair in then_mapping, old_value => mini graph value, if old_value also appears in old_to_new_g, then
207
+ // it's mini graph's input
208
208
if (old_to_new_g.count (i.first )) {
209
209
block_graph_to_new_g[i.second ] = old_to_new_g[i.first ];
210
210
}
@@ -317,8 +317,7 @@ torch::jit::script::Module CompileGraphWithFallback(const torch::jit::script::Mo
317
317
input_ranges.insert ({g->inputs ()[i], cfg.convert_info .input_ranges [i]});
318
318
}
319
319
auto input_ivalues_map = partitioning::generateRandomInputs (input_ranges);
320
- auto graph_and_mapping =
321
- ConstructFallbackGraph (new_mod, g->block (), input_ivalues_map, cfg, named_params);
320
+ auto graph_and_mapping = ConstructFallbackGraph (new_mod, g->block (), input_ivalues_map, cfg, named_params);
322
321
new_g = graph_and_mapping.first ;
323
322
LOG_INFO (*new_g << " (FallbackGraph)\n " );
324
323
0 commit comments