/system/extras/simpleperf/ |
H A D | callchain.h | 34 std::vector<EntryT*> chain; member in struct:CallChainNode 66 if (match_length < p->chain.size()) { 110 if (is_same_sample(node->chain.front(), sample)) { 118 NodeT* node, const std::vector<EntryT*>& chain, size_t chain_start, 121 for (i = 0, j = chain_start; i < node->chain.size() && j < chain.size(); 123 if (!is_same_sample(node->chain[i], chain[j])) { 132 parent->chain, parent_length, parent->period, parent->children_period); 136 parent->chain 117 GetMatchingLengthInNode( NodeT* node, const std::vector<EntryT*>& chain, size_t chain_start, std::function<bool(const EntryT*, const EntryT*)> is_same_sample) argument 141 AllocateNode(const std::vector<EntryT*>& chain, size_t chain_start, uint64_t period, uint64_t children_period) argument [all...] |
H A D | SampleDisplayer.h | 155 PrintSampleName(node->chain[0]).c_str()); 156 for (size_t i = 1; i < node->chain.size(); ++i) { 158 PrintSampleName(node->chain[i]).c_str());
|
/system/tools/hidl/ |
H A D | EnumType.cpp | 47 std::vector<const EnumType *> chain; local 48 getTypeChain(&chain); 49 for (auto it = chain.begin(); it != chain.end(); ++it) { 107 std::vector<const EnumType *> chain; local 108 getTypeChain(&chain); 109 for (auto it = chain.begin(); it != chain.end(); ++it) { 166 std::vector<const EnumType *> chain; local 167 getTypeChain(&chain); 363 std::vector<const EnumType *> chain; local 449 std::vector<const EnumType *> chain; local 558 std::vector<const EnumType *> chain; local [all...] |
H A D | generateVts.cpp | 101 std::vector<const Interface *> chain = iface->typeChain(); local 109 for (auto it = chain.rbegin(); it != chain.rend(); ++it) {
|
H A D | Interface.cpp | 261 std::vector<const Interface *> chain = typeChain(); 264 for (const Interface *iface : chain) { 272 std::vector<const Interface *> chain = typeChain(); 275 for (size_t i = 0; i < chain.size(); ++i) { 278 out << chain[i]->fullJavaName() << ".kInterfaceName"; 290 const std::vector<const Interface *> &chain, 292 out.join(chain.begin(), chain.end(), ",\n", [&] (const auto &iface) { 317 std::vector<const Interface *> chain = typeChain(); 321 chain, [](cons 287 emitDigestChain( Formatter &out, const std::string &prefix, const std::vector<const Interface *> &chain, std::function<std::string(const ConstantExpression &)> byteToString) argument 559 std::vector<const Interface *> chain = typeChain(); local [all...] |
/system/netd/server/ |
H A D | FirewallController.cpp | 51 // fw_dozable chain is called from both INPUT and OUTPUT, this includes both packets that we need 114 int FirewallController::enableChildChains(ChildChain chain, bool enable) { argument 117 switch(chain) { 179 FirewallType FirewallController::getFirewallType(ChildChain chain) { argument 180 switch(chain) { 194 int FirewallController::setUidRule(ChildChain chain, int uid, FirewallRule rule) { argument 197 FirewallType firewallType = getFirewallType(chain); 209 switch(chain) { 223 ALOGW("Unknown child chain: %d", chain); 237 createChain(const char* chain, FirewallType type) argument [all...] |
H A D | BandwidthController.cpp | 94 * - quota'd rules in the costly chain should be before bw_penalty_box lookups. 98 * - global quota for all costly interfaces uses a single costly chain: 294 const std::string& chain, IptJumpOp jumpHandling, 298 StringAppendF(&cmd, "%s %s -m owner --uid-owner %s%s\n", opToString(op), chain.c_str(), 309 constexpr char chain[] = "bw_costly_shared"; local 329 StringPrintf("-I bw_INPUT %d -i %s --jump %s", ruleInsertPos, iface.c_str(), chain), 330 StringPrintf("-I bw_OUTPUT %d -o %s --jump %s", ruleInsertPos, iface.c_str(), chain), 331 StringPrintf("-A bw_FORWARD -o %s --jump %s", iface.c_str(), chain), 336 chain, maxBytes, cost)); 365 constexpr char chain[] local 293 manipulateSpecialApps(const std::vector<std::string>& appStrUids, const std::string& chain, IptJumpOp jumpHandling, IptOp op) argument 439 const std::string chain = "bw_costly_" + iface; local 500 const std::string chain = "bw_costly_" + iface; local [all...] |
H A D | BandwidthControllerTest.cpp | 409 const std::string chain = "bw_costly_" + iface; local 410 const char* c_chain = chain.c_str(); 427 const std::string chain = "bw_costly_" + iface; local 428 const char* c_chain = chain.c_str(); 464 const std::string chain = "bw_costly_shared"; local 465 const char* c_chain = chain.c_str(); 483 const std::string chain = "bw_costly_shared"; local 484 const char* c_chain = chain.c_str();
|
H A D | BandwidthController.h | 138 int manipulateSpecialApps(const std::vector<std::string>& appStrUids, const std::string& chain, 155 * fp should be a file to the apropriate FORWARD chain of iptables rules. 196 * The FORWARD chain is updated in the following cases:
|
/system/extras/simpleperf/inferno/ |
H A D | data_types.py | 34 chain = [] 40 chain.append(CallSite(entry.ip, entry.symbol.symbol_name, entry.symbol.dso_name)) 42 chain.append(CallSite(sample.ip, symbol.symbol_name, symbol.dso_name)) 43 self.samples.append(chain)
|
/system/keymaster/ |
H A D | asymmetric_key.cpp | 221 static bool allocate_cert_chain(size_t entry_count, keymaster_cert_chain_t* chain, argument 223 if (chain->entries) { 224 for (size_t i = 0; i < chain->entry_count; ++i) 225 delete[] chain->entries[i].data; 226 delete[] chain->entries; 229 chain->entry_count = entry_count; 230 chain->entries = new(std::nothrow) keymaster_blob_t[entry_count]; 231 if (!chain->entries) { 238 // Copies the intermediate and root certificates into chain, leaving the first slot for the leaf 242 keymaster_cert_chain_t* chain, keymaster_error_ 240 copy_attestation_chain(const KeymasterContext& context, keymaster_algorithm_t sign_algorithm, keymaster_cert_chain_t* chain, keymaster_error_t* error) argument [all...] |
H A D | android_keymaster_messages_test.cpp | 587 keymaster_cert_chain_t* chain = &deserialized->certificate_chain; local 589 EXPECT_NE(nullptr, chain->entries); 590 EXPECT_EQ(3U, chain->entry_count); 591 EXPECT_EQ(3U, chain->entries[0].data_length); 592 EXPECT_EQ(0, memcmp("foo", chain->entries[0].data, 3)); 593 EXPECT_EQ(3U, chain->entries[1].data_length); 594 EXPECT_EQ(0, memcmp("bar", chain->entries[1].data, 3)); 595 EXPECT_EQ(3U, chain->entries[2].data_length); 596 EXPECT_EQ(0, memcmp("baz", chain->entries[2].data, 3));
|
H A D | soft_keymaster_context.cpp | 801 UniquePtr<keymaster_cert_chain_t, CertificateChainDelete> chain(new keymaster_cert_chain_t); 802 if (!chain.get()) 804 memset(chain.get(), 0, sizeof(keymaster_cert_chain_t)); 806 chain->entries = new keymaster_blob_t[kCertificateChainLength]; 807 if (!chain->entries) 810 memset(chain->entries, 0, sizeof(chain->entries[0]) * kCertificateChainLength); 811 chain->entry_count = kCertificateChainLength; 817 chain->entries[entry].data = dup_array(kRsaAttestCert); 818 if (!chain [all...] |
H A D | android_keymaster_test_utils.h | 223 const std::string& attest_app_id, keymaster_cert_chain_t* chain);
|
H A D | android_keymaster_test.cpp | 3410 static bool verify_chain(const keymaster_cert_chain_t& chain) { argument 3411 for (size_t i = 0; i < chain.entry_count - 1; ++i) { 3412 keymaster_blob_t& key_cert_blob = chain.entries[i]; 3413 keymaster_blob_t& signing_cert_blob = chain.entries[i + 1];
|
/system/tools/hidl/test/ |
H A D | hidl_test_client.cpp | 566 EXPECT_OK(service->getHashChain([&] (const auto &chain) { 567 EXPECT_EQ(chain[0].size(), 32u); 568 EXPECT_ARRAYEQ(ihash, chain[0], 32); 570 EXPECT_EQ(chain[chain.size() - 1].size(), managerChain[managerChain.size() - 1].size()); 571 EXPECT_ARRAYEQ(chain[chain.size() - 1], managerChain[managerChain.size() - 1], 572 chain[chain.size() - 1].size()) << "Hash for IBase doesn't match!";
|
/system/security/keystore/ |
H A D | IKeystoreService.cpp | 1325 hidl_vec<hidl_vec<uint8_t>> chain; local 1326 int ret = attestKey(name, params.value(), &chain); 1329 nullable(writeCertificateChainToParcel, chain, reply); 1337 hidl_vec<hidl_vec<uint8_t>> chain; local 1338 int ret = attestDeviceIds(params.value(), &chain); 1341 nullable(writeCertificateChainToParcel, chain, reply);
|