Searched refs:father (Results 1 - 5 of 5) sorted by relevance
| /kernel/liteos_a/testsuites/unittest/extended/signal/full/ |
| H A D | signal_test_017.cpp | 104 int father; in TestMultiPthreadFatherProcessExit() local
125 father = getppid(); in TestMultiPthreadFatherProcessExit()
126 printf("fatherPid = %d\n", father); in TestMultiPthreadFatherProcessExit()
128 printf("child kill father = %d\n", father); in TestMultiPthreadFatherProcessExit()
129 retValue = kill(father, SIGKILL); in TestMultiPthreadFatherProcessExit()
136 // grandchild process kill father process, so child process is recovered by init process in TestMultiPthreadFatherProcessExit()
|
| /kernel/linux/linux-5.10/kernel/ |
| H A D | exit.c | 378 /* exit: our father is in a different pgrp than in kill_orphaned_pgrp()
558 static struct task_struct *find_child_reaper(struct task_struct *father,
563 struct pid_namespace *pid_ns = task_active_pid_ns(father);
567 if (likely(reaper != father))
570 reaper = find_alive_thread(father);
586 return father;
596 static struct task_struct *find_new_reaper(struct task_struct *father, in find_new_reaper() argument
601 thread = find_alive_thread(father); in find_new_reaper()
605 if (father->signal->has_child_subreaper) { in find_new_reaper()
606 unsigned int ns_level = task_pid(father) in find_new_reaper()
634 reparent_leader(struct task_struct *father, struct task_struct *p, struct list_head *dead) reparent_leader() argument
663 forget_original_parent(struct task_struct *father, struct list_head *dead) forget_original_parent() argument
[all...] |
| /kernel/linux/linux-6.6/kernel/ |
| H A D | exit.c | 387 /* exit: our father is in a different pgrp than in kill_orphaned_pgrp()
590 static struct task_struct *find_child_reaper(struct task_struct *father,
595 struct pid_namespace *pid_ns = task_active_pid_ns(father);
599 if (likely(reaper != father))
602 reaper = find_alive_thread(father);
618 return father;
628 static struct task_struct *find_new_reaper(struct task_struct *father, in find_new_reaper() argument
633 thread = find_alive_thread(father); in find_new_reaper()
637 if (father->signal->has_child_subreaper) { in find_new_reaper()
638 unsigned int ns_level = task_pid(father) in find_new_reaper()
666 reparent_leader(struct task_struct *father, struct task_struct *p, struct list_head *dead) reparent_leader() argument
695 forget_original_parent(struct task_struct *father, struct list_head *dead) forget_original_parent() argument
[all...] |
| /kernel/linux/linux-5.10/fs/reiserfs/ |
| H A D | fix_node.c | 961 struct buffer_head *father, *left; in is_left_neighbor_in_cache() local
970 /* Calculate father of the node to be balanced. */ in is_left_neighbor_in_cache()
971 father = PATH_H_PBUFFER(tb->tb_path, h + 1); in is_left_neighbor_in_cache()
973 RFALSE(!father || in is_left_neighbor_in_cache()
974 !B_IS_IN_TREE(father) || in is_left_neighbor_in_cache()
976 !buffer_uptodate(father) || in is_left_neighbor_in_cache()
979 father, tb->FL[h]); in is_left_neighbor_in_cache()
983 * into the left father. in is_left_neighbor_in_cache()
985 left_neighbor_position = (father == tb->FL[h]) ? in is_left_neighbor_in_cache()
1085 /* if we are in the root of the tree, then there is no common father */ in get_far_parent()
[all...] |
| /kernel/linux/linux-6.6/fs/reiserfs/ |
| H A D | fix_node.c | 961 struct buffer_head *father, *left; in is_left_neighbor_in_cache() local
970 /* Calculate father of the node to be balanced. */ in is_left_neighbor_in_cache()
971 father = PATH_H_PBUFFER(tb->tb_path, h + 1); in is_left_neighbor_in_cache()
973 RFALSE(!father || in is_left_neighbor_in_cache()
974 !B_IS_IN_TREE(father) || in is_left_neighbor_in_cache()
976 !buffer_uptodate(father) || in is_left_neighbor_in_cache()
979 father, tb->FL[h]); in is_left_neighbor_in_cache()
983 * into the left father. in is_left_neighbor_in_cache()
985 left_neighbor_position = (father == tb->FL[h]) ? in is_left_neighbor_in_cache()
1085 /* if we are in the root of the tree, then there is no common father */ in get_far_parent()
[all...] |
Completed in 7 milliseconds