| /freebsd/share/man/man3/ |
| H A D | queue.3 | 122 .Nd implementations of singly-linked lists, singly-linked tail queues,
228 Singly-linked lists
230 Singly-linked tail queues
248 Singly-linked lists are the simplest of the four data structures
250 Singly-linked lists are ideal for applications with large datasets
253 Singly-linked lists add the following functionality:
261 Singly-linked tail queues add the following functionality:
278 than singly-linked lists.
281 Singly-linked tail queues are ideal for applications with large datasets and
285 All doubly linked types of data structures (lists and tail queues)
[all …]
|
| /freebsd/contrib/file/magic/Magdir/ |
| H A D | sun | 15 >>20 belong =4096 dynamically linked executable
16 >>20 belong >4096 dynamically linked executable
21 >0 byte &0x80 dynamically linked executable
26 >0 byte &0x80 dynamically linked executable
33 >>20 belong =4096 dynamically linked executable
34 >>20 belong >4096 dynamically linked executable
39 >0 byte &0x80 dynamically linked executable
44 >0 byte &0x80 dynamically linked executable
51 >>20 belong =4096 dynamically linked executable
52 >>20 belong >4096 dynamically linked executable
[all …]
|
| H A D | hp | 55 >168 belong &0x00000004 dynamically linked
56 >(144) belong 0x054ef630 dynamically linked
60 >168 belong&0x4 0x4 dynamically linked
61 >(144) belong 0x054ef630 dynamically linked
65 >168 belong&0x4 0x4 dynamically linked
66 >(144) belong 0x054ef630 dynamically linked
79 >168 belong &0x00000004 dynamically linked
80 >(144) belong 0x054ef630 dynamically linked
84 >168 belong &0x00000004 dynamically linked
85 >(144) belong 0x054ef630 dynamically linked
[all …]
|
| H A D | freebsd | 25 # an executable, and is dynamically-linked if the "has run-time
33 # a dynamically-linked executable;
46 # a dynamically-linked executable, otherwise it's just an
57 # it's a dynamically-linked executable);
83 >>3 byte&0x80 0x80 dynamically linked executable
93 >>3 byte&0x80 0x80 dynamically linked executable
103 >>3 byte&0x80 0x80 dynamically linked executable
113 >>3 byte&0x80 0x80 dynamically linked executable
|
| H A D | bsdi | 17 >>20 belong =4096 dynamically linked executable
18 >>20 belong >4096 dynamically linked executable
24 >0 byte &0x80 dynamically linked executable
30 >0 byte &0x80 dynamically linked executable
|
| H A D | netbsd | 24 >>20 lelong =4096 dynamically linked executable
25 >>20 lelong >4096 dynamically linked executable
32 >>20 lelong =8192 dynamically linked executable
33 >>20 lelong >8192 dynamically linked executable
39 >0 byte &0x80 dynamically linked executable
48 >0 byte &0x80 dynamically linked executable
|
| /freebsd/contrib/libpcap/ |
| H A D | pcap-config.in | 94 # completely statically linked program - i.e., linked only with
95 # static libraries - will be linked with all necessary
120 # dynamically-linked program, linked statically only with
121 # libpcap - i.e., linked with a static libpcap and dynamic
122 # versions of other libraries - will be linked with all
|
| /freebsd/contrib/nvi/ex/ |
| H A D | tag.h | 14 * connection, linked from the EX_PRIVATE structure.
17 SLIST_ENTRY(_csc) q; /* Linked list of cscope connections. */
37 * Tag file information. One of these is maintained per tag file, linked
41 TAILQ_ENTRY(_tagf) q; /* Linked list of tag files. */
75 TAILQ_ENTRY(_tag) q; /* Linked list of tags. */
94 TAILQ_ENTRY(_tagq) q; /* Linked list of tag queues. */
|
| /freebsd/sys/contrib/ck/include/ |
| H A D | ck_queue.h | 65 * This file defines three types of data structures: singly-linked lists,
66 * singly-linked tail queues and lists.
68 * A singly-linked list is headed by a single forward pointer. The elements
69 * are singly linked for minimum space and pointer manipulation overhead at
73 * macro for this purpose for optimum efficiency. A singly-linked list may
74 * only be traversed in the forward direction. Singly-linked lists are ideal
78 * A singly-linked tail queue is headed by a pair of pointers, one to the
80 * singly linked for minimum space and pointer manipulation overhead at the
85 * A singly-linked tail queue may only be traversed in the forward direction.
86 * Singly-linked tail queues are ideal for applications with large datasets
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ |
| H A D | InitializePasses.h | 21 /// Initialize all passes linked into the Core library.
24 /// Initialize all passes linked into the TransformUtils library.
27 /// Initialize all passes linked into the ScalarOpts library.
30 /// Initialize all passes linked into the Vectorize library.
33 /// Initialize all passes linked into the InstCombine library.
36 /// Initialize all passes linked into the IPO library.
39 /// Initialize all passes linked into the Analysis library.
42 /// Initialize all passes linked into the CodeGen library.
45 /// Initialize all passes linked into the GlobalISel library.
48 /// Initialize all passes linked into the CodeGen library.
|
| /freebsd/lib/libc/include/isc/ |
| H A D | list.h | 42 #define LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-1) && \ macro
51 INSIST(!LINKED(elt, link));\
63 INSIST(!LINKED(elt, link));\
75 INSIST(LINKED(elt, link));\
98 INSIST(!LINKED(elt, link));\
111 INSIST(!LINKED(elt, link));\
|
| /freebsd/sbin/kldstat/ |
| H A D | kldstat.8 | 47 utility displays the status of any files dynamically linked into the
71 Show files dynamically linked into the kernel.
136 is linked.
139 $ kldstat -q -n fakefile || echo file not linked
140 file not linked
|
| /freebsd/contrib/openbsm/compat/ |
| H A D | queue.h | 40 * This file defines four types of data structures: singly-linked lists,
41 * singly-linked tail queues, lists and tail queues.
43 * A singly-linked list is headed by a single forward pointer. The elements
44 * are singly linked for minimum space and pointer manipulation overhead at
48 * macro for this purpose for optimum efficiency. A singly-linked list may
49 * only be traversed in the forward direction. Singly-linked lists are ideal
53 * A singly-linked tail queue is headed by a pair of pointers, one to the
55 * singly linked for minimum space and pointer manipulation overhead at the
60 * A singly-linked tail queue may only be traversed in the forward direction.
61 * Singly-linked tail queues are ideal for applications with large datasets
[all …]
|
| /freebsd/sys/netpfil/ipfw/ |
| H A D | dummynet.txt | 187 - fsu: contains flowset that are not linked with any scheduler.
382 be linked with this pipe. If so, these flowset will be of wf2q+ type (for
395 flowset list to search eventually flowset that would be linked with this
402 contains all flowset that aren't linked with a scheduler, the flowset list
403 contains flowset linked to a scheduler, and so they have a type.
407 linked doesn't exists, or added in the flowset list and configured properly if
427 scheduler flowset specific data is linked with the flowset writing the
430 these are linked to the parent scheduler writing the id of the parent in the
432 the buffer and linked thorugh the 'obj' and 'sched_inst' pointer.
469 the linked flowset is deleting and if so the counter is decrementing. If the
[all …]
|
| /freebsd/contrib/nvi/common/ |
| H A D | cut.h | 15 SLIST_ENTRY(_cb) q; /* Linked list of cut buffers. */
16 TEXTH textq[1]; /* Linked list of TEXT structures. */
26 struct _text { /* Text: a linked list of lines. */
27 TAILQ_ENTRY(_text) q; /* Linked list of text structures. */
|
| /freebsd/contrib/ntp/sntp/libevent/compat/sys/ |
| H A D | queue.h | 39 * This file defines five types of data structures: singly-linked lists,
43 * A singly-linked list is headed by a single forward pointer. The elements
44 * are singly linked for minimum space and pointer manipulation overhead at
48 * macro for this purpose for optimum efficiency. A singly-linked list may
49 * only be traversed in the forward direction. Singly-linked lists are ideal
54 * pointers for a hash table header). The elements are doubly linked
62 * linked to save space, so elements can only be removed from the
69 * linked so that an arbitrary element can be removed without a need to
76 * linked so that an arbitrary element can be removed without a need to
86 * Singly-linked List definitions.
[all …]
|
| /freebsd/contrib/libevent/compat/sys/ |
| H A D | queue.h | 39 * This file defines five types of data structures: singly-linked lists,
43 * A singly-linked list is headed by a single forward pointer. The elements
44 * are singly linked for minimum space and pointer manipulation overhead at
48 * macro for this purpose for optimum efficiency. A singly-linked list may
49 * only be traversed in the forward direction. Singly-linked lists are ideal
54 * pointers for a hash table header). The elements are doubly linked
62 * linked to save space, so elements can only be removed from the
69 * linked so that an arbitrary element can be removed without a need to
76 * linked so that an arbitrary element can be removed without a need to
86 * Singly-linked List definitions.
[all …]
|
| /freebsd/crypto/openssl/doc/man3/ |
| H A D | SSL_get_fd.pod | 5 SSL_get_fd, SSL_get_rfd, SSL_get_wfd - get file descriptor linked to an SSL object
17 SSL_get_fd() returns the file descriptor which is linked to B<ssl>.
36 The file descriptor linked to B<ssl>.
|
| /freebsd/share/man/man8/ |
| H A D | rescue.8 | 38 With the transition to a dynamically-linked root beginning with
47 are statically linked and should therefore be more resistant to
49 However, being statically linked, the tools in
111 is statically linked, it should also be possible to dispense with much
|
| /freebsd/sys/dev/clk/ |
| H A D | clk_link.c | 71 printf("%s: Attempt to use unresolved linked clock: %s\n", __func__, in clknode_link_recalc()
81 printf("%s: Attempt to use unresolved linked clock: %s\n", __func__, in clknode_link_set_freq()
90 printf("%s: Attempt to use unresolved linked clock: %s\n", __func__, in clknode_link_set_mux()
99 printf("%s: Attempt to use unresolved linked clock: %s\n", __func__, in clknode_link_set_gate()
|
| /freebsd/share/man/man9/ |
| H A D | BUF_RECURSED.9 | 33 .Nd "checks if the lock linked to the buffer is recursed"
45 function checks if the lock linked to the given buffer is recursed and
51 The buffer linked to the lock.
|
| /freebsd/contrib/tcpdump/ |
| H A D | netdissect-alloc.c | 28 /* Add a memory chunk in allocation linked list */
39 /* malloc replacement, with tracking in a linked list */
50 /* Free chunks in allocation linked list from last to first */
|
| /freebsd/libexec/rbootd/ |
| H A D | utils.c | 279 ** FreeClient -- free linked list of Clients.
288 ** - All malloc'd memory associated with the linked list of
411 ** FreeConns -- free linked list of RMPCONN connections.
420 ** - All malloc'd memory associated with the linked list of
445 ** AddConn -- Add a connection to the linked list of connections.
468 ** FindConn -- Find a connection in the linked list of connections.
478 ** Matching connection from linked list or NULL if not found.
500 ** RemoveConn -- Remove a connection from the linked list of connections.
510 ** be removed from the linked list.
523 } else { /* must traverse linked list */ in RemoveConn()
|
| /freebsd/contrib/ntp/sntp/libopts/ |
| H A D | COPYING.lgplv3 | 29 with which the Combined Work was made is also called the "Linked
35 based on the Application, and not on the Linked Version.
105 the Linked Version to produce a modified Combined Work, in the
113 of the Library that is interface-compatible with the Linked
121 Application with a modified version of the Linked Version. (If
|
| /freebsd/contrib/libarchive/unzip/ |
| H A D | la_queue.h | 11 * This file defines four types of data structures: singly-linked lists,
12 * singly-linked tail queues, lists and tail queues.
14 * A singly-linked list is headed by a single forward pointer. The elements
15 * are singly linked for minimum space and pointer manipulation overhead at
19 * macro for this purpose for optimum efficiency. A singly-linked list may
20 * only be traversed in the forward direction. Singly-linked lists are ideal
24 * A singly-linked tail queue is headed by a pair of pointers, one to the
26 * singly linked for minimum space and pointer manipulation overhead at the
31 * A singly-linked tail queue may only be traversed in the forward direction.
32 * Singly-linked tail queues are ideal for applications with large datasets
[all …]
|