| 199 | hashmap<int, vector<MountInfoTable::Entry>> parentToChildren; |
| 200 | |
| 201 | foreach (const MountInfoTable::Entry& entry, table.entries) { |
| 202 | if (entry.target == "/") { |
| 203 | CHECK_NONE(rootParentId); |
| 204 | rootParentId = entry.parent; |
| 205 | } |
| 206 | parentToChildren[entry.parent].push_back(entry); |
| 207 | } |
| 208 | |
| 209 | // Walk the hashmap and construct a list of entries sorted |
| 210 | // hierarchically. The recursion eventually terminates because |
nothing calls this directly
no test coverage detected