aboutsummaryrefslogtreecommitdiffstats
path: root/include/linux/sched.h
diff options
context:
space:
mode:
authorOleg Nesterov <oleg@tv-sign.ru>2006-03-28 19:11:05 -0500
committerLinus Torvalds <torvalds@g5.osdl.org>2006-03-28 21:36:41 -0500
commit8fafabd86f1b75ed3cc6a6ffbe6c3e53e3d8457d (patch)
tree3ae1a8fc44870ac3046213b11cad4aa8b3ce5f04 /include/linux/sched.h
parentd799f03597cabc6112acb518fc8ab4487aa4f953 (diff)
[PATCH] remove add_parent()'s parent argument
add_parent(p, parent) is always called with parent == p->parent, and it makes no sense to do it differently. This patch removes this argument. No changes in affected .o files. Signed-off-by: Oleg Nesterov <oleg@tv-sign.ru> Cc: "Eric W. Biederman" <ebiederm@xmission.com> Signed-off-by: Andrew Morton <akpm@osdl.org> Signed-off-by: Linus Torvalds <torvalds@osdl.org>
Diffstat (limited to 'include/linux/sched.h')
-rw-r--r--include/linux/sched.h4
1 files changed, 2 insertions, 2 deletions
diff --git a/include/linux/sched.h b/include/linux/sched.h
index 5f5ab98bbb6b..b4b14c32b28a 100644
--- a/include/linux/sched.h
+++ b/include/linux/sched.h
@@ -1184,7 +1184,7 @@ extern void wait_task_inactive(task_t * p);
1184#endif 1184#endif
1185 1185
1186#define remove_parent(p) list_del_init(&(p)->sibling) 1186#define remove_parent(p) list_del_init(&(p)->sibling)
1187#define add_parent(p, parent) list_add_tail(&(p)->sibling,&(parent)->children) 1187#define add_parent(p) list_add_tail(&(p)->sibling,&(p)->parent->children)
1188 1188
1189#define REMOVE_LINKS(p) do { \ 1189#define REMOVE_LINKS(p) do { \
1190 if (thread_group_leader(p)) \ 1190 if (thread_group_leader(p)) \
@@ -1195,7 +1195,7 @@ extern void wait_task_inactive(task_t * p);
1195#define SET_LINKS(p) do { \ 1195#define SET_LINKS(p) do { \
1196 if (thread_group_leader(p)) \ 1196 if (thread_group_leader(p)) \
1197 list_add_tail(&(p)->tasks,&init_task.tasks); \ 1197 list_add_tail(&(p)->tasks,&init_task.tasks); \
1198 add_parent(p, (p)->parent); \ 1198 add_parent(p); \
1199 } while (0) 1199 } while (0)
1200 1200
1201#define next_task(p) list_entry((p)->tasks.next, struct task_struct, tasks) 1201#define next_task(p) list_entry((p)->tasks.next, struct task_struct, tasks)