Searched refs:prev (Results 226 - 250 of 1034) sorted by relevance

1234567891011>>

/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/arch/sparc/kernel/
H A Dprom_common.c132 static int __init prom_common_nextprop(phandle node, char *prev, char *buf) argument
137 name = prom_nextprop(node, prev, buf);
/linux-master/arch/arc/include/asm/
H A Ddsp-impl.h97 static inline void dsp_save_restore(struct task_struct *prev,
100 long unsigned int *saveto = &prev->thread.dsp.ACC0_GLO;
/linux-master/arch/sh/include/asm/
H A Dmmu_context.h109 static inline void switch_mm(struct mm_struct *prev, argument
115 if (likely(prev != next)) {
/linux-master/arch/xtensa/include/asm/
H A Dmmu_context.h126 static inline void switch_mm(struct mm_struct *prev, struct mm_struct *next, argument
136 if (migrated || prev != next)
/linux-master/net/rds/
H A Dib_send.c491 struct rds_ib_send_work *prev; local
621 prev = NULL;
699 if (prev)
700 prev->s_wr.next = &send->s_wr;
701 prev = send;
717 prev->s_op = ic->i_data_op;
718 prev->s_wr.send_flags |= IB_SEND_SOLICITED;
719 if (!(prev->s_wr.send_flags & IB_SEND_SIGNALED))
720 nr_sig += rds_ib_set_wr_signal_state(ic, prev, true);
746 if (prev
857 struct rds_ib_send_work *prev; local
[all...]
/linux-master/drivers/net/ethernet/microchip/sparx5/
H A Dsparx5_qos.c211 u32 idx, u32 *prev, u32 *next, u32 *first)
216 *prev = *first;
229 *prev = itr;
268 u32 first, next, prev; local
272 WARN_ON(sparx5_lg_get_adjacent(sparx5, layer, group, idx, &prev, &next,
278 /* idx is removed, prev is now last */
279 idx = prev;
280 next = prev;
287 idx = prev;
210 sparx5_lg_get_adjacent(struct sparx5 *sparx5, u32 layer, u32 group, u32 idx, u32 *prev, u32 *next, u32 *first) argument
/linux-master/drivers/md/
H A Ddm-io-rewind.c84 u64 prev = dun[i]; local
87 if (dun[i] > prev)
H A Ddm-cache-policy-smq.c41 unsigned int prev:28; member in struct:entry
140 return to_entry(es, e->prev);
153 e->prev = INDEXER_NULL;
156 head->prev = l->head = to_index(es, e);
169 e->prev = l->tail;
183 struct entry *prev = l_prev(es, old); local
185 if (!prev)
189 e->prev = old->prev;
191 prev
200 struct entry *prev = l_prev(es, e); local
631 __h_lookup(struct smq_hash_table *ht, unsigned int h, dm_oblock_t oblock, struct entry **prev) argument
647 __h_unlink(struct smq_hash_table *ht, unsigned int h, struct entry *e, struct entry *prev) argument
661 struct entry *e, *prev; local
680 struct entry *prev; local
[all...]
/linux-master/drivers/staging/media/atomisp/pci/hmm/
H A Dhmm_bo.c71 bo->prev = NULL;
106 /* NOTE: All nodes on free rbtree have a 'prev' that points to NULL.
116 * yes: change the related 'next/prev' pointer,
122 temp_bo->next->prev = this;
124 temp_bo->prev = NULL;
195 bo->prev = this;
198 this->next->prev = bo;
272 * 1. if bo->next && bo->prev == NULL, bo is a rbtree node
276 if (!bo->prev && !bo->next) {
278 /* 2. when bo->next != NULL && bo->prev
[all...]
/linux-master/tools/lib/perf/
H A Dcpumap.c163 int n, cpu, prev; local
167 prev = -1;
172 if (prev >= 0) {
173 int new_max = nr_cpus + cpu - prev - 1;
186 while (++prev < cpu)
187 tmp_cpus[nr_cpus++].cpu = prev;
199 prev = cpu;
201 prev = -1;
/linux-master/tools/perf/
H A Dbuiltin-timechart.c736 struct io_sample *prev; local
744 prev = c->io_samples;
746 if (prev && prev->start_time && !prev->end_time) {
752 c->io_samples = prev->next;
753 free(prev);
777 struct io_sample *sample, *prev; local
801 prev = sample->next;
807 if (prev
975 struct per_pid *new_list, *p, *cursor, *prev; local
[all...]
/linux-master/fs/hfs/
H A Dbnode.c151 be32_to_cpu(desc.next), be32_to_cpu(desc.prev),
186 if (node->prev) {
187 tmp = hfs_bnode_find(tree, node->prev);
201 tmp->prev = node->prev;
202 cnid = cpu_to_be32(tmp->prev);
203 hfs_bnode_write(tmp, &cnid, offsetof(struct hfs_bnode_desc, prev), 4);
206 tree->leaf_tail = node->prev;
209 if (!node->prev && !node->next) {
345 node->prev
[all...]
/linux-master/arch/arm/mach-omap2/
H A Dpowerdomain.c164 int prev, next, state, trace_state = 0; local
173 prev = pwrdm->state;
176 prev = pwrdm_read_prev_pwrst(pwrdm);
177 if (prev >= 0 && pwrdm->state != prev)
178 pwrdm->state_counter[prev]++;
179 if (prev == PWRDM_POWER_RET)
186 if (next != prev) {
189 ((prev & OMAP_POWERSTATE_MASK) << 0));
199 if (state != prev)
[all...]
/linux-master/net/netfilter/ipset/
H A Dip_set_list_set.c190 struct set_elem *e, *next, *prev = NULL; local
198 prev = e;
209 ret = prev && prev->id == d->refid;
237 struct set_elem *e, *n, *prev, *next; local
241 n = prev = next = NULL;
253 prev = e;
258 (d->before < 0 && !prev))
283 /* Insert before prev element */
284 if (prev
319 struct set_elem *e, *next, *prev = NULL; local
[all...]
/linux-master/drivers/md/bcache/
H A Dbset.c284 /* Space required for the prev pointers */
297 kfree(t->prev);
299 free_pages((unsigned long) t->prev,
310 t->prev = NULL;
335 t->prev = bset_prev_bytes(b) < PAGE_SIZE
338 if (!t->prev)
521 * bits we're going to store in bkey_float->mantissa. t->prev[j] stores the size
551 return (void *) (((uint64_t *) tree_to_bkey(t, j)) - t->prev[j]);
556 * maintain a full search tree, we just keep a simple lookup table in t->prev.
560 return cacheline_to_bkey(t, cacheline, t->prev[cachelin
693 struct bkey *prev = NULL, *k = t->data->start; local
881 struct bkey *m, *prev = NULL; local
[all...]
/linux-master/drivers/gpu/drm/
H A Ddrm_gpuvm.c518 * struct drm_gpuva *prev = NULL, *next = NULL;
522 * if (op->remap.prev) {
523 * prev = driver_gpuva_alloc();
524 * if (!prev)
539 * drm_gpuva_remap(prev, next, &op->remap);
541 * if (prev)
542 * drm_gpuva_link(prev, va->vm_bo);
647 * if (op->remap.prev) {
2011 * @prev: the &drm_gpuva to remap when keeping the start of a mapping
2013 * @op: the &drm_gpuva_op_remap to initialize @prev an
2019 drm_gpuva_remap(struct drm_gpuva *prev, struct drm_gpuva *next, struct drm_gpuva_op_remap *op) argument
2071 op_remap_cb(const struct drm_gpuvm_ops *fn, void *priv, struct drm_gpuva_op_map *prev, struct drm_gpuva_op_map *next, struct drm_gpuva_op_unmap *unmap) argument
2256 struct drm_gpuva_op_map prev = {}, next = {}; local
[all...]
/linux-master/drivers/infiniband/hw/hfi1/
H A Drc.h52 struct rvt_ack_entry *find_prev_entry(struct rvt_qp *qp, u32 psn, u8 *prev,
/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
/linux-master/drivers/gpu/drm/nouveau/nvkm/subdev/therm/
H A Dfan.c129 u32 cycles, cur, prev; local
143 prev = nvkm_gpio_get(gpio, 0, therm->fan->tach.func,
151 if (prev != cur) {
155 prev = cur;
/linux-master/drivers/media/pci/cx23885/
H A Dcx23885-vbi.c188 struct cx23885_buffer *prev; local
206 prev = list_entry(q->active.prev, struct cx23885_buffer,
211 prev->risc.jmp[1] = cpu_to_le32(buf->risc.dma);
/linux-master/drivers/usb/host/
H A Dohci-q.c152 struct ed **prev = &ohci->periodic [i]; local
154 struct ed *here = *prev;
163 prev = &here->ed_next;
165 here = *prev;
172 *prev = ed;
276 struct ed **prev = &ohci->periodic [i]; local
279 while (*prev && (temp = *prev) != ed) {
281 prev = &temp->ed_next;
283 if (*prev) {
984 __hc32 *prev; local
[all...]
/linux-master/kernel/gcov/
H A Dgcov.h49 void gcov_info_unlink(struct gcov_info *prev, struct gcov_info *info);
/linux-master/drivers/net/wireguard/
H A Ddevice.h36 struct { struct sk_buff *next, *prev; } empty; // Match first 2 members of struct sk_buff. member in struct:prev_queue::__anon98
/linux-master/arch/powerpc/mm/nohash/
H A Dmmu_context.c230 void switch_mmu_context(struct mm_struct *prev, struct mm_struct *next, argument
243 if (prev) {
244 WARN_ON(prev->context.active < 1);
245 prev->context.active--;
383 * we'll get called with prev == init_mm the first time

Completed in 258 milliseconds

1234567891011>>