Searched refs:reversedOrder (Results 1 – 5 of 5) sorted by relevance
| /system/tools/hidl/ |
| D | Type.cpp | 221 std::unordered_map<const Type*, size_t>* reversedOrder, in topologicalOrder() argument
228 if (reversedOrder->find(this) != reversedOrder->end()) return CheckAcyclicStatus(OK); in topologicalOrder()
232 auto err = nextType->topologicalOrder(reversedOrder, stack); in topologicalOrder()
252 auto err = nextType->topologicalOrder(reversedOrder, stack); in topologicalOrder()
270 CHECK(reversedOrder->find(this) == reversedOrder->end()); in topologicalOrder()
273 size_t index = reversedOrder->size(); in topologicalOrder()
274 reversedOrder->insert({this, index}); in topologicalOrder()
|
| D | Scope.cpp | 134 void Scope::topologicalReorder(const std::unordered_map<const Type*, size_t>& reversedOrder) { in topologicalReorder() argument
136 return reversedOrder.at(lhs) < reversedOrder.at(rhs); in topologicalReorder()
|
| D | Scope.h | 64 void topologicalReorder(const std::unordered_map<const Type*, size_t>& reversedOrder);
|
| D | AST.cpp | 261 std::unordered_map<const Type*, size_t> reversedOrder; in topologicalReorder() local
263 status_t err = mRootScope.topologicalOrder(&reversedOrder, &stack).status; in topologicalReorder()
270 static_cast<Scope*>(type)->topologicalReorder(reversedOrder); in topologicalReorder()
|
| D | Type.h | 113 CheckAcyclicStatus topologicalOrder(std::unordered_map<const Type*, size_t>* reversedOrder,
|