/external/openssl/crypto/asn1/ |
H A D | tasn_new.c | 67 static int asn1_item_ex_combine_new(ASN1_VALUE **pval, const ASN1_ITEM *it, 69 static void asn1_item_clear(ASN1_VALUE **pval, const ASN1_ITEM *it); 71 static void asn1_primitive_clear(ASN1_VALUE **pval, const ASN1_ITEM *it); 73 ASN1_VALUE *ASN1_item_new(const ASN1_ITEM *it) argument 76 if (ASN1_item_ex_new(&ret, it) > 0) 83 int ASN1_item_ex_new(ASN1_VALUE **pval, const ASN1_ITEM *it) argument 85 return asn1_item_ex_combine_new(pval, it, 0); 88 static int asn1_item_ex_combine_new(ASN1_VALUE **pval, const ASN1_ITEM *it, argument 94 const ASN1_AUX *aux = it->funcs; 106 if (it 230 asn1_item_clear(ASN1_VALUE **pval, const ASN1_ITEM *it) argument 268 const ASN1_ITEM *it = ASN1_ITEM_ptr(tt->item); local 325 ASN1_primitive_new(ASN1_VALUE **pval, const ASN1_ITEM *it) argument 377 asn1_primitive_clear(ASN1_VALUE **pval, const ASN1_ITEM *it) argument [all...] |
H A D | x_long.c | 69 static int long_new(ASN1_VALUE **pval, const ASN1_ITEM *it); 70 static void long_free(ASN1_VALUE **pval, const ASN1_ITEM *it); 72 static int long_i2c(ASN1_VALUE **pval, unsigned char *cont, int *putype, const ASN1_ITEM *it); 73 static int long_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len, int utype, char *free_cont, const ASN1_ITEM *it); 74 static int long_print(BIO *out, ASN1_VALUE **pval, const ASN1_ITEM *it, int indent, const ASN1_PCTX *pctx); 94 static int long_new(ASN1_VALUE **pval, const ASN1_ITEM *it) argument 96 *(long *)pval = it->size; 100 static void long_free(ASN1_VALUE **pval, const ASN1_ITEM *it) argument 102 *(long *)pval = it->size; 105 static int long_i2c(ASN1_VALUE **pval, unsigned char *cont, int *putype, const ASN1_ITEM *it) argument 142 long_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len, int utype, char *free_cont, const ASN1_ITEM *it) argument 175 long_print(BIO *out, ASN1_VALUE **pval, const ASN1_ITEM *it, int indent, const ASN1_PCTX *pctx) argument [all...] |
/external/openssl/crypto/pkcs12/ |
H A D | p12_add.c | 65 PKCS12_SAFEBAG *PKCS12_item_pack_safebag(void *obj, const ASN1_ITEM *it, int nid1, argument 75 if (!ASN1_item_pack(obj, it, &bag->value.octet)) {
|
H A D | p12_decr.c | 120 void * PKCS12_item_decrypt_d2i(X509_ALGOR *algor, const ASN1_ITEM *it, argument 146 ret = ASN1_item_d2i(NULL, &p, outlen, it); 157 ASN1_OCTET_STRING *PKCS12_item_i2d_encrypt(X509_ALGOR *algor, const ASN1_ITEM *it, argument 168 inlen = ASN1_item_i2d(obj, &in, it);
|
/external/oprofile/libpp/ |
H A D | populate_for_spu.cpp | 40 * so below, we examine header.embedded_offset. If embedded_offset is > 0, it's 58 list<profile_sample_files>::const_iterator it = files.begin(); local 60 for (; it != end; ++it) { 62 if (it->sample_filename.empty()) 65 profile.add_sample_file(it->sample_filename); 113 list < image_set >::const_iterator it= local 118 for (; it != end; ++it) 119 populate_spu_profile_from_files(it [all...] |
H A D | profile.cpp | 113 ordered_samples_t::iterator it = local 115 if (it != ordered_samples.end()) { 116 it->second += node[pos].value;
|
H A D | profile.h | 137 * we do it later in that case. 167 : it(it_), start_offset(start_offset_) {} 169 count_type operator*() const { return it->second; } 170 const_iterator & operator++() { ++it; return *this; } 172 odb_key_t vma() const { return it->first + start_offset; } 176 return it != rhs.it; 179 return it == rhs.it; 183 iterator_t it; member in class:profile_t::const_iterator [all...] |
H A D | sample_container.cpp | 71 samples_storage::iterator it = samples.find(key); local 72 if (it != samples.end()) { 73 it->second.counts += sample.counts; 104 samples_iterator it = samples.find(key); local 105 if (it != samples.end()) 106 return &it->second;
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | symbol-table.cpp | 83 hash_map<string, int64>::const_iterator it = local 85 if (it == symbol_map_.end()) { // only add if not in table 137 hash_map<string, int64>::const_iterator it = symbol_map_.find(symbol); local 138 WriteType(strm, it->second);
|
/external/stlport/test/unit/ |
H A D | iter_test.cpp | 69 Vec::reverse_iterator it; local 71 for (it = v.rbegin(); it != v.rend(); ++it, ++counter) { 74 CPPUNIT_ASSERT(!strcmp(*it, "zippy")); 77 CPPUNIT_ASSERT(!strcmp(*it, "motorboy"));
|
H A D | mvctor_test.cpp | 114 * STL implementation it is only a compile check. 247 deque<vector<int> >::iterator it = vect_deque.end() - 5; local 249 for (; it != vect_deque.end() && nb_incr <= 6; ++nb_incr, ++it) {} 267 deque<vector<int> >::iterator it = vect_deque.end() - 5; local 269 for (; it != vect_deque.end() && nb_incr <= 6; ++nb_incr, ++it) {} 287 deque<vector<int> >::iterator it = vect_deque.end() - 5; local 289 for (; it != vect_deque.end() && nb_incr < 6; ++nb_incr, ++it) {} 307 deque<vector<int> >::iterator it = vect_deque.end() - 5; local 467 vector<vector<int> >::iterator it = vect_vector.end() - 5; local 487 vector<vector<int> >::iterator it = vect_vector.end() - 5; local 507 vector<vector<int> >::iterator it = vect_vector.end() - 5; local 527 vector<vector<int> >::iterator it = vect_vector.end() - 5; local [all...] |
H A D | uninitialized_test.cpp | 95 vector<NotTrivialCopyStruct>::const_iterator it(dst.begin()), end(dst.end()); 96 for (; it != end; ++it) { 97 CPPUNIT_ASSERT( (*it).member == 1 ); 107 TrivialCopyStruct* it = src + 0; local 109 for (; it != end; ++it) { 110 (*it).member = 0; 114 for (it = dst+0, end = dst+count; it ! [all...] |
/external/valgrind/tsan/ |
H A D | common_util.cc | 86 size_t it = 0; local 87 while ((it = ret.find("\\", it)) != string::npos) { 88 ret.replace(it, 1, "/");
|
H A D | ts_heap_info.h | 74 typename map_t::iterator it = map_.lower_bound(a); local 75 CHECK(it != map_.end()); 76 if (it->second.ptr == a) { 78 return &it->second; 80 CHECK(a < it->second.ptr); 81 CHECK(it != map_.begin()); 83 --it; 84 HeapInfo *info = &it->second;
|
/external/valgrind/unittest/ |
H A D | atomicity_tests.cc | 79 // The test is disabled because it actually fails sometimes. 80 // Run it with --gtest_also_run_disabled_tests 94 // with a given key exists. If not, it inserts such element. 96 // then we release it and grap writer lock, but the code has (incorrect) 106 Map::iterator it; local 110 it = m->find(key); 111 if (it != m->end())
|
H A D | deadlock_unittest.cc | 8 This program is free software; you can redistribute it and/or 9 modify it under the terms of the GNU General Public License as 13 This program is distributed in the hope that it will be useful, but 142 map<pthread_t, int>::iterator it = m.find(self); local 143 if (it != m.end()) { 144 id = it->second; 277 // This function randomly enqueues work and waits on it or serves a piece of work. 311 // This function randomly enqueues work to queue 'put_queue' and waits on it
|
/external/webkit/Source/ThirdParty/ANGLE/src/compiler/ |
H A D | SymbolTable.cpp | 94 tLevel::const_iterator it; local 95 for (it = level.begin(); it != level.end(); ++it) 96 (*it).second->dump(infoSink); 121 for (tLevel::iterator it = level.begin(); it != level.end(); ++it) 122 delete (*it).second; 133 tLevel::iterator it; local [all...] |
/external/webkit/Source/WebCore/inspector/ |
H A D | InspectorApplicationCacheAgent.cpp | 106 ApplicationCacheHost::ResourceInfoList::const_iterator it = applicationCacheResources.begin(); local 107 for (int i = 0; it != end; ++it, i++) 108 resources->pushObject(buildObjectForApplicationCacheResource(*it));
|
/external/webkit/Source/WebCore/platform/graphics/chromium/ |
H A D | TextureManager.cpp | 57 TextureMap::iterator it = m_textures.find(token); local 58 if (it != m_textures.end()) 59 removeTexture(token, it->second); 65 // If someone asks about a texture put it at the end of the LRU list. 89 for (TextureMap::iterator it = m_textures.begin(); it != m_textures.end(); ++it) 90 it->second.isProtected = false; 138 TextureMap::iterator it = m_textures.find(token); 139 if (it ! [all...] |
/external/webkit/Source/WebCore/platform/graphics/wince/ |
H A D | MediaPlayerProxy.cpp | 4 * This library is free software; you can redistribute it and/or 5 * modify it under the terms of the GNU Library General Public 9 * This library is distributed in the hope that it will be useful, 106 Attribute* it = attributes->attributeItem(i); local 107 paramNames.append(it->name().localName().string()); 108 paramValues.append(it->value().string());
|
/external/webkit/Source/WebCore/platform/gtk/ |
H A D | DataObjectGtk.cpp | 4 * This library is free software; you can redistribute it and/or 5 * modify it under the terms of the GNU Lesser General Public 9 * This library is distributed in the hope that it will be useful, 157 // attribute's list might still not be empty after calling clearData() (it would 171 HashMap<GtkClipboard*, RefPtr<DataObjectGtk> >::iterator it = objectMap.find(clipboard); local 172 return it->second.get();
|
/external/webkit/Source/WebCore/platform/qt/ |
H A D | CookieJarQt.cpp | 69 QList<QNetworkCookie>::Iterator it = cookies.begin(); local 70 while (it != cookies.end()) { 71 if (it->isHttpOnly()) 72 it = cookies.erase(it); 74 ++it;
|
/external/webkit/Source/WebCore/storage/ |
H A D | StorageNamespaceImpl.cpp | 56 LocalStorageNamespaceMap::iterator it = localStorageNamespaceMap().find(lookupPath); local 57 if (it == localStorageNamespaceMap().end()) { 63 return it->second; 138 for (StorageAreaMap::iterator it = m_storageAreaMap.begin(); it != end; ++it) 139 it->second->close(); 156 for (StorageAreaMap::iterator it = m_storageAreaMap.begin(); it != end; ++it) { [all...] |
/external/webkit/Source/WebCore/svg/ |
H A D | SVGCursorElement.cpp | 5 * This library is free software; you can redistribute it and/or 6 * modify it under the terms of the GNU Library General Public 10 * This library is distributed in the hope that it will be useful, 53 for (HashSet<SVGElement*>::iterator it = m_clients.begin(); it != end; ++it) 54 (*it)->cursorElementRemoved(); 97 HashSet<SVGElement*>::iterator it = m_clients.find(element); local 98 if (it != m_clients.end()) { 99 m_clients.remove(it); 118 HashSet<SVGElement*>::const_iterator it = m_clients.begin(); local [all...] |
/external/webkit/Source/WebKit/android/WebCoreSupport/ |
H A D | WebResponse.cpp | 85 map<string, string>::const_iterator it; local 86 for (it = m_headerFields.begin(); it != m_headerFields.end(); ++it) 87 resourceResponse.setHTTPHeaderField(it->first.c_str(), it->second.c_str()); 142 // TODO: Should use content-disposition instead of url if it is there
|