| /linux/mm/ |
| H A D | oom_kill.c | 162 /* return true if the task is not adequate as candidate victim task. */
447 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()
509 * victim (if that is possible) to help the OOM killer to move on.
533 * Reduce those races by reaping the oom victim from the other end in __oom_reap_task_mm()
679 /* The victim managed to terminate on its own - see exit_mmap */ in wake_oom_reaper()
694 * Give the OOM victim tim
928 __oom_kill_process(struct task_struct * victim,const char * message) __oom_kill_process() argument
1026 struct task_struct *victim = oc->chosen; oom_kill_process() local
[all...] |
| /linux/drivers/usb/core/ |
| H A D | urb.c | 814 struct urb *victim; in usb_kill_anchored_urbs() local
820 victim = list_entry(anchor->urb_list.prev, in usb_kill_anchored_urbs()
823 usb_get_urb(victim); in usb_kill_anchored_urbs()
826 usb_kill_urb(victim); in usb_kill_anchored_urbs()
827 usb_put_urb(victim); in usb_kill_anchored_urbs()
852 struct urb *victim; in usb_poison_anchored_urbs() local
859 victim = list_entry(anchor->urb_list.prev, in usb_poison_anchored_urbs()
862 usb_get_urb(victim); in usb_poison_anchored_urbs()
865 usb_poison_urb(victim); in usb_poison_anchored_urbs()
866 usb_put_urb(victim); in usb_poison_anchored_urbs()
[all …]
|
| /linux/lib/ |
| H A D | rbtree.c | 524 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 D | btree.c | 634 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 D | trace.h | 49 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 D | e500_mmu.c | 39 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 D | sched.c | 613 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 D | rbtree.c | 545 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 D | audit_tree.c | 571 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 D | sdio_cis.c | 385 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 D | rbtree.h | 82 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 D | btree-128.h | 78 struct btree_head128 *victim, in btree_merge128() argument
81 return btree_merge(&target->h, &victim->h, &btree_geo128, gfp); in btree_merge128()
|
| H A D | btree-type.h | 31 BTREE_TYPE_HEAD *victim, in BTREE_FN()
34 return btree_merge(&target->h, &victim->h, BTREE_TYPE_GEO, gfp); in BTREE_FN()
|
| /linux/init/ |
| H A D | initramfs.c | 228 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 D | rbtree.h | 63 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/drivers/firmware/arm_scmi/ |
| H A D | bus.c | 170 struct scmi_requested_dev *victim, *tmp; in scmi_protocol_device_unrequest() local
172 list_for_each_entry_safe(victim, tmp, phead, node) { in scmi_protocol_device_unrequest()
173 if (!strcmp(victim->id_table->name, id_table->name)) { in scmi_protocol_device_unrequest()
174 list_del(&victim->node); in scmi_protocol_device_unrequest()
179 (void *)victim->id_table); in scmi_protocol_device_unrequest()
180 kfree(victim); in scmi_protocol_device_unrequest()
|
| /linux/fs/ |
| H A D | dcache.c | 1143 static inline void shrink_kill(struct dentry *victim) in shrink_kill() argument
1147 victim = __dentry_kill(victim); in shrink_kill()
1149 } while (victim && lock_for_kill(victim)); in shrink_kill()
1151 if (victim) in shrink_kill()
1152 spin_unlock(&victim->d_lock); in shrink_kill()
1516 struct dentry *victim; member
1568 data->victim = dentry; in select_collect2()
1608 data.victim = NULL; in shrink_dcache_tree()
1610 if (data.victim) { in shrink_dcache_tree()
1611 spin_lock(&data.victim->d_lock); in shrink_dcache_tree()
[all …]
|
| H A D | libfs.c | 605 struct dentry *victim = NULL, *child; in __simple_recursive_removal() local
611 while ((child = find_next_child(this, victim)) == NULL) { in __simple_recursive_removal()
617 victim = this; in __simple_recursive_removal()
620 if (!locked || victim != dentry) in __simple_recursive_removal()
622 if (simple_positive(victim)) { in __simple_recursive_removal()
623 d_invalidate(victim); // avoid lost mounts in __simple_recursive_removal()
625 callback(victim); in __simple_recursive_removal()
626 fsnotify_delete(inode, d_inode(victim), victim); in __simple_recursive_removal()
627 d_make_discardable(victim); in __simple_recursive_removal()
629 if (victim == dentry) { in __simple_recursive_removal()
|
| /linux/security/ |
| H A D | inode.c | 277 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 D | zstd.c | 125 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/security/selinux/ss/ |
| H A D | sidtab.c | 566 struct sidtab_str_cache *cache, *victim = NULL; in sidtab_sid2str_put() local
589 victim = container_of(s->cache_lru_list.prev, in sidtab_sid2str_put()
591 list_del(&victim->lru_member); in sidtab_sid2str_put()
592 rcu_assign_pointer(victim->parent->cache, NULL); in sidtab_sid2str_put()
605 kfree_rcu(victim, rcu_member); in sidtab_sid2str_put()
|
| /linux/drivers/dax/ |
| H A D | bus.c | 540 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 D | local_storage.c | 62 int BPF_PROG(unlink_hook, struct inode *dir, struct dentry *victim) in BPF_PROG() argument
83 is_self_unlink = storage->exec_inode == victim->d_inode; in BPF_PROG()
|
| /linux/drivers/mtd/ubi/ |
| H A D | fastmap-wl.c | 29 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 D | core-scheduling.rst | 16 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
|