Home
last modified time | relevance | path

Searched refs:queueTail (Results 1 – 25 of 86) sorted by relevance

1234

/dports/textproc/sonic/sonic-1.3.0/cargo-crates/librocksdb-sys-6.7.4/zstd/lib/common/
H A Dpool.c41 size_t queueTail; member
83 ctx->queueEmpty = ctx->queueHead == ctx->queueTail; in POOL_thread()
119 ctx->queueTail = 0; in POOL_create_advanced()
189 return ctx->queueHead == ((ctx->queueTail + 1) % ctx->queueSize); in isQueueFull()
210 ctx->queue[ctx->queueTail] = job; in POOL_add()
211 ctx->queueTail = (ctx->queueTail + 1) % ctx->queueSize; in POOL_add()
/dports/lang/kawa/kawa-3.1.1/gnu/kawa/io/
H A DPrettyWriter.java358 int queueTail; field in PrettyWriter
1266 int op = queueTail; in indexColumn()
1300 int op = queueTail; in expandTabs()
1422 queueTail = 0; in maybeOutput()
1423 int next = queueTail; in maybeOutput()
1554 queueTail = next; in maybeOutput()
1582 queueTail = next + size; in maybeOutput()
1752 int tail = queueTail; in outputPartialLine()
1760 queueTail = tail; in outputPartialLine()
1804 int tail = queueTail; in resolveBackReferences()
[all …]
/dports/devel/raknet/raknet-3.9.2_10,1/Source/
H A DDS_Multilist.h235 _IndexType queueTail; variable
263 queueTail=0; in Multilist()
303 queueTail=dataSize; in CopySource()
358 queueTail = 0; in Push()
503 if (queueTail==0) in PopOpposite()
506 --queueTail; in PopOpposite()
524 if (queueTail==0) in PeekOpposite()
558 queueTail = 0; in InsertAtIndex()
646 --queueTail; in RemoveAtIndex()
784 queueTail=0; in Clear()
[all …]
/dports/security/hashcat/hashcat-6.2.5/deps/xxHash/tests/collisions/
H A Dpool.c55 size_t queueTail; member
101 ctx->queueEmpty = ctx->queueHead == ctx->queueTail; in POOL_thread()
135 ctx->queueTail = 0; in POOL_create()
251 return ctx->queueHead == ((ctx->queueTail + 1) % ctx->queueSize); in isQueueFull()
266 ctx->queue[ctx->queueTail] = job; in POOL_add_internal()
267 ctx->queueTail = (ctx->queueTail + 1) % ctx->queueSize; in POOL_add_internal()
/dports/security/hashcat/hashcat-6.2.5/deps/git/xxHash/tests/collisions/
H A Dpool.c55 size_t queueTail; member
101 ctx->queueEmpty = ctx->queueHead == ctx->queueTail; in POOL_thread()
135 ctx->queueTail = 0; in POOL_create()
251 return ctx->queueHead == ((ctx->queueTail + 1) % ctx->queueSize); in isQueueFull()
266 ctx->queue[ctx->queueTail] = job; in POOL_add_internal()
267 ctx->queueTail = (ctx->queueTail + 1) % ctx->queueSize; in POOL_add_internal()
/dports/devel/xxhash/xxHash-0.8.0/tests/collisions/
H A Dpool.c55 size_t queueTail; member
101 ctx->queueEmpty = ctx->queueHead == ctx->queueTail; in POOL_thread()
135 ctx->queueTail = 0; in POOL_create()
251 return ctx->queueHead == ((ctx->queueTail + 1) % ctx->queueSize); in isQueueFull()
266 ctx->queue[ctx->queueTail] = job; in POOL_add_internal()
267 ctx->queueTail = (ctx->queueTail + 1) % ctx->queueSize; in POOL_add_internal()
/dports/games/moonlight-embedded/moonlight-embedded-2.4.11/third_party/moonlight-common-c/src/
H A DRtpReorderQueue.c47 queue->queueHead = queue->queueTail = newEntry; in queuePacket()
59 PRTP_QUEUE_ENTRY oldTail = queue->queueTail; in queuePacket()
63 queue->queueTail = newEntry; in queuePacket()
110 LC_ASSERT(queue->queueTail != NULL); in removeEntry()
115 if (queue->queueTail == entry) { in removeEntry()
116 queue->queueTail = entry->prev; in removeEntry()
/dports/lang/gcc6-aux/gcc-6-20180516/libjava/classpath/java/awt/
H A DEventQueue.java102 AWTEvent queueTail; field in EventQueue.Queue
214 q.queueTail = null; in getNextEventImpl()
365 if (q.queueTail == qevt) in postEventImpl()
366 q.queueTail = coalescedEvt; in postEventImpl()
380 q.queueTail = evt; in postEventImpl()
385 q.queueTail.queueNext = evt; in postEventImpl()
386 q.queueTail = evt; in postEventImpl()
/dports/devel/sccache/sccache-0.2.15/cargo-crates/zstd-sys-1.4.19+zstd.1.4.8/zstd/lib/common/
H A Dpool.c44 size_t queueTail; member
89 ctx->queueEmpty = ctx->queueHead == ctx->queueTail; in POOL_thread()
131 ctx->queueTail = 0; in POOL_create_advanced()
252 return ctx->queueHead == ((ctx->queueTail + 1) % ctx->queueSize); in isQueueFull()
267 ctx->queue[ctx->queueTail] = job; in POOL_add_internal()
268 ctx->queueTail = (ctx->queueTail + 1) % ctx->queueSize; in POOL_add_internal()
/dports/emulators/ppsspp/ppsspp-1.12.3/ext/zstd/lib/common/
H A Dpool.c44 size_t queueTail; member
89 ctx->queueEmpty = ctx->queueHead == ctx->queueTail; in POOL_thread()
131 ctx->queueTail = 0; in POOL_create_advanced()
252 return ctx->queueHead == ((ctx->queueTail + 1) % ctx->queueSize); in isQueueFull()
267 ctx->queue[ctx->queueTail] = job; in POOL_add_internal()
268 ctx->queueTail = (ctx->queueTail + 1) % ctx->queueSize; in POOL_add_internal()
/dports/archivers/p5-Compress-Zstd/Compress-Zstd-0.20/ext/zstd/lib/common/
H A Dpool.c44 size_t queueTail; member
89 ctx->queueEmpty = ctx->queueHead == ctx->queueTail; in POOL_thread()
127 ctx->queueTail = 0; in POOL_create_advanced()
242 return ctx->queueHead == ((ctx->queueTail + 1) % ctx->queueSize); in isQueueFull()
257 ctx->queue[ctx->queueTail] = job; in POOL_add_internal()
258 ctx->queueTail = (ctx->queueTail + 1) % ctx->queueSize; in POOL_add_internal()
/dports/archivers/py-borgbackup/borgbackup-1.1.17/src/borg/algorithms/zstd/lib/common/
H A Dpool.c44 size_t queueTail; member
89 ctx->queueEmpty = ctx->queueHead == ctx->queueTail; in POOL_thread()
127 ctx->queueTail = 0; in POOL_create_advanced()
246 return ctx->queueHead == ((ctx->queueTail + 1) % ctx->queueSize); in isQueueFull()
261 ctx->queue[ctx->queueTail] = job; in POOL_add_internal()
262 ctx->queueTail = (ctx->queueTail + 1) % ctx->queueSize; in POOL_add_internal()
/dports/archivers/zstd/zstd-1.5.0/lib/common/
H A Dpool.c44 size_t queueTail; member
89 ctx->queueEmpty = ctx->queueHead == ctx->queueTail; in POOL_thread()
131 ctx->queueTail = 0; in POOL_create_advanced()
252 return ctx->queueHead == ((ctx->queueTail + 1) % ctx->queueSize); in isQueueFull()
267 ctx->queue[ctx->queueTail] = job; in POOL_add_internal()
268 ctx->queueTail = (ctx->queueTail + 1) % ctx->queueSize; in POOL_add_internal()
/dports/archivers/py-zstd/zstd-1.5.0.4/zstd/lib/common/
H A Dpool.c44 size_t queueTail; member
89 ctx->queueEmpty = ctx->queueHead == ctx->queueTail; in POOL_thread()
131 ctx->queueTail = 0; in POOL_create_advanced()
252 return ctx->queueHead == ((ctx->queueTail + 1) % ctx->queueSize); in isQueueFull()
267 ctx->queue[ctx->queueTail] = job; in POOL_add_internal()
268 ctx->queueTail = (ctx->queueTail + 1) % ctx->queueSize; in POOL_add_internal()
/dports/graphics/aloadimage/arcan-0.6.1/src/a12/external/zstd/common/
H A Dpool.c44 size_t queueTail; member
89 ctx->queueEmpty = ctx->queueHead == ctx->queueTail; in POOL_thread()
131 ctx->queueTail = 0; in POOL_create_advanced()
252 return ctx->queueHead == ((ctx->queueTail + 1) % ctx->queueSize); in isQueueFull()
267 ctx->queue[ctx->queueTail] = job; in POOL_add_internal()
268 ctx->queueTail = (ctx->queueTail + 1) % ctx->queueSize; in POOL_add_internal()
/dports/converters/p5-Sereal-Decoder/Sereal-Decoder-4.018/zstd/common/
H A Dpool.c44 size_t queueTail; member
89 ctx->queueEmpty = ctx->queueHead == ctx->queueTail; in POOL_thread()
127 ctx->queueTail = 0; in POOL_create_advanced()
246 return ctx->queueHead == ((ctx->queueTail + 1) % ctx->queueSize); in isQueueFull()
261 ctx->queue[ctx->queueTail] = job; in POOL_add_internal()
262 ctx->queueTail = (ctx->queueTail + 1) % ctx->queueSize; in POOL_add_internal()
/dports/converters/p5-Sereal-Encoder/Sereal-Encoder-4.018/zstd/common/
H A Dpool.c44 size_t queueTail; member
89 ctx->queueEmpty = ctx->queueHead == ctx->queueTail; in POOL_thread()
127 ctx->queueTail = 0; in POOL_create_advanced()
246 return ctx->queueHead == ((ctx->queueTail + 1) % ctx->queueSize); in isQueueFull()
261 ctx->queue[ctx->queueTail] = job; in POOL_add_internal()
262 ctx->queueTail = (ctx->queueTail + 1) % ctx->queueSize; in POOL_add_internal()
/dports/databases/percona57-server/percona-server-5.7.36-39/storage/rocksdb/third_party/zstd/lib/common/
H A Dpool.c44 size_t queueTail; member
89 ctx->queueEmpty = ctx->queueHead == ctx->queueTail; in POOL_thread()
127 ctx->queueTail = 0; in POOL_create_advanced()
246 return ctx->queueHead == ((ctx->queueTail + 1) % ctx->queueSize); in isQueueFull()
261 ctx->queue[ctx->queueTail] = job; in POOL_add_internal()
262 ctx->queueTail = (ctx->queueTail + 1) % ctx->queueSize; in POOL_add_internal()
/dports/textproc/ripgrep-all/ripgrep-all-0.9.6/cargo-crates/zstd-sys-1.4.15+zstd.1.4.4/zstd/lib/common/
H A Dpool.c44 size_t queueTail; member
89 ctx->queueEmpty = ctx->queueHead == ctx->queueTail; in POOL_thread()
127 ctx->queueTail = 0; in POOL_create_advanced()
246 return ctx->queueHead == ((ctx->queueTail + 1) % ctx->queueSize); in isQueueFull()
261 ctx->queue[ctx->queueTail] = job; in POOL_add_internal()
262 ctx->queueTail = (ctx->queueTail + 1) % ctx->queueSize; in POOL_add_internal()
/dports/archivers/c-blosc/c-blosc-1.21.0/internal-complibs/zstd-1.4.8/common/
H A Dpool.c44 size_t queueTail; member
89 ctx->queueEmpty = ctx->queueHead == ctx->queueTail; in POOL_thread()
131 ctx->queueTail = 0; in POOL_create_advanced()
252 return ctx->queueHead == ((ctx->queueTail + 1) % ctx->queueSize); in isQueueFull()
267 ctx->queue[ctx->queueTail] = job; in POOL_add_internal()
268 ctx->queueTail = (ctx->queueTail + 1) % ctx->queueSize; in POOL_add_internal()
/dports/sysutils/vector/vector-0.10.0/cargo-crates/zstd-sys-1.4.15+zstd.1.4.4/zstd/lib/common/
H A Dpool.c44 size_t queueTail; member
89 ctx->queueEmpty = ctx->queueHead == ctx->queueTail; in POOL_thread()
127 ctx->queueTail = 0; in POOL_create_advanced()
246 return ctx->queueHead == ((ctx->queueTail + 1) % ctx->queueSize); in isQueueFull()
261 ctx->queue[ctx->queueTail] = job; in POOL_add_internal()
262 ctx->queueTail = (ctx->queueTail + 1) % ctx->queueSize; in POOL_add_internal()
/dports/archivers/c-blosc2/c-blosc2-2.0.4/internal-complibs/zstd-1.5.0/common/
H A Dpool.c44 size_t queueTail; member
89 ctx->queueEmpty = ctx->queueHead == ctx->queueTail; in POOL_thread()
131 ctx->queueTail = 0; in POOL_create_advanced()
252 return ctx->queueHead == ((ctx->queueTail + 1) % ctx->queueSize); in isQueueFull()
267 ctx->queue[ctx->queueTail] = job; in POOL_add_internal()
268 ctx->queueTail = (ctx->queueTail + 1) % ctx->queueSize; in POOL_add_internal()
/dports/sysutils/acfgfs/arcan-0.6.1/src/a12/external/zstd/common/
H A Dpool.c44 size_t queueTail; member
89 ctx->queueEmpty = ctx->queueHead == ctx->queueTail; in POOL_thread()
131 ctx->queueTail = 0; in POOL_create_advanced()
252 return ctx->queueHead == ((ctx->queueTail + 1) % ctx->queueSize); in isQueueFull()
267 ctx->queue[ctx->queueTail] = job; in POOL_add_internal()
268 ctx->queueTail = (ctx->queueTail + 1) % ctx->queueSize; in POOL_add_internal()
/dports/databases/percona57-client/percona-server-5.7.36-39/storage/rocksdb/third_party/zstd/lib/common/
H A Dpool.c44 size_t queueTail; member
89 ctx->queueEmpty = ctx->queueHead == ctx->queueTail; in POOL_thread()
127 ctx->queueTail = 0; in POOL_create_advanced()
246 return ctx->queueHead == ((ctx->queueTail + 1) % ctx->queueSize); in isQueueFull()
261 ctx->queue[ctx->queueTail] = job; in POOL_add_internal()
262 ctx->queueTail = (ctx->queueTail + 1) % ctx->queueSize; in POOL_add_internal()
/dports/mail/rspamd/rspamd-3.1/contrib/zstd/
H A Dpool.c44 size_t queueTail; member
89 ctx->queueEmpty = ctx->queueHead == ctx->queueTail; in POOL_thread()
127 ctx->queueTail = 0; in POOL_create_advanced()
246 return ctx->queueHead == ((ctx->queueTail + 1) % ctx->queueSize); in isQueueFull()
261 ctx->queue[ctx->queueTail] = job; in POOL_add_internal()
262 ctx->queueTail = (ctx->queueTail + 1) % ctx->queueSize; in POOL_add_internal()

1234