/external/boringssl/src/crypto/dh/ |
H A D | dh_asn1.c | 64 static int dh_cb(int operation, ASN1_VALUE **pval, const ASN1_ITEM *it, argument
|
/external/boringssl/src/crypto/pkcs8/ |
H A D | p8_pkey.c | 64 static int pkey_cb(int operation, ASN1_VALUE **pval, const ASN1_ITEM *it, argument
|
/external/boringssl/src/crypto/x509/ |
H A D | x_req.c | 10 * apply to all code found in this distribution, be it the RC4, RSA, 65 * encode the attributes field if it is empty. This is in 66 * violation of PKCS#10 but we need to tolerate it. We do 68 * the callback to initialise it to an empty STACK. 75 * 1. If it is NULL then it's the invalid omission. 76 * 2. If it is empty it is the correct encoding. 77 * 3. If it is not empty then some attributes are present. 81 static int rinf_cb(int operation, ASN1_VALUE **pval, const ASN1_ITEM *it, argument [all...] |
H A D | x_x509.c | 11 * apply to all code found in this distribution, be it the RC4, RSA, 91 static int x509_cb(int operation, ASN1_VALUE **pval, const ASN1_ITEM *it, argument 191 /* If certificate unreadable then forget it */
|
H A D | a_verify.c | 10 * apply to all code found in this distribution, be it the RC4, RSA, 74 int ASN1_item_verify(const ASN1_ITEM *it, X509_ALGOR *a, argument 100 inl = ASN1_item_i2d(asn, &buf_in, it);
|
/external/libcxx/test/std/containers/associative/map/ |
H A D | compare.pass.cpp | 29 std::map<Key, int>::iterator it = std::map<Key, int>().find(Key(0)); local
|
/external/parameter-framework/parameter/ |
H A D | HardwareBackSynchronizer.cpp | 39 std::list<const CConfigurableElement*>::const_iterator it; local 41 for (it = _needingBackSyncList.begin(); it != _needingBackSyncList.end(); ++it) { 43 const CConfigurableElement* pConfigurableElement = *it;
|
H A D | SimulatedBackSynchronizer.cpp | 45 std::list<const CConfigurableElement*>::const_iterator it; local 47 for (it = _needingBackSyncList.begin(); it != _needingBackSyncList.end(); ++it) { 49 const CConfigurableElement* pConfigurableElement = *it;
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/ |
H A D | ANTLRCommonTreeNodeStream.h | 42 /** If this tree (root) was created from a token stream, track it. */ 49 ANTLRTreeIterator *it; variable
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/ |
H A D | ANTLRCommonTreeNodeStream.h | 42 /** If this tree (root) was created from a token stream, track it. */ 49 ANTLRTreeIterator *it; variable
|
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/ |
H A D | ANTLRCommonTreeNodeStream.h | 42 /** If this tree (root) was created from a token stream, track it. */ 49 ANTLRTreeIterator *it; variable
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
H A D | ANTLRCommonTreeNodeStream.h | 42 /** If this tree (root) was created from a token stream, track it. */ 49 __strong ANTLRTreeIterator *it; variable 117 @property (retain) ANTLRTreeIterator *it; variable
|
/external/boringssl/src/crypto/asn1/ |
H A D | asn_pack.c | 10 * apply to all code found in this distribution, be it the RC4, RSA, 65 ASN1_STRING *ASN1_item_pack(void *obj, const ASN1_ITEM *it, ASN1_STRING **oct) argument 82 if (!(octmp->length = ASN1_item_i2d(obj, &octmp->data, it))) { 95 void *ASN1_item_unpack(ASN1_STRING *oct, const ASN1_ITEM *it) argument 101 if(!(ret = ASN1_item_d2i(NULL, &p, oct->length, it)))
|
H A D | a_dup.c | 10 * apply to all code found in this distribution, be it the RC4, RSA, 87 void *ASN1_item_dup(const ASN1_ITEM *it, void *x) argument 96 i=ASN1_item_i2d(x,&b,it); 100 ret=ASN1_item_d2i(NULL,&p,i, it);
|
H A D | a_i2d_fp.c | 10 * apply to all code found in this distribution, be it the RC4, RSA, 112 int ASN1_item_i2d_fp(const ASN1_ITEM *it, FILE *out, void *x) argument 123 ret=ASN1_item_i2d_bio(it,b,x); 128 int ASN1_item_i2d_bio(const ASN1_ITEM *it, BIO *out, void *x) argument 133 n = ASN1_item_i2d(x, &b, it);
|
H A D | x_bignum.c | 10 * apply to all code found in this distribution, be it the RC4, RSA, 64 * BIGNUM directly. Currently it ignores the sign which isn't a problem since all 71 static int bn_new(ASN1_VALUE **pval, const ASN1_ITEM *it); 72 static void bn_free(ASN1_VALUE **pval, const ASN1_ITEM *it); 74 static int bn_i2c(ASN1_VALUE **pval, unsigned char *cont, int *putype, const ASN1_ITEM *it); 75 static int bn_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len, int utype, char *free_cont, const ASN1_ITEM *it); 94 static int bn_new(ASN1_VALUE **pval, const ASN1_ITEM *it) argument 101 static void bn_free(ASN1_VALUE **pval, const ASN1_ITEM *it) argument 104 if(it->size & BN_SENSITIVE) BN_clear_free((BIGNUM *)*pval); 109 static int bn_i2c(ASN1_VALUE **pval, unsigned char *cont, int *putype, const ASN1_ITEM *it) argument 125 bn_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len, int utype, char *free_cont, const ASN1_ITEM *it) argument [all...] |
/external/boringssl/src/crypto/dsa/ |
H A D | dsa_asn1.c | 67 static int dsa_sig_cb(int operation, ASN1_VALUE **pval, const ASN1_ITEM *it, argument 92 static int dsa_cb(int operation, ASN1_VALUE **pval, const ASN1_ITEM *it, argument
|
/external/boringssl/src/crypto/rsa/ |
H A D | rsa_asn1.c | 65 static int rsa_cb(int operation, ASN1_VALUE **pval, const ASN1_ITEM *it, argument
|
/external/libcxx/test/std/containers/sequences/deque/deque.modifiers/ |
H A D | push_back.pass.cpp | 51 typename C::const_iterator it = c.begin(); local 52 for (int i = 0; i < size; ++i, ++it) 53 assert(*it == i);
|
H A D | push_back_rvalue.pass.cpp | 54 typename C::const_iterator it = c.begin(); local 55 for (int i = 0; i < size; ++i, ++it) 56 assert(*it == MoveOnly(i));
|
/external/libcxx/test/std/containers/sequences/dynarray/dynarray.overview/ |
H A D | at.pass.cpp | 46 auto it = vals.begin (); local 47 for ( size_t i = 0; i < dyn.size(); ++i, ++it ) { 49 assert ( *it == dyn.at(i)); 60 auto it = vals.begin (); local 61 for ( size_t i = 0; i < dyn.size(); ++i, ++it ) { 63 assert ( *it == dyn.at(i));
|
H A D | indexing.pass.cpp | 31 auto it = vals.begin (); local 32 for ( size_t i = 0; i < dyn.size(); ++i, ++it ) { 34 assert ( *it == dyn[i]); 41 auto it = vals.begin (); local 42 for ( size_t i = 0; i < dyn.size(); ++i, ++it ) { 44 assert ( *it == dyn[i]);
|
/external/libcxx/test/std/containers/unord/unord.map/ |
H A D | compare.pass.cpp | 38 std::unordered_map<Key, int>::iterator it = local
|
/external/llvm/test/MC/ARM/ |
H A D | deprecated-v8.s | 29 it ge label 39 it ge label 43 it ge label 47 it ge label
|
/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
H A D | TestTreeIterator.java | 44 TreeIterator it = new TreeIterator(t); 45 StringBuffer buf = toString(it); 55 TreeIterator it = new TreeIterator(t); 56 StringBuffer buf = toString(it); 66 TreeIterator it = new TreeIterator(t); 67 StringBuffer buf = toString(it); 77 TreeIterator it = new TreeIterator(t); 78 StringBuffer buf = toString(it); 88 TreeIterator it = new TreeIterator(t); 89 StringBuffer buf = toString(it); 123 toString(TreeIterator it) argument [all...] |