/external/llvm/lib/Target/X86/ |
H A D | X86SelectionDAGInfo.cpp | 84 SDValue Count; local 113 Count = DAG.getIntPtrConstant(SizeVal); 119 Count = DAG.getIntPtrConstant(SizeVal / UBytes); 128 Count = DAG.getIntPtrConstant(SizeVal); 134 Count, InFlag); 146 Count = Size; 147 EVT CVT = Count.getValueType(); 148 SDValue Left = DAG.getNode(ISD::AND, dl, CVT, Count, 226 SDValue Count = DAG.getIntPtrConstant(CountVal); local 232 Count, InFla [all...] |
/external/llvm/lib/Transforms/Utils/ |
H A D | LoopUnroll.cpp | 122 /// Unroll the given loop by Count. The loop must be in LCSSA form. Returns true 147 bool llvm::UnrollLoop(Loop *L, unsigned Count, unsigned TripCount, argument 186 DEBUG(dbgs() << " Trip Count = " << TripCount << "\n"); 192 if (TripCount != 0 && Count > TripCount) 193 Count = TripCount; 197 if (TripCount == 0 && Count < 2) 200 assert(Count > 0); 205 bool CompletelyUnroll = Count == TripCount; 210 bool RuntimeTripCount = (TripCount == 0 && Count > 0 && AllowRuntime); 212 if (RuntimeTripCount && !UnrollRuntimeLoopProlog(L, Count, L [all...] |
H A D | LoopUnrollRuntime.cpp | 57 static void ConnectProlog(Loop *L, Value *TripCount, unsigned Count, argument 112 ConstantInt::get(TripCount->getType(), Count)); 228 bool llvm::UnrollRuntimeLoopProlog(Loop *L, unsigned Count, LoopInfo *LI, argument 260 // Count is the loop unroll factor, the number of extra copies added + 1. 261 if ((Count & (Count-1)) != 0) 285 Value *ModVal = B.CreateAnd(TripCount, Count - 1, "xtraiter"); 317 for (unsigned leftOverIters = Count-1; leftOverIters > 0; --leftOverIters) { 323 CloneLoopBlocks(L, (leftOverIters == Count-1), LastLoopBB, PEnd, NewBlocks, 333 if (leftOverIters == Count [all...] |
/external/llvm/tools/llvm-objdump/ |
H A D | COFFDump.cpp | 237 printSEHTable(const COFFObjectFile *Obj, uint32_t TableVA, int Count) { argument 238 if (Count == 0) 250 for (int I = 0; I < Count; ++I) 297 << "\n SEH Count: " << LoadConf->SEHandlerCount
|
/external/llvm/unittests/IR/ |
H A D | PassManagerTest.cpp | 25 Result(int Count) : InstructionCount(Count) {} argument 37 int Count = 0; local 41 ++Count; 42 return Result(Count); 57 Result(int Count) : FunctionCount(Count) {} argument 67 int Count = 0; local 69 ++Count; 70 return Result(Count); [all...] |
/external/llvm/utils/PerfectShuffle/ |
H A D | PerfectShuffle.cpp | 194 unsigned Count = 0; local 196 Count += ShufTab[i].Cost < 100; 197 return Count;
|
/external/openfst/src/include/fst/ |
H A D | interval-set.h | 89 T Count() const { return count_; } function in class:fst::IntervalSet 341 if (iset.Count() > Count())
|
/external/pdfium/core/src/fxge/Microsoft SDK/include/ |
H A D | GdiPlusPixelFormats.h | 197 UINT Count; // number of color entries
member in struct:ColorPalette
|
/external/pdfium/fpdfsdk/include/ |
H A D | fsdk_annothandler.h | 232 virtual int Count(){return m_pIteratorAnnotList.GetSize();}
function in class:CPDFSDK_AnnotIterator
|
/external/skia/src/utils/ |
H A D | SkParse.cpp | 65 int SkParse::Count(const char str[]) function in class:SkParse 86 int SkParse::Count(const char str[], char separator) function in class:SkParse
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
H A D | BufferedTreeNodeStream.cs | 80 if (_index < _outer.nodes.Count) 99 if (_index < _outer.nodes.Count) 102 return _index < _outer.nodes.Count; 172 public virtual int Count { property in class:Antlr.Runtime.Tree.BufferedTreeNodeStream 175 throw new InvalidOperationException("Cannot determine the Count before the buffer is filled."); 177 return nodes.Count; 284 for (int i = 0; i < nodes.Count; i++) { 335 if ((p + k - 1) >= nodes.Count) { 353 Console.Out.WriteLine( "start last node: " + i + " size==" + nodes.Count ); 475 for (int i = 0; i < nodes.Count; [all...] |
/external/chromium_org/third_party/tcmalloc/chromium/src/ |
H A D | malloc_extension.cc | 247 uintptr_t Count(void** entry) { function in namespace:__anon15563 277 for (void** entry = entries; Count(entry) != 0; entry += 3 + Depth(entry)) { 278 total_count += Count(entry); 291 PrintCountAndSize(writer, Count(entry), Size(entry)); 319 for (void** entry = entries; Count(entry) != 0; entry += 3 + Depth(entry)) { 343 for (void** entry = entries; Count(entry) != 0; entry += 3 + Depth(entry)) {
|
/external/chromium_org/third_party/tcmalloc/vendor/src/ |
H A D | malloc_extension.cc | 230 uintptr_t Count(void** entry) { function in namespace:__anon15606 260 for (void** entry = entries; Count(entry) != 0; entry += 3 + Depth(entry)) { 261 total_count += Count(entry); 274 PrintCountAndSize(writer, Count(entry), Size(entry)); 302 for (void** entry = entries; Count(entry) != 0; entry += 3 + Depth(entry)) { 326 for (void** entry = entries; Count(entry) != 0; entry += 3 + Depth(entry)) {
|
/external/clang/lib/StaticAnalyzer/Core/ |
H A D | SValBuilder.cpp | 112 unsigned Count) { 121 return conjureSymbolVal(SymbolTag, Ex, LCtx, T, Count); 109 conjureSymbolVal(const void *SymbolTag, const Expr *Ex, const LocationContext *LCtx, unsigned Count) argument
|
H A D | SymbolManager.cpp | 169 unsigned Count, 172 SymbolConjured::Profile(profile, E, T, Count, LCtx, SymbolTag); 177 new (SD) SymbolConjured(SymbolCounter, E, LCtx, T, Count, SymbolTag); 221 unsigned Count, const void *SymbolTag) { 224 SymbolMetadata::Profile(profile, R, S, T, Count, SymbolTag); 229 new (SD) SymbolMetadata(SymbolCounter, R, S, T, Count, SymbolTag); 166 conjureSymbol(const Stmt *E, const LocationContext *LCtx, QualType T, unsigned Count, const void *SymbolTag) argument 220 getMetadataSymbol(const MemRegion* R, const Stmt *S, QualType T, unsigned Count, const void *SymbolTag) argument
|
/external/clang/unittests/AST/ |
H A D | CommentParser.cpp | 80 ::testing::AssertionResult HasChildCount(const Comment *C, size_t Count) { argument 84 if (Count != C->child_count()) 86 << "Count = " << Count
|
/external/llvm/include/llvm/ADT/ |
H A D | IntervalMap.h | 224 /// @param Count Number of elements to copy. 227 unsigned j, unsigned Count) { 228 assert(i + Count <= M && "Invalid source range"); 229 assert(j + Count <= N && "Invalid dest range"); 230 for (unsigned e = i + Count; i != e; ++i, ++j) { 239 /// @param Count Number of elements to copy. 240 void moveLeft(unsigned i, unsigned j, unsigned Count) { argument 242 copy(*this, i, j, Count); 248 /// @param Count Number of elements to copy. 249 void moveRight(unsigned i, unsigned j, unsigned Count) { argument 226 copy(const NodeBase<T1, T2, M> &Other, unsigned i, unsigned j, unsigned Count) argument 285 transferToLeftSib(unsigned Size, NodeBase &Sib, unsigned SSize, unsigned Count) argument 296 transferToRightSib(unsigned Size, NodeBase &Sib, unsigned SSize, unsigned Count) argument 312 unsigned Count = std::min(std::min(unsigned(Add), SSize), N - Size); local 317 unsigned Count = std::min(std::min(unsigned(-Add), Size), N - SSize); local [all...] |
/external/llvm/lib/CodeGen/ |
H A D | PostRASchedulerList.cpp | 168 void Observe(MachineInstr *MI, unsigned Count); 310 unsigned Count = MBB->size(), CurrentCount = Count; local 313 --Count; 318 Scheduler.enterRegion(MBB, I, Current, CurrentCount - Count); 324 CurrentCount = Count; 329 Count -= MI->getBundleSize(); 331 assert(Count == 0 && "Instruction count mismatch!"); 400 void SchedulePostRATDList::Observe(MachineInstr *MI, unsigned Count) { argument 402 AntiDepBreak->Observe(MI, Count, EndInde [all...] |
/external/llvm/lib/Target/AArch64/MCTargetDesc/ |
H A D | AArch64AsmBackend.cpp | 76 bool writeNopData(uint64_t Count, MCObjectWriter *OW) const override; 244 bool AArch64AsmBackend::writeNopData(uint64_t Count, MCObjectWriter *OW) const { argument 248 if ((Count & 3) != 0) { 249 for (uint64_t i = 0, e = (Count & 3); i != e; ++i) 254 Count /= 4; 255 for (uint64_t i = 0; i != Count; ++i)
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | LoopUnrollPass.cpp | 129 UP.Count = CurrentCount; 192 Pass *llvm::createLoopUnrollPass(int Threshold, int Count, int AllowPartial, argument 194 return new LoopUnroll(Threshold, Count, AllowPartial, Runtime); 270 unsigned Count = CountValue->getZExtValue(); local 271 assert(Count >= 1 && "Unroll count must be positive."); 272 return Count; 285 unsigned Count = UserCount ? CurrentCount : 0; local 289 if (Count == 0) { 291 Count = PragmaCount; 295 Count 356 unsigned Count = selectUnrollCount(L, TripCount, HasEnablePragma, PragmaCount, local [all...] |
/external/llvm/tools/llvm-diff/ |
H A D | DifferenceEngine.cpp | 127 unsigned Count = 0; local 129 if (!Blocks.count(*I)) Count++; 130 return Count;
|
/external/llvm/tools/llvm-readobj/ |
H A D | ARMWinEHPrinter.cpp | 281 unsigned Count = (OC[Offset] & 0x3); local 284 | (((1 << (Count + 1)) - 1) << 4); 298 unsigned Count = (OC[Offset] & 0x3) + 4; local 301 | (((1 << (Count + 1)) - 1) << 4);
|
/external/pdfium/fpdfsdk/src/javascript/ |
H A D | JS_GlobalData.cpp | 27 for (int i=0,sz=array.Count(); i<sz; i++)
85 int CJS_GlobalVariableArray::Count() const
function in class:CJS_GlobalVariableArray
|
/external/chromium_org/base/metrics/ |
H A D | histogram.cc | 57 INT_MAX / sizeof(HistogramBase::Count) <= *bucket_count || 81 typedef HistogramBase::Count Count; typedef in namespace:base 327 double Histogram::GetBucketSize(Count current, size_t i) const { 380 Count sample_count = snapshot->TotalCount(); 413 Count current = snapshot->GetCountAtIndex(i); 452 Count sample_count, 470 const Count current, 489 void Histogram::GetCountAndBucketData(Count* count, 595 double LinearHistogram::GetBucketSize(Count curren [all...] |
/external/chromium_org/third_party/webrtc/video_engine/ |
H A D | overuse_frame_detector.cc | 110 uint64_t Statistics::Count() const { return count_; } function in class:webrtc::Statistics
|