/dports/multimedia/mpv/mpv-0.34.1/test/ |
H A D | linked_list.c | 9 } list_node; member 30 if (cur->list_node.prev) { in do_check_list() 31 assert_true(cur->list_node.prev->list_node.next == cur); in do_check_list() 36 if (cur->list_node.next) { in do_check_list() 37 assert_true(cur->list_node.next->list_node.prev == cur); in do_check_list() 75 LL_APPEND(list_node, &lst, &e1); in run() 78 LL_APPEND(list_node, &lst, &e2); in run() 81 LL_APPEND(list_node, &lst, &e4); in run() 84 LL_CLEAR(list_node, &lst); in run() 96 LL_CLEAR(list_node, &lst); in run() [all …]
|
/dports/www/ilias/ILIAS-5.4.25/Services/COPage/classes/ |
H A D | class.ilPCList.php | 18 public $list_node; variable in ilPCList 44 $this->list_node = $this->dom->create_element("List"); 45 $this->list_node = $this->node->append_child($this->list_node); 95 $nt = $this->list_node->get_attribute("NumberingType"); 129 $this->list_node->set_attribute("Type", $a_val); 137 $nt = $this->list_node->get_attribute("NumberingType"); 192 return $this->list_node->get_attribute("StartValue"); 203 $this->list_node->set_attribute("Class", $a_val); 205 if ($this->list_node->has_attribute("Class")) { 206 $this->list_node->remove_attribute("Class"); [all …]
|
/dports/www/ilias6/ILIAS-6.14/Services/COPage/classes/ |
H A D | class.ilPCList.php | 18 public $list_node; variable in ilPCList 44 $this->list_node = $this->dom->create_element("List"); 45 $this->list_node = $this->node->append_child($this->list_node); 95 $nt = $this->list_node->get_attribute("NumberingType"); 129 $this->list_node->set_attribute("Type", $a_val); 137 $nt = $this->list_node->get_attribute("NumberingType"); 192 return $this->list_node->get_attribute("StartValue"); 203 $this->list_node->set_attribute("Class", $a_val); 205 if ($this->list_node->has_attribute("Class")) { 206 $this->list_node->remove_attribute("Class"); [all …]
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/v8/src/base/ |
H A D | list.h | 21 DCHECK(!element->list_node().next()); in PushBack() 22 DCHECK(!element->list_node().prev()); in PushBack() 32 DCHECK(!element->list_node().next()); in PushFront() 33 DCHECK(!element->list_node().prev()); in PushFront() 45 back_ = element->list_node().prev(); in Remove() 50 T* next = element->list_node().next(); in Remove() 51 T* prev = element->list_node().prev(); in Remove() 62 it = it->list_node().next(); in Contains() 76 DCHECK(!element->list_node().next()); in AddFirstElement() 77 DCHECK(!element->list_node().prev()); in AddFirstElement() [all …]
|
/dports/x11-wm/picom/picom-8.2/src/ |
H A D | list.h | 18 struct list_node { struct 19 struct list_node *next, *prev; argument 27 static inline void __list_insert_between(struct list_node *prev, struct list_node *next, in __list_insert_between() 36 static inline void list_insert_after(struct list_node *curr, struct list_node *new_) { in list_insert_after() 41 static inline void list_insert_before(struct list_node *curr, struct list_node *new_) { in list_insert_before() 46 static inline void __list_link(struct list_node *prev, struct list_node *next) { in __list_link() 59 static inline void list_move_before(struct list_node *to_move, struct list_node *new_next) { in list_move_before() 65 static inline void list_move_after(struct list_node *to_move, struct list_node *new_prev) { in list_move_after() 76 static inline void list_replace(struct list_node *old, struct list_node *n) { in list_replace() 90 list_node_is_first(const struct list_node *head, const struct list_node *to_check) { in list_node_is_first() [all …]
|
/dports/lang/v8/v8-9.6.180.12/src/heap/ |
H A D | list.h | 34 DCHECK(!element->list_node().next()); in PushBack() 35 DCHECK(!element->list_node().prev()); in PushBack() 45 DCHECK(!element->list_node().next()); in PushFront() 46 DCHECK(!element->list_node().prev()); in PushFront() 58 back_ = element->list_node().prev(); in Remove() 63 T* next = element->list_node().next(); in Remove() 64 T* prev = element->list_node().prev(); in Remove() 75 it = it->list_node().next(); in Contains() 92 DCHECK(!element->list_node().next()); in AddFirstElement() 93 DCHECK(!element->list_node().prev()); in AddFirstElement() [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/v8/src/heap/ |
H A D | list.h | 34 DCHECK(!element->list_node().next()); in PushBack() 35 DCHECK(!element->list_node().prev()); in PushBack() 45 DCHECK(!element->list_node().next()); in PushFront() 46 DCHECK(!element->list_node().prev()); in PushFront() 58 back_ = element->list_node().prev(); in Remove() 63 T* next = element->list_node().next(); in Remove() 64 T* prev = element->list_node().prev(); in Remove() 75 it = it->list_node().next(); in Contains() 92 DCHECK(!element->list_node().next()); in AddFirstElement() 93 DCHECK(!element->list_node().prev()); in AddFirstElement() [all …]
|
/dports/net/olsrd/olsrd-0.9.8/src/common/ |
H A D | list.h | 53 struct list_node { struct 54 struct list_node *next; argument 55 struct list_node *prev; argument 58 void list_head_init(struct list_node *); 59 void list_node_init(struct list_node *); 60 int list_node_on_list(struct list_node *); 61 int list_is_empty(struct list_node *); 63 void list_add_before(struct list_node *, struct list_node *); 64 void list_add_after(struct list_node *, struct list_node *); 66 void list_remove(struct list_node *); [all …]
|
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/blink/renderer/core/html/ |
H A D | list_item_ordinal.cc | 87 const Node* list_node, in NextListItem() argument 89 if (!list_node) in NextListItem() 118 const Node* list_node, in PreviousListItem() argument 124 current && current != list_node; in PreviousListItem() 131 if (list_node == other_list) in PreviousListItem() 245 const HTMLOListElement* list_node) { in ItemCountForOrderedList() argument 246 DCHECK(list_node); in ItemCountForOrderedList() 257 const HTMLOListElement* list_node) { in InvalidateAllItemsForOrderedList() argument 258 DCHECK(list_node); in InvalidateAllItemsForOrderedList() 280 CHECK(list_node); in ItemInsertedOrRemoved() [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/blink/renderer/core/html/ |
H A D | list_item_ordinal.cc | 70 const Node* list_node, in NextListItem() argument 72 if (!list_node) in NextListItem() 101 const Node* list_node, in PreviousListItem() argument 107 current && current != list_node; in PreviousListItem() 114 if (list_node == other_list) in PreviousListItem() 228 const HTMLOListElement* list_node) { in ItemCountForOrderedList() argument 229 DCHECK(list_node); in ItemCountForOrderedList() 240 const HTMLOListElement* list_node) { in InvalidateAllItemsForOrderedList() argument 241 DCHECK(list_node); in InvalidateAllItemsForOrderedList() 263 CHECK(list_node); in ItemInsertedOrRemoved() [all …]
|
/dports/x11/wmcliphist/wmcliphist/ |
H A D | history.c | 16 GList *list_node; in process_item() local 24 while (list_node) { in process_item() 30 list_node = g_list_next(list_node); in process_item() 66 list_node = g_list_next(list_node); in process_item() 88 GList *list_node; in move_item_to_begin() local 126 GList *list_node; in exec_item() local 138 list_node = g_list_next(list_node); in exec_item() 277 GList *list_node; in history_save() local 326 list_node = g_list_previous(list_node); in history_save() 331 if (!list_node) { in history_save() [all …]
|
/dports/games/instead/instead-3.4.1/src/instead/ |
H A D | list.c | 11 void list_add(struct list_head *h, struct list_node *n) in list_add() 35 void list_del(struct list_node *n) in list_del() 51 struct list_node *i; in list_del_from() 71 struct list_node *n; in list_pop_() 128 return (struct list_node *)((char *)ptr + off); in list_node_from_off_() 132 const struct list_node *n, in list_entry_or_null() 141 const struct list_node *head, in corrupt() 142 const struct list_node *node, in corrupt() 154 struct list_node *list_check_node(const struct list_node *node, in list_check_node() 157 const struct list_node *p, *n; in list_check_node() [all …]
|
/dports/science/qmcpack/qmcpack-3.11.0/external_codes/mpi_wrapper/mpi3/examples/ |
H A D | managed_shared_memory_0.cpp | 14 struct list_node{ struct 16 list_node* next; argument 25 list_node* prev = 0; in main() argument 26 list_node* current; in main() 27 list_node* first; in main() 29 list_node* ln = static_cast<list_node*>(segment.allocate(sizeof(list_node))); in main() 33 list_node* ln2 = static_cast<list_node*>(segment.allocate(sizeof(list_node))); in main() 39 current = new list_node; in main()
|
/dports/dns/py-pycares/pycares-3.1.1/deps/c-ares/src/ |
H A D | ares_llist.h | 22 struct list_node { struct 23 struct list_node *prev; argument 24 struct list_node *next; argument 28 void ares__init_list_head(struct list_node* head); argument 30 void ares__init_list_node(struct list_node* node, void* d); 32 int ares__is_list_empty(struct list_node* head); 34 void ares__insert_in_list(struct list_node* new_node, 35 struct list_node* old_node); 37 void ares__remove_from_list(struct list_node* node);
|
H A D | ares_cancel.c | 29 struct list_node list_head_copy; in ares_cancel() 30 struct list_node* list_head; in ares_cancel() 31 struct list_node* list_node; in ares_cancel() local 47 for (list_node = list_head_copy.next; list_node != &list_head_copy; ) in ares_cancel() 49 query = list_node->data; in ares_cancel() 50 list_node = list_node->next; /* since we're deleting the query */ in ares_cancel()
|
/dports/dns/c-ares/c-ares-1.17.2/src/lib/ |
H A D | ares_llist.h | 22 struct list_node { struct 23 struct list_node *prev; argument 24 struct list_node *next; argument 28 void ares__init_list_head(struct list_node* head); argument 30 void ares__init_list_node(struct list_node* node, void* d); 32 int ares__is_list_empty(struct list_node* head); 34 void ares__insert_in_list(struct list_node* new_node, 35 struct list_node* old_node); 37 void ares__remove_from_list(struct list_node* node);
|
H A D | ares_cancel.c | 29 struct list_node list_head_copy; in ares_cancel() 30 struct list_node* list_head; in ares_cancel() 31 struct list_node* list_node; in ares_cancel() local 47 for (list_node = list_head_copy.next; list_node != &list_head_copy; ) in ares_cancel() 49 query = list_node->data; in ares_cancel() 50 list_node = list_node->next; /* since we're deleting the query */ in ares_cancel()
|
/dports/sysutils/fluent-bit/fluent-bit-1.8.11/lib/c-ares-809d5e84/src/lib/ |
H A D | ares_llist.h | 22 struct list_node { struct 23 struct list_node *prev; argument 24 struct list_node *next; argument 28 void ares__init_list_head(struct list_node* head); argument 30 void ares__init_list_node(struct list_node* node, void* d); 32 int ares__is_list_empty(struct list_node* head); 34 void ares__insert_in_list(struct list_node* new_node, 35 struct list_node* old_node); 37 void ares__remove_from_list(struct list_node* node);
|
H A D | ares_cancel.c | 29 struct list_node list_head_copy; in ares_cancel() 30 struct list_node* list_head; in ares_cancel() 31 struct list_node* list_node; in ares_cancel() local 47 for (list_node = list_head_copy.next; list_node != &list_head_copy; ) in ares_cancel() 49 query = list_node->data; in ares_cancel() 50 list_node = list_node->next; /* since we're deleting the query */ in ares_cancel()
|
/dports/www/node10/node-v10.24.1/deps/cares/src/ |
H A D | ares_llist.h | 22 struct list_node { struct 23 struct list_node *prev; argument 24 struct list_node *next; argument 28 void ares__init_list_head(struct list_node* head); argument 30 void ares__init_list_node(struct list_node* node, void* d); 32 int ares__is_list_empty(struct list_node* head); 34 void ares__insert_in_list(struct list_node* new_node, 35 struct list_node* old_node); 37 void ares__remove_from_list(struct list_node* node);
|
H A D | ares_cancel.c | 29 struct list_node list_head_copy; in ares_cancel() 30 struct list_node* list_head; in ares_cancel() 31 struct list_node* list_node; in ares_cancel() local 47 for (list_node = list_head_copy.next; list_node != &list_head_copy; ) in ares_cancel() 49 query = list_node->data; in ares_cancel() 50 list_node = list_node->next; /* since we're deleting the query */ in ares_cancel()
|
/dports/devel/py-grpcio/grpcio-1.43.0/third_party/cares/cares/ |
H A D | ares_llist.h | 22 struct list_node { struct 23 struct list_node *prev; argument 24 struct list_node *next; argument 28 void ares__init_list_head(struct list_node* head); argument 30 void ares__init_list_node(struct list_node* node, void* d); 32 int ares__is_list_empty(struct list_node* head); 34 void ares__insert_in_list(struct list_node* new_node, 35 struct list_node* old_node); 37 void ares__remove_from_list(struct list_node* node);
|
H A D | ares_cancel.c | 29 struct list_node list_head_copy; in ares_cancel() 30 struct list_node* list_head; in ares_cancel() 31 struct list_node* list_node; in ares_cancel() local 47 for (list_node = list_head_copy.next; list_node != &list_head_copy; ) in ares_cancel() 49 query = list_node->data; in ares_cancel() 50 list_node = list_node->next; /* since we're deleting the query */ in ares_cancel()
|
/dports/games/abuse_sdl/abuse-0.8/src/ |
H A D | isllist.h | 20 class list_node 23 list_node * next; 26 list_node() { } in list_node() function 27 list_node(const T& item) { data = item; } in list_node() function 30 list_node * list; 36 list_node * node; 37 iterator(list_node * p) : node(p) { } in iterator() 59 list_node * p = new list_node(item); in insert_next() 68 list_node * p = pos.node->next; in erase_next() 86 list_node * tmp; in move_next() [all …]
|
/dports/net-p2p/c-lightning/lightning-0.10.2/ccan/ccan/list/ |
H A D | list.h | 24 struct list_node struct 26 struct list_node *next, *prev; argument 43 struct list_node n; 90 struct list_node *list_check_node(const struct list_node *n, 179 struct list_node *p, in list_add_after_() 180 struct list_node *n, in list_add_after_() 205 struct list_node *n, in list_add_() 228 struct list_node *p, in list_add_before_() 251 struct list_node *n, in list_add_tail_() 375 struct list_node *i; in list_del_from() [all …]
|