| /system/security/keystore/tests/ |
| D | auth_token_table_test.cpp | 62 AuthTokenTable table; in TEST() local
93 AuthTokenTable table; in TEST() local
95 table.AddAuthenticationToken(make_token(1, 2)); in TEST()
96 table.AddAuthenticationToken(make_token(3, 4)); in TEST()
97 EXPECT_EQ(2U, table.size()); in TEST()
102 table.FindAuthorization(make_set(1), KeyPurpose::SIGN, 0, &found)); in TEST()
107 table.FindAuthorization(make_set(2), KeyPurpose::SIGN, 0, &found)); in TEST()
112 table.FindAuthorization(make_set(3), KeyPurpose::SIGN, 0, &found)); in TEST()
117 table.FindAuthorization(make_set(4), KeyPurpose::SIGN, 0, &found)); in TEST()
122 table.FindAuthorization(make_set(5), KeyPurpose::SIGN, 0, &found)); in TEST()
[all …]
|
| /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/netd/server/ |
| D | RouteController.cpp | 174 void addTableName(uint32_t table, const std::string& name, std::string* contents) { in addTableName() argument
176 snprintf(tableString, sizeof(tableString), "%u", table); in addTableName()
234 uint32_t table, uint32_t fwmark, uint32_t mask, const char* iif, in modifyIpRule() argument
272 if (table == RT_TABLE_UNSPEC && rule.action == FR_ACT_TO_TBL && action != RTM_DELRULE) { in modifyIpRule()
286 { &FRATTR_TABLE, table != RT_TABLE_UNSPEC ? sizeof(FRATTR_TABLE) : 0 }, in modifyIpRule()
287 { &table, table != RT_TABLE_UNSPEC ? sizeof(table) : 0 }, in modifyIpRule()
319 WARN_UNUSED_RESULT int modifyIpRule(uint16_t action, uint32_t priority, uint32_t table, in modifyIpRule() argument
322 return modifyIpRule(action, priority, FR_ACT_TO_TBL, table, fwmark, mask, iif, oif, uidStart, in modifyIpRule()
326 WARN_UNUSED_RESULT int modifyIpRule(uint16_t action, uint32_t priority, uint32_t table, in modifyIpRule() argument
328 return modifyIpRule(action, priority, table, fwmark, mask, IIF_NONE, OIF_NONE, INVALID_UID, in modifyIpRule()
[all …]
|
| D | Controllers.cpp | 110 const char* table, in findExistingChildChains() argument
127 std::string command = StringPrintf("*%s\n-S %s\nCOMMIT\n", table, parentChain); in findExistingChildChains()
130 ALOGE("Error listing chain %s in table %s\n", parentChain, table); in findExistingChildChains()
149 void Controllers::createChildChains(IptablesTarget target, const char* table, in createChildChains() argument
153 std::string command = StringPrintf("*%s\n", table); in createChildChains()
174 existingChildChains = findExistingChildChains(target, table, parentChain); in createChildChains()
|
| D | Controllers.h | 69 const char* table,
71 static void createChildChains(IptablesTarget target, const char* table, const char* parentChain,
|
| D | RouteController.h | 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;
|
| 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()
|
| /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/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/libvintf/ |
| D | main.cpp | 189 void insert(const HalManifest* manifest, Table* table, const RowMutator& mutate) { in insert() argument
194 mutate(&(*table)[key]); in insert()
199 void insert(const CompatibilityMatrix* matrix, Table* table, const RowMutator& mutate) { in insert() argument
209 auto it = table->find(key); in insert()
210 if (it == table->end()) { in insert()
211 mutate(&(*table)[key]); in insert()
225 Table table; in generateHalSummary() local
226 insert(vm, &table, [](auto* row) { row->dm = true; }); in generateHalSummary()
227 insert(fm, &table, [](auto* row) { row->fm = true; }); in generateHalSummary()
228 insert(vcm, &table, [](auto* row) { row->dcm = true; }); in generateHalSummary()
[all …]
|
| /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 {
108 table LoadNanoappRequest {
125 table LoadNanoappResponse {
139 table UnloadNanoappRequest {
149 table UnloadNanoappResponse {
[all …]
|
| /system/extras/verity/ |
| D | build_verity_metadata.py | 49 def sign_verity_table(table, signer_path, key_path, signer_args=None): argument
52 table_file.write(table)
64 table = "1 %s %s %s %s %s %s sha256 %s %s"
65 table %= ( block_device,
73 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/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/chre/host/common/include/chre_host/ |
| D | host_messages_generated.h | 200 flatbuffers::NativeTable *table;
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) : nullptr;
245 reinterpret_cast<LoadNanoappRequestT *>(table) : nullptr;
[all …]
|
| /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()
|
| /system/vold/model/ |
| D | Disk.cpp | 334 Table table = Table::kUnknown; in readPartitions() local
344 table = Table::kMbr; in readPartitions()
346 table = Table::kGpt; in readPartitions()
362 if (table == Table::kMbr) { in readPartitions()
379 } else if (table == Table::kGpt) { in readPartitions()
395 if (table == Table::kUnknown || !foundParts) { in readPartitions()
|
| /system/extras/simpleperf/scripts/ |
| D | report_html.js | 203 let table = new google.visualization.Table(this.div.get(0));
204 table.draw(data, {
316 let table = new google.visualization.Table(wrapperDiv.get(0));
317 table.draw(data, {
551 let table = this.div.find(`table#${tableId}`).dataTable({
558 table.find('tr').css('cursor', 'pointer');
559 table.on('click', 'tr', function() {
687 let table = new google.visualization.Table(wrapperDiv.get(0));
688 table.draw(data, {
1203 let table = new google.visualization.Table(wrapperDiv.get(0));
[all …]
|
| /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/core/property_service/property_info_checker/ |
| D | property_info_checker.cpp | 79 reinterpret_cast<type_datum*>(hashtab_search(policy_db_->p_types.table, "property_type")); in Initialize()
107 reinterpret_cast<type_datum*>(hashtab_search(policy_db_->p_types.table, context_type)); in CheckContext()
|