/external/webp/src/dsp/ |
H A D | dec.c | 29 // and make sure it's set to true _last_ (so as to be thread-safe) 537 int step, int t, int it) { 542 return abs0[255 + p3 - p2] <= it && abs0[255 + p2 - p1] <= it && 543 abs0[255 + p1 - p0] <= it && abs0[255 + q3 - q2] <= it && 544 abs0[255 + q2 - q1] <= it && abs0[255 + q1 - q0] <= it; 536 needs_filter2(const uint8_t* p, int step, int t, int it) argument
|
/external/webp/src/enc/ |
H A D | filter.c | 85 int step, int t, int it) { 90 return abs0[255 + p3 - p2] <= it && abs0[255 + p2 - p1] <= it && 91 abs0[255 + p1 - p0] <= it && abs0[255 + q3 - q2] <= it && 92 abs0[255 + q2 - q1] <= it && abs0[255 + q1 - q0] <= it; 209 static void DoFilter(const VP8EncIterator* const it, int level) { argument 210 const VP8Encoder* const enc = it->enc_; 214 uint8_t* const y_dst = it 84 needs_filter2(const uint8_t* p, int step, int t, int it) argument 340 VP8InitFilter(VP8EncIterator* const it) argument 352 VP8StoreFilterStats(VP8EncIterator* const it) argument 385 VP8AdjustFilterStrength(VP8EncIterator* const it) argument [all...] |
H A D | frame.c | 278 int VP8GetCostLuma4(VP8EncIterator* const it, const int16_t levels[16]) { argument 279 const int x = (it->i4_ & 3), y = (it->i4_ >> 2); 281 VP8Encoder* const enc = it->enc_; 286 ctx = it->top_nz_[x] + it->left_nz_[y]; 292 int VP8GetCostLuma16(VP8EncIterator* const it, const VP8ModeScore* const rd) { argument 294 VP8Encoder* const enc = it->enc_; 298 VP8IteratorNzToBytes(it); // re-import the non-zero context 303 R += GetResidualCost(it 318 VP8GetCostUV(VP8EncIterator* const it, const VP8ModeScore* const rd) argument 414 CodeResiduals(VP8BitWriter* const bw, VP8EncIterator* const it, const VP8ModeScore* const rd) argument 469 RecordResiduals(VP8EncIterator* const it, const VP8ModeScore* const rd) argument 643 RecordTokens(VP8EncIterator* const it, const VP8ModeScore* const rd, VP8TBuffer tokens[2]) argument 704 StoreSSE(const VP8EncIterator* const it) argument 715 StoreSideInfo(const VP8EncIterator* const it) argument 754 ResetAfterSkip(VP8EncIterator* const it) argument 766 VP8EncIterator it; local 838 VP8EncIterator it; local [all...] |
H A D | quant.c | 265 // We map it to the safe maximal range of MAX/MIN_DQ_UV for dq_uv. 270 // and make it safe. 301 void VP8MakeLuma16Preds(const VP8EncIterator* const it) { argument 302 const VP8Encoder* const enc = it->enc_; 303 const uint8_t* const left = it->x_ ? enc->y_left_ : NULL; 304 const uint8_t* const top = it->y_ ? enc->y_top_ + it->x_ * 16 : NULL; 305 VP8EncPredLuma16(it->yuv_p_, left, top); 308 void VP8MakeChroma8Preds(const VP8EncIterator* const it) { argument 309 const VP8Encoder* const enc = it 315 VP8MakeIntra4Preds(const VP8EncIterator* const it) argument 419 TrellisQuantizeBlock(const VP8EncIterator* const it, int16_t in[16], int16_t out[16], int ctx0, int coeff_type, const VP8Matrix* const mtx, int lambda) argument 579 ReconstructIntra16(VP8EncIterator* const it, VP8ModeScore* const rd, uint8_t* const yuv_out, int mode) argument 625 ReconstructIntra4(VP8EncIterator* const it, int16_t levels[16], const uint8_t* const src, uint8_t* const yuv_out, int mode) argument 649 ReconstructUV(VP8EncIterator* const it, VP8ModeScore* const rd, uint8_t* const yuv_out, int mode) argument 698 SwapOut(VP8EncIterator* const it) argument 702 PickBestIntra16(VP8EncIterator* const it, VP8ModeScore* const rd) argument 744 GetCostModeI4(VP8EncIterator* const it, const uint8_t modes[16]) argument 753 PickBestIntra4(VP8EncIterator* const it, VP8ModeScore* const rd) argument 829 PickBestUV(VP8EncIterator* const it, VP8ModeScore* const rd) argument 868 SimpleQuantize(VP8EncIterator* const it, VP8ModeScore* const rd) argument 895 VP8Decimate(VP8EncIterator* const it, VP8ModeScore* const rd, int rd_opt) argument [all...] |
/external/clang/lib/CodeGen/ |
H A D | CGCleanup.cpp | 70 /// necessary to restore it to usability at the current insertion 237 EHScopeStack::iterator it = find(InnermostNormalCleanup); local 238 unsigned MinSize = cast<EHCleanupScope>(*it).getFixupDepth(); 251 // Initialize it to false at a site that's guaranteed to be run 255 // Initialize it to true at the current location. 283 // still pointing directly to its destination; forward it to the 311 // If it's a branch, turn it into a switch whose default 347 // If it doesn't have an optimistic branch block, LatestBranch is 399 /// Returns the new block, whatever it i [all...] |
H A D | CGRecordLayoutBuilder.cpp | 253 // We can just assume that it's: 268 // at aligned indices of that type. If such an access would fail because it 693 // This base isn't interesting since it doesn't have any virtual bases. 708 // If we have a primary base, lay it out first. 1062 RecordDecl::field_iterator it = D->field_begin(); local 1065 for (unsigned i = 0, e = AST_RL.getFieldCount(); i != e; ++i, ++it) { 1066 const FieldDecl *FD = *it; 1122 it = BitFields.begin(), ie = BitFields.end(); 1123 it != ie; ++it) { [all...] |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
H A D | org.eclipse.equinox.p2.reconciler.dropins_1.1.2.R36x_v20101111-1430.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.eclipse.core.databinding.observable_1.3.0.I20100601-0800.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.eclipse.text_3.5.0.v20100601-1300.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.eclipse.core.jobs_3.5.1.R36x_v20100824.jar | ... .jobs.ISchedulingRule rule
java.util.Iterator it
private org.eclipse.core.internal.jobs ... |
/external/chromium/chrome/browser/extensions/ |
H A D | extension_service.cc | 120 // Reload the manifest if it needs to be relocalized. 168 // (presumably into memory) without installing it. 177 // Finish installing the extension in |crx_path| after it has been unpacked to 178 // |unpacked_path|. If |expected_id| is not empty, it's verified against the 244 // Report this as an installed extension so that it gets remembered in the 489 DCHECK(!profile_); // Profile should have told us it's going away. 566 << " because it is not installed or pending"; 568 // that would do it for us. 600 // Disable the extension if it's loaded. It might not be loaded if it crashe 1025 std::vector<Extension::PermissionMessage>::iterator it; local [all...] |
/external/chromium/chrome/browser/sync/glue/ |
H A D | sync_backend_host.cc | 99 // Create a worker for the UI thread and route bookmark changes to it. 111 // TODO(tim): Bug 53916. HistoryModelWorker crashes, so avoid adding it 121 for (syncable::ModelTypeSet::const_iterator it = types.begin(); 122 it != types.end(); ++it) { 123 registrar_.routing_info[(*it)] = GROUP_PASSIVE; 140 // TODO(akalin): Create SyncNotifier here and pass it in as part of 254 // give us the green light that it is not depending on the frontend_loop_ to 342 // just set it as not migrated. 362 for (DataTypeController::TypeMap::const_iterator it 817 std::map<syncable::ModelType, ChangeProcessor*>::const_iterator it = local [all...] |
/external/chromium/chrome/browser/sync/syncable/ |
H A D | syncable.cc | 97 // and restores it to the index when the scope exits. This simplifies 132 // Helper function to add an item to the index, if it ought to be added. 170 // item is excluded so that it doesn't show up as a child of itself. 364 MetahandlesIndex::iterator it = kernel_->metahandles_index->begin(); local 365 for (; it != kernel_->metahandles_index->end(); ++it) { 366 EntryKernel* entry = *it; 426 // Find it in the in memory ID index. 438 // Find it in the ClientTagIndex. 477 // Found it i 690 MetahandlesIndex::iterator it = kernel_->metahandles_index->begin(); local [all...] |
/external/chromium/chrome/browser/ui/ |
H A D | browser_init.cc | 564 // Create the WmMessageListener so that it can listen for messages regardless 568 // Create the WmOverviewController so it can register with the listener. 579 // in a static so that it isn't reported as a leak. 698 // If this is an app launch, but we didn't open an app window, it may 893 // we explicitly ignore it during testing. 975 // |browser|. While we may not end up actually using |browser| (since it 1050 // it is closed. 1185 std::vector<GURL>::iterator it = browser_init_->first_run_tabs_.begin(); local 1186 while (it != browser_init_->first_run_tabs_.end()) { 1188 if (it [all...] |
/external/chromium/chrome/browser/ui/gtk/ |
H A D | gtk_theme_service.cc | 298 ImageCache::const_iterator it = gtk_images_.find(id); local 299 if (it != gtk_images_.end()) 300 return it->second; 314 ColorMap::const_iterator it = colors_.find(id); local 315 if (it != colors_.end()) 316 return it->second; 541 // We flip the sign of |id| when passing it to GetSurfaceNamedImpl() for the 642 for (std::vector<GtkWidget*>::iterator it = chrome_buttons_.begin(); 643 it != chrome_buttons_.end(); ++it) { 993 ColorMap::const_iterator it = colors_.find(color_id); local 1098 std::vector<GtkWidget*>::iterator it = local [all...] |
/external/chromium/chrome/browser/ui/gtk/tabs/ |
H A D | tab_renderer_gtk.cc | 279 for (BitmapCache::iterator it = cached_bitmaps_.begin(); 280 it != cached_bitmaps_.end(); ++it) { 281 delete it->second.bitmap; 306 // favicon. But the plumbing that would be necessary to do it right would 559 // Clear our cache when we receive a theme change notification because it 561 for (BitmapCache::iterator it = cached_bitmaps_.begin(); 562 it != cached_bitmaps_.end(); ++it) { 563 delete it 770 BitmapCache::iterator it = cached_bitmaps_.find(std::make_pair(mask, local [all...] |
/external/chromium/net/base/ |
H A D | host_resolver_impl.cc | 371 // take care to delete it. 410 // Mark the job as cancelled, so when worker thread completes it will 418 // spawned it. 423 for (RequestsList::const_iterator it = requests_.begin(); 424 it != requests_.end(); ++it) { 425 HostResolverImpl::Request* req = *it; 475 // wait for it to finish, so we must be very careful here about using other 487 // The origin loop could go away while we are trying to post to it, so we 507 // however it is 821 PendingRequestsQueue::iterator it = std::find(q.begin(), q.end(), req); local 1141 ObserversList::iterator it = local 1185 JobMap::iterator it = jobs_.find(key); local 1192 JobMap::iterator it = jobs_.find(job->key()); local [all...] |
/external/chromium/net/disk_cache/ |
H A D | backend_impl.cc | 76 // and index number. For instance, if the arguments are "/foo", "bar" and 5, it 106 // Returns a full path to rename the current cache, in order to delete it. path 131 // We created this file so it should only contain ASCII. 315 // Return kDefaultCacheSize if it uses 80% to 10% of the available space. 324 // Return the target size (2.5 * kDefaultCacheSize) if it uses 10% to 1% 329 // Return 1% of the available space if it does not exceed kint32max. 573 // This is not really an error, but it is an interesting condition. 941 // This function is called when we want to remove it. 954 EntriesMap::iterator it = open_entries_.find(address.value()); local 955 if (it ! 967 EntriesMap::const_iterator it = local 1503 EntriesMap::iterator it = open_entries_.find(address.value()); local [all...] |
/external/chromium/net/http/ |
H A D | http_cache_unittest.cc | 35 // 'key' is prefixed with an identifier if it corresponds to a cached POST. 55 // variable. Just remember to reset it after the test!. 277 // already in the second pass). Just notify the caller that it finished. 390 EntryMap::iterator it = entries_.find(key); 391 if (it == entries_.end()) 394 if (it->second->is_doomed()) { 395 it->second->Release(); 396 entries_.erase(it); 402 it->second->AddRef(); 403 *entry = it 451 EntryMap::iterator it = entries_.find(key); local 503 EntryMap::iterator it = entries_.begin(); local [all...] |
/external/chromium/net/spdy/ |
H A D | spdy_session.cc | 51 for (spdy::SpdyHeaderBlock::const_iterator it = headers_->begin(); 52 it != headers_->end(); ++it) { 54 "%s: %s", it->first.c_str(), it->second.c_str()))); 91 for (spdy::SpdySettings::const_iterator it = settings_.begin(); 92 it != settings_.end(); ++it) { 94 base::StringPrintf("[%u:%u]", it->first.id(), it 864 ActiveStreamMap::iterator it = active_streams_.begin(); local 974 PushedStreamMap::iterator it; local 1009 PushedStreamMap::iterator it = unclaimed_pushed_streams_.find(path); local 1150 PushedStreamMap::iterator it = unclaimed_pushed_streams_.find(url); local 1647 spdy::SpdySettings::const_iterator it; local 1695 PendingCallbackMap::iterator it = pending_callback_map_.find(stream); local [all...] |
/external/chromium/sdch/open-vcdiff/src/ |
H A D | gflags.cc | 38 // * FlagSaver holds a FlagRegistry (saves it at construct time, 39 // restores it at destroy time). 61 // live. But it's possible to define your own flag, manually, in a 74 // Once it's instantiated, it has no dependencies or relationships 134 // If we have inttypes.h, it will have defined PRId32/etc for us. If 163 "comma-separated list of flag names that it is okay to specify " 198 // argument and then restore it when actually calling the function on 248 // whatever it returns. But first casts validate_fn_proto to a 308 // OK, it' 1599 vector<CommandLineFlag*>::const_iterator it; local 1630 vector<CommandLineFlag*>::const_iterator it; local [all...] |
/external/chromium/third_party/libjingle/source/talk/base/ |
H A D | httpcommon.cc | 321 for (HttpAttributeList::const_iterator it = attributes.begin(); 322 it != attributes.end(); ++it) { 323 if (it->first == name) { 325 *value = it->second; 449 HeaderMap::iterator it = headers_.find(name); local 450 if (it != headers_.end()) { 452 it->second.append(","); 453 it->second.append(value); 473 HeaderMap::const_iterator it local [all...] |
H A D | proxydetect.cc | 77 std::map<std::string, std::string>::const_iterator it = local 79 if (it != map_.end()) 80 return it->second; 464 // it. Perhaps that is legal profiles.ini syntax? 489 DirectoryIterator* it = Filesystem::IterateDirectory(); local 490 it->Iterate(path); 492 while (!EndsWith(it->Name(), extension)) { 493 if (!it->Next()) { 500 profile->AppendFolder(it->Name()); 501 delete it; [all...] |
H A D | sigslot.h | 14 // all of the thread safety support on platforms where it is 30 // compilers do this by default, but you may need to define it 34 // Unix/Linux/BSD, etc. - If you're using gcc, it is assumed that you have Posix threads 443 const_iterator it = hs.m_senders.begin(); local 446 while(it != itEnd) 448 (*it)->slot_duplicate(&hs, this); 449 m_senders.insert(*it); 450 ++it; 474 const_iterator it = m_senders.begin(); local 477 while(it ! 505 typename connections_list::const_iterator it = s.m_connected_slots.begin(); local 525 typename connections_list::const_iterator it = m_connected_slots.begin(); local 533 typename connections_list::const_iterator it = m_connected_slots.begin(); local 551 typename connections_list::const_iterator itNext, it = m_connected_slots.begin(); local 568 typename connections_list::iterator it = m_connected_slots.begin(); local 588 typename connections_list::iterator it = m_connected_slots.begin(); local 609 typename connections_list::iterator it = m_connected_slots.begin(); local 642 typename connections_list::const_iterator it = s.m_connected_slots.begin(); local 657 typename connections_list::iterator it = m_connected_slots.begin(); local 679 typename connections_list::const_iterator it = m_connected_slots.begin(); local 687 typename connections_list::const_iterator it = m_connected_slots.begin(); local 705 typename connections_list::const_iterator itNext, it = m_connected_slots.begin(); local 722 typename connections_list::iterator it = m_connected_slots.begin(); local 742 typename connections_list::iterator it = m_connected_slots.begin(); local 781 typename connections_list::const_iterator it = s.m_connected_slots.begin(); local 796 typename connections_list::iterator it = m_connected_slots.begin(); local 818 typename connections_list::const_iterator it = m_connected_slots.begin(); local 826 typename connections_list::const_iterator it = m_connected_slots.begin(); local 844 typename connections_list::const_iterator itNext, it = m_connected_slots.begin(); local 861 typename connections_list::iterator it = m_connected_slots.begin(); local 881 typename connections_list::iterator it = m_connected_slots.begin(); local 919 typename connections_list::const_iterator it = s.m_connected_slots.begin(); local 934 typename connections_list::iterator it = m_connected_slots.begin(); local 956 typename connections_list::const_iterator it = m_connected_slots.begin(); local 964 typename connections_list::const_iterator it = m_connected_slots.begin(); local 982 typename connections_list::const_iterator itNext, it = m_connected_slots.begin(); local 999 typename connections_list::iterator it = m_connected_slots.begin(); local 1019 typename connections_list::iterator it = m_connected_slots.begin(); local 1057 typename connections_list::const_iterator it = s.m_connected_slots.begin(); local 1072 typename connections_list::iterator it = m_connected_slots.begin(); local 1094 typename connections_list::const_iterator it = m_connected_slots.begin(); local 1102 typename connections_list::const_iterator it = m_connected_slots.begin(); local 1120 typename connections_list::const_iterator itNext, it = m_connected_slots.begin(); local 1137 typename connections_list::iterator it = m_connected_slots.begin(); local 1157 typename connections_list::iterator it = m_connected_slots.begin(); local 1197 typename connections_list::const_iterator it = s.m_connected_slots.begin(); local 1212 typename connections_list::iterator it = m_connected_slots.begin(); local 1234 typename connections_list::const_iterator it = m_connected_slots.begin(); local 1242 typename connections_list::const_iterator it = m_connected_slots.begin(); local 1260 typename connections_list::const_iterator itNext, it = m_connected_slots.begin(); local 1277 typename connections_list::iterator it = m_connected_slots.begin(); local 1297 typename connections_list::iterator it = m_connected_slots.begin(); local 1337 typename connections_list::const_iterator it = s.m_connected_slots.begin(); local 1352 typename connections_list::iterator it = m_connected_slots.begin(); local 1374 typename connections_list::const_iterator it = m_connected_slots.begin(); local 1382 typename connections_list::const_iterator it = m_connected_slots.begin(); local 1400 typename connections_list::const_iterator itNext, it = m_connected_slots.begin(); local 1417 typename connections_list::iterator it = m_connected_slots.begin(); local 1437 typename connections_list::iterator it = m_connected_slots.begin(); local 1477 typename connections_list::const_iterator it = s.m_connected_slots.begin(); local 1492 typename connections_list::iterator it = m_connected_slots.begin(); local 1514 typename connections_list::const_iterator it = m_connected_slots.begin(); local 1522 typename connections_list::const_iterator it = m_connected_slots.begin(); local 1540 typename connections_list::const_iterator itNext, it = m_connected_slots.begin(); local 1557 typename connections_list::iterator it = m_connected_slots.begin(); local 1577 typename connections_list::iterator it = m_connected_slots.begin(); local 1618 typename connections_list::const_iterator it = s.m_connected_slots.begin(); local 1633 typename connections_list::iterator it = m_connected_slots.begin(); local 1655 typename connections_list::const_iterator it = m_connected_slots.begin(); local 1663 typename connections_list::const_iterator it = m_connected_slots.begin(); local 1681 typename connections_list::const_iterator itNext, it = m_connected_slots.begin(); local 1698 typename connections_list::iterator it = m_connected_slots.begin(); local 1718 typename connections_list::iterator it = m_connected_slots.begin(); local 2223 typename connections_list::const_iterator itNext, it = m_connected_slots.begin(); local 2240 typename connections_list::const_iterator itNext, it = m_connected_slots.begin(); local 2287 typename connections_list::const_iterator itNext, it = m_connected_slots.begin(); local 2304 typename connections_list::const_iterator itNext, it = m_connected_slots.begin(); local 2352 typename connections_list::const_iterator itNext, it = m_connected_slots.begin(); local 2369 typename connections_list::const_iterator itNext, it = m_connected_slots.begin(); local 2418 typename connections_list::const_iterator itNext, it = m_connected_slots.begin(); local 2435 typename connections_list::const_iterator itNext, it = m_connected_slots.begin(); local 2485 typename connections_list::const_iterator itNext, it = m_connected_slots.begin(); local 2502 typename connections_list::const_iterator itNext, it = m_connected_slots.begin(); local 2556 typename connections_list::const_iterator itNext, it = m_connected_slots.begin(); local 2574 typename connections_list::const_iterator itNext, it = m_connected_slots.begin(); local 2630 typename connections_list::const_iterator itNext, it = m_connected_slots.begin(); local 2648 typename connections_list::const_iterator itNext, it = m_connected_slots.begin(); local 2705 typename connections_list::const_iterator itNext, it = m_connected_slots.begin(); local 2723 typename connections_list::const_iterator itNext, it = m_connected_slots.begin(); local 2781 typename connections_list::const_iterator itNext, it = m_connected_slots.begin(); local 2799 typename connections_list::const_iterator itNext, it = m_connected_slots.begin(); local [all...] |
/external/clang/lib/AST/ |
H A D | RecordLayoutBuilder.cpp | 39 /// If a base is virtual, it will only have one BaseSubobjectInfo allocated. 717 /// lays it out. Will then proceed to lay out all non-virtual base clasess. 742 /// LayoutBase - Will lay out a base and return the offset where it was 811 // If it's not an indirect primary base, then we've found our primary 832 // If the class isn't dynamic, it won't have a primary base. 853 // We found it. 876 // Otherwise, it is the first indirect primary base class, if one exists. 900 // We don't, create it. 928 // We did have info about this primary base, and it turns out that it 1238 it = offsets.find(overridden->getParent()); local [all...] |