| /third_party/libcoap/include/coap3/ |
| D | utlist.h | 2 Copyright (c) 2007-2021, Troy D. Hanson http://troydhanson.github.io/uthash/
32 * This file contains macros to manipulate singly and doubly-linked lists.
34 * 1. LL_ macros: singly-linked lists.
35 * 2. DL_ macros: doubly-linked lists.
36 * 3. CDL_ macros: circular doubly-linked lists.
38 * To use singly-linked lists, your structure must have a "next" pointer.
39 * To use doubly-linked lists, your structure must "prev" and "next" pointers.
40 * Either way, the pointer to the head of the list must be initialized to NULL.
42 * ----------------.EXAMPLE -------------------------
55 * --------------------------------------------------
[all …]
|
| D | uthash.h | 2 Copyright (c) 2003-2021, Troy D. Hanson http://troydhanson.github.io/uthash/
111 #define uthash_nonfatal_oom(obj) do {} while (0) /* non-fatal OOM error */
121 #define uthash_fatal(msg) exit(-1) /* fatal OOM error */
135 #define ELMT_FROM_HH(tbl,hhp) ((void*)(((char*)(hhp)) - ((tbl)->hho)))
137 #define HH_FROM_ELMT(tbl,elp) ((UT_hash_handle*)(void*)(((char*)(elp)) + ((tbl)->hho)))
139 #define HASH_ROLLBACK_BKT(hh, head, itemptrhh) \ argument
143 HASH_TO_BKT(_hd_hh_item->hashv, (head)->hh.tbl->num_buckets, _hd_bkt); \
144 (head)->hh.tbl->buckets[_hd_bkt].count++; \
145 _hd_hh_item->hh_next = NULL; \
146 _hd_hh_item->hh_prev = NULL; \
[all …]
|
| /third_party/exfatprogs/include/ |
| D | list.h | 1 /* SPDX-License-Identifier: GPL-2.0-or-later */
7 #define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER)
11 const typeof(((type *)0)->member) * __mptr = (ptr); \
12 (type *)((char *)__mptr - offsetof(type, member)); \
16 * These are non-NULL pointers that will result in page faults
18 * non-initialized list entries.
30 * using the generic single-entry routines.
42 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
55 next->prev = new; in __list_add()
56 new->next = next; in __list_add()
[all …]
|
| /third_party/parse5/test/data/parser-feedback/ |
| D | noscript01.test | 5 "description": "<head><noscript><!doctype html><!--foo--></noscript>",
6 "input": "<head><noscript><!doctype html><!--foo--></noscript>",
10 "head",
20 "<!doctype html><!--foo-->"
30 "description": "<head><noscript><html class=\"foo\"><!--foo--></noscript>",
31 "input": "<head><noscript><html class=\"foo\"><!--foo--></noscript>",
35 "head",
45 "<html class=\"foo\"><!--foo-->"
55 "description": "<head><noscript></noscript>",
56 "input": "<head><noscript></noscript>",
[all …]
|
| D | tests3.test | 5 "description": "<head></head><style></style>",
6 "input": "<head></head><style></style>",
10 "head",
15 "head"
30 "description": "<head></head><script></script>",
31 "input": "<head></head><script></script>",
35 "head",
40 "head"
55 "description": "<head></head><!-- --><style></style><!-- --><script></script>",
56 "input": "<head></head><!-- --><style></style><!-- --><script></script>",
[all …]
|
| /third_party/gstreamer/gstplugins_bad/ext/sctp/usrsctp/usrsctplib/ |
| D | user_queue.h | 1 /*-
35 * This file defines four types of data structures: singly-linked lists,
36 * singly-linked tail queues, lists and tail queues.
38 * A singly-linked list is headed by a single forward pointer. The elements
41 * added to the list after an existing element or at the head of the list.
42 * Elements being removed from the head of the list should use the explicit
43 * macro for this purpose for optimum efficiency. A singly-linked list may
44 * only be traversed in the forward direction. Singly-linked lists are ideal
48 * A singly-linked tail queue is headed by a pair of pointers, one to the
49 * head of the list and the other to the tail of the list. The elements are
[all …]
|
| /third_party/libwebsockets/lib/misc/lwsac/ |
| D | lwsac.c | 2 * libwebsockets - small server side websockets and web server implementation
4 * Copyright (C) 2010 - 2020 Andy Green <andy@warmcat.com>
25 #include "private-lib-core.h"
26 #include "private-lib-misc-lwsac.h"
29 lws_list_ptr_insert(lws_list_ptr *head, lws_list_ptr *add, in lws_list_ptr_insert() argument
32 while (sort_func && *head) { in lws_list_ptr_insert()
33 if (sort_func(add, *head) <= 0) in lws_list_ptr_insert()
36 head = *head; in lws_list_ptr_insert()
39 *add = *head; in lws_list_ptr_insert()
40 *head = add; in lws_list_ptr_insert()
[all …]
|
| /third_party/FreeBSD/sys/sys/ |
| D | queue.h | 1 /*-
2 * SPDX-License-Identifier: BSD-3-Clause
41 * This file defines four types of data structures: singly-linked lists,
42 * singly-linked tail queues, lists and tail queues.
44 * A singly-linked list is headed by a single forward pointer. The elements
47 * added to the list after an existing element or at the head of the list.
48 * Elements being removed from the head of the list should use the explicit
49 * macro for this purpose for optimum efficiency. A singly-linked list may
50 * only be traversed in the forward direction. Singly-linked lists are ideal
54 * A singly-linked tail queue is headed by a pair of pointers, one to the
[all …]
|
| D | tree.h | 5 /*-
6 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
44 * splay trees and red-black trees.
46 * A splay tree is a self-organizing data structure. Every operation
58 * A red-black tree is a binary search tree with the node color as an
60 * - every search path from the root to a leaf consists of the
62 * - each red node (except for the root) has a black parent,
63 * - each leaf node is black.
65 * Every operation on a red-black tree is bounded as O(lg n).
66 * The maximum height of a red-black tree is 2lg (n+1).
[all …]
|
| /third_party/alsa-utils/alsactl/ |
| D | list.h | 2 * Copied from the Linux kernel source tree, version 2.6.0-test1.
12 * container_of - cast a member of a structure out to the containing structure
20 const typeof( ((type *)0)->member ) *__mptr = (ptr); \
21 (type *)( (char *)__mptr - offsetof(type,member) );})
24 * These are non-NULL pointers that will result in page faults
26 * non-initialized list entries.
38 * using the generic single-entry routines.
51 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
64 next->prev = new; in __list_add()
65 new->next = next; in __list_add()
[all …]
|
| /third_party/ltp/testcases/realtime/include/ |
| D | list.h | 17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
35 * 2006-Oct-17: Initial version by Darren Hart
43 * These are non-NULL pointers that will result in page faults
45 * non-initialized list entries.
57 * using the generic single-entry routines.
71 list->next = list; in INIT_LIST_HEAD()
72 list->prev = list; in INIT_LIST_HEAD()
85 next->prev = new; in __list_add()
86 new->next = next; in __list_add()
87 new->prev = prev; in __list_add()
[all …]
|
| /third_party/libwebsockets/lib/core/ |
| D | buflist.c | 2 * libwebsockets - small server side websockets and web server implementation
4 * Copyright (C) 2010 - 2019 Andy Green <andy@warmcat.com>
25 #include "private-lib-core.h"
34 lws_buflist_append_segment(struct lws_buflist **head, const uint8_t *buf, in lws_buflist_append_segment() argument
38 int first = !*head; in lws_buflist_append_segment()
39 void *p = *head; in lws_buflist_append_segment()
46 while (*head) { in lws_buflist_append_segment()
47 if (!--sanity) { in lws_buflist_append_segment()
49 return -1; in lws_buflist_append_segment()
51 if (*head == (*head)->next) { in lws_buflist_append_segment()
[all …]
|
| /third_party/ltp/tools/sparse/sparse-src/ |
| D | ptrlist.c | 4 * (C) Copyright Linus Torvalds 2003-2005
9 // -------------------------
13 // * NULL is used by {PREPARE,NEXT}_PTR_LIST() to indicate the end-of-list.
16 // * VOID is used to replace a removed pseudo 'usage'. Since phi-nodes
17 // (OP_PHI) use a list to store their operands, a VOID in a phi-node
19 // consequence, VOIDs must never be used as phi-node operand.
20 // This is fine since phi-nodes make no sense with void values
36 // @head: the head of the list
37 // @return: the size of the list given by @head.
38 int ptr_list_size(struct ptr_list *head) in ptr_list_size() argument
[all …]
|
| D | ptrlist.h | 10 * (C) Copyright Linus Torvalds 2003-2005
13 /* Silly type-safety check ;) */
14 #define CHECK_TYPE(head,ptr) (void)(&(ptr) == &(head)->list[0]) argument
15 #define PTRLIST_TYPE(head) __typeof__((head)->list[0]) argument
16 #define VRFY_PTR_LIST(head) (void)(sizeof((head)->list[0])) argument
32 void * undo_ptr_list_last(struct ptr_list **head);
33 void * delete_ptr_list_last(struct ptr_list **head);
36 bool lookup_ptr_list_entry(const struct ptr_list *head, const void *entry);
42 extern bool ptr_list_empty(const struct ptr_list *head);
43 extern bool ptr_list_multiple(const struct ptr_list *head);
[all …]
|
| /third_party/FreeBSD/sys/compat/linuxkpi/common/include/linux/ |
| D | list.h | 1 /*-
5 * Copyright (c) 2013-2016 Mellanox Technologies, Ltd.
66 list->next = list->prev = list; in INIT_LIST_HEAD()
70 list_empty(const struct list_head *head) in list_empty() argument
73 return (head->next == head); in list_empty()
77 list_empty_careful(const struct list_head *head) in list_empty_careful() argument
79 struct list_head *next = head->next; in list_empty_careful()
81 return ((next == head) && (next == head->prev)); in list_empty_careful()
87 next->prev = prev; in __list_del()
88 WRITE_ONCE(prev->next, next); in __list_del()
[all …]
|
| /third_party/libdrm/intel/ |
| D | uthash.h | 2 Copyright (c) 2003-2016, Troy D. Hanson http://troydhanson.github.com/uthash/
82 #define uthash_fatal(msg) exit(-1) /* fatal error (out of memory,etc) */
110 #define ELMT_FROM_HH(tbl,hhp) ((void*)(((char*)(hhp)) - ((tbl)->hho)))
112 #define HH_FROM_ELMT(tbl,elp) ((UT_hash_handle *)(((char*)(elp)) + ((tbl)->hho)))
119 #define HASH_FIND_BYHASHVALUE(hh,head,keyptr,keylen,hashval,out) \ argument
122 if (head) { \
124 HASH_TO_BKT(hashval, (head)->hh.tbl->num_buckets, _hf_bkt); \
125 if (HASH_BLOOM_TEST((head)->hh.tbl, hashval) != 0) { \
126 …HASH_FIND_IN_BKT((head)->hh.tbl, hh, (head)->hh.tbl->buckets[ _hf_bkt ], keyptr, keylen, hashval, …
131 #define HASH_FIND(hh,head,keyptr,keylen,out) \ argument
[all …]
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/ |
| D | cord_rep_ring.cc | 7 // https://www.apache.org/licenses/LICENSE-2.0
43 return rep->IsFlat() || rep->IsExternal(); in IsFlatOrExternal()
48 if (ABSL_PREDICT_FALSE(extra > CordRepRing::kMaxCapacity - n)) { in CheckCapacity()
59 rep->length = n; in CreateFlat()
60 memcpy(rep->Data(), s, n); in CreateFlat()
64 // Unrefs the entries in `[head, tail)`.
66 void UnrefEntries(const CordRepRing* rep, index_type head, index_type tail) { in UnrefEntries() argument
67 rep->ForEach(head, tail, [rep](index_type ix) { in UnrefEntries()
68 CordRep* child = rep->entry_child(ix); in UnrefEntries()
69 if (!child->refcount.Decrement()) { in UnrefEntries()
[all …]
|
| /third_party/parse5/test/data/serialization/ |
| D | tests.json | 5 … "expected": "<html><head></head><body><template>Some <div>content</div></template></body></html>"
9 …"input": "<head><meta http-equiv=\"refresh\" content=\"30\"></head><body><div style=\"background-c…
10 …"expected": "<html><head><meta http-equiv=\"refresh\" content=\"30\"></head><body><div style=\"bac…
13 "name": "Attribute serialized name - XML namespace",
15 … "expected": "<html><head></head><body><svg xml:base=\"http://example.org\"></svg></body></html>"
18 "name": "Attribute serialized name - XMLNS namespace",
20 …"expected": "<html><head></head><body><svg xmlns=\"http://www.w3.org/1999/xhtml\" xmlns:xlink=\"ht…
23 "name": "Attribute serialized name - XLink namespace",
25 "expected": "<html><head></head><body><svg xlink:title=\"Hey!\"></svg></body></html>"
28 "name": "Attribute value escaping - &",
[all …]
|
| /third_party/libuv/include/uv/ |
| D | tree.h | 1 /*-
39 * splay trees and red-black trees.
41 * A splay tree is a self-organizing data structure. Every operation
53 * A red-black tree is a binary search tree with the node color as an
55 * - every search path from the root to a leaf consists of the
57 * - each red node (except for the root) has a black parent,
58 * - each leaf node is black.
60 * Every operation on a red-black tree is bounded as O(lg n).
61 * The maximum height of a red-black tree is 2lg (n+1).
73 (root)->sph_root = NULL; \
[all …]
|
| /third_party/ntfs-3g/ntfsprogs/ |
| D | list.h | 2 * list.h - Linked list implementation. Part of the Linux-NTFS project.
4 * Copyright (c) 2000-2002 Anton Altaparmakov and others
17 * along with this program (in the main directory of the Linux-NTFS
19 * Foundation,Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
26 * struct ntfs_list_head - Simple doubly linked list implementation.
28 * Copied from Linux kernel 2.4.2-ac18 into Linux-NTFS (with minor
29 * modifications). - AIA
35 * using the generic single-entry routines.
47 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
51 * __ntfs_list_add - Insert a new entry between two known consecutive entries.
[all …]
|
| /third_party/toybox/tests/ |
| D | head.test | 3 [ -f testing.sh ] && . testing.sh
7 testing "head, stdin" "head -n 1 && echo yes" "one\nyes\n" "" "one\ntwo"
8 testing "head, stdin via -" "head -n 1 - && echo yes" "one\nyes\n" "" "one\ntwo"
9 testing "head, file" "head input -n 1 && echo yes" "one\nyes\n" "one\ntwo" ""
10 testing "-number" "head -2 input && echo yes" "one\ntwo\nyes\n" \
12 testing "head, default lines" "head" "1\n2\n3\n4\n5\n6\n7\n8\n9\n10\n" "" "1\n2\n3\n4\n5\n6\n7\n8\n…
14 # coreutils & busybox name stdin as "standard input", toybox uses "-"
15 testing "-v file" "head -v -n 1 input" "==> input <==\none\n" "one\ntwo\n" ""
16 testing "-v stdin" "head -v -n 1 | sed 's/==> standard input <==/==> - <==/'" \
17 "==> - <==\none\n" "" "one\ntwo\n"
[all …]
|
| /third_party/f2fs-tools/tools/ |
| D | f2fstat.c | 65 dbg("[COMPARE] %s, %s\n", ((struct mm_table *)a)->name, ((struct mm_table *)b)->name); in compare_mm_table()
66 return strcmp(((struct mm_table *)a)->name, ((struct mm_table *)b)->name); in compare_mm_table()
69 static inline void remove_newline(char **head) in remove_newline() argument
72 if (**head == '\n') { in remove_newline()
73 *head = *head + 1; in remove_newline()
87 char *head, *tail; in f2fstat() local
91 { " - Data", &used_data_blks, 0 }, in f2fstat()
92 { " - Dirty", &dirty_segs, 0 }, in f2fstat()
93 { " - Free", &free_segs, 0 }, in f2fstat()
94 { " - NATs", &nat_caches, 0 }, in f2fstat()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Demangle/ |
| D | MicrosoftDemangle.h | 1 //===------------------------- MicrosoftDemangle.h --------------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
23 // (such as std::vector) with this allocator. But it pays off --
38 NewHead->Buf = new uint8_t[Capacity]; in addNode()
39 NewHead->Next = Head; in addNode()
40 NewHead->Capacity = Capacity; in addNode()
41 Head = NewHead; in addNode()
42 NewHead->Used = 0; in addNode()
49 while (Head) { in ~ArenaAllocator()
[all …]
|
| /third_party/flutter/skia/third_party/externals/harfbuzz/src/ |
| D | hb-serialize.hh | 35 #include "hb-blob.hh"
36 #include "hb-map.hh"
37 #include "hb-pool.hh"
50 char *head, *tail; member
59 return (tail - head == o.tail - o.head) in operator ==()
61 && 0 == hb_memcmp (head, o.head, tail - head) in operator ==()
66 return hb_bytes_t (head, tail - head).hash () ^ in hash()
82 range_t snapshot () { range_t s = {head, tail} ; return s; } in snapshot()
95 | hb_apply ([] (object_t *_) { _->fini (); }) in fini()
98 this->packed_map.fini (); in fini()
[all …]
|
| /third_party/harfbuzz/src/ |
| D | hb-serialize.hh | 35 #include "hb-blob.hh"
36 #include "hb-map.hh"
37 #include "hb-pool.hh"
59 Head, /* Relative to the current object head (default). */ enumerator
72 return (tail - head == o.tail - o.head) in operator ==()
74 && 0 == hb_memcmp (head, o.head, tail - head) in operator ==()
79 return hb_bytes_t (head, tail - head).hash () ^ in hash()
93 char *head; member
101 char *head; member
108 { return snapshot_t { head, tail, current, current->links.length }; } in snapshot()
[all …]
|