/haiku-fatelf/src/add-ons/translators/webp/libwebp/enc/ |
H A D | iterator.c | 24 static void InitLeft(VP8EncIterator* const it) { argument 25 const VP8Encoder* const enc = it->enc_; 27 (it->y_) > 0 ? 129 : 127; 31 it->left_nz_[8] = 0; 34 static void InitTop(VP8EncIterator* const it) { argument 35 const VP8Encoder* const enc = it->enc_; 41 void VP8IteratorReset(VP8EncIterator* const it) { argument 42 VP8Encoder* const enc = it->enc_; 43 it->x_ = 0; 44 it 58 VP8IteratorInit(VP8Encoder* const enc, VP8EncIterator* const it) argument 75 VP8IteratorImport(const VP8EncIterator* const it) argument 128 VP8IteratorExport(const VP8EncIterator* const it) argument 177 VP8IteratorNzToBytes(VP8EncIterator* const it) argument 208 VP8IteratorBytesToNz(VP8EncIterator* const it) argument 228 VP8IteratorNext(VP8EncIterator* const it, const uint8_t* const block_to_save) argument 273 VP8SetIntra16Mode(const VP8EncIterator* it, int mode) argument 283 VP8SetIntra4Mode(const VP8EncIterator* const it, int modes[16]) argument 295 VP8SetIntraUVMode(const VP8EncIterator* const it, int mode) argument 299 VP8SetSkip(const VP8EncIterator* const it, int skip) argument 303 VP8SetSegment(const VP8EncIterator* const it, int segment) argument 346 VP8IteratorStartI4(VP8EncIterator* const it) argument 373 VP8IteratorRotateI4(VP8EncIterator* const it, const uint8_t* const yuv_out) argument [all...] |
H A D | quant.c | 267 // We map it to the safe maximal range of MAX/MIN_DQ_UV for dq_uv. 272 // and make it safe. 303 void VP8MakeLuma16Preds(const VP8EncIterator* const it) { argument 304 VP8Encoder* const enc = it->enc_; 305 const uint8_t* left = it->x_ ? enc->y_left_ : NULL; 306 const uint8_t* top = it->y_ ? enc->y_top_ + it->x_ * 16 : NULL; 307 VP8EncPredLuma16(it->yuv_p_, left, top); 310 void VP8MakeChroma8Preds(const VP8EncIterator* const it) { argument 311 VP8Encoder* const enc = it 317 VP8MakeIntra4Preds(const VP8EncIterator* const it) argument 452 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 612 ReconstructIntra16(VP8EncIterator* const it, VP8ModeScore* const rd, uint8_t* const yuv_out, int mode) argument 658 ReconstructIntra4(VP8EncIterator* const it, int16_t levels[16], const uint8_t* const src, uint8_t* const yuv_out, int mode) argument 682 ReconstructUV(VP8EncIterator* const it, VP8ModeScore* const rd, uint8_t* const yuv_out, int mode) argument 731 SwapOut(VP8EncIterator* const it) argument 735 PickBestIntra16(VP8EncIterator* const it, VP8ModeScore* const rd) argument 777 GetCostModeI4(VP8EncIterator* const it, const int modes[16]) argument 786 PickBestIntra4(VP8EncIterator* const it, VP8ModeScore* const rd) argument 855 PickBestUV(VP8EncIterator* const it, VP8ModeScore* const rd) argument 894 SimpleQuantize(VP8EncIterator* const it, VP8ModeScore* const rd) argument 921 VP8Decimate(VP8EncIterator* const it, VP8ModeScore* const rd, int rd_opt) argument [all...] |
H A D | frame.c | 236 int VP8GetCostLuma4(VP8EncIterator* const it, const int16_t levels[16]) { argument 237 const int x = (it->i4_ & 3), y = (it->i4_ >> 2); 242 InitResidual(0, 3, it->enc_, &res); 243 ctx = it->top_nz_[x] + it->left_nz_[y]; 249 int VP8GetCostLuma16(VP8EncIterator* const it, const VP8ModeScore* const rd) { argument 254 VP8IteratorNzToBytes(it); // re-import the non-zero context 257 InitResidual(0, 1, it->enc_, &res); 259 R += GetResidualCost(it 274 VP8GetCostUV(VP8EncIterator* const it, const VP8ModeScore* const rd) argument 369 CodeResiduals(VP8BitWriter* const bw, VP8EncIterator* const it, const VP8ModeScore* const rd) argument 423 RecordResiduals(VP8EncIterator* const it, const VP8ModeScore* const rd) argument 483 StoreSSE(const VP8EncIterator* const it) argument 494 StoreSideInfo(const VP8EncIterator* const it) argument 533 ResetAfterSkip(VP8EncIterator* const it) argument 544 VP8EncIterator it; local 602 VP8EncIterator it; local [all...] |
H A D | analysis.c | 273 static int MBAnalyzeBestIntra16Mode(VP8EncIterator* const it) { argument 274 const int max_mode = (it->enc_->method_ >= 3) ? MAX_INTRA16_MODE : 4; 279 VP8MakeLuma16Preds(it); 281 const int alpha = CollectHistogram(it->yuv_in_ + Y_OFF, 282 it->yuv_p_ + VP8I16ModeOffsets[mode], 289 VP8SetIntra16Mode(it, best_mode); 293 static int MBAnalyzeBestIntra4Mode(VP8EncIterator* const it, argument 296 const int max_mode = (it->enc_->method_ >= 3) ? MAX_INTRA4_MODE : NUM_BMODES; 298 VP8IteratorStartI4(it); 302 const uint8_t* const src = it 325 MBAnalyzeBestUVMode(VP8EncIterator* const it) argument 344 MBAnalyze(VP8EncIterator* const it, int alphas[256], int* const uv_alpha) argument 382 VP8EncIterator it; local [all...] |
H A D | filter.c | 81 static inline int needs_filter2(const uint8_t* p, int step, int t, int it) { argument 86 return abs0[255 + p3 - p2] <= it && abs0[255 + p2 - p1] <= it && 87 abs0[255 + p1 - p0] <= it && abs0[255 + q3 - q2] <= it && 88 abs0[255 + q2 - q1] <= it && abs0[255 + q1 - q0] <= it; 204 static void DoFilter(const VP8EncIterator* const it, int level) { argument 205 const VP8Encoder* const enc = it->enc_; 209 uint8_t* const y_dst = it 305 VP8InitFilter(VP8EncIterator* const it) argument 317 VP8StoreFilterStats(VP8EncIterator* const it) argument 350 VP8AdjustFilterStrength(VP8EncIterator* const it) argument [all...] |
H A D | vp8enci.h | 261 void VP8IteratorInit(VP8Encoder* const enc, VP8EncIterator* const it); 263 void VP8IteratorReset(VP8EncIterator* const it); 265 void VP8IteratorImport(const VP8EncIterator* const it); 267 void VP8IteratorExport(const VP8EncIterator* const it); 270 // it->yuv_out_ or it->yuv_in_. 271 int VP8IteratorNext(VP8EncIterator* const it, 274 void VP8IteratorStartI4(VP8EncIterator* const it); 276 int VP8IteratorRotateI4(VP8EncIterator* const it, 280 void VP8IteratorNzToBytes(VP8EncIterator* const it); [all...] |
/haiku-fatelf/src/libs/ncurses/ncurses/ |
H A D | codes.c | 9 #define DCL(it) static IT data##it[] 11 #define DCL(it) NCURSES_EXPORT_VAR(IT) it[] 64 "it", 525 #define FIX(it) NCURSES_IMPEXP IT * NCURSES_API _nc_##it(void) { return data##it; }
|
H A D | names.c | 9 #define DCL(it) static IT data##it[] 11 #define DCL(it) NCURSES_EXPORT_VAR(IT) it[] 117 "it", 1038 #define FIX(it) NCURSES_IMPEXP IT * NCURSES_API _nc_##it(void) { return data##it; }
|
/haiku-fatelf/src/servers/registrar/ |
H A D | WatchingService.cpp | 44 supplied, only to those watchers it selects. 79 for (watcher_map::iterator it = fWatchers.begin(); 80 it != fWatchers.end(); 81 ++it) { 82 delete it->second; 90 is the caller must not delete it after the method returns. 134 deletes it. 137 to the caller, otherwise it is deleted. 148 watcher_map::iterator it = fWatchers.find(watcher->Target()); local 149 bool result = (it ! 177 watcher_map::iterator it = fWatchers.find(target); local [all...] |
H A D | AppInfoList.h | 83 inline Iterator(const Iterator &it) argument 84 : fList(it.fList), 85 fIndex(it.fIndex), 86 fCount(it.fCount) 105 inline Iterator &operator=(const Iterator &it) argument 107 fList = it.fList; 108 fIndex = it.fIndex; 109 fCount = it.fCount; 135 inline bool operator==(const Iterator &it) const 137 return (fList == it [all...] |
/haiku-fatelf/src/apps/cortex/RouteApp/ |
H A D | NodeSetIOContext.cpp | 65 for(node_set::const_iterator it = m_nodes.begin(); 66 it != m_nodes.end(); ++it) { 68 if((*it).second == node) { 71 (*it).first.Length() && 72 strcmp(key, (*it).first.String()) != 0) { 76 node, key, (*it).first.String())); 96 for(node_set::iterator it = m_nodes.begin(); 97 it != m_nodes.end(); ++it) { [all...] |
/haiku-fatelf/src/tools/cppunit/ |
H A D | BTestSuite.cpp | 26 for ( map<string, CppUnit::Test*>::iterator it = fTests.begin(); 27 it != fTests.end(); 28 ++it) 29 delete it->second; 38 for ( map<string, CppUnit::Test*>::iterator it = fTests.begin(); 39 it != fTests.end(); 40 ++it ) 45 Test *test = it->second; 57 for ( map<string, CppUnit::Test *>::const_iterator it = fTests.begin(); 58 it ! [all...] |
/haiku-fatelf/src/tools/cppunit/cppunit/ |
H A D | TestSuite.cpp | 24 for ( vector<Test *>::iterator it = m_tests.begin(); 25 it != m_tests.end(); 26 ++it) 27 delete *it; 36 for ( vector<Test *>::iterator it = m_tests.begin(); 37 it != m_tests.end(); 38 ++it ) 43 Test *test = *it; 55 for ( vector<Test *>::const_iterator it = m_tests.begin(); 56 it ! [all...] |
H A D | TestResult.cpp | 62 for ( TestListeners::iterator it = m_listeners.begin(); 63 it != m_listeners.end(); 64 ++it ) 65 (*it)->addFailure( failure ); 74 for ( TestListeners::iterator it = m_listeners.begin(); 75 it != m_listeners.end(); 76 ++it ) 77 (*it)->startTest( test ); 86 for ( TestListeners::iterator it = m_listeners.begin(); 87 it ! [all...] |
H A D | TestFactoryRegistry.cpp | 52 Registries::iterator it = m_registries.begin(); local 53 while ( it != m_registries.end() ) 55 TestFactoryRegistry *registry = (it++)->second; 127 for ( Factories::iterator it = m_factories.begin(); it != m_factories.end(); ++it ) 129 TestFactory *factory = it->second; 182 for ( Factories::iterator it = m_factories.begin(); 183 it != m_factories.end(); 184 ++it ) [all...] |
/haiku-fatelf/src/tests/system/libroot/posix/posixtestsuite/conformance/interfaces/fork/ |
H A D | 13-1.c | 5 * This program is free software; you can redistribute it and/or modify it 9 * This program is distributed in the hope that it would be useful, but 95 struct itimerval it; local 101 it.it_interval.tv_sec = 15; 102 it.it_interval.tv_usec = 0; 103 it.it_value.tv_sec = 10; 104 it.it_value.tv_usec = 0; 106 ret = setitimer( ITIMER_REAL, &it, NULL ); 113 ret = setitimer( ITIMER_VIRTUAL, &it, NUL [all...] |
/haiku-fatelf/src/add-ons/kernel/file_systems/netfs/shared/ |
H A D | AbstractConnection.cpp | 30 for (ChannelVector::Iterator it = fDownStreamChannels.Begin(); 31 it != fDownStreamChannels.End(); 32 it++) { 33 delete *it; 37 for (ChannelVector::Iterator it = fUpStreamChannels.Begin(); 38 it != fUpStreamChannels.End(); 39 it++) { 40 delete *it; 62 for (ChannelVector::Iterator it = fDownStreamChannels.Begin(); 63 it ! [all...] |
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/netfs/shared/ |
H A D | AbstractConnection.cpp | 28 for (ChannelVector::Iterator it = fDownStreamChannels.Begin(); 29 it != fDownStreamChannels.End(); 30 it++) { 31 delete *it; 35 for (ChannelVector::Iterator it = fUpStreamChannels.Begin(); 36 it != fUpStreamChannels.End(); 37 it++) { 38 delete *it; 60 for (ChannelVector::Iterator it = fDownStreamChannels.Begin(); 61 it ! [all...] |
/haiku-fatelf/src/apps/cortex/TipManager/ |
H A D | TipManagerImpl.cpp | 70 for(list<_ViewEntry*>::iterator it = m_childViews.begin(); 71 it != m_childViews.end(); ++it) { 72 delete *it; 74 for(tip_entry_set::iterator it = m_tips.begin(); 75 it != m_tips.end(); ++it) { 76 delete *it; 126 // found a home; can it hold the tip? 184 // it' 195 tip_entry_set::iterator it = viewEntry->m_tips.lower_bound(&matchEntry); local 238 list<_ViewEntry*>::iterator it = local [all...] |
/haiku-fatelf/src/bin/coreutils/man/ |
H A D | shred.x | 2 shred \- overwrite a file to hide its contents, and optionally delete it
|
/haiku-fatelf/src/kits/network/libnetapi/ |
H A D | NetworkCookieJarPrivate.h | 16 BNetworkCookieHashMap::Iterator it) 18 fCookieMapIterator(it) 15 PrivateIterator( BNetworkCookieHashMap::Iterator it) argument
|
/haiku-fatelf/src/add-ons/mail_daemon/inbound_protocols/imap/imap_lib/ |
H A D | IMAPStorage.cpp | 38 for (MailEntryMap::const_iterator it = files.begin(); it != files.end(); 39 it++) { 40 const StorageMailEntry& mailEntry = (*it).second; 58 for (MailEntryMap::const_iterator it = files.begin(); it != files.end(); 59 it++) { 60 const StorageMailEntry& mailEntry = (*it).second; 93 // limit to a fix number to make it interruptable see StopNow() 212 MailEntryMap::const_iterator it local 235 MailEntryMap::iterator it = fMailEntryMap.find(uid); local 256 MailEntryMap::iterator it = fMailEntryMap.find(uid); local 277 MailEntryMap::const_iterator it = fMailEntryMap.find(uid); local 288 MailEntryMap::iterator it = fMailEntryMap.find(uid); local 317 MailEntryMap::const_iterator it = fMailEntryMap.find(uid); local 327 MailEntryMap::iterator it = fMailEntryMap.find(uid); local 357 MailEntryMap::iterator it = fMailEntryMap.find(uid); local 406 MailEntryMap::iterator it = fMailEntryMap.find(uid); local [all...] |
/haiku-fatelf/src/bin/bash/lib/sh/ |
H A D | ufuncs.c | 7 Bash is free software: you can redistribute it and/or modify 8 it under the terms of the GNU General Public License as published by 12 Bash is distributed in the hope that it will be useful, 40 /* A version of `alarm' using setitimer if it's available. */ 47 struct itimerval it, oit; local 49 it.it_interval.tv_sec = 0; 50 it.it_interval.tv_usec = 0; 52 it.it_value.tv_sec = secs; 53 it.it_value.tv_usec = usecs; 55 if (setitimer(ITIMER_REAL, &it, [all...] |
/haiku-fatelf/src/apps/cortex/support/ |
H A D | ProfileTarget.cpp | 94 for(block_entry_map::const_iterator it = m_blockEntryMap.begin(); 95 it != m_blockEntryMap.end(); 96 it++) { 97 if((*it).first.Length() > nameLength) 98 nameLength = (*it).first.Length(); 100 sorted.back() = (*it).second; 101 sorted.back().name = (*it).first.String();
|
/haiku-fatelf/src/system/kernel/disk_device_manager/ |
H A D | KPartition.cpp | 1009 // can't fail, since it's already loaded 1335 for (ListenerSet::Iterator it = fListeners->Begin(); 1336 it != fListeners->End(); ++it) { 1337 (*it)->OffsetChanged(this, offset); 1347 for (ListenerSet::Iterator it = fListeners->Begin(); 1348 it != fListeners->End(); ++it) { 1349 (*it)->SizeChanged(this, size); 1359 for (ListenerSet::Iterator it [all...] |