| /system/tools/hidl/lint/lints/ |
| D | safeunion.cpp | 34 static void lintUnionRecursively(const Scope* scope, std::unordered_set<const Type*>* visited, in lintUnionRecursively() argument
39 if (visited->find(scope) != visited->end()) return; in lintUnionRecursively()
40 visited->insert(scope); in lintUnionRecursively()
48 lintUnionRecursively(static_cast<const Scope*>(nextType), visited, errors); in lintUnionRecursively()
62 lintUnionRecursively(compoundType, visited, errors); in lintUnionRecursively()
98 visited); in lintUnionRecursively()
113 std::unordered_set<const Type*> visited; in safeunionLint() local
115 lintUnionRecursively(&ast.getRootScope(), &visited, errors); in safeunionLint()
|
| D | emptyStructs.cpp | 30 std::unordered_set<const Type*> visited; in checkSmallStructs() local
58 &visited); in checkSmallStructs()
|
| D | enumMaxAndAll.cpp | 34 std::unordered_set<const Type*> visited; in enumValueNames() local
68 &visited); in enumValueNames()
|
| D | namingConventions.cpp | 34 std::unordered_set<const Type*> visited; in namingConventions() local
92 &visited); in namingConventions()
|
| /system/tools/hidl/ |
| D | Type.cpp | 164 std::unordered_set<const Type*>* visited) { in recursivePass() argument
168 if (visited->find(this) != visited->end()) return OK; in recursivePass()
169 visited->insert(this); in recursivePass()
175 err = nextType->recursivePass(stage, func, visited); in recursivePass()
180 err = nextRef->shallowGet()->recursivePass(stage, func, visited); in recursivePass()
188 std::unordered_set<const Type*>* visited) const { in recursivePass()
192 if (visited->find(this) != visited->end()) return OK; in recursivePass()
193 visited->insert(this); in recursivePass()
199 err = nextType->recursivePass(stage, func, visited); in recursivePass()
204 err = nextRef->shallowGet()->recursivePass(stage, func, visited); in recursivePass()
[all …]
|
| D | generateDependencies.cpp | 30 std::unordered_set<const Type*> visited; in generateDependencies() local
39 &visited); in generateDependencies()
|
| D | Type.h | 98 std::unordered_set<const Type*>* visited);
100 std::unordered_set<const Type*>* visited) const;
141 bool canCheckEquality(std::unordered_set<const Type*>* visited) const;
142 virtual bool deepCanCheckEquality(std::unordered_set<const Type*>* visited) const;
304 bool isJavaCompatible(std::unordered_set<const Type*>* visited) const;
305 virtual bool deepIsJavaCompatible(std::unordered_set<const Type*>* visited) const;
309 bool containsPointer(std::unordered_set<const Type*>* visited) const;
310 virtual bool deepContainsPointer(std::unordered_set<const Type*>* visited) const;
|
| D | ConstantExpression.cpp | 559 std::unordered_set<const ConstantExpression*>* visited, in recursivePass() argument
563 if (visited->find(this) != visited->end()) return OK; in recursivePass()
564 visited->insert(this); in recursivePass()
572 status_t err = nextCE->recursivePass(func, visited, processBeforeDependencies); in recursivePass()
579 status_t err = nextCE->recursivePass(func, visited, processBeforeDependencies); in recursivePass()
593 std::unordered_set<const ConstantExpression*>* visited, bool processBeforeDependencies) const { in recursivePass() argument
596 if (visited->find(this) != visited->end()) return OK; in recursivePass()
597 visited->insert(this); in recursivePass()
605 status_t err = nextCE->recursivePass(func, visited, processBeforeDependencies); in recursivePass()
612 status_t err = nextCE->recursivePass(func, visited, processBeforeDependencies); in recursivePass()
[all …]
|
| D | AST.cpp | 191 std::unordered_set<const Type*> visited; in setParseStage() local
198 &visited); in setParseStage()
202 std::unordered_set<const Type*> visited; in lookupTypes() local
226 &visited); in lookupTypes()
230 std::unordered_set<const Type*> visited; in gatherReferencedTypes() local
244 &visited); in gatherReferencedTypes()
290 std::unordered_set<const Type*> visited; in validateDefinedTypesUniqueNames() local
300 &visited); in validateDefinedTypesUniqueNames()
304 std::unordered_set<const Type*> visited; in resolveInheritance() local
306 &visited); in resolveInheritance()
[all …]
|
| D | VectorType.cpp | 81 bool VectorType::deepCanCheckEquality(std::unordered_set<const Type*>* visited) const { in deepCanCheckEquality()
82 return mElementType->canCheckEquality(visited); in deepCanCheckEquality()
617 bool VectorType::deepIsJavaCompatible(std::unordered_set<const Type*>* visited) const { in deepIsJavaCompatible()
618 if (!mElementType->isJavaCompatible(visited)) { in deepIsJavaCompatible()
638 return TemplatedType::deepIsJavaCompatible(visited); in deepIsJavaCompatible()
641 bool VectorType::deepContainsPointer(std::unordered_set<const Type*>* visited) const { in deepContainsPointer()
642 if (mElementType->containsPointer(visited)) { in deepContainsPointer()
645 return TemplatedType::deepContainsPointer(visited); in deepContainsPointer()
|
| D | ArrayType.cpp | 47 bool ArrayType::deepCanCheckEquality(std::unordered_set<const Type*>* visited) const { in deepCanCheckEquality()
48 return mElementType->canCheckEquality(visited); in deepCanCheckEquality()
517 bool ArrayType::deepIsJavaCompatible(std::unordered_set<const Type*>* visited) const { in deepIsJavaCompatible()
518 if (!mElementType->isJavaCompatible(visited)) { in deepIsJavaCompatible()
521 return Type::deepIsJavaCompatible(visited); in deepIsJavaCompatible()
524 bool ArrayType::deepContainsPointer(std::unordered_set<const Type*>* visited) const { in deepContainsPointer()
525 if (mElementType->containsPointer(visited)) { in deepContainsPointer()
528 return Type::deepContainsPointer(visited); in deepContainsPointer()
|
| D | PointerType.h | 64 bool deepIsJavaCompatible(std::unordered_set<const Type*>* visited) const override;
65 bool deepContainsPointer(std::unordered_set<const Type*>* visited) const override;
|
| D | VectorType.h | 39 bool deepCanCheckEquality(std::unordered_set<const Type*>* visited) const override;
106 bool deepIsJavaCompatible(std::unordered_set<const Type*>* visited) const override;
107 bool deepContainsPointer(std::unordered_set<const Type*>* visited) const override;
|
| D | ArrayType.h | 34 bool deepCanCheckEquality(std::unordered_set<const Type*>* visited) const override;
113 bool deepIsJavaCompatible(std::unordered_set<const Type*>* visited) const override;
114 bool deepContainsPointer(std::unordered_set<const Type*>* visited) const override;
|
| D | CompoundType.h | 46 bool deepCanCheckEquality(std::unordered_set<const Type*>* visited) const override;
122 bool deepIsJavaCompatible(std::unordered_set<const Type*>* visited) const override;
123 bool deepContainsPointer(std::unordered_set<const Type*>* visited) const override;
|
| D | ConstantExpression.h | 60 std::unordered_set<const ConstantExpression*>* visited,
63 std::unordered_set<const ConstantExpression*>* visited,
100 CheckAcyclicStatus checkAcyclic(std::unordered_set<const ConstantExpression*>* visited,
|
| D | Scope.cpp | 244 bool Scope::deepIsJavaCompatible(std::unordered_set<const Type*>* visited) const { in deepIsJavaCompatible()
249 if (type->isInterface() && !type->isJavaCompatible(visited)) { in deepIsJavaCompatible()
254 return Type::deepIsJavaCompatible(visited); in deepIsJavaCompatible()
|
| D | Method.cpp | 300 bool Method::deepIsJavaCompatible(std::unordered_set<const Type*>* visited) const { in deepIsJavaCompatible()
302 [&](const auto* arg) { return (*arg)->isJavaCompatible(visited); })) { in deepIsJavaCompatible()
307 [&](const auto* arg) { return (*arg)->isJavaCompatible(visited); })) { in deepIsJavaCompatible()
|
| D | FmqType.h | 61 bool deepIsJavaCompatible(std::unordered_set<const Type*>* visited) const override;
|
| D | HandleType.h | 80 bool deepIsJavaCompatible(std::unordered_set<const Type*>* visited) const override;
|
| D | StringType.h | 30 bool deepCanCheckEquality(std::unordered_set<const Type*>* visited) const override;
|
| /system/update_engine/payload_generator/ |
| D | cow_size_estimator.cc | 66 ExtentRanges visited; in CowDryRun() local
91 visited.AddExtent(ext); in CowDryRun()
119 visited.AddExtent(ext); in CowDryRun()
142 visited.AddExtent(ext); in CowDryRun()
150 visited.AddExtent(ext); in CowDryRun()
168 FilterExtentRanges({ExtentForRange(0, last_block)}, visited); in CowDryRun()
|
| D | merge_sequence_generator.cc | 460 ExtentRanges visited; in ValidateSequence() local
472 if (visited.OverlapsWithExtent(op.src_extent())) { in ValidateSequence()
475 visited.Dump(); in ValidateSequence()
479 CHECK(!visited.OverlapsWithExtent(op.dst_extent())) in ValidateSequence()
481 visited.AddExtent(op.dst_extent()); in ValidateSequence()
|
| /system/tools/aidl/ |
| D | parser.cpp | 128 std::map<const AidlParcelable*, int> visited; in CheckNoRecursiveDefinition() member
142 if (visited[p] == STARTED) { in CheckNoRecursiveDefinition()
149 if (visited[p] == FINISHED) { in CheckNoRecursiveDefinition()
153 visited[p] = STARTED; in CheckNoRecursiveDefinition()
167 visited[p] = FINISHED; in CheckNoRecursiveDefinition()
|
| D | check_valid.cpp | 125 std::set<const AidlDefinedType*> visited; in CheckValid() local
127 if (!visited.insert(type).second) { in CheckValid()
|