/external/chromium/chrome/browser/ |
H A D | icon_manager.cc | 29 IconMap::iterator it = icon_cache_.find(CacheKey(group, size)); local 30 if (it != icon_cache_.end()) 31 return it->second; 75 IconMap::iterator it = icon_cache_.find(key); local 76 if (it != icon_cache_.end() && result && it->second) { 77 it->second->SwapRepresentations(result); 79 result = it->second;
|
/external/chromium/chrome/browser/importer/ |
H A D | firefox_importer_unittest.cc | 203 std::vector<ProfileWriter::BookmarkEntry>::iterator it; local 207 it = bookmarks.begin(); 208 entry = *it++; 219 entry = *it++; 231 entry = *it++; 252 it = bookmarks.begin(); 253 entry = *it++; 264 entry = *it++; 286 it = bookmarks.begin(); 287 entry = *it [all...] |
/external/chromium/chrome/browser/net/ |
H A D | referrer.cc | 67 SubresourceMap::iterator it = find(url); local 68 if (it != end()) { 69 it->second.SubresourceIsNeeded(); 89 for (SubresourceMap::iterator it = begin(); it != end(); ++it) { 90 int64 lifetime = (kNow - it->second.birth_time()).InMilliseconds(); 91 double rate = it->second.subresource_use_rate(); 98 least_useful_url = it->first; 108 for (SubresourceMap::iterator it [all...] |
/external/chromium/chrome/browser/profiles/ |
H A D | profile_dependency_manager.cc | 31 EdgeMap::iterator it = edges_.begin(); local 32 while (it != edges_.end()) { 33 EdgeMap::iterator temp = it; 34 ++it; 53 for (std::vector<ProfileKeyedServiceFactory*>::const_iterator it = 54 destruction_order_.begin(); it != destruction_order_.end(); ++it) { 55 (*it)->ProfileShutdown(profile); 58 for (std::vector<ProfileKeyedServiceFactory*>::const_iterator it = 59 destruction_order_.begin(); it ! 97 EdgeMap::iterator it = range.first; local [all...] |
/external/chromium/chrome/browser/sessions/ |
H A D | session_restore_browsertest.cc | 143 std::vector<TabRestoreService::Tab>::const_iterator it = window->tabs.begin(); local 144 for ( ; it != window->tabs.end(); ++it) { 145 const TabRestoreService::Tab& tab = *it;
|
/external/chromium/chrome/browser/sync/engine/ |
H A D | process_updates_command.cc | 48 vector<sessions::VerifiedUpdate>::const_iterator it; local 49 for (it = progress.VerifiedUpdatesBegin(); 50 it != progress.VerifiedUpdatesEnd(); 51 ++it) { 52 const sync_pb::SyncEntity& update = it->second; 54 if (it->first != VERIFY_SUCCESS && it->first != VERIFY_UNDELETE) 132 // creation or undeletion if it were committed that way. Instead, prefer 134 // IS_UNAPPLIED_UPDATE to true. If the item is UNSYNCED, it's committable 135 // from the new state; it ma [all...] |
/external/chromium/chrome/browser/sync/sessions/ |
H A D | ordered_commit_set.cc | 48 // Since projections are in increasing order, it's easy to fix. Except 51 Projections::iterator it = projections_.begin(); local 52 for (; it != projections_.end(); ++it) { 55 Projection& p = it->second;
|
/external/chromium/chrome/browser/sync/syncable/ |
H A D | directory_backing_store_unittest.cc | 1255 // If you see this error, it may mean that you've increased the 1265 // test database (it is currently of the version you need). 1355 MetahandlesIndex::iterator it = index.begin(); local 1356 ASSERT_TRUE(it != index.end()); 1357 ASSERT_EQ(1, (*it)->ref(META_HANDLE)); 1358 EXPECT_TRUE((*it)->ref(ID).IsRoot()); 1360 ASSERT_TRUE(++it != index.end()) << "Upgrade destroyed database contents."; 1361 ASSERT_EQ(2, (*it)->ref(META_HANDLE)); 1362 EXPECT_TRUE((*it)->ref(IS_DEL)); 1363 EXPECT_TRUE((*it) [all...] |
/external/chromium/chrome/browser/ui/views/ |
H A D | uninstall_view.cc | 105 BrowsersMap::const_iterator it = browsers_->begin(); local 106 std::advance(it, index); 107 base::LaunchApp((*it).second, false, true, NULL); 151 BrowsersMap::const_iterator it = browsers_->begin(); local 152 std::advance(it, index); 153 return WideToUTF16Hack((*it).first);
|
/external/chromium/net/http/ |
H A D | http_alternate_protocols.cc | 66 ProtocolMap::const_iterator it = protocol_map_.find(http_host_port_pair); local 67 if (it != protocol_map_.end()) 68 return it->second; 99 DVLOG(1) << "Ignore alternate protocol since it's known to be broken.";
|
/external/chromium/net/tools/flip_server/ |
H A D | output_ordering.h | 29 PriorityRing::iterator it; member in struct:net::OutputOrdering::PriorityMapPointer
|
/external/chromium/third_party/libjingle/source/talk/base/ |
H A D | taskrunner.cc | 119 std::vector<Task *>::iterator it; local 120 it = std::remove(tasks_.begin(), 124 tasks_.erase(it, tasks_.end()); 131 // while being destroyed since it calls a pure virtual function). 140 // If it has, wake it up, then queue up the next task in line 163 // state to something other than DONE, ERROR or BLOCKED, it calls 180 // check to see if it's closer than the current 189 // and it used to be our "about to timeout" task, 206 // it' [all...] |
/external/chromium/third_party/libjingle/source/talk/p2p/client/ |
H A D | socketmonitor.cc | 121 std::vector<Connection *>::const_iterator it; local 122 for (it = connections.begin(); it != connections.end(); it++) { 123 Connection *connection = *it;
|
/external/clang/test/Analysis/ |
H A D | cxx11-crashes.cpp | 62 bool begin(double *it) { argument 64 bool *a = reinterpret_cast<type &>(*( reinterpret_cast<char *>( it )));
|
/external/clang/test/SemaTemplate/ |
H A D | dependent-expr.cpp | 5 void Test(Iterator it) { argument 6 *(it += 1);
|
/external/clang/tools/diagtool/ |
H A D | DiagTool.cpp | 34 ToolMap::iterator it = getTools(tools)->find(toolCmd); local 35 return (it == getTools(tools)->end()) ? 0 : it->getValue(); 45 for (ToolMap::iterator it = getTools(tools)->begin(), 46 ei = getTools(tools)->end(); it != ei; ++it) { 47 toolNames.push_back(it->getKey()); 48 unsigned len = it->getKey().size(); 54 for (std::vector<llvm::StringRef>::iterator it = toolNames.begin(), 55 ei = toolNames.end(); it ! [all...] |
/external/javassist/src/main/javassist/expr/ |
H A D | Handler.java | 34 CodeIterator it, CtClass declaring, MethodInfo m) { 35 super(et.handlerPc(nth), it, declaring, m); 33 Handler(ExceptionTable et, int nth, CodeIterator it, CtClass declaring, MethodInfo m) argument
|
/external/llvm/unittests/ADT/ |
H A D | DeltaAlgorithmTest.cpp | 21 for (std::set<unsigned>::const_iterator it = S.begin(), 22 ie = S.end(); it != ie; ++it) { 23 if (it != S.begin()) 25 OS << *it; local
|
H A D | DenseMapTest.cpp | 128 // two-phase name lookup, it also doesn't require the typename. Deal with 153 typename TypeParam::iterator it = this->Map.begin(); local 154 EXPECT_EQ(this->getKey(), it->first); 155 EXPECT_EQ(this->getValue(), it->second); 156 ++it; 157 EXPECT_TRUE(it == this->Map.end()); 271 for (typename TypeParam::iterator it = this->Map.begin(); 272 it != this->Map.end(); ++it) 273 visited[visitedIndex[it 283 typename TypeParam::iterator it = this->Map.begin(); local [all...] |
H A D | StringMapTest.cpp | 53 StringMap<uint32_t>::iterator it = testMap.begin(); local 54 EXPECT_STREQ(testKey, it->first().data()); 55 EXPECT_EQ(testValue, it->second); 56 ++it; 57 EXPECT_TRUE(it == testMap.end()); 139 // it fills up through a balanced pattern of inserts and erases. This can 140 // lead to inf-loops in some cases (PR13148) so we test it explicitly here. 172 for (StringMap<uint32_t>::iterator it = testMap.begin(); 173 it != testMap.end(); ++it) { [all...] |
/external/openfst/src/include/fst/ |
H A D | generic-register.h | 84 // scope that does the registration. Thus we need only load it, not 102 typename RegisterMapType::const_iterator it = register_table_.find(key); local 104 if (it != register_table_.end()) { 105 return &it->second;
|
/external/openssl/crypto/asn1/ |
H A D | a_d2i_fp.c | 11 * apply to all code found in this distribution, be it the RC4, RSA, 106 void *ASN1_item_d2i_bio(const ASN1_ITEM *it, BIO *in, void *x) argument 117 ret=ASN1_item_d2i(x,&p,len, it); 124 void *ASN1_item_d2i_fp(const ASN1_ITEM *it, FILE *in, void *x) argument 135 ret=ASN1_item_d2i_bio(it,b,x);
|
H A D | a_sign.c | 11 * apply to all code found in this distribution, be it the RC4, RSA, 216 int ASN1_item_sign(const ASN1_ITEM *it, X509_ALGOR *algor1, X509_ALGOR *algor2, argument 227 return ASN1_item_sign_ctx(it, algor1, algor2, signature, asn, &ctx); 231 int ASN1_item_sign_ctx(const ASN1_ITEM *it, argument 253 rv = pkey->ameth->item_sign(ctx, it, asn, algor1, algor2, 300 inl=ASN1_item_i2d(asn,&buf_in, it);
|
H A D | bio_ndef.c | 65 * get a BIO from it then any data written through the BIO 85 const ASN1_ITEM *it; member in struct:ndef_aux_st 101 BIO *BIO_new_NDEF(BIO *out, ASN1_VALUE *val, const ASN1_ITEM *it) argument 105 const ASN1_AUX *aux = it->funcs; 134 if (aux->asn1_cb(ASN1_OP_STREAM_PRE, &val, it, &sarg) <= 0) 138 ndef_aux->it = it; 166 derlen = ASN1_item_ndef_i2d(ndef_aux->val, NULL, ndef_aux->it); 170 derlen = ASN1_item_ndef_i2d(ndef_aux->val, &p, ndef_aux->it); 221 aux = ndef_aux->it [all...] |
H A D | tasn_fre.c | 65 static void asn1_item_combine_free(ASN1_VALUE **pval, const ASN1_ITEM *it, int combine); 69 void ASN1_item_free(ASN1_VALUE *val, const ASN1_ITEM *it) argument 71 asn1_item_combine_free(&val, it, 0); 74 void ASN1_item_ex_free(ASN1_VALUE **pval, const ASN1_ITEM *it) argument 76 asn1_item_combine_free(pval, it, 0); 79 static void asn1_item_combine_free(ASN1_VALUE **pval, const ASN1_ITEM *it, int combine) argument 84 const ASN1_AUX *aux = it->funcs; 89 if ((it->itype != ASN1_ITYPE_PRIMITIVE) && !*pval) 96 switch(it->itype) 100 if (it 204 ASN1_primitive_free(ASN1_VALUE **pval, const ASN1_ITEM *it) argument [all...] |