/system/security/keystore/tests/ |
D | auth_token_table_test.cpp | 66 AuthTokenTable table; in TEST() local 99 AuthTokenTable table; in TEST() local 101 table.AddAuthenticationToken(make_token(1, 2)); in TEST() 102 table.AddAuthenticationToken(make_token(3, 4)); in TEST() 103 EXPECT_EQ(2U, table.size()); in TEST() 107 ASSERT_EQ(AuthTokenTable::OK, table.FindAuthorization(make_set(1), KM_PURPOSE_SIGN, 0, &found)); in TEST() 111 ASSERT_EQ(AuthTokenTable::OK, table.FindAuthorization(make_set(2), KM_PURPOSE_SIGN, 0, &found)); in TEST() 115 ASSERT_EQ(AuthTokenTable::OK, table.FindAuthorization(make_set(3), KM_PURPOSE_SIGN, 0, &found)); in TEST() 119 ASSERT_EQ(AuthTokenTable::OK, table.FindAuthorization(make_set(4), KM_PURPOSE_SIGN, 0, &found)); in TEST() 124 table.FindAuthorization(make_set(5), KM_PURPOSE_SIGN, 0, &found)); in TEST() [all …]
|
/system/netd/server/ |
D | RouteController.cpp | 170 void addTableName(uint32_t table, const std::string& name, std::string* contents) { in addTableName() argument 172 snprintf(tableString, sizeof(tableString), "%u", table); in addTableName() 229 uint32_t table, uint32_t fwmark, uint32_t mask, const char* iif, in modifyIpRule() argument 267 if (table == RT_TABLE_UNSPEC && rule.action == FR_ACT_TO_TBL && action != RTM_DELRULE) { in modifyIpRule() 281 { &FRATTR_TABLE, table != RT_TABLE_UNSPEC ? sizeof(FRATTR_TABLE) : 0 }, in modifyIpRule() 282 { &table, table != RT_TABLE_UNSPEC ? sizeof(table) : 0 }, in modifyIpRule() 314 WARN_UNUSED_RESULT int modifyIpRule(uint16_t action, uint32_t priority, uint32_t table, in modifyIpRule() argument 317 return modifyIpRule(action, priority, FR_ACT_TO_TBL, table, fwmark, mask, iif, oif, uidStart, in modifyIpRule() 321 WARN_UNUSED_RESULT int modifyIpRule(uint16_t action, uint32_t priority, uint32_t table, in modifyIpRule() argument 323 return modifyIpRule(action, priority, table, fwmark, mask, IIF_NONE, OIF_NONE, INVALID_UID, in modifyIpRule() [all …]
|
D | Controllers.cpp | 109 const char* table, in findExistingChildChains() argument 126 std::string command = StringPrintf("*%s\n-S %s\nCOMMIT\n", table, parentChain); in findExistingChildChains() 129 ALOGE("Error listing chain %s in table %s\n", parentChain, table); in findExistingChildChains() 148 void Controllers::createChildChains(IptablesTarget target, const char* table, in createChildChains() argument 152 std::string command = StringPrintf("*%s\n", table); in createChildChains() 173 existingChildChains = findExistingChildChains(target, table, parentChain); in createChildChains()
|
D | Controllers.h | 67 const char* table, 69 static void createChildChains(IptablesTarget target, const char* table, const char* parentChain,
|
D | RouteController.h | 105 int modifyIpRoute(uint16_t action, uint32_t table, const char* interface, const char* destination, 107 int flushRoutes(uint32_t table) WARN_UNUSED_RESULT;
|
D | IptablesBaseTest.cpp | 92 const std::string& table, in fakeExecIptablesRestoreCommand() argument 95 std::string fullCmd = StringPrintf("-t %s %s", table.c_str(), command.c_str()); in fakeExecIptablesRestoreCommand()
|
D | NetdConstants.cpp | 54 int execIptablesRestoreCommand(IptablesTarget target, const std::string& table, in execIptablesRestoreCommand() argument 56 std::string fullCmd = android::base::StringPrintf("*%s\n%s\nCOMMIT\n", table.c_str(), in execIptablesRestoreCommand()
|
D | IptablesBaseTest.h | 34 static int fakeExecIptablesRestoreCommand(IptablesTarget target, const std::string& table,
|
/system/tools/aidl/tests/ |
D | test_util.cpp | 71 diff_table_entry table[a_lines.size() + 1][b_lines.size() + 1]; in PrintDiff() local 86 table[i][j].longest_common_subsequence_length = 0; in PrintDiff() 87 table[i][j].propagation_directions = directions; in PrintDiff() 89 table[i][j].longest_common_subsequence_length = in PrintDiff() 90 table[i-1][j-1].longest_common_subsequence_length + 1; in PrintDiff() 91 table[i][j].propagation_directions = UP_LEFT; in PrintDiff() 93 size_t length_up = table[i-1][j].longest_common_subsequence_length; in PrintDiff() 94 size_t length_left = table[i][j-1].longest_common_subsequence_length; in PrintDiff() 108 table[i][j].longest_common_subsequence_length = length; in PrintDiff() 109 table[i][j].propagation_directions = directions; in PrintDiff() [all …]
|
/system/extras/ioshark/ |
D | ioshark_bench_mmap.c | 53 struct mmap_io_ent_tab_s table[MMAP_ENTS + 1]; member 69 mio->table[mio->num_entries].offset = offset; in setup_mmap_io_state() 70 mio->table[mio->num_entries].len = in setup_mmap_io_state() 72 total_len -= mio->table[mio->num_entries].len; in setup_mmap_io_state() 73 offset += mio->table[mio->num_entries].len; in setup_mmap_io_state() 91 if (mio->table[i].len > 0) in mmap_getnext_off_len() 97 iolength = MIN(mio->table[i].len, iolength); in mmap_getnext_off_len() 98 *offset = mio->table[i].offset; in mmap_getnext_off_len() 99 mio->table[i].offset += iolength; in mmap_getnext_off_len() 100 mio->table[i].len -= iolength; in mmap_getnext_off_len()
|
/system/chre/apps/wifi_offload/include/chre/apps/wifi_offload/ |
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 ScanStats {
|
/system/chre/platform/shared/idl/ |
D | host_messages.fbs | 18 table NanoappMessage { 31 table HubInfoRequest {} 32 table HubInfoResponse { 65 table NanoappListRequest {} 67 table NanoappListEntry { 81 table NanoappListResponse { 85 table LoadNanoappRequest { 95 table LoadNanoappResponse { 102 table UnloadNanoappRequest { 112 table UnloadNanoappResponse { [all …]
|
/system/core/fs_mgr/ |
D | fs_mgr_verity.cpp | 116 const char *table, uint32_t table_length) in verify_table() argument 123 SHA256((uint8_t*)table, table_length, hash_buf); in verify_table() 149 verity.table, verity.table_length) == 0 || in verify_verity_signature() 151 verity.table, verity.table_length) == 0) { in verify_verity_signature() 158 static int invalidate_table(char *table, size_t table_length) in invalidate_table() argument 165 if (table[n++] == ' ') { in invalidate_table() 173 while (n < table_length && table[n] != ' ') { in invalidate_table() 174 table[n++] = '0'; in invalidate_table() 186 char *table; member 211 params->table, 1 + VERITY_TABLE_OPT_FEC_ARGS, mode_flag, params->ecc_dev, in format_verity_table() [all …]
|
/system/extras/verity/ |
D | build_verity_metadata.py | 47 def sign_verity_table(table, signer_path, key_path, signer_args=None): argument 50 table_file.write(table) 62 table = "1 %s %s %s %s %s %s sha256 %s %s" 63 table %= ( block_device, 71 return table
|
D | verity_verifier.cpp | 53 const char* table, uint32_t table_length) { in verify_table() argument 56 SHA256(const_cast<uint8_t*>(reinterpret_cast<const uint8_t*>(table)), table_length, hash_buf); in verify_table() 115 verity.table, verity.table_length); in main()
|
/system/extras/libfec/ |
D | fec_verity.cpp | 336 std::unique_ptr<char[]> table(new (std::nothrow) char[size + 1]); in parse_table() local 338 if (!table) { in parse_table() 344 if (!raw_pread(f, table.get(), size, offset)) { in parse_table() 348 } else if (fec_pread(f, table.get(), size, offset) != (ssize_t)size) { in parse_table() 353 table[size] = '\0'; in parse_table() 354 debug("verity table: '%s'", table.get()); in parse_table() 360 auto tokens = android::base::Split(table.get(), " "); in parse_table() 450 if (v->table) { in parse_table() 451 delete[] v->table; in parse_table() 452 v->table = NULL; in parse_table() [all …]
|
D | fec_open.cpp | 427 if (f->verity.table) { in fec_close() 428 delete[] f->verity.table; in fec_close() 453 check(f->verity.table); in fec_verity_get_metadata() 461 data->table = f->verity.table; in fec_verity_get_metadata()
|
/system/chre/host/common/include/chre_host/ |
D | host_messages_generated.h | 182 flatbuffers::NativeTable *table; 184 ChreMessageUnion() : type(ChreMessage::NONE), table(nullptr) {} 186 type(std::move(u.type)), table(std::move(u.table)) {} 198 table = new T(std::forward<T>(value)); 207 reinterpret_cast<NanoappMessageT *>(table) : nullptr; 211 reinterpret_cast<HubInfoRequestT *>(table) : nullptr; 215 reinterpret_cast<HubInfoResponseT *>(table) : nullptr; 219 reinterpret_cast<NanoappListRequestT *>(table) : nullptr; 223 reinterpret_cast<NanoappListResponseT *>(table) : nullptr; 227 reinterpret_cast<LoadNanoappRequestT *>(table) : nullptr; [all …]
|
/system/sepolicy/tools/ |
D | sepolicy-check.c | 131 src = hashtab_search(policy->p_types.table, s); in check_rule() 138 tgt = hashtab_search(policy->p_types.table, t); in check_rule() 145 cls = hashtab_search(policy->p_classes.table, c); in check_rule() 152 perm = hashtab_search(cls->permissions.table, p); in check_rule() 158 perm = hashtab_search(cls->comdatum->permissions.table, p); in check_rule()
|
/system/sepolicy/tools/sepolicy-analyze/ |
D | attribute.c | 34 dat = hashtab_search(policydb->p_types.table, name); in list_attribute() 71 return hashtab_map(policydb->p_types.table, print_attr, policydb); in list_all_attributes()
|
D | booleans.c | 21 return hashtab_map(policydb->p_bools.table, list_booleans, NULL); in booleans_func()
|
D | neverallow.c | 113 type = hashtab_search(policydb->p_types.table, id); in read_typeset() 247 cls = hashtab_search(policydb->p_classes.table, id); in read_classperms() 333 perm = hashtab_search(cls->permissions.table, id); in read_classperms() 335 perm = hashtab_search(cls->comdatum->permissions.table, id); in read_classperms()
|
/system/vold/ |
D | Disk.cpp | 314 Table table = Table::kUnknown; in readPartitions() local 324 table = Table::kMbr; in readPartitions() 326 table = Table::kGpt; in readPartitions() 338 if (table == Table::kMbr) { in readPartitions() 349 } else if (table == Table::kGpt) { in readPartitions() 363 if (table == Table::kUnknown || !foundParts) { in readPartitions()
|
/system/update_engine/payload_generator/ |
D | inplace_generator.cc | 238 const vector<vector<Vertex::Index>::size_type>& table) in SortCutsByTopoOrderLess() argument 239 : table_(table) {} in SortCutsByTopoOrderLess() 252 vector<vector<Vertex::Index>::size_type> table(op_indexes.size()); in GenerateReverseTopoOrderMap() local 256 if (table.size() < (node + 1)) { in GenerateReverseTopoOrderMap() 257 table.resize(node + 1); in GenerateReverseTopoOrderMap() 259 table[node] = i; in GenerateReverseTopoOrderMap() 261 reverse_op_indexes->swap(table); in GenerateReverseTopoOrderMap() 268 vector<vector<Vertex::Index>::size_type> table; in SortCutsByTopoOrder() local 269 GenerateReverseTopoOrderMap(op_indexes, &table); in SortCutsByTopoOrder() 270 SortCutsByTopoOrderLess less(table); in SortCutsByTopoOrder()
|
/system/extras/simpleperf/ |
D | report_sample.proto | 31 // If the function name is found, it is a valid index in the symbol table 58 // symbol table of the file.
|