Home
last modified time | relevance | path

Searched refs:head (Results 101 - 125 of 985) sorted by relevance

12345678910>>...40

/third_party/libwebsockets/minimal-examples/ws-server/minimal-ws-server-threadpool/mount-origin/
H A Dexample.js1 var head = 0, tail = 0, ring = new Array(); variable
51 ring[head] = msg.data + "\n";
52 head = (head + 1) % 50;
53 if (tail === head)
60 } while (n !== head);
/third_party/libwebsockets/minimal-examples/ws-server/minimal-ws-server-threads/mount-origin/
H A Dexample.js1 var head = 0, tail = 0, ring = new Array(); variable
45 ring[head] = msg.data + "\n";
46 head = (head + 1) % 50;
47 if (tail === head)
54 } while (n !== head);
/third_party/libwebsockets/minimal-examples/ws-server/minimal-ws-server-threads-smp/mount-origin/
H A Dexample.js1 var head = 0, tail = 0, ring = new Array(); variable
45 ring[head] = msg.data + "\n";
46 head = (head + 1) % 50;
47 if (tail === head)
54 } while (n !== head);
/third_party/libwebsockets/win32port/zlib/
H A Dinflate.c117 state->head = Z_NULL;
639 if (state->head != Z_NULL)
640 state->head->done = -1;
684 if (state->head != Z_NULL)
685 state->head->text = (int)((hold >> 8) & 1);
691 if (state->head != Z_NULL)
692 state->head->time = hold;
698 if (state->head != Z_NULL) {
699 state->head->xflags = (int)(hold & 0xff);
700 state->head
[all...]
/third_party/skia/src/gpu/ops/
H A DOpsTask.cpp106 auto head = op; in removeOp() local
107 while (head->prevInChain()) { head = head->prevInChain(); } in removeOp()
108 SkASSERT(head == fHead.get()); in removeOp()
165 fBounds = fList.head()->bounds(); in fAppliedClip()
172 for (const auto& op : GrOp::ChainRange<>(fList.head())) { in visitProxies()
195 // We process ops in chain b from head to tail. We attempt to merge with nodes in a, starting in DoConcat()
196 // at chain a's tail and working toward the head. We produce one of the following outcomes: in DoConcat()
197 // 1) b's head i in DoConcat()
[all...]
/third_party/nghttp2/lib/
H A Dnghttp2_buf.c145 bufs->head = chain; in nghttp2_bufs_init3()
146 bufs->cur = bufs->head; in nghttp2_bufs_init3()
173 bufs->head = chain; in nghttp2_bufs_realloc()
174 bufs->cur = bufs->head; in nghttp2_bufs_realloc()
191 for (chain = bufs->head; chain;) { in nghttp2_bufs_free()
199 bufs->head = NULL; in nghttp2_bufs_free()
218 bufs->head = chain; in nghttp2_bufs_wrap_init()
219 bufs->cur = bufs->head; in nghttp2_bufs_wrap_init()
257 bufs->head = head_chain; in nghttp2_bufs_wrap_init2()
258 bufs->cur = bufs->head; in nghttp2_bufs_wrap_init2()
[all...]
/third_party/node/deps/nghttp2/lib/
H A Dnghttp2_buf.c145 bufs->head = chain; in nghttp2_bufs_init3()
146 bufs->cur = bufs->head; in nghttp2_bufs_init3()
173 bufs->head = chain; in nghttp2_bufs_realloc()
174 bufs->cur = bufs->head; in nghttp2_bufs_realloc()
191 for (chain = bufs->head; chain;) { in nghttp2_bufs_free()
199 bufs->head = NULL; in nghttp2_bufs_free()
218 bufs->head = chain; in nghttp2_bufs_wrap_init()
219 bufs->cur = bufs->head; in nghttp2_bufs_wrap_init()
257 bufs->head = head_chain; in nghttp2_bufs_wrap_init2()
258 bufs->cur = bufs->head; in nghttp2_bufs_wrap_init2()
[all...]
/third_party/skia/third_party/externals/dawn/src/tests/unittests/
H A DLinkedListTests.cpp58 // Checks that when iterating |list| (either from head to tail, or from
59 // tail to head, as determined by |forward|), we get back |node_ids|,
66 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail()); node != list.end(); in ExpectListContentsForDirection()
78 SCOPED_TRACE("Iterating forward (from head to tail)"); in ExpectListContents()
82 SCOPED_TRACE("Iterating backward (from tail to head)"); in ExpectListContents()
89 EXPECT_EQ(list.end(), list.head()); in TEST()
101 EXPECT_EQ(&n1, list.head()); in TEST()
111 EXPECT_EQ(&n1, list.head()); in TEST()
121 EXPECT_EQ(&n1, list.head()); in TEST()
144 EXPECT_EQ(&n1, list.head()); in TEST()
[all...]
/third_party/skia/third_party/externals/dawn/src/common/
H A DSlabAllocator.cpp33 SlabAllocatorImpl::Slab::Slab(char allocation[], IndexLinkNode* head) in Slab() argument
34 : allocation(allocation), freeList(head), prev(nullptr), next(nullptr), blocksInUse(0) { in Slab()
117 IndexLinkNode* head = slab->freeList; in PushFront() local
118 if (head == nullptr) { in PushFront()
121 ASSERT(IsNodeInSlab(slab, head)); in PushFront()
122 node->nextIndex = head->index; in PushFront()
133 IndexLinkNode* head = slab->freeList; in PopFront() local
134 if (head->nextIndex == kInvalidIndex) { in PopFront()
137 ASSERT(IsNodeInSlab(slab, head)); in PopFront()
138 slab->freeList = OffsetFrom(head, hea in PopFront()
[all...]
/third_party/benchmark/src/
H A Dbenchmark_name.cc25 size_t size_impl(const Head& head, const Tail&... tail) { in size_impl() argument
26 return head.size() + size_impl(tail...); in size_impl()
34 void join_impl(std::string& s, const char delimiter, const Head& head, in join_impl() argument
36 if (!s.empty() && !head.empty()) { in join_impl()
40 s += head; in join_impl()
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
H A Dcord_rep_ring_reader.h79 index_ = ring_->head(); in Reset()
101 CordRepRing::index_type hint = (offset >= current) ? index_ : ring_->head(); in Seek()
102 const CordRepRing::Position head = ring_->Find(hint, offset); in Seek() local
103 index_ = head.index; in Seek()
104 auto data = ring_->entry_data(head.index); in Seek()
105 data.remove_prefix(head.offset); in Seek()
/third_party/node/deps/openssl/openssl/crypto/bn/
H A Dbn_ctx.c33 BN_POOL_ITEM *head, *current, *tail; member
85 BN_POOL_ITEM *item = ctx->pool.head; in ctxdbg()
162 BN_POOL_ITEM *pool = ctx->pool.head; in BN_CTX_free()
296 p->head = p->current = p->tail = NULL; in BN_POOL_init()
305 while (p->head) { in BN_POOL_finish()
306 for (loop = 0, bn = p->head->vals; loop++ < BN_CTX_POOL_SIZE; bn++) in BN_POOL_finish()
309 p->current = p->head->next; in BN_POOL_finish()
310 OPENSSL_free(p->head); in BN_POOL_finish()
311 p->head = p->current; in BN_POOL_finish()
337 if (p->head in BN_POOL_get()
[all...]
/third_party/openssl/crypto/bn/
H A Dbn_ctx.c33 BN_POOL_ITEM *head, *current, *tail; member
85 BN_POOL_ITEM *item = ctx->pool.head; in ctxdbg()
162 BN_POOL_ITEM *pool = ctx->pool.head; in BN_CTX_free()
296 p->head = p->current = p->tail = NULL; in BN_POOL_init()
305 while (p->head) { in BN_POOL_finish()
306 for (loop = 0, bn = p->head->vals; loop++ < BN_CTX_POOL_SIZE; bn++) in BN_POOL_finish()
309 p->current = p->head->next; in BN_POOL_finish()
310 OPENSSL_free(p->head); in BN_POOL_finish()
311 p->head = p->current; in BN_POOL_finish()
337 if (p->head in BN_POOL_get()
[all...]
/third_party/selinux/libsepol/src/
H A Dibpkeys.c107 ocontext_t *c, *head; in sepol_ibpkey_count() local
110 head = policydb->ocontexts[OCON_IBPKEY]; in sepol_ibpkey_count()
111 for (c = head; c; c = c->next) in sepol_ibpkey_count()
125 ocontext_t *c, *head; in sepol_ibpkey_exists() local
131 head = policydb->ocontexts[OCON_IBPKEY]; in sepol_ibpkey_exists()
132 for (c = head; c; c = c->next) { in sepol_ibpkey_exists()
155 ocontext_t *c, *head; in sepol_ibpkey_query() local
161 head = policydb->ocontexts[OCON_IBPKEY]; in sepol_ibpkey_query()
162 for (c = head; c; c = c->next) { in sepol_ibpkey_query()
222 ocontext_t *c, *head; in sepol_ibpkey_iterate() local
[all...]
H A Dports.c162 ocontext_t *c, *head; in sepol_port_count() local
165 head = policydb->ocontexts[OCON_PORT]; in sepol_port_count()
166 for (c = head; c != NULL; c = c->next) in sepol_port_count()
181 ocontext_t *c, *head; in sepol_port_exists() local
191 head = policydb->ocontexts[OCON_PORT]; in sepol_port_exists()
192 for (c = head; c; c = c->next) { in sepol_port_exists()
219 ocontext_t *c, *head; in sepol_port_query() local
229 head = policydb->ocontexts[OCON_PORT]; in sepol_port_query()
230 for (c = head; c; c = c->next) { in sepol_port_query()
296 ocontext_t *c, *head; in sepol_port_iterate() local
[all...]
/third_party/mesa3d/src/microsoft/compiler/
H A Ddxil_internal.h72 struct list_head head; member
90 struct list_head head; member
100 struct list_head head; member
116 struct list_head head; member
252 struct list_head head; member
265 struct list_head head; member
289 struct list_head head; member
297 struct list_head head; member
/third_party/skia/third_party/externals/harfbuzz/src/
H A Dhb-set-digest.hh119 head.init (); in init()
125 head.add (g); in add()
131 head.add_range (a, b); in add_range()
138 head.add_array (array, count, stride); in add_array()
146 head.add_sorted_array (array, count, stride); in add_sorted_array()
155 return head.may_have (g) && tail.may_have (g); in may_have()
159 head_t head; member
/third_party/FreeBSD/sbin/fsck_msdosfs/
H A Dfat.c62 * For each cluster, we use 1 bit to represent if it's a head cluster
70 * corresponding cluster was a "head" cluster.
72 * We use head bitmap to identify lost chains: a head cluster that was
73 * not being claimed by any file or directories is the head cluster of
79 * by finding out the 1's in the head bitmap.
397 * Cache hit: if we already have the chunk, move it to list head in fat_get_fat32_cache_entry()
803 * Read or map a FAT and populate head bitmap
858 perr("No space for head bitmap for FAT clusters (%zu)", in readfat()
935 * Traverse the FAT table and populate head ma in readfat()
1034 checkchain(struct fat_descriptor *fat, cl_t head, size_t *chainsize) checkchain() argument
1120 clearchain(struct fat_descriptor *fat, cl_t head) clearchain() argument
1247 cl_t head; checklost() local
[all...]
/third_party/python/Modules/
H A D_testbuffer.c66 (((NDArrayObject *)nd)->head == &((NDArrayObject *)nd)->staticbuf)
104 ndbuf_t *head; /* currently active base buffer */ member
180 elt->next = nd->head; in ndbuf_push()
181 if (nd->head) nd->head->prev = elt; in ndbuf_push()
182 nd->head = elt; in ndbuf_push()
192 nd->head = elt->next; in ndbuf_delete()
203 ndbuf_delete(nd, nd->head); in ndbuf_pop()
217 nd->head = NULL; in ndarray_new()
224 if (self->head) { in ndarray_dealloc()
[all...]
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
H A DEdits.java73 // Bit 30 of the actual length is in the head unit.
179 int head = 0x7000; in addReplace()
181 head |= oldLength << 6; in addReplace()
182 head |= newLength; in addReplace()
183 append(head); in addReplace()
187 head |= oldLength << 6; in addReplace()
189 head |= LENGTH_IN_1TRAIL << 6; in addReplace()
192 head |= (LENGTH_IN_2TRAIL + (oldLength >> 30)) << 6; in addReplace()
197 head |= newLength; in addReplace()
199 head | in addReplace()
297 readLength(int head) readLength() argument
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/
H A DEdits.java72 // Bit 30 of the actual length is in the head unit.
174 int head = 0x7000; in addReplace()
176 head |= oldLength << 6; in addReplace()
177 head |= newLength; in addReplace()
178 append(head); in addReplace()
182 head |= oldLength << 6; in addReplace()
184 head |= LENGTH_IN_1TRAIL << 6; in addReplace()
187 head |= (LENGTH_IN_2TRAIL + (oldLength >> 30)) << 6; in addReplace()
192 head |= newLength; in addReplace()
194 head | in addReplace()
288 readLength(int head) readLength() argument
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/base/internal/
H A Dlow_level_alloc.cc152 // Return "atleast", the first element of AllocList *head s.t. *atleast >= *e.
153 // For 0 <= i < head->levels, set prev[i] to "no_greater", where no_greater
155 // head if no such element exists.
156 static AllocList *LLA_SkiplistSearch(AllocList *head, in LLA_SkiplistSearch() argument
158 AllocList *p = head; in LLA_SkiplistSearch()
159 for (int level = head->levels - 1; level >= 0; level--) { in LLA_SkiplistSearch()
164 return (head->levels == 0) ? nullptr : prev[0]->next[0]; in LLA_SkiplistSearch()
167 // Insert element *e into AllocList *head. Set prev[] as LLA_SkiplistSearch.
170 static void LLA_SkiplistInsert(AllocList *head, AllocList *e, in LLA_SkiplistInsert() argument
172 LLA_SkiplistSearch(head, in LLA_SkiplistInsert()
185 LLA_SkiplistDelete(AllocList *head, AllocList *e, AllocList **prev) LLA_SkiplistDelete() argument
[all...]
/third_party/node/deps/openssl/openssl/providers/implementations/ciphers/
H A Dcipher_rc4_hmac_md5_hw.c41 MD5_Init(&ctx->head); /* handy when benchmarking */ in cipher_hw_rc4_hmac_md5_initkey()
42 ctx->tail = ctx->head; in cipher_hw_rc4_hmac_md5_initkey()
43 ctx->md = ctx->head; in cipher_hw_rc4_hmac_md5_initkey()
184 ctx->md = ctx->head; in cipher_hw_rc4_hmac_md5_tls_init()
201 MD5_Init(&ctx->head); in cipher_hw_rc4_hmac_md5_init_mackey()
202 MD5_Update(&ctx->head, key, len); in cipher_hw_rc4_hmac_md5_init_mackey()
203 MD5_Final(hmac_key, &ctx->head); in cipher_hw_rc4_hmac_md5_init_mackey()
210 MD5_Init(&ctx->head); in cipher_hw_rc4_hmac_md5_init_mackey()
211 MD5_Update(&ctx->head, hmac_key, sizeof(hmac_key)); in cipher_hw_rc4_hmac_md5_init_mackey()
/third_party/openssl/providers/implementations/ciphers/
H A Dcipher_rc4_hmac_md5_hw.c41 MD5_Init(&ctx->head); /* handy when benchmarking */ in cipher_hw_rc4_hmac_md5_initkey()
42 ctx->tail = ctx->head; in cipher_hw_rc4_hmac_md5_initkey()
43 ctx->md = ctx->head; in cipher_hw_rc4_hmac_md5_initkey()
184 ctx->md = ctx->head; in cipher_hw_rc4_hmac_md5_tls_init()
201 MD5_Init(&ctx->head); in cipher_hw_rc4_hmac_md5_init_mackey()
202 MD5_Update(&ctx->head, key, len); in cipher_hw_rc4_hmac_md5_init_mackey()
203 MD5_Final(hmac_key, &ctx->head); in cipher_hw_rc4_hmac_md5_init_mackey()
210 MD5_Init(&ctx->head); in cipher_hw_rc4_hmac_md5_init_mackey()
211 MD5_Update(&ctx->head, hmac_key, sizeof(hmac_key)); in cipher_hw_rc4_hmac_md5_init_mackey()
/third_party/skia/third_party/externals/dawn/src/dawn_native/
H A DBuddyAllocator.cpp86 BuddyBlock* freeBlock = mFreeLists[currLevel].head; in GetNextFreeAlignedBlock()
96 // Note: Always insert into the head of the free-list. As when a larger free block at a lower
104 // Old head is now the inserted block's next. in InsertFreeBlock()
105 block->free.pNext = mFreeLists[level].head; in InsertFreeBlock()
108 if (mFreeLists[level].head != nullptr) { in InsertFreeBlock()
109 // Old head's previous is the inserted block. in InsertFreeBlock()
110 mFreeLists[level].head->free.pPrev = block; in InsertFreeBlock()
113 mFreeLists[level].head = block; in InsertFreeBlock()
119 if (mFreeLists[level].head == block) { in RemoveFreeBlock()
121 mFreeLists[level].head in RemoveFreeBlock()
[all...]

Completed in 16 milliseconds

12345678910>>...40