Searched refs:prev (Results 201 - 225 of 1034) sorted by relevance

1234567891011>>

/linux-master/fs/nilfs2/
H A Dalloc.c202 struct nilfs_bh_assoc *prev,
208 if (prev->bh && blkoff == prev->blkoff &&
209 likely(buffer_uptodate(prev->bh))) {
210 get_bh(prev->bh);
211 *bhp = prev->bh;
224 brelse(prev->bh);
226 prev->bh = *bhp;
227 prev->blkoff = blkoff;
237 * @prev
196 nilfs_palloc_get_block(struct inode *inode, unsigned long blkoff, int create, void (*init_block)(struct inode *, struct buffer_head *, void *), struct buffer_head **bhp, struct nilfs_bh_assoc *prev, spinlock_t *lock) argument
240 nilfs_palloc_delete_block(struct inode *inode, unsigned long blkoff, struct nilfs_bh_assoc *prev, spinlock_t *lock) argument
[all...]
H A Dsegbuf.h88 #define NILFS_PREV_SEGBUF(segbuf) NILFS_LIST_SEGBUF((segbuf)->sb_list.prev)
89 #define NILFS_LAST_SEGBUF(head) NILFS_LIST_SEGBUF((head)->prev)
111 struct nilfs_segment_buffer *prev);
/linux-master/drivers/mmc/core/
H A Dsdio_cis.c246 struct sdio_func_tuple *this, **prev; local
270 prev = &func->tuples;
272 prev = &card->tuples;
274 if (*prev)
329 *prev = this;
330 prev = &this->next;
373 *prev = card->tuples;
/linux-master/drivers/clk/
H A Dclk-max9485.c165 const struct max9485_rate *curr, *prev = NULL; local
183 if (!prev)
190 mid = prev->out + ((curr->out - prev->out) / 2);
192 return (mid > rate) ? prev->out : curr->out;
195 prev = curr;
199 return prev->out;
/linux-master/sound/soc/intel/atom/sst/
H A Dsst_stream.c71 sst_drv_ctx->streams[str_id].prev = STREAM_UN_INIT;
256 if (str_info->prev == STREAM_UN_INIT)
264 str_info->prev = str_info->status;
308 str_info->prev = STREAM_PAUSED;
319 str_info->prev = STREAM_PAUSED;
328 if (str_info->prev == STREAM_RUNNING)
332 str_info->prev = STREAM_PAUSED;
367 str_info->prev = STREAM_UN_INIT;
448 str_info->prev = str_info->status;
/linux-master/arch/sparc/kernel/
H A Dsun4d_smp.c166 int *prev; local
170 prev = &first;
172 *prev = i;
173 prev = &cpu_data(i).next;
175 *prev = first;
H A Dsun4m_smp.c124 int *prev; local
128 prev = &first;
130 *prev = i;
131 prev = &cpu_data(i).next;
133 *prev = first;
/linux-master/kernel/locking/
H A Dqspinlock.c175 * p,*,* -> n,*,* ; prev = xchg(lock, node)
219 * p,*,* -> n,*,* ; prev = xchg(lock, node)
275 struct mcs_spinlock *prev) { }
318 struct mcs_spinlock *prev, *next, *node; local
452 * @node into the waitqueue via WRITE_ONCE(prev->next, node) below.
471 prev = decode_tail(old);
474 WRITE_ONCE(prev->next, node);
476 pv_wait_node(node, prev);
274 __pv_wait_node(struct mcs_spinlock *node, struct mcs_spinlock *prev) argument
/linux-master/samples/bpf/
H A Dxdp_tx_iptunnel_user.c55 __u64 values[nr_cpus], prev[nr_protos][nr_cpus]; local
59 memset(prev, 0, sizeof(prev));
70 sum += (values[i] - prev[proto][i]);
75 memcpy(prev[proto], values, sizeof(values));
/linux-master/drivers/ata/
H A Dpata_cs5530.c135 struct ata_device *prev = ap->private_data; local
138 if (ata_dma_enabled(adev) && adev != prev && prev != NULL) {
140 if ((ata_using_udma(adev) && !ata_using_udma(prev)) ||
141 (ata_using_udma(prev) && !ata_using_udma(adev)))
H A Dpata_sc1200.c156 struct ata_device *prev = ap->private_data; local
159 if (ata_dma_enabled(adev) && adev != prev && prev != NULL) {
161 if ((ata_using_udma(adev) && !ata_using_udma(prev)) ||
162 (ata_using_udma(prev) && !ata_using_udma(adev)))
/linux-master/fs/jfs/
H A Djfs_extent.c196 s64 prev; local
208 prev = ((offset & ~POFFSET) >> JFS_SBI(sb)->l2bsize) - nbperpage;
212 if (prev < 0)
215 rc = xtLookup(ip, prev, nbperpage, &xflag, &xaddr, &xlen, 0);
224 XADoffset(xp, prev);
/linux-master/tools/perf/util/
H A Dbpf_kwork_top.c271 struct work_key key, prev; local
284 memset(&prev, 0, sizeof(prev));
285 while (!bpf_map_get_next_key(fd, &prev, &key)) {
298 prev = key;
/linux-master/arch/powerpc/mm/
H A Dmem.c191 unsigned long spfn, epfn, prev = 0; local
195 if (prev && prev < spfn)
196 register_nosave_region(prev, spfn);
198 prev = epfn;
/linux-master/net/core/
H A Dgso_test.c184 struct sk_buff *frag_skb, *prev = NULL; local
198 if (prev)
199 prev->next = frag_skb;
202 prev = frag_skb;
235 last = segs->prev;
248 /* last seg can be found through segs->prev pointer */
/linux-master/fs/btrfs/
H A Dextent-io-tree.c264 struct rb_node *prev = NULL; local
268 prev = *node;
269 entry = rb_entry(prev, struct extent_state, rb_node);
282 *parent_ret = prev;
360 struct extent_state *prev; local
362 prev = prev_state(state);
363 if (prev && prev->end == state->start - 1 && prev->state == state->state) {
366 state, prev); local
1525 struct extent_state *prev = NULL, *next = NULL; local
1667 struct extent_state *prev; local
[all...]
H A Dordered-data.c67 struct rb_node *prev = NULL; local
74 prev = n;
87 while (prev && file_offset >= entry_end(prev_entry)) {
88 test = rb_next(prev);
96 prev = test;
98 if (prev)
99 prev_entry = rb_entry(prev, struct btrfs_ordered_extent,
101 while (prev && file_offset < entry_end(prev_entry)) {
102 test = rb_prev(prev);
107 prev
129 struct rb_node *prev = NULL; local
1002 struct rb_node *prev; local
[all...]
/linux-master/include/linux/
H A Dinterval_tree_generic.h154 struct rb_node *rb = node->ITRB.rb_right, *prev; \
176 prev = &node->ITRB; \
179 } while (prev == rb); \
/linux-master/net/atm/
H A Dmpoa_caches.c113 entry->prev = NULL;
115 client->in_cache->prev = entry;
200 if (entry->prev != NULL)
201 entry->prev->next = entry->next;
205 entry->next->prev = entry->prev;
433 if (entry->prev != NULL)
434 entry->prev->next = entry->next;
438 entry->next->prev = entry->prev;
[all...]
/linux-master/drivers/gpu/drm/nouveau/
H A Dnv17_fence.c37 struct nouveau_channel *prev, struct nouveau_channel *chan)
39 struct nouveau_cli *cli = (void *)prev->user.client;
42 struct nvif_push *ppush = prev->chan.push;
36 nv17_fence_sync(struct nouveau_fence *fence, struct nouveau_channel *prev, struct nouveau_channel *chan) argument
/linux-master/tools/include/linux/
H A Dinterval_tree_generic.h154 struct rb_node *rb = node->ITRB.rb_right, *prev; \
176 prev = &node->ITRB; \
179 } while (prev == rb); \
/linux-master/fs/
H A Dreaddir.c265 struct linux_dirent __user *dirent, *prev; local
288 prev = (void __user *) dirent - prev_reclen;
289 if (!user_write_access_begin(prev, reclen + prev_reclen))
293 unsafe_put_user(offset, &prev->d_off, efault_end);
353 struct linux_dirent64 __user *dirent, *prev; local
370 prev = (void __user *)dirent - prev_reclen;
371 if (!user_write_access_begin(prev, reclen + prev_reclen))
375 unsafe_put_user(offset, &prev->d_off, efault_end);
517 struct compat_linux_dirent __user *dirent, *prev; local
540 prev
[all...]
/linux-master/net/ipv4/
H A Dinet_fragment.c338 struct inet_frag_queue **prev)
345 *prev = ERR_PTR(-ENOMEM);
350 *prev = rhashtable_lookup_get_insert_key(&fqdir->rhashtable, &q->key,
352 if (*prev) {
366 struct inet_frag_queue *fq = NULL, *prev; local
373 prev = rhashtable_lookup(&fqdir->rhashtable, key, fqdir->f->rhash_params);
374 if (!prev)
375 fq = inet_frag_create(fqdir, key, &prev);
376 if (!IS_ERR_OR_NULL(prev)) {
377 fq = prev;
336 inet_frag_create(struct fqdir *fqdir, void *arg, struct inet_frag_queue **prev) argument
[all...]
/linux-master/arch/loongarch/include/asm/
H A Datomic.h131 int prev, rc; local
143 : [p]"=&r" (prev), [rc]"=&r" (rc),
148 return prev;
290 long prev, rc; local
302 : [p]"=&r" (prev), [rc]"=&r" (rc),
307 return prev;
/linux-master/block/
H A Dblk-integrity.c33 int prev = 0; local
37 if (prev) {
50 prev = 1;
75 int prev = 0; local
79 if (prev) {
99 prev = 1;

Completed in 414 milliseconds

1234567891011>>