Searched refs:head (Results 176 - 200 of 3813) sorted by relevance

1234567891011>>

/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/db-4.8.30/build_vxworks/test_micro/
H A Db_workload.h69 struct bench_qentry *head; member in struct:bench_q
77 if (queue.head == NULL) \
78 queue.head = queue.tail = entry; \
86 struct bench_qentry *popped = queue.head; \
89 if (queue.head->next == NULL) \
90 queue.head = queue.tail = NULL; \
92 queue.head = queue.head->next; \
98 * Retrieve the head of the queue, save the data into user
103 struct bench_qentry *popped = queue.head; \
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/kernel/
H A Dfutex_compat.c22 compat_uptr_t __user *head, int *pi)
24 if (get_user(*uentry, head))
50 struct compat_robust_list_head __user *head = curr->compat_robust_list; local
61 * Fetch the list head (which was registered earlier, via
64 if (fetch_robust_entry(&uentry, &entry, &head->list.next, &pi))
69 if (get_user(futex_offset, &head->futex_offset))
76 &head->list_op_pending, &pip))
80 while (entry != (struct robust_list __user *) &head->list) {
118 compat_sys_set_robust_list(struct compat_robust_list_head __user *head, argument
124 if (unlikely(len != sizeof(*head)))
21 fetch_robust_entry(compat_uptr_t *uentry, struct robust_list __user **entry, compat_uptr_t __user *head, int *pi) argument
136 struct compat_robust_list_head __user *head; local
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/db-4.8.30/build_vxworks/test_micro/
H A Db_workload.h69 struct bench_qentry *head; member in struct:bench_q
77 if (queue.head == NULL) \
78 queue.head = queue.tail = entry; \
86 struct bench_qentry *popped = queue.head; \
89 if (queue.head->next == NULL) \
90 queue.head = queue.tail = NULL; \
92 queue.head = queue.head->next; \
98 * Retrieve the head of the queue, save the data into user
103 struct bench_qentry *popped = queue.head; \
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/db-4.8.30/test_micro/source/
H A Db_workload.h69 struct bench_qentry *head; member in struct:bench_q
77 if (queue.head == NULL) \
78 queue.head = queue.tail = entry; \
86 struct bench_qentry *popped = queue.head; \
89 if (queue.head->next == NULL) \
90 queue.head = queue.tail = NULL; \
92 queue.head = queue.head->next; \
98 * Retrieve the head of the queue, save the data into user
103 struct bench_qentry *popped = queue.head; \
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/db-4.8.30/test_micro/source/
H A Db_workload.h69 struct bench_qentry *head; member in struct:bench_q
77 if (queue.head == NULL) \
78 queue.head = queue.tail = entry; \
86 struct bench_qentry *popped = queue.head; \
89 if (queue.head->next == NULL) \
90 queue.head = queue.tail = NULL; \
92 queue.head = queue.head->next; \
98 * Retrieve the head of the queue, save the data into user
103 struct bench_qentry *popped = queue.head; \
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/db-4.8.30/build_vxworks/test_micro/
H A Db_workload.h69 struct bench_qentry *head; member in struct:bench_q
77 if (queue.head == NULL) \
78 queue.head = queue.tail = entry; \
86 struct bench_qentry *popped = queue.head; \
89 if (queue.head->next == NULL) \
90 queue.head = queue.tail = NULL; \
92 queue.head = queue.head->next; \
98 * Retrieve the head of the queue, save the data into user
103 struct bench_qentry *popped = queue.head; \
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/db-4.8.30/test_micro/source/
H A Db_workload.h69 struct bench_qentry *head; member in struct:bench_q
77 if (queue.head == NULL) \
78 queue.head = queue.tail = entry; \
86 struct bench_qentry *popped = queue.head; \
89 if (queue.head->next == NULL) \
90 queue.head = queue.tail = NULL; \
92 queue.head = queue.head->next; \
98 * Retrieve the head of the queue, save the data into user
103 struct bench_qentry *popped = queue.head; \
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/arch/powerpc/platforms/pseries/
H A Dhvcserver.c68 * @head: list_head pointer for an allocated list of partner info structs to
74 int hvcs_free_partner_info(struct list_head *head) argument
79 if (!head)
82 while (!list_empty(head)) {
83 element = head->next;
110 * @head: An initialized list_head pointer to an empty list to use to return the
128 * hvcs_free_partner_info() using a pointer to the SAME list head instance
131 int hvcs_get_partner_info(uint32_t unit_address, struct list_head *head, argument
146 if (!head || !pi_buff)
150 INIT_LIST_HEAD(head);
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/arch/powerpc/platforms/pseries/
H A Dhvcserver.c68 * @head: list_head pointer for an allocated list of partner info structs to
74 int hvcs_free_partner_info(struct list_head *head) argument
79 if (!head)
82 while (!list_empty(head)) {
83 element = head->next;
110 * @head: An initialized list_head pointer to an empty list to use to return the
128 * hvcs_free_partner_info() using a pointer to the SAME list head instance
131 int hvcs_get_partner_info(uint32_t unit_address, struct list_head *head, argument
146 if (!head || !pi_buff)
150 INIT_LIST_HEAD(head);
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/net/ipv6/netfilter/
H A Dnf_conntrack_reasm.c340 struct sk_buff *fp, *op, *head = fq->q.fragments; local
345 WARN_ON(head == NULL);
346 WARN_ON(NFCT_FRAG6_CB(head)->offset != 0);
349 payload_len = ((head->data - skb_network_header(head)) -
358 if (skb_cloned(head) && pskb_expand_head(head, 0, 0, GFP_ATOMIC)) {
359 pr_debug("skb is cloned but can't expand head");
366 if (skb_has_frags(head)) {
374 clone->next = head
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/net/ipv6/netfilter/
H A Dnf_conntrack_reasm.c340 struct sk_buff *fp, *op, *head = fq->q.fragments; local
345 WARN_ON(head == NULL);
346 WARN_ON(NFCT_FRAG6_CB(head)->offset != 0);
349 payload_len = ((head->data - skb_network_header(head)) -
358 if (skb_cloned(head) && pskb_expand_head(head, 0, 0, GFP_ATOMIC)) {
359 pr_debug("skb is cloned but can't expand head");
366 if (skb_has_frags(head)) {
374 clone->next = head
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/lib/
H A Dbtree.c93 static unsigned long *btree_node_alloc(struct btree_head *head, gfp_t gfp) argument
97 node = mempool_alloc(head->mempool, gfp);
176 static inline void __btree_init(struct btree_head *head) argument
178 head->node = NULL;
179 head->height = 0;
182 void btree_init_mempool(struct btree_head *head, mempool_t *mempool) argument
184 __btree_init(head);
185 head->mempool = mempool;
189 int btree_init(struct btree_head *head) argument
191 __btree_init(head);
199 btree_destroy(struct btree_head *head) argument
206 btree_last(struct btree_head *head, struct btree_geo *geo, unsigned long *key) argument
240 btree_lookup(struct btree_head *head, struct btree_geo *geo, unsigned long *key) argument
270 btree_update(struct btree_head *head, struct btree_geo *geo, unsigned long *key, void *val) argument
310 btree_get_prev(struct btree_head *head, struct btree_geo *geo, unsigned long *__key) argument
386 find_level(struct btree_head *head, struct btree_geo *geo, unsigned long *key, int level) argument
409 btree_grow(struct btree_head *head, struct btree_geo *geo, gfp_t gfp) argument
428 btree_shrink(struct btree_head *head, struct btree_geo *geo) argument
444 btree_insert_level(struct btree_head *head, struct btree_geo *geo, unsigned long *key, void *val, int level, gfp_t gfp) argument
506 btree_insert(struct btree_head *head, struct btree_geo *geo, unsigned long *key, void *val, gfp_t gfp) argument
515 merge(struct btree_head *head, struct btree_geo *geo, int level, unsigned long *left, int lfill, unsigned long *right, int rfill, unsigned long *parent, int lpos) argument
535 rebalance(struct btree_head *head, struct btree_geo *geo, unsigned long *key, int level, unsigned long *child, int fill) argument
586 btree_remove_level(struct btree_head *head, struct btree_geo *geo, unsigned long *key, int level) argument
624 btree_remove(struct btree_head *head, struct btree_geo *geo, unsigned long *key) argument
671 __btree_for_each(struct btree_head *head, struct btree_geo *geo, unsigned long *node, unsigned long opaque, void (*func)(void *elem, unsigned long opaque, unsigned long *key, size_t index, void *func2), void *func2, int reap, int height, size_t count) argument
741 btree_visitor(struct btree_head *head, struct btree_geo *geo, unsigned long opaque, void (*func)(void *elem, unsigned long opaque, unsigned long *key, size_t index, void *func2), void *func2) argument
759 btree_grim_visitor(struct btree_head *head, struct btree_geo *geo, unsigned long opaque, void (*func)(void *elem, unsigned long opaque, unsigned long *key, size_t index, void *func2), void *func2) argument
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/lib/
H A Dbtree.c93 static unsigned long *btree_node_alloc(struct btree_head *head, gfp_t gfp) argument
97 node = mempool_alloc(head->mempool, gfp);
176 static inline void __btree_init(struct btree_head *head) argument
178 head->node = NULL;
179 head->height = 0;
182 void btree_init_mempool(struct btree_head *head, mempool_t *mempool) argument
184 __btree_init(head);
185 head->mempool = mempool;
189 int btree_init(struct btree_head *head) argument
191 __btree_init(head);
199 btree_destroy(struct btree_head *head) argument
206 btree_last(struct btree_head *head, struct btree_geo *geo, unsigned long *key) argument
240 btree_lookup(struct btree_head *head, struct btree_geo *geo, unsigned long *key) argument
270 btree_update(struct btree_head *head, struct btree_geo *geo, unsigned long *key, void *val) argument
310 btree_get_prev(struct btree_head *head, struct btree_geo *geo, unsigned long *__key) argument
386 find_level(struct btree_head *head, struct btree_geo *geo, unsigned long *key, int level) argument
409 btree_grow(struct btree_head *head, struct btree_geo *geo, gfp_t gfp) argument
428 btree_shrink(struct btree_head *head, struct btree_geo *geo) argument
444 btree_insert_level(struct btree_head *head, struct btree_geo *geo, unsigned long *key, void *val, int level, gfp_t gfp) argument
506 btree_insert(struct btree_head *head, struct btree_geo *geo, unsigned long *key, void *val, gfp_t gfp) argument
515 merge(struct btree_head *head, struct btree_geo *geo, int level, unsigned long *left, int lfill, unsigned long *right, int rfill, unsigned long *parent, int lpos) argument
535 rebalance(struct btree_head *head, struct btree_geo *geo, unsigned long *key, int level, unsigned long *child, int fill) argument
586 btree_remove_level(struct btree_head *head, struct btree_geo *geo, unsigned long *key, int level) argument
624 btree_remove(struct btree_head *head, struct btree_geo *geo, unsigned long *key) argument
671 __btree_for_each(struct btree_head *head, struct btree_geo *geo, unsigned long *node, unsigned long opaque, void (*func)(void *elem, unsigned long opaque, unsigned long *key, size_t index, void *func2), void *func2, int reap, int height, size_t count) argument
741 btree_visitor(struct btree_head *head, struct btree_geo *geo, unsigned long opaque, void (*func)(void *elem, unsigned long opaque, unsigned long *key, size_t index, void *func2), void *func2) argument
759 btree_grim_visitor(struct btree_head *head, struct btree_geo *geo, unsigned long opaque, void (*func)(void *elem, unsigned long opaque, unsigned long *key, size_t index, void *func2), void *func2) argument
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/drivers/staging/tidspbridge/rmgr/
H A Drmm.c239 INIT_LIST_HEAD(&target->ovly_list->head);
376 struct rmm_header *head; local
386 head = target->free_list[segid];
389 while (head != NULL) {
390 max_free_size = max(max_free_size, head->size);
391 total_free_size += head->size;
393 head = head->next;
426 struct rmm_header *head; local
437 head
487 struct rmm_header *head; local
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/drivers/staging/tidspbridge/rmgr/
H A Drmm.c239 INIT_LIST_HEAD(&target->ovly_list->head);
376 struct rmm_header *head; local
386 head = target->free_list[segid];
389 while (head != NULL) {
390 max_free_size = max(max_free_size, head->size);
391 total_free_size += head->size;
393 head = head->next;
426 struct rmm_header *head; local
437 head
487 struct rmm_header *head; local
[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 Drcupdate.h56 void (*func)(struct rcu_head *head);
78 #define RCU_HEAD(head) struct rcu_head head = RCU_HEAD_INIT
90 extern void init_rcu_head_on_stack(struct rcu_head *head);
91 extern void destroy_rcu_head_on_stack(struct rcu_head *head);
93 static inline void init_rcu_head_on_stack(struct rcu_head *head) argument
97 static inline void destroy_rcu_head_on_stack(struct rcu_head *head) argument
491 struct rcu_head head; member in struct:rcu_synchronize
495 extern void wakeme_after_rcu(struct rcu_head *head);
499 * @head
544 debug_rcu_head_queue(struct rcu_head *head) argument
552 debug_rcu_head_unqueue(struct rcu_head *head) argument
560 debug_rcu_head_queue(struct rcu_head *head) argument
564 debug_rcu_head_unqueue(struct rcu_head *head) argument
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/net/atm/
H A Daddr.c51 struct list_head *head; local
55 head = &dev->lecs;
57 head = &dev->local;
58 list_for_each_entry_safe(this, p, head, entry) {
63 if (head == &dev->local)
72 struct list_head *head; local
80 head = &dev->lecs;
82 head = &dev->local;
83 list_for_each_entry(this, head, entry) {
95 list_add(&this->entry, head);
107 struct list_head *head; local
137 struct list_head *head; local
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/net/atm/
H A Daddr.c51 struct list_head *head; local
55 head = &dev->lecs;
57 head = &dev->local;
58 list_for_each_entry_safe(this, p, head, entry) {
63 if (head == &dev->local)
72 struct list_head *head; local
80 head = &dev->lecs;
82 head = &dev->local;
83 list_for_each_entry(this, head, entry) {
95 list_add(&this->entry, head);
107 struct list_head *head; local
137 struct list_head *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 Drcupdate.h56 void (*func)(struct rcu_head *head);
78 #define RCU_HEAD(head) struct rcu_head head = RCU_HEAD_INIT
90 extern void init_rcu_head_on_stack(struct rcu_head *head);
91 extern void destroy_rcu_head_on_stack(struct rcu_head *head);
93 static inline void init_rcu_head_on_stack(struct rcu_head *head) argument
97 static inline void destroy_rcu_head_on_stack(struct rcu_head *head) argument
491 struct rcu_head head; member in struct:rcu_synchronize
495 extern void wakeme_after_rcu(struct rcu_head *head);
499 * @head
544 debug_rcu_head_queue(struct rcu_head *head) argument
552 debug_rcu_head_unqueue(struct rcu_head *head) argument
560 debug_rcu_head_queue(struct rcu_head *head) argument
564 debug_rcu_head_unqueue(struct rcu_head *head) argument
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/drivers/gpu/drm/
H A Ddrm_agpsupport.c223 list_add(&entry->head, &dev->agp->memory);
255 list_for_each_entry(entry, &dev->agp->memory, head) {
370 list_del(&entry->head);
399 struct drm_agp_head *head = NULL; local
401 if (!(head = kmalloc(sizeof(*head), GFP_KERNEL)))
403 memset((void *)head, 0, sizeof(*head));
404 head->bridge = agp_find_bridge(dev->pdev);
405 if (!head
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/drivers/gpu/drm/
H A Ddrm_agpsupport.c223 list_add(&entry->head, &dev->agp->memory);
255 list_for_each_entry(entry, &dev->agp->memory, head) {
370 list_del(&entry->head);
399 struct drm_agp_head *head = NULL; local
401 if (!(head = kmalloc(sizeof(*head), GFP_KERNEL)))
403 memset((void *)head, 0, sizeof(*head));
404 head->bridge = agp_find_bridge(dev->pdev);
405 if (!head
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/drivers/gpu/drm/vmwgfx/
H A Dvmwgfx_fence.c32 struct list_head head; member in struct:vmw_fence
39 INIT_LIST_HEAD(&queue->head);
50 list_for_each_entry_safe(fence, next, &queue->head, head) {
67 list_add_tail(&fence->head, &queue->head);
83 if (list_empty(&queue->head)) {
90 list_for_each_entry_safe(fence, next, &queue->head, head) {
97 list_del(&fence->head);
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/drivers/gpu/drm/vmwgfx/
H A Dvmwgfx_fence.c32 struct list_head head; member in struct:vmw_fence
39 INIT_LIST_HEAD(&queue->head);
50 list_for_each_entry_safe(fence, next, &queue->head, head) {
67 list_add_tail(&fence->head, &queue->head);
83 if (list_empty(&queue->head)) {
90 list_for_each_entry_safe(fence, next, &queue->head, head) {
97 list_del(&fence->head);
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/net/netlabel/
H A Dnetlabel_addrlist.c53 * @head: the list head
56 * Searches the IPv4 address list given by @head. If a matching address entry
62 struct list_head *head)
66 list_for_each_entry_rcu(iter, head, list)
77 * @head: the list head
80 * Searches the IPv4 address list given by @head. If an exact match if found
87 struct list_head *head)
91 list_for_each_entry_rcu(iter, head, lis
61 netlbl_af4list_search(__be32 addr, struct list_head *head) argument
85 netlbl_af4list_search_exact(__be32 addr, __be32 mask, struct list_head *head) argument
111 netlbl_af6list_search(const struct in6_addr *addr, struct list_head *head) argument
136 netlbl_af6list_search_exact(const struct in6_addr *addr, const struct in6_addr *mask, struct list_head *head) argument
163 netlbl_af4list_add(struct netlbl_af4list *entry, struct list_head *head) argument
200 netlbl_af6list_add(struct netlbl_af6list *entry, struct list_head *head) argument
254 netlbl_af4list_remove(__be32 addr, __be32 mask, struct list_head *head) argument
294 netlbl_af6list_remove(const struct in6_addr *addr, const struct in6_addr *mask, struct list_head *head) argument
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/wget/tests/
H A DTest-np.px13 <head>
15 </head>
26 <head>
28 </head>
39 <head>
41 </head>
52 <head>
54 </head>
66 <head>
68 </head>
[all...]

Completed in 402 milliseconds

1234567891011>>