/system/security/keystore/tests/ |
H A D | auth_token_table_test.cpp | 62 AuthTokenTable table; local 93 AuthTokenTable table; local 95 table.AddAuthenticationToken(make_token(1, 2)); 96 table.AddAuthenticationToken(make_token(3, 4)); 97 EXPECT_EQ(2U, table.size()); 102 table.FindAuthorization(make_set(1), KeyPurpose::SIGN, 0, &found)); 107 table.FindAuthorization(make_set(2), KeyPurpose::SIGN, 0, &found)); 112 table.FindAuthorization(make_set(3), KeyPurpose::SIGN, 0, &found)); 117 table.FindAuthorization(make_set(4), KeyPurpose::SIGN, 0, &found)); 122 table 239 AuthTokenTable table; local 248 AuthTokenTable table; local 265 AuthTokenTable table; local 275 AuthTokenTable table; local 312 AuthTokenTable table; local 318 AuthTokenTable table; local [all...] |
/system/chre/apps/wifi_offload/include/chre/apps/wifi_offload/ |
H A D | flatbuffers_types.fbs | 20 table Ssid { 28 table PreferredNetwork { 38 table ScanResult { 51 table ScanResultMessage { 58 table ScanParams { 68 table ScanFilter { 76 table ScanConfig { 84 table ScanRecord { 96 table RpcLogRecord { 104 table ScanStat [all...] |
/system/tools/aidl/tests/ |
H A D | test_util.cpp | 71 diff_table_entry table[a_lines.size() + 1][b_lines.size() + 1]; local 86 table[i][j].longest_common_subsequence_length = 0; 87 table[i][j].propagation_directions = directions; 89 table[i][j].longest_common_subsequence_length = 90 table[i-1][j-1].longest_common_subsequence_length + 1; 91 table[i][j].propagation_directions = UP_LEFT; 93 size_t length_up = table[i-1][j].longest_common_subsequence_length; 94 size_t length_left = table[i][j-1].longest_common_subsequence_length; 108 table[i][j].longest_common_subsequence_length = length; 109 table[ [all...] |
/system/netd/server/ |
H A D | RouteController.cpp | 174 void addTableName(uint32_t table, const std::string& name, std::string* contents) { argument 176 snprintf(tableString, sizeof(tableString), "%u", table); 223 // + If |table| is non-zero, the rule points at the specified routing table. Otherwise, the table is 224 // unspecified. An unspecified table is not allowed when creating an FR_ACT_TO_TBL rule. 234 uint32_t table, uint32_t fwmark, uint32_t mask, const char* iif, 265 // Note that here we're implicitly setting rule.table to 0. When we want to specify a 266 // non-zero table, we do this via the FRATTR_TABLE attribute. 269 // Don't ever create a rule that looks up table 233 modifyIpRule(uint16_t action, uint32_t priority, uint8_t ruleType, uint32_t table, uint32_t fwmark, uint32_t mask, const char* iif, const char* oif, uid_t uidStart, uid_t uidEnd) argument 319 modifyIpRule(uint16_t action, uint32_t priority, uint32_t table, uint32_t fwmark, uint32_t mask, const char* iif, const char* oif, uid_t uidStart, uid_t uidEnd) argument 326 modifyIpRule(uint16_t action, uint32_t priority, uint32_t table, uint32_t fwmark, uint32_t mask) argument 334 modifyIpRoute(uint16_t action, uint32_t table, const char* interface, const char* destination, const char* nexthop) argument 472 modifyVpnUidRangeRule(uint32_t table, uid_t uidStart, uid_t uidEnd, bool secure, bool add) argument 500 modifyVpnSystemPermissionRule(unsigned netId, uint32_t table, bool secure, bool add) argument 524 modifyExplicitNetworkRule(unsigned netId, uint32_t table, Permission permission, uid_t uidStart, uid_t uidEnd, bool add) argument 547 modifyOutputInterfaceRules(const char* interface, uint32_t table, Permission permission, uid_t uidStart, uid_t uidEnd, bool add) argument 576 modifyImplicitNetworkRule(unsigned netId, uint32_t table, bool add) argument 602 uint32_t table = getRouteTableForInterface(physicalInterface); local 669 uint32_t table = getRouteTableForInterface(interface); local 720 uint32_t table = getRouteTableForInterface(interface); local 785 uint32_t table = getRouteTableForInterface(interface); local 823 uint32_t table = getRouteTableForInterface(interface); local 844 uint32_t table = getRouteTableForInterface(outputInterface); local 858 uint32_t table; local 920 flushRoutes(uint32_t table) argument 932 uint32_t table = getRouteTableForInterfaceLocked(interface); local [all...] |
H A D | Controllers.h | 69 const char* table, 71 static void createChildChains(IptablesTarget target, const char* table, const char* parentChain,
|
H A D | Controllers.cpp | 110 const char* table, 127 std::string command = StringPrintf("*%s\n-S %s\nCOMMIT\n", table, parentChain); 130 ALOGE("Error listing chain %s in table %s\n", parentChain, table); 149 void Controllers::createChildChains(IptablesTarget target, const char* table, argument 153 std::string command = StringPrintf("*%s\n", table); 174 existingChildChains = findExistingChildChains(target, table, parentChain); 109 findExistingChildChains(const IptablesTarget target, const char* table, const char* parentChain) argument
|
H A D | RouteController.h | 34 // How the routing table number is determined for route modification requests. 36 INTERFACE, // Compute the table number based on the interface index. 37 LOCAL_NETWORK, // A fixed table used for routes to directly-connected clients/peers. 38 LEGACY_NETWORK, // Use a fixed table that's used to override the default network. 39 LEGACY_SYSTEM, // A fixed table, only modifiable by system apps; overrides VPNs too. 120 static int flushRoutes(uint32_t table); 141 int modifyIpRoute(uint16_t action, uint32_t table, const char* interface, const char* destination, 143 int flushRoutes(uint32_t table) WARN_UNUSED_RESULT;
|
H A D | IptablesBaseTest.cpp | 92 const std::string& table, 95 std::string fullCmd = StringPrintf("-t %s %s", table.c_str(), command.c_str()); 91 fakeExecIptablesRestoreCommand(IptablesTarget target, const std::string& table, const std::string& command, std::string *output) argument
|
H A D | IptablesBaseTest.h | 34 static int fakeExecIptablesRestoreCommand(IptablesTarget target, const std::string& table,
|
H A D | NetdConstants.h | 46 int execIptablesRestoreCommand(IptablesTarget target, const std::string& table,
|
H A D | NetdConstants.cpp | 54 int execIptablesRestoreCommand(IptablesTarget target, const std::string& table, argument 56 std::string fullCmd = android::base::StringPrintf("*%s\n%s\nCOMMIT\n", table.c_str(),
|
/system/sepolicy/tools/sepolicy-analyze/ |
H A D | booleans.c | 21 return hashtab_map(policydb->p_bools.table, list_booleans, NULL);
|
H A D | attribute.c | 34 dat = hashtab_search(policydb->p_types.table, name); 71 return hashtab_map(policydb->p_types.table, print_attr, policydb);
|
/system/core/fs_mgr/ |
H A D | fs_mgr_verity.cpp | 116 const char *table, uint32_t table_length) 122 // Hash the table 123 SHA256((uint8_t*)table, table_length, hash_buf); 135 LERROR << "Couldn't verify table"; 149 verity.table, verity.table_length) == 0 || 151 verity.table, verity.table_length) == 0) { 158 static int invalidate_table(char *table, size_t table_length) argument 165 if (table[n++] == ' ') { 173 while (n < table_length && table[n] != ' ') { 174 table[ 115 verify_table(const uint8_t *signature, size_t signature_size, const char *table, uint32_t table_length) argument 186 char *table; member in struct:verity_table_params 707 update_verity_table_blk_device(const std::string& blk_device, char** table, bool slot_select) argument [all...] |
/system/extras/ioshark/ |
H A D | ioshark_bench_mmap.c | 53 struct mmap_io_ent_tab_s table[MMAP_ENTS + 1]; member in struct:mmap_io_ent_s 69 mio->table[mio->num_entries].offset = offset; 70 mio->table[mio->num_entries].len = 72 total_len -= mio->table[mio->num_entries].len; 73 offset += mio->table[mio->num_entries].len; 91 if (mio->table[i].len > 0) 97 iolength = MIN(mio->table[i].len, iolength); 98 *offset = mio->table[i].offset; 99 mio->table[i].offset += iolength; 100 mio->table[ [all...] |
/system/libvintf/ |
H A D | main.cpp | 187 // Insert each fqInstanceName foo@x.y::IFoo/instance to the table by inserting the key 189 void insert(const HalManifest* manifest, Table* table, const RowMutator& mutate) { argument 194 mutate(&(*table)[key]); 199 void insert(const CompatibilityMatrix* matrix, Table* table, const RowMutator& mutate) { argument 209 auto it = table->find(key); 210 if (it == table->end()) { 211 mutate(&(*table)[key]); 225 Table table; local 226 insert(vm, &table, [](auto* row) { row->dm = true; }); 227 insert(fm, &table, [](aut 261 auto table = generateHalSummary(vm.get(), fm.get(), vcm.get(), fcm.get()); local [all...] |
/system/extras/verity/ |
H A D | build_verity_metadata.py | 49 def sign_verity_table(table, signer_path, key_path, signer_args=None): 50 with tempfile.NamedTemporaryFile(suffix='.table') as table_file: 52 table_file.write(table) 64 table = "1 %s %s %s %s %s %s sha256 %s %s" 65 table %= ( block_device, 73 return table 78 # build the verity table 80 # build the verity table signature
|
H A D | verity_verifier.cpp | 53 const char* table, uint32_t table_length) { 54 // Hash the table 56 SHA256(const_cast<uint8_t*>(reinterpret_cast<const uint8_t*>(table)), table_length, hash_buf); 67 fprintf(stderr, "Couldn't verify table\n"); 115 verity.table, verity.table_length); 52 verify_table(const char* key_path, const uint8_t* signature, size_t signature_size, const char* table, uint32_t table_length) argument
|
/system/extras/libfec/ |
H A D | fec_verity.cpp | 324 /* reads, corrects and parses the verity table, validates parameters, and if 336 std::unique_ptr<char[]> table(new (std::nothrow) char[size + 1]); 338 if (!table) { 344 if (!raw_pread(f, table.get(), size, offset)) { 345 error("failed to read verity table: %s", strerror(errno)); 348 } else if (fec_pread(f, table.get(), size, offset) != (ssize_t)size) { 349 error("failed to ecc read verity table: %s", strerror(errno)); 353 table[size] = '\0'; 354 debug("verity table: '%s'", table [all...] |
H A D | fec_open.cpp | 427 if (f->verity.table) { 428 delete[] f->verity.table; 453 check(f->verity.table); 461 data->table = f->verity.table;
|
/system/sepolicy/tools/ |
H A D | sepolicy-check.c | 131 src = hashtab_search(policy->p_types.table, s); 138 tgt = hashtab_search(policy->p_types.table, t); 145 cls = hashtab_search(policy->p_classes.table, c); 152 perm = hashtab_search(cls->permissions.table, p); 158 perm = hashtab_search(cls->comdatum->permissions.table, p);
|
/system/chre/host/common/include/chre_host/ |
H A D | host_messages_generated.h | 200 flatbuffers::NativeTable *table; member in struct:chre::fbs::ChreMessage::ChreMessageUnion 202 ChreMessageUnion() : type(ChreMessage::NONE), table(nullptr) {} 204 type(std::move(u.type)), table(std::move(u.table)) {} 216 table = new T(std::forward<T>(value)); 225 reinterpret_cast<NanoappMessageT *>(table) : nullptr; 229 reinterpret_cast<HubInfoRequestT *>(table) : nullptr; 233 reinterpret_cast<HubInfoResponseT *>(table) : nullptr; 237 reinterpret_cast<NanoappListRequestT *>(table) : nullptr; 241 reinterpret_cast<NanoappListResponseT *>(table) [all...] |
/system/vold/model/ |
H A D | Disk.cpp | 315 // Parse partition table 334 Table table = Table::kUnknown; local 344 table = Table::kMbr; 346 table = Table::kGpt; 348 LOG(WARNING) << "Invalid partition table " << *it; 362 if (table == Table::kMbr) { 379 } else if (table == Table::kGpt) { 395 if (table == Table::kUnknown || !foundParts) { 396 LOG(WARNING) << mId << " has unknown partition table; trying entire device"; 427 // First nuke any existing partition table [all...] |
/system/core/property_service/property_info_checker/ |
H A D | property_info_checker.cpp | 79 reinterpret_cast<type_datum*>(hashtab_search(policy_db_->p_types.table, "property_type")); 107 reinterpret_cast<type_datum*>(hashtab_search(policy_db_->p_types.table, context_type));
|
/system/extras/simpleperf/scripts/ |
H A D | report_html.js | 180 // Draw a table of 'Name', 'Value'. 203 let table = new google.visualization.Table(this.div.get(0)); 204 table.draw(data, { 291 // Draw a table of 'Name', 'Event Count'. 316 let table = new google.visualization.Table(wrapperDiv.get(0)); 317 table.draw(data, { 514 // Draw a table of 'Total', 'Self', 'Samples', 'Process', 'Thread', 'Library', 'Function'. 518 this.div.append(getHtml('p', {text: `Sample table for event ${eventInfo.eventName}, ` + 524 let tableStr = openHtml('table', {id: tableId, cellspacing: '0', width: '100%'}) + 549 tableStr += closeHtml('tbody') + closeHtml('table'); [all...] |