Searched defs:tail (Results 76 - 100 of 240) sorted by relevance

12345678910

/external/jemalloc/include/jemalloc/internal/
H A Dhash.h116 /* tail */
118 const uint8_t *tail = (const uint8_t *) (data + nblocks*4); local
123 case 3: k1 ^= tail[2] << 16;
124 case 2: k1 ^= tail[1] << 8;
125 case 1: k1 ^= tail[0]; k1 *= c1; k1 = hash_rotl_32(k1, 15);
188 /* tail */
190 const uint8_t *tail = (const uint8_t *) (data + nblocks*16); local
197 case 15: k4 ^= tail[14] << 16;
198 case 14: k4 ^= tail[13] << 8;
199 case 13: k4 ^= tail[1
276 const uint8_t *tail = (const uint8_t*)(data + nblocks*16); local
[all...]
/external/openssl/crypto/evp/
H A De_rc4_hmac_md5.c74 MD5_CTX head,tail,md; member in struct:__anon28301
95 key->tail = key->head;
163 key->md = key->tail;
204 key->md = key->tail;
248 MD5_Init(&key->tail);
249 MD5_Update(&key->tail,hmac_key,sizeof(hmac_key));
/external/oprofile/libutil++/
H A Dstring_manip.cpp40 string const tail = s.substr(i + 1); local
42 return tail;
/external/srtp/crypto/hash/
H A Dsha1.c262 int tail = ctx->octets_in_buffer % 4; local
269 switch (tail) {
/external/valgrind/main/coregrind/m_gdbserver/
H A Dserver.h191 struct inferior_list_entry *tail; member in struct:inferior_list
/external/zopfli/src/zopfli/
H A Dkatajainen.c37 Node* tail; /* Previous node(s) of this chain, or 0 if none. */ member in struct:Node
54 static void InitNode(size_t weight, int count, Node* tail, Node* node) { argument
57 node->tail = tail;
78 for (node = lists[i / 2][i % 2]; node; node = node->tail) {
128 InitNode(leaves[lastcount].weight, lastcount + 1, oldchain->tail,
165 for (node = chain; node; node = node->tail) {
/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3commontreenodestream.h255 /// Add new lookahead at lookahead[tail]. tail wraps around at the
256 /// end of the lookahead buffer so tail could be less than head.
258 ANTLR3_UINT32 tail; member in struct:ANTLR3_COMMON_TREE_NODE_STREAM_struct
327 ANTLR3_UINT32 tail; member in struct:ANTLR3_TREE_WALK_STATE_struct
/external/chromium_org/net/websockets/
H A Dwebsocket_inflater.cc129 std::pair<char*, size_t> tail = output_buffer_.GetTail(); local
130 if (!tail.second)
133 stream_->next_out = reinterpret_cast<Bytef*>(tail.first);
134 stream_->avail_out = tail.second;
136 output_buffer_.AdvanceTail(tail.second - stream_->avail_out);
140 } else if (tail.second == stream_->avail_out) {
/external/chromium_org/third_party/boringssl/src/crypto/bn/
H A Dctx.c77 BN_POOL_ITEM *head, *current, *tail; member in struct:bignum_pool
239 p->head = p->current = p->tail = NULL;
275 item->prev = p->tail;
279 p->head = p->current = p->tail = item;
281 p->tail->next = item;
282 p->tail = item;
/external/chromium_org/third_party/boringssl/src/crypto/cipher/
H A De_rc4.c98 MD5_CTX head, tail, md; member in struct:aead_rc4_md5_tls_ctx
147 MD5_Init(&rc4_ctx->tail);
148 MD5_Update(&rc4_ctx->tail, hmac_key, sizeof(hmac_key));
247 memcpy(&md, &rc4_ctx->tail, sizeof(MD5_CTX));
347 memcpy(&md, &rc4_ctx->tail, sizeof(MD5_CTX));
/external/chromium_org/third_party/freetype/include/freetype/
H A Dfttypes.h561 /* tail :: The tail (last element) of doubly-linked list. */
566 FT_ListNode tail; member in struct:FT_ListRec_
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/llvmpipe/
H A Dlp_scene.h81 struct cmd_block *tail; member in struct:cmd_block_list
100 struct cmd_block *tail; member in struct:cmd_bin
298 struct cmd_block *tail = bin->tail; local
304 if (tail == NULL || tail->count == CMD_BLOCK_MAX) {
305 tail = lp_scene_new_cmd_block( scene, bin );
306 if (!tail) {
309 assert(tail->count == 0);
313 unsigned i = tail
[all...]
/external/chromium_org/third_party/mesa/src/src/glsl/
H A Dlist.h28 * Each doubly-linked list has a sentinel head and tail node. These nodes
30 * pointer being \c NULL. The tail sentinel can be identified by its
34 * tail sentinel or the tail sentinel's \c prev poiner points to the head
45 * - A \c tail pointer that represents the \c prev pointer of the head
46 * sentinel node and the \c next pointer of the tail sentinel node. This
49 * tail sentinel node.
183 * Is this the sentinel at the tail of the list?
284 struct exec_node *tail; member in struct:exec_list
314 head = (exec_node *) & tail;
[all...]
/external/chromium_org/third_party/skia/include/core/
H A DSkTInternalLList.h115 * at the tail.
175 T* tail() { return fTail; } function in class:SkTInternalLList
/external/chromium_org/third_party/tcmalloc/chromium/src/
H A Dthread_cache.cc231 void *tail, *head; local
232 src->PopRange(batch_size, &head, &tail);
233 Static::central_cache()[cl].InsertRange(head, tail, batch_size);
236 void *tail, *head; local
237 src->PopRange(N, &head, &tail);
238 Static::central_cache()[cl].InsertRange(head, tail, N);
/external/chromium_org/third_party/tcmalloc/vendor/src/
H A Dthread_cache.cc225 void *tail, *head; local
226 src->PopRange(batch_size, &head, &tail);
227 Static::central_cache()[cl].InsertRange(head, tail, batch_size);
230 void *tail, *head; local
231 src->PopRange(N, &head, &tail);
232 Static::central_cache()[cl].InsertRange(head, tail, N);
/external/chromium_org/third_party/yasm/source/patched-yasm/tools/re2c/
H A Ddfa.h85 State *head, **tail; member in struct:DFA
/external/clang/test/CXX/temp/temp.decls/temp.variadic/
H A Dexample-tuple.cpp74 : m_head(other.head()), inherited(other.tail()) { }
79 tail() = other.tail();
85 inherited& tail() { return *this; } function in class:tuple
86 const inherited& tail() const { return *this; } function in class:tuple
185 static RJ get(tuple<Head, Values...>& t) { return Next::get(t.tail()); }
186 static PJ get(const tuple<Head, Values...>& t) { return Next::get(t.tail()); }
224 return t.head() == u.head() && t.tail() == u.tail();
236 return (t.head() < u.head() || (!(t.head() < u.head()) && t.tail() <
[all...]
/external/e2fsprogs/util/
H A Dsymlinks.c165 char *p, *np, *lp, *tail, *msg; local
229 /* point tail at first part of lpath that differs from path */
232 tail = lp = lpath;
236 tail = lp;
241 /* now create new, with "../"s followed by tail */
251 strcpy (np, tail);
/external/eigen/Eigen/src/plugins/
H A DBlockMethods.h833 inline SegmentReturnType tail(Index n) function
839 /** This is the const version of tail(Index).*/
840 inline ConstSegmentReturnType tail(Index n) const function
923 inline typename FixedSegmentReturnType<N>::Type tail(Index n = N) function
929 /** This is the const version of tail<int>.*/
931 inline typename ConstFixedSegmentReturnType<N>::Type tail(Index n = N) const function
/external/fio/engines/
H A Dlibaio.c82 unsigned tail; member in struct:aio_ring
104 if (head == ring->tail) {
/external/freetype/include/
H A Dfttypes.h561 /* tail :: The tail (last element) of doubly-linked list. */
566 FT_ListNode tail; member in struct:FT_ListRec_
/external/iproute2/tc/
H A Dm_action.c172 struct rtattr *tail, *tail2; local
183 tail = tail2 = NLMSG_TAIL(n);
223 tail = NLMSG_TAIL(n);
233 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
381 struct rtattr *tail; local
405 tail = NLMSG_TAIL(&req.n);
461 tail->rta_len = (void *) NLMSG_TAIL(&req.n) - (void *) tail;
489 struct rtattr *tail; local
527 struct rtattr *tail,*tail2; local
[all...]
H A Dm_pedit.c471 struct rtattr *tail; local
541 tail = NLMSG_TAIL(n);
544 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
H A Dq_cbq.c60 struct rtattr *tail; local
166 tail = NLMSG_TAIL(n);
177 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
197 struct rtattr *tail; local
412 tail = NLMSG_TAIL(n);
432 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;

Completed in 2736 milliseconds

12345678910