| /OK3568_Linux_fs/kernel/drivers/usb/gadget/udc/ |
| H A D | Kconfig | 43 dynamically linked module called "at91_udc" and force all
44 gadget drivers to also be dynamically linked.
55 dynamically linked module called "lpc32xx_udc" and force all
56 gadget drivers to also be dynamically linked.
89 dynamically linked module called "bcm63xx_udc".
102 dynamically linked module called "fsl_usb2_udc" and force
103 all gadget drivers to also be dynamically linked.
120 dynamically linked module called "fotg210_udc".
141 dynamically linked module called "omap_udc" and force all
142 gadget drivers to also be dynamically linked.
[all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/include/c++/10.3.1/ |
| H A D | iostream | 57 * manual linked to above.
60 extern istream cin; /// Linked to standard input
61 extern ostream cout; /// Linked to standard output
62 extern ostream cerr; /// Linked to standard error (unbuffered)
63 extern ostream clog; /// Linked to standard error (buffered)
66 extern wistream wcin; /// Linked to standard input
67 extern wostream wcout; /// Linked to standard output
68 extern wostream wcerr; /// Linked to standard error (unbuffered)
69 extern wostream wclog; /// Linked to standard error (buffered)
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/include/c++/10.3.1/ |
| H A D | iostream | 57 * manual linked to above.
60 extern istream cin; /// Linked to standard input
61 extern ostream cout; /// Linked to standard output
62 extern ostream cerr; /// Linked to standard error (unbuffered)
63 extern ostream clog; /// Linked to standard error (buffered)
66 extern wistream wcin; /// Linked to standard input
67 extern wostream wcout; /// Linked to standard output
68 extern wostream wcerr; /// Linked to standard error (unbuffered)
69 extern wostream wclog; /// Linked to standard error (buffered)
|
| /OK3568_Linux_fs/kernel/Documentation/bpf/ |
| H A D | drgn.rst | 53 …654: BPF_PROG_TYPE_TRACING test_main linked:[650->25: BPF_TRAMP_…
54 …655: BPF_PROG_TYPE_TRACING test_subprog1 linked:[650->29: BPF_TRAMP_…
55 …656: BPF_PROG_TYPE_TRACING test_subprog2 linked:[650->31: BPF_TRAMP_…
56 …657: BPF_PROG_TYPE_TRACING test_subprog3 linked:[650->21: BPF_TRAMP_…
57 …658: BPF_PROG_TYPE_EXT new_get_skb_len linked:[650->16: BPF_TRAMP_…
58 …659: BPF_PROG_TYPE_EXT new_get_skb_ifindex linked:[650->23: BPF_TRAMP_…
59 …660: BPF_PROG_TYPE_EXT new_get_constant linked:[650->19: BPF_TRAMP_…
67 …658: BPF_PROG_TYPE_EXT new_get_skb_len linked:[650->16: BPF_TRAMP_…
109 if linked:
110 linked = f" linked:[{linked}]"
[all …]
|
| /OK3568_Linux_fs/kernel/drivers/usb/gadget/legacy/ |
| H A D | Kconfig | 63 dynamically linked module called "g_zero".
98 dynamically linked module called "g_audio".
151 dynamically linked module called "g_ether".
204 dynamically linked module called "g_ncm".
216 dynamically linked module called "gadgetfs".
235 a dynamically linked module called "g_ffs".
277 a dynamically linked module called "g_mass_storage".
310 dynamically linked module called "g_serial".
330 dynamically linked module called "g_midi".
344 dynamically linked module called "g_printer".
[all …]
|
| /OK3568_Linux_fs/kernel/drivers/scsi/aic7xxx/ |
| H A D | queue.h | 34 * This file defines five types of data structures: singly-linked lists,
35 * singly-linked tail queues, lists, tail queues, and circular queues.
37 * A singly-linked list is headed by a single forward pointer. The elements
38 * are singly linked for minimum space and pointer manipulation overhead at
42 * macro for this purpose for optimum efficiency. A singly-linked list may
43 * only be traversed in the forward direction. Singly-linked lists are ideal
47 * A singly-linked tail queue is headed by a pair of pointers, one to the
49 * singly linked for minimum space and pointer manipulation overhead at the
54 * A singly-linked tail queue may only be traversed in the forward direction.
55 * Singly-linked tail queues are ideal for applications with large datasets
[all …]
|
| /OK3568_Linux_fs/kernel/Documentation/locking/ |
| H A D | robust-futex-ABI.rst | 12 linked list in user space, where it can be updated efficiently as locks
30 as glibc linked with the application) has to manage and place the
56 pointer to a single linked list of 'lock entries', one per lock,
73 Each 'lock entry' on the single linked list starting at 'head' consists
109 linked list, but that doesn't matter to the kernel.
111 By keeping its locks linked this way, on a list starting with a 'head'
126 that thread's robust_futex linked lock list a given time.
145 of the 'lock word', to the linked list starting at 'head', and
174 1) the 'head' pointer or an subsequent linked list pointer
|
| /OK3568_Linux_fs/kernel/include/net/ |
| H A D | fq.h | 19 * @flowchain: can be linked to fq_tin's new_flows or old_flows. Used for DRR++
22 * @backlogchain: can be linked to other fq_flow and fq. Used to keep track of
44 * @new_flows: linked list of fq_flow
45 * @old_flows: linked list of fq_flow
62 * @backlogs: linked to fq_flows. Used to maintain fat flows for efficient
|
| /OK3568_Linux_fs/kernel/drivers/staging/most/net/ |
| H A D | net.c | 57 bool linked; member
71 static struct mutex probe_disc_mt; /* ch->linked = true, most_nd_open */
72 static DEFINE_SPINLOCK(list_lock); /* list_head, ch->linked = false, dev_hold */
297 if (nd && nd->rx.linked && nd->tx.linked) in get_net_dev_hold()
342 if (ch->linked) { in comp_probe_channel()
355 ch->linked = true; in comp_probe_channel()
377 if (nd->rx.linked && channel_idx == nd->rx.ch_id) { in comp_disconnect_channel()
379 } else if (nd->tx.linked && channel_idx == nd->tx.ch_id) { in comp_disconnect_channel()
386 if (nd->rx.linked && nd->tx.linked) { in comp_disconnect_channel()
388 ch->linked = false; in comp_disconnect_channel()
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/lib/gcc/arm-none-linux-gnueabihf/10.3.1/plugin/include/ |
| H A D | bitmap.h | 23 /* Implementation of sparse integer sets as a linked list or tree.
28 Sets are represented as double-linked lists of container nodes of
33 to the next and previous element in the linked list, or left and
34 right children in the tree. In linked-list form, the container
50 The storage requirements for linked-list sparse sets are O(E), with E->N
59 The linked-list set representation works well for problems involving very
67 for the linked-list, but in practice this is only true for truely
78 Traversing linked lists or trees can be cache-unfriendly. Performance
92 linked-list set.
95 LINKED LIST FORM
[all …]
|
| H A D | gengtype.h | 123 /* Various things, organized as linked lists, needed both in
211 pair_p next; /* The next pair in the linked list. */
215 options_p opt; /* GTY options, as a linked list. */
250 linked using this 'next' field. The homonymous list starts at the
282 pair_p fields; /* the linked list of fields. */
287 element of a linked list of homonymous struct or union types.
298 /* The head of a singly-linked list of immediate descendents in
388 made in INPF and is linked into every language that uses INPF. May
395 declarations made in INPF and is linked into every language that
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/lib/gcc/aarch64-none-linux-gnu/10.3.1/plugin/include/ |
| H A D | bitmap.h | 23 /* Implementation of sparse integer sets as a linked list or tree.
28 Sets are represented as double-linked lists of container nodes of
33 to the next and previous element in the linked list, or left and
34 right children in the tree. In linked-list form, the container
50 The storage requirements for linked-list sparse sets are O(E), with E->N
59 The linked-list set representation works well for problems involving very
67 for the linked-list, but in practice this is only true for truely
78 Traversing linked lists or trees can be cache-unfriendly. Performance
92 linked-list set.
95 LINKED LIST FORM
[all …]
|
| H A D | gengtype.h | 123 /* Various things, organized as linked lists, needed both in
211 pair_p next; /* The next pair in the linked list. */
215 options_p opt; /* GTY options, as a linked list. */
250 linked using this 'next' field. The homonymous list starts at the
282 pair_p fields; /* the linked list of fields. */
287 element of a linked list of homonymous struct or union types.
298 /* The head of a singly-linked list of immediate descendents in
388 made in INPF and is linked into every language that uses INPF. May
395 declarations made in INPF and is linked into every language that
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/config/ |
| H A D | user.hpp | 84 // to be linked as dll's rather than static libraries on Microsoft Windows
88 // be linked in one way (statically or dynamically), in these cases this
92 // BOOST_WHATEVER_DYN_LINK: Forces library "whatever" to be linked as a dll
100 // be linked in one way (statically or dynamically),
107 // build variant will be automatically selected and linked against,
117 // build variant will be automatically selected and linked against, simply
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/aarch64-none-linux-gnu/libc/usr/include/sys/ |
| H A D | queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions.
[all …]
|
| /OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/arm-none-linux-gnueabihf/libc/usr/include/sys/ |
| H A D | queue.h | 36 * This file defines five types of data structures: singly-linked lists,
39 * A singly-linked list is headed by a single forward pointer. The
40 * elements are singly linked for minimum space and pointer manipulation
45 * efficiency. A singly-linked list may only be traversed in the forward
46 * direction. Singly-linked lists are ideal for applications with large
50 * pointers for a hash table header). The elements are doubly linked
58 * linked to save space, so elements can only be removed from the
65 * linked so that an arbitrary element can be removed without a need to
72 * linked so that an arbitrary element can be removed without a need to
148 * Singly-linked List definitions.
[all …]
|
| /OK3568_Linux_fs/kernel/drivers/usb/usbip/ |
| H A D | stub.h | 31 * stub_priv is always linked to any one of 3 lists;
32 * priv_init: linked to this until the comletion of a urb.
33 * priv_tx : linked to this after the completion of a urb.
34 * priv_free: linked to this after the sending of the result.
|
| /OK3568_Linux_fs/kernel/drivers/net/usb/GobiNet/ |
| H A D | Structs.h | 188 // Structure that defines an entry in a Read Memory linked list
201 /* Next entry in linked list */
209 // Structure that defines an entry in a Notification linked list
222 /* Next entry in linked list */
230 // Structure that defines an entry in a URB linked list
237 /* Next entry in linked list */
245 // Structure that defines an entry in a Client Memory linked list
253 /* Linked list of Read entries */
257 /* Linked list of Notification entries */
262 /* Linked list of URB entries */
[all …]
|
| /OK3568_Linux_fs/kernel/drivers/video/rockchip/iep/ |
| H A D | iep_drv.h | 94 /* a linked list of data so we can access them for debugging */
96 /* a linked list of register data waiting for process */
98 /* a linked list of register data in ready */
100 /* a linked list of register data in processing */
|
| /OK3568_Linux_fs/u-boot/arch/arm/lib/ |
| H A D | relocate_64.S | 36 * running at an address other than it was linked to, that instruction
38 * correctly apply relocations, we need to know the linked value.
40 * Linked &__image_copy_start, which we know was at
44 ldr x1, _TEXT_BASE /* x1 <- Linked &__image_copy_start */
|
| /OK3568_Linux_fs/yocto/poky/meta/files/common-licenses/ |
| H A D | LGPL-3.0-only | 18 …r version of the Library with which the Combined Work was made is also called the “Linked Version”.
20 …ed Work that, considered in isolation, are based on the Application, and not on the Linked Version.
48 …er to recombine or relink the Application with a modified version of the Linked Version to produce…
49 …operly with a modified version of the Library that is interface-compatible with the Linked Version.
50 … recombining or relinking the Application with a modified version of the Linked Version. (If you u…
|
| H A D | LGPL-3.0-or-later | 38 Work was made is also called the "Linked Version".
45 and not on the Linked Version.
110 version of the Linked Version to produce a modified Combined Work, in the
117 Linked Version.
123 with a modified version of the Linked Version. (If you use option 4d0, the
|
| /OK3568_Linux_fs/buildroot/dl/qt5location/git/ |
| H A D | LICENSE.LGPL3 | 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
|
| /OK3568_Linux_fs/external/security/rk_tee_user/v1/export-user_ta/include/sys/ |
| H A D | queue.h | 40 * This file defines five types of data structures: singly-linked lists,
43 * A singly-linked list is headed by a single forward pointer. The
44 * elements are singly linked for minimum space and pointer manipulation
49 * efficiency. A singly-linked list may only be traversed in the forward
50 * direction. Singly-linked lists are ideal for applications with large
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
177 * Singly-linked List definitions.
[all …]
|
| /OK3568_Linux_fs/external/security/rk_tee_user/v2/export-ta_arm64/include/sys/ |
| H A D | queue.h | 41 * This file defines five types of data structures: singly-linked lists,
44 * A singly-linked list is headed by a single forward pointer. The
45 * elements are singly linked for minimum space and pointer manipulation
50 * efficiency. A singly-linked list may only be traversed in the forward
51 * direction. Singly-linked lists are ideal for applications with large
55 * pointers for a hash table header). The elements are doubly linked
63 * linked to save space, so elements can only be removed from the
70 * linked so that an arbitrary element can be removed without a need to
77 * linked so that an arbitrary element can be removed without a need to
183 * Singly-linked List definitions.
[all …]
|