Home
last modified time | relevance | path

Searched refs:table (Results 1 – 25 of 45) sorted by relevance

12

/system/security/keystore/tests/
Dauth_token_table_test.cpp66 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/tools/aidl/tests/
Dtest_util.cpp71 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/connectivity/shill/
Drouting_table_entry.h40 table(RT_TABLE_MAIN), in RoutingTableEntry()
55 table(RT_TABLE_MAIN), in RoutingTableEntry()
71 table(RT_TABLE_MAIN), in RoutingTableEntry()
88 table(table_in), in RoutingTableEntry()
98 table(b.table), in RoutingTableEntry()
108 table = b.table;
123 table == b.table && in Equals()
133 unsigned char table; member
Dmock_routing_table.h42 uint8_t table));
46 uint8_t table));
50 uint8_t table));
54 uint8_t table));
64 uint8_t table));
Drouting_table.cc133 Tables::iterator table = tables_.find(interface_index); in GetDefaultRouteInternal() local
134 if (table == tables_.end()) { in GetDefaultRouteInternal()
139 for (auto& nent : table->second) { in GetDefaultRouteInternal()
242 auto table = tables_.find(interface_index); in FlushRoutes() local
243 if (table == tables_.end()) { in FlushRoutes()
247 for (const auto& nent : table->second) { in FlushRoutes()
250 table->second.clear(); in FlushRoutes()
256 for (auto& table : tables_) { in FlushRoutesWithTag() local
257 for (auto nent = table.second.begin(); nent != table.second.end();) { in FlushRoutesWithTag()
259 ApplyRoute(table.first, *nent, RTNLMessage::kModeDelete, 0); in FlushRoutesWithTag()
[all …]
/system/netd/server/
DRouteController.cpp150 void addTableName(uint32_t table, const std::string& name, std::string* contents) { in addTableName() argument
152 snprintf(tableString, sizeof(tableString), "%u", table); in addTableName()
266 uint32_t table, uint32_t fwmark, uint32_t mask, const char* iif, in modifyIpRule() argument
304 if (table == RT_TABLE_UNSPEC && rule.action == FR_ACT_TO_TBL && action != RTM_DELRULE) { in modifyIpRule()
317 { &FRATTR_TABLE, table != RT_TABLE_UNSPEC ? sizeof(FRATTR_TABLE) : 0 }, in modifyIpRule()
318 { &table, table != RT_TABLE_UNSPEC ? sizeof(table) : 0 }, in modifyIpRule()
346 WARN_UNUSED_RESULT int modifyIpRule(uint16_t action, uint32_t priority, uint32_t table, in modifyIpRule() argument
349 return modifyIpRule(action, priority, FR_ACT_TO_TBL, table, fwmark, mask, iif, oif, uidStart, in modifyIpRule()
353 WARN_UNUSED_RESULT int modifyIpRule(uint16_t action, uint32_t priority, uint32_t table, in modifyIpRule() argument
355 return modifyIpRule(action, priority, table, fwmark, mask, IIF_NONE, OIF_NONE, INVALID_UID, in modifyIpRule()
[all …]
/system/extras/tests/net_test/
Diproute.py318 def _Rule(self, version, is_add, rule_type, table, match_nlattr, priority): argument
341 if table:
342 rtmsg += self._NlAttrU32(FRA_TABLE, table)
362 def FwmarkRule(self, version, is_add, fwmark, table, priority): argument
364 return self._Rule(version, is_add, RTN_UNICAST, table, nlattr, priority)
366 def IifRule(self, version, is_add, iif, table, priority): argument
368 return self._Rule(version, is_add, RTN_UNICAST, table, nlattr, priority)
370 def OifRule(self, version, is_add, oif, table, priority): argument
372 return self._Rule(version, is_add, RTN_UNICAST, table, nlattr, priority)
374 def UidRangeRule(self, version, is_add, start, end, table, priority): argument
[all …]
Dmultinetwork_base.py267 table = cls._TableForNetid(netid)
272 cls.iproute.UidRangeRule(version, is_add, start, end, table,
274 cls.iproute.OifRule(version, is_add, iface, table, cls.PRIORITY_OIF)
275 cls.iproute.FwmarkRule(version, is_add, netid, table,
293 cls.iproute.AddRoute(version, table, "default", 0, router, ifindex)
295 cls.iproute.AddRoute(version, table,
299 cls.iproute.DelRoute(version, table, "default", 0, router, ifindex)
301 cls.iproute.DelRoute(version, table,
309 table = cls._TableForNetid(netid) if netid else None
311 is_add = table is not None
[all …]
/system/extras/verity/
Dbuild_verity_metadata.py30 def sign_verity_table(table, signer_path, key_path): argument
33 table_file.write(table)
41 table = "1 %s %s %s %s %s %s sha256 %s %s"
42 table %= ( block_device,
50 return table
DVerityVerifier.java46 private byte[] table; field in VerityVerifier
217 private void readHashTree(RandomAccessFile img, byte[] table) in readHashTree() argument
219 String tableStr = new String(table); in readHashTree()
287 table = new byte[tableSize]; in readVerityData()
288 img.readFully(table); in readVerityData()
290 readHashTree(img, table); in readVerityData()
301 return Utils.verify(key, table, signature, in verifyMetaData()
/system/core/fs_mgr/
Dfs_mgr_verity.cpp119 static int verify_table(const uint8_t *signature, const char *table, in verify_table() argument
127 SHA256_hash((uint8_t*)table, table_length, hash_buf); in verify_table()
155 if (verify_table(verity.signature, verity.table, in verify_verity_signature()
157 verify_table(verity.ecc_signature, verity.table, in verify_verity_signature()
165 static int invalidate_table(char *table, size_t table_length) in invalidate_table() argument
172 if (table[n++] == ' ') { in invalidate_table()
180 while (n < table_length && table[n] != ' ') { in invalidate_table()
181 table[n++] = '0'; in invalidate_table()
232 const char *table; member
257 params->table, 1 + VERITY_TABLE_OPT_FEC_ARGS, mode_flag, params->ecc_dev, in format_verity_table()
[all …]
/system/extras/libfec/
Dfec_verity.cpp331 std::unique_ptr<char[]> table(new (std::nothrow) char[size + 1]); in parse_table() local
333 if (!table) { in parse_table()
338 if (fec_pread(f, table.get(), size, offset) != (ssize_t)size) { in parse_table()
343 table[size] = '\0'; in parse_table()
344 debug("verity table: '%s'", table.get()); in parse_table()
350 auto tokens = android::base::Split(table.get(), " "); in parse_table()
434 v->table = table.release(); in parse_table()
475 check(v->table); in rewrite_metadata()
476 size_t len = strlen(v->table); in rewrite_metadata()
479 memcpy(metadata.get() + sizeof(v->header), v->table, len); in rewrite_metadata()
Dfec_open.cpp433 if (f->verity.table) { in fec_close()
434 delete[] f->verity.table; in fec_close()
459 check(f->verity.table); in fec_verity_get_metadata()
467 data->table = f->verity.table; in fec_verity_get_metadata()
/system/sepolicy/tools/
Dsepolicy-check.c131 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()
Dcheckfc.c66 struct type_datum *attr = hashtab_search(policydb->p_types.table, (char *)attr_name); in get_attr_bit()
104 struct type_datum *type = hashtab_search(policydb->p_types.table, (char *)type_name); in is_type_of_attribute_set()
/system/vold/
DDisk.cpp305 Table table = Table::kUnknown; in readPartitions() local
315 table = Table::kMbr; in readPartitions()
317 table = Table::kGpt; in readPartitions()
329 if (table == Table::kMbr) { in readPartitions()
340 } else if (table == Table::kGpt) { in readPartitions()
354 if (table == Table::kUnknown || !foundParts) { in readPartitions()
/system/connectivity/shill/net/
Drtnl_message.h92 table(0), in RouteStatus()
106 table(table_in), in RouteStatus()
113 unsigned char table; member
Drtnl_message_unittest.cc460 unsigned char table, in TestParseRoute() argument
473 EXPECT_EQ(table, status.table); in TestParseRoute()
/system/sepolicy/tools/sepolicy-analyze/
Dbooleans.c21 return hashtab_map(policydb->p_bools.table, list_booleans, NULL); in booleans_func()
Dattribute.c13 attr = hashtab_search(policydb->p_types.table, name); in list_attribute()
Dneverallow.c113 type = hashtab_search(policydb->p_types.table, id); in read_typeset()
250 cls = hashtab_search(policydb->p_classes.table, id); in read_classperms()
336 perm = hashtab_search(cls->permissions.table, id); in read_classperms()
338 perm = hashtab_search(cls->comdatum->permissions.table, id); in read_classperms()
/system/update_engine/payload_generator/
Dinplace_generator.cc238 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/libmincrypt/
Dp256_ec.c988 static void select_affine_point(felem out_x, felem out_y, const limb* table, in select_affine_point() argument
1001 for (j = 0; j < NLIMBS; j++, table++) { in select_affine_point()
1002 out_x[j] |= *table & mask; in select_affine_point()
1004 for (j = 0; j < NLIMBS; j++, table++) { in select_affine_point()
1005 out_y[j] |= *table & mask; in select_affine_point()
1013 const limb* table, limb index) { in select_jacobian_point() argument
1022 table += 3 * NLIMBS; in select_jacobian_point()
1031 for (j = 0; j < NLIMBS; j++, table++) { in select_jacobian_point()
1032 out_x[j] |= *table & mask; in select_jacobian_point()
1034 for (j = 0; j < NLIMBS; j++, table++) { in select_jacobian_point()
[all …]
/system/sepolicy/
Dnet.te15 # See changes to the routing table.
/system/media/camera/docs/
Dhtml.mako40 /* table column sizes */
41 table { border-collapse:collapse; table-layout: fixed; width: 100%; word-wrap: break-word }
197 <table class="properties">
392 </table>

12