Home
last modified time | relevance | path

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

123

/linux/mm/
H A Doom_kill.c447 static void dump_oom_victim(struct oom_control *oc, struct task_struct *victim) in dump_oom_victim() argument
454 mem_cgroup_print_oom_context(oc->memcg, victim); in dump_oom_victim()
455 pr_cont(",task=%s,pid=%d,uid=%d\n", victim->comm, victim->pid, in dump_oom_victim()
456 from_kuid(&init_user_ns, task_uid(victim))); in dump_oom_victim()
928 static void __oom_kill_process(struct task_struct *victim, const char *message) in __oom_kill_process() argument
934 p = find_lock_task_mm(victim); in __oom_kill_process()
937 message, task_pid_nr(victim), victim->comm); in __oom_kill_process()
938 put_task_struct(victim); in __oom_kill_process()
940 } else if (victim != p) { in __oom_kill_process()
942 put_task_struct(victim); in __oom_kill_process()
[all …]
/linux/lib/
H A Drbtree.c524 void rb_replace_node(struct rb_node *victim, struct rb_node *new, in rb_replace_node() argument
527 struct rb_node *parent = rb_parent(victim); in rb_replace_node()
530 *new = *victim; in rb_replace_node()
533 if (victim->rb_left) in rb_replace_node()
534 rb_set_parent(victim->rb_left, new); in rb_replace_node()
535 if (victim->rb_right) in rb_replace_node()
536 rb_set_parent(victim->rb_right, new); in rb_replace_node()
537 __rb_change_child(victim, new, parent, root); in rb_replace_node()
541 void rb_replace_node_rcu(struct rb_node *victim, struct rb_node *new, in rb_replace_node_rcu() argument
544 struct rb_node *parent = rb_parent(victim); in rb_replace_node_rcu()
[all …]
H A Dbtree.c634 int btree_merge(struct btree_head *target, struct btree_head *victim, in btree_merge() argument
642 BUG_ON(target == victim); in btree_merge()
646 target->node = victim->node; in btree_merge()
647 target->height = victim->height; in btree_merge()
648 __btree_init(victim); in btree_merge()
656 val = btree_last(victim, geo, key); in btree_merge()
665 btree_remove(victim, geo, dup); in btree_merge()
/linux/arch/powerpc/kvm/
H A Dtrace.h49 TP_PROTO(unsigned int victim, unsigned int tid, unsigned int word0,
51 TP_ARGS(victim, tid, word0, word1, word2),
54 __field( unsigned int, victim )
62 __entry->victim = victim;
70 __entry->victim, __entry->tid, __entry->word0,
H A De500_mmu.c39 unsigned int victim; in gtlb0_get_next_victim() local
41 victim = vcpu_e500->gtlb_nv[0]++; in gtlb0_get_next_victim()
45 return victim; in gtlb0_get_next_victim()
130 unsigned int victim, tsized; in kvmppc_e500_deliver_tlb_miss() local
135 victim = (tlbsel == 0) ? gtlb0_get_next_victim(vcpu_e500) : 0; in kvmppc_e500_deliver_tlb_miss()
138 vcpu->arch.shared->mas0 = MAS0_TLBSEL(tlbsel) | MAS0_ESEL(victim) in kvmppc_e500_deliver_tlb_miss()
366 int victim; in kvmppc_e500_emul_tlbsx() local
370 victim = (tlbsel == 0) ? gtlb0_get_next_victim(vcpu_e500) : 0; in kvmppc_e500_emul_tlbsx()
373 | MAS0_ESEL(victim) in kvmppc_e500_emul_tlbsx()
/linux/arch/powerpc/platforms/cell/spufs/
H A Dsched.c613 struct spu_context *victim = NULL; in find_victim() local
639 (!victim || tmp->prio > victim->prio)) { in find_victim()
640 victim = spu->ctx; in find_victim()
643 if (victim) in find_victim()
644 get_spu_context(victim); in find_victim()
647 if (victim) { in find_victim()
658 if (!mutex_trylock(&victim->state_mutex)) { in find_victim()
659 put_spu_context(victim); in find_victim()
660 victim = NULL; in find_victim()
664 spu = victim->spu; in find_victim()
[all …]
/linux/tools/lib/
H A Drbtree.c545 void rb_replace_node(struct rb_node *victim, struct rb_node *new, in rb_replace_node() argument
548 struct rb_node *parent = rb_parent(victim); in rb_replace_node()
550 /* Copy the pointers/colour from the victim to the replacement */ in rb_replace_node()
551 *new = *victim; in rb_replace_node()
554 if (victim->rb_left) in rb_replace_node()
555 rb_set_parent(victim->rb_left, new); in rb_replace_node()
556 if (victim->rb_right) in rb_replace_node()
557 rb_set_parent(victim->rb_right, new); in rb_replace_node()
558 __rb_change_child(victim, new, parent, root); in rb_replace_node()
/linux/kernel/
H A Daudit_tree.c571 static void prune_tree_chunks(struct audit_tree *victim, bool tagged) in prune_tree_chunks() argument
574 while (!list_empty(&victim->chunks)) { in prune_tree_chunks()
579 p = list_first_entry(&victim->chunks, struct audit_node, list); in prune_tree_chunks()
603 static void prune_one(struct audit_tree *victim) in prune_one() argument
605 prune_tree_chunks(victim, false); in prune_one()
606 put_tree(victim); in prune_one()
771 struct audit_tree *victim; in prune_tree_thread() local
773 victim = list_entry(prune_list.next, in prune_tree_thread()
775 list_del_init(&victim->list); in prune_tree_thread()
779 prune_one(victim); in prune_tree_thread()
[all …]
/linux/drivers/mmc/core/
H A Dsdio_cis.c385 struct sdio_func_tuple *tuple, *victim; in sdio_free_common_cis() local
390 victim = tuple; in sdio_free_common_cis()
392 kfree(victim); in sdio_free_common_cis()
420 struct sdio_func_tuple *tuple, *victim; in sdio_free_func_cis() local
425 victim = tuple; in sdio_free_func_cis()
427 kfree(victim); in sdio_free_func_cis()
/linux/include/linux/
H A Drbtree.h82 extern void rb_replace_node(struct rb_node *victim, struct rb_node *new,
84 extern void rb_replace_node_rcu(struct rb_node *victim, struct rb_node *new,
159 static inline void rb_replace_node_cached(struct rb_node *victim, in rb_replace_node_cached() argument
163 if (root->rb_leftmost == victim) in rb_replace_node_cached()
165 rb_replace_node(victim, new, &root->rb_root); in rb_replace_node_cached()
H A 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()
H A 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()
H A Dbtree.h158 int btree_merge(struct btree_head *target, struct btree_head *victim,
/linux/init/
H A Dinitramfs.c228 static __initdata char *victim; variable
234 victim += n; in eat()
246 collected = victim; in read_into()
270 memcpy(collect, victim, n); in do_collect()
326 while (byte_count && *victim == '\0') in do_reset()
417 if (xwrite(wfile, victim, body_len, &wfile_pos) != body_len) in do_copy()
428 if (xwrite(wfile, victim, byte_count, &wfile_pos) != byte_count) in do_copy()
468 victim = buf; in write_buffer()
/linux/tools/include/linux/
H A Drbtree.h63 extern void rb_replace_node(struct rb_node *victim, struct rb_node *new,
146 static inline void rb_replace_node_cached(struct rb_node *victim, in rb_replace_node_cached() argument
150 if (root->rb_leftmost == victim) in rb_replace_node_cached()
152 rb_replace_node(victim, new, &root->rb_root); in rb_replace_node_cached()
/linux/fs/
H A Ddcache.c1133 static inline void shrink_kill(struct dentry *victim) in shrink_kill() argument
1137 victim = __dentry_kill(victim); in shrink_kill()
1139 } while (victim && lock_for_kill(victim)); in shrink_kill()
1141 if (victim) in shrink_kill()
1142 spin_unlock(&victim->d_lock); in shrink_kill()
1506 struct dentry *victim; member
1558 data->victim = dentry; in select_collect2()
1598 data.victim = NULL; in shrink_dcache_tree()
1600 if (data.victim) { in shrink_dcache_tree()
1601 spin_lock(&data.victim->d_lock); in shrink_dcache_tree()
[all …]
/linux/security/
H A Dinode.c277 static void remove_one(struct dentry *victim) in remove_one() argument
279 if (victim->d_parent == victim->d_sb->s_root) in remove_one()
/linux/fs/btrfs/
H A Dzstd.c125 struct workspace *victim = container_of(pos, struct workspace, in zstd_reclaim_timer_fn() local
129 if (time_after(victim->last_used, reclaim_threshold)) in zstd_reclaim_timer_fn()
133 if (victim->req_level) in zstd_reclaim_timer_fn()
136 level = victim->level; in zstd_reclaim_timer_fn()
137 list_del(&victim->lru_list); in zstd_reclaim_timer_fn()
138 list_del(&victim->list); in zstd_reclaim_timer_fn()
139 zstd_free_workspace(&victim->list); in zstd_reclaim_timer_fn()
/linux/drivers/dax/
H A Dbus.c540 struct device *victim; in delete_store() local
547 victim = device_find_child_by_name(dax_region->dev, buf); in delete_store()
548 if (!victim) in delete_store()
552 device_lock(victim); in delete_store()
553 dev_dax = to_dev_dax(victim); in delete_store()
555 if (victim->driver || dev_dax_size(dev_dax)) in delete_store()
567 if (dax_region->seed == victim) in delete_store()
569 if (dax_region->youngest == victim) in delete_store()
575 device_unlock(victim); in delete_store()
579 devm_release_action(dev, unregister_dev_dax, victim); in delete_store()
[all …]
/linux/tools/testing/selftests/bpf/progs/
H A Dlocal_storage.c62 int BPF_PROG(unlink_hook, struct inode *dir, struct dentry *victim) in BPF_PROG() argument
84 is_self_unlink = storage->exec_inode == victim->d_inode; in BPF_PROG()
/linux/drivers/mtd/ubi/
H A Dfastmap-wl.c29 struct ubi_wl_entry *e, *victim = NULL; in find_anchor_wl_entry() local
34 victim = e; in find_anchor_wl_entry()
39 return victim; in find_anchor_wl_entry()
/linux/Documentation/admin-guide/hw-vuln/
H A Dcore-scheduling.rst16 A cross-HT attack involves the attacker and victim running on different Hyper
135 HT1 (attack) HT2 (victim)
142 (victim) to enter idle mode. This is because the sending of the IPI would bring
177 IPI. Even though cache is flushed on entry to user mode, victim tasks on siblings
195 guest or host victim. This is because the guest attacker can craft invalid
H A Dgather_data_sampling.rst20 The victim does not need to do anything special other than use the vector
21 registers. The victim does not need to use gather instructions to be
/linux/drivers/cxl/
H A Dacpi.c806 struct resource *victim = cxl_get_public_resource(res); in remove_cxl_resources() local
811 if (victim) { in remove_cxl_resources()
812 remove_resource(victim); in remove_cxl_resources()
813 kfree(victim); in remove_cxl_resources()
/linux/fs/debugfs/
H A Dinode.c755 static void remove_one(struct dentry *victim) in remove_one() argument
757 if (d_is_reg(victim)) in remove_one()
758 __debugfs_file_removed(victim); in remove_one()

123