Home
last modified time | relevance | path

Searched refs:nextRef (Results 1 – 3 of 3) sorted by relevance

/system/tools/hidl/
DAST.cpp195 for (auto* nextRef : type->getReferences()) { in lookupTypes() local
196 if (nextRef->isResolved()) { in lookupTypes()
200 Type* nextType = lookupType(nextRef->getLookupFqName(), scope); in lookupTypes()
203 << nextRef->getLookupFqName().string() << "' at " in lookupTypes()
204 << nextRef->location() << "\n"; in lookupTypes()
207 nextRef->set(nextType); in lookupTypes()
220 for (auto* nextRef : type->getReferences()) { in gatherReferencedTypes() local
221 const Type *targetType = nextRef->get(); in gatherReferencedTypes()
245 for (auto* nextRef : ce->getReferences()) { in lookupConstantExpressions() local
246 if (nextRef->isResolved()) continue; in lookupConstantExpressions()
[all …]
DType.cpp173 for (auto* nextRef : getReferences()) { in recursivePass() local
174 err = nextRef->shallowGet()->recursivePass(stage, func, visited); in recursivePass()
197 for (const auto* nextRef : getReferences()) { in recursivePass() local
198 err = nextRef->shallowGet()->recursivePass(stage, func, visited); in recursivePass()
248 for (const auto* nextRef : getStrongReferences()) { in topologicalOrder() local
249 const auto* nextType = nextRef->shallowGet(); in topologicalOrder()
256 << nextRef->location() << "\n"; in topologicalOrder()
DConstantExpression.cpp568 for (auto* nextRef : getReferences()) { in recursivePass() local
569 auto* nextCE = nextRef->shallowGet()->constExpr(); in recursivePass()
601 for (const auto* nextRef : getReferences()) { in recursivePass() local
602 const auto* nextCE = nextRef->shallowGet()->constExpr(); in recursivePass()
647 for (const auto* nextRef : getReferences()) { in checkAcyclic() local
648 const auto* nextCE = nextRef->shallowGet()->constExpr(); in checkAcyclic()
661 << nextRef->location() << "\n"; in checkAcyclic()