Home
last modified time | relevance | path

Searched refs:Index (Results 1 – 24 of 24) sorted by relevance

/system/update_engine/payload_generator/
Dtopological_sort_unittest.cc54 const Vertex::Index n_a = counter++; in TEST()
55 const Vertex::Index n_b = counter++; in TEST()
56 const Vertex::Index n_c = counter++; in TEST()
57 const Vertex::Index n_d = counter++; in TEST()
58 const Vertex::Index n_e = counter++; in TEST()
59 const Vertex::Index n_f = counter++; in TEST()
60 const Vertex::Index n_g = counter++; in TEST()
61 const Vertex::Index n_h = counter++; in TEST()
62 const Vertex::Index n_i = counter++; in TEST()
63 const Vertex::Index n_j = counter++; in TEST()
[all …]
Dtarjan.h38 void Execute(Vertex::Index vertex,
40 std::vector<Vertex::Index>* out);
43 void Tarjan(Vertex::Index vertex, Graph* graph);
45 Vertex::Index index_;
46 Vertex::Index required_vertex_;
47 std::vector<Vertex::Index> stack_;
48 std::vector<std::vector<Vertex::Index>> components_;
Dinplace_generator.h46 Vertex::Index new_vertex;
47 Vertex::Index old_src;
48 Vertex::Index old_dst;
65 Vertex::Index reader;
66 Vertex::Index writer;
106 const std::vector<Vertex::Index>& op_indexes,
107 std::vector<std::vector<Vertex::Index>::size_type>* reverse_op_indexes);
111 static void SortCutsByTopoOrder(const std::vector<Vertex::Index>& op_indexes,
118 std::vector<Vertex::Index>* op_indexes);
135 std::vector<Vertex::Index>* op_indexes,
[all …]
Dcycle_breaker_unittest.cc50 const Vertex::Index n_a = counter++; in TEST()
51 const Vertex::Index n_b = counter++; in TEST()
52 const Vertex::Index n_c = counter++; in TEST()
53 const Vertex::Index n_d = counter++; in TEST()
54 const Vertex::Index n_e = counter++; in TEST()
55 const Vertex::Index n_f = counter++; in TEST()
56 const Vertex::Index n_g = counter++; in TEST()
57 const Vertex::Index n_h = counter++; in TEST()
98 pair<Vertex::Index, EdgeProperties> EdgeWithWeight(Vertex::Index dest, in EdgeWithWeight()
137 const Vertex::Index n_root = counter++; in TEST()
[all …]
Dtarjan_unittest.cc37 const Vertex::Index n_a = 0; in TEST()
38 const Vertex::Index n_b = 1; in TEST()
39 const Vertex::Index n_c = 2; in TEST()
40 const Vertex::Index n_d = 3; in TEST()
41 const Vertex::Index n_e = 4; in TEST()
42 const Vertex::Index n_f = 5; in TEST()
43 const Vertex::Index n_g = 6; in TEST()
44 const Vertex::Index n_h = 7; in TEST()
64 for (Vertex::Index i = n_a; i <= n_e; i++) { in TEST()
65 vector<Vertex::Index> vertex_indexes; in TEST()
[all …]
Dtopological_sort.cc31 set<Vertex::Index>* visited_nodes, in TopologicalSortVisit()
32 vector<Vertex::Index>* nodes, in TopologicalSortVisit()
33 Vertex::Index node) { in TopologicalSortVisit()
49 void TopologicalSort(const Graph& graph, vector<Vertex::Index>* out) { in TopologicalSort()
50 set<Vertex::Index> visited_nodes; in TopologicalSort()
52 for (Vertex::Index i = 0; i < graph.size(); i++) { in TopologicalSort()
Dcycle_breaker.h52 void Unblock(Vertex::Index u);
53 bool Circuit(Vertex::Index vertex, Vertex::Index depth);
57 Vertex::Index current_vertex_; // "s" in the paper
58 std::vector<Vertex::Index> stack_; // the stack variable in the paper
Dcycle_breaker.cc76 vector<Vertex::Index> component_indexes; in BreakCycles()
80 for (vector<Vertex::Index>::iterator it = component_indexes.begin(); in BreakCycles()
84 for (vector<Vertex::Index>::iterator jt = component_indexes.begin(); in BreakCycles()
111 CHECK_GE(stack_.size(), static_cast<vector<Vertex::Index>::size_type>(2)); in HandleCircuit()
115 for (vector<Vertex::Index>::const_iterator it = stack_.begin(); in HandleCircuit()
136 void CycleBreaker::Unblock(Vertex::Index u) { in Unblock()
141 Vertex::Index w = it->first; in Unblock()
149 for (vector<Vertex::Index>::const_iterator it = ++stack_.begin(), in StackContainsCutEdge()
161 bool CycleBreaker::Circuit(Vertex::Index vertex, Vertex::Index depth) { in Circuit()
172 for (Vertex::Index index : stack_) { in Circuit()
Dtarjan.cc33 void TarjanAlgorithm::Execute(Vertex::Index vertex, in Execute()
35 vector<Vertex::Index>* out) { in Execute()
48 void TarjanAlgorithm::Tarjan(Vertex::Index vertex, Graph* graph) { in Tarjan()
57 Vertex::Index vertex_next = it->first; in Tarjan()
68 vector<Vertex::Index> component; in Tarjan()
69 Vertex::Index other_vertex; in Tarjan()
Dgraph_types.h74 typedef std::vector<Vertex>::size_type Index; typedef
75 static const Vertex::Index kInvalidIndex;
80 typedef std::pair<Vertex::Index, Vertex::Index> Edge;
Dinplace_generator.cc234 const vector<vector<Vertex::Index>::size_type>& table) in SortCutsByTopoOrderLess()
241 const vector<vector<Vertex::Index>::size_type>& table_;
247 const vector<Vertex::Index>& op_indexes, in GenerateReverseTopoOrderMap()
248 vector<vector<Vertex::Index>::size_type>* reverse_op_indexes) { in GenerateReverseTopoOrderMap()
249 vector<vector<Vertex::Index>::size_type> table(op_indexes.size()); in GenerateReverseTopoOrderMap()
250 for (vector<Vertex::Index>::size_type i = 0, e = op_indexes.size(); i != e; in GenerateReverseTopoOrderMap()
252 Vertex::Index node = op_indexes[i]; in GenerateReverseTopoOrderMap()
262 const vector<Vertex::Index>& op_indexes, vector<CutEdgeVertexes>* cuts) { in SortCutsByTopoOrder()
264 vector<vector<Vertex::Index>::size_type> table; in SortCutsByTopoOrder()
271 Graph* graph, vector<Vertex::Index>* op_indexes) { in MoveAndSortFullOpsToBack()
[all …]
Dgraph_utils.h38 void AddReadBeforeDep(Vertex* src, Vertex::Index dst, uint64_t block);
40 Vertex::Index dst,
46 void DropIncomingEdgesTo(Graph* graph, Vertex::Index index);
Dgraph_types.cc21 const Vertex::Index Vertex::kInvalidIndex = static_cast<Vertex::Index>(-1);
Dtopological_sort.h38 void TopologicalSort(const Graph& graph, std::vector<Vertex::Index>* out);
Dgraph_utils.cc50 void AddReadBeforeDep(Vertex* src, Vertex::Index dst, uint64_t block) { in AddReadBeforeDep()
63 Vertex::Index dst, in AddReadBeforeDepExtents()
95 void DropIncomingEdgesTo(Graph* graph, Vertex::Index index) { in DropIncomingEdgesTo()
Dinplace_generator_unittest.cc247 cut_edges.find(std::pair<Vertex::Index, Vertex::Index>(1, 0))); in TEST_F()
375 vector<Vertex::Index> op_indexes; in TEST_F()
386 vector<vector<Vertex::Index>::size_type> reverse_op_indexes; in TEST_F()
416 vector<Vertex::Index> vect(graph.size()); in TEST_F()
418 for (vector<Vertex::Index>::size_type i = 0; i < vect.size(); ++i) { in TEST_F()
483 vector<Vertex::Index> final_order; in TEST_F()
/system/bt/embdrv/sbc/encoder/srce/
Dsbc_dct.c183 uint8_t Index, k; in SBC_FastIDCT8()
186 for (Index = 0; Index < 8; Index++) { in SBC_FastIDCT8()
191 temp += (gas16AnalDCTcoeff8[(Index * 8 * 2) + k] * (pInVect[k] >> 16)); in SBC_FastIDCT8()
193 ((gas16AnalDCTcoeff8[(Index * 8 * 2) + k] * (pInVect[k] & 0xFFFF)) >> in SBC_FastIDCT8()
196 pOutVect[Index] = temp; in SBC_FastIDCT8()
252 uint8_t Index, k; in SBC_FastIDCT4()
255 for (Index = 0; Index < 4; Index++) { in SBC_FastIDCT4()
260 temp += (gas16AnalDCTcoeff4[(Index * 4 * 2) + k] * (pInVect[k] >> 16)); in SBC_FastIDCT4()
262 ((gas16AnalDCTcoeff4[(Index * 4 * 2) + k] * (pInVect[k] & 0xFFFF)) >> in SBC_FastIDCT4()
265 pOutVect[Index] = temp; in SBC_FastIDCT4()
/system/libhidl/transport/token/1.0/utils/include/hidl/
DHybridInterface.h255 template <size_t Index = std::variant_size_v<HalVariant> - 1>
257 if constexpr (Index == 0) { in _findIndex()
258 return Index; in _findIndex()
261 std::variant_alternative_t<Index, HalVariant>, in _findIndex()
263 return Index; in _findIndex()
265 return _findIndex<Index - 1>(); in _findIndex()
307 template <size_t Index = std::variant_size_v<HalVariant> - 1>
310 if constexpr (Index == 0) { in _castFromHalBaseAndConvert()
313 if (halIndex != Index) { in _castFromHalBaseAndConvert()
314 return _castFromHalBaseAndConvert<Index - 1>(halIndex, halBase); in _castFromHalBaseAndConvert()
[all …]
/system/extras/perfprofd/
Dperf_profile.proto79 // Index into ProcessNames for the name of the process.
/system/core/fastboot/
Dudp.cpp52 enum Index { enum
/system/media/audio_utils/
DDoxyfile630 # will remove the Files entry from the Quick Index and from the Folder Tree View
637 # page. This will remove the Namespaces entry from the Quick Index and from the
1657 # index chapters (such as File Index, Compound Index, etc.) in the output.
DDoxyfile.orig630 # will remove the Files entry from the Quick Index and from the Folder Tree View
637 # page. This will remove the Namespaces entry from the Quick Index and from the
1657 # index chapters (such as File Index, Compound Index, etc.) in the output.
/system/chre/pal/doc/
DDoxyfile653 # will remove the Files entry from the Quick Index and from the Folder Tree View
660 # page. This will remove the Namespaces entry from the Quick Index and from the
1718 # index chapters (such as File Index, Compound Index, etc.) in the output.
/system/chre/chre_api/doc/
DDoxyfile653 # will remove the Files entry from the Quick Index and from the Folder Tree View
660 # page. This will remove the Namespaces entry from the Quick Index and from the
1718 # index chapters (such as File Index, Compound Index, etc.) in the output.