/linux-master/drivers/dma/xilinx/ |
H A D | xilinx_dpdma.c | 496 * @prev: The previous descriptor 501 * from @dma_addr. If a previous descriptor is specified in @prev, its next 502 * descriptor DMA address is set to the DMA address of @sw_desc. @prev may be 507 struct xilinx_dpdma_sw_desc *prev, 535 if (!prev) 538 prev->hw.next_desc = lower_32_bits(sw_desc->dma_addr); 540 prev->hw.addr_ext |= 505 xilinx_dpdma_sw_desc_set_dma_addrs(struct xilinx_dpdma_device *xdev, struct xilinx_dpdma_sw_desc *sw_desc, struct xilinx_dpdma_sw_desc *prev, dma_addr_t dma_addr[], unsigned int num_src_addr) argument
|
/linux-master/drivers/dma/ |
H A D | owl-dma.c | 365 struct owl_dma_lli *prev, 372 if (prev) { 373 prev->hw[OWL_DMADESC_NEXT_LLI] = next->phys; 374 prev->hw[OWL_DMADESC_CTRLA] |= 874 struct owl_dma_lli *lli, *prev = NULL; local 905 prev = owl_dma_add_lli(txd, prev, lli, false); 926 struct owl_dma_lli *lli, *prev = NULL; local 969 prev = owl_dma_add_lli(txd, prev, ll 364 owl_dma_add_lli(struct owl_dma_txd *txd, struct owl_dma_lli *prev, struct owl_dma_lli *next, bool is_cyclic) argument 991 struct owl_dma_lli *lli, *prev = NULL, *first = NULL; local [all...] |
/linux-master/arch/x86/kernel/ |
H A D | process_64.c | 369 * Store prev's PKRU value and load next's PKRU value if they differ. PKRU 374 static __always_inline void x86_pkru_load(struct thread_struct *prev, argument 380 /* Stash the prev task's value: */ 381 prev->pkru = rdpkru(); 387 if (prev->pkru != next->pkru) 391 static __always_inline void x86_fsgsbase_load(struct thread_struct *prev, argument 396 if (unlikely(prev->fsindex || next->fsindex)) 398 if (unlikely(prev->gsindex || next->gsindex)) 405 load_seg_legacy(prev->fsindex, prev 612 struct thread_struct *prev = &prev_p->thread; local [all...] |
/linux-master/net/mac80211/ |
H A D | mesh_pathtbl.c | 468 struct ieee80211_mesh_fast_tx *entry, *prev; local 580 prev = rhashtable_lookup_get_insert_fast(&cache->rht, 583 if (unlikely(IS_ERR(prev))) { 592 if (unlikely(prev)) { 593 rhashtable_replace_fast(&cache->rht, &prev->rhash, 595 hlist_del_rcu(&prev->walk_list); 596 kfree_rcu(prev, fast_tx.rcu_head);
|
/linux-master/arch/arc/kernel/ |
H A D | entry-arcv2.S | 89 ; so a higher prio interrupt taken here won't clobber prev prio icause
|
/linux-master/arch/arc/include/asm/ |
H A D | mmu_context.h | 56 * Get a new ASID if task doesn't have a valid one (unalloc or from prev cycle) 132 static inline void switch_mm(struct mm_struct *prev, struct mm_struct *next, argument
|
/linux-master/fs/bcachefs/ |
H A D | journal_io.c | 1216 struct journal_replay *i, **_i, *prev = NULL; local 1358 if (prev) { 1359 bch2_journal_ptrs_to_text(&buf1, c, prev); 1360 prt_printf(&buf1, " size %zu", vstruct_sectors(&prev->j, c->block_bits)); 1368 " prev at %s\n" 1378 prev = i;
|
H A D | btree_update_interior.c | 69 struct bkey_buf prev; local 79 bch2_bkey_buf_init(&prev); 80 bkey_init(&prev.k->k); 89 struct bpos expected_min = bkey_deleted(&prev.k->k) 91 : bpos_successor(prev.k->k.p); 97 prt_str(&buf, "end of prev node doesn't match start of next node\n"), 101 prt_str(&buf, "\n prev "); 102 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(prev.k)); 110 bch2_bkey_buf_reassemble(&prev, c, k); 114 if (bkey_deleted(&prev 1942 struct btree *b, *m, *n, *prev, *next, *parent; local [all...] |
H A D | btree_io.c | 859 struct bkey_packed *k, *prev = NULL; local 922 if (prev && bkey_iter_cmp(b, prev, k) > 0) { 923 struct bkey up = bkey_unpack_key(b, prev); 938 prev = k;
|
H A D | btree_gc.c | 213 struct btree *prev, struct btree *cur, 216 struct bpos expected_start = !prev 218 : bpos_successor(prev->key.k.p); 233 if (prev) { 234 prt_printf(&buf, "\n prev: "); 235 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(&prev->key)); 258 if (prev && BTREE_NODE_SEQ(cur->data) > BTREE_NODE_SEQ(prev->data)) { /* cur overwrites prev */ 259 if (bpos_ge(prev 212 btree_check_node_boundaries(struct bch_fs *c, struct btree *b, struct btree *prev, struct btree *cur, struct bpos *pulled_from_scan) argument 331 struct btree *prev = NULL, *cur = NULL; local [all...] |
/linux-master/drivers/usb/gadget/udc/ |
H A D | fsl_udc_core.c | 737 lastreq = list_entry(ep->queue.prev, struct fsl_req, queue); 976 prev_req = list_entry(req->queue.prev, struct fsl_req, queue);
|
/linux-master/drivers/thunderbolt/ |
H A D | tb.h | 1077 struct tb_port *prev);
|
H A D | switch.c | 843 * @prev: Previous port (%NULL if this is the first) 846 * are connected through zero or more switches. If the @prev is dual 855 struct tb_port *prev) 859 if (!prev) 862 if (prev->sw == end->sw) { 863 if (prev == end) 868 if (tb_switch_is_reachable(prev->sw, end->sw)) { 869 next = tb_port_at(tb_route(end->sw), prev->sw); 870 /* Walk down the topology if next == prev */ 871 if (prev 854 tb_next_port_on_path(struct tb_port *start, struct tb_port *end, struct tb_port *prev) argument [all...] |
/linux-master/drivers/interconnect/ |
H A D | core.c | 304 struct icc_node *next, *prev = NULL; local 314 if (!prev || (p != prev->provider && !p->inter_set)) { 315 prev = next; 320 ret = p->set(prev, next); 324 prev = next;
|
/linux-master/drivers/accessibility/speakup/ |
H A D | main.c | 867 static int say_sentence_num(int num, int prev) argument 871 if (prev && --bn == -1)
|
/linux-master/tools/testing/selftests/net/tcp_ao/lib/ |
H A D | proc.c | 191 struct netstat *prev = ns; local 199 free(prev);
|
/linux-master/tools/perf/util/ |
H A D | annotate.c | 622 char *s = strchr(ops->raw, ','), *target, *comment, prev; local 660 prev = *s; 664 *s = prev; 700 char *target, *comment, *s, prev; local 706 prev = *s; 710 *s = prev; 1776 dl = list_entry(list->prev, struct disasm_line, al.node); 3334 int prev; local 3338 prev = obj__set_jumps_percent_color(obj, al->jump_sources, 3341 obj__set_color(obj, prev); [all...] |
/linux-master/tools/perf/ui/browsers/ |
H A D | annotate.c | 278 pos = list_entry(pos->node.prev, struct annotation_line, node); 779 "</> Move to prev/next symbol\n"
|
/linux-master/net/netfilter/ |
H A D | nft_set_rbtree.c | 240 struct rb_node *prev = rb_prev(&rbe->node); local 253 while (prev) { 254 rbe_prev = rb_entry(prev, struct nft_rbtree_elem, node); 259 prev = rb_prev(prev); 263 if (prev) { 264 rbe_prev = rb_entry(prev, struct nft_rbtree_elem, node);
|
H A D | nft_set_hash.c | 131 struct nft_rhash_elem *he, *prev; local 149 prev = rhashtable_lookup_get_insert_key(&priv->ht, &arg, &he->node, 151 if (IS_ERR(prev)) 155 if (prev) { 158 he = prev; 184 struct nft_rhash_elem *prev; local 186 prev = rhashtable_lookup_get_insert_key(&priv->ht, &arg, &he->node, 188 if (IS_ERR(prev)) 189 return PTR_ERR(prev); 190 if (prev) { [all...] |
/linux-master/arch/s390/kernel/ |
H A D | entry.S | 153 * gpr2 = (task_struct *)prev 156 * gpr2 = prev 159 stmg %r6,%r15,__SF_GPRS(%r15) # store gprs of prev task 163 stg %r15,__THREAD_ksp(%r1,%r2) # store kernel stack of prev
|
/linux-master/kernel/time/ |
H A D | tick-sched.c | 482 int prev; local 484 prev = atomic_fetch_or(BIT(bit), dep); 485 if (!prev) 509 int prev; local 514 prev = atomic_fetch_or(BIT(bit), &ts->tick_dep_mask); 515 if (!prev) { 562 int prev; local 565 prev = atomic_fetch_or(BIT(bit), &sig->tick_dep_mask); 566 if (!prev) {
|
/linux-master/fs/ceph/ |
H A D | mds_client.c | 1936 struct ceph_cap *cap, *prev = NULL; local 1948 if (cap == prev) 1950 prev = cap;
|
H A D | caps.c | 1888 struct ceph_cap_flush *prev; local 1891 if (wake && cf->g_list.prev != &mdsc->cap_flush_list) { 1892 prev = list_prev_entry(cf, g_list); 1893 prev->wake = true; 1903 struct ceph_cap_flush *prev; local 1906 if (wake && cf->i_list.prev != &ci->i_cap_flush_list) { 1907 prev = list_prev_entry(cf, i_list); 1908 prev->wake = true; 3431 struct dentry *dn, *prev = NULL; local 3445 if (dn == prev) { [all...] |
/linux-master/drivers/md/ |
H A D | raid1.c | 2692 r1_bio = list_entry(head->prev, struct r1bio, retry_list); 2693 list_del(head->prev);
|