| 50 | }; |
| 51 | |
| 52 | void ModuleGraph::UpdateParentsAs( |
| 53 | Module *task, Module *module, |
| 54 | std::unordered_set<Module *> &visited_modules) { |
| 55 | visited_modules.insert(module); |
| 56 | |
| 57 | if (module->is_task()) { |
| 58 | module->AddParentTask(task); |
| 59 | return; |
| 60 | } else { |
| 61 | std::vector<bess::OGate *> ogates = module->ogates(); |
| 62 | for (size_t i = 0; i < ogates.size(); i++) { |
| 63 | if (!ogates[i]) { |
| 64 | continue; |
| 65 | } |
| 66 | Module *child = ogates[i]->igate()->module(); |
| 67 | if (visited_modules.count(child) != 0) { |
| 68 | continue; |
| 69 | } |
| 70 | UpdateParentsAs(task, child, visited_modules); |
| 71 | } |
| 72 | } |
| 73 | } |
| 74 | |
| 75 | void ModuleGraph::UpdateSingleTaskGraph(Module *task_module) { |
| 76 | std::unordered_set<Module *> visited_modules; |
nothing calls this directly
no test coverage detected