| /src/tests/include/sys/ |
| t_list.c | 52 LIST_HEAD(listhead, entry) old_head, new_head, old_copy;
68 LIST_MOVE(&old_head, &new_head, entries);
72 n3 = LIST_FIRST(&new_head);
79 LIST_REMOVE(LIST_FIRST(&new_head), entries);
80 ATF_CHECK_MSG(LIST_EMPTY(&new_head), "New list not empty!");
|
| /src/crypto/external/apache2/openssl/dist/ssl/quic/ |
| quic_srtm.c | 222 * The new head pointer is written to *new_head (which may or may not be
225 static void sorted_insert_seq_num(SRTM_ITEM *head, SRTM_ITEM *item, SRTM_ITEM **new_head)
228 SRTM_ITEM *cur = head, **fixup = new_head;
230 *new_head = head;
243 * The new head pointer is written to *new_head (which may or may not be
246 static void sorted_insert_srt(SRTM_ITEM *head, SRTM_ITEM *item, SRTM_ITEM **new_head)
249 SRTM_ITEM *cur = head, **fixup = new_head;
251 *new_head = head;
290 SRTM_ITEM *item = NULL, *head = NULL, *new_head, *r_item; local
319 sorted_insert_seq_num(head, item, &new_head);
[all...] |
| /src/external/lgpl2/userspace-rcu/dist/include/urcu/static/ |
| wfstack.h | 131 struct cds_wfs_head *old_head, *new_head; local
134 new_head = caa_container_of(node, struct cds_wfs_head, node);
140 old_head = uatomic_xchg_mo(&s->head, new_head, CMM_SEQ_CST);
179 struct cds_wfs_head *head, *new_head; local
194 new_head = caa_container_of(next, struct cds_wfs_head, node);
195 if (uatomic_cmpxchg_mo(&s->head, head, new_head,
197 if (state && ___cds_wfs_end(new_head))
|
| lfstack.h | 143 struct cds_lfs_head *new_head = local
159 head = uatomic_cmpxchg_mo(&s->head, old_head, new_head,
|
| wfcqueue.h | 171 struct cds_wfcq_node *new_head,
193 uatomic_store(&old_tail->next, new_head, CMM_RELEASE);
|
| /src/lib/libc/cdb/ |
| cdbw.c | 248 struct key_hash_head *head, *head2, *new_head; local
294 new_head = calloc(sizeof(*new_head), new_hash_size);
295 if (new_head == NULL)
300 SLIST_INIT(new_head + i);
307 head2 = new_head +
314 cdbw->hash = new_head;
|
| /src/external/bsd/jemalloc.old/dist/include/jemalloc/internal/ |
| cache_bin.h | 397 void **new_head = bin->stack_head + 1; local
404 bin->stack_head = new_head;
418 bin->stack_head = new_head;
419 bin->low_bits_low_water = (cache_bin_sz_t)(uintptr_t)new_head;
|
| /src/external/bsd/jemalloc.old/include/jemalloc/internal/ |
| cache_bin.h | 397 void **new_head = bin->stack_head + 1; local
404 bin->stack_head = new_head;
418 bin->stack_head = new_head;
419 bin->low_bits_low_water = (cache_bin_sz_t)(uintptr_t)new_head;
|
| /src/external/bsd/jemalloc/dist/include/jemalloc/internal/ |
| cache_bin.h | 397 void **new_head = bin->stack_head + 1; local
404 bin->stack_head = new_head;
418 bin->stack_head = new_head;
419 bin->low_bits_low_water = (cache_bin_sz_t)(uintptr_t)new_head;
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| cfgloopmanip.cc | 1562 basic_block new_head = NULL; local
1569 new_head = split_edge (e);
1571 lv_add_condition_to_bb (first_head, second_head, new_head,
1575 e = single_succ_edge (new_head);
1576 e1 = make_edge (new_head, first_head,
1581 set_immediate_dominator (CDI_DOMINATORS, first_head, new_head);
1582 set_immediate_dominator (CDI_DOMINATORS, second_head, new_head);
1585 lv_adjust_loop_header_phi (first_head, second_head, new_head, e1);
1587 return new_head;
|
| cfgrtl.cc | 1659 rtx_insn *new_head;
1669 new_head = table;
1671 new_head = BB_END (e->src);
1672 new_head = NEXT_INSN (new_head);
1674 jump_block = create_basic_block (new_head, NULL, e->src);
1651 rtx_insn *new_head; local
|
| tree-ssa.cc | 98 auto_vec<edge_var_map> *new_head = &edge_var_maps->get_or_insert (newe);
103 new_head->safe_splice (*old_head);
|
| tree-cfg.cc | 8992 of 'first'. Both of them are dominated by 'new_head' basic block. When
8993 'new_head' was created by 'second's incoming edge it received phi arguments
8995 connect 'new_head' and 'first'. Now this routine adds phi args on this
8996 additional edge 'e' that new_head to second edge received as part of edge
9001 basic_block new_head, edge e)
9006 edge e2 = find_edge (new_head, second);
9008 /* Because NEW_HEAD has been created by splitting SECOND's incoming
9009 edge, we should always have an edge from NEW_HEAD to SECOND. */
|
| /src/external/gpl3/gcc/dist/gcc/ |
| cfgloopmanip.cc | 1728 basic_block new_head = NULL; local
1735 new_head = split_edge (e);
1737 lv_add_condition_to_bb (first_head, second_head, new_head,
1741 e = single_succ_edge (new_head);
1742 e1 = make_edge (new_head, first_head,
1747 set_immediate_dominator (CDI_DOMINATORS, first_head, new_head);
1748 set_immediate_dominator (CDI_DOMINATORS, second_head, new_head);
1751 lv_adjust_loop_header_phi (first_head, second_head, new_head, e1);
1753 return new_head;
|
| cfgrtl.cc | 1624 rtx_insn *new_head;
1634 new_head = table;
1636 new_head = BB_END (e->src);
1637 new_head = NEXT_INSN (new_head);
1639 jump_block = create_basic_block (new_head, NULL, e->src);
1616 rtx_insn *new_head; local
|
| tree-ssa.cc | 98 auto_vec<edge_var_map> *new_head = &edge_var_maps->get_or_insert (newe);
103 new_head->safe_splice (*old_head);
|
| tree-cfg.cc | 9275 of 'first'. Both of them are dominated by 'new_head' basic block. When
9276 'new_head' was created by 'second's incoming edge it received phi arguments
9278 connect 'new_head' and 'first'. Now this routine adds phi args on this
9279 additional edge 'e' that new_head to second edge received as part of edge
9284 basic_block new_head, edge e)
9289 edge e2 = find_edge (new_head, second);
9291 /* Because NEW_HEAD has been created by splitting SECOND's incoming
9292 edge, we should always have an edge from NEW_HEAD to SECOND. */
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/src/c++20/ |
| tzdb.cc | 162 _S_cache_list_head(_Node* new_head) noexcept
163 { _S_head_cache = new_head; }
1329 shared_ptr<_Node> new_head)
1331 _Node* new_head_ptr = new_head.get();
1334 while (!_S_head_owner.compare_exchange_strong(curr, new_head))
1349 _S_head_owner = std::move(new_head);
|
| /src/external/gpl3/binutils/dist/bfd/ |
| archive.c | 309 bool bfd_set_archive_head (bfd *output, bfd *new_head);
313 BFDs contained in the archive @var{output} to @var{new_head}.
317 bfd_set_archive_head (bfd *output_archive, bfd *new_head)
319 output_archive->archive_head = new_head;
|
| bfd-in2.h | 1292 bool bfd_set_archive_head (bfd *output, bfd *new_head);
|
| /src/external/gpl3/binutils.old/dist/bfd/ |
| archive.c | 312 bool bfd_set_archive_head (bfd *output, bfd *new_head);
316 BFDs contained in the archive @var{output} to @var{new_head}.
320 bfd_set_archive_head (bfd *output_archive, bfd *new_head)
322 output_archive->archive_head = new_head;
|
| /src/external/gpl3/gdb.old/dist/bfd/ |
| archive.c | 309 bool bfd_set_archive_head (bfd *output, bfd *new_head);
313 BFDs contained in the archive @var{output} to @var{new_head}.
317 bfd_set_archive_head (bfd *output_archive, bfd *new_head)
319 output_archive->archive_head = new_head;
|
| /src/external/gpl3/gdb/dist/bfd/ |
| archive.c | 310 bool bfd_set_archive_head (bfd *output, bfd *new_head);
314 BFDs contained in the archive @var{output} to @var{new_head}.
318 bfd_set_archive_head (bfd *output_archive, bfd *new_head)
320 output_archive->archive_head = new_head;
|
| /src/external/gpl3/binutils/lib/libbfd/arch/aarch64/ |
| bfd.h | 1296 bool bfd_set_archive_head (bfd *output, bfd *new_head);
|
| /src/external/gpl3/binutils/lib/libbfd/arch/aarch64eb/ |
| bfd.h | 1296 bool bfd_set_archive_head (bfd *output, bfd *new_head);
|
