Home
last modified time | relevance | path

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

/linux-4.1.27/drivers/usb/core/
Durb.c758 struct urb *victim; in usb_kill_anchored_urbs() local
762 victim = list_entry(anchor->urb_list.prev, struct urb, in usb_kill_anchored_urbs()
765 usb_get_urb(victim); in usb_kill_anchored_urbs()
768 usb_kill_urb(victim); in usb_kill_anchored_urbs()
769 usb_put_urb(victim); in usb_kill_anchored_urbs()
790 struct urb *victim; in usb_poison_anchored_urbs() local
795 victim = list_entry(anchor->urb_list.prev, struct urb, in usb_poison_anchored_urbs()
798 usb_get_urb(victim); in usb_poison_anchored_urbs()
801 usb_poison_urb(victim); in usb_poison_anchored_urbs()
802 usb_put_urb(victim); in usb_poison_anchored_urbs()
[all …]
/linux-4.1.27/mm/
Doom_kill.c506 struct task_struct *victim = p; in oom_kill_process() local
554 put_task_struct(victim); in oom_kill_process()
555 victim = child; in oom_kill_process()
557 get_task_struct(victim); in oom_kill_process()
563 p = find_lock_task_mm(victim); in oom_kill_process()
565 put_task_struct(victim); in oom_kill_process()
567 } else if (victim != p) { in oom_kill_process()
569 put_task_struct(victim); in oom_kill_process()
570 victim = p; in oom_kill_process()
574 mm = victim->mm; in oom_kill_process()
[all …]
Dreadahead.c64 struct page *victim; in read_cache_pages_invalidate_pages() local
67 victim = list_to_page(pages); in read_cache_pages_invalidate_pages()
68 list_del(&victim->lru); in read_cache_pages_invalidate_pages()
69 read_cache_pages_invalidate_page(mapping, victim); in read_cache_pages_invalidate_pages()
Dswap.c357 struct page *victim; in put_pages_list() local
359 victim = list_entry(pages->prev, struct page, lru); in put_pages_list()
360 list_del(&victim->lru); in put_pages_list()
361 page_cache_release(victim); in put_pages_list()
Dswapfile.c1808 struct file *swap_file, *victim; in SYSCALL_DEFINE1() local
1824 victim = file_open_name(pathname, O_RDWR|O_LARGEFILE, 0); in SYSCALL_DEFINE1()
1825 err = PTR_ERR(victim); in SYSCALL_DEFINE1()
1826 if (IS_ERR(victim)) in SYSCALL_DEFINE1()
1829 mapping = victim->f_mapping; in SYSCALL_DEFINE1()
1951 filp_close(victim, NULL); in SYSCALL_DEFINE1()
Dmemcontrol.c1697 struct mem_cgroup *victim = NULL; in mem_cgroup_soft_reclaim() local
1710 victim = mem_cgroup_iter(root_memcg, victim, &reclaim); in mem_cgroup_soft_reclaim()
1711 if (!victim) { in mem_cgroup_soft_reclaim()
1733 total += mem_cgroup_shrink_node_zone(victim, gfp_mask, false, in mem_cgroup_soft_reclaim()
1739 mem_cgroup_iter_break(root_memcg, victim); in mem_cgroup_soft_reclaim()
DKconfig460 Cleancache can be thought of as a page-granularity victim cache
/linux-4.1.27/fs/cachefiles/
Dnamei.c822 struct dentry *victim; in cachefiles_check_active() local
833 victim = lookup_one_len(filename, dir, strlen(filename)); in cachefiles_check_active()
835 if (IS_ERR(victim)) in cachefiles_check_active()
844 if (d_is_negative(victim)) { in cachefiles_check_active()
846 dput(victim); in cachefiles_check_active()
859 if (object->dentry > victim) in cachefiles_check_active()
861 else if (object->dentry < victim) in cachefiles_check_active()
870 return victim; in cachefiles_check_active()
875 dput(victim); in cachefiles_check_active()
881 ret = PTR_ERR(victim); in cachefiles_check_active()
[all …]
/linux-4.1.27/arch/powerpc/kvm/
Dtrace.h50 TP_PROTO(unsigned int victim, unsigned int tid, unsigned int word0,
52 TP_ARGS(victim, tid, word0, word1, word2),
55 __field( unsigned int, victim )
63 __entry->victim = victim;
71 __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-4.1.27/arch/powerpc/platforms/cell/spufs/
Dsched.c631 struct spu_context *victim = NULL; in find_victim() local
657 (!victim || tmp->prio > victim->prio)) { in find_victim()
658 victim = spu->ctx; in find_victim()
661 if (victim) in find_victim()
662 get_spu_context(victim); in find_victim()
665 if (victim) { in find_victim()
676 if (!mutex_trylock(&victim->state_mutex)) { in find_victim()
677 put_spu_context(victim); in find_victim()
678 victim = NULL; in find_victim()
682 spu = victim->spu; in find_victim()
[all …]
/linux-4.1.27/drivers/mmc/core/
Dsdio_cis.c353 struct sdio_func_tuple *tuple, *victim; in sdio_free_common_cis() local
358 victim = tuple; in sdio_free_common_cis()
360 kfree(victim); in sdio_free_common_cis()
394 struct sdio_func_tuple *tuple, *victim; in sdio_free_func_cis() local
399 victim = tuple; in sdio_free_func_cis()
401 kfree(victim); in sdio_free_func_cis()
/linux-4.1.27/lib/
Drbtree.c505 void rb_replace_node(struct rb_node *victim, struct rb_node *new, in rb_replace_node() argument
508 struct rb_node *parent = rb_parent(victim); in rb_replace_node()
511 __rb_change_child(victim, new, parent, root); in rb_replace_node()
512 if (victim->rb_left) in rb_replace_node()
513 rb_set_parent(victim->rb_left, new); in rb_replace_node()
514 if (victim->rb_right) in rb_replace_node()
515 rb_set_parent(victim->rb_right, new); in rb_replace_node()
518 *new = *victim; in rb_replace_node()
Dbtree.c639 int btree_merge(struct btree_head *target, struct btree_head *victim, in btree_merge() argument
647 BUG_ON(target == victim); in btree_merge()
651 target->node = victim->node; in btree_merge()
652 target->height = victim->height; in btree_merge()
653 __btree_init(victim); in btree_merge()
661 if (!btree_last(victim, geo, key)) in btree_merge()
663 val = btree_lookup(victim, geo, key); in btree_merge()
670 btree_remove(victim, geo, dup); in btree_merge()
/linux-4.1.27/kernel/
Daudit_tree.c493 static void prune_one(struct audit_tree *victim) in prune_one() argument
496 while (!list_empty(&victim->chunks)) { in prune_one()
499 p = list_entry(victim->chunks.next, struct node, list); in prune_one()
504 put_tree(victim); in prune_one()
671 struct audit_tree *victim; in prune_tree_thread() local
673 victim = list_entry(prune_list.next, in prune_tree_thread()
675 list_del_init(&victim->list); in prune_tree_thread()
679 prune_one(victim); in prune_tree_thread()
888 struct audit_tree *victim; in audit_kill_trees() local
890 victim = list_entry(list->next, struct audit_tree, list); in audit_kill_trees()
[all …]
/linux-4.1.27/init/
Dinitramfs.c199 static __initdata char *victim; variable
205 victim += n; in eat()
218 collected = victim; in read_into()
242 memcpy(collect, victim, n); in do_collect()
295 while (byte_count && *victim == '\0') in do_reset()
372 if (xwrite(wfd, victim, body_len) != body_len) in do_copy()
381 if (xwrite(wfd, victim, byte_count) != byte_count) in do_copy()
415 victim = buf; in write_buffer()
/linux-4.1.27/include/linux/
Dbtree-128.h77 struct btree_head128 *victim, in btree_merge128() argument
80 return btree_merge(&target->h, &victim->h, &btree_geo128, gfp); in btree_merge128()
Dbtree-type.h30 BTREE_TYPE_HEAD *victim, in BTREE_FN()
33 return btree_merge(&target->h, &victim->h, BTREE_TYPE_GEO, gfp); in BTREE_FN()
Drbtree.h76 extern void rb_replace_node(struct rb_node *victim, struct rb_node *new,
Dbtree.h157 int btree_merge(struct btree_head *target, struct btree_head *victim,
/linux-4.1.27/drivers/staging/lustre/lustre/osc/
Dosc_cache.c526 struct osc_extent *victim) in osc_extent_merge() argument
535 if (victim == NULL) in osc_extent_merge()
538 if (victim->oe_state != OES_CACHE || victim->oe_fsync_wait) in osc_extent_merge()
541 if (cur->oe_max_end != victim->oe_max_end) in osc_extent_merge()
544 LASSERT(cur->oe_osclock == victim->oe_osclock); in osc_extent_merge()
548 if (chunk_start != (victim->oe_end >> ppc_bits) + 1 && in osc_extent_merge()
549 chunk_end + 1 != victim->oe_start >> ppc_bits) in osc_extent_merge()
552 OSC_EXTENT_DUMP(D_CACHE, victim, "will be merged by %p.\n", cur); in osc_extent_merge()
554 cur->oe_start = min(cur->oe_start, victim->oe_start); in osc_extent_merge()
555 cur->oe_end = max(cur->oe_end, victim->oe_end); in osc_extent_merge()
[all …]
/linux-4.1.27/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()
Dfastmap.c274 struct ubi_ainf_peb *aeb, *victim; in update_vol() local
307 victim = kmem_cache_alloc(ai->aeb_slab_cache, in update_vol()
309 if (!victim) in update_vol()
312 victim->ec = aeb->ec; in update_vol()
313 victim->pnum = aeb->pnum; in update_vol()
314 list_add_tail(&victim->u.list, &ai->erase); in update_vol()
/linux-4.1.27/Documentation/ABI/testing/
Dsysfs-fs-f2fs26 Controls the victim selection policy for garbage collection.
64 Controls the number of trials to find a victim segment.
/linux-4.1.27/drivers/staging/lustre/lustre/libcfs/
Dtracefile.c608 struct cfs_trace_page *victim; in put_pages_on_tcd_daemon_list() local
611 victim = cfs_tage_from_list(tcd->tcd_daemon_pages.next); in put_pages_on_tcd_daemon_list()
613 __LASSERT_TAGE_INVARIANT(victim); in put_pages_on_tcd_daemon_list()
615 list_del(&victim->linkage); in put_pages_on_tcd_daemon_list()
616 cfs_tage_free(victim); in put_pages_on_tcd_daemon_list()
/linux-4.1.27/Documentation/vm/
D00-INDEX8 - Intro to cleancache and page-granularity victim cache.
Dcleancache.txt7 Cleancache can be thought of as a page-granularity victim cache for clean
/linux-4.1.27/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
188 gc_idle This parameter controls the selection of victim
231 find a victim segment when conducting SSR and
566 F2FS supports two victim selection policies: greedy and cost-benefit algorithms.
567 In the greedy algorithm, F2FS selects a victim segment having the smallest number
568 of valid blocks. In the cost-benefit algorithm, F2FS selects a victim segment
574 In order to identify whether the data in the victim segment are valid or not,
Ddirectory-locking15 3) object removal. Locking rules: caller locks parent, finds victim,
16 locks victim and calls the method.
Dporting73 same (i.e. parents and victim are locked, etc.).
DLocking103 victim.
/linux-4.1.27/fs/nfsd/
Dnfs4recover.c904 free_cld_upcall(struct cld_upcall *victim) in free_cld_upcall() argument
906 struct cld_net *cn = victim->cu_net; in free_cld_upcall()
909 list_del(&victim->cu_list); in free_cld_upcall()
911 kfree(victim); in free_cld_upcall()
/linux-4.1.27/fs/
Dblock_dev.c1485 struct block_device *victim = NULL; in __blkdev_put() local
1512 victim = bdev->bd_contains; in __blkdev_put()
1520 if (victim) in __blkdev_put()
1521 __blkdev_put(victim, mode, 1); in __blkdev_put()
Dlocks.c1712 struct file_lock *fl, *victim = NULL; in generic_delete_lease() local
1727 victim = fl; in generic_delete_lease()
1731 trace_generic_delete_lease(inode, victim); in generic_delete_lease()
1732 if (victim) in generic_delete_lease()
1733 error = fl->fl_lmops->lm_change(victim, F_UNLCK, &dispose); in generic_delete_lease()
Dnamei.c2486 static int may_delete(struct inode *dir, struct dentry *victim, bool isdir) in may_delete() argument
2488 struct inode *inode = victim->d_inode; in may_delete()
2491 if (d_is_negative(victim)) in may_delete()
2495 BUG_ON(victim->d_parent->d_inode != dir); in may_delete()
2496 audit_inode_child(dir, victim, AUDIT_TYPE_CHILD_DELETE); in may_delete()
2508 if (!d_is_dir(victim)) in may_delete()
2510 if (IS_ROOT(victim)) in may_delete()
2512 } else if (d_is_dir(victim)) in may_delete()
2516 if (victim->d_flags & DCACHE_NFSFS_RENAMED) in may_delete()
/linux-4.1.27/fs/f2fs/
Dgc.c646 static int __get_victim(struct f2fs_sb_info *sbi, unsigned int *victim, in __get_victim() argument
653 ret = DIRTY_I(sbi)->v_ops->get_victim(sbi, victim, gc_type, in __get_victim()
/linux-4.1.27/fs/btrfs/
Dioctl.c771 static int btrfs_may_delete(struct inode *dir, struct dentry *victim, int isdir) in btrfs_may_delete() argument
775 if (d_really_is_negative(victim)) in btrfs_may_delete()
778 BUG_ON(d_inode(victim->d_parent) != dir); in btrfs_may_delete()
779 audit_inode_child(dir, victim, AUDIT_TYPE_CHILD_DELETE); in btrfs_may_delete()
786 if (check_sticky(dir, d_inode(victim)) || IS_APPEND(d_inode(victim)) || in btrfs_may_delete()
787 IS_IMMUTABLE(d_inode(victim)) || IS_SWAPFILE(d_inode(victim))) in btrfs_may_delete()
790 if (!d_is_dir(victim)) in btrfs_may_delete()
792 if (IS_ROOT(victim)) in btrfs_may_delete()
794 } else if (d_is_dir(victim)) in btrfs_may_delete()
798 if (victim->d_flags & DCACHE_NFSFS_RENAMED) in btrfs_may_delete()
Draid56.c335 struct btrfs_raid_bio *victim) in merge_rbio() argument
337 bio_list_merge(&dest->bio_list, &victim->bio_list); in merge_rbio()
338 dest->bio_list_bytes += victim->bio_list_bytes; in merge_rbio()
339 dest->generic_bio_cnt += victim->generic_bio_cnt; in merge_rbio()
340 bio_list_init(&victim->bio_list); in merge_rbio()
/linux-4.1.27/include/trace/events/
Df2fs.h526 __field(unsigned int, victim)
539 __entry->victim = p->min_segno;
553 __entry->victim,
/linux-4.1.27/fs/ocfs2/
Dsuballoc.c1890 u16 victim, i; in ocfs2_claim_suballoc_bits() local
1936 victim = ocfs2_find_victim_chain(cl); in ocfs2_claim_suballoc_bits()
1937 ac->ac_chain = victim; in ocfs2_claim_suballoc_bits()
1950 trace_ocfs2_claim_suballoc_bits(victim); in ocfs2_claim_suballoc_bits()
1958 if (i == victim) in ocfs2_claim_suballoc_bits()
/linux-4.1.27/Documentation/s390/
DDebugging390.txt1577 gdb <victim program> <optional corefile>
1618 set args: will set argc & argv each time the victim program is invoked.
1713 sends the victim program a signal.
1717 what gdb does when the victim receives certain signals.
1734 This calls a function in the victim program, this is pretty powerful
1847 to launch gdb (my victim app. ) now be bad & do the following from another
/linux-4.1.27/Documentation/
Drbtree.txt145 void rb_erase(struct rb_node *victim, struct rb_root *tree);
/linux-4.1.27/Documentation/RCU/
Dchecklist.txt357 victim CPU from ever going offline.)