count 48 MMgc/BasicList.h BasicList() : count(0),
count 68 MMgc/BasicList.h count = capacity = iteratorCount = 0;
count 76 MMgc/BasicList.h if (count == capacity)
count 81 MMgc/BasicList.h VMPI_memcpy(newItems, items, count * sizeof(T));
count 85 MMgc/BasicList.h items[count] = item;
count 86 MMgc/BasicList.h count++;
count 93 MMgc/BasicList.h if (count == capacity)
count 103 MMgc/BasicList.h VMPI_memcpy(newItems, items, count * sizeof(T));
count 107 MMgc/BasicList.h items[count] = item;
count 108 MMgc/BasicList.h count++;
count 125 MMgc/BasicList.h count--;
count 126 MMgc/BasicList.h if (i != count)
count 136 MMgc/BasicList.h uint32_t Count() const { return count; }
count 139 MMgc/BasicList.h uint32_t Limit() const { return holes ? capacity : count; }
count 181 MMgc/BasicList.h GCAssert(i == count);
count 185 MMgc/BasicList.h uint32_t count, capacity;
count 275 MMgc/FixedMalloc.cpp return Alloc(GCHeap::CheckForCallocSizeOverflow(count, elsize), opts);
count 98 MMgc/FixedMalloc.h void *Calloc(size_t count, size_t size, FixedMallocOpts flags=kNone);
count 156 MMgc/GC-inlines.h REALLY_INLINE void *GC::Calloc(size_t count, size_t elsize, int flags)
count 158 MMgc/GC-inlines.h return Alloc(GCHeap::CheckForCallocSizeOverflow(count, elsize), flags);
count 2683 MMgc/GC.cpp mov ecx, [count]
count 3012 MMgc/GC.cpp unsigned int count = m_incrementalWork.Count();
count 3013 MMgc/GC.cpp if (count == 0) {
count 3015 MMgc/GC.cpp count = m_incrementalWork.Count();
count 3016 MMgc/GC.cpp if (count == 0)
count 3019 MMgc/GC.cpp if (count > checkTimeIncrements) {
count 3020 MMgc/GC.cpp count = checkTimeIncrements;
count 3022 MMgc/GC.cpp for(unsigned int i=0; i<count; i++)
count 3883 MMgc/GC.cpp if(blacklist.count() > 0) {
count 3896 MMgc/GC.cpp if(blacklist.count() > 0) {
count 433 MMgc/GCAlloc.cpp uint32_t count = b->nextItem ? GetIndex(b, b->nextItem) : m_itemsPerBlock;
count 435 MMgc/GCAlloc.cpp uint32_t numInts = ((count+7)&~7) >> 3;
count 441 MMgc/GCAlloc.cpp uint32_t subCount = i==(numInts-1) ? ((count-1)&7)+1 : 8;
count 527 MMgc/GCAlloc.cpp uint32_t count = b->nextItem ? GetIndex(b, b->nextItem) : m_itemsPerBlock;
count 529 MMgc/GCAlloc.cpp uint32_t numInts = ((count+7)&~7) >> 3;
count 535 MMgc/GCAlloc.cpp uint32_t subCount = i==(numInts-1) ? ((count-1)&7)+1 : 8;
count 632 MMgc/GCAlloc.cpp uint32_t count = b->nextItem ? GetIndex(b, b->nextItem) : m_itemsPerBlock;
count 635 MMgc/GCAlloc.cpp uint32_t numInts = ((count+7)&~7) >> 3;
count 641 MMgc/GCAlloc.cpp uint32_t subCount = i==(numInts-1) ? ((count-1)&7)+1 : 8;
count 70 MMgc/GCDebug.cpp while (count > 10) {
count 72 MMgc/GCDebug.cpp count -= 10;
count 74 MMgc/GCDebug.cpp while (count > 0) {
count 76 MMgc/GCDebug.cpp count--;
count 79 MMgc/GCDebug.cpp (void)count;
count 48 MMgc/GCDebug.h void GCDebugIndent(size_t count);
count 152 MMgc/GCGlobalNew.cpp size_t size = GCHeap::CheckForCallocSizeOverflow(count, elsize);
count 160 MMgc/GCGlobalNew.cpp *(size_t*)p = count;
count 237 MMgc/GCGlobalNew.h void* NewTaggedArray(size_t count, size_t elsize, FixedMallocOpts opts, bool isPrimitive);
count 270 MMgc/GCGlobalNew.h T *mem = (T*) MMgc::NewTaggedArray(count, sizeof(T), opts, false /* !isPrimitive */);
count 272 MMgc/GCGlobalNew.h for(size_t i=count; i>0; i--, tp++)
count 278 MMgc/GCGlobalNew.h template <> REALLY_INLINE _x *MMgcConstructTaggedArray(_x*, size_t count, MMgc::FixedMallocOpts opts) \
count 280 MMgc/GCGlobalNew.h return (_x*)MMgc::NewTaggedArray(count, sizeof(_x), opts, true /* isPrimitive */); \
count 304 MMgc/GCGlobalNew.h size_t count = *(size_t*)(void*)p;
count 306 MMgc/GCGlobalNew.h T* tail = mem + count;
count 353 MMgc/GCGlobalNew.h return (void*)MMgc::NewTaggedArray(count, sizeof(void*), opts, true /* isPrimitive */);
count 65 MMgc/GCHashtable.h REALLY_INLINE uint32_t count() const { return numValues - numDeleted; }
count 2094 MMgc/GCHeap.cpp char* buf = count < 100 ? tmp : (char*)VMPI_alloc(count+1);
count 2097 MMgc/GCHeap.cpp VMPI_memset(buf, c, count);
count 2098 MMgc/GCHeap.cpp buf[count] = '\0';
count 531 MMgc/GCHeap.h REALLY_INLINE static size_t CheckForCallocSizeOverflow(size_t count, size_t elsize)
count 537 MMgc/GCHeap.h uint64_t total = (uint64_t)elsize * (uint64_t)count;
count 540 MMgc/GCHeap.h || count >= kMaxObjectSize
count 743 MMgc/GCHeap.h void LogChar(char c, size_t count);
count 70 MMgc/GCMemoryProfiler.cpp uint32_t count;
count 196 MMgc/GCMemoryProfiler.cpp trace->count += (delta > 0) ? 1 : -1;
count 197 MMgc/GCMemoryProfiler.cpp GCAssert(trace->count != 0 || trace->size == 0);
count 283 MMgc/GCMemoryProfiler.cpp PackageGroup(const char *name) : name(name), size(0), count(0), categories(16) {}
count 286 MMgc/GCMemoryProfiler.cpp uint32_t count;
count 301 MMgc/GCMemoryProfiler.cpp uint32_t count;
count 401 MMgc/GCMemoryProfiler.cpp uint32_t count = trace->master != NULL ? 0 : trace->count;
count 402 MMgc/GCMemoryProfiler.cpp residentCount += trace->count;
count 412 MMgc/GCMemoryProfiler.cpp pg->count += count;
count 421 MMgc/GCMemoryProfiler.cpp tg->count += count;
count 464 MMgc/GCMemoryProfiler.cpp int numTypes = pg->categories.count();
count 495 MMgc/GCMemoryProfiler.cpp GCLog("%s - %3.1f%% - %u kb %u items, avg %u b\n", pg->name, PERCENT(residentSize, pg->size), (unsigned int)(pg->size>>10), pg->count, (unsigned int)(pg->count ? pg->size/pg->count : 0));
count 506 MMgc/GCMemoryProfiler.cpp GCLog("\t%s - %3.1f%% - %u kb %u items, avg %u b\n", tg->name, PERCENT(residentSize, tg->size), (unsigned int)(tg->size>>10), tg->count, (unsigned int)(tg->count ? tg->size/tg->count : 0));
count 511 MMgc/GCMemoryProfiler.cpp uint32_t count = trace->count;
count 514 MMgc/GCMemoryProfiler.cpp count = trace->sweepCount;
count 517 MMgc/GCMemoryProfiler.cpp count = trace->totalCount;
count 519 MMgc/GCMemoryProfiler.cpp GCLog("\t\t %3.1f%% - %u kb - %u items - ", PERCENT(tg->size, size), size>>10, count);
count 563 MMgc/GCMemoryProfiler.cpp uint64_t count;
count 567 MMgc/GCMemoryProfiler.cpp count = trace->sweepCount;
count 570 MMgc/GCMemoryProfiler.cpp count = trace->totalCount;
count 573 MMgc/GCMemoryProfiler.cpp count = trace->count;
count 579 MMgc/GCMemoryProfiler.cpp GCLog("%u b - %u items - ", size, count);
count 52 MMgc/ZCT-inlines.h REFCOUNT_PROFILING_ONLY( gc->policy.signalZCTAdd(initial, count); )
count 185 VMPI/MMgcPortMac.cpp mach_msg_type_number_t count = VM_REGION_TOP_INFO_COUNT;
count 193 VMPI/MMgcPortMac.cpp ret = vm_region_64(task, &addr, &size, VM_REGION_TOP_INFO, (vm_region_info_t)&info, &count, &object_name);
count 195 VMPI/MMgcPortMac.cpp ret = vm_region(task, &addr, &size, VM_REGION_TOP_INFO, (vm_region_info_t)&info, &count, &object_name);
count 198 axscript/ByteArrayGlue.cpp Grow(m_length + count);
count 199 axscript/ByteArrayGlue.cpp memcpy(m_array + m_length, data, count);
count 200 axscript/ByteArrayGlue.cpp m_length += count;
count 246 axscript/ByteArrayGlue.cpp CheckEOF(count);
count 248 axscript/ByteArrayGlue.cpp if (count > 0)
count 250 axscript/ByteArrayGlue.cpp memcpy(buffer, m_array+m_filePointer, count);
count 251 axscript/ByteArrayGlue.cpp m_filePointer += count;
count 257 axscript/ByteArrayGlue.cpp if (m_filePointer+count >= m_length) {
count 258 axscript/ByteArrayGlue.cpp Grow(m_filePointer+count);
count 259 axscript/ByteArrayGlue.cpp m_length = m_filePointer+count;
count 261 axscript/ByteArrayGlue.cpp memcpy(m_array+m_filePointer, buffer, count);
count 262 axscript/ByteArrayGlue.cpp m_filePointer += count;
count 53 axscript/ByteArrayGlue.h void Push(const U8 *buffer, uint32 count);
count 82 axscript/ByteArrayGlue.h void Read(void *buffer, uint32 count);
count 83 axscript/ByteArrayGlue.h void Write(const void *buffer, uint32 count);
count 133 axscript/DataIO.cpp if (count == 0) {
count 134 axscript/DataIO.cpp count = available;
count 137 axscript/DataIO.cpp if (count > available) {
count 142 axscript/DataIO.cpp if (offset + count >= buffer.GetLength()) {
count 143 axscript/DataIO.cpp buffer.SetLength(offset + count);
count 146 axscript/DataIO.cpp Read(buffer.GetBuffer() + offset, count);
count 151 axscript/DataIO.cpp if (Available() < count) {
count 233 axscript/DataIO.cpp if (count == 0) {
count 234 axscript/DataIO.cpp count = buffer.GetLength()-offset;
count 237 axscript/DataIO.cpp if (count > buffer.GetLength()-offset) {
count 241 axscript/DataIO.cpp if (count > 0) {
count 242 axscript/DataIO.cpp Write(buffer.GetBuffer()+offset, count);
count 44 axscript/OutputStream.cpp fwrite(buffer, 1, count, stdout);
count 48 axscript/OutputStream.cpp char *cbuf = (char *) malloc(count+1);
count 50 axscript/OutputStream.cpp memcpy(cbuf, buffer, count);
count 51 axscript/OutputStream.cpp cbuf[count] = '\0';
count 54 axscript/OutputStream.h int write(const void *buffer, int count);
count 145 axscript/dataio.h virtual void Read(void *buffer, uint32 count) = 0;
count 155 axscript/dataio.h void ReadByteArray(ByteArray& buffer, uint32 offset, uint32 count);
count 163 axscript/dataio.h void CheckEOF(uint32 count);
count 171 axscript/dataio.h virtual void Write(const void *buffer, uint32 count) = 0;
count 181 axscript/dataio.h void WriteByteArray(ByteArray& buffer, uint32 offset, uint32 count);
count 1609 core/AbcParser.cpp uint32_t count = readU30(pos);
count 1613 core/AbcParser.cpp core->console << "script_count=" << count << "\n";
count 1621 core/AbcParser.cpp if (count == 0)
count 1626 core/AbcParser.cpp if (count > (uint32)(abcEnd - pos))
count 1629 core/AbcParser.cpp pool->_scripts.ensureCapacity(count);
count 1633 core/AbcParser.cpp for (uint32_t i=0; i < count; i++)
count 3446 core/AvmCore.cpp const uint32_t count = traits->getTraitsBindings()->methodCount;
count 3447 core/AvmCore.cpp size_t extraSize = sizeof(MethodEnv*)*(count > 0 ? count-1 : 0);
count 949 core/AvmCore.h static void skipU30(const uint8_t*& p, int count = 1)
count 954 core/AvmCore.h while (count-- > 0)
count 199 core/BitSet.h const uint32_t count = (cap + (BITS_PER_UINTPTR - 1) + 1) / BITS_PER_UINTPTR;
count 200 core/BitSet.h const uint32_t sz = count * sizeof(uintptr_t);
count 543 core/CodegenLIR.cpp LIns* ap = InsAlloc(sizeof(Atom)*count);
count 544 core/CodegenLIR.cpp for (int i=0; i < count; i++)
count 555 core/CodegenLIR.cpp LIns* ap = InsAlloc(sizeof(Atom)*(count+1));
count 557 core/CodegenLIR.cpp for (int i=1; i <= count; i++)
count 3328 core/CodegenLIR.cpp int count = int(1 + op2);
count 3332 core/CodegenLIR.cpp AvmAssert(count >= 0);
count 3339 core/CodegenLIR.cpp while (count > 0 && targetpc_off == (state->pc + AvmCore::readS24(pc+3*(count-1))))
count 3340 core/CodegenLIR.cpp count--;
count 3342 core/CodegenLIR.cpp if (count > 0) {
count 3344 core/CodegenLIR.cpp LIns* cmp = binaryIns(LIR_ult, index, InsConst(count));
count 3349 core/CodegenLIR.cpp LIns* jtbl = lirout->insJtbl(index, count);
count 3350 core/CodegenLIR.cpp for (int i=0; i < count; i++) {
count 3356 core/CodegenLIR.cpp for (int i=0; i < count; i++) {
count 5634 core/CodegenLIR.cpp int32_t count = jitInfoList.size();
count 5636 core/CodegenLIR.cpp for(int i=0; i<count; i++) {
count 434 core/CodegenLIR.h LIns *storeAtomArgs(int count, int index);
count 435 core/CodegenLIR.h LIns *storeAtomArgs(LIns *obj, int count, int index);
count 148 core/DateClass.cpp if (count > kKeyWordLength)
count 155 core/DateClass.cpp for (int i = 0; i < count; i++)
count 163 core/DateClass.cpp if (count == 3)
count 182 core/DateClass.cpp else if (count == 2)
count 66 core/Multiname-inlines.h return (nsset && (flags & NSSET)) ? nsset->count() : 1;
count 172 core/MultinameHashtable.cpp int nsCount = nsset->count();
count 51 core/NamespaceSet-inlines.h return i < nsset->count();
count 56 core/NamespaceSet-inlines.h AvmAssert(i < nsset->count());
count 72 core/NamespaceSet-inlines.h for (uint32_t i=0,n=count(); i < n; i++)
count 78 core/NamespaceSet-inlines.h REALLY_INLINE uint32_t NamespaceSet::count() const
count 85 core/NamespaceSet-inlines.h AvmAssert(i < count());
count 92 core/NamespaceSet-inlines.h AvmAssert(i < count());
count 45 core/NamespaceSet.cpp AvmAssert(count <= 0x7fffffff); // should be impossible since ABC only allow U30...
count 46 core/NamespaceSet.cpp size_t extra = (count >= 1 ? count-1 : 0)*sizeof(Namespacep);
count 48 core/NamespaceSet.cpp nsset->_countAndFlags = count<<1;
count 74 core/NamespaceSet.h static NamespaceSet* _create(MMgc::GC* gc, uint32_t count);
count 81 core/NamespaceSet.h uint32_t count() const;
count 57 core/OutputStream.h virtual int write(const void *buffer, int count) = 0;
count 205 core/PoolObject.cpp _abcStrings.setup(count);
count 206 core/PoolObject.cpp constantStringCount = count;
count 231 core/PoolObject.h void setupConstantStrings(uint32_t count);
count 49 core/PrintWriter.cpp int result = m_stream->write(buffer, count);
count 52 core/PrintWriter.cpp while (--count >= 0) {
count 117 core/PrintWriter.h int write(const void *buffer, int count);
count 89 core/QCache.cpp uint32_t which = MathUtils::Random(count(), &m_rand);
count 87 core/QCache.h inline uint32_t count() const { return m_count; }
count 63 core/StringBuffer.cpp if (m_length + count >= (int)GC::Size(m_buffer))
count 66 core/StringBuffer.cpp int newCapacity = (m_length+count+1)*2;
count 75 core/StringBuffer.cpp VMPI_memcpy(m_buffer+m_length, buffer, count);
count 76 core/StringBuffer.cpp m_length += count;
count 78 core/StringBuffer.cpp return count;
count 60 core/StringBuffer.h int write(const void *buffer, int count);
count 271 core/StringClass.cpp int count = 0;
count 279 core/StringClass.cpp out->setUintProperty(count++, sub->atom());
count 288 core/StringClass.cpp if ((limit != 0xFFFFFFFFUL) && (count >= (int) limit))
count 295 core/StringClass.cpp out->setUintProperty(count++, sub->atom());
count 2127 core/StringObject.cpp Stringp String::_substr(int start, int count)
count 2139 core/StringObject.cpp if (count == 0x7ffffff)
count 2143 core/StringObject.cpp else if ((count > 0xffffff) || (start > 0xffffff)) // might overflow - use doubles
count 2145 core/StringObject.cpp end = (int)NativeObjectHelpers::ClampIndex(double(count) + double(start), len);
count 2149 core/StringObject.cpp end = (int)NativeObjectHelpers::ClampIndexInt(count + start, len);
count 2023 core/Traits.cpp uint32_t count;
count 2024 core/Traits.cpp if (!isInstanceType() || (count = countNewInterfaces(seen)) == 0) {
count 2038 core/Traits.cpp count = countSupertypes(base_list);
count 2039 core/Traits.cpp Traits** list = allocSupertypeList(gc, count + 1);
count 2041 core/Traits.cpp for (uint32_t i=0; i < count; i++)
count 2052 core/Traits.cpp count++;
count 2057 core/Traits.cpp uint32_t total = count + baseCount;
count 2062 core/Traits.cpp list = allocSupertypeList(gc, count);
count 2065 core/Traits.cpp for (uint32_t i=0; i < count; i++) {
count 77 core/TypeDescriber.cpp void TypeDescriber::setpropmulti(ScriptObject* o, const TypeDescriber::KVPair* kv, uint32_t count)
count 79 core/TypeDescriber.cpp while (count--)
count 122 core/TypeDescriber.h void setpropmulti(ScriptObject* o, const KVPair* kv, uint32_t count);
count 71 core/VTable.cpp if (count <= 1)
count 75 core/VTable.cpp ImtThunkEntry* end = map + count; // one past end!
count 78 core/VTable.cpp while (count > k_shellsort_intervals[interval_idx+1])
count 115 core/VTable.cpp count = 0;
count 161 core/VTable.cpp ++count;
count 173 core/VTable.cpp ++count;
count 616 core/VectorClass.cpp static void nullAtomRange(Atom* a, size_t count)
count 618 core/VectorClass.cpp while (count--)
count 2403 core/Verifier.cpp const uint32_t count = td ? td->slotCount : 0;
count 2404 core/Verifier.cpp if (!traits || slot >= count)
count 2406 core/Verifier.cpp verifyFailed(kSlotExceedsCountError, core->toErrorString(slot+1), core->toErrorString(count), core->toErrorString(traits));
count 771 core/XMLObject.cpp int count = xi->numChildren();
count 772 core/XMLObject.cpp for(int r=0;notify && (r<count); r++)
count 784 core/XMLObject.cpp if (notify && count > 0)
count 360 core/avmplusDebugger.cpp int count;
count 362 core/avmplusDebugger.cpp if (frame && frame->arguments(arr, count))
count 365 core/avmplusDebugger.cpp for(int i=0; i<count; i++)
count 368 core/avmplusDebugger.cpp if (i+1 < count)
count 533 core/avmplusDebugger.cpp int count = 1;
count 534 core/avmplusDebugger.cpp while( (trace = trace->next()) != 0 && count < MAX_FRAMES )
count 535 core/avmplusDebugger.cpp count++;
count 536 core/avmplusDebugger.cpp return count;
count 562 core/avmplusDebugger.cpp int count = 0;
count 564 core/avmplusDebugger.cpp while(count++ < frameNbr && trace != NULL)
count 758 core/avmplusDebugger.cpp count = pastLastArgument - firstArgument;
count 759 core/avmplusDebugger.cpp if ((count > 0) && debugger)
count 762 core/avmplusDebugger.cpp ar = (Atom*) debugger->core->GetGC()->Calloc(count, sizeof(Atom), GC::kContainsPointers|GC::kZero);
count 764 core/avmplusDebugger.cpp info->boxLocals(trace->framep(), firstArgument, trace->traits(), ar, 0, count);
count 770 core/avmplusDebugger.cpp count = 0;
count 782 core/avmplusDebugger.cpp int count = pastLastArgument - firstArgument;
count 783 core/avmplusDebugger.cpp if (count > 0 && which < count)
count 805 core/avmplusDebugger.cpp count = pastLastLocal - firstLocal;
count 806 core/avmplusDebugger.cpp AvmAssert(count >= 0);
count 807 core/avmplusDebugger.cpp if ((count > 0) && debugger)
count 810 core/avmplusDebugger.cpp ar = (Atom*) debugger->core->GetGC()->Calloc(count, sizeof(Atom), GC::kContainsPointers|GC::kZero);
count 812 core/avmplusDebugger.cpp info->boxLocals(trace->framep(), firstLocal, trace->traits(), ar, 0, count);
count 832 core/avmplusDebugger.cpp count = 0;
count 844 core/avmplusDebugger.cpp int count = pastLastLocal - firstLocal;
count 845 core/avmplusDebugger.cpp if (count > 0 && which < count)
count 143 core/avmplusDebugger.h virtual bool arguments(Atom*& ar, int& count) = 0;
count 149 core/avmplusDebugger.h virtual bool locals(Atom*& ar, int& count) = 0;
count 570 core/avmplusDebugger.h bool arguments(Atom*& ar, int& count);
count 576 core/avmplusDebugger.h bool locals(Atom*& ar, int& count);
count 511 extensions/JavaGlue.cpp int count = argumentCount(constrDesc);
count 513 extensions/JavaGlue.cpp jvalue* jargs = (jvalue*) VMPI_alloca( core, _jargs, count*sizeof(jvalue) );
count 515 extensions/JavaGlue.cpp for(int i=argc; i<count; i++)
count 544 extensions/JavaGlue.cpp int count = argumentCount(methodDesc);
count 546 extensions/JavaGlue.cpp jvalue* jargs = (jvalue*) VMPI_alloca( core, _jargs, count*sizeof(jvalue) );
count 548 extensions/JavaGlue.cpp for(int i=argc; i<count; i++)
count 142 extensions/SamplerScript.cpp cursor = sampler->getSamples(count);
count 147 extensions/SamplerScript.cpp if(count == 0)
count 159 extensions/SamplerScript.cpp count--;
count 162 extensions/SamplerScript.cpp count = 0;
count 172 extensions/SamplerScript.cpp count = 0;
count 177 extensions/SamplerScript.cpp uint32 count;
count 1268 nanojit/Assembler.cpp uint32_t count = ins->getTableSize();
count 1272 nanojit/Assembler.cpp for (uint32_t i = count; i-- > 0;) {
count 1295 nanojit/Assembler.cpp for (uint32_t i = count; i-- > 0;) {
count 1307 nanojit/Assembler.cpp NIns** native_table = new (_dataAlloc) NIns*[count];
count 1506 nanojit/Assembler.cpp si->table = (NIns **) alloc.alloc(si->count * sizeof(NIns*));
count 1507 nanojit/Assembler.cpp for (uint32_t i = 0; i < si->count; ++i)
count 1621 nanojit/Assembler.cpp int32_t count = ins->size()>>2;
count 1622 nanojit/Assembler.cpp VMPI_sprintf(s," %d-%d(%s)", 4*i, 4*(i+count-1), n);
count 1623 nanojit/Assembler.cpp count += i-1;
count 1624 nanojit/Assembler.cpp while (i < count) {
count 115 nanojit/LIR.h uint32_t count; // Number of table entries
count 1148 nanojit/LIR.h int32_t count = 0;
count 1151 nanojit/LIR.h count++;
count 1154 nanojit/LIR.h if (count > 1)
count 58 other-licenses/zlib/inftrees.c unsigned short count[MAXBITS+1]; /* number of codes of each length */
count 108 other-licenses/zlib/inftrees.c count[len] = 0;
count 110 other-licenses/zlib/inftrees.c count[lens[sym]]++;
count 115 other-licenses/zlib/inftrees.c if (count[max] != 0) break;
count 127 other-licenses/zlib/inftrees.c if (count[min] != 0) break;
count 134 other-licenses/zlib/inftrees.c left -= count[len];
count 143 other-licenses/zlib/inftrees.c offs[len + 1] = offs[len] + count[len];
count 254 other-licenses/zlib/inftrees.c if (--(count[len]) == 0) {
count 272 other-licenses/zlib/inftrees.c left -= count[curr + drop];
count 716 other-licenses/zlib/trees.c int count = 0; /* repeat count of the current code */
count 725 other-licenses/zlib/trees.c if (++count < max_count && curlen == nextlen) {
count 727 other-licenses/zlib/trees.c } else if (count < min_count) {
count 728 other-licenses/zlib/trees.c s->bl_tree[curlen].Freq += count;
count 732 other-licenses/zlib/trees.c } else if (count <= 10) {
count 737 other-licenses/zlib/trees.c count = 0; prevlen = curlen;
count 761 other-licenses/zlib/trees.c int count = 0; /* repeat count of the current code */
count 770 other-licenses/zlib/trees.c if (++count < max_count && curlen == nextlen) {
count 772 other-licenses/zlib/trees.c } else if (count < min_count) {
count 773 other-licenses/zlib/trees.c do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
count 777 other-licenses/zlib/trees.c send_code(s, curlen, s->bl_tree); count--;
count 779 other-licenses/zlib/trees.c Assert(count >= 3 && count <= 6, " 3_6?");
count 780 other-licenses/zlib/trees.c send_code(s, REP_3_6, s->bl_tree); send_bits(s, count-3, 2);
count 782 other-licenses/zlib/trees.c } else if (count <= 10) {
count 783 other-licenses/zlib/trees.c send_code(s, REPZ_3_10, s->bl_tree); send_bits(s, count-3, 3);
count 786 other-licenses/zlib/trees.c send_code(s, REPZ_11_138, s->bl_tree); send_bits(s, count-11, 7);
count 788 other-licenses/zlib/trees.c count = 0; prevlen = curlen;
count 697 pcre/pcre_compile.cpp int count = 0;
count 704 pcre/pcre_compile.cpp count++;
count 717 pcre/pcre_compile.cpp if (c < 0 || count > (utf8? 8 : 2)) *errorcodeptr = ERR34;
count 1068 pcre/pcre_compile.cpp count++;
count 1069 pcre/pcre_compile.cpp if (name == NULL && count == lorn) return count;
count 1082 pcre/pcre_compile.cpp count++;
count 1084 pcre/pcre_compile.cpp if (name == NULL && count == lorn) return count;
count 1091 pcre/pcre_compile.cpp return count;
count 165 pcre/pcre_dfa_exec.cpp int count; /* Count for repeats */
count 238 pcre/pcre_dfa_exec.cpp next_active_state->count = (y); \
count 249 pcre/pcre_dfa_exec.cpp next_active_state->count = (y); \
count 261 pcre/pcre_dfa_exec.cpp next_new_state->count = (y); \
count 272 pcre/pcre_dfa_exec.cpp next_new_state->count = (y); \
count 477 pcre/pcre_dfa_exec.cpp printf("%d/%d ", active_states[i].offset, active_states[i].count);
count 514 pcre/pcre_dfa_exec.cpp int count, codevalue;
count 539 pcre/pcre_dfa_exec.cpp ADD_NEW_DATA(state_offset, current_state->count,
count 554 pcre/pcre_dfa_exec.cpp active_states[j].count == current_state->count)
count 635 pcre/pcre_dfa_exec.cpp count = ((match_count == 0)? offsetcount : match_count * 2) - 2;
count 636 pcre/pcre_dfa_exec.cpp if (count > 0) memmove(offsets + 2, offsets, count * sizeof(int));
count 861 pcre/pcre_dfa_exec.cpp count = current_state->count; /* Already matched */
count 862 pcre/pcre_dfa_exec.cpp if (count > 0) { ADD_ACTIVE(state_offset + 2, 0); }
count 873 pcre/pcre_dfa_exec.cpp if (count > 0 && codevalue == OP_TYPEPOSPLUS)
count 878 pcre/pcre_dfa_exec.cpp count++;
count 879 pcre/pcre_dfa_exec.cpp ADD_NEW(state_offset, count);
count 936 pcre/pcre_dfa_exec.cpp count = current_state->count; /* Number already matched */
count 947 pcre/pcre_dfa_exec.cpp if (++count >= GET2(code, 1))
count 950 pcre/pcre_dfa_exec.cpp { ADD_NEW(state_offset, count); }
count 960 pcre/pcre_dfa_exec.cpp count = current_state->count; /* Number already matched */
count 976 pcre/pcre_dfa_exec.cpp if (++count >= GET2(code, 1))
count 979 pcre/pcre_dfa_exec.cpp { ADD_NEW(state_offset, count); }
count 994 pcre/pcre_dfa_exec.cpp count = current_state->count; /* Already matched */
count 995 pcre/pcre_dfa_exec.cpp if (count > 0) { ADD_ACTIVE(state_offset + 4, 0); }
count 1031 pcre/pcre_dfa_exec.cpp if (count > 0 && codevalue == OP_PROP_EXTRA + OP_TYPEPOSPLUS)
count 1036 pcre/pcre_dfa_exec.cpp count++;
count 1037 pcre/pcre_dfa_exec.cpp ADD_NEW(state_offset, count);
count 1046 pcre/pcre_dfa_exec.cpp count = current_state->count; /* Already matched */
count 1047 pcre/pcre_dfa_exec.cpp if (count > 0) { ADD_ACTIVE(state_offset + 2, 0); }
count 1052 pcre/pcre_dfa_exec.cpp if (count > 0 && codevalue == OP_EXTUNI_EXTRA + OP_TYPEPOSPLUS)
count 1066 pcre/pcre_dfa_exec.cpp count++;
count 1067 pcre/pcre_dfa_exec.cpp ADD_NEW_DATA(-state_offset, count, ncount);
count 1076 pcre/pcre_dfa_exec.cpp count = current_state->count; /* Already matched */
count 1077 pcre/pcre_dfa_exec.cpp if (count > 0) { ADD_ACTIVE(state_offset + 2, 0); }
count 1092 pcre/pcre_dfa_exec.cpp if (count > 0 && codevalue == OP_ANYNL_EXTRA + OP_TYPEPOSPLUS)
count 1097 pcre/pcre_dfa_exec.cpp count++;
count 1098 pcre/pcre_dfa_exec.cpp ADD_NEW_DATA(-state_offset, count, ncount);
count 1110 pcre/pcre_dfa_exec.cpp count = current_state->count; /* Already matched */
count 1111 pcre/pcre_dfa_exec.cpp if (count > 0) { ADD_ACTIVE(state_offset + 2, 0); }
count 1134 pcre/pcre_dfa_exec.cpp if (count > 0 && codevalue == OP_VSPACE_EXTRA + OP_TYPEPOSPLUS)
count 1139 pcre/pcre_dfa_exec.cpp count++;
count 1140 pcre/pcre_dfa_exec.cpp ADD_NEW_DATA(-state_offset, count, 0);
count 1149 pcre/pcre_dfa_exec.cpp count = current_state->count; /* Already matched */
count 1150 pcre/pcre_dfa_exec.cpp if (count > 0) { ADD_ACTIVE(state_offset + 2, 0); }
count 1185 pcre/pcre_dfa_exec.cpp if (count > 0 && codevalue == OP_HSPACE_EXTRA + OP_TYPEPOSPLUS)
count 1190 pcre/pcre_dfa_exec.cpp count++;
count 1191 pcre/pcre_dfa_exec.cpp ADD_NEW_DATA(-state_offset, count, 0);
count 1201 pcre/pcre_dfa_exec.cpp count = 4;
count 1207 pcre/pcre_dfa_exec.cpp count = 0;
count 1253 pcre/pcre_dfa_exec.cpp ADD_NEW(state_offset + count, 0);
count 1262 pcre/pcre_dfa_exec.cpp count = 2;
count 1268 pcre/pcre_dfa_exec.cpp count = 0;
count 1292 pcre/pcre_dfa_exec.cpp ADD_NEW_DATA(-(state_offset + count), 0, ncount);
count 1301 pcre/pcre_dfa_exec.cpp count = 2;
count 1307 pcre/pcre_dfa_exec.cpp count = 0;
count 1331 pcre/pcre_dfa_exec.cpp ADD_NEW_DATA(-(state_offset + count), 0, ncount);
count 1343 pcre/pcre_dfa_exec.cpp count = 2;
count 1349 pcre/pcre_dfa_exec.cpp count = 0;
count 1380 pcre/pcre_dfa_exec.cpp ADD_NEW_DATA(-(state_offset + count), 0, 0);
count 1389 pcre/pcre_dfa_exec.cpp count = 2;
count 1395 pcre/pcre_dfa_exec.cpp count = 0;
count 1439 pcre/pcre_dfa_exec.cpp ADD_NEW_DATA(-(state_offset + count), 0, 0);
count 1452 pcre/pcre_dfa_exec.cpp count = current_state->count; /* Number already matched */
count 1493 pcre/pcre_dfa_exec.cpp if (++count >= GET2(code, 1))
count 1496 pcre/pcre_dfa_exec.cpp { ADD_NEW(state_offset, count); }
count 1508 pcre/pcre_dfa_exec.cpp count = current_state->count; /* Number already matched */
count 1527 pcre/pcre_dfa_exec.cpp if (++count >= GET2(code, 1))
count 1530 pcre/pcre_dfa_exec.cpp { ADD_NEW_DATA(-state_offset, count, ncount); }
count 1542 pcre/pcre_dfa_exec.cpp count = current_state->count; /* Number already matched */
count 1562 pcre/pcre_dfa_exec.cpp if (++count >= GET2(code, 1))
count 1565 pcre/pcre_dfa_exec.cpp { ADD_NEW_DATA(-state_offset, count, ncount); }
count 1580 pcre/pcre_dfa_exec.cpp count = current_state->count; /* Number already matched */
count 1607 pcre/pcre_dfa_exec.cpp if (++count >= GET2(code, 1))
count 1610 pcre/pcre_dfa_exec.cpp { ADD_NEW_DATA(-state_offset, count, 0); }
count 1622 pcre/pcre_dfa_exec.cpp count = current_state->count; /* Number already matched */
count 1662 pcre/pcre_dfa_exec.cpp if (++count >= GET2(code, 1))
count 1665 pcre/pcre_dfa_exec.cpp { ADD_NEW_DATA(-state_offset, count, 0); }
count 1884 pcre/pcre_dfa_exec.cpp count = current_state->count; /* Already matched */
count 1885 pcre/pcre_dfa_exec.cpp if (count > 0) { ADD_ACTIVE(state_offset + dlen + 1, 0); }
count 1904 pcre/pcre_dfa_exec.cpp if (count > 0 &&
count 1910 pcre/pcre_dfa_exec.cpp count++;
count 1911 pcre/pcre_dfa_exec.cpp ADD_NEW(state_offset, count);
count 1991 pcre/pcre_dfa_exec.cpp count = current_state->count; /* Number already matched */
count 2010 pcre/pcre_dfa_exec.cpp if (++count >= GET2(code, 1))
count 2013 pcre/pcre_dfa_exec.cpp { ADD_NEW(state_offset, count); }
count 2026 pcre/pcre_dfa_exec.cpp count = current_state->count; /* Number already matched */
count 2050 pcre/pcre_dfa_exec.cpp if (++count >= GET2(code, 1))
count 2053 pcre/pcre_dfa_exec.cpp { ADD_NEW(state_offset, count); }
count 2109 pcre/pcre_dfa_exec.cpp count = current_state->count; /* Already matched */
count 2110 pcre/pcre_dfa_exec.cpp if (count > 0) { ADD_ACTIVE(next_state_offset + 1, 0); }
count 2111 pcre/pcre_dfa_exec.cpp if (isinclass) { count++; ADD_NEW(state_offset, count); }
count 2122 pcre/pcre_dfa_exec.cpp count = current_state->count; /* Already matched */
count 2123 pcre/pcre_dfa_exec.cpp if (count >= GET2(ecode, 1))
count 2128 pcre/pcre_dfa_exec.cpp if (++count >= max && max != 0) /* Max 0 => no limit */
count 2131 pcre/pcre_dfa_exec.cpp { ADD_NEW(state_offset, count); }
count 116 pcre/pcre_scanner.cc int count = 1;
count 119 pcre/pcre_scanner.cc ++count;
count 120 pcre/pcre_scanner.cc return count;
count 358 pcre/pcrecpp.cc int count = 0;
count 364 pcre/pcrecpp.cc for (; start <= static_cast<int>(str->length()); count++) {
count 400 pcre/pcrecpp.cc count++;
count 404 pcre/pcrecpp.cc if (count == 0)
count 410 pcre/pcrecpp.cc return count;
count 778 pcre/pcregrep.cpp int count = 0;
count 779 pcre/pcregrep.cpp while (lastmatchrestart < endptr && count++ < after_context)
count 822 pcre/pcregrep.cpp int count = 0;
count 954 pcre/pcregrep.cpp if (count_only) count++;
count 1206 pcre/pcregrep.cpp fprintf(stdout, "%d\n", count);
count 1503 pcre/pcregrep.cpp if (count == 0)
count 1508 pcre/pcregrep.cpp "at offset %d: %s\n", ordin(count), errptr, error);
count 1513 pcre/pcregrep.cpp "at offset %d: %s\n", count, filename, errptr, error);
count 1551 pcre/pcregrep.cpp return compile_single_pattern(pattern, options, filename, count);
count 1554 pcre/pcregrep.cpp if (!compile_single_pattern(buffer, options, filename, count))
count 1558 pcre/pcregrep.cpp else return compile_single_pattern(pattern, options, filename, count);
count 624 pcre/pcretest.cpp int count;
count 635 pcre/pcretest.cpp count = pcre_exec(re, extra, (char *)bptr, len, start_offset, options,
count 638 pcre/pcretest.cpp if (count == errnumber)
count 645 pcre/pcretest.cpp else if (count >= 0 || count == PCRE_ERROR_NOMATCH ||
count 646 pcre/pcretest.cpp count == PCRE_ERROR_PARTIAL)
count 661 pcre/pcretest.cpp return count;
count 1386 pcre/pcretest.cpp int count, backrefmax, first_char, need_char, okpartial, jchanged,
count 1393 pcre/pcretest.cpp new_info(re, NULL, PCRE_INFO_CAPTURECOUNT, &count);
count 1406 pcre/pcretest.cpp if (count < 0) fprintf(outfile,
count 1407 pcre/pcretest.cpp "Error %d from pcre_info()\n", count);
count 1410 pcre/pcretest.cpp if (old_count != count) fprintf(outfile,
count 1411 pcre/pcretest.cpp "Count disagreement: pcre_fullinfo=%d pcre_info=%d\n", count,
count 1428 pcre/pcretest.cpp fprintf(outfile, "Capturing subpattern count = %d\n", count);
count 1640 pcre/pcretest.cpp int count, c;
count 2027 pcre/pcretest.cpp count = pcre_dfa_exec(re, NULL, (char *)bptr, len, start_offset,
count 2035 pcre/pcretest.cpp count = pcre_exec(re, extra, (char *)bptr, len,
count 2061 pcre/pcretest.cpp count = check_match_limit(re, extra, bptr, len, start_offset,
count 2078 pcre/pcretest.cpp count = pcre_exec(re, extra, (char *)bptr, len, start_offset,
count 2090 pcre/pcretest.cpp count = pcre_dfa_exec(re, NULL, (char *)bptr, len, start_offset,
count 2093 pcre/pcretest.cpp if (count == 0)
count 2096 pcre/pcretest.cpp count = use_size_offsets/2;
count 2103 pcre/pcretest.cpp count = pcre_exec(re, extra, (char *)bptr, len,
count 2105 pcre/pcretest.cpp if (count == 0)
count 2108 pcre/pcretest.cpp count = use_size_offsets/3;
count 2114 pcre/pcretest.cpp if (count >= 0)
count 2125 pcre/pcretest.cpp if (count > maxcount)
count 2129 pcre/pcretest.cpp count, use_size_offsets);
count 2130 pcre/pcretest.cpp count = use_size_offsets/3;
count 2138 pcre/pcretest.cpp for (i = 0; i < count * 2; i += 2)
count 2166 pcre/pcretest.cpp int rc = pcre_copy_substring((char *)bptr, use_offsets, count,
count 2181 pcre/pcretest.cpp count, (char *)copynamesptr, copybuffer, sizeof(copybuffer));
count 2193 pcre/pcretest.cpp int rc = pcre_get_substring((char *)bptr, use_offsets, count,
count 2211 pcre/pcretest.cpp count, (char *)getnamesptr, &substring);
count 2224 pcre/pcretest.cpp int rc = pcre_get_substring_list((char *)bptr, use_offsets, count,
count 2230 pcre/pcretest.cpp for (i = 0; i < count; i++)
count 2242 pcre/pcretest.cpp else if (count == PCRE_ERROR_PARTIAL)
count 2306 pcre/pcretest.cpp if (count == PCRE_ERROR_NOMATCH)
count 2310 pcre/pcretest.cpp else fprintf(outfile, "Error %d\n", count);
count 135 platform/win32/coff.cpp for(int i=0; i<count; i++)
count 137 platform/win32/coff.cpp return &dst[count];
count 197 platform/win32/coff.h char* write(char* dst, const char* src, int count);
count 157 shell/ByteArrayGlue.cpp Grow(m_length + count);
count 158 shell/ByteArrayGlue.cpp VMPI_memcpy(m_array + m_length, data, count);
count 159 shell/ByteArrayGlue.cpp m_length += count;
count 268 shell/ByteArrayGlue.cpp CheckEOF(count);
count 270 shell/ByteArrayGlue.cpp if (count > 0)
count 272 shell/ByteArrayGlue.cpp VMPI_memcpy(buffer, m_array+m_filePointer, count);
count 273 shell/ByteArrayGlue.cpp m_filePointer += count;
count 279 shell/ByteArrayGlue.cpp if (m_filePointer+count >= m_length) {
count 280 shell/ByteArrayGlue.cpp Grow(m_filePointer+count);
count 281 shell/ByteArrayGlue.cpp m_length = m_filePointer+count;
count 283 shell/ByteArrayGlue.cpp VMPI_memcpy(m_array+m_filePointer, buffer, count);
count 284 shell/ByteArrayGlue.cpp m_filePointer += count;
count 54 shell/ByteArrayGlue.h void Push(const U8 *buffer, uint32_t count);
count 108 shell/ByteArrayGlue.h void Read(void *buffer, uint32_t count);
count 109 shell/ByteArrayGlue.h void Write(const void *buffer, uint32_t count);
count 50 shell/ConsoleOutputStream.cpp if(count < 256)
count 53 shell/ConsoleOutputStream.cpp VMPI_strncpy(message, (const char*) buffer, count);
count 54 shell/ConsoleOutputStream.cpp message[count] = '\0';
count 60 shell/ConsoleOutputStream.cpp char* message = new char[count+1];
count 61 shell/ConsoleOutputStream.cpp VMPI_strncpy(message, (const char*)buffer, count);
count 62 shell/ConsoleOutputStream.cpp message[count] = '\0';
count 55 shell/ConsoleOutputStream.h int write(const void *buffer, int count);
count 138 shell/DataIO.cpp if (count == 0) {
count 139 shell/DataIO.cpp count = available;
count 142 shell/DataIO.cpp if (count > available) {
count 147 shell/DataIO.cpp if (offset + count >= buffer.GetLength()) {
count 148 shell/DataIO.cpp buffer.SetLength(offset + count);
count 151 shell/DataIO.cpp Read(buffer.GetBuffer() + offset, count);
count 156 shell/DataIO.cpp if (Available() < count) {
count 248 shell/DataIO.cpp if (count == 0) {
count 249 shell/DataIO.cpp count = buffer.GetLength()-offset;
count 252 shell/DataIO.cpp if (count > buffer.GetLength()-offset) {
count 256 shell/DataIO.cpp if (count > 0) {
count 257 shell/DataIO.cpp Write(buffer.GetBuffer()+offset, count);
count 147 shell/DataIO.h virtual void Read(void *buffer, uint32_t count) = 0;
count 157 shell/DataIO.h void ReadByteArray(ByteArray& buffer, uint32_t offset, uint32_t count);
count 164 shell/DataIO.h void CheckEOF(uint32_t count);
count 172 shell/DataIO.h virtual void Write(const void *buffer, uint32_t count) = 0;
count 182 shell/DataIO.h void WriteByteArray(ByteArray& buffer, uint32_t offset, uint32_t count);
count 222 shell/DebugCLI.cpp int count, line;
count 246 shell/DebugCLI.cpp frame->arguments(ptr, count);
count 247 shell/DebugCLI.cpp for(int i=0; i<count; i++)
count 255 shell/DebugCLI.cpp if (i<count-1)
count 324 shell/DebugCLI.cpp while(count-- > 0)
count 331 shell/DebugCLI.cpp count++; // reset line number to beginning skip this iteration
count 461 shell/DebugCLI.cpp int count, line;
count 472 shell/DebugCLI.cpp frame->locals(ptr, count);
count 473 shell/DebugCLI.cpp for(int i=0; i<count; i++)
count 513 shell/DebugCLI.cpp int count, line;
count 533 shell/DebugCLI.cpp frame->arguments(ptr, count);
count 534 shell/DebugCLI.cpp for(int i=0; i<count; i++)
count 549 shell/DebugCLI.cpp frame->locals(ptr, count);
count 550 shell/DebugCLI.cpp for(int i=0; i<count; i++)
count 207 shell/DebugCLI.h void displayLines(int linenum, int count);
count 87 shell/FileInputStream.cpp return file->read(buffer, count);
count 56 shell/FileInputStream.h virtual size_t read(void *buffer, size_t count) = 0;
count 73 shell/FileInputStream.h size_t read(void *buffer, size_t count);
count 130 utils/superwordprof.c unsigned count;
count 141 utils/superwordprof.c unsigned count;
count 343 utils/superwordprof.c toplevel[i].count = 0;
count 826 utils/superwordprof.c t2->count++;
count 844 utils/superwordprof.c toplevel[opcode].count++;
count 941 utils/superwordprof.c for ( j=i+1 ; j < nextseq && seqs[i].count == seqs[j].count ; j++ ) {
count 1008 utils/superwordprof.c printf("%11d | ", seqs[i].count);
count 1052 utils/superwordprof.c emit(level+1, t2->count);
count 1057 utils/superwordprof.c if (t3->count < t2->count && !emitted) {
count 1059 utils/superwordprof.c emit(level+1, t2->count);
count 1069 utils/superwordprof.c if (level > 1 && level <= cutoff_length && count/scale >= cutoff_count) {
count 1084 utils/superwordprof.c seq->count = count/scale;
count 1097 utils/superwordprof.c t2->count = 1;
count 1106 utils/superwordprof.c int res = ((seq_t*)b)->count - ((seq_t*)a)->count;
count 391 utils/wmremote/wmrunner/wmrunner.cpp DWORD count;
count 394 utils/wmremote/wmrunner/wmrunner.cpp BOOL read=ReadFile(handle,data,500,&count,NULL);
count 395 utils/wmremote/wmrunner/wmrunner.cpp if (count==0) {
count 401 utils/wmremote/wmrunner/wmrunner.cpp while (data[count-1]==10 || data[count-1]==13) {
count 402 utils/wmremote/wmrunner/wmrunner.cpp count--;
count 404 utils/wmremote/wmrunner/wmrunner.cpp if (data[count-1]!=' ' && data[count-1]!='\"') {
count 410 utils/wmremote/wmrunner/wmrunner.cpp data[count-1]='\0';
count 413 utils/wmremote/wmrunner/wmrunner.cpp DWORD space=count-1;
count 417 utils/wmremote/wmrunner/wmrunner.cpp for (;space<count-1;space++,i++) {
count 151 vprof/vprof.cpp f(((double)e->sum)/((double)e->count)), (long long int)e->min, (long long int)e->max, (long long int)e->sum, (long long int)e->count);
count 155 vprof/vprof.cpp vprof_printf ("(%lld < %lld) ", (long long int)e->h->count[j], (long long int)e->h->lb[j]);
count 157 vprof/vprof.cpp vprof_printf ("(%lld >= %lld) ", (long long int)e->h->count[e->h->nbins], (long long int)e->h->lb[e->h->nbins-1]);
count 190 vprof/vprof.cpp e->count ++;
count 233 vprof/vprof.cpp e->count = 1;
count 260 vprof/vprof.cpp e->count ++;
count 287 vprof/vprof.cpp e->count ++;
count 290 vprof/vprof.cpp h->count[b] ++;
count 324 vprof/vprof.cpp e->count = 1;
count 335 vprof/vprof.cpp h->count = (int64_t*) malloc (s);
count 336 vprof/vprof.cpp VMPI_memset (h->count, 0, s);
count 349 vprof/vprof.cpp h->count[b] ++;
count 369 vprof/vprof.cpp e->count ++;
count 375 vprof/vprof.cpp h->count[b] ++;
count 219 vprof/vprof.h int64_t* count;
count 229 vprof/vprof.h int64_t count;
count 249 vprof/vprof.h #define _COUNT ((entry_t)vprofID)->count