i 116 MMgc/BasicList.h uint32_t i=0;
i 117 MMgc/BasicList.h while (i < Limit() && items[i] != item)
i 118 MMgc/BasicList.h i++;
i 119 MMgc/BasicList.h if (i == Limit())
i 124 MMgc/BasicList.h items[i] = NULL;
i 126 MMgc/BasicList.h if (i != count)
i 130 MMgc/BasicList.h T Get(uint32_t i) const
i 132 MMgc/BasicList.h GCAssertMsg(i < Limit(), "Index out of bounds");
i 133 MMgc/BasicList.h return items[i];
i 161 MMgc/BasicList.h uint32_t i=0,j=1;
i 164 MMgc/BasicList.h if (items[i] == NULL)
i 168 MMgc/BasicList.h items[i++] = items[j++];
i 178 MMgc/BasicList.h i++,j++;
i 181 MMgc/BasicList.h GCAssert(i == count);
i 402 MMgc/FixedAlloc.cpp for(int i=startIndex; i<n; i++)
i 404 MMgc/FixedAlloc.cpp uint32_t data = ((uint32_t*)item)[i];
i 147 MMgc/FixedMalloc.cpp for (int i=0; i<kNumSizeClasses; i++) {
i 152 MMgc/FixedMalloc.cpp m_allocs[i].Init((uint32_t)kSizeClasses[i], heap);
i 160 MMgc/FixedMalloc.cpp for (int i=0; i<kNumSizeClasses; i++) {
i 161 MMgc/FixedMalloc.cpp m_allocs[i].Destroy();
i 190 MMgc/FixedMalloc.cpp for (int i=0; i<kNumSizeClasses; i++) {
i 193 MMgc/FixedMalloc.cpp m_allocs[i].GetUsageInfo(ask, allocated);
i 281 MMgc/FixedMalloc.cpp for (int i=0; i<kNumSizeClasses; i++) {
i 282 MMgc/FixedMalloc.cpp total += m_allocs[i].GetNumChunks();
i 293 MMgc/FixedMalloc.cpp for (int i=0; i<kNumSizeClasses; i++) {
i 294 MMgc/FixedMalloc.cpp m_allocs[i].GetUsageInfo(ask, inUse);
i 295 MMgc/FixedMalloc.cpp if( m_allocs[i].GetNumChunks() > 0)
i 296 MMgc/FixedMalloc.cpp GCLog("[mem] FixedMalloc[%d] total %d pages inuse %d bytes ask %d bytes\n", kSizeClasses[i], m_allocs[i].GetNumChunks(), inUse, ask);
i 307 MMgc/FixedMalloc.cpp for (int i=0; i<kNumSizeClasses; i++)
i 308 MMgc/FixedMalloc.cpp if (m_allocs[i].QueryOwnsObject(item))
i 490 MMgc/GC-inlines.h for(int i=0, n=noPointersAllocs[sizeClass]->m_numBitmapBytes; i<n;i++)
i 491 MMgc/GC-inlines.h GCAssert(((uint8_t*)bits)[i] == 0);
i 181 MMgc/GC.cpp for ( size_t i=0 ; i < ARRAY_SIZE(barrierStageTotal) ; i++ ) {
i 182 MMgc/GC.cpp barrierStageTotal[i] = 0;
i 183 MMgc/GC.cpp barrierStageLastCollection[i] = 0;
i 555 MMgc/GC.cpp for ( size_t i=0 ; i < ARRAY_SIZE(barrierStageTotal) ; i++ ) {
i 556 MMgc/GC.cpp barrierStageTotal[i] += barrierStageLastCollection[i];
i 557 MMgc/GC.cpp barrierStageLastCollection[i] = 0;
i 664 MMgc/GC.cpp for ( size_t i=0 ; i < blimit ; i++ )
i 665 MMgc/GC.cpp utotal += barrierStageLastCollection[i];
i 667 MMgc/GC.cpp for ( size_t i=0 ; i < blimit ; i++ )
i 668 MMgc/GC.cpp VMPI_sprintf(buf + strlen(buf), " stage%d=%u", unsigned(i), unsigned(barrierStageLastCollection[i]));
i 675 MMgc/GC.cpp for ( size_t i=0 ; i < blimit ; i++ )
i 676 MMgc/GC.cpp dtotal += double(barrierStageLastCollection[i] + barrierStageTotal[i]);
i 678 MMgc/GC.cpp for ( size_t i=0 ; i < blimit ; i++ )
i 679 MMgc/GC.cpp VMPI_sprintf(buf + strlen(buf), " stage%d=%.0f", unsigned(i), double(barrierStageLastCollection[i] + barrierStageTotal[i]));
i 936 MMgc/GC.cpp for (int i=0; i<kNumSizeClasses; i++) {
i 937 MMgc/GC.cpp containsPointersAllocs[i] = mmfx_new(GCAlloc(this, kSizeClasses[i], true, false, i));
i 938 MMgc/GC.cpp containsPointersRCAllocs[i] = mmfx_new(GCAlloc(this, kSizeClasses[i], true, true, i));
i 939 MMgc/GC.cpp noPointersAllocs[i] = mmfx_new(GCAlloc(this, kSizeClasses[i], false, false, i));
i 959 MMgc/GC.cpp for(int i=0; i<GCV_COUNT; i++)
i 961 MMgc/GC.cpp SetGCContextVariable(i, NULL);
i 994 MMgc/GC.cpp for (int i=0; i < kNumSizeClasses; i++) {
i 995 MMgc/GC.cpp mmfx_delete( containsPointersAllocs[i]);
i 996 MMgc/GC.cpp mmfx_delete(containsPointersRCAllocs[i]);
i 997 MMgc/GC.cpp mmfx_delete(noPointersAllocs[i]);
i 1007 MMgc/GC.cpp for(int i=0, n=kNumSizeClasses; i<n; i++) {
i 1008 MMgc/GC.cpp uint32_t* bitsFreelist = m_bitsFreelists[i];
i 1453 MMgc/GC.cpp for (int i=0; i < kNumSizeClasses; i++) {
i 1454 MMgc/GC.cpp containsPointersRCAllocs[i]->ClearMarks();
i 1455 MMgc/GC.cpp containsPointersAllocs[i]->ClearMarks();
i 1456 MMgc/GC.cpp noPointersAllocs[i]->ClearMarks();
i 1464 MMgc/GC.cpp for(int i=0; i < kNumSizeClasses; i++) {
i 1465 MMgc/GC.cpp containsPointersRCAllocs[i]->Finalize();
i 1466 MMgc/GC.cpp containsPointersAllocs[i]->Finalize();
i 1467 MMgc/GC.cpp noPointersAllocs[i]->Finalize();
i 1473 MMgc/GC.cpp for(int i=0; i < kNumSizeClasses; i++) {
i 1474 MMgc/GC.cpp containsPointersRCAllocs[i]->m_finalized = false;
i 1475 MMgc/GC.cpp containsPointersAllocs[i]->m_finalized = false;
i 1476 MMgc/GC.cpp noPointersAllocs[i]->m_finalized = false;
i 1483 MMgc/GC.cpp for(int i=0; i < kNumSizeClasses; i++) {
i 1484 MMgc/GC.cpp containsPointersRCAllocs[i]->SweepNeedsSweeping();
i 1485 MMgc/GC.cpp containsPointersAllocs[i]->SweepNeedsSweeping();
i 1486 MMgc/GC.cpp noPointersAllocs[i]->SweepNeedsSweeping();
i 2011 MMgc/GC.cpp int i;
i 2199 MMgc/GC.cpp for(int i=0; i < kNumSizeClasses; i++)
i 2203 MMgc/GC.cpp DumpAlloc(gc_alloc[i], internal_waste, overhead);
i 2247 MMgc/GC.cpp for(int i=0; i < kNumSizeClasses; i++)
i 2249 MMgc/GC.cpp containsPointersAllocs[i]->CheckFreelist();
i 2250 MMgc/GC.cpp containsPointersRCAllocs[i]->CheckFreelist();
i 2251 MMgc/GC.cpp noPointersAllocs[i]->CheckFreelist();
i 2320 MMgc/GC.cpp for (int i=0; i < b->alloc->m_itemsPerBlock; i++) {
i 2322 MMgc/GC.cpp int marked = GCAlloc::GetBit(b, i, GCAlloc::kMark);
i 2324 MMgc/GC.cpp void* item = (char*)b->items + b->alloc->m_itemSize*i;
i 2458 MMgc/GC.cpp for (int i=0; i < b->alloc->m_itemsPerBlock; i++)
i 2460 MMgc/GC.cpp int marked = GCAlloc::GetBit(b, i, GCAlloc::kMark);
i 2463 MMgc/GC.cpp void* item = (char*)b->items + b->alloc->m_itemSize*i;
i 2504 MMgc/GC.cpp for(int i=0; i < kNumSizeClasses; i++) {
i 2505 MMgc/GC.cpp containsPointersRCAllocs[i]->CheckMarks();
i 2506 MMgc/GC.cpp containsPointersAllocs[i]->CheckMarks();
i 2507 MMgc/GC.cpp noPointersAllocs[i]->CheckMarks();
i 2602 MMgc/GC.cpp for(int i=0; i < kNumSizeClasses; i++) {
i 2603 MMgc/GC.cpp GCAllocIterator iter1(containsPointersRCAllocs[i]);
i 2609 MMgc/GC.cpp GCAllocIterator iter2(containsPointersAllocs[i]);
i 3022 MMgc/GC.cpp for(unsigned int i=0; i<count; i++)
i 3311 MMgc/GC.cpp for(int i=0, n=kNumSizeClasses; i<n; i++) {
i 3312 MMgc/GC.cpp GCAlloc *a = noPointersAllocs[i];
i 3460 MMgc/GC.cpp for (int i=0; i< b->alloc->m_itemsPerBlock; i++) {
i 3462 MMgc/GC.cpp if(!GCAlloc::GetBit(b, i, GCAlloc::kMark))
i 3466 MMgc/GC.cpp void* item = (char*)b->items + b->alloc->m_itemSize*i;
i 3519 MMgc/GC.cpp for(int i=0; i < kNumSizeClasses; i++)
i 3521 MMgc/GC.cpp gc_alloc[i]->GetUsageInfo(ask, allocated);
i 342 MMgc/GCAlloc-inlines.h uint32_t i = idx++;
i 343 MMgc/GCAlloc-inlines.h if (GCAlloc::GetBit(block, i, MMgc::GCAlloc::kMark) && !GCAlloc::GetBit(block, i, MMgc::GCAlloc::kQueued)) {
i 344 MMgc/GCAlloc-inlines.h out_ptr = GetUserPointer(block->items + i*size);
i 436 MMgc/GCAlloc.cpp for(uint32_t i=0; i < numInts; i++)
i 438 MMgc/GCAlloc.cpp uint32_t marks = bits[i];
i 441 MMgc/GCAlloc.cpp uint32_t subCount = i==(numInts-1) ? ((count-1)&7)+1 : 8;
i 455 MMgc/GCAlloc.cpp void* item = (char*)b->items + m_itemSize*((i*8)+j);
i 476 MMgc/GCAlloc.cpp bits[i] &= ~(kFinalize<<(j*4)); // Clear bits first so we won't get second finalization if finalizer longjmps out
i 530 MMgc/GCAlloc.cpp for(uint32_t i=0; i < numInts; i++)
i 532 MMgc/GCAlloc.cpp uint32_t marks = bits[i];
i 535 MMgc/GCAlloc.cpp uint32_t subCount = i==(numInts-1) ? ((count-1)&7)+1 : 8;
i 542 MMgc/GCAlloc.cpp bits[i] &= ~(kFreelist<<(j*4));
i 550 MMgc/GCAlloc.cpp void *item = (char*)b->items + m_itemSize*(i*8+j);
i 555 MMgc/GCAlloc.cpp b->FreeItem(item, (i*8+j));
i 597 MMgc/GCAlloc.cpp for(int i=0, n=m_numBitmapBytes>>2; i < n; i++) {
i 598 MMgc/GCAlloc.cpp pbits[i] &= ~mq32;
i 636 MMgc/GCAlloc.cpp for(uint32_t i=0; i < numInts; i++)
i 638 MMgc/GCAlloc.cpp uint32_t marks = bits[i];
i 641 MMgc/GCAlloc.cpp uint32_t subCount = i==(numInts-1) ? ((count-1)&7)+1 : 8;
i 792 MMgc/GCAlloc.cpp for(int i=startIndex; i<n; i++)
i 794 MMgc/GCAlloc.cpp uint32_t data = ((uint32_t*)item)[i];
i 272 MMgc/GCGlobalNew.h for(size_t i=count; i>0; i--, tp++)
i 169 MMgc/GCHashtable.h uint32_t i = KEYHANDLER::hash(key) & bitMask;
i 171 MMgc/GCHashtable.h while ((k = table[i]) != NULL && !KEYHANDLER::equal(k, key))
i 173 MMgc/GCHashtable.h i = (i + (n += 2)) & bitMask; // quadratic probe
i 175 MMgc/GCHashtable.h GCAssert(i <= ((tableSize-1)&~0x1));
i 176 MMgc/GCHashtable.h return i;
i 194 MMgc/GCHashtable.h uint32_t i = KEYHANDLER::hash(key) & bitMask;
i 196 MMgc/GCHashtable.h while ((k = table[i]) != NULL && !KEYHANDLER::equal(k, key))
i 202 MMgc/GCHashtable.h if (k == DELETED && delindex == NO_DELINDEX) delindex = i;
i 203 MMgc/GCHashtable.h i = (i + (n += 2)) & bitMask; // quadratic probe
i 211 MMgc/GCHashtable.h i = delindex;
i 224 MMgc/GCHashtable.h i = find(key, table, tableSize);
i 225 MMgc/GCHashtable.h GCAssert(!table[i]);
i 229 MMgc/GCHashtable.h table[i] = key;
i 231 MMgc/GCHashtable.h table[i+1] = value;
i 238 MMgc/GCHashtable.h uint32_t i = find(key, table, tableSize);
i 239 MMgc/GCHashtable.h if (table[i] == key)
i 241 MMgc/GCHashtable.h table[i] = DELETED;
i 242 MMgc/GCHashtable.h ret = table[i+1];
i 243 MMgc/GCHashtable.h table[i+1] = NULL;
i 284 MMgc/GCHashtable.h for (uint32_t i=0, n=tableSize; i < n; i += 2)
i 287 MMgc/GCHashtable.h if ((oldKey=table[i]) != NULL)
i 293 MMgc/GCHashtable.h newTable[j+1] = table[i+1];
i 312 MMgc/GCHashtable.h uint32_t i = index<<1;
i 313 MMgc/GCHashtable.h while(i < tableSize)
i 315 MMgc/GCHashtable.h if (table[i] > DELETED)
i 316 MMgc/GCHashtable.h return (i>>1)+1;
i 317 MMgc/GCHashtable.h i += 2;
i 179 MMgc/GCHeap.cpp for (uint32_t i=0; i<kNumFreeLists; i++) {
i 237 MMgc/GCHeap.cpp for (unsigned int i=0; i<blocksLen; i++)
i 239 MMgc/GCHeap.cpp HeapBlock *block = &blocks[i];
i 764 MMgc/GCHeap.cpp for (uint32_t i=0; i<kNumFreeLists; i++) {
i 882 MMgc/GCHeap.cpp for (uint32_t i = startList; i < kNumFreeLists; i++)
i 1099 MMgc/GCHeap.cpp for (uint32_t i = 0; i < kNumFreeLists; i++)
i 1157 MMgc/GCHeap.cpp for( int i = r->blockId-1; i >= 0 ; --i )
i 1158 MMgc/GCHeap.cpp if( blocks[i].size){
i 1160 MMgc/GCHeap.cpp if( ((blocks[i].baseAddr + blocks[i].size*kBlockSize) <= r->baseAddr) ) {
i 1161 MMgc/GCHeap.cpp GCLog("Invalid block id for region %p-%p %d\n", r->baseAddr, r->reserveTop, i);
i 1572 MMgc/GCHeap.cpp for (uint32_t i=0; i<kNumFreeLists; i++) {
i 1642 MMgc/GCHeap.cpp for (uint32_t i=1; i < freeBlockSize; i++) {
i 2124 MMgc/GCHeap.cpp for(int i=0; i < numRegions; i++, r = r->prev) {
i 2125 MMgc/GCHeap.cpp int insert = i;
i 2126 MMgc/GCHeap.cpp for(int j=0; j < i; j++) {
i 2128 MMgc/GCHeap.cpp memmove(®ions[j+1], ®ions[j], sizeof(Region*) * (i - j));
i 2137 MMgc/GCHeap.cpp for(int i=0; i < numRegions; i++)
i 2139 MMgc/GCHeap.cpp r = regions[i];
i 2167 MMgc/GCHeap.cpp size_t i, n;
i 2168 MMgc/GCHeap.cpp for(i=0, n=hb->size; i < n; i++, addr += GCHeap::kBlockSize) {
i 2176 MMgc/GCHeap.cpp LogChar(c, i);
i 96 MMgc/GCLargeAlloc.cpp for(int i=0, n=(int)(requestSize/sizeof(int)); i<n; i++) {
i 97 MMgc/GCLargeAlloc.cpp if(((int*)item)[i] != 0)
i 132 MMgc/GCMemoryProfiler.cpp int i=0;
i 134 MMgc/GCMemoryProfiler.cpp while((ip = trace->ips[i++]) != 0) {
i 460 MMgc/GCMemoryProfiler.cpp for(unsigned i=0; i<packageCount; i++)
i 462 MMgc/GCMemoryProfiler.cpp PackageGroup* pg = packages[i];
i 501 MMgc/GCMemoryProfiler.cpp for(int i=0; i < numTypes; i++)
i 503 MMgc/GCMemoryProfiler.cpp CategoryGroup *tg = residentFatties[i];
i 610 MMgc/GCMemoryProfiler.cpp for(int i=0; trace[i] != 0; i++) {
i 618 MMgc/GCMemoryProfiler.cpp if((found_name = VMPI_getFunctionNameFromPC(trace[i], buff, sizeof(buff))) == false)
i 620 MMgc/GCMemoryProfiler.cpp VMPI_snprintf(buff, sizeof(buff), "0x%llx", (unsigned long long)trace[i]);
i 626 MMgc/GCMemoryProfiler.cpp if(VMPI_getFileAndLineInfoFromPC(trace[i], buff, sizeof(buff), &lineNum))
i 637 MMgc/GCMemoryProfiler.cpp tp += VMPI_sprintf(tp, " - 0x%x", (unsigned int) trace[i]);
i 68 MMgc/GCMemoryProfiler.h for(int i=0;i<kMaxStackTrace; i++)
i 69 MMgc/GCMemoryProfiler.h hash += array[i];
i 49 MMgc/GCObject.cpp for(uint32_t i=0, n=history.Count(); i<n; i++)
i 51 MMgc/GCObject.cpp PrintStackTrace(history.Get(i));
i 123 MMgc/GCTests.cpp for(int i=0, n=length; i<n;i++)
i 125 MMgc/GCTests.cpp r1 = rcs[i];
i 161 MMgc/GCTests.cpp for(int i=0, n=1000;i<n; i++)
i 153 MMgc/ZCT.cpp for ( uint32_t i=0 ; i < CAPACITY(RCObject**)*numblocks ; i++ )
i 154 MMgc/ZCT.cpp blocktable[i] = NULL;
i 411 MMgc/ZCT.cpp for ( uint32_t i=0 ; i < topIndex ; i++ ) {
i 414 MMgc/ZCT.cpp if (Get(i) != NULL) {
i 415 MMgc/ZCT.cpp GCAssert(Get(i)->getZCTIndex() == i);
i 416 MMgc/ZCT.cpp GCAssert(!Get(i)->IsPinned());
i 248 VMPI/MMgcPortMac.cpp size_t i=0;
i 251 VMPI/MMgcPortMac.cpp while(i<len && stackp) {
i 253 VMPI/MMgcPortMac.cpp buffer[i++]=pc;
i 256 VMPI/MMgcPortMac.cpp buffer[i] = 0;
i 309 VMPI/MMgcPortMac.cpp size_t i=0;
i 310 VMPI/MMgcPortMac.cpp while(i<bufferSize)
i 316 VMPI/MMgcPortMac.cpp buffer[i++] = *((uintptr_t*)ebp+1);
i 319 VMPI/MMgcPortMac.cpp buffer[i] = 0;
i 195 VMPI/MMgcPortUnix.cpp int i = 0;
i 196 VMPI/MMgcPortUnix.cpp while(i < read_size )
i 198 VMPI/MMgcPortUnix.cpp char c = buff[i++];
i 269 VMPI/MMgcPortUnix.cpp int mapfd, nmap, i;
i 303 VMPI/MMgcPortUnix.cpp for (i = 0, pmp = prmapp; i < nmap; i++, pmp++) {
i 364 VMPI/MMgcPortUnix.cpp int i=0;
i 367 VMPI/MMgcPortUnix.cpp while(i<bufferSize && stackp) {
i 369 VMPI/MMgcPortUnix.cpp buffer[i++]=pc;
i 372 VMPI/MMgcPortUnix.cpp buffer[i] = 0;
i 392 VMPI/MMgcPortUnix.cpp int i = 0;
i 394 VMPI/MMgcPortUnix.cpp while (i < bufferSize && *ebp)
i 397 VMPI/MMgcPortUnix.cpp buffer[i++] = *((sintptr*) ebp + 1);
i 402 VMPI/MMgcPortUnix.cpp buffer[i] = 0;
i 571 VMPI/MMgcPortWin.cpp size_t i = 0;
i 572 VMPI/MMgcPortWin.cpp for( ; i < dwCnt && i < bufferSize ; ++i )
i 574 VMPI/MMgcPortWin.cpp buffer[i] = lpFrames[i].dwReturnAddr;
i 279 axscript/ByteArrayGlue.cpp if (i < (uint32)m_byteArray.GetLength()) {
i 280 axscript/ByteArrayGlue.cpp return core()->intToAtom(m_byteArray[i]);
i 288 axscript/ByteArrayGlue.cpp m_byteArray[i] = (U8)(core()->integer(value));
i 374 axscript/ByteArrayGlue.cpp for (uint32 i = 0; i < len; i++)
i 376 axscript/ByteArrayGlue.cpp buffer[i] = (c[0] << 8) + c[1];
i 390 axscript/ByteArrayGlue.cpp for (uint32 i = 0; i < len; i++)
i 392 axscript/ByteArrayGlue.cpp buffer[i] = (c[1] << 8) + c[0];
i 103 axscript/ByteArrayGlue.h virtual Atom getUintProperty(uint32 i) const;
i 104 axscript/ByteArrayGlue.h virtual void setUintProperty(uint32 i, Atom value);
i 110 axscript/FileClass.cpp for (long i = 0; i < len; i++)
i 112 axscript/FileClass.cpp buffer[i] = (c[0] << 8) + c[1];
i 126 axscript/FileClass.cpp for (long i = 0; i < len; i++)
i 128 axscript/FileClass.cpp buffer[i] = (c[1] << 8) + c[0];
i 217 axscript/IDispatchConsumer.cpp int i;
i 218 axscript/IDispatchConsumer.cpp for (i=0;i<argc;i++) {
i 221 axscript/IDispatchConsumer.cpp vars[argc-i-1] = core->atomToVARIANT(argv[i+1]);
i 74 axscript/IDispatchConsumer.h virtual Atom getUintProperty(uint32 i) const
i 76 axscript/IDispatchConsumer.h return getAtomProperty(core()->internUint32(i)->atom());
i 78 axscript/IDispatchConsumer.h virtual void setUintProperty(uint32 i, Atom value)
i 80 axscript/IDispatchConsumer.h setAtomProperty(core()->internUint32(i)->atom(), value);
i 82 axscript/IDispatchConsumer.h virtual bool delUintProperty(uint32 i)
i 84 axscript/IDispatchConsumer.h return deleteAtomProperty(core()->internUint32(i)->atom());
i 86 axscript/IDispatchConsumer.h virtual bool hasUintProperty(uint32 i) const
i 88 axscript/IDispatchConsumer.h return hasAtomProperty(core()->internUint32(i)->atom());
i 127 axscript/IDispatchProvider.cpp for (unsigned i=0;i<pdp->cArgs;i++) {
i 128 axscript/IDispatchProvider.cpp argv[i+1] = core->toAtom(pdp->rgvarg[pdp->cArgs-i-1]);
i 181 axscript/IDispatchProvider.cpp for (unsigned i=0;i<pdp->cArgs;i++) {
i 182 axscript/IDispatchProvider.cpp argv[i+1] = core->toAtom(pdp->rgvarg[pdp->cArgs-i-1]);
i 87 axscript/SystemClass.cpp for (int i=0, n = a->getLength(); i < n; i++)
i 89 axscript/SystemClass.cpp if (i > 0)
i 91 axscript/SystemClass.cpp Stringp s = core->string(a->getUintProperty(i));
i 526 axscript/axtam.cpp for (long i=lb;i<=ub;i++) {
i 534 axscript/axtam.cpp if (FAILED(hr = SafeArrayGetElement(psa, &i, &elt)))
i 541 axscript/axtam.cpp if (FAILED(hr = SafeArrayGetElement(psa, &i, &elt)))
i 550 axscript/axtam.cpp if (FAILED(hr = SafeArrayGetElement(psa, &i, &elt)))
i 558 axscript/axtam.cpp if (FAILED(hr = SafeArrayGetElement(psa, &i, &elt)))
i 566 axscript/axtam.cpp if (FAILED(hr = SafeArrayGetElement(psa, &i, &elt)))
i 574 axscript/axtam.cpp if (FAILED(hr = SafeArrayGetElement(psa, &i, &elt)))
i 581 axscript/axtam.cpp if (FAILED(hr = SafeArrayGetElement(psa, &i, &elt)))
i 588 axscript/axtam.cpp if (FAILED(hr = SafeArrayGetElement(psa, &i, &elt)))
i 595 axscript/axtam.cpp if (FAILED(hr = SafeArrayGetElement(psa, &i, &elt)))
i 602 axscript/axtam.cpp if (FAILED(hr = SafeArrayGetElement(psa, &i, &elt)))
i 609 axscript/axtam.cpp if (FAILED(hr = SafeArrayGetElement(psa, &i, &elt)))
i 616 axscript/axtam.cpp if (FAILED(hr = SafeArrayGetElement(psa, &i, &elt)))
i 71 axscript/mscom.cpp int i;
i 72 axscript/mscom.cpp for (i=0;i<argc;i++) {
i 74 axscript/mscom.cpp axcore->atomToVARIANT(argv[i+1], pArgs+i);
i 58 core/AbcEnv-inlines.h REALLY_INLINE MethodEnv* AbcEnv::getMethod(uint32_t i) const
i 60 core/AbcEnv-inlines.h return m_methods[i];
i 63 core/AbcEnv-inlines.h REALLY_INLINE void AbcEnv::setMethod(uint32_t i, MethodEnv* env)
i 65 core/AbcEnv-inlines.h WB(m_pool->core->GetGC(), this, &m_methods[i], env);
i 69 core/AbcEnv-inlines.h REALLY_INLINE uint64_t& AbcEnv::invocationCount(uint32_t i)
i 72 core/AbcEnv-inlines.h AvmAssert(i < m_pool->methodCount());
i 73 core/AbcEnv-inlines.h return m_invocationCounts[i];
i 59 core/AbcEnv.h MethodEnv* getMethod(uint32_t i) const;
i 60 core/AbcEnv.h void setMethod(uint32_t i, MethodEnv* env);
i 63 core/AbcEnv.h uint64_t& invocationCount(uint32_t i);
i 81 core/AbcParser.cpp for(int i = 0; i < nAOTInfos; i++)
i 83 core/AbcParser.cpp const AOTInfo *aotInfo = &aotInfos[i];
i 164 core/AbcParser.cpp for(int i = 0; i < info.local_count; i++)
i 166 core/AbcParser.cpp int name = info.local_names[i];
i 169 core/AbcParser.cpp f->setRegName(i, pool->getString(name));
i 174 core/AbcParser.cpp for(int i = 0; i < info.line_count; i++)
i 175 core/AbcParser.cpp src->addLine(info.lines[i], f, 0);
i 429 core/AbcParser.cpp for (uint32_t i=0; i < nameCount; i++)
i 665 core/AbcParser.cpp for (int i = 0; i < size; ++i)
i 666 core/AbcParser.cpp pool->_method_dmi.set(i, NULL);
i 680 core/AbcParser.cpp for (int i=0; i < methodCount; i++)
i 702 core/AbcParser.cpp core->console << " " << offset << ":method["<<i<<"]\n"
i 741 core/AbcParser.cpp ni = natives ? natives->getNativeInfo(i) : NULL;
i 760 core/AbcParser.cpp if (!ni && natives->getCompiledInfo(&compiledMethodInfo, returnTypeName, i))
i 771 core/AbcParser.cpp MethodInfo* info = new (core->GetGC()) MethodInfo(i, pool, info_pos, abcFlags, ni);
i 781 core/AbcParser.cpp pool->_method_name_indices.set(i, int32_t(name_index));
i 810 core/AbcParser.cpp pool->_methods.set(i, info);
i 842 core/AbcParser.cpp for (uint32_t i=0; i < metadataCount; i++)
i 844 core/AbcParser.cpp pool->metadata_infos.set(i, pos);
i 849 core/AbcParser.cpp metaNames[i] = name;
i 909 core/AbcParser.cpp for (int i=0; i < bodyCount; i++)
i 975 core/AbcParser.cpp for (int i=0; i<exception_count; i++)
i 998 core/AbcParser.cpp core->console << " exception["<<i<<"] from="<< from
i 1160 core/AbcParser.cpp for(uint32_t i = 1; i < int_count; ++i)
i 1166 core/AbcParser.cpp cpool_int.set(i, readS32(pos));
i 1169 core/AbcParser.cpp core->console << " " << offset << ":" << "cpool_int["<<(uint32_t)i<<"]="
i 1171 core/AbcParser.cpp core->console << cpool_int[i] << "\n";
i 1188 core/AbcParser.cpp for(uint32_t i = 1; i < uint_count; ++i)
i 1194 core/AbcParser.cpp cpool_uint.set(i, (unsigned)readS32(pos));
i 1198 core/AbcParser.cpp core->console << " " << offset << ":" << "cpool_uint["<<i<<"]="
i 1200 core/AbcParser.cpp core->console << (double)cpool_uint[i];
i 1218 core/AbcParser.cpp for(uint32_t i = 1; i < double_count; ++i)
i 1224 core/AbcParser.cpp cpool_double.set(i, (double*)(core->allocDouble(value)&~7));
i 1227 core/AbcParser.cpp core->console << " " << offset << ":" << "cpool_double["<<i<<"]="
i 1229 core/AbcParser.cpp core->console << *cpool_double[i];
i 1251 core/AbcParser.cpp for(uint32_t i = 1; i < string_count; ++i)
i 1278 core/AbcParser.cpp core->console << " " << offset << ":" << "cpool_string["<<i<<"]="
i 1302 core/AbcParser.cpp for( uint32_t i = 1; i < ns_count; ++i )
i 1358 core/AbcParser.cpp cpool_ns.set(i, ns);
i 1364 core/AbcParser.cpp cpool_ns.set(i, core->internNamespace(core->newNamespace(uri, type)));
i 1374 core/AbcParser.cpp cpool_ns.set(i, ns);
i 1379 core/AbcParser.cpp toplevel->throwVerifyError(kCpoolEntryWrongTypeError, core->toErrorString(i));
i 1384 core/AbcParser.cpp core->console << " " << offset << ":" << "cpool_ns["<<i<<"]="
i 1386 core/AbcParser.cpp core->console << core->format(cpool_ns[i]->atom());
i 1404 core/AbcParser.cpp for( uint32_t i = 1; i < ns_set_count; ++i)
i 1422 core/AbcParser.cpp cpool_ns_set.set(i, namespace_set);
i 1426 core/AbcParser.cpp core->console << " " << offset << ":" << "cpool_ns_set["<<i<<"]="
i 1428 core/AbcParser.cpp core->console << cpool_ns_set[i]->format(core);
i 1443 core/AbcParser.cpp for(uint32_t i = 1; i < mn_count; ++i )
i 1447 core/AbcParser.cpp cpool_mn_offsets.set(i, offset);
i 1519 core/AbcParser.cpp toplevel->throwVerifyError(kCpoolEntryWrongTypeError, core->toErrorString(i));
i 1523 core/AbcParser.cpp core->console << " " << offset << ":" << "cpool_mn["<<i<<"]="
i 1526 core/AbcParser.cpp pool->parseMultiname(name, i);
i 1633 core/AbcParser.cpp for (uint32_t i=0; i < count; i++)
i 1641 core/AbcParser.cpp core->console << " " << (int)(script_pos-startpos) << ":script[" << i << "]"
i 1684 core/AbcParser.cpp pool->_scripts.set(i, traits);
i 1686 core/AbcParser.cpp pool->aotInfo->scriptTraits[i] = traits;
i 1719 core/AbcParser.cpp for (uint32_t i=0; i < classCount; i++)
i 1809 core/AbcParser.cpp << " " << (int)(instancepos-startpos) << ":instance[" << i << "]"
i 1824 core/AbcParser.cpp computeInstanceSizeAndSlotsOffset(i, baseTraits, sizeofInstance, offsetofSlots);
i 1883 core/AbcParser.cpp instances.set(i, itraits);
i 1910 core/AbcParser.cpp for (uint32_t i=0; i < classCount; i++)
i 1913 core/AbcParser.cpp Traits* itraits = instances[i];
i 1925 core/AbcParser.cpp << " " << (int)(class_pos-startpos) << ":class[" << i << "]"
i 1934 core/AbcParser.cpp const NativeClassInfo* nativeEntry = natives ? natives->get_class(i) : NULL;
i 1970 core/AbcParser.cpp pool->_classes.set(i, ctraits);
i 191 core/ArrayClass.cpp uint32 i;
i 196 core/ArrayClass.cpp for (i = 0; i< argc; i++)
i 198 core/ArrayClass.cpp Atom atom = args->getUintProperty(i);
i 223 core/ArrayClass.cpp for (i = denseLength; i < len; i++) {
i 224 core/ArrayClass.cpp out->setUintProperty(i, d->getUintProperty(i));
i 228 core/ArrayClass.cpp for (i = 0; i< (uint32)argc; i++)
i 230 core/ArrayClass.cpp Atom atom = args->getUintProperty(i);
i 307 core/ArrayClass.cpp uint32 i = 0;
i 311 core/ArrayClass.cpp while (i < j) {
i 312 core/ArrayClass.cpp Atom frontAtom = d->getUintProperty(i);
i 315 core/ArrayClass.cpp d->setUintProperty(i++, backAtom);
i 358 core/ArrayClass.cpp for (uint32 i=0; i<len-1; i++) {
i 359 core/ArrayClass.cpp d->setUintProperty(i, d->getUintProperty(i+1));
i 391 core/ArrayClass.cpp for (uint32 i=a; i<b; i++) {
i 392 core/ArrayClass.cpp out->setUintProperty (outIndex++, d->getUintProperty (i));
i 464 core/ArrayClass.cpp Atom get(uint32 i) const { return atoms->getAt(index[i]); }
i 555 core/ArrayClass.cpp uint32 i, j;
i 565 core/ArrayClass.cpp for (i = (len - 1), j = len; (i+1) != 0; i--)
i 567 core/ArrayClass.cpp index[i] = i;
i 568 core/ArrayClass.cpp Atom a = d->getUintProperty(i);
i 569 core/ArrayClass.cpp fieldatoms->setAt(i, a);
i 582 core/ArrayClass.cpp atoms->setAt(i, x);
i 588 core/ArrayClass.cpp uint32 temp = index[i];
i 589 core/ArrayClass.cpp index[i] = index[j];
i 591 core/ArrayClass.cpp if (!d->hasUintProperty(i)) {
i 620 core/ArrayClass.cpp for (i = (len - 1), j = len; (i+1) != 0; i--)
i 622 core/ArrayClass.cpp index[i] = i;
i 623 core/ArrayClass.cpp atoms->setAt(i, d->getUintProperty(i));
i 627 core/ArrayClass.cpp if(isNumericCompare && !core->isNumber(atoms->getAt(i)))
i 629 core/ArrayClass.cpp double val = AvmCore::number(atoms->getAt(i));
i 632 core/ArrayClass.cpp toplevel->throwTypeError(kCheckTypeFailedError, core->atomToErrorString(atoms->getAt(i)), core->toErrorString(core->traits.number_itraits));
i 647 core/ArrayClass.cpp if (!defined(atoms->getAt(i))) {
i 650 core/ArrayClass.cpp uint32 temp = index[i];
i 651 core/ArrayClass.cpp index[i] = index[j];
i 653 core/ArrayClass.cpp if (!d->hasUintProperty(i)) {
i 678 core/ArrayClass.cpp for (uint32 i = 0; i < (len - 1); i++)
i 680 core/ArrayClass.cpp if (compare(i, (i+1)) == 0)
i 693 core/ArrayClass.cpp for (uint32 i = 0; i < len; i++)
i 695 core/ArrayClass.cpp obj->setUintProperty(i, core->uintToAtom(index[i]));
i 712 core/ArrayClass.cpp for (i = 0; i < iFirstAbsent; i++) {
i 713 core/ArrayClass.cpp d->setUintProperty(i, get(i));
i 716 core/ArrayClass.cpp for (i = iFirstAbsent; i < len; i++) {
i 717 core/ArrayClass.cpp d->delUintProperty(i);
i 744 core/ArrayClass.cpp for(int i=0; i<numFields; i++) {
i 745 core/ArrayClass.cpp fields[i].name = NULL;
i 1034 core/ArrayClass.cpp for (uint32 i = 0; i < numFields; i++)
i 1036 core/ArrayClass.cpp Stringp name = fields[i].name;
i 1040 core/ArrayClass.cpp opt = fields[i].options; // override the group defaults with the current field
i 1242 core/ArrayClass.cpp for (uint32 i = 0; i < nFields; i++)
i 1244 core/ArrayClass.cpp fn[i].name = core->intern(obj->getUintProperty(i));
i 1245 core/ArrayClass.cpp fn[i].options = 0;
i 1256 core/ArrayClass.cpp for (uint32 i = 0; i < nFields; i++)
i 1258 core/ArrayClass.cpp fn[i].options = AvmCore::integer(obj->getUintProperty (i));
i 1265 core/ArrayClass.cpp for (uint32 i = 0; i < nFields; i++)
i 1267 core/ArrayClass.cpp fn[i].options = options;
i 1310 core/ArrayClass.cpp uint32 i;
i 1313 core/ArrayClass.cpp for (i=0; i< deleteCount; i++) {
i 1314 core/ArrayClass.cpp out->setUintProperty(i, d->getUintProperty(i+start));
i 1334 core/ArrayClass.cpp for (i=end; i<len; i++) {
i 1335 core/ArrayClass.cpp d->setUintProperty(i-shiftAmount, d->getUintProperty(i));
i 1339 core/ArrayClass.cpp for (i=len-shiftAmount; i<len; i++) {
i 1340 core/ArrayClass.cpp d->delUintProperty (i);
i 1346 core/ArrayClass.cpp for (i=len; i > end; ) { // Note: i is unsigned, can't check if --i >=0.
i 1347 core/ArrayClass.cpp --i;
i 1348 core/ArrayClass.cpp d->setUintProperty(i+shiftAmount, d->getUintProperty(i));
i 1353 core/ArrayClass.cpp for (i=0; i<insertCount; i++) {
i 1354 core/ArrayClass.cpp d->setUintProperty(start+i, args->getUintProperty(i + 2));
i 1367 core/ArrayClass.cpp for (uint32 i=0; i<uint32(argc); i++) {
i 1368 core/ArrayClass.cpp inst->setUintProperty(i, argv[i]);
i 1399 core/ArrayClass.cpp for (uint32 i = start; i < len; i++)
i 1401 core/ArrayClass.cpp Atom atom = d->getUintProperty(i);
i 1403 core/ArrayClass.cpp return i;
i 1422 core/ArrayClass.cpp for (int i = start; i >= 0; i--)
i 1424 core/ArrayClass.cpp Atom atom = d->getUintProperty(i);
i 1426 core/ArrayClass.cpp return i;
i 1446 core/ArrayClass.cpp for (uint32 i = 0; i < len; i++)
i 1451 core/ArrayClass.cpp d->getUintProperty(i), // element
i 1452 core/ArrayClass.cpp core->uintToAtom(i), // index
i 1479 core/ArrayClass.cpp for (uint32 i = 0; i < len; i++)
i 1485 core/ArrayClass.cpp d->getUintProperty(i), // element
i 1486 core/ArrayClass.cpp core->uintToAtom(i), // index
i 1511 core/ArrayClass.cpp for (uint32 i = 0; i < len; i++)
i 1516 core/ArrayClass.cpp d->getUintProperty(i), // element
i 1517 core/ArrayClass.cpp core->uintToAtom(i), // index
i 1538 core/ArrayClass.cpp for (uint32 i = 0; i < len; i++)
i 1544 core/ArrayClass.cpp d->getUintProperty(i), // element
i 1545 core/ArrayClass.cpp core->uintToAtom(i), // index
i 1567 core/ArrayClass.cpp for (uint32 i = 0; i < len; i++)
i 1573 core/ArrayClass.cpp d->getUintProperty(i), // element
i 1574 core/ArrayClass.cpp core->uintToAtom(i), // index
i 1607 core/ArrayClass.cpp for (uint32 i = args->getLength() ; i > 0; i--) {
i 1608 core/ArrayClass.cpp Atom atom = args->getUintProperty(i - 1);
i 295 core/ArrayObject.cpp for (uint32 i = index + 1; i < getDenseLength(); i++)
i 297 core/ArrayObject.cpp ScriptObject::setUintProperty (i, m_denseArr.getAtFast(i));
i 449 core/ArrayObject.cpp for (uint32 i = deleteStart; i < oldLength; i++) {
i 450 core/ArrayObject.cpp delUintProperty(i);
i 491 core/ArrayObject.cpp for (int i=0; i < argc; i++) {
i 492 core/ArrayObject.cpp _setUintProperty(getLength(), argv[i]);
i 509 core/ArrayObject.cpp uint32 i;
i 512 core/ArrayObject.cpp for (i=len; i > 0; ) { // note: i is unsigned, can't check if --i >=0.
i 513 core/ArrayObject.cpp i--;
i 514 core/ArrayObject.cpp _setUintProperty(i+argc, _getUintProperty(i));
i 517 core/ArrayObject.cpp for (i=0; i < ((uint32)argc); i++) {
i 518 core/ArrayObject.cpp _setUintProperty(i, argv[i]);
i 97 core/ArrayObject.h virtual bool hasUintProperty(uint32 i) const;
i 93 core/AtomArray.cpp for(int i=0; i < argc; i++) {
i 94 core/AtomArray.cpp push(args[i]);
i 169 core/AtomArray.cpp for (uint32 i=0; i<insertCount; i++)
i 171 core/AtomArray.cpp setAtInternal(insertPoint+i, argsArr[i+offset]);
i 190 core/AtomArray.cpp for(int i=0; i<argc; i++) {
i 191 core/AtomArray.cpp setAtInternal(i, args[i]);
i 372 core/AvmCore-inlines.h intptr_t const i = atomGetIntptr(a);
i 373 core/AvmCore-inlines.h AvmAssert(i == int32_t(i));
i 374 core/AvmCore-inlines.h return int32_t(i);
i 387 core/AvmCore-inlines.h intptr_t const i = atomGetIntptr(a);
i 388 core/AvmCore-inlines.h AvmAssert(i == intptr_t(uint32_t(i)));
i 389 core/AvmCore-inlines.h return uint32_t(i);
i 298 core/AvmCore.cpp for (int i = 0; i < 128; i++)
i 300 core/AvmCore.cpp AvmAssert(k_cachedChars[i] == i);
i 304 core/AvmCore.cpp cachedChars[i] = internString(String::createLatin1(this, &k_cachedChars[i], 1));
i 398 core/AvmCore.cpp for(int i=0, size=builtinPool->methodCount(); i<size; i++)
i 399 core/AvmCore.cpp builtinPool->getMethodInfo(i)->makeNonInterruptible();
i 401 core/AvmCore.cpp for(int i=0, size=builtinPool->classCount(); i<size; i++)
i 402 core/AvmCore.cpp builtinPool->getClassTraits(i)->init->makeNonInterruptible();
i 404 core/AvmCore.cpp for(int i=0, size=builtinPool->scriptCount(); i<size; i++)
i 405 core/AvmCore.cpp builtinPool->getScriptTraits(i)->init->makeNonInterruptible();
i 570 core/AvmCore.cpp for (int i=0, n=pool->scriptCount()-1; i < n; i++)
i 572 core/AvmCore.cpp initScript(this, toplevel, abcEnv, pool->getScriptTraits(i));
i 577 core/AvmCore.cpp for (int i=0, n=pool->scriptCount(); i < n; i++)
i 578 core/AvmCore.cpp enqTraits(pool->getScriptTraits(i));
i 1553 core/AvmCore.cpp int i = findNamespace(ns);
i 1554 core/AvmCore.cpp if (namespaces[i] == NULL)
i 1558 core/AvmCore.cpp namespaces[i] = ns;
i 1563 core/AvmCore.cpp return namespaces[i];
i 1703 core/AvmCore.cpp for (int i=0; i <= maxindex; i++)
i 1897 core/AvmCore.cpp for (int i=0; i <= maxindex; i++)
i 2181 core/AvmCore.cpp const int32_t i = MathUtils::real2int(d);
i 2182 core/AvmCore.cpp return d == (double)i;
i 2468 core/AvmCore.cpp for (int i = 0; i < x; i += 2)
i 2470 core/AvmCore.cpp if (c >= letterTable[i] && c <= letterTable[i+1])
i 2577 core/AvmCore.cpp for (int i = 0; i < x; i += 2)
i 2579 core/AvmCore.cpp if (c >= combiningCharTable[i] && c <= combiningCharTable[i+1])
i 2606 core/AvmCore.cpp for (int i = 0; i < x; i += 2)
i 2608 core/AvmCore.cpp if (c >= digitTable[i] && c <= digitTable[i+1])
i 2629 core/AvmCore.cpp for (int i = 0; i < x; i += 2)
i 2631 core/AvmCore.cpp if (c >= extenderTable[i] && c <= extenderTable[i+1])
i 2658 core/AvmCore.cpp for (int i = 1; i < p->length(); i++)
i 2660 core/AvmCore.cpp wchar c = p[i];
i 2719 core/AvmCore.cpp int i = 0;
i 2736 core/AvmCore.cpp for (i = 0; i <= last; i++)
i 2738 core/AvmCore.cpp if (!String::isSpace(s[i]))
i 2743 core/AvmCore.cpp while (i <= last)
i 2745 core/AvmCore.cpp switch (s[i])
i 2760 core/AvmCore.cpp output << (s[i]);
i 2763 core/AvmCore.cpp i++;
i 2775 core/AvmCore.cpp for (int i = 0; i < s->length(); i++)
i 2777 core/AvmCore.cpp switch (s[i])
i 2801 core/AvmCore.cpp output << (s[i]);
i 2916 core/AvmCore.cpp for (int i=0, n=numStrings; i < n; i++)
i 2918 core/AvmCore.cpp if (strings[i] > AVMPLUS_STRING_DELETED && !GetGC()->GetMark(strings[i]))
i 2920 core/AvmCore.cpp strings[i] = AVMPLUS_STRING_DELETED;
i 2931 core/AvmCore.cpp for (int i=0, n=numNamespaces; i < n; i++)
i 2933 core/AvmCore.cpp if (namespaces[i] != NULL && !GetGC()->GetMark(namespaces[i]))
i 2936 core/AvmCore.cpp namespaces[i] = NULL;
i 2989 core/AvmCore.cpp int i = (hashCode&0x7FFFFFFF) & bitMask;
i 2994 core/AvmCore.cpp while ((k=strings[i]) != NULL && !k->equals(s)) {
i 2995 core/AvmCore.cpp i = (i + (n++)) & bitMask; // quadratic probe
i 3001 core/AvmCore.cpp while ((k=strings[i]) != NULL)
i 3007 core/AvmCore.cpp iFirstDeletedSlot = i;
i 3014 core/AvmCore.cpp i = (i + (n++)) & bitMask; // quadratic probe
i 3018 core/AvmCore.cpp i = iFirstDeletedSlot;
i 3020 core/AvmCore.cpp return i;
i 3040 core/AvmCore.cpp int i = (hashCode&0x7FFFFFFF) & bitMask;
i 3045 core/AvmCore.cpp while ((k=strings[i]) != NULL && !k->equalsLatin1(s,len)) {
i 3046 core/AvmCore.cpp i = (i + (n++)) & bitMask; // quadratic probe
i 3052 core/AvmCore.cpp while ((k=strings[i]) != NULL)
i 3058 core/AvmCore.cpp iFirstDeletedSlot = i;
i 3065 core/AvmCore.cpp i = (i + (n++)) & bitMask; // quadratic probe
i 3069 core/AvmCore.cpp i = iFirstDeletedSlot;
i 3071 core/AvmCore.cpp return i;
i 3091 core/AvmCore.cpp int i = (hashCode&0x7FFFFFFF) & bitMask;
i 3096 core/AvmCore.cpp while ((k=strings[i]) != NULL && !k->equalsUTF16(s,len)) {
i 3097 core/AvmCore.cpp i = (i + (n++)) & bitMask; // quadratic probe
i 3103 core/AvmCore.cpp while ((k=strings[i]) != NULL)
i 3109 core/AvmCore.cpp iFirstDeletedSlot = i;
i 3116 core/AvmCore.cpp i = (i + (n++)) & bitMask; // quadratic probe
i 3120 core/AvmCore.cpp i = iFirstDeletedSlot;
i 3123 core/AvmCore.cpp return i;
i 3145 core/AvmCore.cpp int i = (hashCode&0x7FFFFFFF) & bitMask;
i 3148 core/AvmCore.cpp while ((k=namespaces[i]) != NULL && (k->m_uri != ns->m_uri || k->m_api != ns->m_api)) {
i 3149 core/AvmCore.cpp i = (i + (n++)) & bitMask; // quadratic probe
i 3151 core/AvmCore.cpp return i;
i 3164 core/AvmCore.cpp int i = (hashCode&0x7FFFFFFF) & bitMask;
i 3167 core/AvmCore.cpp while ((k=namespaces[i]) != NULL &&
i 3170 core/AvmCore.cpp i = (i + (n++)) & bitMask; // quadratic probe
i 3172 core/AvmCore.cpp return namespaces[i];
i 3179 core/AvmCore.cpp int i = findStringLatin1(s, len);
i 3181 core/AvmCore.cpp if ((other=strings[i]) <= AVMPLUS_STRING_DELETED)
i 3198 core/AvmCore.cpp i = findStringLatin1(s, len);
i 3200 core/AvmCore.cpp strings[i] = other;
i 3223 core/AvmCore.cpp int i = findString(o);
i 3225 core/AvmCore.cpp if ((other=strings[i]) <= AVMPLUS_STRING_DELETED)
i 3236 core/AvmCore.cpp strings[i] = o;
i 3287 core/AvmCore.cpp int i = findStringUTF16(buffer, len16);
i 3289 core/AvmCore.cpp if ((other=strings[i]) > AVMPLUS_STRING_DELETED)
i 3303 core/AvmCore.cpp int i = findString(s);
i 3305 core/AvmCore.cpp if ((other=strings[i]) <= AVMPLUS_STRING_DELETED)
i 3315 core/AvmCore.cpp strings[i] = s;
i 3325 core/AvmCore.cpp int i = findStringUTF16(s, len);
i 3327 core/AvmCore.cpp if ((other=strings[i]) <= AVMPLUS_STRING_DELETED)
i 3344 core/AvmCore.cpp i = findStringUTF16(s, len);
i 3346 core/AvmCore.cpp strings[i] = other;
i 3379 core/AvmCore.cpp for (int i=0; i < oldStringCount; i++)
i 3381 core/AvmCore.cpp Stringp o = oldStrings[i];
i 3427 core/AvmCore.cpp for (int i=0; i < oldCount; i++)
i 3429 core/AvmCore.cpp Namespacep o = old[i];
i 3822 core/AvmCore.cpp for (int32 i = 0; i < len; i++)
i 3824 core/AvmCore.cpp swapped[i] = avmSwap16(s[i]);
i 4025 core/AvmCore.cpp uint64 i;
i 4074 core/AvmCore.cpp duh.i = du.i;
i 4077 core/AvmCore.cpp duh.i &= (uint64)MASK;
i 4091 core/AvmCore.cpp du.i &= (uint64)MASK;
i 4092 core/AvmCore.cpp sign_d = du.i & 0x8000000000000000ull;
i 4093 core/AvmCore.cpp two32.i = 0x41f0000000000000ull ^ sign_d;
i 4134 core/AvmCore.cpp duh.i = du.i;
i 4346 core/AvmCore.cpp for (int i=0, n=td->methodCount; i < n; i++)
i 4347 core/AvmCore.cpp enqFunction(td->getMethod(i));
i 4495 core/AvmCore.cpp for (uint32_t i = 0; i < apis_count; ++i) {
i 4496 core/AvmCore.cpp Namespacep ns = this->internNamespace(this->newNamespace(kEmptyString, Namespace::NS_Public, 0x1<<i));
i 4497 core/AvmCore.cpp publicNamespaces->_initNsAt(i, ns);
i 4647 core/AvmCore.cpp uint32_t i = this->uris_count / 2;
i 4649 core/AvmCore.cpp for (uint32_t j = i; j;) {
i 4650 core/AvmCore.cpp const char* probe = this->uris[i];
i 4678 core/AvmCore.cpp i = i - j;
i 4680 core/AvmCore.cpp i = i + j;
i 1399 core/AvmCore.h Stringp uintToString(uint32 i);
i 1400 core/AvmCore.h Stringp intToString(int i);
i 95 core/BitSet.h for (int i=0, n = capacity; i < n; i++)
i 96 core/BitSet.h bits[i] = 0;
i 136 core/BitSet.h for (int i=0; i < c; i++) {
i 137 core/BitSet.h uintptr_t b = bits[i];
i 138 core/BitSet.h uintptr_t b2 = otherbits[i];
i 140 core/BitSet.h bits[i] = b|b2;
i 153 core/BitSet.h for (int i=0, n=capacity; i < n; i++)
i 154 core/BitSet.h newBits[i] = bits[i];
i 155 core/BitSet.h for (int i=capacity; i < newCapacity; i++)
i 156 core/BitSet.h newBits[i] = 0;
i 159 core/BuiltinTraits.cpp for (uint32_t i=0, n=pool->classCount(); i < n; i++)
i 161 core/BuiltinTraits.cpp Traits* ctraits = pool->getClassTraits(i);
i 156 core/CdeclThunk.cpp intptr_t iwt = i << _tagBits;
i 157 core/CdeclThunk.cpp if ((iwt >> _tagBits) == i) {
i 160 core/CdeclThunk.cpp *dblPtr() = i;
i 114 core/CodegenLIR-inlines.h REALLY_INLINE LIns* LirHelper::i2p(LIns *i)
i 116 core/CodegenLIR-inlines.h return lirout->ins_i2p(i);
i 119 core/CodegenLIR-inlines.h REALLY_INLINE LIns* LirHelper::u2p(LIns *i)
i 121 core/CodegenLIR-inlines.h return lirout->ins_u2p(i);
i 124 core/CodegenLIR-inlines.h REALLY_INLINE LIns* LirHelper::p2i(LIns *i)
i 127 core/CodegenLIR-inlines.h return lirout->ins1(LIR_qlo, i);
i 129 core/CodegenLIR-inlines.h return i;
i 272 core/CodegenLIR.cpp static double i2f(int32_t i) { return i; }
i 383 core/CodegenLIR.cpp for (uint32_t i=0, argsizes = argt>>ARGSIZE_SHIFT; argsizes != 0; i++, argsizes >>= ARGSIZE_SHIFT) {
i 384 core/CodegenLIR.cpp args[i] = split(args[i]);
i 418 core/CodegenLIR.cpp for (uint32_t i=0; i < argc; i++)
i 419 core/CodegenLIR.cpp args[argc-i-1] = va_arg(ap, LIns*);
i 426 core/CodegenLIR.cpp Value &v = state->value(i);
i 429 core/CodegenLIR.cpp return v.ins = lirout->insLoad(LIR_ldq, vars, i*8);
i 433 core/CodegenLIR.cpp return v.ins = lirout->insLoad(LIR_ld, vars, i*8);
i 435 core/CodegenLIR.cpp return v.ins = lirout->insLoad(LIR_ldp, vars, i*8);
i 440 core/CodegenLIR.cpp Value& v = state->value(i);
i 442 core/CodegenLIR.cpp LIns *r = v.ins = lirout->insLoad(LIR_ld, vars, i*8);
i 448 core/CodegenLIR.cpp Value& v = state->value(i);
i 450 core/CodegenLIR.cpp LIns *r = v.ins = lirout->insLoad(LIR_ldq, vars, i*8);
i 457 core/CodegenLIR.cpp Value& v = state->value(i);
i 460 core/CodegenLIR.cpp LIns *r = v.ins = lirout->insLoad(LIR_ldp, vars, i*8);
i 467 core/CodegenLIR.cpp Value &v = state->value(i);
i 469 core/CodegenLIR.cpp lirout->insStorei(o, vars, i*8);
i 473 core/CodegenLIR.cpp if (core->debugger() && i < (state->verifier->local_count + state->verifier->max_scope)) {
i 474 core/CodegenLIR.cpp lirout->insStorei(InsConstPtr(type), varTraits, i*sizeof(Traits*));
i 481 core/CodegenLIR.cpp return atomToNativeRep(state->value(i).traits, atom);
i 491 core/CodegenLIR.cpp return !state->value(i).traits->isMachineType();
i 497 core/CodegenLIR.cpp return nativeToAtom(localCopy(i), state->value(i).traits);
i 544 core/CodegenLIR.cpp for (int i=0; i < count; i++)
i 545 core/CodegenLIR.cpp stp(loadAtomRep(index++), ap, i * sizeof(Atom));
i 557 core/CodegenLIR.cpp for (int i=1; i <= count; i++)
i 560 core/CodegenLIR.cpp stp(v, ap, sizeof(Atom)*i);
i 700 core/CodegenLIR.cpp return i->isCond() || i->isconst();
i 717 core/CodegenLIR.cpp return out->insParam(i, kind);
i 721 core/CodegenLIR.cpp return out->insImm(i);
i 725 core/CodegenLIR.cpp return out->insImmq(i);
i 884 core/CodegenLIR.cpp for (uint32_t i = 0; i < MAXARGS; i++) {
i 890 core/CodegenLIR.cpp ((sz == ARGSIZE_I || sz == ARGSIZE_U) == !args[i]->isQuad()));
i 924 core/CodegenLIR.cpp for (int i=0, n=nvar; i < n; i++) {
i 925 core/CodegenLIR.cpp LIns *v = tracker[i];
i 928 core/CodegenLIR.cpp if (dirty.get(i)) {
i 929 core/CodegenLIR.cpp if (v->isLoad() && v->oprnd1() == vars && v->disp() == int32_t(i*sizeof(double))) {
i 933 core/CodegenLIR.cpp out->insStorei(v, vars, i*sizeof(double));
i 934 core/CodegenLIR.cpp dirty.clear(i);
i 946 core/CodegenLIR.cpp int i = d >> 3;
i 947 core/CodegenLIR.cpp tracker[i] = value;
i 948 core/CodegenLIR.cpp dirty.set(i);
i 952 core/CodegenLIR.cpp (void) i; (void) cur; (void) target;
i 962 core/CodegenLIR.cpp int i = d >> 3;
i 963 core/CodegenLIR.cpp LIns *val = tracker[i];
i 966 core/CodegenLIR.cpp tracker[i] = val;
i 1007 core/CodegenLIR.cpp LIns *i = out->insCall(call, args);
i 1011 core/CodegenLIR.cpp return i;
i 1038 core/CodegenLIR.cpp for (int i=0; i < NumSavedRegs; i++) {
i 1039 core/CodegenLIR.cpp LIns *p = lirout->insParam(i, 1); (void) p;
i 1041 core/CodegenLIR.cpp lirbuf->names->addName(p, regNames[Assembler::savedRegs[i]]);)
i 1145 core/CodegenLIR.cpp int i = (traits) ? d / sizeof(Traits*) : d >> 3;
i 1146 core/CodegenLIR.cpp if (i>=nvar) return;
i 1148 core/CodegenLIR.cpp traitsTracker[i] = value;
i 1149 core/CodegenLIR.cpp value = !isValid(i) ? value : (LIns*)((intptr_t)value|1); // lower bit => validated
i 1150 core/CodegenLIR.cpp traitsTracker[i] = value;
i 1153 core/CodegenLIR.cpp tracker[i] = value;
i 1164 core/CodegenLIR.cpp LIns* val = tracker[i];
i 1165 core/CodegenLIR.cpp LIns* tra = traitsTracker[i];
i 1199 core/CodegenLIR.cpp for(int i=0; i<this->nvar; i++) {
i 1200 core/CodegenLIR.cpp LIns* val = tracker[i];
i 1201 core/CodegenLIR.cpp LIns* tra = traitsTracker[i];
i 1459 core/CodegenLIR.cpp for (int i=0, n = state->verifier->stackBase+state->stackDepth; i < n; i++)
i 1461 core/CodegenLIR.cpp Value& v = state->value(i);
i 1482 core/CodegenLIR.cpp for (int i=0, n=required_count; i <= n; i++) {
i 1483 core/CodegenLIR.cpp offset += ms->paramTraitsBT(i) == BUILTIN_number ? sizeof(double) : sizeof(Atom);
i 1488 core/CodegenLIR.cpp for (int i=0, n=optional_count; i < n; i++)
i 1491 core/CodegenLIR.cpp int param = i + required_count; // 0..N
i 1494 core/CodegenLIR.cpp LIns* defaultVal = InsConstAtom(ms->getDefaultValue(i));
i 1506 core/CodegenLIR.cpp VMPI_sprintf(str,"param_%d",i);
i 1522 core/CodegenLIR.cpp for (int i=0, n=required_count; i <= n; i++)
i 1523 core/CodegenLIR.cpp copyParam(i, offset);
i 1557 core/CodegenLIR.cpp for (int i=firstLocal, n=state->verifier->local_count; i < n; i++)
i 1559 core/CodegenLIR.cpp if(!(state->value(i).traits == NULL)){ // expecting *
i 1563 core/CodegenLIR.cpp localSet(i, undefConst, VOID_TYPE);
i 1570 core/CodegenLIR.cpp for (int i=state->verifier->scopeBase; i<state->verifier->scopeBase+state->verifier->max_scope; ++i)
i 1572 core/CodegenLIR.cpp localSet(i, undefConst, VOID_TYPE);
i 1607 core/CodegenLIR.cpp Traits* type = ms->paramTraits(i);
i 1610 core/CodegenLIR.cpp localSet(i, loadIns(LIR_ldqc, offset, apArg),type);
i 1617 core/CodegenLIR.cpp localSet(i, p2i(loadIns(LIR_ldcp, offset, apArg)),type);
i 1621 core/CodegenLIR.cpp localSet(i, loadIns(LIR_ldcp, offset, apArg),type);
i 1643 core/CodegenLIR.cpp LIns* t = localCopy(i);
i 1644 core/CodegenLIR.cpp localSet(i, localCopy(j), state->value(j).traits);
i 1645 core/CodegenLIR.cpp localSet(j, t, state->value(i).traits);
i 1651 core/CodegenLIR.cpp localSet(i, undefConst, VOID_TYPE);
i 1689 core/CodegenLIR.cpp for (int i=0, n=stackBase+state->stackDepth; i < n; i++)
i 1692 core/CodegenLIR.cpp if (i >= scopeTop && i < stackBase)
i 1694 core/CodegenLIR.cpp Value &v = state->value(i);
i 1696 core/CodegenLIR.cpp localSet(i, undefConst, VOID_TYPE);
i 2990 core/CodegenLIR.cpp for (int i=0; i <= argc; i++) {
i 2991 core/CodegenLIR.cpp if (state->value(index+i).traits == NUMBER_TYPE) {
i 3005 core/CodegenLIR.cpp for (int i=0; i <= argc; i++)
i 3350 core/CodegenLIR.cpp for (int i=0; i < count; i++) {
i 3351 core/CodegenLIR.cpp int target = state->pc + AvmCore::readS24(pc+3*i);
i 3352 core/CodegenLIR.cpp patchLater(jtbl, target, i);
i 3356 core/CodegenLIR.cpp for (int i=0; i < count; i++) {
i 3357 core/CodegenLIR.cpp int target = state->pc + AvmCore::readS24(pc+3*i);
i 3358 core/CodegenLIR.cpp branchIns(LIR_jt, binaryIns(LIR_eq, index, InsConst(i)), target);
i 4840 core/CodegenLIR.cpp for (int i=0; i < handler_count; i++)
i 4842 core/CodegenLIR.cpp ExceptionHandler* h = &info->abc_exceptions()->exceptions[i];
i 4844 core/CodegenLIR.cpp if (i+1 < handler_count) {
i 5100 core/CodegenLIR.cpp AvmAssert(state->value(i).notNull);
i 5101 core/CodegenLIR.cpp Traits* t = state->value(i).traits;
i 5107 core/CodegenLIR.cpp return loadIns(LIR_ldcp, offsetof(ScriptObject, vtable), localGetp(i));
i 5122 core/CodegenLIR.cpp LIns* obj = loadAtomRep(i);
i 5137 core/CodegenLIR.cpp return localGetq(i);
i 5141 core/CodegenLIR.cpp return i2dIns(localGet(i));
i 5144 core/CodegenLIR.cpp return u2dIns(localGet(i));
i 5280 core/CodegenLIR.cpp LIns *i = in->read();
i 5281 core/CodegenLIR.cpp switch (i->opcode()) {
i 5285 core/CodegenLIR.cpp AvmAssert(i->getTarget() != NULL && i->getTarget() == i->oprnd2() && i->oprnd2()->isop(LIR_label));
i 5288 core/CodegenLIR.cpp AvmAssert(i->getTableSize() > 0);
i 5289 core/CodegenLIR.cpp for (uint32_t j=0, n=i->getTableSize(); j < n; j++)
i 5290 core/CodegenLIR.cpp AvmAssert(i->getTarget(j) != NULL && i->getTarget(j)->isop(LIR_label));
i 5293 core/CodegenLIR.cpp return i;
i 5324 core/CodegenLIR.cpp for (LIns *i = in.read(); !i->isop(LIR_start); i = in.read()) {
i 5325 core/CodegenLIR.cpp LOpcode op = i->opcode();
i 5333 core/CodegenLIR.cpp if (i->oprnd2() == vars) {
i 5334 core/CodegenLIR.cpp int d = i->disp() >> 3;
i 5342 core/CodegenLIR.cpp if (i->oprnd1() == vars) {
i 5343 core/CodegenLIR.cpp int d = i->disp() >> 3;
i 5350 core/CodegenLIR.cpp nanojit::BitSet *lset = labels.get(i);
i 5353 core/CodegenLIR.cpp labels.put(i, lset);
i 5357 core/CodegenLIR.cpp if (p->head == i) {
i 5373 core/CodegenLIR.cpp analyze_edge(i->getTarget(), livein, labels, &looplabels);
i 5377 core/CodegenLIR.cpp for (uint32_t j=0, n=i->getTableSize(); j < n; j++)
i 5378 core/CodegenLIR.cpp analyze_edge(i->getTarget(j), livein, labels, &looplabels);
i 5383 core/CodegenLIR.cpp if (catcher && !i->isCse()) {
i 5426 core/CodegenLIR.cpp for (LIns *i = in.read(); !i->isop(LIR_start); i = in.read()) {
i 5427 core/CodegenLIR.cpp LOpcode op = i->opcode();
i 5435 core/CodegenLIR.cpp if (i->oprnd2() == vars) {
i 5436 core/CodegenLIR.cpp int d = i->disp() >> 3;
i 5439 core/CodegenLIR.cpp AvmLog("- %s\n", names->formatIns(i));)
i 5441 core/CodegenLIR.cpp LIns* prevIns = (LIns*) (uintptr_t(i) - lirSizes[op]);
i 5442 core/CodegenLIR.cpp i->initLInsSk(prevIns);
i 5453 core/CodegenLIR.cpp if (i->oprnd1() == vars) {
i 5454 core/CodegenLIR.cpp int d = i->disp() >> 3;
i 5461 core/CodegenLIR.cpp nanojit::BitSet *lset = labels.get(i);
i 5474 core/CodegenLIR.cpp analyze_edge(i->getTarget(), livein, labels, 0);
i 5478 core/CodegenLIR.cpp for (uint32_t j = 0, n = i->getTableSize(); j < n; j++)
i 5479 core/CodegenLIR.cpp analyze_edge(i->getTarget(j), livein, labels, 0);
i 5484 core/CodegenLIR.cpp if (catcher && !i->isCse()) {
i 5498 core/CodegenLIR.cpp AvmLog(" %s\n", names->formatIns(i));
i 5562 core/CodegenLIR.cpp for (LIns* i = validator.read(); !i->isop(LIR_start); i = validator.read())
i 5636 core/CodegenLIR.cpp for(int i=0; i<count; i++) {
i 5637 core/CodegenLIR.cpp JITCodeInfo* jitInfo = jitInfoList.get(i);
i 5681 core/CodegenLIR.cpp for(int32_t i=size-1; i>=0; i--) {
i 5682 core/CodegenLIR.cpp LineNumberRecord* rec = jitPendingRecords.get(i);
i 5685 core/CodegenLIR.cpp if (rec->lineno && rec->filename) jitPendingRecords.removeAt(i); // has both fields set?
i 5694 core/CodegenLIR.cpp for(int32_t i=size-1; i>=0; i--) {
i 5695 core/CodegenLIR.cpp LineNumberRecord* rec = jitPendingRecords.get(i);
i 5698 core/CodegenLIR.cpp if (rec->lineno && rec->filename) jitPendingRecords.removeAt(i); // has both fields set?
i 315 core/CodegenLIR.h LIns* atomToNative(BuiltinType, LIns* i);
i 316 core/CodegenLIR.h LIns* eq0(LIns* i); // eq(i, imm(0))
i 319 core/CodegenLIR.h LIns* i2p(LIns* i); // 32bit: nop, 64bit: i2q(i)
i 415 core/CodegenLIR.h LIns *atomToNativeRep(int loc, LIns *i);
i 416 core/CodegenLIR.h LIns *atomToNativeRep(Traits *, LIns *i);
i 418 core/CodegenLIR.h LIns *loadAtomRep(int i);
i 420 core/CodegenLIR.h LIns *localGet(int i);
i 421 core/CodegenLIR.h LIns *localGetp(int i);
i 422 core/CodegenLIR.h LIns *localGetq(int i);
i 423 core/CodegenLIR.h LIns *localCopy(int i); // sniff's type
i 436 core/CodegenLIR.h LIns *promoteNumberIns(Traits *t, int i);
i 437 core/CodegenLIR.h LIns *loadVTable(int i);
i 442 core/CodegenLIR.h debug_only( bool isPointer(int i); )
i 454 core/CodegenLIR.h void copyParam(int i, int &offset);
i 474 core/CodegenLIR.h void emitSwap(FrameState* state, int i, int j);
i 477 core/CodegenLIR.h void emitKill(FrameState* state, int i);
i 485 core/CodegenLIR.h void localSet(int i, LIns* o, Traits* type);
i 486 core/CodegenLIR.h LIns* convertToString(int i);
i 487 core/CodegenLIR.h LIns* coerceToString(int i);
i 488 core/CodegenLIR.h LIns* coerceToNumber(int i);
i 62 core/Coder-inlines.h REALLY_INLINE uint32_t LookupCacheBuilder::get_entry(int i)
i 64 core/Coder-inlines.h return caches[i];
i 237 core/Coder.cpp for ( int i=0 ; i < next_cache ; i++ )
i 238 core/Coder.cpp if (caches[i] == imm30)
i 239 core/Coder.cpp return i;
i 135 core/Coder.h uint32_t get_entry(int i);
i 172 core/Date.cpp int i;
i 174 core/Date.cpp for (i=0; i<11; i++) {
i 175 core/Date.cpp if (day < kMonthOffset[leap][i+1]) {
i 179 core/Date.cpp return i;
i 67 core/DateClass.cpp int i;
i 70 core/DateClass.cpp for (i=0; i<argc; i++) {
i 71 core/DateClass.cpp num[i] = AvmCore::number(argv[i+1]);
i 155 core/DateClass.cpp for (int i = 0; i < count; i++)
i 157 core/DateClass.cpp uint32_t ch = str_idx[offset + i];
i 161 core/DateClass.cpp subString[i] = (char) ch;
i 212 core/DateClass.cpp while (i < sLength && (c=s[i]) >= ((wchar)'0') && c <= ((wchar)'9'))
i 215 core/DateClass.cpp i++;
i 246 core/DateClass.cpp else if (c <= ((wchar)' ') || c == ((wchar)',') || c == ((wchar)'/') || i >= sLength)
i 275 core/DateClass.cpp else if (i < sLength && c != ((wchar)',') && c > ((wchar)' ') && c != ((wchar)'-'))
i 322 core/DateClass.cpp int i = 0;
i 323 core/DateClass.cpp while (i < sLength)
i 325 core/DateClass.cpp c = s[i];
i 326 core/DateClass.cpp i++;
i 330 core/DateClass.cpp if (i < sLength) {
i 331 core/DateClass.cpp wchar nextc = s[i];
i 348 core/DateClass.cpp if (parseDateNumber(s,sLength,i,c,prevc,timeZoneOffset,year,month,day,hour,
i 358 core/DateClass.cpp int st = i - 1;
i 359 core/DateClass.cpp while (i < sLength) {
i 360 core/DateClass.cpp c = s[i];
i 363 core/DateClass.cpp i++;
i 365 core/DateClass.cpp if (i <= st + 1)
i 369 core/DateClass.cpp if (parseDateKeyword(s, st, i-st, hour, month, timeZoneOffset) == false)
i 71 core/DateObject.cpp int i;
i 73 core/DateObject.cpp for (i=0; i<7; i++) {
i 74 core/DateObject.cpp num[i] = MathUtils::kNaN;
i 80 core/DateObject.cpp for (i=0; i<argc; i++) {
i 84 core/DateObject.cpp num[j++] = AvmCore::number(argv[i]);
i 138 core/E4XNode.cpp aa->insert (i, AvmCore::genericObjectToAtom(x));
i 146 core/E4XNode.cpp aa->removeAt (i);
i 151 core/E4XNode.cpp if ((i == 0) && (m_children & SINGLECHILDBIT))
i 159 core/E4XNode.cpp aa->setAt (i, AvmCore::genericObjectToAtom(x));
i 165 core/E4XNode.cpp if (i >= _length())
i 175 core/E4XNode.cpp E4XNode *x = (E4XNode *) AvmCore::atomToGenericObject(aa->getAt(i));
i 284 core/E4XNode.cpp for (uint32 i = 0; i < numNamespaces(); i++)
i 286 core/E4XNode.cpp Namespace *ns2 = AvmCore::atomToNamespace (getNamespaces()->getAt(i));
i 288 core/E4XNode.cpp index = i;
i 320 core/E4XNode.cpp for (unsigned int i = 0; i < numAttributes(); i++)
i 322 core/E4XNode.cpp E4XNode *curAttr = (E4XNode *) (AvmCore::atomToGenericObject(m_attributes->getAt(i)));
i 336 core/E4XNode.cpp for (uint32 i = 0; i < numNamespaces(); i++)
i 338 core/E4XNode.cpp Namespace *ns2 = AvmCore::atomToNamespace (getNamespaces()->getAt(i));
i 342 core/E4XNode.cpp return i;
i 348 core/E4XNode.cpp return i;
i 379 core/E4XNode.cpp for (uint32 i = 0; i < y->numNamespaces(); i++)
i 381 core/E4XNode.cpp Namespace *ns = AvmCore::atomToNamespace(y->getNamespaces()->getAt(i));
i 411 core/E4XNode.cpp for (uint32 i = 0; i < y->numNamespaces(); i++)
i 413 core/E4XNode.cpp Namespace *ns1 = AvmCore::atomToNamespace (y->getNamespaces()->getAt(i));
i 537 core/E4XNode.cpp for (unsigned int i = 0; i < numAttributes(); i++)
i 539 core/E4XNode.cpp E4XNode *curAttr = (E4XNode *) (AvmCore::atomToGenericObject(m_attributes->getAt(i)));
i 559 core/E4XNode.cpp if (i < numChildren())
i 561 core/E4XNode.cpp E4XNode *x = _getAt(i);
i 567 core/E4XNode.cpp removeChild (i);
i 614 core/E4XNode.cpp uint32 i;
i 615 core/E4XNode.cpp for (i = 0; i < numNamespaces(); i++)
i 617 core/E4XNode.cpp y->m_namespaces->push(getNamespaces()->getAt(i));
i 625 core/E4XNode.cpp uint32 i;
i 626 core/E4XNode.cpp for (i = 0; i < numAttributes(); i++)
i 628 core/E4XNode.cpp E4XNode *ax = getAttribute (i);
i 755 core/E4XNode.cpp for (uint32 i = 0; i < _length(); i++)
i 757 core/E4XNode.cpp E4XNode *x1 = _getAt(i);
i 758 core/E4XNode.cpp E4XNode *x2 = v->_getAt(i);
i 859 core/E4XNode.cpp if (i >= _length())
i 861 core/E4XNode.cpp i = _length();
i 870 core/E4XNode.cpp E4XNode *prior = _getAt(i);
i 889 core/E4XNode.cpp if (i < this->numChildren())
i 897 core/E4XNode.cpp this->setChildAt (i, xml);
i 901 core/E4XNode.cpp _deleteByIndex (i);
i 902 core/E4XNode.cpp _insert (core, toplevel, i, V);
i 914 core/E4XNode.cpp setChildAt (i, newXML);
i 966 core/E4XNode.cpp for (uint32 i = 0; i < _length(); i++)
i 968 core/E4XNode.cpp E4XNode *child = _getAt(i);
i 984 core/E4XNode.cpp for (uint32 i = 0; i < _length(); i++)
i 986 core/E4XNode.cpp E4XNode *child = _getAt(i);
i 1006 core/E4XNode.cpp for (uint32 i = 0; i < m_parent->_length(); i++)
i 1008 core/E4XNode.cpp E4XNode *x = m_parent->_getAt(i);
i 1011 core/E4XNode.cpp return i;
i 1044 core/E4XNode.cpp for(uint32_t i=0,n=numChildren();i < n; i++)
i 1046 core/E4XNode.cpp E4XNode *node = _getAt(i);
i 337 core/E4XNode.h void setChildAt (uint32 i, E4XNode *x);
i 339 core/E4XNode.h void insertChild (uint32 i, E4XNode *x);
i 340 core/E4XNode.h void removeChild (uint32 i);
i 351 core/E4XNode.h E4XNode *_getAt(uint32 i) const;
i 43 core/FrameState-inlines.h REALLY_INLINE Value& FrameState::value(int32_t i)
i 45 core/FrameState-inlines.h AvmAssert(i >= 0 && i < verifier->frameSize);
i 46 core/FrameState-inlines.h return locals[i];
i 49 core/FrameState-inlines.h REALLY_INLINE const Value& FrameState::value(int32_t i) const
i 51 core/FrameState-inlines.h AvmAssert(i >= 0 && i < verifier->frameSize);
i 52 core/FrameState-inlines.h return locals[i];
i 55 core/FrameState-inlines.h REALLY_INLINE Value& FrameState::scopeValue(int32_t i)
i 57 core/FrameState-inlines.h AvmAssert(i >= 0 && i < scopeDepth);
i 58 core/FrameState-inlines.h return value(verifier->scopeBase+i);
i 61 core/FrameState-inlines.h REALLY_INLINE const Value& FrameState::scopeValue(int32_t i) const
i 63 core/FrameState-inlines.h AvmAssert(i >= 0 && i < scopeDepth);
i 64 core/FrameState-inlines.h return value(verifier->scopeBase+i);
i 67 core/FrameState-inlines.h REALLY_INLINE Value& FrameState::stackValue(int32_t i)
i 69 core/FrameState-inlines.h AvmAssert(i >= 0 && i < stackDepth);
i 70 core/FrameState-inlines.h return value(verifier->stackBase+i);
i 83 core/FrameState-inlines.h REALLY_INLINE void FrameState::setType(int32_t i, Traits* t, bool notNull, bool isWith)
i 85 core/FrameState-inlines.h Value& v = value(i);
i 92 core/FrameState.h Value& value(int32_t i);
i 93 core/FrameState.h const Value& value(int32_t i) const;
i 94 core/FrameState.h Value& scopeValue(int32_t i);
i 95 core/FrameState.h const Value& scopeValue(int32_t i) const;
i 96 core/FrameState.h Value& stackValue(int32_t i);
i 99 core/FrameState.h void setType(int32_t i, Traits* t, bool notNull=false, bool isWith=false);
i 81 core/Interpreter.cpp AvmAssert(atomIsValidIntptrValue(i));
i 82 core/Interpreter.cpp return (intptr_t(i) << 3) | kIntptrType;
i 796 core/Interpreter.cpp for (int i=0, n = _argc < param_count ? _argc : param_count; i <= n; i++)
i 797 core/Interpreter.cpp framep[i] = _atomv[i];
i 810 core/Interpreter.cpp for (int i=_argc+1, o=_argc + ms->optional_count() - param_count, n=param_count; i <= n; i++, o++)
i 811 core/Interpreter.cpp framep[i] = ms->getDefaultValue(o);
i 836 core/Interpreter.cpp for (int i = 0; i < ms->max_scope(); ++i)
i 837 core/Interpreter.cpp scopeBase[i] = nullObjectAtom;
i 3248 core/Interpreter.cpp for (int i = 0, n = ms->max_scope(); i < n; ++i)
i 3249 core/Interpreter.cpp scopeBase[i] = nullObjectAtom;
i 3281 core/Interpreter.cpp ScriptObject* i = AvmCore::atomToScriptObject(index);
i 3282 core/Interpreter.cpp if (i->traits() == core->traits.qName_itraits)
i 3284 core/Interpreter.cpp QNameObject* qname = (QNameObject*) i;
i 3343 core/Interpreter.cpp for ( int i=0 ; i <= WOP_LAST ; i++ ) {
i 3344 core/Interpreter.cpp if (jumptable[i] == address) {
i 3345 core/Interpreter.cpp opcode = (WordOpcode)i;
i 3379 core/Interpreter.cpp for (ptrdiff_t i=stackBase; i <= sp; i++) {
i 3380 core/Interpreter.cpp core->console << " " << core->format(framep[i]);
i 3386 core/Interpreter.cpp for (ptrdiff_t i=scopeBase; i <= scopep; i++) {
i 3387 core/Interpreter.cpp core->console << core->format(framep[i]) << " ";
i 3393 core/Interpreter.cpp for (ptrdiff_t i=0; i < scopeBase; i++) {
i 3394 core/Interpreter.cpp core->console << core->format(framep[i]) << " ";
i 148 core/MathClass.cpp for (uint32_t i=0; i < argc; i++)
i 150 core/MathClass.cpp y = AvmCore::number(argv[i]);
i 193 core/MathClass.cpp for (uint32_t i=0; i < argc; i++)
i 195 core/MathClass.cpp y = AvmCore::number(argv[i]);
i 244 core/MathUtils.cpp int32_t i = 2;
i 245 core/MathUtils.cpp while (i < n)
i 247 core/MathUtils.cpp i <<= 1;
i 250 core/MathUtils.cpp return (i);
i 924 core/MathUtils.cpp int32_t i, len = 0;
i 1089 core/MathUtils.cpp for (i=exp10; i<-1; i++) {
i 1095 core/MathUtils.cpp i=0;
i 1099 core/MathUtils.cpp if (mode != DTOSTR_NORMAL && ++i >= precision)
i 1104 core/MathUtils.cpp while(i++ < precision)
i 1118 core/MathUtils.cpp for (i=0; i<precision-1; i++) {
i 1137 core/MathUtils.cpp i = d2a->nextDigit();
i 1138 core/MathUtils.cpp if (i > 4) {
i 317 core/MethodEnv.cpp const Atom i = method->implGPR()(this, argc, ap);
i 321 core/MethodEnv.cpp return core->intToAtom((int32_t)i);
i 323 core/MethodEnv.cpp return core->uintToAtom((uint32_t)i);
i 325 core/MethodEnv.cpp return i ? trueAtom : falseAtom;
i 329 core/MethodEnv.cpp return (Atom)i;
i 331 core/MethodEnv.cpp return ((Stringp)i)->atom();
i 333 core/MethodEnv.cpp return ((Namespace*)i)->atom();
i 335 core/MethodEnv.cpp return ((ScriptObject*)i)->atom();
i 377 core/MethodEnv.cpp for (int32_t i=0 ; i < argc ; i++ )
i 378 core/MethodEnv.cpp atomv[i+1] = a->getUintProperty(i);
i 453 core/MethodEnv.cpp for (int32_t i=1 ; i <= end ; i++ )
i 454 core/MethodEnv.cpp atomv[i] = coerceAtom(core, atomv[i], ms->paramTraits(i), toplevel);
i 472 core/MethodEnv.cpp for (int32_t i=1 ; i <= end ; i++ )
i 473 core/MethodEnv.cpp AvmAssert(ms->paramTraits(i) == NULL);
i 508 core/MethodEnv.cpp for (int32_t i=1; i <= end; i++)
i 509 core/MethodEnv.cpp args = coerceUnbox1(in[i], ms->paramTraits(i), args);
i 523 core/MethodEnv.cpp for (int32_t i=0; i < end; i++)
i 524 core/MethodEnv.cpp args = coerceUnbox1(a->getUintProperty(i), ms->paramTraits(i+1), args);
i 536 core/MethodEnv.cpp for (int32_t i=0; i < end; i++)
i 537 core/MethodEnv.cpp args = coerceUnbox1(in[i], ms->paramTraits(i+1), args);
i 691 core/MethodEnv.cpp int32_t i = AvmCore::integer_i(index);
i 692 core/MethodEnv.cpp if ((double)i == AvmCore::atomToDouble(index))
i 694 core/MethodEnv.cpp return getpropertylate_i(obj, i);
i 700 core/MethodEnv.cpp ScriptObject* i = AvmCore::atomToScriptObject(index);
i 701 core/MethodEnv.cpp if (i->traits() == core()->traits.qName_itraits)
i 703 core/MethodEnv.cpp QNameObject* qname = (QNameObject*) i;
i 733 core/MethodEnv.cpp int32_t i = AvmCore::integer(index);
i 734 core/MethodEnv.cpp uint32_t u = uint32_t(i);
i 740 core/MethodEnv.cpp else if ((double)i == AvmCore::atomToDouble(index))
i 742 core/MethodEnv.cpp setpropertylate_i(obj, i, value);
i 749 core/MethodEnv.cpp ScriptObject* i = AvmCore::atomToScriptObject(index);
i 750 core/MethodEnv.cpp if (i->traits() == core()->traits.qName_itraits)
i 752 core/MethodEnv.cpp QNameObject* qname = (QNameObject*) i;
i 780 core/MethodEnv.cpp int32_t i = AvmCore::integer(index);
i 781 core/MethodEnv.cpp uint32_t u = uint32_t(i);
i 787 core/MethodEnv.cpp else if ((double)i == AvmCore::atomToDouble(index))
i 789 core/MethodEnv.cpp setpropertylate_i(obj, i, value);
i 796 core/MethodEnv.cpp ScriptObject* i = AvmCore::atomToScriptObject(index);
i 797 core/MethodEnv.cpp if (i->traits() == core()->traits.qName_itraits)
i 799 core/MethodEnv.cpp QNameObject* qname = (QNameObject*) i;
i 831 core/MethodEnv.cpp ScriptObject* i = AvmCore::atomToScriptObject(index);
i 832 core/MethodEnv.cpp if (i->traits() == core->traits.qName_itraits)
i 834 core/MethodEnv.cpp QNameObject* qname = (QNameObject*) i;
i 867 core/MethodEnv.cpp ScriptObject* i = AvmCore::atomToScriptObject(index);
i 868 core/MethodEnv.cpp if (i->traits() == core->traits.qName_itraits)
i 870 core/MethodEnv.cpp QNameObject* qname = (QNameObject*) i;
i 1207 core/MethodEnv.cpp for (int i=outer->getSize(), n=fscope->getSize(); i < n; i++)
i 1209 core/MethodEnv.cpp fscope->setScope(gc, i, *scopes++);
i 1281 core/MethodEnv.cpp int i = outer->getSize();
i 1282 core/MethodEnv.cpp for (int n=cscope->getSize(); i < n; i++)
i 1284 core/MethodEnv.cpp cscope->setScope(gc, i, *scopes++);
i 1368 core/MethodEnv.cpp AvmAssert(i == iscope->getSize()-1);
i 1369 core/MethodEnv.cpp iscope->setScope(gc, i, cc->atom());
i 1720 core/MethodEnv.cpp for (int i=outer_depth-1; i > 0; i--)
i 1722 core/MethodEnv.cpp if (outerTraits->getScopeIsWithAt(i))
i 1724 core/MethodEnv.cpp Atom result = findWithProperty(outer->getScope(i), multiname);
i 1732 core/MethodEnv.cpp Atom a = outer->getScope(i);
i 1733 core/MethodEnv.cpp Traits* t = outerTraits->getScopeTraitsAt(i);
i 416 core/MethodInfo-inlines.h REALLY_INLINE Traits* MethodSignature::paramTraits(int32_t i) const
i 418 core/MethodInfo-inlines.h AvmAssert(i >= 0 && i <= _param_count);
i 419 core/MethodInfo-inlines.h return _args[i].paramType;
i 422 core/MethodInfo-inlines.h REALLY_INLINE BuiltinType MethodSignature::paramTraitsBT(int32_t i) const
i 424 core/MethodInfo-inlines.h AvmAssert(i >= 0 && i <= _param_count);
i 425 core/MethodInfo-inlines.h return Traits::getBuiltinType(_args[i].paramType);
i 428 core/MethodInfo-inlines.h REALLY_INLINE Atom MethodSignature::getDefaultValue(int32_t i) const
i 430 core/MethodInfo-inlines.h AvmAssert(i >= 0 && i < _optional_count);
i 431 core/MethodInfo-inlines.h return _args[i+_param_count+1].defaultValue;
i 183 core/MethodInfo.cpp for (int32_t i = 1; i <= param_count; i++) {
i 184 core/MethodInfo.cpp if (ms->paramTraits(i) != NULL) {
i 607 core/MethodInfo.cpp for (int32_t i=0; i<local_count; i++)
i 609 core/MethodInfo.cpp WBRC(gc, dmi, &dmi->localNames[i], undef);
i 759 core/MethodInfo.cpp for(int32_t i = srcPos, n = srcPos+length; i < n; i++)
i 761 core/MethodInfo.cpp AvmAssert(i >= 0 && i < getMethodSignature()->local_count());
i 762 core/MethodInfo.cpp dest[destPos++] = boxOneLocal(src, i, traitArr);
i 831 core/MethodInfo.cpp for (int32_t i = destPos, n = destPos+length; i < n; i++)
i 833 core/MethodInfo.cpp AvmAssert(i >= 0 && i < getMethodSignature()->local_count());
i 834 core/MethodInfo.cpp unboxOneLocal(src[srcPos++], dest, i, traitArr);
i 918 core/MethodInfo.cpp for (int32_t i=0; i <= argc; i++)
i 920 core/MethodInfo.cpp const BuiltinType bt = (i <= param_count) ? this->paramTraitsBT(i) : BUILTIN_any;
i 921 core/MethodInfo.cpp out[i] = nativeArgToAtom(core, (void*)ap, bt);
i 955 core/MethodInfo.cpp for (uint32_t i=1; i <= param_count; i++)
i 958 core/MethodInfo.cpp WB(gc, ms, &ms->_args[i].paramType, argType);
i 1190 core/MethodInfo.cpp for (int32_t i = 0; i < 4; ++i)
i 1192 core/MethodInfo.cpp if (tname->equalsLatin1(kNameMap[i].n))
i 1194 core/MethodInfo.cpp tname = core->newConstantStringLatin1(kNameMap[i].o);
i 467 core/MethodInfo.h Traits* paramTraits(int32_t i) const;
i 468 core/MethodInfo.h BuiltinType paramTraitsBT(int32_t i) const;
i 469 core/MethodInfo.h Atom getDefaultValue(int32_t i) const;
i 350 core/Multiname-inlines.h REALLY_INLINE Namespacep HeapMultiname::getNamespace(int32_t i) const
i 352 core/Multiname-inlines.h return name.getNamespace(i);
i 48 core/Multiname.cpp AvmAssert(i >= 0 && i < namespaceCount());
i 49 core/Multiname.cpp return nsset ? nsset->nsAt(i) : NULL;
i 53 core/Multiname.cpp AvmAssert(i == 0);
i 110 core/Multiname.cpp for (int i = 0; i < this->namespaceCount(); i++)
i 115 core/Multiname.cpp Stringp u1 = getNamespace(i)->getURI();
i 116 core/Multiname.cpp uint8 type1 = (uint8)(getNamespace(i)->getType());
i 185 core/Multiname.cpp for (int i=0,n=namespaceCount(); i < n; i++)
i 187 core/Multiname.cpp if (getNamespace(i)->isPublic())
i 190 core/Multiname.cpp s = core->concatStrings(s, getNamespace(i)->getURI());
i 191 core/Multiname.cpp if (i+1 < n)
i 89 core/Multiname.h Namespacep getNamespace(int32_t i) const;
i 176 core/Multiname.h Namespacep getNamespace(int32_t i) const;
i 146 core/MultinameHashtable.cpp unsigned i = ((0x7FFFFFF8 & (uintptr)name) >> 3) & bitmask;
i 149 core/MultinameHashtable.cpp while (((k=t[i].name) != name || !(t[i].ns == ns || matchNS(t[i].ns->m_uri, t[i].apis, ns))) && k != NULL)
i 151 core/MultinameHashtable.cpp i = (i + (n++)) & bitmask; // quadratic probe
i 153 core/MultinameHashtable.cpp return i;
i 185 core/MultinameHashtable.cpp unsigned i = ((0x7FFFFFF8 & (uintptr)mnameName)>>3) & bitMask;
i 189 core/MultinameHashtable.cpp while ((atomName = t[i].name) != EMPTY)
i 193 core/MultinameHashtable.cpp Namespacep probeNS = t[i].ns;
i 195 core/MultinameHashtable.cpp API probeAPIs = t[i].apis;
i 203 core/MultinameHashtable.cpp match = &t[i];
i 210 core/MultinameHashtable.cpp i = (i + (n++)) & bitMask; // quadratic probe
i 216 core/MultinameHashtable.cpp if (t[i].multiNS)
i 218 core/MultinameHashtable.cpp int k = (i + (n++)) & bitMask; // quadratic probe
i 266 core/MultinameHashtable.cpp unsigned i = ((0x7FFFFFF8 & (uintptr)name) >> 3) & bitmask;
i 267 core/MultinameHashtable.cpp cur = quadbase + i;
i 292 core/MultinameHashtable.cpp i = (i + (n++)) & bitmask; // quadratic probe
i 293 core/MultinameHashtable.cpp cur = quadbase + i;
i 317 core/MultinameHashtable.cpp int i = find(name, ns, t, numQuads);
i 318 core/MultinameHashtable.cpp if (t[i].name == name)
i 320 core/MultinameHashtable.cpp const Quad& tf = t[i];
i 330 core/MultinameHashtable.cpp for (int i=0, n=numQuads; i < n; i++)
i 332 core/MultinameHashtable.cpp if (t[i].name == name)
i 334 core/MultinameHashtable.cpp const Quad& tf = t[i];
i 344 core/MultinameHashtable.cpp for (int i=0, n=oldTriplet; i < n; i++)
i 347 core/MultinameHashtable.cpp if ((oldName=oldAtoms[i].name) != EMPTY)
i 350 core/MultinameHashtable.cpp int j = find(oldName, oldAtoms[i].ns, newAtoms, newTriplet);
i 353 core/MultinameHashtable.cpp newAtoms[j].ns = oldAtoms[i].ns;
i 354 core/MultinameHashtable.cpp newAtoms[j].value = oldAtoms[i].value;
i 355 core/MultinameHashtable.cpp newAtoms[j].multiNS = oldAtoms[i].multiNS;
i 356 core/MultinameHashtable.cpp newAtoms[j].apis = oldAtoms[i].apis;
i 45 core/NamespaceSet-inlines.h nsset(n), i(0)
i 51 core/NamespaceSet-inlines.h return i < nsset->count();
i 56 core/NamespaceSet-inlines.h AvmAssert(i < nsset->count());
i 57 core/NamespaceSet-inlines.h return nsset->nsAt(i++);
i 72 core/NamespaceSet-inlines.h for (uint32_t i=0,n=count(); i < n; i++)
i 73 core/NamespaceSet-inlines.h if (_namespaces[i] == ns)
i 83 core/NamespaceSet-inlines.h REALLY_INLINE Namespacep NamespaceSet::nsAt(uint32_t i) const
i 85 core/NamespaceSet-inlines.h AvmAssert(i < count());
i 86 core/NamespaceSet-inlines.h AvmAssert(_namespaces[i] != NULL);
i 87 core/NamespaceSet-inlines.h return _namespaces[i];
i 90 core/NamespaceSet-inlines.h REALLY_INLINE void NamespaceSet::_initNsAt(uint32_t i, Namespacep ns)
i 92 core/NamespaceSet-inlines.h AvmAssert(i < count());
i 93 core/NamespaceSet-inlines.h AvmAssert(_namespaces[i] == NULL);
i 95 core/NamespaceSet-inlines.h WBRC(MMgc::GC::GetGC(this), this, &_namespaces[i], ns);
i 48 core/NamespaceSet.h uint32_t i;
i 75 core/NamespaceSet.h void _initNsAt(uint32_t i, Namespacep ns);
i 82 core/NamespaceSet.h Namespacep nsAt(uint32_t i) const;
i 130 core/NativeFunction.cpp bool NativeInitializer::getCompiledInfo(NativeMethodInfo *info, Multiname &returnTypeName, uint32_t i) const
i 134 core/NativeFunction.cpp if (i < compiledMethodCount && compiledMethods[i])
i 142 core/NativeFunction.cpp info->handler.function = compiledMethods[i];
i 244 core/NativeFunction.h const NativeMethodInfo* getNativeInfo(uint32_t i) const { return get_method(i); }
i 247 core/NativeFunction.h bool getCompiledInfo(NativeMethodInfo *info, Multiname &returnTypeName, uint32_t i) const;
i 256 core/NativeFunction.h inline const NativeClassInfo* get_class(uint32_t i) const
i 258 core/NativeFunction.h return i < classCount ? classes[i] : 0;
i 261 core/NativeFunction.h inline const NativeClassInfo* get_class(uint32_t i) const { AvmAssert(i < classCount); return classes[i]; }
i 266 core/NativeFunction.h inline const NativeClassInfo* get_class(uint32_t i) const { AvmAssert(i < classCount); return &classes[i]; }
i 273 core/NativeFunction.h inline const NativeMethodInfo* get_method(uint32_t i) const { AvmAssert(i < methodCount); return methods[i]; }
i 277 core/NativeFunction.h inline const NativeMethodInfo* get_method(uint32_t i) const { AvmAssert(i < methodCount); return &methods[i]; }
i 102 core/PoolObject-inlines.h REALLY_INLINE Traits* PoolObject::getClassTraits(uint32_t i) const
i 104 core/PoolObject-inlines.h return _classes[i];
i 112 core/PoolObject-inlines.h REALLY_INLINE Traits* PoolObject::getScriptTraits(uint32_t i) const
i 114 core/PoolObject-inlines.h return _scripts[i];
i 122 core/PoolObject-inlines.h REALLY_INLINE MethodInfo* PoolObject::getMethodInfo(uint32_t i) const
i 124 core/PoolObject-inlines.h return _methods[i];
i 128 core/PoolObject-inlines.h REALLY_INLINE DebuggerMethodInfo* PoolObject::getDebuggerMethodInfo(uint32_t i) const
i 130 core/PoolObject-inlines.h return (i < _method_dmi.size()) ? _method_dmi[i] : NULL;
i 106 core/PoolObject.cpp for (uint32_t i = 1; i < constantStringCount; i++)
i 164 core/PoolObject.cpp for (int32_t i=0, n=mname.namespaceCount(); i < n; i++)
i 166 core/PoolObject.cpp Traits* t = getTraits(mname.getName(), mname.getNamespace(i), recursive);
i 291 core/PoolObject.cpp const int32_t i = cpool_int[index];
i 293 core/PoolObject.cpp value = core->intToAtom(i);
i 309 core/PoolObject.cpp value = core->intToAtom(i);
i 697 core/PoolObject.cpp for (uint32_t i=1; i < nNames; i++) {
i 699 core/PoolObject.cpp pool->parseMultiname(mn, i);
i 701 core/PoolObject.cpp multinames[i] = mn;
i 706 core/PoolObject.cpp for (uint32_t i=1; i < nNames; i++)
i 707 core/PoolObject.cpp multinames[i].DecrementRef();
i 715 core/PoolObject.cpp if (core->config.methodNames && (uint32_t(i) < uint32_t(this->_method_name_indices.size())))
i 717 core/PoolObject.cpp const int32_t index = this->_method_name_indices[i];
i 180 core/PoolObject.h Traits* getClassTraits(uint32_t i) const;
i 183 core/PoolObject.h Traits* getScriptTraits(uint32_t i) const;
i 186 core/PoolObject.h MethodInfo* getMethodInfo(uint32_t i) const;
i 188 core/PoolObject.h DebuggerMethodInfo* getDebuggerMethodInfo(uint32_t i) const;
i 191 core/PoolObject.h Stringp getMethodInfoName(uint32_t i);
i 94 core/PrintWriter.cpp for (int32_t i = 0; i < s->length(); i++)
i 96 core/PrintWriter.cpp wchar ch = str[i];
i 98 core/PrintWriter.cpp if (ch == '.' && i < s->length() - 1) {
i 99 core/PrintWriter.cpp *this << str[++i];
i 191 core/PrintWriter.cpp for (int i=0, n=str_idx->length(); i<n; i++)
i 193 core/PrintWriter.cpp *this << (wchar)str_idx[i];
i 378 core/RegExpObject.cpp for (int i=0; i<results; i++) {
i 379 core/RegExpObject.cpp if (ovector[i*2] > -1) {
i 380 core/RegExpObject.cpp int length = ovector[i*2 + 1] - ovector[i*2];
i 381 core/RegExpObject.cpp Atom match = stringFromUTF8(utf8Subject.c_str()+ovector[i*2], length);
i 382 core/RegExpObject.cpp a->setUintProperty(i, match);
i 384 core/RegExpObject.cpp a->setUintProperty(i, undefinedAtom);
i 404 core/RegExpObject.cpp for (int i = 0; i < nameCount; i++)
i 534 core/RegExpObject.cpp int i;
i 540 core/RegExpObject.cpp i = ptr[1]-'0';
i 542 core/RegExpObject.cpp i = j;
i 545 core/RegExpObject.cpp i = ptr[1]-'0';
i 547 core/RegExpObject.cpp if (i >= 1 && i <= captureCount) {
i 548 core/RegExpObject.cpp resultBuffer.write(src+ovector[i*2],
i 549 core/RegExpObject.cpp ovector[i*2+1]-ovector[i*2]);
i 550 core/RegExpObject.cpp ptr += (i >= 10) ? 3 : 2;
i 631 core/RegExpObject.cpp for (int i=1; i<=captureCount; i++)
i 633 core/RegExpObject.cpp argv[i+1] = stringFromUTF8(src+ovector[i*2], ovector[i*2+1]-ovector[i*2]);
i 614 core/Sampler.cpp for(uint32 i=0; i < num ; i++)
i 638 core/Sampler.cpp for(uint32_t i=0; i < s.stack.depth; i++, e++)
i 58 core/ScopeChain-inlines.h REALLY_INLINE Traits* ScopeTypeChain::getScopeTraitsAt(uint32_t i) const
i 60 core/ScopeChain-inlines.h return (Traits*)(_scopes[i] & ~ISWITH);
i 63 core/ScopeChain-inlines.h REALLY_INLINE bool ScopeTypeChain::getScopeIsWithAt(uint32_t i) const
i 65 core/ScopeChain-inlines.h return (_scopes[i] & ISWITH) != 0;
i 68 core/ScopeChain-inlines.h REALLY_INLINE void ScopeTypeChain::setScopeAt(uint32_t i, Traits* t, bool w)
i 70 core/ScopeChain-inlines.h _scopes[i] = uintptr_t(t) | (w ? ISWITH : 0);
i 97 core/ScopeChain-inlines.h REALLY_INLINE Atom ScopeChain::getScope(int32_t i) const
i 99 core/ScopeChain-inlines.h AvmAssert(i >= 0 && i < _scopeTraits->size);
i 100 core/ScopeChain-inlines.h return _scopes[i];
i 53 core/ScopeChain.cpp for (int32_t i = 0; i < outerSize; i++)
i 55 core/ScopeChain.cpp nscope->_scopes[j++] = outer->_scopes[i];
i 57 core/ScopeChain.cpp for (int32_t i = 0; i < nValues; i++)
i 59 core/ScopeChain.cpp const Value& v = values[i];
i 89 core/ScopeChain.cpp for (int32_t i = 0; i < nStateTraits; i++)
i 91 core/ScopeChain.cpp values[i].traits = stateTraits[i];
i 92 core/ScopeChain.cpp values[i].isWith = i >= firstWith;
i 105 core/ScopeChain.cpp for (int32_t i=0; i < this->fullsize; i ++)
i 107 core/ScopeChain.cpp nscope->_scopes[i] = this->_scopes[i];
i 119 core/ScopeChain.cpp for (int32_t i = 0; i < fullsize; i++)
i 121 core/ScopeChain.cpp if (i > 0)
i 123 core/ScopeChain.cpp Traits* t = getScopeTraitsAt(i);
i 124 core/ScopeChain.cpp bool b = getScopeIsWithAt(i);
i 140 core/ScopeChain.cpp for (int32_t i=0; i < outerSize; i ++)
i 142 core/ScopeChain.cpp nscope->setScope(gc, i, outer->_scopes[i]);
i 157 core/ScopeChain.cpp for (int32_t i=0; i < nstc->size; i ++)
i 159 core/ScopeChain.cpp nscope->setScope(gc, i, this->_scopes[i]);
i 166 core/ScopeChain.cpp AvmAssert(i >= 0 && i < _scopeTraits->size);
i 168 core/ScopeChain.cpp WBATOM(gc, this, &_scopes[i], value);
i 180 core/ScopeChain.cpp for (int32_t i = 0; i < _scopeTraits->size; i++)
i 182 core/ScopeChain.cpp if (i > 0)
i 184 core/ScopeChain.cpp r = r->append(core->format(_scopes[i]));
i 63 core/ScopeChain.h Traits* getScopeTraitsAt(uint32_t i) const;
i 64 core/ScopeChain.h bool getScopeIsWithAt(uint32_t i) const;
i 71 core/ScopeChain.h void setScopeAt(uint32_t i, Traits* t, bool w);
i 113 core/ScopeChain.h Atom getScope(int32_t i) const;
i 114 core/ScopeChain.h void setScope(MMgc::GC* gc, int32_t i, Atom value);
i 156 core/ScriptObject.cpp int i = table->find(name, atoms, table->getCapacity());
i 157 core/ScriptObject.cpp if (atoms[i] != InlineHashtable::EMPTY)
i 158 core/ScriptObject.cpp return atoms[i+1];
i 181 core/ScriptObject.cpp int i = o->getTable()->find(searchname, atoms, o->getTable()->getCapacity());
i 182 core/ScriptObject.cpp if (atoms[i] != InlineHashtable::EMPTY)
i 183 core/ScriptObject.cpp return atoms[i+1];
i 347 core/ScriptObject.cpp if (!(i&MAX_INTEGER_MASK))
i 351 core/ScriptObject.cpp Atom name = core->internUint32(i)->atom();
i 357 core/ScriptObject.cpp Atom name = core->uintToAtom (i);
i 363 core/ScriptObject.cpp int i = table->find(name, atoms, table->getCapacity());
i 364 core/ScriptObject.cpp if (atoms[i] != InlineHashtable::EMPTY)
i 365 core/ScriptObject.cpp return atoms[i+1];
i 373 core/ScriptObject.cpp return getAtomProperty(core->internUint32(i)->atom());
i 380 core/ScriptObject.cpp if (!(i&MAX_INTEGER_MASK))
i 382 core/ScriptObject.cpp Atom name = core->uintToAtom (i);
i 400 core/ScriptObject.cpp setAtomProperty(core->internUint32(i)->atom(), value);
i 407 core/ScriptObject.cpp if (!(i&MAX_INTEGER_MASK))
i 409 core/ScriptObject.cpp Atom name = core->uintToAtom (i);
i 422 core/ScriptObject.cpp return deleteAtomProperty(core->internUint32(i)->atom());
i 429 core/ScriptObject.cpp if (!(i&MAX_INTEGER_MASK))
i 431 core/ScriptObject.cpp Atom name = core->uintToAtom (i);
i 444 core/ScriptObject.cpp return hasAtomProperty(core->internUint32(i)->atom());
i 139 core/ScriptObject.h virtual Atom getUintProperty(uint32 i) const;
i 140 core/ScriptObject.h virtual void setUintProperty(uint32 i, Atom value);
i 141 core/ScriptObject.h virtual bool delUintProperty(uint32 i);
i 142 core/ScriptObject.h virtual bool hasUintProperty(uint32 i) const;
i 111 core/SortedMap.h int i = find(k);
i 112 core/SortedMap.h if (i >= 0)
i 114 core/SortedMap.h T old = values[i];
i 115 core/SortedMap.h keys.set(i, k);
i 116 core/SortedMap.h values.set(i, v);
i 121 core/SortedMap.h i = -i - 1; // recover the insertion point
i 122 core/SortedMap.h AvmAssert(keys.size() != (uint32_t)i);
i 123 core/SortedMap.h keys.insert(i, k);
i 124 core/SortedMap.h values.insert(i, v);
i 131 core/SortedMap.h int i = find(k);
i 132 core/SortedMap.h return i >= 0 ? values[i] : 0;
i 136 core/SortedMap.h int i = find(k);
i 137 core/SortedMap.h if (i >= 0)
i 139 core/SortedMap.h v = values[i];
i 146 core/SortedMap.h int i = find(k);
i 147 core/SortedMap.h return (i >= 0) ? true : false;
i 151 core/SortedMap.h int i = find(k);
i 152 core/SortedMap.h return removeAt(i);
i 154 core/SortedMap.h T removeAt(int i)
i 156 core/SortedMap.h T old = values.removeAt(i);
i 157 core/SortedMap.h keys.removeAt(i);
i 170 core/SortedMap.h T at(int i) const { return values[i]; }
i 171 core/SortedMap.h K keyAt(int i) const { return keys[i]; }
i 174 core/SortedMap.h int i = find(k);
i 175 core/SortedMap.h return i >= 0 ? i : -i-2;
i 188 core/SortedMap.h int i = (lo + hi)/2;
i 189 core/SortedMap.h K m = keys[i];
i 191 core/SortedMap.h lo = i + 1;
i 193 core/SortedMap.h hi = i - 1;
i 195 core/SortedMap.h return i; // key found
i 224 core/SortedMap.h inline T removeAt(int i) { return map.removeAt(i); }
i 231 core/SortedMap.h inline T at(int i) const { return map.at(i); }
i 232 core/SortedMap.h inline K keyAt(int i) const { return map.keyAt(i); }
i 157 core/StackTrace.cpp for (int i = (ms->max_scope() + ms->local_count() - 1), n = ms->local_count(); i >= n; --i)
i 159 core/StackTrace.cpp Atom const scope = m_info->boxOneLocal(m_framep, i, m_traits);
i 175 core/StackTrace.cpp for (int i = scopeChainLength - 1; i >= 0; --i)
i 177 core/StackTrace.cpp Atom scope = scopeChain->getScope(i);
i 203 core/StackTrace.cpp int i;
i 207 core/StackTrace.cpp for (i=0; i<length; ++i) {
i 208 core/StackTrace.cpp ch = filename[i];
i 217 core/StackTrace.cpp for (i=0; i<length; ++i) {
i 218 core/StackTrace.cpp ch = filename[i];
i 257 core/StackTrace.cpp for (int i=0; i<displayDepth; i++, e++)
i 264 core/StackTrace.cpp if(i != 0)
i 174 core/StackTrace.h inline void set_linenum(int32_t i) { m_linenum = i; }
i 140 core/StringClass.cpp for (int i=0; i<argc; i++)
i 142 core/StringClass.cpp wchar c = wchar(AvmCore::integer(argv[i]));
i 276 core/StringClass.cpp for (int i = 0; i < ilen && (unsigned)i < limit; i++)
i 278 core/StringClass.cpp Stringp sub = in->substr(i, 1);
i 133 core/StringObject.cpp for (int32_t i = 0; i < m_length; ++i)
i 135 core/StringObject.cpp if (ptrs.p8[i] > 127)
i 1339 core/StringObject.cpp for (int32_t i = 0; i < m_length; i++)
i 1347 core/StringObject.cpp if (wch < '0' || wch > '9' || (i == 1 && n == 0))
i 1385 core/StringObject.cpp for (int32_t i = 0; i < m_length; i++)
i 1393 core/StringObject.cpp if (wch < '0' || wch > '9' || (i == 1 && n == 0))
i 2027 core/StringObject.cpp int32_t i;
i 2031 core/StringObject.cpp for (i = 0; i < m_length; i++)
i 2045 core/StringObject.cpp for (i = 0; i < m_length; i++)
i 2067 core/StringObject.cpp for (int32_t i = 0 ; i < length(); i++)
i 2069 core/StringObject.cpp wchar ch = self[i];
i 2633 core/StringObject.cpp for (int32_t i = str->m_length; i--;)
i 2657 core/StringObject.cpp for (int32_t i = str->m_length; i--;)
i 2758 core/StringObject.cpp for (int32_t i = m_lastPos; i < pos; i++)
i 2785 core/StringObject.cpp int32_t i = m_lastUtf8Pos;
i 2789 core/StringObject.cpp while (i < utf8Pos)
i 2791 core/StringObject.cpp if (i >= length())
i 2795 core/StringObject.cpp i++, p++; // ASCII
i 2799 core/StringObject.cpp i += len;
i 414 core/StringObject.h int _indexOf(Stringp s, int i=0);
i 415 core/StringObject.h int AS3_indexOf(Stringp s, double i=0);
i 417 core/StringObject.h int _lastIndexOf(Stringp s, int i=0x7fffffff);
i 418 core/StringObject.h int AS3_lastIndexOf(Stringp s, double i=0x7fffffff);
i 420 core/StringObject.h Stringp _charAt(int i=0);
i 421 core/StringObject.h Stringp AS3_charAt(double i=0);
i 423 core/StringObject.h double _charCodeAt(int i); // returns NaN for out-of-bounds
i 424 core/StringObject.h double AS3_charCodeAt(double i); // returns NaN for out-of-bounds
i 364 core/Toplevel.cpp for (int i=0, n=m->namespaceCount(); i < n; i++)
i 366 core/Toplevel.cpp Namespace *ns = m->getNamespace(i);
i 382 core/Toplevel.cpp for (int i=0, n=m->namespaceCount(); i < n; i++)
i 384 core/Toplevel.cpp nsset->_initNsAt(i, m->getNamespace(i));
i 893 core/Toplevel.cpp for (int i=0, n=in->length(); i<n; i++) {
i 894 core/Toplevel.cpp wchar ch = str_idx[i];
i 918 core/Toplevel.cpp for (int i=0, n=inputUTF8.length(); i<n; i++) {
i 919 core/Toplevel.cpp uint8_t ch = src[i];
i 1051 core/Toplevel.cpp for (int i=0; i<OctetsLen; i++) {
i 1053 core/Toplevel.cpp out.writeHexByte(Octets[i]);
i 71 core/Traits-inlines.h REALLY_INLINE Traitsp TraitsBindings::getSlotTraits(uint32_t i) const
i 73 core/Traits-inlines.h AvmAssert(i < slotCount);
i 74 core/Traits-inlines.h return getSlots()[i].type;
i 77 core/Traits-inlines.h REALLY_INLINE uint32_t TraitsBindings::getSlotOffset(uint32_t i) const
i 79 core/Traits-inlines.h AvmAssert(i < slotCount);
i 80 core/Traits-inlines.h return getSlots()[i].offset();
i 83 core/Traits-inlines.h REALLY_INLINE SlotStorageType TraitsBindings::calcSlotAddrAndSST(uint32_t i, void* pin, void*& pout) const
i 85 core/Traits-inlines.h AvmAssert(i < slotCount);
i 86 core/Traits-inlines.h uint32_t offsetAndSST = getSlots()[i].offsetAndSST;
i 91 core/Traits-inlines.h REALLY_INLINE MethodInfo* TraitsBindings::getMethod(uint32_t i) const
i 93 core/Traits-inlines.h AvmAssert(i < methodCount);
i 94 core/Traits-inlines.h return getMethods()[i].f;
i 137 core/Traits-inlines.h REALLY_INLINE void TraitsBindings::setSlotInfo(uint32_t i, Traits* t, SlotStorageType sst, uint32_t offset)
i 139 core/Traits-inlines.h AvmAssert(i < slotCount);
i 141 core/Traits-inlines.h getSlots()[i].type = t;
i 145 core/Traits-inlines.h getSlots()[i].offsetAndSST = (offset<<1) | uint32_t(sst);
i 148 core/Traits-inlines.h REALLY_INLINE void TraitsBindings::setMethodInfo(uint32_t i, MethodInfo* f)
i 150 core/Traits-inlines.h AvmAssert(i < methodCount);
i 152 core/Traits-inlines.h getMethods()[i].f = f;
i 423 core/Traits.cpp AvmAssert(i < slotCount);
i 425 core/Traits.cpp for (TraitsMetadatap self = this; self && (i < self->slotCount); self = self->base)
i 427 core/Traits.cpp MetadataPtr pos = self->slotMetadataPos[i];
i 439 core/Traits.cpp AvmAssert(i < methodCount);
i 441 core/Traits.cpp for (TraitsMetadatap self = this; self && (i < self->methodCount); self = self->base)
i 443 core/Traits.cpp MetadataPtr pos = self->methodMetadataPos[i];
i 743 core/Traits.cpp for (uint32_t i = 0; i < nameCount; i++)
i 1037 core/Traits.cpp for (uint32_t i = 0; i < nameCount; i++)
i 1090 core/Traits.cpp for (uint32_t i = 0; i < tb->slotCount; i++)
i 1092 core/Traits.cpp if (tb->getSlotOffset(i) > 0)
i 1098 core/Traits.cpp core->console << "WARNING: slot " << i+1 << " on " << this << " not defined by compiler. Using *\n";
i 1106 core/Traits.cpp tb->setSlotInfo(i, slotType, SST_atom, slotOffset);
i 1301 core/Traits.cpp for (uint32_t i = 0; i < nameCount; i++)
i 1381 core/Traits.cpp uint32_t i = 0;
i 1382 core/Traits.cpp for (uint32_t n = pending.size(); i < n; i++) {
i 1383 core/Traits.cpp if (pending[i]->subtypeof(t)) {
i 1384 core/Traits.cpp pending.insert(i, t);
i 1407 core/Traits.cpp for (int32_t i = 0; i < MAX_PRIMARY_SUPERTYPE; i++) {
i 1408 core/Traits.cpp Traits* t = m_primary_supertypes[i];
i 1424 core/Traits.cpp for (uint32_t i = 0, n = pending.size(); i < n; i++) {
i 1425 core/Traits.cpp AvmAssert(!pending[i]->linked);
i 1426 core/Traits.cpp pending[i]->resolveSignaturesSelf(toplevel);
i 1588 core/Traits.cpp for (uint32_t i = 0; i < nameCount; i++)
i 1992 core/Traits.cpp for (int i=0; i < MAX_PRIMARY_SUPERTYPE; i++)
i 1993 core/Traits.cpp WB(core->gc, this, &m_primary_supertypes[i], base->m_primary_supertypes[i]);
i 2041 core/Traits.cpp for (uint32_t i=0; i < count; i++)
i 2042 core/Traits.cpp WB(gc, list, list+i+1, base_list[i]);
i 2065 core/Traits.cpp for (uint32_t i=0; i < count; i++) {
i 2066 core/Traits.cpp WB(gc, list, list+baseCount+i, seen[i]);
i 2073 core/Traits.cpp for (int i = 0; i < MAX_PRIMARY_SUPERTYPE; i++) {
i 2074 core/Traits.cpp Traits* t = m_primary_supertypes[i];
i 143 core/Traits.h Traitsp getSlotTraits(uint32_t i) const;
i 144 core/Traits.h uint32_t getSlotOffset(uint32_t i) const;
i 146 core/Traits.h SlotStorageType calcSlotAddrAndSST(uint32_t i, void* pin, void*& pout) const;
i 147 core/Traits.h MethodInfo* getMethod(uint32_t i) const;
i 167 core/Traits.h void setSlotInfo(uint32_t i, Traits* t, SlotStorageType sst, uint32_t offset);
i 169 core/Traits.h void setMethodInfo(uint32_t i, MethodInfo* f);
i 216 core/Traits.h MetadataPtr getSlotMetadataPos(uint32_t i, PoolObject*& residingPool) const;
i 217 core/Traits.h MetadataPtr getMethodMetadataPos(uint32_t i, PoolObject*& residingPool) const;
i 86 core/TypeDescriber.cpp Stringp TypeDescriber::str(StringId i)
i 119 core/TypeDescriber.cpp if (!m_strs[i])
i 120 core/TypeDescriber.cpp m_strs[i] = m_toplevel->core()->internConstantStringLatin1(k_strs[i]);
i 121 core/TypeDescriber.cpp return m_strs[i];
i 155 core/TypeDescriber.cpp for (int i = 1, n = ms->param_count(); i <= n; ++i)
i 159 core/TypeDescriber.cpp { kstrid_type, strAtom(describeClassName(ms->paramTraits(i))) },
i 160 core/TypeDescriber.cpp { kstrid_optional, boolAtom(i > requiredParamCount) },
i 492 core/TypeDescriber.cpp for (uint32_t i = 0; i < val_count; ++i)
i 496 core/TypeDescriber.cpp { kstrid_key, strAtom(poolstr(pool, key_indexes.get(i))) },
i 497 core/TypeDescriber.cpp { kstrid_value, strAtom(poolstr(pool, val_indexes.get(i))) },
i 527 core/TypeDescriber.cpp intptr_t const i = atomGetIntptr(value);
i 528 core/TypeDescriber.cpp int32_t const i32 = (int32_t(i)<<3)>>3;
i 529 core/TypeDescriber.cpp return i == intptr_t(i32);
i 123 core/TypeDescriber.h Stringp str(StringId i);
i 366 core/UnicodeUtils.cpp for (int i=1; i<n; i++) {
i 367 core/UnicodeUtils.cpp if ((chars[i]&0xC0) != 0x80) {
i 370 core/UnicodeUtils.cpp b = (b<<6) | (chars[i]&0x3F);
i 84 core/VTable.cpp for (ImtThunkEntry* i = beg + interval; i < end; i++)
i 86 core/VTable.cpp ImtThunkEntry temp = *i;
i 87 core/VTable.cpp ImtThunkEntry* j = i;
i 325 core/VTable.cpp for(uint32 i = 0; i < size; ++i)
i 327 core/VTable.cpp cur = work_stack[size-i-1];
i 378 core/VTable.cpp for (uint32_t i = 0, n = td->methodCount; i < n; i++)
i 380 core/VTable.cpp MethodInfo* method = td->getMethod(i);
i 382 core/VTable.cpp if (btd && i < btd->methodCount && method == btd->getMethod(i))
i 386 core/VTable.cpp WB(gc, this, &methods[i], base->methods[i]);
i 393 core/VTable.cpp WB(gc, this, &methods[i], makeMethodEnv(method, scope));
i 400 core/VTable.cpp traits->core->console << "WARNING: empty disp_id " << i << " on " << traits << "\n";
i 414 core/VTable.cpp for (uint32_t i=0; i < IMT_SIZE; i++)
i 418 core/VTable.cpp WB(gc, this, &imt[i], ite);
i 461 core/VTable.cpp for (uint32_t i=0; i < n; i++)
i 463 core/VTable.cpp MethodInfo* method = td->getMethod(i);
i 465 core/VTable.cpp if (i < baseMethodCount && td->base && method == td->base->getMethod(i))
i 92 core/VectorClass.cpp int i = MathUtils::real2int(index_d);
i 93 core/VectorClass.cpp if ((double)i == index_d)
i 96 core/VectorClass.cpp index = i;
i 226 core/VectorClass.cpp for (uint32 i = 0; i < len; i++)
i 232 core/VectorClass.cpp d->getUintProperty(i), // element
i 233 core/VectorClass.cpp core->uintToAtom(i), // index
i 237 core/VectorClass.cpp r->setUintProperty (i, result);
i 254 core/VectorClass.cpp for (uint32 i = 0, k = 0; i < len; i++)
i 258 core/VectorClass.cpp Atom element = d->getUintProperty(i);
i 262 core/VectorClass.cpp core->uintToAtom(i), // index
i 278 core/VectorClass.cpp for (int i=0; i < argc; i++) {
i 279 core/VectorClass.cpp setUintProperty(m_length, argv[i]);
i 722 core/VectorClass.cpp for (uint32 i=0; i<insertCount; i++)
i 724 core/VectorClass.cpp _setUintProperty(insertPoint+i, a[i+offset]);
i 729 core/VectorClass.cpp for (uint32 i=0; i<insertCount; i++)
i 732 core/VectorClass.cpp _setUintProperty(insertPoint+i, so_args->getUintProperty(i+offset));
i 769 core/VectorClass.cpp for(int i=0; i<argc; i++) {
i 770 core/VectorClass.cpp _setUintProperty(i, argv[i]);
i 225 core/VectorClass.h for(int i=0; i<argc; i++) {
i 226 core/VectorClass.h atomToValue(argv[i], m_array[i]);
i 239 core/VectorClass.h for(uint32 i = 0, j = m_length-1; i < j; ++i, --j)
i 241 core/VectorClass.h temp = m_array[i];
i 242 core/VectorClass.h m_array[i] = m_array[j];
i 285 core/VectorClass.h for (uint32 i=0; i<insertCount; i++)
i 288 core/VectorClass.h atomToValue(so_args->getUintProperty(i+offset), m_array[insertPoint+i]);
i 319 core/VectorClass.h for( uint32 i = 0; i < len; ++i )
i 321 core/VectorClass.h this->setUintProperty(i, so_args->getUintProperty(i));
i 145 core/Verifier.cpp for(int i = 0, n=blockStates->size(); i < n; i++)
i 146 core/Verifier.cpp mmfx_delete( blockStates->at(i) );
i 244 core/Verifier.cpp for (int i=0; i <= param_count; i++)
i 246 core/Verifier.cpp bool notNull = (i==0); // this is not null, but other params could be
i 247 core/Verifier.cpp state->setType(i, ms->paramTraits(i), notNull);
i 354 core/Verifier.cpp for (int i=0, n=info->abc_exceptions()->exception_count; i < n; i++)
i 356 core/Verifier.cpp ExceptionHandler* handler = &info->abc_exceptions()->exceptions[i];
i 512 core/Verifier.cpp for (uint32_t i=0; i < case_count; i++)
i 2263 core/Verifier.cpp Value& value = state->value(i);
i 2266 core/Verifier.cpp coder->writeCheckNull(state, i);
i 2281 core/Verifier.cpp inline void Verifier::emitCheckNull(int i) { (void) i; }
i 2530 core/Verifier.cpp for (int i=0, n=local_count; i < n; i++)
i 2531 core/Verifier.cpp targetState->value(i).notNull = false;
i 2534 core/Verifier.cpp for (int i=stackBase, n=i+state->stackDepth; i < n; i++)
i 2535 core/Verifier.cpp targetState->value(i).notNull = false;
i 2575 core/Verifier.cpp for (int i=0, n=stackTop; i < n; i++)
i 2577 core/Verifier.cpp if (i >= scopeTop && i < stackBase)
i 2583 core/Verifier.cpp Value& curValue = state->value(i);
i 2584 core/Verifier.cpp Value& targetValue = targetState->value(i);
i 2618 core/Verifier.cpp targetState->setType(i, t3, notNull, isWith);
i 2730 core/Verifier.cpp for (int i=state->stackDepth-argc, n=state->stackDepth; i < n; i++)
i 2732 core/Verifier.cpp Traits* t = state->stackValue(i).traits;
i 2756 core/Verifier.cpp for (int i=state->stackDepth-argc, k = 1, n=state->stackDepth; i < n; i++, k++)
i 2758 core/Verifier.cpp Traits* t = state->stackValue(i).traits;
i 2789 core/Verifier.cpp for (int i=0; i < exception_count; i++, handler++)
i 2810 core/Verifier.cpp core->console << " exception["<<i<<"] from="<< handler->from
i 2859 core/Verifier.cpp for (int i=stackBase, n=state->sp(); i <= n; i++) {
i 2861 core/Verifier.cpp printValue(state->value(i));
i 2871 core/Verifier.cpp for (int i=0, n=declaringScope->size; i < n; i++)
i 2874 core/Verifier.cpp v.traits = declaringScope->getScopeTraitsAt(i);
i 2875 core/Verifier.cpp v.isWith = declaringScope->getScopeIsWithAt(i);
i 2882 core/Verifier.cpp if (i+1 < n)
i 2887 core/Verifier.cpp for (int i=scopeBase, n=stackBase; i < n; i++)
i 2889 core/Verifier.cpp if (i-scopeBase < state->scopeDepth)
i 2890 core/Verifier.cpp printValue(state->value(i));
i 2899 core/Verifier.cpp for (int i=0, n=scopeBase; i < n; i++) {
i 2900 core/Verifier.cpp printValue(state->value(i));
i 2970 core/Verifier.cpp for (int i=0, n=blocks.size(); i < n; i++)
i 2971 core/Verifier.cpp mmfx_delete( blocks.at(i) );
i 2972 core/Verifier.cpp for (int i=0, n=edges.size(); i < n; i++)
i 2973 core/Verifier.cpp mmfx_delete( edges.at(i) );
i 2988 core/Verifier.cpp for (int i = 0; i < blocks.size(); i++) {
i 2989 core/Verifier.cpp b = blocks.at(i);
i 3004 core/Verifier.cpp for (int i = 0; i < edges.size(); i++) {
i 3005 core/Verifier.cpp e = edges.at(i);
i 3006 core/Verifier.cpp core->console << "E" << i << ": " << "B" << e->src << " --> " << "B" << e->snk << "\n";
i 165 core/Verifier.h void emitCoerce(Traits* target, int i);
i 224 core/WordcodeEmitter.cpp for ( int i=0 ; i < exception_count ; i++ ) {
i 226 core/WordcodeEmitter.cpp new_table->exceptions[i].traits = old_table->exceptions[i].traits;
i 227 core/WordcodeEmitter.cpp new_table->exceptions[i].scopeTraits = old_table->exceptions[i].scopeTraits;
i 232 core/WordcodeEmitter.cpp p[0]->pc = code_start + old_table->exceptions[i].from;
i 233 core/WordcodeEmitter.cpp p[0]->fixup_loc = &(new_table->exceptions[i].from);
i 236 core/WordcodeEmitter.cpp p[1]->pc = code_start + old_table->exceptions[i].to;
i 237 core/WordcodeEmitter.cpp p[1]->fixup_loc = &(new_table->exceptions[i].to);
i 240 core/WordcodeEmitter.cpp p[2]->pc = code_start + old_table->exceptions[i].target;
i 241 core/WordcodeEmitter.cpp p[2]->fixup_loc = &(new_table->exceptions[i].target);
i 991 core/WordcodeEmitter.cpp for ( uint32_t i=0 ; i <= case_count ; i++ ) {
i 1268 core/WordcodeEmitter.cpp uint32_t i=0;
i 1269 core/WordcodeEmitter.cpp while (i < k) {
i 1270 core/WordcodeEmitter.cpp uintptr_t op = S[i];
i 1274 core/WordcodeEmitter.cpp *dest++ = R[i++];
i 1275 core/WordcodeEmitter.cpp int32_t offset = int32_t(R[i++]);
i 1288 core/WordcodeEmitter.cpp *dest++ = R[i++];
i 1290 core/WordcodeEmitter.cpp *dest++ = R[i++];
i 1298 core/WordcodeEmitter.cpp *dest++ = R[i++];
i 1301 core/WordcodeEmitter.cpp *dest++ = R[i++];
i 1302 core/WordcodeEmitter.cpp *dest++ = R[i++];
i 1305 core/WordcodeEmitter.cpp *dest++ = R[i++];
i 1306 core/WordcodeEmitter.cpp *dest++ = R[i++];
i 1307 core/WordcodeEmitter.cpp *dest++ = R[i++];
i 1310 core/WordcodeEmitter.cpp *dest++ = R[i++];
i 1311 core/WordcodeEmitter.cpp *dest++ = R[i++];
i 1312 core/WordcodeEmitter.cpp *dest++ = R[i++];
i 1313 core/WordcodeEmitter.cpp *dest++ = R[i++];
i 1314 core/WordcodeEmitter.cpp *dest++ = R[i++];
i 1318 core/WordcodeEmitter.cpp if (i-width >= new_words)
i 1401 core/WordcodeEmitter.cpp uint32_t i = 0;
i 1402 core/WordcodeEmitter.cpp while (i < limit && t->opcode != opcode)
i 1403 core/WordcodeEmitter.cpp i++, t++;
i 1405 core/WordcodeEmitter.cpp next_state = (i == limit) ? 0 : t->next_state;
i 1495 core/WordcodeEmitter.cpp for ( uintptr_t i=0, limit=nextI-shift ; i < limit ; i++ ) {
i 1496 core/WordcodeEmitter.cpp I[i] = I[i+shift];
i 1497 core/WordcodeEmitter.cpp O[i] = O[i+shift];
i 216 core/XMLClass.cpp for (uint32 i = 0; i < node->_length(); i++)
i 218 core/XMLClass.cpp E4XNode *n = node->_getAt (i);
i 101 core/XMLListClass.cpp for (uint32 i = 0; i < x->getNode()->_length(); i++)
i 103 core/XMLListClass.cpp E4XNode *c = x->getNode()->_getAt (i);
i 106 core/XMLListObject.cpp for (uint32 i = 0; i < _length(); i++)
i 108 core/XMLListObject.cpp E4XNode* node = _getNodeAt(i);
i 112 core/XMLListObject.cpp XMLObject* xml = _getAt(i);
i 138 core/XMLListObject.cpp uint32 i;
i 139 core/XMLListObject.cpp if (!m->isAnyName() && !m->isAttr() && AvmCore::getIndexFromString (m->getName(), &i))
i 141 core/XMLListObject.cpp setUintProperty (i, V);
i 194 core/XMLListObject.cpp for (uint32 i = 0; i < numChildren(); i++)
i 196 core/XMLListObject.cpp if (_getNodeAt(i)->getClass() == E4XNode::kElement)
i 198 core/XMLListObject.cpp XMLObject *xm = _getAt(i);
i 211 core/XMLListObject.cpp for (uint32 i = 0; i < numChildren(); i++)
i 213 core/XMLListObject.cpp if (_getNodeAt(i)->getClass() == E4XNode::kElement)
i 215 core/XMLListObject.cpp XMLObject *xm = _getAt(i);
i 280 core/XMLListObject.cpp if (i >= _length())
i 328 core/XMLListObject.cpp i = _length();
i 339 core/XMLListObject.cpp if (i > 0)
i 344 core/XMLListObject.cpp while ((j < (parent->_length() - 1)) && parent->_getAt (j) != _getNodeAt(i - 1))
i 403 core/XMLListObject.cpp E4XNode *xi = _getNodeAt(i);
i 406 core/XMLListObject.cpp XMLObject* xio = _getAt(i);
i 414 core/XMLListObject.cpp m_children.setAt (i, attrx->m_children.getAt(0));
i 428 core/XMLListObject.cpp E4XNode *parent = _getNodeAt(i)->getParent();
i 435 core/XMLListObject.cpp if (parent->_getAt(q) == _getNodeAt(i))
i 453 core/XMLListObject.cpp XMLObject* prior = (notify) ? _getAt(i) : 0;
i 456 core/XMLListObject.cpp m_children.removeAt (i);
i 459 core/XMLListObject.cpp m_children.insert (i + i2, c->m_children.getAt(i2));
i 490 core/XMLListObject.cpp E4XNode *parent = _getNodeAt(i)->getParent();
i 497 core/XMLListObject.cpp if (parent->_getAt(q) == _getNodeAt(i))
i 525 core/XMLListObject.cpp m_children.setAt (i, V);
i 527 core/XMLListObject.cpp m_children.setAt (i, xmlClass()->ToXML (V));
i 532 core/XMLListObject.cpp _getAt(i)->setStringProperty(core->kAsterisk, V);
i 603 core/XMLListObject.cpp for (uint32 i = 0; i < numChildren(); i++)
i 605 core/XMLListObject.cpp if (_getNodeAt(i)->getClass() == E4XNode::kElement)
i 607 core/XMLListObject.cpp XMLObject *xm = _getAt(i);
i 711 core/XMLListObject.cpp for (uint32 i = 0; i < numChildren(); i++)
i 713 core/XMLListObject.cpp l->m_children.push (_getAt(i)->_deepCopy()->atom());
i 742 core/XMLListObject.cpp for (uint32 i = 0; i < _length(); i++)
i 744 core/XMLListObject.cpp Atom a1 = m_children.getAt(i);
i 745 core/XMLListObject.cpp Atom a2 = v->m_children.getAt(i);
i 746 core/XMLListObject.cpp if ((a1 != a2) && core->equals (_getAt(i)->atom(), v->_getAt(i)->atom()) == falseAtom)
i 838 core/XMLListObject.cpp if (i >= _length())
i 841 core/XMLListObject.cpp Atom a = m_children.getAt(i);
i 846 core/XMLListObject.cpp m_children.setAt(i, obj->atom());
i 853 core/XMLListObject.cpp if (i >= _length())
i 856 core/XMLListObject.cpp Atom a = m_children.getAt(i);
i 913 core/XMLListObject.cpp for (uint32 i = 0; i < _length(); i++)
i 916 core/XMLListObject.cpp XMLObject *xm = _getAt(i);
i 921 core/XMLListObject.cpp if (/*xmlClass()->getPrettyPrinting() && */i)
i 957 core/XMLListObject.cpp for (uint32 i = 0; i < _length(); i++)
i 959 core/XMLListObject.cpp XMLObject *x = _getAt(i);
i 981 core/XMLListObject.cpp for (uint32 i = 0; i < _length(); i++)
i 983 core/XMLListObject.cpp if (_getNodeAt(i)->getClass() == E4XNode::kElement)
i 985 core/XMLListObject.cpp XMLObject *x = _getAt(i);
i 1000 core/XMLListObject.cpp for (uint32 i = 0; i < _length(); i++)
i 1003 core/XMLListObject.cpp if (core->equals(_getAt(i)->atom(), value) == trueAtom)
i 1026 core/XMLListObject.cpp for (uint32 i = 0; i < _length(); i++)
i 1028 core/XMLListObject.cpp if (_getNodeAt(i)->getClass() == E4XNode::kElement)
i 1030 core/XMLListObject.cpp XMLObject *x = _getAt(i);
i 1065 core/XMLListObject.cpp for (uint32 i = 0; i < _length(); i++)
i 1067 core/XMLListObject.cpp if (_getNodeAt(i)->getClass() == E4XNode::kElement)
i 1089 core/XMLListObject.cpp for (uint32 i = 0; i < _length(); i++)
i 1091 core/XMLListObject.cpp if (_getNodeAt(i)->getClass() == E4XNode::kElement)
i 1110 core/XMLListObject.cpp uint32 i = 0;
i 1111 core/XMLListObject.cpp while (i < _length())
i 1113 core/XMLListObject.cpp E4XNode* xn = _getNodeAt(i);
i 1116 core/XMLListObject.cpp XMLObject *x = _getAt(i);
i 1118 core/XMLListObject.cpp i++;
i 1122 core/XMLListObject.cpp while (((i + 1) < _length()) && ((_getNodeAt(i + 1)->getClass() & (E4XNode::kText | E4XNode::kCDATA))))
i 1124 core/XMLListObject.cpp xn->setValue (core->concatStrings(xn->getValue(), _getNodeAt(i + 1)->getValue()));
i 1125 core/XMLListObject.cpp deleteAtomProperty(core->intToAtom(i + 1));
i 1129 core/XMLListObject.cpp deleteAtomProperty(core->intToAtom(i));
i 1133 core/XMLListObject.cpp i++;
i 1138 core/XMLListObject.cpp i++;
i 1151 core/XMLListObject.cpp for (uint32 i = 1; i < _length(); i++)
i 1153 core/XMLListObject.cpp E4XNode *p = _getNodeAt(i)->getParent();
i 1169 core/XMLListObject.cpp for (uint32 i = 0; i < _length(); i++)
i 1171 core/XMLListObject.cpp if (_getNodeAt(i)->getClass() == E4XNode::kElement)
i 1173 core/XMLListObject.cpp XMLObject *x = _getAt(i);
i 1200 core/XMLListObject.cpp for (uint32 i = 0; i < _length(); i++)
i 1202 core/XMLListObject.cpp if (_getNodeAt(i)->getClass() == E4XNode::kElement)
i 1204 core/XMLListObject.cpp XMLObject *x = _getAt(i);
i 1228 core/XMLListObject.cpp for (uint32 i = 0; i < _length(); i++)
i 1230 core/XMLListObject.cpp E4XNode* xn = _getNodeAt(i);
i 1233 core/XMLListObject.cpp XMLObject *xm = _getAt(i);
i 1530 core/XMLListObject.cpp for (uint32 i = 0; i < _length(); i++)
i 1532 core/XMLListObject.cpp XMLObject *xm = _getAt(i);
i 132 core/XMLListObject.h bool hasUintProperty(uint32 i) const;
i 136 core/XMLListObject.h Atom getUintProperty(uint32 i) const;
i 137 core/XMLListObject.h void setUintProperty(uint32 i, Atom value);
i 138 core/XMLListObject.h bool delUintProperty(uint32 i);
i 153 core/XMLListObject.h XMLObject* _getAt(uint32 i) const;
i 154 core/XMLListObject.h E4XNode* _getNodeAt(uint32 i) const;
i 489 core/XMLObject.cpp for (uint32 i = 0; i < m_node->numAttributes(); i++)
i 491 core/XMLObject.cpp E4XNode *xml = m_node->getAttribute(i);
i 521 core/XMLObject.cpp for (uint32 i = 0; i < m_node->numChildren(); i++)
i 523 core/XMLObject.cpp E4XNode *child = m_node->_getAt(i);
i 624 core/XMLObject.cpp for (uint32 i = 1; i < xl->_length(); i++)
i 626 core/XMLObject.cpp output << " " << core->string (xl->_getAt (i)->atom());
i 699 core/XMLObject.cpp int32 i = -1; // -1 is undefined in spec
i 719 core/XMLObject.cpp if (i != -1)
i 721 core/XMLObject.cpp E4XNode* was = m_node->_getAt(i);
i 723 core/XMLObject.cpp m_node->_deleteByIndex (i);
i 733 core/XMLObject.cpp i = k;
i 738 core/XMLObject.cpp if (i == -1)
i 740 core/XMLObject.cpp i = _length();
i 757 core/XMLObject.cpp m_node->_replace (core, toplevel, i, y->atom());
i 765 core/XMLObject.cpp E4XNode *xi = m_node->_getAt(i);
i 796 core/XMLObject.cpp xi->_replace (core, toplevel, i, c, prior);
i 801 core/XMLObject.cpp E4XNode* prior = m_node->_replace (core, toplevel, i, c);
i 807 core/XMLObject.cpp if (m_node->_length() > (uint32)i)
i 809 core/XMLObject.cpp XMLObject* xml = new (core->GetGC()) XMLObject(xmlClass(), m_node->_getAt(i));
i 920 core/XMLObject.cpp for (uint32 i = 0; i < m_node->numAttributes(); i++)
i 922 core/XMLObject.cpp E4XNode *ax = m_node->getAttribute(i);
i 1032 core/XMLObject.cpp for (uint32 i = 0; i < m_node->numAttributes(); i++)
i 1034 core/XMLObject.cpp E4XNode *ax = m_node->getAttribute(i);
i 1108 core/XMLObject.cpp uint32 i;
i 1109 core/XMLObject.cpp for (i = 0; i < namespaces->getLength(); i++)
i 1111 core/XMLObject.cpp Namespace *ns = AvmCore::atomToNamespace (namespaces->getAt(i));
i 1116 core/XMLObject.cpp if (i == namespaces->getLength())
i 1139 core/XMLObject.cpp for (uint32 i = 0; i < namespaces->getLength(); i++)
i 1141 core/XMLObject.cpp Namespace *ns = AvmCore::atomToNamespace (namespaces->getAt(i));
i 1169 core/XMLObject.cpp for (int i = 0; i < indentLevel; i++)
i 1233 core/XMLObject.cpp for (uint32 i = 0; i < inScopeNS->getLength(); i++)
i 1235 core/XMLObject.cpp Namespace *ns = AvmCore::atomToNamespace (inScopeNS->getAt(i));
i 1273 core/XMLObject.cpp for (uint32 i = 0; i < m_node->numAttributes(); i++)
i 1275 core/XMLObject.cpp E4XNode *an = m_node->getAttribute(i);
i 1308 core/XMLObject.cpp for (uint32 i = 0; i < m_node->numAttributes(); i++)
i 1311 core/XMLObject.cpp E4XNode *an = m_node->getAttribute(i);
i 1347 core/XMLObject.cpp for (uint32 i = origLength; i < AncestorNamespaces->getLength(); i++)
i 1349 core/XMLObject.cpp Namespace *an = AvmCore::atomToNamespace(AncestorNamespaces->getAt(i));
i 1413 core/XMLObject.cpp for (uint32 i = 0; i < anLen; i++)
i 1415 core/XMLObject.cpp Namespace *first = AvmCore::atomToNamespace(AncestorNamespaces->getAt(i));
i 1416 core/XMLObject.cpp if (i < origLength)
i 1442 core/XMLObject.cpp for (uint32 i = 0; i < _length(); i++)
i 1445 core/XMLObject.cpp E4XNode *child = m_node->_getAt(i);
i 1467 core/XMLObject.cpp for (int i = 0; i < indentLevel; i++)
i 1628 core/XMLObject.cpp for (uint32 i = 0; i < m_node->_length(); i++)
i 1630 core/XMLObject.cpp E4XNode *child = m_node->_getAt(i);
i 1680 core/XMLObject.cpp for (uint32 i = 0; i < _length(); i++)
i 1682 core/XMLObject.cpp E4XNode *child = m_node->_getAt(i);
i 1739 core/XMLObject.cpp uint32 i;
i 1740 core/XMLObject.cpp for (i = 0; i < inScopeNS->getLength(); i++)
i 1742 core/XMLObject.cpp a->setUintProperty (i, inScopeNS->getAt(i));
i 1749 core/XMLObject.cpp a->setUintProperty (i, core->findPublicNamespace()->atom());
i 1798 core/XMLObject.cpp for (uint32 i = 0; i < _length(); i++)
i 1800 core/XMLObject.cpp E4XNode *child = m_node->_getAt(i);
i 1804 core/XMLObject.cpp m_node->_insert (core, toplevel, i + 1, child2);
i 1858 core/XMLObject.cpp for (uint32 i = 0; i < _length(); i++)
i 1860 core/XMLObject.cpp E4XNode *child = m_node->_getAt(i);
i 1864 core/XMLObject.cpp m_node->_insert (core, toplevel, i, child2);
i 1934 core/XMLObject.cpp for (uint32 i = 0; i < inScopeNS->getLength(); i++)
i 1936 core/XMLObject.cpp Namespace *ns = AvmCore::atomToNamespace (inScopeNS->getAt(i));
i 1964 core/XMLObject.cpp for (uint32 i = 0; i < m_node->numNamespaces(); i++)
i 1966 core/XMLObject.cpp Namespace *ns = AvmCore::atomToNamespace (m_node->getNamespaces()->getAt(i));
i 2022 core/XMLObject.cpp uint32 i = 0;
i 2023 core/XMLObject.cpp while (i < _length())
i 2025 core/XMLObject.cpp E4XNode *x = m_node->_getAt(i);
i 2031 core/XMLObject.cpp i++;
i 2036 core/XMLObject.cpp while (((i + 1) < _length()) && (m_node->_getAt(i + 1)->getClass() & (E4XNode::kText | E4XNode::kCDATA)))
i 2038 core/XMLObject.cpp E4XNode *x2 = m_node->_getAt(i + 1);
i 2040 core/XMLObject.cpp m_node->_deleteByIndex (i + 1);
i 2051 core/XMLObject.cpp E4XNode* prior = m_node->_getAt(i);
i 2053 core/XMLObject.cpp m_node->_deleteByIndex (i);
i 2063 core/XMLObject.cpp i++;
i 2076 core/XMLObject.cpp i++;
i 2103 core/XMLObject.cpp for (uint32 i = 0; i < m_node->_length(); i++)
i 2105 core/XMLObject.cpp E4XNode *child = m_node->_getAt(i);
i 2191 core/XMLObject.cpp int32 i = m_node->FindMatchingNamespace (core, ns);
i 2192 core/XMLObject.cpp if (i != -1)
i 2194 core/XMLObject.cpp m_node->getNamespaces()->removeAt(i);
i 2254 core/XMLObject.cpp int i = -1;
i 2270 core/XMLObject.cpp if (i != -1)
i 2272 core/XMLObject.cpp E4XNode* was = m_node->_getAt(i);
i 2274 core/XMLObject.cpp m_node->_deleteByIndex (i);
i 2284 core/XMLObject.cpp i = k;
i 2289 core/XMLObject.cpp if (i == -1)
i 2292 core/XMLObject.cpp E4XNode* prior = m_node->_replace (core, toplevel, i, c);
i 2428 core/XMLObject.cpp for (uint32 i = 0; i < m_node->_length(); i++)
i 2430 core/XMLObject.cpp E4XNode *child = m_node->_getAt(i);
i 2454 core/XMLObject.cpp for (uint32 i = 0; i < _length(); i++)
i 2456 core/XMLObject.cpp E4XNode *child = m_node->_getAt(i);
i 2713 core/XMLObject.cpp for (uint32 i = 0; i < m_node->numAttributes(); i++)
i 2715 core/XMLObject.cpp E4XNode *xml = m_node->getAttribute(i);
i 2733 core/XMLObject.cpp for (uint32 i = 0; i < m_node->numChildren(); i++)
i 2735 core/XMLObject.cpp E4XNode *child = m_node->_getAt(i);
i 2925 core/XMLObject.cpp for (uint32 i = 0; i < nsArray->getLength(); i++)
i 2927 core/XMLObject.cpp Namespace *ns = AvmCore::atomToNamespace (nsArray->getAt(i));
i 152 core/XMLObject.h bool hasUintProperty(uint32 i) const;
i 156 core/XMLObject.h Atom getUintProperty(uint32 i) const;
i 157 core/XMLObject.h void setUintProperty(uint32 i, Atom value);
i 158 core/XMLObject.h bool delUintProperty(uint32 i);
i 67 core/atom-inlines.h intptr_t const i = atomGetIntptr(atom);
i 68 core/atom-inlines.h int32_t const i32 = int32_t(i);
i 69 core/atom-inlines.h return i == i32;
i 81 core/atom-inlines.h intptr_t const i = atomGetIntptr(atom);
i 82 core/atom-inlines.h uint32_t const u32 = uint32_t(i);
i 83 core/atom-inlines.h return i == intptr_t(u32);
i 97 core/atom-inlines.h REALLY_INLINE bool atomIsValidIntptrValue(const intptr_t i)
i 102 core/atom-inlines.h return (((i << 8) >> 8) == i);
i 104 core/atom-inlines.h return (((i << 3) >> 3) == i);
i 201 core/atom.h bool atomIsValidIntptrValue(const intptr_t i);
i 365 core/avmplusDebugger.cpp for(int i=0; i<count; i++)
i 367 core/avmplusDebugger.cpp args = core->concatStrings(args, core->format(arr[i]));
i 368 core/avmplusDebugger.cpp if (i+1 < count)
i 410 core/avmplusDebugger.cpp for(uint32_t i=0, n = pool->methodCount(); i<n; i++)
i 412 core/avmplusDebugger.cpp MethodInfo* f = pool->getMethodInfo(i);
i 89 core/avmplusHashtable.cpp int i = find(name, atoms, getCapacity());
i 91 core/avmplusHashtable.cpp if (removeDontEnumMask(atoms[i]) != name) {
i 94 core/avmplusHashtable.cpp WBATOM(gc, atoms, &atoms[i], name);
i 98 core/avmplusHashtable.cpp WBATOM( gc, atoms, &atoms[i+1], value);
i 103 core/avmplusHashtable.cpp int i;
i 105 core/avmplusHashtable.cpp return atoms[i = find(name, atoms, getCapacity())] == name ? atoms[i+1] : undefinedAtom;
i 140 core/avmplusHashtable.cpp uint32_t i = ((0x7FFFFFF8 & x)>>2) & bitmask;
i 142 core/avmplusHashtable.cpp while ((k=t[i]&mask) != x && k != EMPTY)
i 144 core/avmplusHashtable.cpp i = (i + (n += 2)) & bitmask; // quadratic probe
i 147 core/avmplusHashtable.cpp AvmAssert(i <= ((m-1)&~0x1));
i 148 core/avmplusHashtable.cpp return i;
i 154 core/avmplusHashtable.cpp int i = find(name, atoms, getCapacity());
i 156 core/avmplusHashtable.cpp if (removeDontEnumMask(atoms[i]) == name)
i 158 core/avmplusHashtable.cpp val = atoms[i+1];
i 160 core/avmplusHashtable.cpp AvmCore::atomWriteBarrier_dtor(&atoms[i]);
i 161 core/avmplusHashtable.cpp AvmCore::atomWriteBarrier_dtor(&atoms[i+1]);
i 163 core/avmplusHashtable.cpp atoms[i] = DELETED;
i 164 core/avmplusHashtable.cpp atoms[i+1] = DELETED;
i 173 core/avmplusHashtable.cpp for (int i=0, n=oldlen; i < n; i += 2)
i 176 core/avmplusHashtable.cpp if ((oldAtom=oldAtoms[i]) != EMPTY && oldAtom != DELETED)
i 181 core/avmplusHashtable.cpp newAtoms[j+1] = oldAtoms[i+1];
i 305 core/avmplusHashtable.cpp int i = find(name, atoms, getCapacity());
i 306 core/avmplusHashtable.cpp if (Atom(atoms[i]&~kDontEnumBit) == name)
i 308 core/avmplusHashtable.cpp return (atoms[i]&kDontEnumBit) == 0;
i 326 core/avmplusHashtable.cpp int i = find(name, atoms, getCapacity());
i 327 core/avmplusHashtable.cpp if (Atom(atoms[i]&~kDontEnumBit) == name)
i 329 core/avmplusHashtable.cpp atoms[i] = (atoms[i]&~kDontEnumBit) | (enumerable ? 0 : kDontEnumBit);
i 359 core/avmplusHashtable.cpp for(int i=0, n=ht.getCapacity(); i<n; i+=2) {
i 360 core/avmplusHashtable.cpp if(AvmCore::isGenericObject(atoms[i])) {
i 361 core/avmplusHashtable.cpp GCWeakRef *ref = (GCWeakRef*)AvmCore::atomToGenericObject(atoms[i]);
i 364 core/avmplusHashtable.cpp AvmCore::atomWriteBarrier_dtor(&atoms[i]);
i 365 core/avmplusHashtable.cpp AvmCore::atomWriteBarrier_dtor(&atoms[i+1]);
i 367 core/avmplusHashtable.cpp atoms[i] = InlineHashtable::DELETED;
i 368 core/avmplusHashtable.cpp atoms[i+1] = InlineHashtable::DELETED;
i 419 core/avmplusHashtable.cpp for(int i=0, n=ht.getCapacity(); i<n; i+=2) {
i 420 core/avmplusHashtable.cpp if(AvmCore::isPointer(atoms[i+1])) {
i 421 core/avmplusHashtable.cpp GCWeakRef *ref = (GCWeakRef*)atomPtr(atoms[i+1]);
i 424 core/avmplusHashtable.cpp atoms[i] = InlineHashtable::DELETED;
i 425 core/avmplusHashtable.cpp atoms[i+1] = InlineHashtable::DELETED;
i 143 core/avmplusHashtable.h for (int i=0; i < 32; i++)
i 144 core/avmplusHashtable.h if (value & (1<<i))
i 145 core/avmplusHashtable.h return i;
i 188 core/avmplusHashtable.h for (int i=0; i < 32; i++)
i 189 core/avmplusHashtable.h if (value & (1<<i))
i 190 core/avmplusHashtable.h return i;
i 208 core/avmplusList.h for (unsigned int i=0; i<len; i++) {
i 209 core/avmplusList.h set(i, 0);
i 297 core/avmplusList.h for (unsigned int i=0; i<len; i++) {
i 298 core/avmplusList.h set(i, 0);
i 310 core/avmplusList.h for(uint32 i=0; i<len; i++)
i 311 core/avmplusList.h if (data[i] == value)
i 312 core/avmplusList.h return i;
i 317 core/avmplusList.h for(int32 i=len-1; i>=0; i--)
i 318 core/avmplusList.h if (data[i] == value)
i 319 core/avmplusList.h return i;
i 323 core/avmplusList.h T removeAt(uint32 i)
i 326 core/avmplusList.h old = data[i];
i 328 core/avmplusList.h set(i, NULL);
i 329 core/avmplusList.h arraycopy(data, i+1, data, i, len-i-1);
i 358 core/avmplusList.h for (unsigned int i=0; i<len; i++) {
i 359 core/avmplusList.h newData[i] = data[i];
i 378 core/avmplusList.h for (int i=0, n=list.size(); i < n; i++)
i 379 core/avmplusList.h add(list[i]);
i 407 core/avmplusList.h for(int i=0; i<nbr; i++)
i 408 core/avmplusList.h dst[i+dstStart] = src[i+srcStart];
i 412 core/avmplusList.h for(int i=nbr-1; i>=0; i--)
i 413 core/avmplusList.h dst[i+dstStart] = src[i+srcStart];
i 97 core/avmplusStack.h for (int i=0; i<len; i++) {
i 98 core/avmplusStack.h newData[i] = data[i];
i 298 core/jit-calls.h REALLY_INLINE Atom boxslot(AvmCore* core, int32_t i) { return core->intToAtom(i); }
i 803 core/jit-calls.h ScriptObject* i = AvmCore::atomToScriptObject(index);
i 804 core/jit-calls.h if (i->traits() == core->traits.qName_itraits)
i 806 core/jit-calls.h QNameObject* qname = (QNameObject*) i;
i 56 eval/eval-abc-inlines.h DEBUG_ONLY( uint32_t y = ) addInstance(i);
i 63 eval/eval-abc-inlines.h instances.addAtEnd(i);
i 128 eval/eval-abc.cpp intBuf.emitS32(i);
i 162 eval/eval-abc.cpp uint32_t i;
i 164 eval/eval-abc.cpp for ( nss = namespaces.get(), i=1 ; nss != NULL ; nss = nss->tl, i++ )
i 166 eval/eval-abc.cpp return i;
i 176 eval/eval-abc.cpp uint32_t i, j;
i 183 eval/eval-abc.cpp for ( nsss = namespaceSets.get(), i=1 ; nsss != NULL ; nsss = nsss->tl, i++ ) {
i 188 eval/eval-abc.cpp return i;
i 206 eval/eval-abc.cpp uint32_t i;
i 208 eval/eval-abc.cpp for ( mns = multinames.get(), i=1 ; mns != NULL ; mns = mns->tl, i++ )
i 210 eval/eval-abc.cpp return i;
i 606 eval/eval-abc.cpp let i, limit;
i 616 eval/eval-abc.cpp for ( i=0, limit=interfaces.length ; i < limit ; i++ ) {
i 617 eval/eval-abc.cpp Util::assert( interfaces[i] != 0 );
i 618 eval/eval-abc.cpp bs.uint30(interfaces[i]);
i 622 eval/eval-abc.cpp for ( i=0, limit=traits.length ; i < limit ; i++ )
i 623 eval/eval-abc.cpp traits[i].serialize(bs);
i 644 eval/eval-abc.cpp for ( let i=0, limit=traits.length ; i < limit ; i++ )
i 645 eval/eval-abc.cpp traits[i].serialize(bs);
i 69 eval/eval-abc.h uint32_t addInt(int32_t i);
i 83 eval/eval-abc.h uint32_t addClassAndInstance(ABCClassInfo* c, ABCInstanceInfo* i);
i 84 eval/eval-abc.h uint32_t addInstance(ABCInstanceInfo* i);
i 94 eval/eval-avmplus.cpp int i=0;
i 95 eval/eval-avmplus.cpp while (i < nextstring && strings[i] != input)
i 96 eval/eval-avmplus.cpp i++;
i 97 eval/eval-avmplus.cpp if (i == nextstring) {
i 101 eval/eval-avmplus.cpp delete [] strings[i];
i 102 eval/eval-avmplus.cpp while (i < nextstring-1) {
i 103 eval/eval-avmplus.cpp strings[i] = strings[+1];
i 104 eval/eval-avmplus.cpp i++;
i 466 eval/eval-cogen-expr.cpp uint32_t i=0;
i 470 eval/eval-cogen-expr.cpp i++;
i 472 eval/eval-cogen-expr.cpp cogen->I_newobject(i);
i 477 eval/eval-cogen-expr.cpp uint32_t i = 0;
i 487 eval/eval-cogen-expr.cpp i++;
i 489 eval/eval-cogen-expr.cpp cogen->I_newarray(i);
i 494 eval/eval-cogen-expr.cpp for ( ; exprs != NULL ; exprs = exprs->tl, i++ ) {
i 499 eval/eval-cogen-expr.cpp cogen->I_setproperty(cogen->abc->addQName(compiler->NS_public,cogen->emitString(compiler->intern(i))));
i 507 eval/eval-cogen-expr.cpp cogen->I_pushint(cogen->emitInt(i));
i 585 eval/eval-cogen-expr.cpp uint32_t i = 0;
i 586 eval/eval-cogen-expr.cpp for ( ; args != NULL ; args = args->tl, i++ )
i 588 eval/eval-cogen-expr.cpp return i;
i 40 eval/eval-cogen-inlines.h inline uint32_t Cogen::emitInt(int32_t i) { return abc->addInt(i); }
i 854 eval/eval-cogen-stmt.cpp uint32_t i;
i 855 eval/eval-cogen-stmt.cpp for ( i=0, labels = fctx.returnLabels.get() ; labels != NULL ; i++, labels = labels->tl ) {
i 857 eval/eval-cogen-stmt.cpp cogen->I_pushuint(cogen->emitUInt(i));
i 427 eval/eval-cogen.cpp uint32_t i=1;
i 429 eval/eval-cogen.cpp for ( ; params != NULL ; params = params->tl, i++ ) {
i 432 eval/eval-cogen.cpp cogen->I_getlocal(i);
i 437 eval/eval-cogen.cpp cogen->I_getlocal(i);
i 63 eval/eval-compile.cpp for ( uint32_t i=0 ; i < tableSize ; i++ )
i 64 eval/eval-compile.cpp strTable[i] = NULL;
i 210 eval/eval-compile.cpp uint32_t i = 0;
i 212 eval/eval-compile.cpp buf[i++] = '0';
i 215 eval/eval-compile.cpp buf[i++] = '0' + (u % 10);
i 218 eval/eval-compile.cpp for ( uint32_t j=0, k=i-1 ; j < k ; j++, k-- ) {
i 224 eval/eval-compile.cpp return intern(buf, i);
i 72 eval/eval-lex-inlines.h garbage.i = 0;
i 87 eval/eval-lex-inlines.h garbage.i = 0;
i 101 eval/eval-lex-inlines.h garbage.i = 0;
i 115 eval/eval-lex-inlines.h garbage.i = 0;
i 1182 eval/eval-lex.cpp val.i = (int32_t)n;
i 1653 eval/eval-lex.cpp for ( const wchar* i=mark ; i < idx ; i++ ) {
i 1655 eval/eval-lex.cpp bits = bits << 3 | digitValue(*i);
i 1663 eval/eval-lex.cpp for ( const wchar* i=mark ; i < idx ; i++ ) {
i 1665 eval/eval-lex.cpp bits = bits << 4 | digitValue(*i);
i 1777 eval/eval-lex.cpp sprintf(buf, "i %d", v.i);
i 207 eval/eval-lex.h int32_t i; // T_IntLiteral
i 219 eval/eval-parse-expr.cpp int32_t i = intValue();
i 221 eval/eval-parse-expr.cpp return ALLOC(LiteralInt, (i, pos));
i 77 eval/eval-parse-inlines.h return V0.i;
i 222 eval/eval-util.cpp for ( uint32_t i=0 ; i < nextchar ; i++ )
i 223 eval/eval-util.cpp p[i] = (char)(chunk->data[i] & 127);
i 257 eval/eval-util.cpp for ( int i=0 ; i < SBChunk::chunksize ; i++ )
i 258 eval/eval-util.cpp p[i] = (char)(chunk->data[i] & 127);
i 302 eval/eval-util.cpp for ( uint32_t i=0 ; i < nchars ; i++ )
i 303 eval/eval-util.cpp h = ((h << 5) + h) + chars[i];
i 358 eval/eval-util.cpp for ( int i=0 ; i < 8 ; i++ )
i 359 eval/eval-util.cpp out[i] = v.b[7-i];
i 361 eval/eval-util.cpp for ( int i=0 ; i < 8 ; i++ )
i 362 eval/eval-util.cpp out[i] = v.b[i];
i 110 eval/generate-unicode-tables.c int i, j;
i 114 eval/generate-unicode-tables.c for ( i=0 ; i < next_range ; i++ )
i 115 eval/generate-unicode-tables.c if (ranges[i].hi - ranges[i].lo > 254)
i 119 eval/generate-unicode-tables.c for ( i=1 ; i < next_range ; i++ )
i 120 eval/generate-unicode-tables.c if (ranges[i-1].hi - ranges[i].lo > 255)
i 128 eval/generate-unicode-tables.c int i, numranges=0;
i 130 eval/generate-unicode-tables.c for ( i=0 ; i < next_range ; i++ )
i 131 eval/generate-unicode-tables.c if (ranges[i].lo != -2)
i 135 eval/generate-unicode-tables.c for ( i=0 ; i < next_range ; i++ )
i 136 eval/generate-unicode-tables.c if (ranges[i].lo != -2)
i 137 eval/generate-unicode-tables.c printf("{0x%04X, 0x%04X},\n", ranges[i].lo, ranges[i].hi);
i 141 eval/generate-unicode-tables.c for ( i=0 ; i < next_singleton; i++ )
i 142 eval/generate-unicode-tables.c printf("0x%04X,\n", singletons[i]);
i 515 extensions/JavaGlue.cpp for(int i=argc; i<count; i++)
i 516 extensions/JavaGlue.cpp VMPI_memset(&jargs[i], 0, sizeof(jvalue));
i 548 extensions/JavaGlue.cpp for(int i=argc; i<count; i++)
i 549 extensions/JavaGlue.cpp VMPI_memset(&jargs[i], 0, sizeof(jvalue));
i 589 extensions/JavaGlue.cpp r.i = (is) ? jni->CallStaticIntMethodA(cref, mid, jargs) : r.i = jni->CallIntMethodA(obj, mid, jargs);
i 673 extensions/JavaGlue.cpp r.i = (is) ? jni->GetStaticIntField(cref, fid) : jni->GetIntField(obj, fid);
i 757 extensions/JavaGlue.cpp (is) ? jni->SetStaticIntField(cref, fid, r.i) : jni->SetIntField(obj, fid, r.i);
i 847 extensions/JavaGlue.cpp r.i = ptr[index];
i 936 extensions/JavaGlue.cpp ptr[index] = r.i;
i 989 extensions/JavaGlue.cpp for(int i=0; i<len; i++)
i 991 extensions/JavaGlue.cpp jobject m = jni->GetObjectArrayElement(arr, i);
i 1024 extensions/JavaGlue.cpp for(int i=0; i<len; i++)
i 1026 extensions/JavaGlue.cpp jobject m = jni->GetObjectArrayElement(arr, i);
i 1078 extensions/JavaGlue.cpp int i = 0;
i 1081 extensions/JavaGlue.cpp for(; *d != ')' && *d != 'V'; d++, i++)
i 1083 extensions/JavaGlue.cpp return i;
i 1090 extensions/JavaGlue.cpp for(int i=0; i<argc; i++)
i 1092 extensions/JavaGlue.cpp descriptor = atomTojvalue(core, toplevel, argv[i], descriptor, jargs[i]);
i 1108 extensions/JavaGlue.cpp for(int i=0; i<max; i++)
i 1110 extensions/JavaGlue.cpp jclass type = (jclass)jni->GetObjectArrayElement(arr, i);
i 1133 extensions/JavaGlue.cpp for(int i=0; i<max; i++)
i 1135 extensions/JavaGlue.cpp jclass type = (jclass)jni->GetObjectArrayElement(arr, i);
i 1217 extensions/JavaGlue.cpp for(int i=0; i<argc; i++)
i 1219 extensions/JavaGlue.cpp Atom a = argv[i];
i 1326 extensions/JavaGlue.cpp val.i = AvmCore::integer(a);
i 1413 extensions/JavaGlue.cpp a = core->intToAtom(val.i);
i 1517 extensions/JavaGlue.cpp int i=0;
i 1518 extensions/JavaGlue.cpp for(; src[i]; i++)
i 1519 extensions/JavaGlue.cpp if (src[i] == what) dst[i] = with; else dst[i] = src[i];
i 1520 extensions/JavaGlue.cpp dst[i] = '\0';
i 119 extensions/ST_mmgc_basics.cpp mygcobject->i=10;
i 120 extensions/ST_mmgc_basics.cpp verifyPass(mygcobject->i==10, "mygcobject->i==10", __FILE__, __LINE__);
i 156 extensions/SamplerScript.cpp (void) i;
i 370 extensions/SamplerScript.cpp for(uint32 i=0; i < sample.stack.depth; i++, e++)
i 387 extensions/SamplerScript.cpp stack->setUintProperty(i, sf->atom());
i 40 extensions/SelftestClasses.h int i;
i 44 extensions/SelftestClasses.h int i;
i 95 nanojit/Assembler.cpp for(uint32_t i=0; i<NJ_MAX_STACK_ENTRY; i++)
i 96 nanojit/Assembler.cpp _activation.entry[i] = 0;
i 179 nanojit/Assembler.cpp return i->isconst() || i->isconstq() || i->isop(LIR_alloc);
i 244 nanojit/Assembler.cpp for(uint32_t i = ar.lowwatermark; i < ar.tos; i++)
i 246 nanojit/Assembler.cpp ins = ar.entry[i];
i 253 nanojit/Assembler.cpp int j=i+1;
i 254 nanojit/Assembler.cpp for (int n = i + (ins->size()>>2); j < n; j++) {
i 258 nanojit/Assembler.cpp i = j-1;
i 261 nanojit/Assembler.cpp NanoAssert(ar.entry[i - stack_direction(1)]==ins);
i 262 nanojit/Assembler.cpp i += 1; // skip high word
i 265 nanojit/Assembler.cpp NanoAssertMsg(arIndex == i, "Stack record index mismatch");
i 335 nanojit/Assembler.cpp return findRegFor(i, rmask(w));
i 345 nanojit/Assembler.cpp if (i->isop(LIR_alloc)) {
i 347 nanojit/Assembler.cpp d2 += findMemFor(i);
i 356 nanojit/Assembler.cpp return findRegFor(i, allow);
i 741 nanojit/Assembler.cpp for (uint32_t i = 0, n = jtbl->getTableSize(); i < n; i++) {
i 742 nanojit/Assembler.cpp LabelState* lstate = _labels.get(jtbl->getTarget(i));
i 745 nanojit/Assembler.cpp native_table[i] = ntarget;
i 783 nanojit/Assembler.cpp for (uint32_t i = _activation.lowwatermark; i < _activation.tos; i++) {
i 784 nanojit/Assembler.cpp NanoAssertMsgf(_activation.entry[i] == 0, "frame entry %d wasn't freed\n",-4*i);
i 1272 nanojit/Assembler.cpp for (uint32_t i = count; i-- > 0;) {
i 1273 nanojit/Assembler.cpp LIns* to = ins->getTarget(i);
i 1277 nanojit/Assembler.cpp asm_output(" %u: [&%s]", i, _thisfrag->lirbuf->names->formatRef(to));
i 1295 nanojit/Assembler.cpp for (uint32_t i = count; i-- > 0;) {
i 1296 nanojit/Assembler.cpp LIns* to = ins->getTarget(i);
i 1300 nanojit/Assembler.cpp asm_output(" %u: [&%s]", i, _thisfrag->lirbuf->names->formatRef(to));
i 1507 nanojit/Assembler.cpp for (uint32_t i = 0; i < si->count; ++i)
i 1508 nanojit/Assembler.cpp si->table[i] = target;
i 1516 nanojit/Assembler.cpp for (int i=0, n = NumSavedRegs; i < n; i++) {
i 1517 nanojit/Assembler.cpp LIns *p = b->savedRegs[i];
i 1526 nanojit/Assembler.cpp for (int i=0, n = NumSavedRegs; i < n; i++) {
i 1527 nanojit/Assembler.cpp LIns *p = b->savedRegs[i];
i 1549 nanojit/Assembler.cpp LIns *i = p->head;
i 1550 nanojit/Assembler.cpp NanoAssert(i->isop(LIR_live) || i->isop(LIR_flive));
i 1551 nanojit/Assembler.cpp LIns *op1 = i->oprnd1();
i 1557 nanojit/Assembler.cpp findRegFor(op1, i->isop(LIR_flive) ? FpRegs : GpRegs);
i 1568 nanojit/Assembler.cpp LIns *i = ar.entry[idx];
i 1569 nanojit/Assembler.cpp NanoAssert(i != 0);
i 1573 nanojit/Assembler.cpp } while (ar.entry[idx] == i);
i 1616 nanojit/Assembler.cpp for (int32_t i = _activation.lowwatermark; i < max; i++) {
i 1617 nanojit/Assembler.cpp LIns *ins = _activation.entry[i];
i 1622 nanojit/Assembler.cpp VMPI_sprintf(s," %d-%d(%s)", 4*i, 4*(i+count-1), n);
i 1623 nanojit/Assembler.cpp count += i-1;
i 1624 nanojit/Assembler.cpp while (i < count) {
i 1625 nanojit/Assembler.cpp NanoAssert(_activation.entry[i] == ins);
i 1626 nanojit/Assembler.cpp i++;
i 1630 nanojit/Assembler.cpp VMPI_sprintf(s," %d+(%s)", 4*i, n);
i 1631 nanojit/Assembler.cpp NanoAssert(_activation.entry[i+1] == ins);
i 1632 nanojit/Assembler.cpp i++;
i 1635 nanojit/Assembler.cpp VMPI_sprintf(s," %d(%s)", 4*i, n);
i 1645 nanojit/Assembler.cpp for (int i=0; i < size; i++) {
i 1646 nanojit/Assembler.cpp if (ar.entry[loc+stack_direction(i)])
i 1658 nanojit/Assembler.cpp int32_t i = 0;
i 1663 nanojit/Assembler.cpp for (i=start; i < NJ_MAX_STACK_ENTRY; i++) {
i 1664 nanojit/Assembler.cpp if (ar.entry[i] == 0) {
i 1666 nanojit/Assembler.cpp ar.entry[i] = l;
i 1673 nanojit/Assembler.cpp for (i=start; i < NJ_MAX_STACK_ENTRY; i+=2) {
i 1674 nanojit/Assembler.cpp if ( (ar.entry[i+stack_direction(1)] == 0) && (i==tos || (ar.entry[i] == 0)) ) {
i 1676 nanojit/Assembler.cpp NanoAssert(ar.entry[i] == 0);
i 1677 nanojit/Assembler.cpp NanoAssert(ar.entry[i+stack_direction(1)] == 0);
i 1678 nanojit/Assembler.cpp ar.entry[i] = l;
i 1679 nanojit/Assembler.cpp ar.entry[i+stack_direction(1)] = l;
i 1688 nanojit/Assembler.cpp for (i=start; i < NJ_MAX_STACK_ENTRY; i+=2) {
i 1689 nanojit/Assembler.cpp if (canfit(size, i, ar)) {
i 1692 nanojit/Assembler.cpp NanoAssert(ar.entry[i+stack_direction(j)] == 0);
i 1693 nanojit/Assembler.cpp ar.entry[i+stack_direction(j)] = l;
i 1699 nanojit/Assembler.cpp if (i >= (int32_t)ar.tos) {
i 1700 nanojit/Assembler.cpp ar.tos = i+1;
i 1705 nanojit/Assembler.cpp return i;
i 1723 nanojit/Assembler.cpp LIns *i = regs->getActive(r);
i 1724 nanojit/Assembler.cpp if (i) {
i 1725 nanojit/Assembler.cpp if (canRemat(i)) {
i 1726 nanojit/Assembler.cpp evict(r, i);
i 1751 nanojit/Assembler.cpp LIns *i = regs->getActive(hi);
i 1752 nanojit/Assembler.cpp Register r = findRegFor(i, allow);
i 1912 nanojit/Assembler.cpp LIns *i = saved.getActive(r);
i 1913 nanojit/Assembler.cpp if (i && !(skip&rmask(r)))
i 1914 nanojit/Assembler.cpp findSpecificRegFor(i, r);
i 1923 nanojit/Assembler.cpp LIns *i, *a=0;
i 1927 nanojit/Assembler.cpp if ((allow & rmask(r)) && (i = _allocator.getActive(r)) != 0)
i 1929 nanojit/Assembler.cpp int pri = canRemat(i) ? 0 : _allocator.getPriority(r);
i 1931 nanojit/Assembler.cpp a = i;
i 1985 nanojit/Assembler.cpp for (uint32_t i = 0; i < MAXARGS; ++i) {
i 1998 nanojit/Assembler.cpp for (uint32_t i = 0; i < MAXARGS; i++) {
i 275 nanojit/Assembler.h Register getBaseReg(LOpcode op, LIns *i, int &d, RegisterMask allow);
i 276 nanojit/Assembler.h int findMemFor(LIns* i);
i 277 nanojit/Assembler.h Register findRegFor(LIns* i, RegisterMask allow);
i 279 nanojit/Assembler.h Register findSpecificRegFor(LIns* i, Register r);
i 280 nanojit/Assembler.h Register findSpecificRegForUnallocated(LIns* i, Register r);
i 281 nanojit/Assembler.h Register prepResultReg(LIns *i, RegisterMask allow);
i 282 nanojit/Assembler.h void freeRsrcOf(LIns *i, bool pop);
i 285 nanojit/Assembler.h RegisterMask hint(LIns*i, RegisterMask allow);
i 344 nanojit/Assembler.h void asm_spilli(LInsp i, bool pop);
i 346 nanojit/Assembler.h void asm_load64(LInsp i);
i 348 nanojit/Assembler.h void asm_quad(LInsp i);
i 349 nanojit/Assembler.h void asm_fcond(LInsp i);
i 350 nanojit/Assembler.h void asm_cond(LInsp i);
i 351 nanojit/Assembler.h void asm_arith(LInsp i);
i 352 nanojit/Assembler.h void asm_neg_not(LInsp i);
i 353 nanojit/Assembler.h void asm_load32(LInsp i);
i 354 nanojit/Assembler.h void asm_cmov(LInsp i);
i 355 nanojit/Assembler.h void asm_param(LInsp i);
i 356 nanojit/Assembler.h void asm_int(LInsp i);
i 357 nanojit/Assembler.h void asm_qlo(LInsp i);
i 358 nanojit/Assembler.h void asm_qhi(LInsp i);
i 56 nanojit/Containers.cpp for (int i=0, n=cap; i < n; i++)
i 57 nanojit/Containers.cpp bits[i] = 0;
i 68 nanojit/Containers.cpp for (int i=0; i < c; i++) {
i 69 nanojit/Containers.cpp int64_t b = bits[i];
i 70 nanojit/Containers.cpp int64_t b2 = otherbits[i];
i 72 nanojit/Containers.cpp bits[i] = b|b2;
i 56 nanojit/Containers.h inline int bitnum2word(int i) {
i 57 nanojit/Containers.h return i >> 6;
i 59 nanojit/Containers.h inline int64_t bitnum2mask(int i) {
i 60 nanojit/Containers.h return ONE << (i & 63);
i 77 nanojit/Containers.h bool get(int i) {
i 78 nanojit/Containers.h NanoAssert(i >= 0);
i 79 nanojit/Containers.h int w = bitnum2word(i);
i 81 nanojit/Containers.h return (bits[w] & bitnum2mask(i)) != 0;
i 86 nanojit/Containers.h void set(int i) {
i 87 nanojit/Containers.h NanoAssert(i >= 0);
i 88 nanojit/Containers.h int w = bitnum2word(i);
i 91 nanojit/Containers.h bits[w] |= bitnum2mask(i);
i 95 nanojit/Containers.h void clear(int i) {
i 96 nanojit/Containers.h NanoAssert(i >= 0);
i 97 nanojit/Containers.h int w = bitnum2word(i);
i 99 nanojit/Containers.h bits[w] &= ~bitnum2mask(i);
i 268 nanojit/Containers.h Node* find(K k, size_t &i) {
i 269 nanojit/Containers.h i = H::hash(k) % nbuckets;
i 270 nanojit/Containers.h for (Seq<Node>* p = buckets[i]; p != NULL; p = p->tail) {
i 294 nanojit/Containers.h size_t i;
i 295 nanojit/Containers.h Node* n = find(k, i);
i 300 nanojit/Containers.h buckets[i] = new (allocator) Seq<Node>(Node(k,v), buckets[i]);
i 305 nanojit/Containers.h size_t i;
i 306 nanojit/Containers.h Node* n = find(k, i);
i 312 nanojit/Containers.h size_t i;
i 313 nanojit/Containers.h return find(k, i) != 0;
i 319 nanojit/Containers.h size_t i = H::hash(k) % nbuckets;
i 320 nanojit/Containers.h Seq<Node>** prev = &buckets[i];
i 321 nanojit/Containers.h for (Seq<Node>* p = buckets[i]; p != NULL; p = p->tail) {
i 114 nanojit/LIR.cpp LInsp i = in->read();
i 115 nanojit/LIR.cpp const char* str = _names->formatIns(i);
i 119 nanojit/LIR.cpp return i;
i 148 nanojit/LIR.cpp for (int i = 0; i < NumSavedRegs; ++i)
i 149 nanojit/LIR.cpp savedRegs[i] = NULL;
i 475 nanojit/LIR.cpp if (i->isconst()) {
i 476 nanojit/LIR.cpp int c = i->imm32();
i 479 nanojit/LIR.cpp if (i->isop(LIR_cmov) || i->isop(LIR_qcmov)) {
i 480 nanojit/LIR.cpp return insIsS16(i->oprnd2()) && insIsS16(i->oprnd3());
i 482 nanojit/LIR.cpp if (i->isCmp())
i 492 nanojit/LIR.cpp if (i->isconstq())
i 493 nanojit/LIR.cpp return insImm(i->imm64_0());
i 494 nanojit/LIR.cpp if (i->isop(LIR_qjoin))
i 495 nanojit/LIR.cpp return i->oprnd1();
i 498 nanojit/LIR.cpp if (i->isconstq())
i 499 nanojit/LIR.cpp return insImm(i->imm64_1());
i 500 nanojit/LIR.cpp if (i->isop(LIR_qjoin))
i 501 nanojit/LIR.cpp return i->oprnd2();
i 504 nanojit/LIR.cpp if (i->isconst())
i 505 nanojit/LIR.cpp return insImm(~i->imm32());
i 507 nanojit/LIR.cpp if (v == i->opcode())
i 508 nanojit/LIR.cpp return i->oprnd1();
i 511 nanojit/LIR.cpp if (i->isconst())
i 512 nanojit/LIR.cpp return insImm(-i->imm32());
i 513 nanojit/LIR.cpp if (i->isop(LIR_sub)) // -(a-b) = b-a
i 514 nanojit/LIR.cpp return out->ins2(LIR_sub, i->oprnd2(), i->oprnd1());
i 517 nanojit/LIR.cpp if (i->isconstq())
i 518 nanojit/LIR.cpp return insImmf(-i->imm64f());
i 519 nanojit/LIR.cpp if (i->isop(LIR_fsub))
i 520 nanojit/LIR.cpp return out->ins2(LIR_fsub, i->oprnd2(), i->oprnd1());
i 523 nanojit/LIR.cpp if (i->isconst())
i 524 nanojit/LIR.cpp return insImmf(i->imm32());
i 527 nanojit/LIR.cpp if (i->isconst())
i 528 nanojit/LIR.cpp return insImmf(uint32_t(i->imm32()));
i 534 nanojit/LIR.cpp return out->ins1(v, i);
i 764 nanojit/LIR.cpp LInsp i;
i 766 nanojit/LIR.cpp (i = oprnd1->oprnd1()) == oprnd2->oprnd1()) {
i 768 nanojit/LIR.cpp return i;
i 1010 nanojit/LIR.cpp LInsp i = in->read();
i 1011 nanojit/LIR.cpp if (i->isStore())
i 1013 nanojit/LIR.cpp LInsp base = i->oprnd2();
i 1016 nanojit/LIR.cpp if (ignoreStore(i, spTop, &spStk))
i 1020 nanojit/LIR.cpp if (ignoreStore(i, rpTop, &rpStk))
i 1029 nanojit/LIR.cpp else if (i->isGuard())
i 1033 nanojit/LIR.cpp getTops(i, spTop, rpTop);
i 1038 nanojit/LIR.cpp return i;
i 1170 nanojit/LIR.cpp for (uint32_t i = 0; i < oldcap; i++) {
i 1171 nanojit/LIR.cpp LInsp ins = oldlist[i];
i 1403 nanojit/LIR.cpp LIns* i;
i 1424 nanojit/LIR.cpp if (!i->isconst() && !i->isconstq() && !live.containsKey(i)) {
i 1425 nanojit/LIR.cpp NanoAssert(size_t(i->opcode()) < sizeof(lirNames) / sizeof(lirNames[0]));
i 1426 nanojit/LIR.cpp live.put(i,use);
i 1432 nanojit/LIR.cpp e->i = i;
i 1447 nanojit/LIR.cpp live.remove(i);
i 1453 nanojit/LIR.cpp return live.containsKey(i);
i 1619 nanojit/LIR.cpp for (int i = 0, argc = ins->argc(); i < argc; i++)
i 1620 nanojit/LIR.cpp live.add(ins->arg(i), ins);
i 1648 nanojit/LIR.cpp if (!newblock && e->i->isop(LIR_label)) {
i 1661 nanojit/LIR.cpp const char* insn_text = names->formatIns(e->i);
i 1663 nanojit/LIR.cpp logc->printf(" %-30s\n %-30s %s\n", names->formatIns(e->i), "", livebuf);
i 1665 nanojit/LIR.cpp logc->printf(" %-30s %s\n", names->formatIns(e->i), livebuf);
i 1668 nanojit/LIR.cpp if (e->i->isGuard() || e->i->isBranch() || e->i->isRet()) {
i 1676 nanojit/LIR.cpp if (!names.containsKey(i)) {
i 1680 nanojit/LIR.cpp names.put(i, e);
i 1692 nanojit/LIR.cpp addName(i, s2);
i 1749 nanojit/LIR.cpp LOpcode op = i->opcode();
i 1754 nanojit/LIR.cpp VMPI_sprintf(s, "%s = %s %d", formatRef(i), lirNames[op], i->imm32());
i 1759 nanojit/LIR.cpp VMPI_sprintf(s, "%s = %s %d", formatRef(i), lirNames[op], i->size());
i 1765 nanojit/LIR.cpp VMPI_sprintf(s, "%s = %s #%X:%X /* %g */", formatRef(i), lirNames[op],
i 1766 nanojit/LIR.cpp i->imm64_1(), i->imm64_0(), i->imm64f());
i 1772 nanojit/LIR.cpp VMPI_sprintf(s, "%s = %s #%g", formatRef(i), lirNames[op], i->imm64f());
i 1784 nanojit/LIR.cpp const CallInfo* call = i->callInfo();
i 1785 nanojit/LIR.cpp int32_t argc = i->argc();
i 1787 nanojit/LIR.cpp VMPI_sprintf(s, "%s = %s [%s] ( ", formatRef(i), lirNames[op], formatRef(i->arg(--argc)));
i 1789 nanojit/LIR.cpp VMPI_sprintf(s, "%s = %s #%s ( ", formatRef(i), lirNames[op], call->_name);
i 1792 nanojit/LIR.cpp VMPI_sprintf(s, "%s ",formatRef(i->arg(j)));
i 1800 nanojit/LIR.cpp VMPI_sprintf(s, "%s %s [ ", lirNames[op], formatRef(i->oprnd1()));
i 1801 nanojit/LIR.cpp for (uint32_t j = 0, n = i->getTableSize(); j < n; j++) {
i 1807 nanojit/LIR.cpp LIns* target = i->getTarget(j);
i 1817 nanojit/LIR.cpp uint32_t arg = i->paramArg();
i 1818 nanojit/LIR.cpp if (!i->paramKind()) {
i 1820 nanojit/LIR.cpp VMPI_sprintf(s, "%s = %s %d %s", formatRef(i), lirNames[op],
i 1823 nanojit/LIR.cpp VMPI_sprintf(s, "%s = %s %d", formatRef(i), lirNames[op], arg);
i 1826 nanojit/LIR.cpp VMPI_sprintf(s, "%s = %s %d %s", formatRef(i), lirNames[op],
i 1833 nanojit/LIR.cpp VMPI_sprintf(s, "%s:", formatRef(i));
i 1838 nanojit/LIR.cpp VMPI_sprintf(s, "%s %s -> %s", lirNames[op], formatRef(i->oprnd1()),
i 1839 nanojit/LIR.cpp i->oprnd2() ? formatRef(i->oprnd2()) : "unpatched");
i 1844 nanojit/LIR.cpp i->oprnd2() ? formatRef(i->oprnd2()) : "unpatched");
i 1850 nanojit/LIR.cpp VMPI_sprintf(s, "%s %s", lirNames[op], formatRef(i->oprnd1()));
i 1865 nanojit/LIR.cpp VMPI_sprintf(s, "%s = %s %s", formatRef(i), lirNames[op], formatRef(i->oprnd1()));
i 1873 nanojit/LIR.cpp formatGuard(i, s);
i 1905 nanojit/LIR.cpp VMPI_sprintf(s, "%s = %s %s, %s", formatRef(i), lirNames[op],
i 1906 nanojit/LIR.cpp formatRef(i->oprnd1()),
i 1907 nanojit/LIR.cpp formatRef(i->oprnd2()));
i 1912 nanojit/LIR.cpp formatRef(i->oprnd1()),
i 1913 nanojit/LIR.cpp formatRef(i->oprnd2()));
i 1918 nanojit/LIR.cpp VMPI_sprintf(s, "%s = %s %s ? %s : %s", formatRef(i), lirNames[op],
i 1919 nanojit/LIR.cpp formatRef(i->oprnd1()),
i 1920 nanojit/LIR.cpp formatRef(i->oprnd2()),
i 1921 nanojit/LIR.cpp formatRef(i->oprnd3()));
i 1938 nanojit/LIR.cpp VMPI_sprintf(s, "%s = %s %s[%d]", formatRef(i), lirNames[op],
i 1939 nanojit/LIR.cpp formatRef(i->oprnd1()),
i 1940 nanojit/LIR.cpp i->disp());
i 1949 nanojit/LIR.cpp formatRef(i->oprnd2()),
i 1950 nanojit/LIR.cpp i->disp(),
i 1951 nanojit/LIR.cpp formatRef(i->oprnd1()));
i 375 nanojit/LIR.h inline LIns* arg(uint32_t i) const;
i 928 nanojit/LIR.h LIns* LIns::arg(uint32_t i) const
i 931 nanojit/LIR.h NanoAssert(i < callInfo()->count_args());
i 932 nanojit/LIR.h return toLInsC()->args[i]; // args[] is in right-to-left order as well
i 1114 nanojit/LIR.h void addName(LInsp i, const char *s);
i 1115 nanojit/LIR.h void copyName(LInsp i, const char *s, int suffix);
i 1117 nanojit/LIR.h const char *formatIns(LInsp i);
i 1118 nanojit/LIR.h void formatGuard(LInsp i, char *buf);
i 1133 nanojit/LIR.h LInsp add(LInsp i) {
i 1134 nanojit/LIR.h if (i)
i 1135 nanojit/LIR.h code.add(i);
i 1136 nanojit/LIR.h return i;
i 1139 nanojit/LIR.h LInsp add_flush(LInsp i) {
i 1140 nanojit/LIR.h if ((i = add(i)) != 0)
i 1142 nanojit/LIR.h return i;
i 1190 nanojit/LIR.h LIns* insParam(int32_t i, int32_t kind) {
i 1191 nanojit/LIR.h return add(out->insParam(i, kind));
i 1383 nanojit/LIR.h LInsp insParam(int32_t i, int32_t kind);
i 1415 nanojit/LIR.h LirReader(LInsp i) : LirFilter(0), _i(i)
i 1424 nanojit/LIR.h NanoAssert(i && !i->isop(LIR_skip));
i 938 nanojit/NativeARM.cpp uint32_t i = argc;
i 939 nanojit/NativeARM.cpp while(i--) {
i 940 nanojit/NativeARM.cpp asm_arg(sizes[i], ins->arg(i), r, stkd);
i 1173 nanojit/NativeARM.cpp uint32_t op = i->opcode();
i 1180 nanojit/NativeARM.cpp if (i->paramArg() < 4)
i 1181 nanojit/NativeARM.cpp prefer = rmask(argRegs[i->paramArg()]);
i 1241 nanojit/NativeARM.cpp if (i->isop(LIR_alloc)) {
i 1242 nanojit/NativeARM.cpp asm_add_imm(r, FP, disp(i));
i 1243 nanojit/NativeARM.cpp } else if (i->isconst()) {
i 1244 nanojit/NativeARM.cpp if (!i->getArIndex()) {
i 1245 nanojit/NativeARM.cpp i->markAsClear();
i 1247 nanojit/NativeARM.cpp asm_ld_imm(r, i->imm32());
i 1253 nanojit/NativeARM.cpp int d = findMemFor(i);
i 440 nanojit/NativePPC.cpp #define isS14(i) ((int32_t(bd<<18)>>18) == (i))
i 642 nanojit/NativePPC.cpp if (i->isop(LIR_alloc)) {
i 643 nanojit/NativePPC.cpp d = disp(i);
i 646 nanojit/NativePPC.cpp else if (i->isconst()) {
i 647 nanojit/NativePPC.cpp if (!i->getArIndex()) {
i 648 nanojit/NativePPC.cpp i->markAsClear();
i 650 nanojit/NativePPC.cpp asm_li(r, i->imm32());
i 653 nanojit/NativePPC.cpp d = findMemFor(i);
i 655 nanojit/NativePPC.cpp NanoAssert(i->isQuad());
i 657 nanojit/NativePPC.cpp } else if (i->isQuad()) {
i 730 nanojit/NativePPC.cpp for(uint32_t i = 0; i < argc; i++) {
i 731 nanojit/NativePPC.cpp uint32_t j = argc - i - 1;
i 1191 nanojit/NativePPC.cpp LOpcode op = i->opcode();
i 1198 nanojit/NativePPC.cpp if (i->paramArg() < 8) {
i 1199 nanojit/NativePPC.cpp prefer = rmask(argRegs[i->paramArg()]);
i 1315 nanojit/NativePPC.cpp register Register i;
i 1317 nanojit/NativePPC.cpp asm ("cntlzw %0,%1" : "=r" (i) : "r" (set));
i 1321 nanojit/NativePPC.cpp return 31-i;
i 1325 nanojit/NativePPC.cpp Register i;
i 1328 nanojit/NativePPC.cpp i = Register(cntzlw(int(set))); // gp reg
i 1330 nanojit/NativePPC.cpp i = Register(32+cntzlw(int(set>>32))); // fp reg
i 1332 nanojit/NativePPC.cpp _allocator.free &= ~rmask(i);
i 1333 nanojit/NativePPC.cpp return i;
i 189 nanojit/NativeSparc.cpp for(int i=0; i<argc; i++)
i 191 nanojit/NativeSparc.cpp uint32_t j = argc-i-1;
i 226 nanojit/NativeSparc.cpp int i=0;
i 227 nanojit/NativeSparc.cpp while (!(set & rmask((Register)i)))
i 228 nanojit/NativeSparc.cpp i ++;
i 229 nanojit/NativeSparc.cpp _allocator.free &= ~rmask((Register)i);
i 230 nanojit/NativeSparc.cpp return (Register) i;
i 289 nanojit/NativeSparc.cpp if (i->isop(LIR_alloc)) {
i 291 nanojit/NativeSparc.cpp int32_t d = disp(i);
i 294 nanojit/NativeSparc.cpp else if (i->isconst()) {
i 295 nanojit/NativeSparc.cpp if (!i->getArIndex()) {
i 296 nanojit/NativeSparc.cpp i->markAsClear();
i 298 nanojit/NativeSparc.cpp int v = i->imm32();
i 301 nanojit/NativeSparc.cpp int d = findMemFor(i);
i 217 nanojit/NativeSparc.h *((int32_t*)_nIns) = (int32_t)(i)
i 221 nanojit/NativeSparc.h int i = 0x40000000 | ((offset >> 2) & 0x3FFFFFFF); \
i 222 nanojit/NativeSparc.h IMM32(i); \
i 227 nanojit/NativeSparc.h int i = rd << 25 | op2 << 22 | (imm22 & 0x3FFFFF); \
i 228 nanojit/NativeSparc.h IMM32(i); \
i 241 nanojit/NativeSparc.h int i = op1 << 30 | rd << 25 | op3 << 19 | (bits19 & 0x7FFFF); \
i 242 nanojit/NativeSparc.h IMM32(i); \
i 380 nanojit/NativeX64.cpp void Assembler::SHRI( R r, I i) { emit8(rexrb(X64_shri | U64(r&7)<<48, (R)0, r), i); asm_output("shrl %s, %d", RL(r), i); }
i 381 nanojit/NativeX64.cpp void Assembler::SARI( R r, I i) { emit8(rexrb(X64_sari | U64(r&7)<<48, (R)0, r), i); asm_output("sarl %s, %d", RL(r), i); }
i 382 nanojit/NativeX64.cpp void Assembler::SHLI( R r, I i) { emit8(rexrb(X64_shli | U64(r&7)<<48, (R)0, r), i); asm_output("shll %s, %d", RL(r), i); }
i 383 nanojit/NativeX64.cpp void Assembler::SHRQI(R r, I i) { emit8(rexrb(X64_shrqi | U64(r&7)<<48, (R)0, r), i); asm_output("shrq %s, %d", RQ(r), i); }
i 384 nanojit/NativeX64.cpp void Assembler::SARQI(R r, I i) { emit8(rexrb(X64_sarqi | U64(r&7)<<48, (R)0, r), i); asm_output("sarq %s, %d", RQ(r), i); }
i 385 nanojit/NativeX64.cpp void Assembler::SHLQI(R r, I i) { emit8(rexrb(X64_shlqi | U64(r&7)<<48, (R)0, r), i); asm_output("shlq %s, %d", RQ(r), i); }
i 896 nanojit/NativeX64.cpp for (int i = 0; i < argc; i++) {
i 897 nanojit/NativeX64.cpp int j = argc - i - 1;
i 398 nanojit/NativeX64.h void asm_div_mod(LIns *i);\
i 411 nanojit/NativeX64.h void SHRI(Register r, int i);\
i 412 nanojit/NativeX64.h void SARI(Register r, int i);\
i 413 nanojit/NativeX64.h void SHLI(Register r, int i);\
i 414 nanojit/NativeX64.h void SHRQI(Register r, int i);\
i 415 nanojit/NativeX64.h void SARQI(Register r, int i);\
i 416 nanojit/NativeX64.h void SHLQI(Register r, int i);\
i 292 nanojit/Nativei386.cpp for(uint32_t i=0; i < argc; i++)
i 294 nanojit/Nativei386.cpp uint32_t j = argc-i-1;
i 358 nanojit/Nativei386.cpp uint32_t op = i->opcode();
i 367 nanojit/Nativei386.cpp if (i->paramKind() == 0) {
i 369 nanojit/Nativei386.cpp if (i->paramArg() < max_regs)
i 370 nanojit/Nativei386.cpp prefer &= rmask(argRegs[i->paramArg()]);
i 372 nanojit/Nativei386.cpp if (i->paramArg() < NumSavedRegs)
i 373 nanojit/Nativei386.cpp prefer &= rmask(savedRegs[i->paramArg()]);
i 376 nanojit/Nativei386.cpp else if (op == LIR_callh || (op == LIR_rsh && i->oprnd1()->opcode()==LIR_callh)) {
i 379 nanojit/Nativei386.cpp else if (i->isCmp()) {
i 382 nanojit/Nativei386.cpp else if (i->isconst()) {
i 445 nanojit/Nativei386.cpp if (i->isop(LIR_alloc)) {
i 446 nanojit/Nativei386.cpp LEA(r, disp(i), FP);
i 448 nanojit/Nativei386.cpp else if (i->isconst()) {
i 449 nanojit/Nativei386.cpp if (!i->getArIndex()) {
i 450 nanojit/Nativei386.cpp i->markAsClear();
i 452 nanojit/Nativei386.cpp asm_int(r, i->imm32(), /*canClobberCCs*/false);
i 454 nanojit/Nativei386.cpp else if (i->isop(LIR_param) && i->paramKind() == 0 &&
i 455 nanojit/Nativei386.cpp (arg = i->paramArg()) >= (abi_regcount = max_abi_regs[_thisfrag->lirbuf->abi])) {
i 457 nanojit/Nativei386.cpp if (!i->getArIndex()) {
i 458 nanojit/Nativei386.cpp i->markAsClear();
i 470 nanojit/Nativei386.cpp int d = findMemFor(i);
i 195 nanojit/Nativei386.h *((int8_t*)_nIns) = (int8_t)(i)
i 199 nanojit/Nativei386.h *((int16_t*)_nIns) = (int16_t)(i)
i 203 nanojit/Nativei386.h *((int32_t*)_nIns) = (int32_t)(i)
i 209 nanojit/Nativei386.h NanoAssert(unsigned(i)<8 && unsigned(b)<8 && unsigned(r)<8); \
i 213 nanojit/Nativei386.h _nIns[1] = (uint8_t) ((l)<<6 | (i)<<3 | (b)); \
i 217 nanojit/Nativei386.h _nIns[1] = (uint8_t) ( (l)<<6 | (i)<<3 | (b) ); \
i 221 nanojit/Nativei386.h *(--_nIns) = (uint8_t) ( (l)<<6 | (i)<<3 | (b) ); \
i 322 nanojit/Nativei386.h if (isS8(i)) { \
i 323 nanojit/Nativei386.h *(--_nIns) = uint8_t(i); \
i 327 nanojit/Nativei386.h IMM32(i); \
i 339 nanojit/Nativei386.h if (isS8(i)) { \
i 340 nanojit/Nativei386.h *(--_nIns) = uint8_t(i); \
i 344 nanojit/Nativei386.h IMM32(i); \
i 373 nanojit/Nativei386.h *--_nIns = (uint8_t)(i);\
i 377 nanojit/Nativei386.h #define SHLi(r,i) do { count_alu(); SHIFT(4,r,i); asm_output("shl %s,%d", gpn(r),i); } while(0)
i 378 nanojit/Nativei386.h #define SHRi(r,i) do { count_alu(); SHIFT(5,r,i); asm_output("shr %s,%d", gpn(r),i); } while(0)
i 379 nanojit/Nativei386.h #define SARi(r,i) do { count_alu(); SHIFT(7,r,i); asm_output("sar %s,%d", gpn(r),i); } while(0)
i 383 nanojit/Nativei386.h #define SUBi(r,i) do { count_alu(); ALUi(0x2d,r,i); asm_output("sub %s,%d",gpn(r),i); } while(0)
i 384 nanojit/Nativei386.h #define ADDi(r,i) do { count_alu(); ALUi(0x05,r,i); asm_output("add %s,%d",gpn(r),i); } while(0)
i 385 nanojit/Nativei386.h #define ANDi(r,i) do { count_alu(); ALUi(0x25,r,i); asm_output("and %s,%d",gpn(r),i); } while(0)
i 386 nanojit/Nativei386.h #define ORi(r,i) do { count_alu(); ALUi(0x0d,r,i); asm_output("or %s,%d",gpn(r),i); } while(0)
i 387 nanojit/Nativei386.h #define XORi(r,i) do { count_alu(); ALUi(0x35,r,i); asm_output("xor %s,%d",gpn(r),i); } while(0)
i 389 nanojit/Nativei386.h #define ADDmi(d,b,i) do { count_alust(); ALUmi(0x05, d, b, i); asm_output("add %d(%s), %d", d, gpn(b), i); } while(0)
i 393 nanojit/Nativei386.h #define CMPi(r,i) do { count_alu(); ALUi(0x3d,r,i); asm_output("cmp %s,%d",gpn(r),i); } while(0)
i 399 nanojit/Nativei386.h #define LEAmi4(r,d,i) do { count_alu(); IMM32(d); *(--_nIns) = (2<<6)|((uint8_t)i<<3)|5; *(--_nIns) = (0<<6)|((uint8_t)r<<3)|4; *(--_nIns) = 0x8d; asm_output("lea %s, %p(%s*4)", gpn(r), (void*)d, gpn(i)); } while(0)
i 516 nanojit/Nativei386.h IMM32(i); \
i 519 nanojit/Nativei386.h asm_output("mov %s,%d",gpn(r),i); } while(0)
i 569 nanojit/Nativei386.h if (isS8(i)) { \
i 571 nanojit/Nativei386.h _nIns-=2; _nIns[0] = 0x6a; _nIns[1] = (uint8_t)(i); \
i 572 nanojit/Nativei386.h asm_output("push %d",i); \
i 574 nanojit/Nativei386.h { PUSHi32(i); } } while(0)
i 579 nanojit/Nativei386.h IMM32(i); \
i 581 nanojit/Nativei386.h asm_output("push %d",i); } while(0)
i 902 nanojit/Nativei386.h *(--_nIns) = ((uint8_t)(i)); \
i 905 nanojit/Nativei386.h asm_output("test ah, %d",i); } while(0)
i 911 nanojit/Nativei386.h *(--_nIns) = ((uint8_t)(i)); \
i 912 nanojit/Nativei386.h *(--_nIns) = ((uint8_t)((i)>>8)); \
i 915 nanojit/Nativei386.h asm_output("test ax, %d",i); } while(0)
i 51 nanojit/RegAlloc.cpp for(Register i=FirstReg; i <= LastReg; i = nextreg(i))
i 52 nanojit/RegAlloc.cpp cnt += active[i] ? 1 : 0;
i 59 nanojit/RegAlloc.cpp return (isFree(r) && !getActive(r) && !i) ||
i 60 nanojit/RegAlloc.cpp (!isFree(r) && getActive(r)== i && i );
i 189 nanojit/nanojit.h #define counter_adjust(x,i) (counter_value(x)+=(int32_t)(i))
i 207 nanojit/nanojit.h #define isS8(i) ( int32_t(i) == int8_t(i) )
i 208 nanojit/nanojit.h #define isU8(i) ( int32_t(i) == uint8_t(i) )
i 209 nanojit/nanojit.h #define isS16(i) ( int32_t(i) == int16_t(i) )
i 210 nanojit/nanojit.h #define isU16(i) ( int32_t(i) == uint16_t(i) )
i 211 nanojit/nanojit.h #define isS24(i) ( (int32_t((i)<<8)>>8) == (i) )
i 214 nanojit/nanojit.h return int32_t(i) == i;
i 218 nanojit/nanojit.h return uint32_t(i) == i;
i 15 other-licenses/zlib/adler32.c #define DO1(buf,i) {adler += (buf)[i]; sum2 += adler;}
i 16 other-licenses/zlib/adler32.c #define DO2(buf,i) DO1(buf,i); DO1(buf,i+1);
i 17 other-licenses/zlib/adler32.c #define DO4(buf,i) DO2(buf,i); DO2(buf,i+2);
i 18 other-licenses/zlib/adler32.c #define DO8(buf,i) DO4(buf,i); DO4(buf,i+4);
i 327 other-licenses/zlib/trees.c ((i) == (last)? "\n};\n\n" : \
i 328 other-licenses/zlib/trees.c ((i) % (width) == (width)-1 ? ",\n" : ", "))
i 333 other-licenses/zlib/trees.c int i;
i 340 other-licenses/zlib/trees.c for (i = 0; i < L_CODES+2; i++) {
i 341 other-licenses/zlib/trees.c fprintf(header, "{{%3u},{%3u}}%s", static_ltree[i].Code,
i 342 other-licenses/zlib/trees.c static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));
i 346 other-licenses/zlib/trees.c for (i = 0; i < D_CODES; i++) {
i 347 other-licenses/zlib/trees.c fprintf(header, "{{%2u},{%2u}}%s", static_dtree[i].Code,
i 348 other-licenses/zlib/trees.c static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));
i 352 other-licenses/zlib/trees.c for (i = 0; i < DIST_CODE_LEN; i++) {
i 353 other-licenses/zlib/trees.c fprintf(header, "%2u%s", _dist_code[i],
i 354 other-licenses/zlib/trees.c SEPARATOR(i, DIST_CODE_LEN-1, 20));
i 358 other-licenses/zlib/trees.c for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) {
i 359 other-licenses/zlib/trees.c fprintf(header, "%2u%s", _length_code[i],
i 360 other-licenses/zlib/trees.c SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20));
i 364 other-licenses/zlib/trees.c for (i = 0; i < LENGTH_CODES; i++) {
i 365 other-licenses/zlib/trees.c fprintf(header, "%1u%s", base_length[i],
i 366 other-licenses/zlib/trees.c SEPARATOR(i, LENGTH_CODES-1, 20));
i 370 other-licenses/zlib/trees.c for (i = 0; i < D_CODES; i++) {
i 371 other-licenses/zlib/trees.c fprintf(header, "%5u%s", base_dist[i],
i 372 other-licenses/zlib/trees.c SEPARATOR(i, D_CODES-1, 10));
i 64 pcre/dftables.cpp int i = 1;
i 75 pcre/dftables.cpp i++;
i 78 pcre/dftables.cpp if (argc < i + 1)
i 87 pcre/dftables.cpp f = fopen(argv[i], "wb");
i 121 pcre/dftables.cpp for (i = 0; i < 256; i++)
i 123 pcre/dftables.cpp if ((i & 7) == 0 && i != 0) fprintf(f, "\n ");
i 125 pcre/dftables.cpp if (i != 255) fprintf(f, ",");
i 132 pcre/dftables.cpp for (i = 0; i < 256; i++)
i 134 pcre/dftables.cpp if ((i & 7) == 0 && i != 0) fprintf(f, "\n ");
i 136 pcre/dftables.cpp if (i != 255) fprintf(f, ",");
i 148 pcre/dftables.cpp for (i = 0; i < cbit_length; i++)
i 150 pcre/dftables.cpp if ((i & 7) == 0 && i != 0)
i 152 pcre/dftables.cpp if ((i & 31) == 0) fprintf(f, "\n");
i 156 pcre/dftables.cpp if (i != cbit_length - 1) fprintf(f, ",");
i 172 pcre/dftables.cpp for (i = 0; i < 256; i++)
i 174 pcre/dftables.cpp if ((i & 7) == 0 && i != 0)
i 177 pcre/dftables.cpp if (isprint(i-8)) fprintf(f, " %c -", i-8);
i 178 pcre/dftables.cpp else fprintf(f, "%3d-", i-8);
i 179 pcre/dftables.cpp if (isprint(i-1)) fprintf(f, " %c ", i-1);
i 180 pcre/dftables.cpp else fprintf(f, "%3d", i-1);
i 184 pcre/dftables.cpp if (i != 255) fprintf(f, ",");
i 188 pcre/dftables.cpp if (isprint(i-8)) fprintf(f, " %c -", i-8);
i 189 pcre/dftables.cpp else fprintf(f, "%3d-", i-8);
i 190 pcre/dftables.cpp if (isprint(i-1)) fprintf(f, " %c ", i-1);
i 191 pcre/dftables.cpp else fprintf(f, "%3d", i-1);
i 530 pcre/pcre_compile.cpp int c, i;
i 545 pcre/pcre_compile.cpp else if ((i = escapes[c - '0']) != 0) c = i;
i 549 pcre/pcre_compile.cpp else if ((i = escapes[c - 0x48]) != 0) c = i;
i 684 pcre/pcre_compile.cpp while(i++ < 2 && ptr[1] >= '0' && ptr[1] <= '7')
i 729 pcre/pcre_compile.cpp while (i++ < 2 && (digitab[ptr[1]] & ctype_xdigit) != 0)
i 816 pcre/pcre_compile.cpp int c, i, bot, top;
i 835 pcre/pcre_compile.cpp for (i = 0; i < (int)sizeof(name) - 1; i++)
i 840 pcre/pcre_compile.cpp name[i] = c;
i 843 pcre/pcre_compile.cpp name[i] = 0;
i 863 pcre/pcre_compile.cpp i = (bot + top) >> 1;
i 864 pcre/pcre_compile.cpp c = VMPI_strcmp(name, _pcre_utt[i].name);
i 867 pcre/pcre_compile.cpp *dptr = _pcre_utt[i].value;
i 868 pcre/pcre_compile.cpp return _pcre_utt[i].type;
i 870 pcre/pcre_compile.cpp if (c > 0) bot = i + 1; else top = i;
i 4022 pcre/pcre_compile.cpp register int i;
i 4144 pcre/pcre_compile.cpp for (i = 1; i < repeat_min; i++)
i 4195 pcre/pcre_compile.cpp else for (i = repeat_max - 1; i >= 0; i--)
i 4205 pcre/pcre_compile.cpp if (i != 0)
i 4217 pcre/pcre_compile.cpp PUT(cd->hwm, 0, GET(hc, 0) + len + ((i != 0)? 2+LINK_SIZE : 1));
i 4356 pcre/pcre_compile.cpp int i, namelen;
i 4371 pcre/pcre_compile.cpp for (i = 0; i < verbcount; i++)
i 4373 pcre/pcre_compile.cpp if (namelen == verbs[i].len &&
i 4374 pcre/pcre_compile.cpp VMPI_strncmp((char *)name, verbs[i].name, namelen) == 0)
i 4376 pcre/pcre_compile.cpp *code = verbs[i].op;
i 4381 pcre/pcre_compile.cpp if (i < verbcount) continue;
i 4391 pcre/pcre_compile.cpp int i, set, unset, namelen;
i 4542 pcre/pcre_compile.cpp for (i = 0; i < cd->names_found; i++)
i 4550 pcre/pcre_compile.cpp if (i < cd->names_found)
i 4558 pcre/pcre_compile.cpp else if ((i = find_parens(ptr, cd->bracount, name, namelen,
i 4561 pcre/pcre_compile.cpp PUT2(code, 2+LINK_SIZE, i);
i 4582 pcre/pcre_compile.cpp for (i = 1; i < namelen; i++)
i 4584 pcre/pcre_compile.cpp if ((digitab[name[i]] & ctype_digit) == 0)
i 4589 pcre/pcre_compile.cpp recno = recno * 10 + name[i] - '0';
i 4756 pcre/pcre_compile.cpp for (i = 0; i < cd->names_found; i++)
i 4774 pcre/pcre_compile.cpp (cd->names_found - i) * cd->name_entry_size);
i 4831 pcre/pcre_compile.cpp for (i = 0; i < cd->names_found; i++)
i 4837 pcre/pcre_compile.cpp if (i < cd->names_found) /* Back reference */
i 454 pcre/pcre_dfa_exec.cpp int i, j;
i 476 pcre/pcre_dfa_exec.cpp for (i = 0; i < active_count; i++)
i 477 pcre/pcre_dfa_exec.cpp printf("%d/%d ", active_states[i].offset, active_states[i].count);
i 509 pcre/pcre_dfa_exec.cpp for (i = 0; i < active_count; i++)
i 511 pcre/pcre_dfa_exec.cpp stateblock *current_state = active_states + i;
i 551 pcre/pcre_dfa_exec.cpp for (j = 0; j < i; j++)
i 2347 pcre/pcre_dfa_exec.cpp else if (i + 1 >= active_count && new_count == 0)
i 2362 pcre/pcre_dfa_exec.cpp i = -1;
i 424 pcre/pcre_exec.cpp register int i; /* Used for loops not involving calls to RMATCH() */
i 520 pcre/pcre_exec.cpp #define fi i
i 970 pcre/pcre_exec.cpp i = GET(ecode, 1);
i 971 pcre/pcre_exec.cpp while (i-- > 0)
i 1878 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 1909 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 1979 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 1997 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 2061 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 2088 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 2149 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 2182 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 2357 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 2401 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 2462 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 2480 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 2501 pcre/pcre_exec.cpp for (i = 1; i <= min; i++) if (fc != *eptr++) RRETURN(MATCH_NOMATCH);
i 2517 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 2643 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 2655 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 2704 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 2726 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 2754 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 2764 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 2812 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 2833 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 2945 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 2953 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 2966 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 2977 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 2988 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 3008 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 3036 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 3051 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 3073 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 3105 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 3137 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 3157 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 3177 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 3187 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 3197 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 3220 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 3244 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 3254 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 3279 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 3296 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 3315 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 3330 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 3345 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 3362 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 3379 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 3384 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 3389 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 3394 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 3399 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 3405 pcre/pcre_exec.cpp for (i = 1; i <= min; i++)
i 3848 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 3859 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 3874 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 3887 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 3900 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 3930 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 3987 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 3996 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 4011 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 4035 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 4057 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 4095 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 4120 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 4131 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 4142 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 4161 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 4181 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 4192 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 4227 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 4244 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 4263 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 4273 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 4283 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 4294 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 4305 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 4314 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 4323 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 4332 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 4341 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 4350 pcre/pcre_exec.cpp for (i = min; i < max; i++)
i 315 pcre/pcre_get.cpp int i;
i 321 pcre/pcre_get.cpp for (i = 0; i < double_count; i += 2)
i 322 pcre/pcre_get.cpp size += sizeof(char *) + ovector[i+1] - ovector[i] + 1;
i 330 pcre/pcre_get.cpp for (i = 0; i < double_count; i += 2)
i 332 pcre/pcre_get.cpp int len = ovector[i+1] - ovector[i];
i 333 pcre/pcre_get.cpp VMPI_memcpy(p, subject + ovector[i], len);
i 252 pcre/pcre_internal.h size_t i;
i 259 pcre/pcre_internal.h for (i = 0; i < n; ++i) *(--dest) = *(--src);
i 264 pcre/pcre_internal.h for (i = 0; i < n; ++i) *dest++ = *src++;
i 73 pcre/pcre_maketables.cpp int i;
i 86 pcre/pcre_maketables.cpp for (i = 0; i < 256; i++) *p++ = VMPI_tolower(i);
i 90 pcre/pcre_maketables.cpp for (i = 0; i < 256; i++) *p++ = VMPI_islower(i)? VMPI_toupper(i) : VMPI_tolower(i);
i 102 pcre/pcre_maketables.cpp for (i = 0; i < 256; i++)
i 104 pcre/pcre_maketables.cpp if (VMPI_isdigit(i)) p[cbit_digit + i/8] |= 1 << (i&7);
i 105 pcre/pcre_maketables.cpp if (VMPI_isupper(i)) p[cbit_upper + i/8] |= 1 << (i&7);
i 106 pcre/pcre_maketables.cpp if (VMPI_islower(i)) p[cbit_lower + i/8] |= 1 << (i&7);
i 107 pcre/pcre_maketables.cpp if (VMPI_isalnum(i)) p[cbit_word + i/8] |= 1 << (i&7);
i 108 pcre/pcre_maketables.cpp if (i == '_') p[cbit_word + i/8] |= 1 << (i&7);
i 109 pcre/pcre_maketables.cpp if (VMPI_isspace(i)) p[cbit_space + i/8] |= 1 << (i&7);
i 110 pcre/pcre_maketables.cpp if (VMPI_isxdigit(i))p[cbit_xdigit + i/8] |= 1 << (i&7);
i 111 pcre/pcre_maketables.cpp if (VMPI_isgraph(i)) p[cbit_graph + i/8] |= 1 << (i&7);
i 112 pcre/pcre_maketables.cpp if (VMPI_isprint(i)) p[cbit_print + i/8] |= 1 << (i&7);
i 113 pcre/pcre_maketables.cpp if (VMPI_ispunct(i)) p[cbit_punct + i/8] |= 1 << (i&7);
i 114 pcre/pcre_maketables.cpp if (VMPI_iscntrl(i)) p[cbit_cntrl + i/8] |= 1 << (i&7);
i 122 pcre/pcre_maketables.cpp for (i = 0; i < 256; i++)
i 125 pcre/pcre_maketables.cpp if (i != 0x0b && VMPI_isspace(i)) x += ctype_space;
i 126 pcre/pcre_maketables.cpp if (VMPI_isalpha(i)) x += ctype_letter;
i 127 pcre/pcre_maketables.cpp if (VMPI_isdigit(i)) x += ctype_digit;
i 128 pcre/pcre_maketables.cpp if (VMPI_isxdigit(i)) x += ctype_xdigit;
i 129 pcre/pcre_maketables.cpp if (VMPI_isalnum(i) || i == '_') x += ctype_word;
i 136 pcre/pcre_maketables.cpp if (VMPI_strchr("\\*+?{^.$|()[", i) != 0) x += ctype_meta;
i 69 pcre/pcre_ord2utf8.cpp register int i, j;
i 70 pcre/pcre_ord2utf8.cpp for (i = 0; i < _pcre_utf8_table1_size; i++)
i 71 pcre/pcre_ord2utf8.cpp if (cvalue <= _pcre_utf8_table1[i]) break;
i 72 pcre/pcre_ord2utf8.cpp buffer += i;
i 73 pcre/pcre_ord2utf8.cpp for (j = i; j > 0; j--)
i 78 pcre/pcre_ord2utf8.cpp *buffer = _pcre_utf8_table2[i] | cvalue;
i 79 pcre/pcre_ord2utf8.cpp return i + 1;
i 134 pcre/pcre_scanner_unittest.cc for (int i = 0; i < 1024; ++i) {
i 136 pcre/pcre_scanner_unittest.cc snprintf(buf, sizeof(buf), " # Comment %d\n", i);
i 529 pcre/pcrecpp.cc for (int i = 0; i < n; i++) {
i 530 pcre/pcrecpp.cc const int start = vec[2*(i+1)];
i 531 pcre/pcrecpp.cc const int limit = vec[2*(i+1)+1];
i 532 pcre/pcrecpp.cc if (!args[i]->Parse(text.data() + start, limit-start)) {
i 80 pcre/pcrecpp_unittest.cc int i;
i 82 pcre/pcrecpp_unittest.cc CHECK(pattern.FullMatch("ruby:1234", &i));
i 83 pcre/pcrecpp_unittest.cc CHECK_EQ(i, 1234);
i 108 pcre/pcrecpp_unittest.cc for (int i = 0; i < 100000; i++) {
i 109 pcre/pcrecpp_unittest.cc if (i == 50000) {
i 114 pcre/pcrecpp_unittest.cc snprintf(buf, sizeof(buf), "pat%09d", i);
i 806 pcre/pcrecpp_unittest.cc int i;
i 824 pcre/pcrecpp_unittest.cc CHECK(RE("(\\d+)").FullMatch("1001", &i));
i 825 pcre/pcrecpp_unittest.cc CHECK_EQ(i, 1001);
i 826 pcre/pcrecpp_unittest.cc CHECK(RE("(-?\\d+)").FullMatch("-123", &i));
i 827 pcre/pcrecpp_unittest.cc CHECK_EQ(i, -123);
i 828 pcre/pcrecpp_unittest.cc CHECK(!RE("()\\d+").FullMatch("10", &i));
i 830 pcre/pcrecpp_unittest.cc &i));
i 833 pcre/pcrecpp_unittest.cc CHECK(RE("1(\\d*)4").FullMatch("1234", &i));
i 834 pcre/pcrecpp_unittest.cc CHECK_EQ(i, 23);
i 835 pcre/pcrecpp_unittest.cc CHECK(RE("(\\d)\\d+").FullMatch("1234", &i));
i 836 pcre/pcrecpp_unittest.cc CHECK_EQ(i, 1);
i 837 pcre/pcrecpp_unittest.cc CHECK(RE("(-\\d)\\d+").FullMatch("-1234", &i));
i 838 pcre/pcrecpp_unittest.cc CHECK_EQ(i, -1);
i 839 pcre/pcrecpp_unittest.cc CHECK(RE("(\\d)").PartialMatch("1234", &i));
i 840 pcre/pcrecpp_unittest.cc CHECK_EQ(i, 1);
i 841 pcre/pcrecpp_unittest.cc CHECK(RE("(-\\d)").PartialMatch("-1234", &i));
i 842 pcre/pcrecpp_unittest.cc CHECK_EQ(i, -1);
i 850 pcre/pcrecpp_unittest.cc CHECK(RE("(\\w+):(\\d+)").FullMatch("ruby:1234", &sp, &i));
i 853 pcre/pcrecpp_unittest.cc CHECK_EQ(i, 1234);
i 856 pcre/pcrecpp_unittest.cc CHECK(RE("(\\w+):(\\d+)").FullMatch("ruby:1234", &s, &i));
i 858 pcre/pcrecpp_unittest.cc CHECK_EQ(i, 1234);
i 861 pcre/pcrecpp_unittest.cc CHECK(RE("(\\w+)(:)(\\d+)").FullMatch("ruby:1234", &s, (void*)NULL, &i));
i 863 pcre/pcrecpp_unittest.cc CHECK_EQ(i, 1234);
i 976 pcre/pcrecpp_unittest.cc CHECK(!RE("(\\d+)").FullMatch("x1001", &i));
i 977 pcre/pcrecpp_unittest.cc CHECK(!RE("(\\d+)").FullMatch("1001x", &i));
i 978 pcre/pcrecpp_unittest.cc CHECK(RE("x(\\d+)").FullMatch("x1001", &i)); CHECK_EQ(i, 1001);
i 979 pcre/pcrecpp_unittest.cc CHECK(RE("(\\d+)x").FullMatch("1001x", &i)); CHECK_EQ(i, 1001);
i 40 pcre/pcredemo.cpp int rc, i;
i 52 pcre/pcredemo.cpp for (i = 1; i < argc; i++)
i 54 pcre/pcredemo.cpp if (strcmp(argv[i], "-g") == 0) find_all = 1;
i 61 pcre/pcredemo.cpp if (argc - i != 2)
i 67 pcre/pcredemo.cpp pattern = argv[i];
i 68 pcre/pcredemo.cpp subject = argv[i+1];
i 147 pcre/pcredemo.cpp for (i = 0; i < rc; i++)
i 149 pcre/pcredemo.cpp char *substring_start = subject + ovector[2*i];
i 150 pcre/pcredemo.cpp int substring_length = ovector[2*i+1] - ovector[2*i];
i 151 pcre/pcredemo.cpp printf("%2d: %.*s\n", i, substring_length, substring_start);
i 195 pcre/pcredemo.cpp for (i = 0; i < namecount; i++)
i 299 pcre/pcredemo.cpp for (i = 0; i < rc; i++)
i 301 pcre/pcredemo.cpp char *substring_start = subject + ovector[2*i];
i 302 pcre/pcredemo.cpp int substring_length = ovector[2*i+1] - ovector[2*i];
i 303 pcre/pcredemo.cpp printf("%2d: %.*s\n", i, substring_length, substring_start);
i 310 pcre/pcredemo.cpp for (i = 0; i < namecount; i++)
i 844 pcre/pcregrep.cpp int i, endlinelength;
i 882 pcre/pcregrep.cpp for (i = 0; i < jfriedl_XT; i++) {
i 894 pcre/pcregrep.cpp for (i = 0; i < jfriedl_XR; i++)
i 913 pcre/pcregrep.cpp for (i = 0; i < pattern_count; i++)
i 915 pcre/pcregrep.cpp mrc = pcre_exec(pattern_list[i], hints_list[i], ptr, length, 0, 0,
i 921 pcre/pcregrep.cpp if (pattern_count > 1) fprintf(stderr, "pattern number %d to ", i+1);
i 1572 pcre/pcregrep.cpp int i, j;
i 1587 pcre/pcregrep.cpp (void)pcre_config(PCRE_CONFIG_NEWLINE, &i);
i 1588 pcre/pcregrep.cpp switch(i)
i 1599 pcre/pcregrep.cpp for (i = 1; i < argc; i++)
i 1606 pcre/pcregrep.cpp if (argv[i][0] != '-') break;
i 1611 pcre/pcregrep.cpp if (argv[i][1] == 0)
i 1619 pcre/pcregrep.cpp if (argv[i][1] == '-')
i 1621 pcre/pcregrep.cpp char *arg = argv[i] + 2;
i 1626 pcre/pcregrep.cpp i++;
i 1680 pcre/pcregrep.cpp fprintf(stderr, "pcregrep: Unknown option %s\n", argv[i]);
i 1693 pcre/pcregrep.cpp else if (strcmp(argv[i], "-pre") == 0) {
i 1694 pcre/pcregrep.cpp jfriedl_prefix = argv[++i];
i 1696 pcre/pcregrep.cpp } else if (strcmp(argv[i], "-post") == 0) {
i 1697 pcre/pcregrep.cpp jfriedl_postfix = argv[++i];
i 1699 pcre/pcregrep.cpp } else if (strcmp(argv[i], "-XT") == 0) {
i 1700 pcre/pcregrep.cpp sscanf(argv[++i], "%d", &jfriedl_XT);
i 1702 pcre/pcregrep.cpp } else if (strcmp(argv[i], "-XR") == 0) {
i 1703 pcre/pcregrep.cpp sscanf(argv[++i], "%d", &jfriedl_XR);
i 1714 pcre/pcregrep.cpp char *s = argv[i] + 1;
i 1723 pcre/pcregrep.cpp *s, argv[i]);
i 1771 pcre/pcregrep.cpp if (i >= argc - 1 || longopwasequals)
i 1773 pcre/pcregrep.cpp fprintf(stderr, "pcregrep: Data missing after %s\n", argv[i]);
i 1776 pcre/pcregrep.cpp option_data = argv[++i];
i 1969 pcre/pcregrep.cpp if (i >= argc) return usage(2);
i 1970 pcre/pcregrep.cpp patterns[cmd_pattern_count++] = argv[i++];
i 2066 pcre/pcregrep.cpp if (i >= argc)
i 2077 pcre/pcregrep.cpp only_one_at_top = i == argc - 1; /* Catch initial value of i */
i 2079 pcre/pcregrep.cpp for (; i < argc; i++)
i 2081 pcre/pcregrep.cpp int frc = grep_or_recurse(argv[i], dee_action == dee_RECURSE,
i 2090 pcre/pcregrep.cpp for (i = 0; i < pattern_count; i++) free(pattern_list[i]);
i 2095 pcre/pcregrep.cpp for (i = 0; i < hint_count; i++) free(hints_list[i]);
i 325 pcre/pcreposix.cpp size_t i;
i 328 pcre/pcreposix.cpp for (i = 0; i < (size_t)rc; i++)
i 330 pcre/pcreposix.cpp pmatch[i].rm_so = ovector[i*2];
i 331 pcre/pcreposix.cpp pmatch[i].rm_eo = ovector[i*2+1];
i 334 pcre/pcreposix.cpp for (; i < nmatch; i++) pmatch[i].rm_so = pmatch[i].rm_eo = -1;
i 306 pcre/pcretest.cpp int i, j, s;
i 308 pcre/pcretest.cpp for (i = -1; i < 6; i++) /* i is number of additional bytes */
i 314 pcre/pcretest.cpp if (i == -1) { *vptr = c; return 1; } /* ascii character */
i 315 pcre/pcretest.cpp if (i == 0 || i == 6) return 0; /* invalid UTF-8 */
i 319 pcre/pcretest.cpp s = 6*i;
i 320 pcre/pcretest.cpp d = (c & utf8_table3[i]) << s;
i 322 pcre/pcretest.cpp for (j = 0; j < i; j++)
i 334 pcre/pcretest.cpp if (j != i) return -(i+1);
i 339 pcre/pcretest.cpp return i+1;
i 365 pcre/pcretest.cpp register int i, j;
i 366 pcre/pcretest.cpp for (i = 0; i < utf8_table1_size; i++)
i 367 pcre/pcretest.cpp if (cvalue <= utf8_table1[i]) break;
i 368 pcre/pcretest.cpp utf8bytes += i;
i 369 pcre/pcretest.cpp for (j = i; j > 0; j--)
i 374 pcre/pcretest.cpp *utf8bytes = utf8_table2[i] | cvalue;
i 375 pcre/pcretest.cpp return i + 1;
i 456 pcre/pcretest.cpp int i, pre_start, post_start, subject_length;
i 463 pcre/pcretest.cpp for (i = 0; i < cb->capture_top * 2; i += 2)
i 465 pcre/pcretest.cpp if (cb->offset_vector[i] < 0)
i 466 pcre/pcretest.cpp fprintf(f, "%2d: <unset>\n", i/2);
i 469 pcre/pcretest.cpp fprintf(f, "%2d: ", i/2);
i 470 pcre/pcretest.cpp (void)pchars((unsigned char *)cb->subject + cb->offset_vector[i],
i 471 pcre/pcretest.cpp cb->offset_vector[i+1] - cb->offset_vector[i], f);
i 508 pcre/pcretest.cpp for (i = 0; i < pre_start; i++) fprintf(outfile, " ");
i 513 pcre/pcretest.cpp for (i = 0; i < post_start - 1; i++) fprintf(outfile, " ");
i 517 pcre/pcretest.cpp for (i = 0; i < subject_length - pre_start - post_start + 4; i++)
i 1259 pcre/pcretest.cpp register int i;
i 1262 pcre/pcretest.cpp for (i = 0; i < timeit; i++)
i 1323 pcre/pcretest.cpp register int i;
i 1326 pcre/pcretest.cpp for (i = 0; i < timeit; i++)
i 1546 pcre/pcretest.cpp int i;
i 1549 pcre/pcretest.cpp for (i = 0; i < 256; i++)
i 1551 pcre/pcretest.cpp if ((start_bits[i/8] & (1<<(i&7))) != 0)
i 1558 pcre/pcretest.cpp if (PRINTHEX(i) && i != ' ')
i 1560 pcre/pcretest.cpp fprintf(outfile, "%c ", i);
i 1565 pcre/pcretest.cpp fprintf(outfile, "\\x%02x ", i);
i 1694 pcre/pcretest.cpp int i = 0;
i 1711 pcre/pcretest.cpp while (i++ < 2 && isdigit(*p) && *p != '8' && *p != '9')
i 1754 pcre/pcretest.cpp while (i++ < 2 && isxdigit(*p))
i 1987 pcre/pcretest.cpp size_t i;
i 1988 pcre/pcretest.cpp for (i = 0; i < (size_t)use_size_offsets; i++)
i 1990 pcre/pcretest.cpp if (pmatch[i].rm_so >= 0)
i 1992 pcre/pcretest.cpp fprintf(outfile, "%2d: ", (int)i);
i 1993 pcre/pcretest.cpp (void)pchars(dbuffer + pmatch[i].rm_so,
i 1994 pcre/pcretest.cpp pmatch[i].rm_eo - pmatch[i].rm_so, outfile);
i 1996 pcre/pcretest.cpp if (i == 0 && do_showrest)
i 1999 pcre/pcretest.cpp (void)pchars(dbuffer + pmatch[i].rm_eo, len - pmatch[i].rm_eo,
i 2018 pcre/pcretest.cpp register int i;
i 2026 pcre/pcretest.cpp for (i = 0; i < timeitm; i++)
i 2034 pcre/pcretest.cpp for (i = 0; i < timeitm; i++)
i 2116 pcre/pcretest.cpp int i, maxcount;
i 2138 pcre/pcretest.cpp for (i = 0; i < count * 2; i += 2)
i 2140 pcre/pcretest.cpp if (use_offsets[i] < 0)
i 2141 pcre/pcretest.cpp fprintf(outfile, "%2d: <unset>\n", i/2);
i 2144 pcre/pcretest.cpp fprintf(outfile, "%2d: ", i/2);
i 2145 pcre/pcretest.cpp (void)pchars(bptr + use_offsets[i],
i 2146 pcre/pcretest.cpp use_offsets[i+1] - use_offsets[i], outfile);
i 2148 pcre/pcretest.cpp if (i == 0)
i 2153 pcre/pcretest.cpp (void)pchars(bptr + use_offsets[i+1], len - use_offsets[i+1],
i 2161 pcre/pcretest.cpp for (i = 0; i < 32; i++)
i 2163 pcre/pcretest.cpp if ((copystrings & (1 << i)) != 0)
i 2167 pcre/pcretest.cpp i, copybuffer, sizeof(copybuffer));
i 2169 pcre/pcretest.cpp fprintf(outfile, "copy substring %d failed %d\n", i, rc);
i 2171 pcre/pcretest.cpp fprintf(outfile, "%2dC %s (%d)\n", i, copybuffer, rc);
i 2188 pcre/pcretest.cpp for (i = 0; i < 32; i++)
i 2190 pcre/pcretest.cpp if ((getstrings & (1 << i)) != 0)
i 2194 pcre/pcretest.cpp i, &substring);
i 2196 pcre/pcretest.cpp fprintf(outfile, "get substring %d failed %d\n", i, rc);
i 2199 pcre/pcretest.cpp fprintf(outfile, "%2dG %s (%d)\n", i, substring, rc);
i 2230 pcre/pcretest.cpp for (i = 0; i < count; i++)
i 2231 pcre/pcretest.cpp fprintf(outfile, "%2dL %s\n", i, stringlist[i]);
i 2232 pcre/pcretest.cpp if (stringlist[i] != NULL)
i 50 platform/win32/OSDepWin.cpp int *i = (int*)dwUser;
i 51 platform/win32/OSDepWin.cpp *i = 1;
i 47 platform/win32/Vtune.cpp int i = 0;
i 51 platform/win32/Vtune.cpp while(Source[i] != '\0')
i 53 platform/win32/Vtune.cpp Dest[i] = Source[i];
i 54 platform/win32/Vtune.cpp if (Dest[i] == ':') {
i 56 platform/win32/Vtune.cpp j = i;
i 57 platform/win32/Vtune.cpp } else if (Dest[i] == '.') {
i 59 platform/win32/Vtune.cpp j = i;
i 60 platform/win32/Vtune.cpp } else if (Dest[i] == '$') {
i 61 platform/win32/Vtune.cpp j = i;
i 63 platform/win32/Vtune.cpp ++i;
i 68 platform/win32/Vtune.cpp i = 0;
i 71 platform/win32/Vtune.cpp Dest[i++] = Source[j];
i 75 platform/win32/Vtune.cpp Dest[i++] = '(';
i 76 platform/win32/Vtune.cpp Dest[i++] = ')';
i 78 platform/win32/Vtune.cpp while(Source[i] != '\0')
i 80 platform/win32/Vtune.cpp Dest[i] = Source[i];
i 81 platform/win32/Vtune.cpp ++i;
i 85 platform/win32/Vtune.cpp Dest[i] = '\0';
i 216 platform/win32/Vtune.cpp for(int i=0; i<size; i++)
i 218 platform/win32/Vtune.cpp sintptr mdPos = tbl->keyAt(i);
i 219 platform/win32/Vtune.cpp LineNumberRecord* entry = tbl->at(i);
i 60 platform/win32/coff.cpp for(int i=0; i<header.f_nscns; i++)
i 62 platform/win32/coff.cpp mmfx_delete(sections[i]);
i 63 platform/win32/coff.cpp sections[i] = 0;
i 66 platform/win32/coff.cpp for(unsigned int i=0; i<header.f_nsyms; i++)
i 68 platform/win32/coff.cpp mmfx_delete(symbols[i]);
i 69 platform/win32/coff.cpp symbols[i] = 0;
i 107 platform/win32/coff.cpp for(int i=numBytes; i<alignedSize; i++)
i 108 platform/win32/coff.cpp c[i] = 0;
i 135 platform/win32/coff.cpp for(int i=0; i<count; i++)
i 136 platform/win32/coff.cpp dst[i] = src[i];
i 155 platform/win32/coff.cpp for(int i=0; i<header.f_nscns; i++)
i 157 platform/win32/coff.cpp sections[i]->s_scnptr = pos;
i 158 platform/win32/coff.cpp pos += sections[i]->s_size;
i 172 platform/win32/coff.cpp for(unsigned int i=0; i<header.f_nsyms; i++)
i 174 platform/win32/coff.cpp symbols[i]->name.table.offset = pos - strSize; // name's offset into string table
i 175 platform/win32/coff.cpp int* size = (int*)(symbols[i]+1); // the string is stored pascal style (i.e length leads content)
i 189 platform/win32/coff.cpp for(int i=0; i<header.f_nscns; i++)
i 191 platform/win32/coff.cpp sections[i]->s_relptr = pos; // ptr to end of file => no entries
i 192 platform/win32/coff.cpp sections[i]->s_lnnoptr = pos; // ptr to end of file => no entries
i 193 platform/win32/coff.cpp realPos += fwrite(sections[i], 1, sizeof(SectionHeader_t), f);
i 197 platform/win32/coff.cpp for(int i=0; i<header.f_nscns; i++)
i 198 platform/win32/coff.cpp realPos += fwrite(sections[i]+1, 1, sections[i]->s_size, f);
i 201 platform/win32/coff.cpp for(unsigned int i=0; i<header.f_nsyms; i++)
i 202 platform/win32/coff.cpp realPos += fwrite(symbols[i], 1, sizeof(SymbolEntry_t), f);
i 206 platform/win32/coff.cpp for(unsigned int i=0; i<header.f_nsyms; i++)
i 208 platform/win32/coff.cpp int* size = (int*)(symbols[i]+1); // pascal style string after the entry
i 301 shell/ByteArrayGlue.cpp if (i < (uint32_t)m_byteArray.GetLength()) {
i 302 shell/ByteArrayGlue.cpp return core()->intToAtom(m_byteArray[i]);
i 310 shell/ByteArrayGlue.cpp m_byteArray[i] = (U8)(AvmCore::integer(value));
i 130 shell/ByteArrayGlue.h virtual Atom getUintProperty(uint32_t i) const;
i 131 shell/ByteArrayGlue.h virtual void setUintProperty(uint32_t i, Atom value);
i 64 shell/ConsoleOutputStream.cpp int i = Platform::GetInstance()->logMessage(message);
i 68 shell/ConsoleOutputStream.cpp return i;
i 153 shell/DebugCLI.cpp for (int i=0; cmdList[i].text; i++) {
i 154 shell/DebugCLI.cpp if (!VMPI_strncmp(input, cmdList[i].text, inputLen)) {
i 159 shell/DebugCLI.cpp match = i;
i 185 shell/DebugCLI.cpp for (int i=0; cmdList[i].text; i++) {
i 186 shell/DebugCLI.cpp if (!VMPI_strncmp(cmdList[i].text, input, inputLen)) {
i 192 shell/DebugCLI.cpp core->console << cmdList[i].text;
i 203 shell/DebugCLI.cpp for (int i = 0; cmdList[i].text; i++)
i 205 shell/DebugCLI.cpp if (cmdList[i].id == cmdNumber)
i 206 shell/DebugCLI.cpp return cmdList[i].text;
i 247 shell/DebugCLI.cpp for(int i=0; i<count; i++)
i 250 shell/DebugCLI.cpp Stringp nm = info->getArgName(i);
i 255 shell/DebugCLI.cpp if (i<count-1)
i 275 shell/DebugCLI.cpp for(int i=0; i<size; i++)
i 277 shell/DebugCLI.cpp MethodInfo* m = src->functionAt(i);
i 300 shell/DebugCLI.cpp for (int i=0; i<linenum; i++) {
i 378 shell/DebugCLI.cpp for (int i = 0, n = abcCount(); i < n; ++i)
i 380 shell/DebugCLI.cpp AbcFile* abcFile = (AbcFile*)abcAt(i);
i 473 shell/DebugCLI.cpp for(int i=0; i<count; i++)
i 476 shell/DebugCLI.cpp Stringp nm = info->getLocalName(i);
i 480 shell/DebugCLI.cpp core->console << "<local_" << i << ">";
i 534 shell/DebugCLI.cpp for(int i=0; i<count; i++)
i 536 shell/DebugCLI.cpp Stringp arg = info->getArgName(i);
i 540 shell/DebugCLI.cpp Atom a = ease2Atom(to, ptr[i]);
i 542 shell/DebugCLI.cpp core->console << " Type mismatch : current value is " << core->format(ptr[i]);
i 544 shell/DebugCLI.cpp frame->setArgument(i, a);
i 550 shell/DebugCLI.cpp for(int i=0; i<count; i++)
i 552 shell/DebugCLI.cpp Stringp local = info->getLocalName(i);
i 556 shell/DebugCLI.cpp Atom a = ease2Atom(to, ptr[i]);
i 558 shell/DebugCLI.cpp core->console << " Type mismatch : current value is " << core->format(ptr[i]);
i 560 shell/DebugCLI.cpp frame->setLocal(i, a);
i 720 shell/DebugCLI.cpp for(int64_t i=0; i<currentSourceLen-1;i++) {
i 721 shell/DebugCLI.cpp if (currentSource[i] == '\r' && currentSource[i+1] == '\n')
i 722 shell/DebugCLI.cpp currentSource[i] = ' ';
i 106 shell/SystemClass.cpp for (int i=0, n = a->getLength(); i < n; i++)
i 108 shell/SystemClass.cpp if (i > 0)
i 110 shell/SystemClass.cpp StringIndexer s(core->string(a->getUintProperty(i)));
i 175 shell/SystemClass.cpp for(int i=0; i<user_argc;i++)
i 176 shell/SystemClass.cpp array->setUintProperty(i, core->newStringUTF8(user_argv[i])->atom());
i 186 shell/SystemClass.cpp int i=0;
i 189 shell/SystemClass.cpp wc[i++] = (wchar)c;
i 190 shell/SystemClass.cpp if (i == 63) {
i 191 shell/SystemClass.cpp wc[i] = 0;
i 193 shell/SystemClass.cpp i = 0;
i 196 shell/SystemClass.cpp if (i > 0) {
i 197 shell/SystemClass.cpp wc[i] = 0;
i 194 shell/avmshell.cpp for (int i=0 ; i < settings.numfiles ; i++ ) {
i 195 shell/avmshell.cpp int exitCode = shell->evaluateFile(settings, settings.filenames[i]);
i 388 shell/avmshell.cpp for ( int i=0 ; i < numthreads ; i++ ) {
i 389 shell/avmshell.cpp threads[i] = new ThreadNode(state, i);
i 390 shell/avmshell.cpp pthread_create(&threads[i]->thread, NULL, slaveThread, threads[i]);
i 395 shell/avmshell.cpp for ( int i=0 ; i < numcores ; i++ ) {
i 398 shell/avmshell.cpp cores[i] = new CoreNode(new ShellCoreImpl(gc, settings, false), i);
i 399 shell/avmshell.cpp if (!cores[i]->core->setup(settings))
i 404 shell/avmshell.cpp for ( int i=numcores-1 ; i >= 0 ; i-- ) {
i 405 shell/avmshell.cpp cores[i]->next = state.free_cores;
i 406 shell/avmshell.cpp state.free_cores = cores[i];
i 421 shell/avmshell.cpp for ( int i=0 ; i < numthreads ; i++ )
i 422 shell/avmshell.cpp threads[i]->startWork(NULL,NULL);
i 425 shell/avmshell.cpp for ( int i=0 ; i < numthreads ; i++ ) {
i 426 shell/avmshell.cpp pthread_join(threads[i]->thread, NULL);
i 427 shell/avmshell.cpp LOGGING( AvmLog("T%d: joined the main thread\n", i); )
i 432 shell/avmshell.cpp for ( int i=0 ; i < numthreads ; i++ )
i 433 shell/avmshell.cpp delete threads[i];
i 435 shell/avmshell.cpp for ( int i=0 ; i < numcores ; i++ )
i 436 shell/avmshell.cpp delete cores[i];
i 629 shell/avmshell.cpp for (int i=1; i < argc ; i++) {
i 630 shell/avmshell.cpp const char * const arg = argv[i];
i 636 shell/avmshell.cpp settings.filenames = &argv[i];
i 637 shell/avmshell.cpp settings.numfiles = int(&argv[i] - settings.filenames);
i 638 shell/avmshell.cpp i++;
i 639 shell/avmshell.cpp settings.arguments = &argv[i];
i 640 shell/avmshell.cpp settings.numargs = argc - i;
i 678 shell/avmshell.cpp else if (!VMPI_strcmp(arg+2, "astrace") && i+1 < argc ) {
i 679 shell/avmshell.cpp settings.astrace_console = VMPI_strtol(argv[++i], 0, 10);
i 684 shell/avmshell.cpp if (!VMPI_strcmp(argv[i+1],languageNames[j].str)) {
i 690 shell/avmshell.cpp settings.langID = VMPI_atoi(argv[i+1]);
i 692 shell/avmshell.cpp i++;
i 747 shell/avmshell.cpp else if (!VMPI_strcmp(arg, "-cache_bindings") && i+1 < argc) {
i 748 shell/avmshell.cpp settings.cacheSizes.bindings = (uint16_t)VMPI_strtol(argv[++i], 0, 10);
i 750 shell/avmshell.cpp else if (!VMPI_strcmp(arg, "-cache_metadata") && i+1 < argc) {
i 751 shell/avmshell.cpp settings.cacheSizes.metadata = (uint16_t)VMPI_strtol(argv[++i], 0, 10);
i 753 shell/avmshell.cpp else if (!VMPI_strcmp(arg, "-cache_methods") && i+1 < argc ) {
i 754 shell/avmshell.cpp settings.cacheSizes.methods = (uint16_t)VMPI_strtol(argv[++i], 0, 10);
i 762 shell/avmshell.cpp else if (!VMPI_strcmp(arg, "-jitmax") && i+1 < argc ) {
i 766 shell/avmshell.cpp char* val = argv[++i];
i 792 shell/avmshell.cpp else if (!VMPI_strcmp(arg, "-memlimit") && i+1 < argc ) {
i 793 shell/avmshell.cpp MMgc::GCHeap::GetGCHeap()->Config().heapLimit = VMPI_strtol(argv[++i], 0, 10);
i 803 shell/avmshell.cpp else if (!VMPI_strcmp(arg, "-load") && i+1 < argc ) {
i 807 shell/avmshell.cpp const char* val = argv[++i];
i 822 shell/avmshell.cpp else if (!VMPI_strcmp(arg, "-gcwork") && i+1 < argc ) {
i 825 shell/avmshell.cpp const char* val = argv[++i];
i 837 shell/avmshell.cpp const char* val = argv[++i];
i 856 shell/avmshell.cpp else if (!VMPI_strcmp(arg, "-workers") && i+1 < argc ) {
i 857 shell/avmshell.cpp const char *val = argv[++i];
i 891 shell/avmshell.cpp for(i++; i<argc; i++)
i 893 shell/avmshell.cpp if (*argv[i] == ';')
i 896 shell/avmshell.cpp VMPI_strcat(Java::startup_options, argv[i]);
i 909 shell/avmshell.cpp settings.api = VMPI_atoi(argv[i+1]);
i 910 shell/avmshell.cpp i++;
i 921 shell/avmshell.cpp settings.filenames = &argv[i];
i 290 shell/avmshellWin.cpp for(int i=0;i<argc;++i)
i 292 shell/avmshellWin.cpp int len = (wcslen(argv[i])+1) << 1;
i 293 shell/avmshellWin.cpp argArray[i] = (char*) malloc(len);
i 294 shell/avmshellWin.cpp wcstombs(argArray[i], argv[i], len);
i 300 shell/avmshellWin.cpp for(int i=0;i<argc;++i)
i 302 shell/avmshellWin.cpp free(argArray[i]);
i 67 utils/avmc/avmc.cpp for ( int i=1 ; i < argc ; i++ )
i 69 utils/avmc/avmc.cpp char* filename = argv[i];
i 339 utils/superwordprof.c int i;
i 341 utils/superwordprof.c for ( i=0 ; i < INSTRCOUNT ; i++ ) {
i 342 utils/superwordprof.c toplevel[i].opcode = i;
i 343 utils/superwordprof.c toplevel[i].count = 0;
i 344 utils/superwordprof.c toplevel[i].left_child = NULL;
i 345 utils/superwordprof.c toplevel[i].right_sibling = NULL;
i 346 utils/superwordprof.c jumps[i] = 0;
i 347 utils/superwordprof.c operands[i] = 0;
i 348 utils/superwordprof.c iname[i] = "***";
i 528 utils/superwordprof.c i=1;
i 529 utils/superwordprof.c while (i < argc && argv[i][0] == '-') {
i 530 utils/superwordprof.c if (strcmp(argv[i], "-c") == 0) {
i 531 utils/superwordprof.c if (i+1 == argc || sscanf(argv[i+1], "%d", &cutoff_count) != 1) {
i 532 utils/superwordprof.c i=argc;
i 535 utils/superwordprof.c i += 2;
i 537 utils/superwordprof.c else if (strcmp(argv[i], "-l") == 0) {
i 538 utils/superwordprof.c if (i+1 == argc || sscanf(argv[i+1], "%d", &cutoff_length) != 1) {
i 539 utils/superwordprof.c i=argc;
i 542 utils/superwordprof.c i += 2;
i 544 utils/superwordprof.c else if (strcmp(argv[i], "-f") == 0) {
i 546 utils/superwordprof.c i++;
i 548 utils/superwordprof.c else if (strcmp(argv[i], "-h") == 0) {
i 550 utils/superwordprof.c i++;
i 552 utils/superwordprof.c else if (strcmp(argv[i], "-o") == 0) {
i 554 utils/superwordprof.c i++;
i 556 utils/superwordprof.c else if (strcmp(argv[i], "-v") == 0) {
i 558 utils/superwordprof.c i++;
i 561 utils/superwordprof.c i = argc;
i 566 utils/superwordprof.c if (i > argc-2 || (argc - i) % 2 != 0) {
i 578 utils/superwordprof.c while (i < argc) {
i 579 utils/superwordprof.c read_code(argv[i]);
i 580 utils/superwordprof.c read_samples(argv[i+1]);
i 581 utils/superwordprof.c i += 2;
i 799 utils/superwordprof.c int i;
i 802 utils/superwordprof.c for ( i=0 ; i < nexttracker ; i++ ) {
i 803 utils/superwordprof.c trie_t *t = tracker[i];
i 806 utils/superwordprof.c compute_operands(opcodes, op, &opd1, &opd2, i, operand_value, next_symbol);
i 810 utils/superwordprof.c tracker[i] = t->left_child;
i 839 utils/superwordprof.c tracker[i] = t2;
i 897 utils/superwordprof.c unsigned i;
i 899 utils/superwordprof.c for ( i=0 ; i < limit ; i++ ) {
i 900 utils/superwordprof.c if (operand_value[trackeridx][i] == x) {
i 901 utils/superwordprof.c symbol = i+1;
i 933 utils/superwordprof.c int i, j, ki, kj;
i 935 utils/superwordprof.c for ( i=0 ; i < INSTRCOUNT ; i++ )
i 936 utils/superwordprof.c descend(&toplevel[i], 0);
i 940 utils/superwordprof.c for ( i=0 ; i < nextseq ; i++ ) {
i 941 utils/superwordprof.c for ( j=i+1 ; j < nextseq && seqs[i].count == seqs[j].count ; j++ ) {
i 942 utils/superwordprof.c if (seqs[j].length < seqs[i].length) {
i 943 utils/superwordprof.c for ( ki=seqs[i].length-1, kj=seqs[j].length-1 ; kj >= 0 && seqs[i].opcode[ki] == seqs[j].opcode[kj] ; ki--, kj-- )
i 953 utils/superwordprof.c for ( i=0 ; i < nextseq ; i++ )
i 954 utils/superwordprof.c if (!seqs[i].suffix)
i 955 utils/superwordprof.c seqs[j++] = seqs[i];
i 961 utils/superwordprof.c for ( i=0 ; i < nextseq ; i++ )
i 962 utils/superwordprof.c printseq(i, 0);
i 976 utils/superwordprof.c for ( i=0 ; i < nextseq ; i++ ) {
i 977 utils/superwordprof.c if (!seqs[i].suffix) {
i 978 utils/superwordprof.c printseq(i, 0);
i 979 utils/superwordprof.c printhseq(i, 1);
i 989 utils/superwordprof.c l=seqs[i].length;
i 990 utils/superwordprof.c for ( j=i+1 ; j < nextseq ; j++ ) {
i 994 utils/superwordprof.c if (seqs[i].opcode[k] != seqs[j].opcode[k])
i 1008 utils/superwordprof.c printf("%11d | ", seqs[i].count);
i 1012 utils/superwordprof.c for ( j=0 ; j < seqs[i].length ; j++ ) {
i 1013 utils/superwordprof.c printf("%s", iname[seqs[i].opcode[j]]);
i 1014 utils/superwordprof.c if (seqs[i].operand1[j] != 0) {
i 1015 utils/superwordprof.c printf("[%d", seqs[i].operand1[j]);
i 1016 utils/superwordprof.c if (seqs[i].operand2[j] != 0)
i 1017 utils/superwordprof.c printf(",%d", seqs[i].operand2[j]);
i 1025 utils/superwordprof.c for ( j=0 ; j < seqs[i].length ; j++ )
i 1026 utils/superwordprof.c printf("%s ", iname[seqs[i].opcode[j]]);
i 1029 utils/superwordprof.c for ( j=0 ; j < seqs[i].length ; j++ )
i 1030 utils/superwordprof.c printf("%x ", seqs[i].opcode[j]);
i 251 utils/wmremote/ceremoteshell/ceremoteshell.cpp for (int i=1;i<argc;i++) {
i 253 utils/wmremote/ceremoteshell/ceremoteshell.cpp if (!strcmp("-log",argv[i])) {
i 256 utils/wmremote/ceremoteshell/ceremoteshell.cpp if (strlen(argv[i])>7) {
i 257 utils/wmremote/ceremoteshell/ceremoteshell.cpp strncpy(str1,argv[i],8);
i 260 utils/wmremote/ceremoteshell/ceremoteshell.cpp strcpy(shell,argv[i]+8);
i 265 utils/wmremote/ceremoteshell/ceremoteshell.cpp if (argv[i][0]!='-') {
i 266 utils/wmremote/ceremoteshell/ceremoteshell.cpp hFile = CreateFile(argv[i],GENERIC_READ, FILE_SHARE_READ, NULL, OPEN_EXISTING, FILE_ATTRIBUTE_NORMAL, NULL);
i 280 utils/wmremote/ceremoteshell/ceremoteshell.cpp if (strrchr(argv[i],'/')!=NULL) {
i 281 utils/wmremote/ceremoteshell/ceremoteshell.cpp strcat(dest,strrchr(argv[i],'/')+1);
i 282 utils/wmremote/ceremoteshell/ceremoteshell.cpp } else if (strrchr(argv[i],'\\')!=NULL) {
i 283 utils/wmremote/ceremoteshell/ceremoteshell.cpp strcat(dest,strrchr(argv[i],'\\')+1);
i 285 utils/wmremote/ceremoteshell/ceremoteshell.cpp strcat(dest,argv[i]);
i 291 utils/wmremote/ceremoteshell/ceremoteshell.cpp copyFileToDevice(argv[i],dest);
i 293 utils/wmremote/ceremoteshell/ceremoteshell.cpp if (i<argc-1)
i 298 utils/wmremote/ceremoteshell/ceremoteshell.cpp strcat(cmdline,argv[i]);
i 299 utils/wmremote/ceremoteshell/ceremoteshell.cpp if (i<argc-1) {
i 416 utils/wmremote/wmrunner/wmrunner.cpp int i=0;
i 417 utils/wmremote/wmrunner/wmrunner.cpp for (;space<count-1;space++,i++) {
i 418 utils/wmremote/wmrunner/wmrunner.cpp msg[i]=data[space];
i 420 utils/wmremote/wmrunner/wmrunner.cpp msg[i-1]='\0';
i 445 utils/wmremote/wmrunner/wmrunner.cpp for (uint i=0;i<_tcslen(last);i++) {
i 446 utils/wmremote/wmrunner/wmrunner.cpp if (last[i]=='_') {
i 447 utils/wmremote/wmrunner/wmrunner.cpp last[i]=' ';
i 70 vprof/testVprofMT.c int i;
i 72 vprof/testVprofMT.c for (i = 0; i < COUNT; i++) {
i 75 vprof/testVprofMT.c _vprof (i);
i 82 vprof/testVprofMT.c if (i % 2 == 0) {
i 89 vprof/testVprofMT.c _vprof (i, cProbe);
i 101 vprof/testVprofMT.c int i;
i 105 vprof/testVprofMT.c for (i = 0; i < THREADS; i++) {
i 106 vprof/testVprofMT.c array[i] = CreateThread(0, 0, (LPTHREAD_START_ROUTINE)sub, (LPVOID)i, 0, 0);
i 109 vprof/testVprofMT.c for (i = 0; i < THREADS; i++) {
i 110 vprof/testVprofMT.c WaitForSingleObject(array[i], INFINITE);