| /dports/games/holotz-castle/holotz-castle-1.3.14-src/JLib/JLib/Util/ |
| H A D | JList.h | 161 nextFree = 0; in PushFront()
167 ++nextFree; in PushFront()
178 nextFree = 0; in PushBack()
184 ++nextFree; in PushBack()
196 nextFree = 0; in Insert()
202 ++nextFree; in Insert()
255 if (--nextFree == 0) in PopBack()
257 nextFree = grow; in PopBack()
283 if (--nextFree == 0) in PopFront()
285 nextFree = grow; in PopFront()
[all …]
|
| /dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/ |
| H A D | IntDeque.java | 33 private int nextFree = 0; field in IntDeque
40 if (nextFree == deque.length) { in push()
41 final int[] newDeque = new int[nextFree * 2]; in push()
42 System.arraycopy(deque, 0, newDeque, 0, nextFree); in push()
45 deque[nextFree++] = value; in push()
53 return deque[--nextFree]; in pop()
61 return deque[nextFree - 1]; in peek()
69 return deque[nextFree - 1]++; in getAndIncrement()
77 return --deque[nextFree - 1]; in decrementAndGet()
85 return nextFree == 0; in isEmpty()
|
| /dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/ |
| H A D | IntDeque.java | 33 private int nextFree = 0; field in IntDeque
40 if (nextFree == deque.length) { in push()
41 final int[] newDeque = new int[nextFree * 2]; in push()
42 System.arraycopy(deque, 0, newDeque, 0, nextFree); in push()
45 deque[nextFree++] = value; in push()
53 return deque[--nextFree]; in pop()
61 return deque[nextFree - 1]; in peek()
69 return deque[nextFree - 1]++; in getAndIncrement()
77 return --deque[nextFree - 1]; in decrementAndGet()
85 return nextFree == 0; in isEmpty()
|
| /dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/ |
| H A D | IntDeque.java | 33 private int nextFree = 0; field in IntDeque
40 if (nextFree == deque.length) { in push()
41 final int[] newDeque = new int[nextFree * 2]; in push()
42 System.arraycopy(deque, 0, newDeque, 0, nextFree); in push()
45 deque[nextFree++] = value; in push()
53 return deque[--nextFree]; in pop()
61 return deque[nextFree - 1]; in peek()
69 return deque[nextFree - 1]++; in getAndIncrement()
77 return --deque[nextFree - 1]; in decrementAndGet()
85 return nextFree == 0; in isEmpty()
|
| /dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/ |
| H A D | IntDeque.java | 33 private int nextFree = 0; field in IntDeque
40 if (nextFree == deque.length) { in push()
41 final int[] newDeque = new int[nextFree * 2]; in push()
42 System.arraycopy(deque, 0, newDeque, 0, nextFree); in push()
45 deque[nextFree++] = value; in push()
53 return deque[--nextFree]; in pop()
61 return deque[nextFree - 1]; in peek()
69 return deque[nextFree - 1]++; in getAndIncrement()
77 return --deque[nextFree - 1]; in decrementAndGet()
85 return nextFree == 0; in isEmpty()
|
| /dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/ |
| H A D | IntDeque.java | 33 private int nextFree = 0; field in IntDeque
40 if (nextFree == deque.length) { in push()
41 final int[] newDeque = new int[nextFree * 2]; in push()
42 System.arraycopy(deque, 0, newDeque, 0, nextFree); in push()
45 deque[nextFree++] = value; in push()
53 return deque[--nextFree]; in pop()
61 return deque[nextFree - 1]; in peek()
69 return deque[nextFree - 1]++; in getAndIncrement()
77 return --deque[nextFree - 1]; in decrementAndGet()
85 return nextFree == 0; in isEmpty()
|
| /dports/java/openjdk8/jdk8u-jdk8u312-b07.1/nashorn/src/jdk/nashorn/internal/ |
| H A D | IntDeque.java | 33 private int nextFree = 0; field in IntDeque
40 if (nextFree == deque.length) { in push()
41 final int[] newDeque = new int[nextFree * 2]; in push()
42 System.arraycopy(deque, 0, newDeque, 0, nextFree); in push()
45 deque[nextFree++] = value; in push()
53 return deque[--nextFree]; in pop()
61 return deque[nextFree - 1]; in peek()
69 return deque[nextFree - 1]++; in getAndIncrement()
77 return --deque[nextFree - 1]; in decrementAndGet()
85 return nextFree == 0; in isEmpty()
|
| /dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/nashorn/src/jdk/nashorn/internal/ |
| H A D | IntDeque.java | 33 private int nextFree = 0; field in IntDeque
40 if (nextFree == deque.length) { in push()
41 final int[] newDeque = new int[nextFree * 2]; in push()
42 System.arraycopy(deque, 0, newDeque, 0, nextFree); in push()
45 deque[nextFree++] = value; in push()
53 return deque[--nextFree]; in pop()
61 return deque[nextFree - 1]; in peek()
69 return deque[nextFree - 1]++; in getAndIncrement()
77 return --deque[nextFree - 1]; in decrementAndGet()
85 return nextFree == 0; in isEmpty()
|
| /dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/rt.equinox.bundles/bundles/org.eclipse.equinox.util/src/org/eclipse/equinox/internal/util/pool/ |
| H A D | ObjectPool.java | 29 protected int nextFree; field in ObjectPool
94 nextFree = -1; in ObjectPool()
124 nextFree = i * j;
138 for (; nextFree > count; nextFree--) {
139 buff[(nextFree / factor)][nextFree % factor] = null;
153 if (nextFree < 0) {
166 tmp = buff[(nextFree / factor)][(nextFree % factor)];
167 buff[(nextFree / factor)][nextFree % factor] = null;
168 nextFree--;
180 int tmp = nextFree + 1;
[all …]
|
| /dports/converters/wkhtmltopdf/qt-5db36ec/src/3rdparty/webkit/Source/ThirdParty/ANGLE/src/compiler/preprocessor/ |
| H A D | atom.c | 108 int nextFree; member
123 stable->nextFree = 1; in InitStringTable()
138 stable->nextFree = 0; in FreeStringTable()
192 loc = stable->nextFree; in AddString()
305 int nextFree; member
384 atable->arev[atable->nextFree] = lReverse(atable->nextFree); in AllocateAtom()
385 atable->nextFree++; in AllocateAtom()
476 for (ii = atable->nextFree; ii < oldtable.nextFree; ii++) { in IncreaseHashTableSize()
609 atable->arev[atable->nextFree] = lReverse(atable->nextFree); in AddAtomFixed()
630 atable->nextFree = 0; in InitAtomTable()
[all …]
|
| /dports/devel/fossology-nomos-standalone/fossology-3.11.0/src/nomos/agent_tests/testdata/NomosTestfiles/Nvidia/ |
| H A D | atom.c | 108 int nextFree; member
123 stable->nextFree = 1; in InitStringTable()
138 stable->nextFree = 0; in FreeStringTable()
192 loc = stable->nextFree; in AddString()
305 int nextFree; member
384 atable->arev[atable->nextFree] = lReverse(atable->nextFree); in AllocateAtom()
385 atable->nextFree++; in AllocateAtom()
476 for (ii = atable->nextFree; ii < oldtable.nextFree; ii++) { in IncreaseHashTableSize()
609 atable->arev[atable->nextFree] = lReverse(atable->nextFree); in AddAtomFixed()
630 atable->nextFree = 0; in InitAtomTable()
[all …]
|
| /dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.platform.resources/bundles/org.eclipse.core.resources/src/org/eclipse/core/internal/resources/ |
| H A D | MarkerDeltaManager.java | 35 private int nextFree = 0; field in MarkerDeltaManager
43 for (int i = 0; i < nextFree; i++) in assembleDeltas()
56 for (; startOffset < nextFree; startOffset++) in resetDeltas()
64 if (startIds.length > DEFAULT_SIZE && (nextFree - startOffset < DEFAULT_SIZE)) { in resetDeltas()
69 int remaining = nextFree - startOffset; in resetDeltas()
77 nextFree = remaining; in resetDeltas()
83 if (nextFree >= len) { in newGeneration()
91 startIds[nextFree] = start; in newGeneration()
92 batches[nextFree] = new HashMap<>(11); in newGeneration()
93 return batches[nextFree++]; in newGeneration()
|
| /dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.platform.resources/bundles/org.eclipse.core.resources/src/org/eclipse/core/internal/dtree/ |
| H A D | DataTreeLookup.java | 36 private static int nextFree = 0; field in DataTreeLookup
58 instance = instancePool[nextFree]; in newLookup()
59 nextFree = ++nextFree % POOL_SIZE; in newLookup()
74 instance = instancePool[nextFree]; in newLookup()
75 nextFree = ++nextFree % POOL_SIZE; in newLookup()
|
| /dports/devel/valgrind-lts/valgrind-dragonfly-dragonfly/coregrind/ |
| H A D | m_poolalloc.c | 48 void* nextFree; member
74 pa->nextFree = NULL; in VG_()
97 vg_assert(pa->nextFree == NULL); in pal_add_new_pool()
106 *elem = (UWord)pa->nextFree; in pal_add_new_pool()
107 pa->nextFree = elem; in pal_add_new_pool()
122 if (UNLIKELY(pa->nextFree == NULL)) { in VG_()
125 elem = pa->nextFree; in VG_()
126 pa->nextFree = (void*)*elem; in VG_()
134 *elem = (UWord)pa->nextFree; in VG_()
135 pa->nextFree = elem; in VG_()
|
| /dports/devel/valgrind/valgrind-dragonfly-dragonfly/coregrind/ |
| H A D | m_poolalloc.c | 48 void* nextFree; member
74 pa->nextFree = NULL; in VG_()
97 vg_assert(pa->nextFree == NULL); in pal_add_new_pool()
106 *elem = (UWord)pa->nextFree; in pal_add_new_pool()
107 pa->nextFree = elem; in pal_add_new_pool()
122 if (UNLIKELY(pa->nextFree == NULL)) { in VG_()
125 elem = pa->nextFree; in VG_()
126 pa->nextFree = (void*)*elem; in VG_()
134 *elem = (UWord)pa->nextFree; in VG_()
135 pa->nextFree = elem; in VG_()
|
| /dports/emulators/qemu-utils/qemu-4.2.1/roms/u-boot-sam460ex/arch/arm/cpu/ixp/npe/ |
| H A D | IxEthDBMem.c | 99 freeNode->nextFree = nodePool; in ixEthDBInitMemoryPools()
110 freeDescriptor->nextFree = macPool; in ixEthDBInitMemoryPools()
121 freeNode->nextFree = treePool; in ixEthDBInitMemoryPools()
145 nodePool = nodePool->nextFree; in ixEthDBAllocHashNode()
169 hashNode->nextFree = nodePool; in ixEthDBFreeHashNode()
258 macDescriptor->nextFree = macPool; in ixEthDBPoolFreeMacDescriptor()
352 treePool = treePool->nextFree; in ixEthDBAllocMacTreeNode()
379 macNode->nextFree = treePool; in ixEthDBPoolFreeMacTreeNode()
534 mac = mac->nextFree; in ixEthDBShowMemoryStatus()
546 tree = tree->nextFree; in ixEthDBShowMemoryStatus()
[all …]
|
| /dports/emulators/qemu5/qemu-5.2.0/roms/u-boot-sam460ex/arch/arm/cpu/ixp/npe/ |
| H A D | IxEthDBMem.c | 99 freeNode->nextFree = nodePool; in ixEthDBInitMemoryPools()
110 freeDescriptor->nextFree = macPool; in ixEthDBInitMemoryPools()
121 freeNode->nextFree = treePool; in ixEthDBInitMemoryPools()
145 nodePool = nodePool->nextFree; in ixEthDBAllocHashNode()
169 hashNode->nextFree = nodePool; in ixEthDBFreeHashNode()
258 macDescriptor->nextFree = macPool; in ixEthDBPoolFreeMacDescriptor()
352 treePool = treePool->nextFree; in ixEthDBAllocMacTreeNode()
379 macNode->nextFree = treePool; in ixEthDBPoolFreeMacTreeNode()
534 mac = mac->nextFree; in ixEthDBShowMemoryStatus()
546 tree = tree->nextFree; in ixEthDBShowMemoryStatus()
[all …]
|
| /dports/emulators/qemu-powernv/qemu-powernv-3.0.50/roms/u-boot-sam460ex/arch/arm/cpu/ixp/npe/ |
| H A D | IxEthDBMem.c | 99 freeNode->nextFree = nodePool; in ixEthDBInitMemoryPools()
110 freeDescriptor->nextFree = macPool; in ixEthDBInitMemoryPools()
121 freeNode->nextFree = treePool; in ixEthDBInitMemoryPools()
145 nodePool = nodePool->nextFree; in ixEthDBAllocHashNode()
169 hashNode->nextFree = nodePool; in ixEthDBFreeHashNode()
258 macDescriptor->nextFree = macPool; in ixEthDBPoolFreeMacDescriptor()
352 treePool = treePool->nextFree; in ixEthDBAllocMacTreeNode()
379 macNode->nextFree = treePool; in ixEthDBPoolFreeMacTreeNode()
534 mac = mac->nextFree; in ixEthDBShowMemoryStatus()
546 tree = tree->nextFree; in ixEthDBShowMemoryStatus()
[all …]
|
| /dports/emulators/qemu-guest-agent/qemu-5.0.1/roms/u-boot-sam460ex/arch/arm/cpu/ixp/npe/ |
| H A D | IxEthDBMem.c | 99 freeNode->nextFree = nodePool; in ixEthDBInitMemoryPools()
110 freeDescriptor->nextFree = macPool; in ixEthDBInitMemoryPools()
121 freeNode->nextFree = treePool; in ixEthDBInitMemoryPools()
145 nodePool = nodePool->nextFree; in ixEthDBAllocHashNode()
169 hashNode->nextFree = nodePool; in ixEthDBFreeHashNode()
258 macDescriptor->nextFree = macPool; in ixEthDBPoolFreeMacDescriptor()
352 treePool = treePool->nextFree; in ixEthDBAllocMacTreeNode()
379 macNode->nextFree = treePool; in ixEthDBPoolFreeMacTreeNode()
534 mac = mac->nextFree; in ixEthDBShowMemoryStatus()
546 tree = tree->nextFree; in ixEthDBShowMemoryStatus()
[all …]
|
| /dports/emulators/qemu42/qemu-4.2.1/roms/u-boot-sam460ex/arch/arm/cpu/ixp/npe/ |
| H A D | IxEthDBMem.c | 99 freeNode->nextFree = nodePool; in ixEthDBInitMemoryPools()
110 freeDescriptor->nextFree = macPool; in ixEthDBInitMemoryPools()
121 freeNode->nextFree = treePool; in ixEthDBInitMemoryPools()
145 nodePool = nodePool->nextFree; in ixEthDBAllocHashNode()
169 hashNode->nextFree = nodePool; in ixEthDBFreeHashNode()
258 macDescriptor->nextFree = macPool; in ixEthDBPoolFreeMacDescriptor()
352 treePool = treePool->nextFree; in ixEthDBAllocMacTreeNode()
379 macNode->nextFree = treePool; in ixEthDBPoolFreeMacTreeNode()
534 mac = mac->nextFree; in ixEthDBShowMemoryStatus()
546 tree = tree->nextFree; in ixEthDBShowMemoryStatus()
[all …]
|
| /dports/emulators/qemu/qemu-6.2.0/roms/u-boot-sam460ex/arch/arm/cpu/ixp/npe/ |
| H A D | IxEthDBMem.c | 99 freeNode->nextFree = nodePool; in ixEthDBInitMemoryPools()
110 freeDescriptor->nextFree = macPool; in ixEthDBInitMemoryPools()
121 freeNode->nextFree = treePool; in ixEthDBInitMemoryPools()
145 nodePool = nodePool->nextFree; in ixEthDBAllocHashNode()
169 hashNode->nextFree = nodePool; in ixEthDBFreeHashNode()
258 macDescriptor->nextFree = macPool; in ixEthDBPoolFreeMacDescriptor()
352 treePool = treePool->nextFree; in ixEthDBAllocMacTreeNode()
379 macNode->nextFree = treePool; in ixEthDBPoolFreeMacTreeNode()
534 mac = mac->nextFree; in ixEthDBShowMemoryStatus()
546 tree = tree->nextFree; in ixEthDBShowMemoryStatus()
[all …]
|
| /dports/emulators/qemu60/qemu-6.0.0/roms/u-boot-sam460ex/arch/arm/cpu/ixp/npe/ |
| H A D | IxEthDBMem.c | 99 freeNode->nextFree = nodePool; in ixEthDBInitMemoryPools()
110 freeDescriptor->nextFree = macPool; in ixEthDBInitMemoryPools()
121 freeNode->nextFree = treePool; in ixEthDBInitMemoryPools()
145 nodePool = nodePool->nextFree; in ixEthDBAllocHashNode()
169 hashNode->nextFree = nodePool; in ixEthDBFreeHashNode()
258 macDescriptor->nextFree = macPool; in ixEthDBPoolFreeMacDescriptor()
352 treePool = treePool->nextFree; in ixEthDBAllocMacTreeNode()
379 macNode->nextFree = treePool; in ixEthDBPoolFreeMacTreeNode()
534 mac = mac->nextFree; in ixEthDBShowMemoryStatus()
546 tree = tree->nextFree; in ixEthDBShowMemoryStatus()
[all …]
|
| /dports/games/spring/spring_98.0/rts/System/ |
| H A D | MemPool.cpp | 11 nextFree[a] = NULL; in CMemPool()
21 void* pnt = nextFree[numBytes]; in Alloc()
24 nextFree[numBytes] = (*(void**)pnt); in Alloc()
35 nextFree[numBytes] = (*(void**)pnt); in Alloc()
51 *(void**)pnt = nextFree[numBytes]; in Free()
52 nextFree[numBytes] = pnt; in Free()
|
| /dports/editors/libreoffice/libreoffice-7.2.6.2/include/o3tl/ |
| H A D | vector_pool.hxx | 50 mnFirstFreeIndex = this->at(mnFirstFreeIndex).nextFree; in store()
52 this->at(nIdx).nextFree = -1; in store()
65 this->at(nIdx).nextFree = mnFirstFreeIndex; in free()
85 nextFree(-1) in type()
89 nextFree(-1) in type()
93 std::ptrdiff_t nextFree; member
|
| /dports/editors/libreoffice6/libreoffice-6.4.7.2/include/o3tl/ |
| H A D | vector_pool.hxx | 50 mnFirstFreeIndex = this->at(mnFirstFreeIndex).nextFree; in store()
52 this->at(nIdx).nextFree = -1; in store()
65 this->at(nIdx).nextFree = mnFirstFreeIndex; in free()
85 nextFree(-1) in type()
89 nextFree(-1) in type()
93 std::ptrdiff_t nextFree; member
|