/system/update_engine/payload_generator/ |
D | cycle_breaker_unittest.cc | 63 graph[n_a].out_edges.insert(make_pair(n_e, EdgeProperties())); in TEST() 64 graph[n_a].out_edges.insert(make_pair(n_f, EdgeProperties())); in TEST() 65 graph[n_b].out_edges.insert(make_pair(n_a, EdgeProperties())); in TEST() 66 graph[n_c].out_edges.insert(make_pair(n_d, EdgeProperties())); in TEST() 67 graph[n_d].out_edges.insert(make_pair(n_e, EdgeProperties())); in TEST() 68 graph[n_d].out_edges.insert(make_pair(n_f, EdgeProperties())); in TEST() 69 graph[n_e].out_edges.insert(make_pair(n_b, EdgeProperties())); in TEST() 70 graph[n_e].out_edges.insert(make_pair(n_c, EdgeProperties())); in TEST() 71 graph[n_e].out_edges.insert(make_pair(n_f, EdgeProperties())); in TEST() 72 graph[n_f].out_edges.insert(make_pair(n_g, EdgeProperties())); in TEST() [all …]
|
D | tarjan_unittest.cc | 49 graph[n_a].out_edges.insert(make_pair(n_e, EdgeProperties())); in TEST() 50 graph[n_a].out_edges.insert(make_pair(n_f, EdgeProperties())); in TEST() 51 graph[n_b].out_edges.insert(make_pair(n_a, EdgeProperties())); in TEST() 52 graph[n_c].out_edges.insert(make_pair(n_d, EdgeProperties())); in TEST() 53 graph[n_d].out_edges.insert(make_pair(n_e, EdgeProperties())); in TEST() 54 graph[n_d].out_edges.insert(make_pair(n_f, EdgeProperties())); in TEST() 55 graph[n_e].out_edges.insert(make_pair(n_b, EdgeProperties())); in TEST() 56 graph[n_e].out_edges.insert(make_pair(n_c, EdgeProperties())); in TEST() 57 graph[n_e].out_edges.insert(make_pair(n_f, EdgeProperties())); in TEST() 58 graph[n_f].out_edges.insert(make_pair(n_g, EdgeProperties())); in TEST() [all …]
|
D | topological_sort_unittest.cc | 68 graph[n_i].out_edges.insert(make_pair(n_j, EdgeProperties())); in TEST() 69 graph[n_i].out_edges.insert(make_pair(n_c, EdgeProperties())); in TEST() 70 graph[n_i].out_edges.insert(make_pair(n_e, EdgeProperties())); in TEST() 71 graph[n_i].out_edges.insert(make_pair(n_h, EdgeProperties())); in TEST() 72 graph[n_c].out_edges.insert(make_pair(n_b, EdgeProperties())); in TEST() 73 graph[n_b].out_edges.insert(make_pair(n_a, EdgeProperties())); in TEST() 74 graph[n_e].out_edges.insert(make_pair(n_d, EdgeProperties())); in TEST() 75 graph[n_e].out_edges.insert(make_pair(n_g, EdgeProperties())); in TEST() 76 graph[n_g].out_edges.insert(make_pair(n_d, EdgeProperties())); in TEST() 77 graph[n_g].out_edges.insert(make_pair(n_f, EdgeProperties())); in TEST() [all …]
|
D | extent_ranges.cc | 99 extent_set_.insert(extent); in AddExtent() 110 ret.insert(ExtentForRange(base.start_block(), in SubtractOverlappingExtents() 116 ret.insert(ExtentForRange(subtractee_end, base_end - subtractee_end)); in SubtractOverlappingExtents() 145 new_extents.insert(*jt); in SubtractExtent() 150 extent_set_.insert(new_extents.begin(), new_extents.end()); in SubtractExtent()
|
D | cycle_breaker.cc | 87 subgraph_[*it].subgraph_edges.insert(*jt); in BreakCycles() 129 cut_edges_.insert(min_edge); in HandleCircuit() 201 blocked_graph_[*w].out_edges.insert(make_pair(vertex, in Circuit()
|
/system/core/libsysutils/include/sysutils/ |
D | List.h | 169 insert(begin(), src.begin(), src.end()); in List() 208 void push_front(const T& val) { insert(begin(), val); } in push_front() 209 void push_back(const T& val) { insert(end(), val); } in push_back() 212 iterator insert(iterator posn, const T& val) in insert() function 223 void insert(iterator posn, const_iterator first, const_iterator last) { in insert() function 225 insert(posn, *first); in insert() 327 insert(lastDst, firstSrc, lastSrc); // copy remaining over
|
/system/keymaster/ |
D | List.h | 168 insert(begin(), src.begin(), src.end()); in List() 207 void push_front(const T& val) { insert(begin(), val); } in push_front() 208 void push_back(const T& val) { insert(end(), val); } in push_back() 211 iterator insert(iterator posn, const T& val) in insert() function 222 void insert(iterator posn, const_iterator first, const_iterator last) { in insert() function 224 insert(posn, *first); in insert() 326 insert(lastDst, firstSrc, lastSrc); // copy remaining over
|
/system/core/libutils/include/utils/ |
D | List.h | 168 insert(begin(), src.begin(), src.end()); in List() 207 void push_front(const T& val) { insert(begin(), val); } in push_front() 208 void push_back(const T& val) { insert(end(), val); } in push_back() 211 iterator insert(iterator posn, const T& val) in insert() function 222 void insert(iterator posn, const_iterator first, const_iterator last) { in insert() function 224 insert(posn, *first); in insert() 326 insert(lastDst, firstSrc, lastSrc); // copy remaining over
|
/system/media/brillo/audio/audioservice/test/ |
D | audio_device_handler_test.cpp | 249 handler_.connected_input_devices_.insert(device); in TEST_F() 265 handler_.connected_output_devices_.insert(device); in TEST_F() 280 handler_.connected_input_devices_.insert(AUDIO_DEVICE_IN_WIRED_HEADSET); in TEST_F() 281 handler_.connected_output_devices_.insert(AUDIO_DEVICE_OUT_WIRED_HEADSET); in TEST_F() 282 handler_.connected_output_devices_.insert(AUDIO_DEVICE_OUT_WIRED_HEADPHONE); in TEST_F() 381 handler_.connected_input_devices_.insert(device); in TEST_F() 382 handler_.connected_output_devices_.insert(device); in TEST_F() 396 handler_.connected_input_devices_.insert(device); in TEST_F() 397 handler_.connected_output_devices_.insert(device); in TEST_F()
|
/system/netd/server/ |
D | NatControllerTest.cpp | 180 expected.insert(expected.end(), setupFirstNatCommands.begin(), setupFirstNatCommands.end()); in TEST_F() 181 expected.insert(expected.end(), startFirstNatCommands.begin(), startFirstNatCommands.end()); in TEST_F() 194 expected.insert(expected.end(), FLUSH_COMMANDS.begin(), FLUSH_COMMANDS.end()); in TEST_F()
|
D | DummyNetwork.cpp | 31 mInterfaces.insert(INTERFACE_NAME); in DummyNetwork()
|
/system/update_engine/payload_consumer/ |
D | extent_writer_unittest.cc | 88 expected_file.insert(expected_file.end(), in TEST_F() 156 expected_file.insert(expected_file.end(), in WriteAlignedExtents() 159 expected_file.insert(expected_file.end(), in WriteAlignedExtents() 161 expected_file.insert(expected_file.end(), in WriteAlignedExtents() 206 expected_file.insert(expected_file.end(), in TestZeroPad() 209 expected_file.insert(expected_file.end(), in TestZeroPad()
|
/system/tools/hidl/ |
D | AST.cpp | 148 mImportedTypes[importAST].insert(match); in addImport() 166 mImportedTypes[importAST].insert(match); in addImport() 175 mImportedASTs.insert(ast); in addImportedAST() 439 mImportedNames.insert(typesName); in lookupTypeFromImports() 447 mImportedNames.insert( in lookupTypeFromImports() 478 importSet->insert(packageName); in getImportedPackages() 490 importSet->insert(newSet.begin(), newSet.end()); in getImportedPackagesHierarchy() 495 allImportNames->insert(name); in getAllImportedNames()
|
/system/core/libmemunreachable/ |
D | Binder.cpp | 65 refs.insert(refs.end(), binder_refs.begin(), binder_refs.end()); in BinderReferences() 72 refs.insert(refs.end(), hwbinder_refs.begin(), hwbinder_refs.end()); in BinderReferences()
|
/system/update_engine/ |
D | connection_manager_unittest.cc | 233 allowed_set.insert(StringForConnectionType(ConnectionType::kCellular)); in TEST_F() 252 allowed_set.insert(StringForConnectionType(ConnectionType::kCellular)); in TEST_F() 253 allowed_set.insert(StringForConnectionType(ConnectionType::kBluetooth)); in TEST_F() 302 allowed_set.insert(StringForConnectionType(ConnectionType::kEthernet)); in TEST_F() 303 allowed_set.insert(StringForConnectionType(ConnectionType::kWifi)); in TEST_F() 304 allowed_set.insert(StringForConnectionType(ConnectionType::kWimax)); in TEST_F() 320 allowed_set.insert(StringForConnectionType(ConnectionType::kCellular)); in TEST_F()
|
/system/chre/util/tests/ |
D | dynamic_vector_test.cc | 80 ASSERT_TRUE(vector.insert(vector.size(), 0xd00d)); in TEST() 149 ASSERT_TRUE(vector.insert(vector.size(), std::move(mbnc2))); in TEST() 194 ASSERT_TRUE(vector.insert(vector.size(), cbnm2)); in TEST() 320 EXPECT_CHRE_ASSERT(EXPECT_FALSE(vector.insert(1, 0x1337))); in TEST() 323 ASSERT_TRUE(vector.insert(0, 0x1337)); in TEST() 328 EXPECT_TRUE(vector.insert(1, 0xface)); in TEST() 334 EXPECT_TRUE(vector.insert(0, 0xcafe)); in TEST() 341 EXPECT_TRUE(vector.insert(1, 0xdead)); in TEST() 349 EXPECT_TRUE(vector.insert(2, 0xbeef)); in TEST() 359 EXPECT_TRUE(vector.insert(0, 0xabad)); in TEST() [all …]
|
/system/core/libutils/tests/ |
D | LruCache_test.cpp | 361 returnedValues.insert(v); in TEST_F() 373 returnedValues.insert(it.value()); in TEST_F() 386 returnedValues.insert(it.value()); in TEST_F() 400 returnedValues.insert(it.value()); in TEST_F() 416 returnedValues.insert(it.value()); in TEST_F() 432 returnedValues.insert(it.value()); in TEST_F() 448 returnedValues.insert(it.value()); in TEST_F()
|
/system/core/adb/sysdeps/ |
D | errno.cpp | 64 result->insert(std::make_pair((error_name), (wire_value))) in generate_host_to_wire() 73 result->insert(std::make_pair((wire_value), (error_name))) in generate_wire_to_host()
|
/system/libvintf/ |
D | HalManifest.cpp | 47 existingMajorVersions.insert(v.majorVer); in shouldAdd() 71 names.insert(hal.first); in getHalNames() 80 names.insert(hal.name + "@" + to_string(version)); in getHalNamesAndVersions() 90 interfaceNames.insert(iface.first); in getInterfaceNames() 157 ret.insert(hal->versions.begin(), hal->versions.end()); in getSupportedVersions() 169 ret.insert(it->second.instances.begin(), it->second.instances.end()); in getInstances() 227 instances[manifestHalVersion][interface].insert(toAdd.begin(), toAdd.end()); in isCompatible()
|
/system/extras/simpleperf/ |
D | cmd_kmem_test.cpp | 48 args.insert(args.end(), additional_args.begin(), additional_args.end()); in KmemReportRawFile() 84 v.insert(v.begin(), "record"); in RunKmemRecordCmd() 85 v.insert(v.end(), {"-o", out_file, "sleep", SLEEP_SEC}); in RunKmemRecordCmd()
|
D | sample_tree.h | 101 ips.insert(ips.end(), r.callchain_data.ips, in ProcessSampleRecord() 120 ips.insert(ips.end(), unwind_ips.begin(), unwind_ips.end()); in ProcessSampleRecord() 170 added_set.insert(sample); in ProcessSampleRecord() 213 sample_set_.insert(sample.get()); in InsertSample() 234 callchain_sample_set_.insert(sample.get()); in InsertCallChainSample()
|
D | tracing.cpp | 39 data.insert(data.end(), p, p + sizeof(T)); in AppendData() 43 data.insert(data.end(), s, s + strlen(s) + 1); in AppendData() 48 data.insert(data.end(), s.c_str(), s.c_str() + s.size() + 1); in AppendData() 69 data.insert(data.end(), file.begin(), file.end()); in AppendFile() 77 file.insert(file.end(), p, p + file_size); in DetachFile() 181 ret.insert(ret.end(), magic, magic + sizeof(magic)); in BinaryFormat()
|
/system/chre/util/include/chre/util/ |
D | dynamic_vector.h | 196 bool insert(size_type index, const ElementType& element); 197 bool insert(size_type index, ElementType&& element);
|
/system/bt/vendor_libs/test_vendor_lib/src/ |
D | l2cap_packet.cc | 138 built_l2cap_packet->l2cap_packet_.insert( in assemble() 163 payload_sub_vector.insert(payload_sub_vector.end(), begin_payload_iter, in get_l2cap_payload() 226 current_sdu.insert(current_sdu.end(), current_iter, end_iter); in fragment() 271 current_sdu.insert(current_sdu.end(), current_iter, next_iter); in fragment()
|
/system/update_engine/update_manager/ |
D | boxed_value_unittest.cc | 196 set1->insert(ConnectionType::kWimax); in TEST() 197 set1->insert(ConnectionType::kEthernet); in TEST() 201 set2->insert(ConnectionType::kWifi); in TEST()
|