Searched refs:prev (Results 26 - 50 of 1036) sorted by path

1234567891011>>

/linux-master/drivers/usb/host/
H A Dehci-timer.c280 ehci->cached_itd_list.prev,
283 ehci->cached_sitd_list.prev,
H A Dohci-mem.c113 struct td **prev = &hc->td_hash [TD_HASH_FUNC (td->td_dma)]; local
116 while (*prev && *prev != td)
117 prev = &(*prev)->td_hash;
118 if (*prev)
119 *prev = td->td_hash;
H A Duhci-q.c55 lqh = list_entry(uhci->skel_async_qh->node.prev,
67 lqh = list_entry(uhci->skel_async_qh->node.prev,
167 ltd = list_entry(ftd->fl_list.prev, struct uhci_td, fl_list);
207 ptd = list_entry(td->fl_list.prev, struct uhci_td, fl_list);
224 ltd = list_entry(ftd->fl_list.prev, struct uhci_td, fl_list);
229 list_del_init(ftd->fl_list.prev);
338 purbp = list_entry(urbp->node.prev, struct urb_priv, node);
340 ptd = list_entry(purbp->td_list.prev, struct uhci_td,
342 td = list_entry(urbp->td_list.prev, struct uhci_td,
400 td = list_entry(urbp->td_list.prev, struc
[all...]
/linux-master/drivers/usb/image/
H A Dmicrotek.h32 struct mts_desc *prev; member in struct:mts_desc
/linux-master/fs/hfs/
H A Dbrec.c248 new_node->prev = node->this;
318 node_desc.prev = cpu_to_be32(new_node->prev);
334 next_node->prev = new_node->this;
336 node_desc.prev = cpu_to_be32(next_node->prev);
488 new_node->prev = 0;
492 node_desc.prev = cpu_to_be32(new_node->prev);
/linux-master/fs/hfsplus/
H A Dbfind.c246 idx = bnode->prev;
H A Dbrec.c252 new_node->prev = node->this;
322 node_desc.prev = cpu_to_be32(new_node->prev);
338 next_node->prev = new_node->this;
340 node_desc.prev = cpu_to_be32(next_node->prev);
492 new_node->prev = 0;
496 node_desc.prev = cpu_to_be32(new_node->prev);
/linux-master/fs/jfs/
H A Djfs_dtree.h183 __le64 prev; /* 8: previous sibling */ member in struct:__anon1212::__anon1213
/linux-master/fs/orangefs/
H A Ddevorangefs-req.c653 if (!orangefs_sb->list.prev)
/linux-master/include/asm-generic/
H A Dswitch_to.h21 #define switch_to(prev, next, last) \
23 ((last) = __switch_to((prev), (next))); \
/linux-master/include/linux/
H A Dagp_backend.h61 * allocated. A caller may manipulate the next and prev pointers to link
71 struct agp_memory *prev; member in struct:agp_memory
H A Dlist_bl.h105 struct hlist_bl_node *prev)
107 n->next = prev->next;
108 n->pprev = &prev->next;
109 prev->next = n;
104 hlist_bl_add_behind(struct hlist_bl_node *n, struct hlist_bl_node *prev) argument
H A Dof_pdt.h16 * If prev is NULL, the first property will be returned.
18 int (*nextprop)(phandle node, char *prev, char *buf);
H A Duser-return-notifier.h19 static inline void propagate_user_return_notify(struct task_struct *prev, argument
22 if (test_tsk_thread_flag(prev, TIF_USER_RETURN_NOTIFY)) {
23 clear_tsk_thread_flag(prev, TIF_USER_RETURN_NOTIFY);
39 static inline void propagate_user_return_notify(struct task_struct *prev, argument
/linux-master/include/sound/
H A Dutil_mem.h49 struct list_head *prev);
/linux-master/include/uapi/linux/netfilter/
H A Dxt_limit.h19 unsigned long prev; /* moved to xt_limit_priv */ member in struct:xt_rateinfo
/linux-master/include/uapi/linux/netfilter_bridge/
H A Debt_limit.h20 unsigned long prev; member in struct:ebt_limit_info
/linux-master/lib/
H A Dklist.c326 * klist_prev - Ante up prev node in list.
330 * node, if there was one. Grab the prev node, increment its reference
331 * count, drop the lock, and return that prev node.
337 struct klist_node *prev; local
343 prev = to_klist_node(last->n_node.prev);
347 prev = to_klist_node(i->i_klist->k_list.prev);
350 while (prev != to_klist_node(&i->i_klist->k_list)) {
351 if (likely(!knode_dead(prev))) {
[all...]
H A Dplist.c35 WARN(n->prev != p || p->next != n,
37 "prev: %p, n: %p, p: %p\n"
39 t, t->next, t->prev,
40 p, p->next, p->prev,
41 n, n->next, n->prev);
46 struct list_head *prev = top, *next = top->next; local
48 plist_check_prev_next(top, prev, next);
50 prev = next;
51 next = prev->next;
52 plist_check_prev_next(top, prev, nex
75 struct plist_node *first, *iter, *prev = NULL; local
[all...]
/linux-master/net/atm/
H A Dmpoa_caches.h19 struct in_cache_entry *prev; member in struct:in_cache_entry
56 struct eg_cache_entry *prev; member in struct:eg_cache_entry
/linux-master/net/netlabel/
H A Dnetlabel_addrlist.c165 iter->list.prev,
203 iter->list.prev,
/linux-master/scripts/dtc/
H A Dsrcpos.h18 struct srcfile_state *prev; member in struct:srcfile_state
/linux-master/sound/core/
H A Dpcm_param_trace.h29 TP_PROTO(struct snd_pcm_substream *substream, snd_pcm_hw_param_t type, int index, const struct snd_mask *prev, const struct snd_mask *curr),
30 TP_ARGS(substream, type, index, prev, curr),
50 memcpy(__entry->prev_bits, prev->bits, sizeof(__u32) * 8);
69 TP_PROTO(struct snd_pcm_substream *substream, snd_pcm_hw_param_t type, int index, const struct snd_interval *prev, const struct snd_interval *curr),
70 TP_ARGS(substream, type, index, prev, curr),
100 __entry->prev_min = prev->min;
101 __entry->prev_max = prev->max;
102 __entry->prev_openmin = prev->openmin;
103 __entry->prev_openmax = prev->openmax;
104 __entry->prev_integer = prev
[all...]
/linux-master/sound/synth/
H A Dutil_mem.c88 return __snd_util_memblk_new(hdr, units, p->prev);
94 * the block is linked next to prev
98 struct list_head *prev)
107 if (prev == &hdr->block)
110 struct snd_util_memblk *p = get_memblk(prev);
114 list_add(&blk->list, prev);
97 __snd_util_memblk_new(struct snd_util_memhdr *hdr, unsigned int units, struct list_head *prev) argument
/linux-master/tools/firewire/
H A Dlist.h3 struct list *next, *prev; member in struct:list
10 list->prev = list;
22 new_link->prev = link->prev;
24 new_link->prev->next = new_link;
25 new_link->next->prev = new_link;
43 link->prev->next = link->next;
44 link->next->prev = link->prev;
54 list_entry((list)->prev, typ
[all...]

Completed in 294 milliseconds

1234567891011>>