| /aosp12/system/tools/hidl/ |
| H A D | Type.cpp | 168 if (visited->find(this) != visited->end()) return OK; in recursivePass()
169 visited->insert(this); in recursivePass()
192 if (visited->find(this) != visited->end()) return OK; in recursivePass()
193 visited->insert(this); in recursivePass()
345 return canCheckEquality(&visited); in canCheckEquality()
350 if (visited->find(this) != visited->end()) { in canCheckEquality()
353 visited->insert(this); in canCheckEquality()
695 if (visited->find(this) != visited->end()) { in isJavaCompatible()
698 visited->insert(this); in isJavaCompatible()
704 if (visited->find(this) != visited->end()) { in containsPointer()
[all …]
|
| H A D | ConstantExpression.cpp | 557 if (visited->find(this) != visited->end()) return OK; in recursivePass()
558 visited->insert(this); in recursivePass()
566 status_t err = nextCE->recursivePass(func, visited, processBeforeDependencies); in recursivePass()
573 status_t err = nextCE->recursivePass(func, visited, processBeforeDependencies); in recursivePass()
590 if (visited->find(this) != visited->end()) return OK; in recursivePass()
591 visited->insert(this); in recursivePass()
627 std::unordered_set<const ConstantExpression*>* visited, in checkAcyclic() argument
638 if (visited->find(this) != visited->end()) return CheckAcyclicStatus(OK); in checkAcyclic()
639 visited->insert(this); in checkAcyclic()
643 auto err = nextCE->checkAcyclic(visited, stack); in checkAcyclic()
[all …]
|
| H A 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;
|
| H A D | AST.cpp | 191 std::unordered_set<const Type*> visited; in setParseStage() local
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
325 std::unordered_set<const Type*> visited; in validate() local
335 std::unordered_set<const Type*> visited; in topologicalReorder() local
[all …]
|
| H A 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()
|
| H A 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()
|
| H A D | generateDependencies.cpp | 30 std::unordered_set<const Type*> visited; in generateDependencies() local
39 &visited); in generateDependencies()
|
| H A 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;
|
| H A 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;
|
| H A 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;
|
| H A 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;
|
| /aosp12/system/tools/hidl/lint/lints/ |
| H A 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()
|
| H A D | emptyStructs.cpp | 30 std::unordered_set<const Type*> visited; in checkSmallStructs() local
58 &visited); in checkSmallStructs()
|
| H A D | enumMaxAndAll.cpp | 34 std::unordered_set<const Type*> visited; in enumValueNames() local
68 &visited); in enumValueNames()
|
| /aosp12/packages/providers/ContactsProvider/src/com/android/providers/contacts/aggregation/util/ |
| H A D | ContactAggregatorHelper.java | 98 Set<Long> visited = new ArraySet<>(); in findConnectedComponents() local
100 if (!visited.contains(id)) { in findConnectedComponents()
102 findConnectedComponentForRawContact(matchingRawIdPairs, visited, id, set); in findConnectedComponents()
110 Set<Long> visited, Long rawContactId, Set<Long> results) { in findConnectedComponentForRawContact() argument
111 visited.add(rawContactId); in findConnectedComponentForRawContact()
114 if (!visited.contains(match)) { in findConnectedComponentForRawContact()
115 findConnectedComponentForRawContact(connections, visited, match, results); in findConnectedComponentForRawContact()
|
| /aosp12/packages/apps/Gallery2/src/com/android/gallery3d/ingest/data/ |
| H A D | ImportTask.java | 76 int visited = 0; in run() local
78 mListener.onImportProgress(visited, total, null); in run()
82 visited++; in run()
94 mListener.onImportProgress(visited, total, importedPath); in run()
98 mListener.onImportFinish(objectsNotImported, visited); in run()
|
| /aosp12/art/runtime/gc/ |
| H A D | verification.cc | 160 explicit BFSFindReachable(ObjectSet* visited) : visited_(visited) {} in BFSFindReachable() argument
199 CollectRootVisitor(ObjectSet* visited, WorkQueue* work) : visited_(visited), work_(work) {} in CollectRootVisitor() argument
217 std::set<mirror::Object*> visited; in FirstPathFromRootSet() local
220 CollectRootVisitor root_visitor(&visited, &work); in FirstPathFromRootSet()
229 BFSFindReachable visitor(&visited); in FirstPathFromRootSet()
|
| /aosp12/art/runtime/ |
| H A D | handle_scope_test.cc | 82 visited.insert(ref); in VisitRootIfNonNull()
87 std::set<StackReference<mirror::Object>*> visited; member in art::CollectVisitor
116 EXPECT_LE(visitor.visited.size(), base->NumberOfReferences()); in TEST_F()
118 for (StackReference<mirror::Object>* ref : visitor.visited) { in TEST_F()
|
| /aosp12/art/compiler/optimizing/ |
| H A D | licm.cc | 86 ArenaBitVector* visited = nullptr; in Run() local
88 visited = new (graph_->GetAllocator()) ArenaBitVector(graph_->GetAllocator(), in Run()
110 DCHECK(visited->IsBitSet(inner->GetBlockId())); in Run()
114 visited->SetBit(inner->GetBlockId()); in Run()
|
| /aosp12/frameworks/base/tools/aapt2/ |
| H A D | ValueVisitor_test.cpp | 30 Reference* visited = nullptr; member
32 void Visit(Reference* ref) override { visited = ref; } in Visit()
54 EXPECT_EQ(visitor.visited, &ref); in TEST()
|
| /aosp12/packages/services/Car/cpp/powerpolicy/server/src/ |
| H A D | PolicyManager.cpp | 176 std::unordered_set<PowerComponent>* visited) { in readComponents() argument
190 if (visited->count(componentId) > 0) { in readComponents()
195 visited->insert(componentId); in readComponents()
210 const std::unordered_set<PowerComponent>& visited) { in readOtherComponents() argument
220 iterateAllPowerComponents([&visited, &policy](PowerComponent component) -> bool { in readOtherComponents()
221 if (visited.count(component) == 0) { in readOtherComponents()
227 iterateAllPowerComponents([&visited, &policy](PowerComponent component) -> bool { in readOtherComponents()
228 if (visited.count(component) == 0) { in readOtherComponents()
253 std::unordered_set<PowerComponent> visited; in readPolicies() local
265 auto ret = readComponents(pPolicy, policy, &visited); in readPolicies()
[all …]
|
| /aosp12/system/update_engine/payload_generator/ |
| H A D | merge_sequence_generator.cc | 284 ExtentRanges visited; in ValidateSequence() local
286 if (visited.OverlapsWithExtent(op.src_extent())) { in ValidateSequence()
289 visited.Dump(); in ValidateSequence()
293 CHECK(!visited.OverlapsWithExtent(op.dst_extent())) in ValidateSequence()
295 visited.AddExtent(op.dst_extent()); in ValidateSequence()
|
| /aosp12/packages/services/Car/service/src/com/android/car/power/ |
| H A D | PolicyReader.java | 437 Set<Integer> visited = new ArraySet<>(); in parseSystemPolicyOverrides() local
438 checkSystemPowerPolicyComponents(policyOverride.getEnabledComponents(), visited); in parseSystemPolicyOverrides() local
439 checkSystemPowerPolicyComponents(policyOverride.getDisabledComponents(), visited); in parseSystemPolicyOverrides() local
531 Set<Integer> visited = new ArraySet<>(); in parsePolicyGroup() local
546 if (visited.contains(powerState)) { in parsePolicyGroup()
551 visited.add(powerState); in parsePolicyGroup()
560 if (visited.contains(powerState)) { in parsePolicyGroup()
564 visited.add(powerState); in parsePolicyGroup()
656 void checkSystemPowerPolicyComponents(int[] components, Set<Integer> visited) throws in checkSystemPowerPolicyComponents() argument
664 if (visited.contains(component)) { in checkSystemPowerPolicyComponents()
[all …]
|
| /aosp12/frameworks/base/sax/java/android/sax/ |
| H A D | Element.java | 40 boolean visited; field in Element
180 requiredChildren.get(i).visited = false; in resetRequiredChildren()
193 if (!child.visited) { in checkRequiredChildren()
|
| /aosp12/build/make/tools/ |
| H A D | java-layers.py | 56 def recurse(obj, dep, visited): argument
58 if dep in visited:
61 for v in visited:
66 visited.append(dep)
70 recurse(obj, deps[upper], visited)
|