Searched refs:prev (Results 1 - 25 of 1034) sorted by last modified time

1234567891011>>

/linux-master/kernel/sched/
H A Dfair.c393 * to the prev element but it will point to rq->leaf_cfs_rq_list
397 rq->tmp_alone_branch = cfs_rq->leaf_cfs_rq_list.prev;
4061 struct list_head *prev; local
4064 prev = cfs_rq->leaf_cfs_rq_list.prev;
4068 prev = rq->tmp_alone_branch;
4071 prev_cfs_rq = container_of(prev, struct cfs_rq, leaf_cfs_rq_list);
4184 struct cfs_rq *prev, struct cfs_rq *next)
4199 if (!(se->avg.last_update_time && prev))
4202 p_last_update_time = cfs_rq_last_update_time(prev);
4183 set_task_rq_fair(struct sched_entity *se, struct cfs_rq *prev, struct cfs_rq *next) argument
5480 put_prev_entity(struct cfs_rq *cfs_rq, struct sched_entity *prev) argument
7509 select_idle_sibling(struct task_struct *p, int prev, int target) argument
8263 balance_fair(struct rq *rq, struct task_struct *prev, struct rq_flags *rf) argument
8398 pick_next_task_fair(struct rq *rq, struct task_struct *prev, struct rq_flags *rf) argument
8550 put_prev_task_fair(struct rq *rq, struct task_struct *prev) argument
[all...]
H A Dsched.h515 struct cfs_rq *prev, struct cfs_rq *next);
518 struct cfs_rq *prev, struct cfs_rq *next) { }
2280 int (*balance)(struct rq *rq, struct task_struct *prev, struct rq_flags *rf);
2325 static inline void put_prev_task(struct rq *rq, struct task_struct *prev) argument
2327 WARN_ON_ONCE(rq->curr != prev);
2328 prev->sched_class->put_prev_task(rq, prev);
2390 extern struct task_struct *pick_next_task_fair(struct rq *rq, struct task_struct *prev, struct rq_flags *rf);
3423 struct task_struct *prev,
3428 * {prev,nex
517 set_task_rq_fair(struct sched_entity *se, struct cfs_rq *prev, struct cfs_rq *next) argument
3422 switch_mm_cid(struct rq *rq, struct task_struct *prev, struct task_struct *next) argument
3474 switch_mm_cid(struct rq *rq, struct task_struct *prev, struct task_struct *next) argument
[all...]
/linux-master/drivers/dma/xilinx/
H A Dxilinx_dpdma.c496 * @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 Dowl-dma.c365 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 Dprocess_64.c369 * 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/tools/testing/selftests/
H A Dkselftest_harness.h775 /* Circular linked list where only prev is circular. */ \
779 item->prev = item; \
784 item->prev = head->prev; \
785 item->prev->next = item; \
786 head->prev = item; \
789 item->next->prev = item; \
790 item->prev = item; \
807 struct __fixture_metadata *prev, *next; member in struct:__fixture_metadata
810 .prev
817 struct __test_xfail *prev, *next; member in struct:__test_xfail
859 struct __fixture_variant_metadata *prev, *next; member in struct:__fixture_variant_metadata
886 struct __test_metadata *prev, *next; member in struct:__test_metadata
[all...]
/linux-master/net/wireless/
H A Dnl80211.c12881 s32 prev = S32_MIN; local
12886 if (thresholds[i] > 0 || thresholds[i] <= prev)
12889 prev = thresholds[i];
/linux-master/net/tls/
H A Dtls_strp.c301 nskb->prev = nskb;
304 last = first->prev;
306 first->prev = nskb;
/linux-master/net/mac80211/
H A Drx.c5185 struct ieee80211_sub_if_data *prev; local
5293 prev = NULL;
5309 if (!prev) {
5310 prev = sdata;
5314 rx.sdata = prev;
5317 prev = sdata;
5320 if (prev) {
5321 rx.sdata = prev;
H A Dmesh_pathtbl.c468 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/net/ipv4/
H A Droute.c1471 struct rtable *orig, *prev, **p; local
1485 prev = cmpxchg(p, orig, rt);
1486 if (prev == orig) {
/linux-master/mm/
H A Dhugetlb.c605 rg = iter->link.prev;
613 add += hugetlb_resv_map_add(resv, iter->link.prev,
625 rg = head->prev;
/linux-master/kernel/
H A Dvmcore_info.c192 VMCOREINFO_OFFSET(list_head, prev);
/linux-master/include/linux/
H A Dmm.h224 /* to align the pointer to the (prev) page boundary */
232 return list_entry((head)->prev, struct folio, lru);
3244 struct vm_area_struct *prev,
3289 struct vm_area_struct *prev,
3300 struct vm_area_struct *prev,
3305 return vma_modify(vmi, prev, vma, start, end, new_flags,
3313 struct vm_area_struct *prev,
3320 return vma_modify(vmi, prev, vma, start, end, new_flags,
3327 struct vm_area_struct *prev,
3332 return vma_modify(vmi, prev, vm
3299 vma_modify_flags(struct vma_iterator *vmi, struct vm_area_struct *prev, struct vm_area_struct *vma, unsigned long start, unsigned long end, unsigned long new_flags) argument
3312 vma_modify_flags_name(struct vma_iterator *vmi, struct vm_area_struct *prev, struct vm_area_struct *vma, unsigned long start, unsigned long end, unsigned long new_flags, struct anon_vma_name *new_name) argument
3326 vma_modify_policy(struct vma_iterator *vmi, struct vm_area_struct *prev, struct vm_area_struct *vma, unsigned long start, unsigned long end, struct mempolicy *new_pol) argument
3338 vma_modify_flags_uffd(struct vma_iterator *vmi, struct vm_area_struct *prev, struct vm_area_struct *vma, unsigned long start, unsigned long end, unsigned long new_flags, struct vm_userfaultfd_ctx new_ctx) argument
[all...]
/linux-master/drivers/net/wireless/intel/iwlwifi/mvm/
H A Dftm-initiator.c129 struct iwl_mvm_ftm_pasn_entry *entry, *prev; local
133 list_for_each_entry_safe(entry, prev, &mvm->ftm_initiator.pasn_list,
1110 "%pM: prev rtt_avg=%lld, new rtt_avg=%lld, rtt=%lld\n",
/linux-master/drivers/net/ethernet/intel/igc/
H A Digc_main.c6092 const struct tc_taprio_sched_entry *e, *prev; local
6095 prev = n ? &qopt->entries[n - 1] : NULL;
6113 !(prev->gate_mask & BIT(i)))
/linux-master/arch/arc/kernel/
H A Dentry-arcv2.S89 ; so a higher prio interrupt taken here won't clobber prev prio icause
/linux-master/arch/arc/include/asm/
H A Dmmu_context.h56 * 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/btrfs/
H A Dinode.c4437 struct rb_node *prev; local
4448 prev = NULL;
4450 prev = node;
4461 while (prev) {
4462 entry = rb_entry(prev, struct btrfs_inode, rb_node);
4464 node = prev;
4467 prev = rb_next(prev);
H A Dextent_map.c134 struct rb_node *prev = NULL; local
143 prev = n;
154 orig_prev = prev;
155 while (prev && offset >= extent_map_end(prev_entry)) {
156 prev = rb_next(prev);
157 prev_entry = rb_entry(prev, struct extent_map, rb_node);
164 if (prev) {
165 *prev_or_next_ret = prev;
169 prev
211 mergeable_maps(const struct extent_map *prev, const struct extent_map *next) argument
515 struct rb_node *prev; local
534 struct extent_map *prev; local
[all...]
/linux-master/fs/bcachefs/
H A Djournal_io.c1216 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 Dfs.c966 struct bkey_buf cur, prev; local
983 bch2_bkey_buf_init(&prev);
1018 bch2_bkey_buf_realloc(&prev, c, k.k->u64s);
1033 bkey_i_to_s_c(prev.k), 0);
1038 bkey_copy(prev.k, cur.k);
1052 ret = bch2_fill_extent(c, info, bkey_i_to_s_c(prev.k),
1058 bch2_bkey_buf_exit(&prev, c);
H A Dbtree_update_interior.c69 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 Dbtree_node_scan.c356 struct found_btree_node *prev = dst ? f->nodes.data + dst - 1 : NULL; local
358 if (prev &&
359 prev->cookie == i->cookie) {
360 if (prev->nr_ptrs == ARRAY_SIZE(prev->ptrs)) {
365 prev->ptrs[prev->nr_ptrs++] = i->ptrs[0];
H A Dbtree_io.c859 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;

Completed in 549 milliseconds

1234567891011>>