Home
last modified time | relevance | path

Searched refs:victim (Results 1 – 25 of 51) sorted by relevance

123

/Linux-v4.19/drivers/usb/core/
Durb.c786 struct urb *victim; in usb_kill_anchored_urbs() local
790 victim = list_entry(anchor->urb_list.prev, struct urb, in usb_kill_anchored_urbs()
793 usb_get_urb(victim); in usb_kill_anchored_urbs()
796 usb_kill_urb(victim); in usb_kill_anchored_urbs()
797 usb_put_urb(victim); in usb_kill_anchored_urbs()
818 struct urb *victim; in usb_poison_anchored_urbs() local
823 victim = list_entry(anchor->urb_list.prev, struct urb, in usb_poison_anchored_urbs()
826 usb_get_urb(victim); in usb_poison_anchored_urbs()
829 usb_poison_urb(victim); in usb_poison_anchored_urbs()
830 usb_put_urb(victim); in usb_poison_anchored_urbs()
[all …]
/Linux-v4.19/mm/
Doom_kill.c833 static void __oom_kill_process(struct task_struct *victim) in __oom_kill_process() argument
839 p = find_lock_task_mm(victim); in __oom_kill_process()
841 put_task_struct(victim); in __oom_kill_process()
843 } else if (victim != p) { in __oom_kill_process()
845 put_task_struct(victim); in __oom_kill_process()
846 victim = p; in __oom_kill_process()
850 mm = victim->mm; in __oom_kill_process()
862 do_send_sig_info(SIGKILL, SEND_SIG_FORCED, victim, PIDTYPE_TGID); in __oom_kill_process()
863 mark_oom_victim(victim); in __oom_kill_process()
865 task_pid_nr(victim), victim->comm, K(victim->mm->total_vm), in __oom_kill_process()
[all …]
Dreadahead.c66 struct page *victim; in read_cache_pages_invalidate_pages() local
69 victim = lru_to_page(pages); in read_cache_pages_invalidate_pages()
70 list_del(&victim->lru); in read_cache_pages_invalidate_pages()
71 read_cache_pages_invalidate_page(mapping, victim); in read_cache_pages_invalidate_pages()
Dswap.c128 struct page *victim; in put_pages_list() local
130 victim = list_entry(pages->prev, struct page, lru); in put_pages_list()
131 list_del(&victim->lru); in put_pages_list()
132 put_page(victim); in put_pages_list()
/Linux-v4.19/lib/
Drbtree.c589 void rb_replace_node(struct rb_node *victim, struct rb_node *new, in rb_replace_node() argument
592 struct rb_node *parent = rb_parent(victim); in rb_replace_node()
595 *new = *victim; in rb_replace_node()
598 if (victim->rb_left) in rb_replace_node()
599 rb_set_parent(victim->rb_left, new); in rb_replace_node()
600 if (victim->rb_right) in rb_replace_node()
601 rb_set_parent(victim->rb_right, new); in rb_replace_node()
602 __rb_change_child(victim, new, parent, root); in rb_replace_node()
606 void rb_replace_node_cached(struct rb_node *victim, struct rb_node *new, in rb_replace_node_cached() argument
609 rb_replace_node(victim, new, &root->rb_root); in rb_replace_node_cached()
[all …]
Dbtree.c641 int btree_merge(struct btree_head *target, struct btree_head *victim, in btree_merge() argument
649 BUG_ON(target == victim); in btree_merge()
653 target->node = victim->node; in btree_merge()
654 target->height = victim->height; in btree_merge()
655 __btree_init(victim); in btree_merge()
663 if (!btree_last(victim, geo, key)) in btree_merge()
665 val = btree_lookup(victim, geo, key); in btree_merge()
672 btree_remove(victim, geo, dup); in btree_merge()
/Linux-v4.19/arch/powerpc/kvm/
Dtrace.h51 TP_PROTO(unsigned int victim, unsigned int tid, unsigned int word0,
53 TP_ARGS(victim, tid, word0, word1, word2),
56 __field( unsigned int, victim )
64 __entry->victim = victim;
72 __entry->victim, __entry->tid, __entry->word0,
De500_mmu.c42 unsigned int victim; in gtlb0_get_next_victim() local
44 victim = vcpu_e500->gtlb_nv[0]++; in gtlb0_get_next_victim()
48 return victim; in gtlb0_get_next_victim()
133 unsigned int victim, tsized; in kvmppc_e500_deliver_tlb_miss() local
138 victim = (tlbsel == 0) ? gtlb0_get_next_victim(vcpu_e500) : 0; in kvmppc_e500_deliver_tlb_miss()
141 vcpu->arch.shared->mas0 = MAS0_TLBSEL(tlbsel) | MAS0_ESEL(victim) in kvmppc_e500_deliver_tlb_miss()
369 int victim; in kvmppc_e500_emul_tlbsx() local
373 victim = (tlbsel == 0) ? gtlb0_get_next_victim(vcpu_e500) : 0; in kvmppc_e500_emul_tlbsx()
376 | MAS0_ESEL(victim) in kvmppc_e500_emul_tlbsx()
/Linux-v4.19/fs/cachefiles/
Dnamei.c872 struct dentry *victim; in cachefiles_check_active() local
883 victim = lookup_one_len(filename, dir, strlen(filename)); in cachefiles_check_active()
885 if (IS_ERR(victim)) in cachefiles_check_active()
894 if (d_is_negative(victim)) { in cachefiles_check_active()
896 dput(victim); in cachefiles_check_active()
909 if (object->dentry > victim) in cachefiles_check_active()
911 else if (object->dentry < victim) in cachefiles_check_active()
920 return victim; in cachefiles_check_active()
925 dput(victim); in cachefiles_check_active()
931 ret = PTR_ERR(victim); in cachefiles_check_active()
[all …]
/Linux-v4.19/arch/powerpc/platforms/cell/spufs/
Dsched.c632 struct spu_context *victim = NULL; in find_victim() local
658 (!victim || tmp->prio > victim->prio)) { in find_victim()
659 victim = spu->ctx; in find_victim()
662 if (victim) in find_victim()
663 get_spu_context(victim); in find_victim()
666 if (victim) { in find_victim()
677 if (!mutex_trylock(&victim->state_mutex)) { in find_victim()
678 put_spu_context(victim); in find_victim()
679 victim = NULL; in find_victim()
683 spu = victim->spu; in find_victim()
[all …]
/Linux-v4.19/drivers/mmc/core/
Dsdio_cis.c360 struct sdio_func_tuple *tuple, *victim; in sdio_free_common_cis() local
365 victim = tuple; in sdio_free_common_cis()
367 kfree(victim); in sdio_free_common_cis()
401 struct sdio_func_tuple *tuple, *victim; in sdio_free_func_cis() local
406 victim = tuple; in sdio_free_func_cis()
408 kfree(victim); in sdio_free_func_cis()
/Linux-v4.19/tools/lib/
Drbtree.c496 void rb_replace_node(struct rb_node *victim, struct rb_node *new, in rb_replace_node() argument
499 struct rb_node *parent = rb_parent(victim); in rb_replace_node()
502 __rb_change_child(victim, new, parent, root); in rb_replace_node()
503 if (victim->rb_left) in rb_replace_node()
504 rb_set_parent(victim->rb_left, new); in rb_replace_node()
505 if (victim->rb_right) in rb_replace_node()
506 rb_set_parent(victim->rb_right, new); in rb_replace_node()
509 *new = *victim; in rb_replace_node()
/Linux-v4.19/include/linux/
Drbtree.h98 extern void rb_replace_node(struct rb_node *victim, struct rb_node *new,
100 extern void rb_replace_node_rcu(struct rb_node *victim, struct rb_node *new,
102 extern void rb_replace_node_cached(struct rb_node *victim, struct rb_node *new,
Dbtree-128.h78 struct btree_head128 *victim, in btree_merge128() argument
81 return btree_merge(&target->h, &victim->h, &btree_geo128, gfp); in btree_merge128()
Dbtree-type.h31 BTREE_TYPE_HEAD *victim, in BTREE_FN()
34 return btree_merge(&target->h, &victim->h, BTREE_TYPE_GEO, gfp); in BTREE_FN()
Dbtree.h158 int btree_merge(struct btree_head *target, struct btree_head *victim,
/Linux-v4.19/kernel/
Daudit_tree.c539 static void prune_one(struct audit_tree *victim) in prune_one() argument
542 while (!list_empty(&victim->chunks)) { in prune_one()
545 p = list_entry(victim->chunks.next, struct node, list); in prune_one()
550 put_tree(victim); in prune_one()
719 struct audit_tree *victim; in prune_tree_thread() local
721 victim = list_entry(prune_list.next, in prune_tree_thread()
723 list_del_init(&victim->list); in prune_tree_thread()
727 prune_one(victim); in prune_tree_thread()
934 struct audit_tree *victim; in audit_kill_trees() local
936 victim = list_entry(list->next, struct audit_tree, list); in audit_kill_trees()
[all …]
/Linux-v4.19/init/
Dinitramfs.c191 static __initdata char *victim; variable
197 victim += n; in eat()
210 collected = victim; in read_into()
234 memcpy(collect, victim, n); in do_collect()
287 while (byte_count && *victim == '\0') in do_reset()
364 if (xwrite(wfd, victim, body_len) != body_len) in do_copy()
373 if (xwrite(wfd, victim, byte_count) != byte_count) in do_copy()
407 victim = buf; in write_buffer()
/Linux-v4.19/drivers/mtd/ubi/
Dfastmap-wl.c38 struct ubi_wl_entry *e, *victim = NULL; in find_anchor_wl_entry() local
43 victim = e; in find_anchor_wl_entry()
48 return victim; in find_anchor_wl_entry()
/Linux-v4.19/drivers/lightnvm/
Dpblk-gc.c362 struct pblk_line *line, *victim; in pblk_gc_get_victim_line() local
365 victim = list_first_entry(group_list, struct pblk_line, list); in pblk_gc_get_victim_line()
368 victim_vsc = le32_to_cpu(*victim->vsc); in pblk_gc_get_victim_line()
370 victim = line; in pblk_gc_get_victim_line()
373 return victim; in pblk_gc_get_victim_line()
/Linux-v4.19/tools/include/linux/
Drbtree.h76 extern void rb_replace_node(struct rb_node *victim, struct rb_node *new,
/Linux-v4.19/drivers/nvdimm/
Dlabel.c633 struct nd_label_ent *label_ent, *victim = NULL; in __pmem_label_update() local
707 victim = label_ent; in __pmem_label_update()
708 list_move_tail(&victim->list, &nd_mapping->labels); in __pmem_label_update()
711 if (victim) { in __pmem_label_update()
713 slot = to_slot(ndd, victim->label); in __pmem_label_update()
715 victim->label = NULL; in __pmem_label_update()
/Linux-v4.19/Documentation/vm/
D00-INDEX8 - Intro to cleancache and page-granularity victim cache.
/Linux-v4.19/fs/xfs/libxfs/
Dxfs_iext_tree.c731 void *victim) in xfs_iext_remove_node() argument
741 ASSERT(node->ptrs[pos] == victim); in xfs_iext_remove_node()
742 kmem_free(victim); in xfs_iext_remove_node()
776 victim = node; in xfs_iext_remove_node()
/Linux-v4.19/Documentation/filesystems/
Df2fs.txt64 1. A victim segment is selected through referencing segment usage table.
65 2. It loads parent index structures of all the data in the victim identified by
93 - Support greedy and cost-benefit algorithms for victim selection policies
253 gc_idle This parameter controls the selection of victim
305 find a victim segment when conducting SSR and
640 F2FS supports two victim selection policies: greedy and cost-benefit algorithms.
641 In the greedy algorithm, F2FS selects a victim segment having the smallest number
642 of valid blocks. In the cost-benefit algorithm, F2FS selects a victim segment
648 In order to identify whether the data in the victim segment are valid or not,

123