/system/extras/verity/ |
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/netd/server/ |
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 | 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 | 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(),
|
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...] |
/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/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/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/extras/libfec/ |
H A D | fec_private.h | 79 char *table; member in struct:verity_info
|
/system/extras/libfec/include/fec/ |
H A D | io.h | 76 const char *table; member in struct:fec_verity_metadata
|
/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/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/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/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/chre/external/flatbuffers/include/flatbuffers/ |
H A D | flatbuffers.h | 420 // "val" points to the new table/string, as you can obtain from 472 auto table = IndirectHelper<T>::Read(data, 0); 476 return -table->KeyCompareWithValue(*key); 657 // Converts a Field ID to a virtual table offset. 778 // FlatBufferBuilder::Finish with your root table. 881 // during the construction of its parent table (between the MyTableBuilder 882 // and table.Finish(). 900 // table, comparing it against existing vtables, and writing the 916 // Write the offsets into the table 958 // This checks a required field has been set in a given table tha 1495 VerifyTable(const T *table) argument 1786 auto table = reinterpret_cast<const Table *>(root); local 1850 IsFieldPresent(const T *table, voffset_t field) argument [all...] |
/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...] |