Searched refs:head (Results 1 - 25 of 3813) sorted by relevance

1234567891011>>

/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/arch/m68knommu/platform/68328/
H A DMakefile5 head-y = head-$(MODEL).o
6 head-$(CONFIG_PILOT) = head-pilot.o
7 head-$(CONFIG_DRAGEN2) = head-de2.o
13 extra-y := head.o
14 extra-$(CONFIG_M68328) += bootlogo.rh head.o
19 $(obj)/head.o: $(obj)/$(head
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/arch/avr32/oprofile/
H A Dbacktrace.c35 static struct frame_head *dump_user_backtrace(struct frame_head *head) argument
40 if (!access_ok(VERIFY_READ, head, sizeof(bufhead)))
42 if (__copy_from_user_inatomic(bufhead, head, sizeof(bufhead)))
49 if (bufhead[0].fp <= head)
58 struct frame_head *head = (struct frame_head *)(regs->r7); local
67 (unsigned long)head)) {
68 oprofile_add_trace(head->lr);
69 if (head->fp <= head)
71 head
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/arch/m68knommu/platform/68328/
H A DMakefile5 head-y = head-$(MODEL).o
6 head-$(CONFIG_PILOT) = head-pilot.o
7 head-$(CONFIG_DRAGEN2) = head-de2.o
13 extra-y := head.o
14 extra-$(CONFIG_M68328) += bootlogo.rh head.o
19 $(obj)/head.o: $(obj)/$(head
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/arch/avr32/oprofile/
H A Dbacktrace.c35 static struct frame_head *dump_user_backtrace(struct frame_head *head) argument
40 if (!access_ok(VERIFY_READ, head, sizeof(bufhead)))
42 if (__copy_from_user_inatomic(bufhead, head, sizeof(bufhead)))
49 if (bufhead[0].fp <= head)
58 struct frame_head *head = (struct frame_head *)(regs->r7); local
67 (unsigned long)head)) {
68 oprofile_add_trace(head->lr);
69 if (head->fp <= head)
71 head
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/drivers/scsi/aic7xxx/
H A Dqueue.h40 * added to the list after an existing element or at the head of the list.
41 * Elements being removed from the head of the list should use the explicit
48 * head of the list and the other to the tail of the list. The elements are
51 * to the list after an existing element, at the head of the list, or at the
52 * end of the list. Elements being removed from the head of the tail queue
62 * or after an existing element or at the head of the list. A list
65 * A tail queue is headed by a pair of pointers, one to the head of the
69 * after an existing element, at the head of the list, or at the end of
72 * A circle queue is headed by a pair of pointers, one to the head of the
76 * an existing element, at the head o
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/drivers/scsi/aic7xxx/
H A Dqueue.h40 * added to the list after an existing element or at the head of the list.
41 * Elements being removed from the head of the list should use the explicit
48 * head of the list and the other to the tail of the list. The elements are
51 * to the list after an existing element, at the head of the list, or at the
52 * end of the list. Elements being removed from the head of the tail queue
62 * or after an existing element or at the head of the list. A list
65 * A tail queue is headed by a pair of pointers, one to the head of the
69 * after an existing element, at the head of the list, or at the end of
72 * A circle queue is headed by a pair of pointers, one to the head of the
76 * an existing element, at the head o
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/include/linux/
H A Dcirc_buf.h10 int head; member in struct:circ_buf
15 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size)-1))
18 as a completely full buffer has head == tail, which is the same as
20 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head)+1),(size))
23 accessing head and tail more than once, so they can change
25 #define CIRC_CNT_TO_END(head,tail,size) \
27 int n = ((head) + end) & ((size)-1); \
31 #define CIRC_SPACE_TO_END(head,tai
[all...]
H A Dplist.h102 #define _PLIST_HEAD_INIT(head) \
103 .prio_list = LIST_HEAD_INIT((head).prio_list), \
104 .node_list = LIST_HEAD_INIT((head).node_list)
108 * @head: struct plist_head variable name
111 #define PLIST_HEAD_INIT(head, _lock) \
113 _PLIST_HEAD_INIT(head), \
119 * @head: struct plist_head variable name
122 #define PLIST_HEAD_INIT_RAW(head, _lock) \
124 _PLIST_HEAD_INIT(head), \
141 * @head
145 plist_head_init(struct plist_head *head, spinlock_t *lock) argument
161 plist_head_init_raw(struct plist_head *head, raw_spinlock_t *lock) argument
229 plist_head_empty(const struct plist_head *head) argument
285 plist_first(const struct plist_head *head) argument
297 plist_last(const struct plist_head *head) argument
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/drivers/infiniband/hw/amso1100/
H A Dc2_alloc.c40 struct sp_chunk **head)
55 new_head->head = 0;
67 *head = new_head;
89 __be16 *c2_alloc_mqsp(struct c2_dev *c2dev, struct sp_chunk *head, argument
94 while (head) {
95 mqsp = head->head;
97 head->head = head
39 c2_alloc_mqsp_chunk(struct c2_dev *c2dev, gfp_t gfp_mask, struct sp_chunk **head) argument
124 struct sp_chunk *head; local
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/drivers/infiniband/hw/amso1100/
H A Dc2_alloc.c40 struct sp_chunk **head)
55 new_head->head = 0;
67 *head = new_head;
89 __be16 *c2_alloc_mqsp(struct c2_dev *c2dev, struct sp_chunk *head, argument
94 while (head) {
95 mqsp = head->head;
97 head->head = head
39 c2_alloc_mqsp_chunk(struct c2_dev *c2dev, gfp_t gfp_mask, struct sp_chunk **head) argument
124 struct sp_chunk *head; local
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/include/linux/
H A Dcirc_buf.h10 int head; member in struct:circ_buf
15 #define CIRC_CNT(head,tail,size) (((head) - (tail)) & ((size)-1))
18 as a completely full buffer has head == tail, which is the same as
20 #define CIRC_SPACE(head,tail,size) CIRC_CNT((tail),((head)+1),(size))
23 accessing head and tail more than once, so they can change
25 #define CIRC_CNT_TO_END(head,tail,size) \
27 int n = ((head) + end) & ((size)-1); \
31 #define CIRC_SPACE_TO_END(head,tai
[all...]
H A Dplist.h102 #define _PLIST_HEAD_INIT(head) \
103 .prio_list = LIST_HEAD_INIT((head).prio_list), \
104 .node_list = LIST_HEAD_INIT((head).node_list)
108 * @head: struct plist_head variable name
111 #define PLIST_HEAD_INIT(head, _lock) \
113 _PLIST_HEAD_INIT(head), \
119 * @head: struct plist_head variable name
122 #define PLIST_HEAD_INIT_RAW(head, _lock) \
124 _PLIST_HEAD_INIT(head), \
141 * @head
145 plist_head_init(struct plist_head *head, spinlock_t *lock) argument
161 plist_head_init_raw(struct plist_head *head, raw_spinlock_t *lock) argument
229 plist_head_empty(const struct plist_head *head) argument
285 plist_first(const struct plist_head *head) argument
297 plist_last(const struct plist_head *head) argument
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/arch/m68knommu/platform/68360/
H A DMakefile7 extra-y := head.o
9 $(obj)/head.o: $(obj)/head-$(MODEL).o
10 ln -sf head-$(MODEL).o $(obj)/head.o
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/arch/m68knommu/platform/68360/
H A DMakefile7 extra-y := head.o
9 $(obj)/head.o: $(obj)/head-$(MODEL).o
10 ln -sf head-$(MODEL).o $(obj)/head.o
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/samba-3.5.8/source4/heimdal/lib/gssapi/mech/
H A Dmechqueue.h47 #define SLIST_HEAD_INITIALIZER(head) \
58 #define SLIST_INIT(head) do { \
59 (head)->slh_first = NULL; \
67 #define SLIST_INSERT_HEAD(head, elm, field) do { \
68 (elm)->field.sle_next = (head)->slh_first; \
69 (head)->slh_first = (elm); \
72 #define SLIST_REMOVE_HEAD(head, field) do { \
73 (head)->slh_first = (head)->slh_first->field.sle_next; \
76 #define SLIST_REMOVE(head, el
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/samba-3.5.8/source4/heimdal/lib/gssapi/mech/
H A Dmechqueue.h47 #define SLIST_HEAD_INITIALIZER(head) \
58 #define SLIST_INIT(head) do { \
59 (head)->slh_first = NULL; \
67 #define SLIST_INSERT_HEAD(head, elm, field) do { \
68 (elm)->field.sle_next = (head)->slh_first; \
69 (head)->slh_first = (elm); \
72 #define SLIST_REMOVE_HEAD(head, field) do { \
73 (head)->slh_first = (head)->slh_first->field.sle_next; \
76 #define SLIST_REMOVE(head, el
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/samba-3.5.8/source4/heimdal/lib/gssapi/mech/
H A Dmechqueue.h47 #define SLIST_HEAD_INITIALIZER(head) \
58 #define SLIST_INIT(head) do { \
59 (head)->slh_first = NULL; \
67 #define SLIST_INSERT_HEAD(head, elm, field) do { \
68 (elm)->field.sle_next = (head)->slh_first; \
69 (head)->slh_first = (elm); \
72 #define SLIST_REMOVE_HEAD(head, field) do { \
73 (head)->slh_first = (head)->slh_first->field.sle_next; \
76 #define SLIST_REMOVE(head, el
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/netatalk-3.0.5/libevent/
H A Dht-internal.h41 #define HT_EMPTY(head) \
42 ((head)->hth_n_entries == 0)
44 /* How many elements in 'head'? */
45 #define HT_SIZE(head) \
46 ((head)->hth_n_entries)
48 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (elm))
49 #define HT_INSERT(name, head, elm) name##_HT_INSERT((head), (elm))
50 #define HT_REPLACE(name, head, el
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/netatalk-3.0.5/libevent/
H A Dht-internal.h41 #define HT_EMPTY(head) \
42 ((head)->hth_n_entries == 0)
44 /* How many elements in 'head'? */
45 #define HT_SIZE(head) \
46 ((head)->hth_n_entries)
48 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (elm))
49 #define HT_INSERT(name, head, elm) name##_HT_INSERT((head), (elm))
50 #define HT_REPLACE(name, head, el
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/netatalk-3.0.5/libevent/
H A Dht-internal.h41 #define HT_EMPTY(head) \
42 ((head)->hth_n_entries == 0)
44 /* How many elements in 'head'? */
45 #define HT_SIZE(head) \
46 ((head)->hth_n_entries)
48 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (elm))
49 #define HT_INSERT(name, head, elm) name##_HT_INSERT((head), (elm))
50 #define HT_REPLACE(name, head, el
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/arch/m68k/include/asm/
H A Datafd.h8 int head; /* "" "" */ member in struct:atari_format_descr
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/arch/avr32/boot/u-boot/
H A DMakefile1 extra-y := head.o
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/arch/m68k/include/asm/
H A Datafd.h8 int head; /* "" "" */ member in struct:atari_format_descr
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/arch/avr32/boot/u-boot/
H A DMakefile1 extra-y := head.o
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/netatalk-3.0.5/libevent/compat/sys/
H A Dqueue.h46 * added to the list after an existing element or at the head of the list.
47 * Elements being removed from the head of the list should use the explicit
57 * or after an existing element or at the head of the list. A list
60 * A simple queue is headed by a pair of pointers, one the head of the
63 * head of the list. New elements can be added to the list before or after
64 * an existing element, at the head of the list, or at the end of the
67 * A tail queue is headed by a pair of pointers, one to the head of the
71 * after an existing element, at the head of the list, or at the end of
74 * A circle queue is headed by a pair of pointers, one to the head of the
78 * an existing element, at the head o
[all...]

Completed in 284 milliseconds

1234567891011>>