| 349 | } |
| 350 | |
| 351 | static std::unordered_map<std::string, instruction_ref> |
| 352 | parse_inputs(const onnx_parser& parser, |
| 353 | module* mod, |
| 354 | const onnx::GraphProto& graph, |
| 355 | std::unordered_map<std::string, instruction_ref> mod_insts) |
| 356 | { |
| 357 | for(auto&& input : graph.input()) |
| 358 | { |
| 359 | const std::string& name = input.name(); |
| 360 | // input not in initializer_data, so it is a real input |
| 361 | if(not contains(mod_insts, name)) |
| 362 | { |
| 363 | if(contains(parser.instructions, name)) |
| 364 | { |
| 365 | MIGRAPHX_THROW("module \"" + mod->name() + "\" has parameter name \"" + name + |
| 366 | "\" existing in parent graph!"); |
| 367 | } |
| 368 | |
| 369 | shape s; |
| 370 | if(parser.map_input_dims.count(name) > 0) |
| 371 | { |
| 372 | std::vector<std::size_t> dims = parser.map_input_dims.at(name); |
| 373 | s = parser.parse_type(input.type(), dims); |
| 374 | } |
| 375 | else if(parser.map_dyn_input_dims.count(name) > 0) |
| 376 | { |
| 377 | shape::type_t shape_type = get_type(input.type().tensor_type().elem_type()); |
| 378 | s = shape_from_dyn_dims(shape_type, parser.map_dyn_input_dims.at(name)); |
| 379 | } |
| 380 | else |
| 381 | { |
| 382 | s = parser.parse_type(input.type()); |
| 383 | } |
| 384 | mod_insts[name] = mod->add_parameter(name, s); |
| 385 | } |
| 386 | } |
| 387 | return mod_insts; |
| 388 | } |
| 389 | |
| 390 | struct node_maps |
| 391 | { |
no test coverage detected