/system/security/keystore/ |
auth_token_table.cpp | 105 const std::vector<uint64_t>& sids, hw_authenticator_type_t auth_type, 116 if (!matching_op->SatisfiesAuth(sids, auth_type)) 123 AuthTokenTable::Error AuthTokenTable::FindTimedAuthorization(const std::vector<uint64_t>& sids, 129 if (entry.SatisfiesAuth(sids, auth_type) && entry.is_newer_than(newest_match)) 146 void AuthTokenTable::ExtractSids(const AuthorizationSet& key_info, std::vector<uint64_t>* sids) { 147 assert(sids); 150 sids->push_back(param.long_integer); 194 bool AuthTokenTable::Entry::SatisfiesAuth(const std::vector<uint64_t>& sids, 196 for (auto sid : sids)
|
auth_token_table.h | 122 bool SatisfiesAuth(const std::vector<uint64_t>& sids, hw_authenticator_type_t auth_type); 145 Error FindAuthPerOpAuthorization(const std::vector<uint64_t>& sids, 149 Error FindTimedAuthorization(const std::vector<uint64_t>& sids, 152 void ExtractSids(const AuthorizationSet& key_info, std::vector<uint64_t>* sids);
|
/external/freetype/src/cff/ |
cffload.c | 808 if ( charset->sids[i] > max_cid ) 809 max_cid = charset->sids[i]; 819 charset->cids[charset->sids[j]] = (FT_UShort)j; 861 FT_FREE( charset->sids ); 894 /* Allocate memory for sids. */ 895 if ( FT_NEW_ARRAY( charset->sids, num_glyphs ) ) 899 charset->sids[0] = 0; 910 charset->sids[j] = FT_GET_USHORT(); 943 /* try to rescue some of the SIDs if `nleft' is too large */ 951 /* Fill in the range of sids -- `nleft + 1' glyphs. * [all...] |
cffcmap.c | 133 FT_UInt sid = charset->sids[idx]; 155 if ( !charset->sids )
|
cfftypes.h | 84 FT_UShort sids [256]; /* avoid dynamic allocations */ member in struct:CFF_EncodingRec_ 96 FT_UShort* sids; member in struct:CFF_CharsetRec_ 97 FT_UShort* cids; /* the inverse mapping of `sids'; only needed */
|
cffdrivr.c | 305 sid = font->charset.sids[glyph_index]; 341 sid = charset->sids[i]; 633 c = cff->charset.sids[glyph_index];
|
/external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/cff/ |
cffload.c | 802 if ( charset->sids[i] > max_cid ) 803 max_cid = charset->sids[i]; 813 charset->cids[charset->sids[j]] = (FT_UShort)j; 855 FT_FREE( charset->sids ); 888 /* Allocate memory for sids. */ 889 if ( FT_NEW_ARRAY( charset->sids, num_glyphs ) ) 893 charset->sids[0] = 0; 904 charset->sids[j] = FT_GET_USHORT(); 937 /* try to rescue some of the SIDs if `nleft' is too large */ 945 /* Fill in the range of sids -- `nleft + 1' glyphs. * [all...] |
cffcmap.c | 133 FT_UInt sid = charset->sids[idx]; 155 if ( !charset->sids )
|
cfftypes.h | 84 FT_UShort sids [256]; /* avoid dynamic allocations */ member in struct:CFF_EncodingRec_ 96 FT_UShort* sids; member in struct:CFF_CharsetRec_ 97 FT_UShort* cids; /* the inverse mapping of `sids'; only needed */
|
cffdrivr.c | 305 sid = font->charset.sids[glyph_index]; 341 sid = charset->sids[i]; 633 c = cff->charset.sids[glyph_index];
|
cffgload.c | 636 if ( !cff->charset.sids ) 648 if ( cff->charset.sids[n] == glyph_sid ) [all...] |
/external/pdfium/third_party/freetype/src/cff/ |
cffload.c | 802 if ( charset->sids[i] > max_cid ) 803 max_cid = charset->sids[i]; 813 charset->cids[charset->sids[j]] = (FT_UShort)j; 855 FT_FREE( charset->sids ); 888 /* Allocate memory for sids. */ 889 if ( FT_NEW_ARRAY( charset->sids, num_glyphs ) ) 893 charset->sids[0] = 0; 904 charset->sids[j] = FT_GET_USHORT(); 937 /* try to rescue some of the SIDs if `nleft' is too large */ 945 /* Fill in the range of sids -- `nleft + 1' glyphs. * [all...] |
cffcmap.c | 133 FT_UInt sid = charset->sids[idx]; 155 if ( !charset->sids )
|
cfftypes.h | 84 FT_UShort sids [256]; /* avoid dynamic allocations */ member in struct:CFF_EncodingRec_ 96 FT_UShort* sids; member in struct:CFF_CharsetRec_ 97 FT_UShort* cids; /* the inverse mapping of `sids'; only needed */
|
cffdrivr.c | 305 sid = font->charset.sids[glyph_index]; 341 sid = charset->sids[i]; 631 c = cff->charset.sids[glyph_index];
|
cffgload.c | 636 if ( !cff->charset.sids ) 648 if ( cff->charset.sids[n] == glyph_sid ) [all...] |
/external/selinux/libsepol/cil/src/ |
cil_verify.h | 68 int __cil_verify_initsids(struct cil_list *sids);
|
cil_verify.c | 419 int __cil_verify_initsids(struct cil_list *sids) 424 if (sids->head == NULL) { 429 cil_list_for_each(i, sids) { [all...] |
/external/lzma/CPP/Windows/ |
SecurityUtils.h | 134 NTSTATUS LookupSids(ULONG count, PSID* sids,
136 { return LsaLookupSids(_handle, count, sids, referencedDomains, names); }
|
/external/selinux/libsepol/include/sepol/policydb/ |
services.h | 158 * Generate the set of SIDs for legal security contexts 160 * Set `*sids' to point to a dynamically allocated 161 * array containing the set of SIDs. Set `*nel' to the 166 sepol_security_id_t ** sids, uint32_t * nel); 169 * Return the SIDs to use for an unlabeled file system 189 * Return the SIDs to use for a network interface 215 #define SECURITY_FS_USE_TRANS 2 /* use transition SIDs, e.g. devpts/tmpfs */ 216 #define SECURITY_FS_USE_TASK 3 /* use task SIDs, e.g. pipefs/sockfs */ 226 * fixed labeling behavior like transition SIDs or task SIDs [all...] |
/external/selinux/checkpolicy/ |
checkpolicy.c | 382 sepol_security_id_t ssid, tsid, *sids, oldsid, newsid, tasksid; local 988 printf("use transition SIDs\n"); 991 printf("use task SIDs\n"); 1048 ret = sepol_get_user_sids(ssid, ans, &sids, &nel); 1054 print_sid(sids[i], NULL, NULL); 1055 free(sids);
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
fwptypes.h | 265 PSID_AND_ATTRIBUTES sids; member in struct:FWP_TOKEN_INFORMATION_
|
/system/connectivity/shill/cellular/ |
mobile_operator_info_impl.cc | 419 const RepeatedPtrField<string>& sids = data.sid(); local 420 for (const auto& sid : sids) {
|
/external/libmtp/src/ |
ptp.c | 555 unsigned char* sids=NULL; local 561 ret=ptp_transaction(params, &ptp, PTP_DP_GETDATA, 0, &sids, &len); 562 if (ret == PTP_RC_OK) ptp_unpack_SIDs(params, sids, storageids, len); 563 free(sids); 1631 unsigned char* sids=NULL; local [all...] |
ptp-pack.c | 400 ptp_unpack_SIDs (PTPParams *params, unsigned char* data, PTPStorageIDs *sids, unsigned int len) 402 sids->n = ptp_unpack_uint32_t_array(params, data, PTP_sids, 403 &sids->Storage); [all...] |