Home
last modified time | relevance | path

Searched refs:Indexes (Results 1 – 23 of 23) sorted by relevance

/aosp12/packages/modules/NeuralNetworks/runtime/test/android_fuzzing/
H A DModel.proto177 message Indexes { message
183 required Indexes inputs = 2;
184 required Indexes outputs = 3;
194 required Indexes input_indexes = 3;
195 required Indexes output_indexes = 4;
H A DGenerateCorpus.cpp107 Indexes convertIndexes(const std::vector<uint32_t>& indexes) { in convertIndexes()
108 Indexes protoIndexes; in convertIndexes()
H A DConverter.cpp107 std::vector<uint32_t> convert(const android_nn_fuzz::Indexes& indexes) { in convert()
/aosp12/art/libartbase/base/
H A Dbit_vector_test.cc45 EXPECT_TRUE(bv.Indexes().begin().Done()); in TEST()
46 EXPECT_TRUE(bv.Indexes().begin() == bv.Indexes().end()); in TEST()
61 BitVector::IndexIterator iterator = bv.Indexes().begin(); in TEST()
62 EXPECT_TRUE(iterator != bv.Indexes().end()); in TEST()
65 EXPECT_TRUE(iterator != bv.Indexes().end()); in TEST()
68 EXPECT_TRUE(iterator == bv.Indexes().end()); in TEST()
306 auto indexs = bv.Indexes(); in TEST()
H A Dbit_vector.h206 IndexContainer Indexes() const { in Indexes() function
/aosp12/art/compiler/optimizing/
H A Dexecution_subgraph.h178 auto idxs = entry_blocks_.Indexes(); in SucceedsBlock()
191 auto idxs = exit_blocks_.Indexes(); in PrecedesBlock()
201 auto indexes = bv.Indexes(); in BlockIterRange()
259 auto idxs = unreachable_blocks_.Indexes(); in UnreachableBlocks()
H A Dexecution_subgraph.cc250 if (std::any_of(unreachable_blocks_.Indexes().begin(), in RemoveConcavity()
251 unreachable_blocks_.Indexes().end(), in RemoveConcavity()
253 std::any_of(unreachable_blocks_.Indexes().begin(), in RemoveConcavity()
254 unreachable_blocks_.Indexes().end(), in RemoveConcavity()
H A Dsuperblock_cloner.cc237 for (uint32_t orig_block_id : orig_bb_set_.Indexes()) { in CopyIncomingEdgesForVersioning()
342 for (uint32_t idx : outer_loop_bb_set->Indexes()) { in RecalculateBackEdgesInfo()
353 for (uint32_t idx : outer_loop_bb_set->Indexes()) { in RecalculateBackEdgesInfo()
449 for (uint32_t block_id : orig_bb_set_.Indexes()) { in SearchForSubgraphExits()
503 for (uint32_t orig_block_id : orig_bb_set_.Indexes()) { in RemapEdgesSuccessors()
570 for (uint32_t idx : orig_bb_set_.Indexes()) { in CollectLiveOutsAndCheckClonable()
799 for (uint32_t idx : set->Indexes()) { in DumpBBSet()
806 for (uint32_t idx : orig_bb_set_.Indexes()) { in DumpInputSets()
886 for (uint32_t idx : orig_bb_set_.Indexes()) { in IsFastCase()
1099 for (uint32_t orig_block_id : work_set->Indexes()) { in IsSubgraphConnected()
H A Dssa_liveness_analysis.cc203 for (uint32_t idx : live_in->Indexes()) { in ComputeLiveRanges()
264 for (uint32_t idx : live_in->Indexes()) { in ComputeLiveRanges()
H A Dload_store_analysis.cc125 for (uint32_t exc : additional_exclusions.Indexes()) { in PrunePartialEscapeWrites()
H A Dregister_allocation_resolver.cc159 for (uint32_t idx : live->Indexes()) { in Resolve()
172 for (uint32_t idx : live->Indexes()) { in Resolve()
H A Dgvn.cc549 for (size_t block_id : visited_blocks_.Indexes()) { in FindVisitedBlockWithRecyclableSet()
H A Dload_store_elimination.cc1977 for (uint32_t phi_placeholder_index : visited.Indexes()) { in TryReplacingLoopPhiPlaceholderWithDefault()
2034 for (uint32_t phi_placeholder_index : visited.Indexes()) { in TryReplacingLoopPhiPlaceholderWithSingleInput()
2291 for (uint32_t marker_index : phi_placeholders_to_materialize.Indexes()) { in MaterializeLoopPhis()
2351 for (uint32_t matrix_index : current_dependencies->Indexes()) { in MaterializeLoopPhis()
2618 for (uint32_t index : phi_placeholders_to_search_for_kept_stores_.Indexes()) { in SearchPhiPlaceholdersForKeptStores()
2970 auto idxs = heap_locs_.Indexes(); in IterateLocations()
H A Dgraph_checker.cc762 for (uint32_t i : loop_blocks.Indexes()) { in HandleLoop()
H A Dssa_liveness_analysis.h1303 for (uint32_t idx : live_in->Indexes()) { in CheckNoLiveInIrreducibleLoop()
H A Dnodes.cc342 for (auto idx : not_post_order_visited_.Indexes()) { in CalculateReachability()
804 for (uint32_t idx : blocks_.Indexes()) { in Dump()
/aosp12/art/test/020-string/
H A Dexpected-stdout.txt7 Indexes are: 0:-1:0:43:33:-1:18:13:13:-1:18:18:-1:13:-1:-1:-1
/aosp12/system/media/audio_utils/include/audio_utils/
H A DMetadata.h827 template <typename CompoundT, size_t... Indexes>
830 size_t typeIndex, std::index_sequence<Indexes...>)
835 &copyFromByteString<CompoundT, Indexes>...
/aosp12/art/runtime/verifier/
H A Dreg_type.cc338 for (uint32_t idx : types.Indexes()) { in Dump()
988 for (uint32_t idx : unresolved_types_.Indexes()) { in CheckInvariants()
H A Dverifier_deps.cc275 for (uint32_t idx : merge.GetUnresolvedTypes().Indexes()) { in AddAssignability()
/aosp12/hardware/interfaces/tv/tuner/1.0/
H A Dtypes.hal1973 * Indexes can be tagged through TS (Transport Stream) header.
1993 * Indexes can be tagged by Start Code in PES (Packetized Elementary Stream)
2017 * Indexes can be tagged by NAL unit group in HEVC
2491 * Indexes of record output
/aosp12/hardware/interfaces/tv/tuner/1.1/
H A Dtypes.hal874 * Indexes can be tagged by start point of slice groups according to ISO/IEC 14496-10.
/aosp12/art/dex2oat/linker/
H A Doat_writer.cc2142 for (uint32_t index : indexes.Indexes()) { in CalculateNumberOfIndexBssMappingEntries()
2825 for (uint32_t index : indexes.Indexes()) { in WriteIndexBssMapping()