/system/security/keystore/tests/ |
H A D | auth_token_table_test.cpp | 66 AuthTokenTable table; local 99 AuthTokenTable table; local 101 table.AddAuthenticationToken(make_token(1, 2)); 102 table.AddAuthenticationToken(make_token(3, 4)); 103 EXPECT_EQ(2U, table.size()); 107 ASSERT_EQ(AuthTokenTable::OK, table.FindAuthorization(make_set(1), KM_PURPOSE_SIGN, 0, &found)); 111 ASSERT_EQ(AuthTokenTable::OK, table.FindAuthorization(make_set(2), KM_PURPOSE_SIGN, 0, &found)); 115 ASSERT_EQ(AuthTokenTable::OK, table.FindAuthorization(make_set(3), KM_PURPOSE_SIGN, 0, &found)); 119 ASSERT_EQ(AuthTokenTable::OK, table.FindAuthorization(make_set(4), KM_PURPOSE_SIGN, 0, &found)); 124 table 224 AuthTokenTable table; local 234 AuthTokenTable table; local 251 AuthTokenTable table; local 261 AuthTokenTable table; local 298 AuthTokenTable table; local 304 AuthTokenTable table; local [all...] |
/system/connectivity/shill/ |
H A D | routing_table_entry.h | 26 // Holds table entries for routing. These are held in an STL vector 40 table(RT_TABLE_MAIN), 55 table(RT_TABLE_MAIN), 71 table(RT_TABLE_MAIN), 88 table(table_in), 98 table(b.table), 108 table = b.table; 123 table 133 unsigned char table; member in struct:shill::RoutingTableEntry [all...] |
H A D | mock_routing_table.h | 42 uint8_t table)); 46 uint8_t table)); 50 uint8_t table)); 54 uint8_t table)); 64 uint8_t table));
|
H A D | routing_table.cc | 133 Tables::iterator table = tables_.find(interface_index); local 134 if (table == tables_.end()) { 135 SLOG(this, 2) << __func__ << " no table"; 139 for (auto& nent : table->second) { 242 auto table = tables_.find(interface_index); local 243 if (table == tables_.end()) { 247 for (const auto& nent : table->second) { 250 table->second.clear(); 256 for (auto& table : tables_) { 257 for (auto nent = table 400 TableEntryVector& table = tables_[interface_index]; local [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/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 | 13 attr = hashtab_search(policydb->p_types.table, name);
|
H A D | neverallow.c | 113 type = hashtab_search(policydb->p_types.table, id); 250 cls = hashtab_search(policydb->p_classes.table, id); 336 perm = hashtab_search(cls->permissions.table, id); 338 perm = hashtab_search(cls->comdatum->permissions.table, id);
|
/system/netd/server/ |
H A D | RouteController.cpp | 150 void addTableName(uint32_t table, const std::string& name, std::string* contents) { argument 152 snprintf(tableString, sizeof(tableString), "%u", table); 255 // + If |table| is non-zero, the rule points at the specified routing table. Otherwise, the table is 256 // unspecified. An unspecified table is not allowed when creating an FR_ACT_TO_TBL rule. 266 uint32_t table, uint32_t fwmark, uint32_t mask, const char* iif, 297 // Note that here we're implicitly setting rule.table to 0. When we want to specify a 298 // non-zero table, we do this via the FRATTR_TABLE attribute. 301 // Don't ever create a rule that looks up table 265 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 346 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 353 modifyIpRule(uint16_t action, uint32_t priority, uint32_t table, uint32_t fwmark, uint32_t mask) argument 361 modifyIpRoute(uint16_t action, uint32_t table, const char* interface, const char* destination, const char* nexthop) argument 490 modifyVpnUidRangeRule(uint32_t table, uid_t uidStart, uid_t uidEnd, bool secure, bool add) argument 518 modifyVpnSystemPermissionRule(unsigned netId, uint32_t table, bool secure, bool add) argument 542 modifyExplicitNetworkRule(unsigned netId, uint32_t table, Permission permission, uid_t uidStart, uid_t uidEnd, bool add) argument 565 modifyOutputInterfaceRules(const char* interface, uint32_t table, Permission permission, uid_t uidStart, uid_t uidEnd, bool add) argument 593 modifyImplicitNetworkRule(unsigned netId, uint32_t table, Permission permission, bool add) argument 619 uint32_t table = getRouteTableForInterface(physicalInterface); local 685 uint32_t table = getRouteTableForInterface(interface); local 753 uint32_t table = getRouteTableForInterface(interface); local 793 uint32_t table = getRouteTableForInterface(interface); local 830 uint32_t table = getRouteTableForInterface(interface); local 850 uint32_t table = getRouteTableForInterface(outputInterface); local 881 uint32_t table; local 915 uint32_t table = getRouteTableForInterface(interface); local [all...] |
/system/extras/verity/ |
H A D | build_verity_metadata.py | 45 def sign_verity_table(table, signer_path, key_path, signer_args=None): 49 with tempfile.NamedTemporaryFile(suffix='.table') as table_file: 51 table_file.write(table) 60 table = "1 %s %s %s %s %s %s sha256 %s %s" 61 table %= ( block_device, 69 return table 73 # build the verity table 75 # build the verity table signature
|
H A D | verity_verifier.cpp | 57 const char* table, uint32_t table_length) { 58 // Hash the table 60 SHA256_hash(reinterpret_cast<const void*>(table), table_length, hash_buf); 71 fprintf(stderr, "Couldn't verify table\n"); 118 int ret = verify_table(argv[3], verity.signature, verity.table, verity.table_length); 56 verify_table(const char* key_path, const uint8_t* signature, const char* table, uint32_t table_length) argument
|
/system/extras/tests/net_test/ |
H A D | iproute.py | 112 "family dst_len src_len tos table protocol scope type flags") 144 ### Neighbour table entry constants. See include/uapi/linux/neighbour.h. 318 def _Rule(self, version, is_add, rule_type, table, match_nlattr, priority): 319 """Python equivalent of "ip rule <add|del> <match_cond> lookup <table>". 325 table: If nonzero, rule looks up this table. 334 # Create a struct rtmsg specifying the table and the given match attributes. 341 if table: 342 rtmsg += self._NlAttrU32(FRA_TABLE, table) 362 def FwmarkRule(self, version, is_add, fwmark, table, priorit [all...] |
H A D | multinetwork_base.py | 242 # We don't want any routes in the main table. If the kernel doesn't support 267 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 [all...] |
/system/core/fs_mgr/ |
H A D | fs_mgr_verity.cpp | 122 static int verify_table(const uint8_t *signature, const char *table, argument 129 // Hash the table 130 SHA256_hash((uint8_t*)table, table_length, hash_buf); 145 ERROR("Couldn't verify table\n"); 158 if (verify_table(verity.signature, verity.table, 160 verify_table(verity.ecc_signature, verity.table, 168 static int invalidate_table(char *table, size_t table_length) argument 175 if (table[n++] == ' ') { 183 while (n < table_length && table[n] != ' ') { 184 table[ 245 char *table; member in struct:verity_table_params 916 update_verity_table_blk_device(char *blk_device, char **table) argument [all...] |
/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/extras/libfec/ |
H A D | fec_verity.cpp | 319 /* reads, corrects and parses the verity table, validates parameters, and if 331 std::unique_ptr<char[]> table(new (std::nothrow) char[size + 1]); 333 if (!table) { 338 if (fec_pread(f, table.get(), size, offset) != (ssize_t)size) { 339 error("failed to read verity table: %s", strerror(errno)); 343 table[size] = '\0'; 344 debug("verity table: '%s'", table.get()); 350 auto tokens = android::base::Split(table.get(), " "); 356 error("unsupported verity table versio [all...] |
H A D | fec_open.cpp | 426 if (f->verity.table) { 427 delete[] f->verity.table; 452 check(f->verity.table); 460 data->table = f->verity.table;
|
H A D | fec_private.h | 79 char *table; member in struct:verity_info
|
/system/vold/ |
H A D | Disk.cpp | 290 // Parse partition table 306 Table table = Table::kUnknown; local 316 table = Table::kMbr; 318 table = Table::kGpt; 330 if (table == Table::kMbr) { 341 } else if (table == Table::kGpt) { 355 if (table == Table::kUnknown || !foundParts) { 356 LOG(WARNING) << mId << " has unknown partition table; trying entire device"; 386 // First nuke any existing partition table 450 // First nuke any existing partition table [all...] |
/system/connectivity/shill/net/ |
H A D | rtnl_message.h | 92 table(0), 106 table(table_in), 113 unsigned char table; member in struct:shill::RTNLMessage::RouteStatus
|
/system/update_engine/payload_generator/ |
H A D | inplace_generator.cc | 238 const vector<vector<Vertex::Index>::size_type>& table) 239 : table_(table) {} 252 vector<vector<Vertex::Index>::size_type> table(op_indexes.size()); 256 if (table.size() < (node + 1)) { 257 table.resize(node + 1); 259 table[node] = i; 261 reverse_op_indexes->swap(table); 267 // first, make a reverse lookup table. 268 vector<vector<Vertex::Index>::size_type> table; local 269 GenerateReverseTopoOrderMap(op_indexes, &table); 237 SortCutsByTopoOrderLess( const vector<vector<Vertex::Index>::size_type>& table) argument [all...] |
/system/media/camera/docs/ |
H A D | html.mako | 40 /* table column sizes */ 41 table { border-collapse:collapse; table-layout: fixed; width: 100%; word-wrap: break-word } 197 <table class="properties"> 392 </table>
|
/system/core/libmincrypt/ |
H A D | p256_ec.c | 93 * The first table contains (x,y) felem pairs for 16 multiples of the base 114 * The second table follows the same style, but the terms are 2**32G, 292 /* The following table may be helpful when reading this code: 363 * The following table contains the amounts added to each word (as an 379 * The following table accumulates these values. The sums at the bottom 986 /* select_affine_point sets {out_x,out_y} to the index'th entry of table. 987 * On entry: index < 16, table[0] must be zero. */ 988 static void select_affine_point(felem out_x, felem out_y, const limb* table, argument 1001 for (j = 0; j < NLIMBS; j++, table++) { 1002 out_x[j] |= *table 1012 select_jacobian_point(felem out_x, felem out_y, felem out_z, const limb* table, limb index) argument [all...] |
/system/bt/doc/ |
H A D | power_management.md | 98 - The power mode config is looked up in the `bta_dm_pm_cfg` table. If none 103 - The power spec state table (`bta_dm_pm_spec`) is checked to see if 132 - If a timeout is specified in the power spec table, then an unused timer
|
/system/extras/libfec/include/fec/ |
H A D | io.h | 75 const char *table; member in struct:fec_verity_metadata
|