| /linux-4.4.14/drivers/usb/core/ |
| D | urb.c | 757 struct urb *victim; in usb_kill_anchored_urbs() local
761 victim = list_entry(anchor->urb_list.prev, struct urb, in usb_kill_anchored_urbs()
764 usb_get_urb(victim); in usb_kill_anchored_urbs()
767 usb_kill_urb(victim); in usb_kill_anchored_urbs()
768 usb_put_urb(victim); in usb_kill_anchored_urbs()
789 struct urb *victim; in usb_poison_anchored_urbs() local
794 victim = list_entry(anchor->urb_list.prev, struct urb, in usb_poison_anchored_urbs()
797 usb_get_urb(victim); in usb_poison_anchored_urbs()
800 usb_poison_urb(victim); in usb_poison_anchored_urbs()
801 usb_put_urb(victim); in usb_poison_anchored_urbs()
[all …]
|
| /linux-4.4.14/mm/ |
| D | oom_kill.c | 513 struct task_struct *victim = p; in oom_kill_process() local
559 put_task_struct(victim); in oom_kill_process()
560 victim = child; in oom_kill_process()
562 get_task_struct(victim); in oom_kill_process()
568 p = find_lock_task_mm(victim); in oom_kill_process()
570 put_task_struct(victim); in oom_kill_process()
572 } else if (victim != p) { in oom_kill_process()
574 put_task_struct(victim); in oom_kill_process()
575 victim = p; in oom_kill_process()
579 mm = victim->mm; in oom_kill_process()
[all …]
|
| D | readahead.c | 64 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()
|
| D | swap.c | 357 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()
|
| D | swapfile.c | 1850 struct file *swap_file, *victim; in SYSCALL_DEFINE1() local
1866 victim = file_open_name(pathname, O_RDWR|O_LARGEFILE, 0); in SYSCALL_DEFINE1()
1867 err = PTR_ERR(victim); in SYSCALL_DEFINE1()
1868 if (IS_ERR(victim)) in SYSCALL_DEFINE1()
1871 mapping = victim->f_mapping; in SYSCALL_DEFINE1()
1993 filp_close(victim, NULL); in SYSCALL_DEFINE1()
|
| D | memcontrol.c | 1519 struct mem_cgroup *victim = NULL; in mem_cgroup_soft_reclaim() local
1532 victim = mem_cgroup_iter(root_memcg, victim, &reclaim); in mem_cgroup_soft_reclaim()
1533 if (!victim) { in mem_cgroup_soft_reclaim()
1555 total += mem_cgroup_shrink_node_zone(victim, gfp_mask, false, in mem_cgroup_soft_reclaim()
1561 mem_cgroup_iter_break(root_memcg, victim); in mem_cgroup_soft_reclaim()
|
| D | Kconfig | 443 Cleancache can be thought of as a page-granularity victim cache
|
| /linux-4.4.14/arch/powerpc/kvm/ |
| D | trace.h | 50 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,
|
| D | e500_mmu.c | 42 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.4.14/fs/cachefiles/ |
| D | namei.c | 832 struct dentry *victim; in cachefiles_check_active() local
843 victim = lookup_one_len(filename, dir, strlen(filename)); in cachefiles_check_active()
845 if (IS_ERR(victim)) in cachefiles_check_active()
854 if (d_is_negative(victim)) { in cachefiles_check_active()
856 dput(victim); in cachefiles_check_active()
869 if (object->dentry > victim) in cachefiles_check_active()
871 else if (object->dentry < victim) in cachefiles_check_active()
880 return victim; in cachefiles_check_active()
885 dput(victim); in cachefiles_check_active()
891 ret = PTR_ERR(victim); in cachefiles_check_active()
[all …]
|
| /linux-4.4.14/arch/powerpc/platforms/cell/spufs/ |
| D | sched.c | 631 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.4.14/drivers/mmc/core/ |
| D | sdio_cis.c | 353 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.4.14/tools/lib/ |
| D | rbtree.c | 496 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-4.4.14/lib/ |
| D | rbtree.c | 537 void rb_replace_node(struct rb_node *victim, struct rb_node *new, in rb_replace_node() argument
540 struct rb_node *parent = rb_parent(victim); in rb_replace_node()
543 __rb_change_child(victim, new, parent, root); in rb_replace_node()
544 if (victim->rb_left) in rb_replace_node()
545 rb_set_parent(victim->rb_left, new); in rb_replace_node()
546 if (victim->rb_right) in rb_replace_node()
547 rb_set_parent(victim->rb_right, new); in rb_replace_node()
550 *new = *victim; in rb_replace_node()
|
| D | btree.c | 639 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.4.14/kernel/ |
| D | audit_tree.c | 495 static void prune_one(struct audit_tree *victim) in prune_one() argument
498 while (!list_empty(&victim->chunks)) { in prune_one()
501 p = list_entry(victim->chunks.next, struct node, list); in prune_one()
506 put_tree(victim); in prune_one()
673 struct audit_tree *victim; in prune_tree_thread() local
675 victim = list_entry(prune_list.next, in prune_tree_thread()
677 list_del_init(&victim->list); in prune_tree_thread()
681 prune_one(victim); in prune_tree_thread()
890 struct audit_tree *victim; in audit_kill_trees() local
892 victim = list_entry(list->next, struct audit_tree, list); in audit_kill_trees()
[all …]
|
| /linux-4.4.14/init/ |
| D | initramfs.c | 199 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.4.14/include/linux/ |
| D | btree-128.h | 77 struct btree_head128 *victim, in btree_merge128() argument
80 return btree_merge(&target->h, &victim->h, &btree_geo128, gfp); in btree_merge128()
|
| D | btree-type.h | 30 BTREE_TYPE_HEAD *victim, in BTREE_FN()
33 return btree_merge(&target->h, &victim->h, BTREE_TYPE_GEO, gfp); in BTREE_FN()
|
| D | rbtree.h | 77 extern void rb_replace_node(struct rb_node *victim, struct rb_node *new,
|
| D | btree.h | 157 int btree_merge(struct btree_head *target, struct btree_head *victim,
|
| /linux-4.4.14/drivers/staging/lustre/lustre/osc/ |
| D | osc_cache.c | 527 struct osc_extent *victim) in osc_extent_merge() argument
536 if (victim == NULL) in osc_extent_merge()
539 if (victim->oe_state != OES_CACHE || victim->oe_fsync_wait) in osc_extent_merge()
542 if (cur->oe_max_end != victim->oe_max_end) in osc_extent_merge()
545 LASSERT(cur->oe_osclock == victim->oe_osclock); in osc_extent_merge()
549 if (chunk_start != (victim->oe_end >> ppc_bits) + 1 && in osc_extent_merge()
550 chunk_end + 1 != victim->oe_start >> ppc_bits) in osc_extent_merge()
553 OSC_EXTENT_DUMP(D_CACHE, victim, "will be merged by %p.\n", cur); in osc_extent_merge()
555 cur->oe_start = min(cur->oe_start, victim->oe_start); in osc_extent_merge()
556 cur->oe_end = max(cur->oe_end, victim->oe_end); in osc_extent_merge()
[all …]
|
| /linux-4.4.14/drivers/mtd/ubi/ |
| D | fastmap-wl.c | 38 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()
|
| D | fastmap.c | 276 struct ubi_ainf_peb *aeb, *victim; in update_vol() local
309 victim = kmem_cache_alloc(ai->aeb_slab_cache, in update_vol()
311 if (!victim) in update_vol()
314 victim->ec = aeb->ec; in update_vol()
315 victim->pnum = aeb->pnum; in update_vol()
316 list_add_tail(&victim->u.list, &ai->erase); in update_vol()
|
| /linux-4.4.14/Documentation/ABI/testing/ |
| D | sysfs-fs-f2fs | 26 Controls the victim selection policy for garbage collection.
64 Controls the number of trials to find a victim segment.
|
| /linux-4.4.14/tools/include/linux/ |
| D | rbtree.h | 76 extern void rb_replace_node(struct rb_node *victim, struct rb_node *new,
|
| /linux-4.4.14/drivers/staging/lustre/lustre/libcfs/ |
| D | tracefile.c | 607 struct cfs_trace_page *victim; in put_pages_on_tcd_daemon_list() local
610 victim = cfs_tage_from_list(tcd->tcd_daemon_pages.next); in put_pages_on_tcd_daemon_list()
612 __LASSERT_TAGE_INVARIANT(victim); in put_pages_on_tcd_daemon_list()
614 list_del(&victim->linkage); in put_pages_on_tcd_daemon_list()
615 cfs_tage_free(victim); in put_pages_on_tcd_daemon_list()
|
| /linux-4.4.14/Documentation/filesystems/ |
| D | f2fs.txt | 64 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
191 gc_idle This parameter controls the selection of victim
234 find a victim segment when conducting SSR and
569 F2FS supports two victim selection policies: greedy and cost-benefit algorithms.
570 In the greedy algorithm, F2FS selects a victim segment having the smallest number
571 of valid blocks. In the cost-benefit algorithm, F2FS selects a victim segment
577 In order to identify whether the data in the victim segment are valid or not,
|
| D | directory-locking | 15 3) object removal. Locking rules: caller locks parent, finds victim,
16 locks victim and calls the method.
|
| D | porting | 73 same (i.e. parents and victim are locked, etc.).
|
| D | Locking | 103 victim.
|
| /linux-4.4.14/Documentation/vm/ |
| D | 00-INDEX | 8 - Intro to cleancache and page-granularity victim cache.
|
| D | cleancache.txt | 7 Cleancache can be thought of as a page-granularity victim cache for clean
|
| /linux-4.4.14/fs/nfsd/ |
| D | nfs4recover.c | 909 free_cld_upcall(struct cld_upcall *victim) in free_cld_upcall() argument
911 struct cld_net *cn = victim->cu_net; in free_cld_upcall()
914 list_del(&victim->cu_list); in free_cld_upcall()
916 kfree(victim); in free_cld_upcall()
|
| /linux-4.4.14/fs/ |
| D | block_dev.c | 1516 struct block_device *victim = NULL; in __blkdev_put() local
1546 victim = bdev->bd_contains; in __blkdev_put()
1554 if (victim) in __blkdev_put()
1555 __blkdev_put(victim, mode, 1); in __blkdev_put()
|
| D | locks.c | 1718 struct file_lock *fl, *victim = NULL; in generic_delete_lease() local
1733 victim = fl; in generic_delete_lease()
1737 trace_generic_delete_lease(inode, victim); in generic_delete_lease()
1738 if (victim) in generic_delete_lease()
1739 error = fl->fl_lmops->lm_change(victim, F_UNLCK, &dispose); in generic_delete_lease()
|
| D | namei.c | 2553 static int may_delete(struct inode *dir, struct dentry *victim, bool isdir) in may_delete() argument
2555 struct inode *inode = d_backing_inode(victim); in may_delete()
2558 if (d_is_negative(victim)) in may_delete()
2562 BUG_ON(victim->d_parent->d_inode != dir); in may_delete()
2563 audit_inode_child(dir, victim, AUDIT_TYPE_CHILD_DELETE); in may_delete()
2575 if (!d_is_dir(victim)) in may_delete()
2577 if (IS_ROOT(victim)) in may_delete()
2579 } else if (d_is_dir(victim)) in may_delete()
2583 if (victim->d_flags & DCACHE_NFSFS_RENAMED) in may_delete()
|
| /linux-4.4.14/fs/btrfs/ |
| D | raid56.c | 336 struct btrfs_raid_bio *victim) in merge_rbio() argument
338 bio_list_merge(&dest->bio_list, &victim->bio_list); in merge_rbio()
339 dest->bio_list_bytes += victim->bio_list_bytes; in merge_rbio()
340 dest->generic_bio_cnt += victim->generic_bio_cnt; in merge_rbio()
341 bio_list_init(&victim->bio_list); in merge_rbio()
|
| D | ioctl.c | 772 static int btrfs_may_delete(struct inode *dir, struct dentry *victim, int isdir) in btrfs_may_delete() argument
776 if (d_really_is_negative(victim)) in btrfs_may_delete()
779 BUG_ON(d_inode(victim->d_parent) != dir); in btrfs_may_delete()
780 audit_inode_child(dir, victim, AUDIT_TYPE_CHILD_DELETE); in btrfs_may_delete()
787 if (check_sticky(dir, d_inode(victim)) || IS_APPEND(d_inode(victim)) || in btrfs_may_delete()
788 IS_IMMUTABLE(d_inode(victim)) || IS_SWAPFILE(d_inode(victim))) in btrfs_may_delete()
791 if (!d_is_dir(victim)) in btrfs_may_delete()
793 if (IS_ROOT(victim)) in btrfs_may_delete()
795 } else if (d_is_dir(victim)) in btrfs_may_delete()
799 if (victim->d_flags & DCACHE_NFSFS_RENAMED) in btrfs_may_delete()
|
| /linux-4.4.14/include/trace/events/ |
| D | f2fs.h | 559 __field(unsigned int, victim)
572 __entry->victim = p->min_segno;
586 __entry->victim,
|
| /linux-4.4.14/fs/f2fs/ |
| D | gc.c | 762 static int __get_victim(struct f2fs_sb_info *sbi, unsigned int *victim, in __get_victim() argument
769 ret = DIRTY_I(sbi)->v_ops->get_victim(sbi, victim, gc_type, in __get_victim()
|
| /linux-4.4.14/fs/ocfs2/ |
| D | suballoc.c | 1873 u16 victim, i; in ocfs2_claim_suballoc_bits() local
1917 victim = ocfs2_find_victim_chain(cl); in ocfs2_claim_suballoc_bits()
1918 ac->ac_chain = victim; in ocfs2_claim_suballoc_bits()
1934 trace_ocfs2_claim_suballoc_bits(victim); in ocfs2_claim_suballoc_bits()
1942 if (i == victim) in ocfs2_claim_suballoc_bits()
|
| /linux-4.4.14/Documentation/s390/ |
| D | Debugging390.txt | 1577 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.4.14/Documentation/ |
| D | rbtree.txt | 145 void rb_erase(struct rb_node *victim, struct rb_root *tree);
|
| /linux-4.4.14/Documentation/RCU/ |
| D | checklist.txt | 357 victim CPU from ever going offline.)
|