diff options
Diffstat (limited to 'kernel')
72 files changed, 2713 insertions, 1475 deletions
diff --git a/kernel/Makefile b/kernel/Makefile index 187c89b4783d..b8d4cd8ac0b9 100644 --- a/kernel/Makefile +++ b/kernel/Makefile | |||
| @@ -58,7 +58,6 @@ obj-$(CONFIG_KEXEC) += kexec.o | |||
| 58 | obj-$(CONFIG_BACKTRACE_SELF_TEST) += backtracetest.o | 58 | obj-$(CONFIG_BACKTRACE_SELF_TEST) += backtracetest.o |
| 59 | obj-$(CONFIG_COMPAT) += compat.o | 59 | obj-$(CONFIG_COMPAT) += compat.o |
| 60 | obj-$(CONFIG_CGROUPS) += cgroup.o | 60 | obj-$(CONFIG_CGROUPS) += cgroup.o |
| 61 | obj-$(CONFIG_CGROUP_DEBUG) += cgroup_debug.o | ||
| 62 | obj-$(CONFIG_CGROUP_FREEZER) += cgroup_freezer.o | 61 | obj-$(CONFIG_CGROUP_FREEZER) += cgroup_freezer.o |
| 63 | obj-$(CONFIG_CPUSETS) += cpuset.o | 62 | obj-$(CONFIG_CPUSETS) += cpuset.o |
| 64 | obj-$(CONFIG_CGROUP_NS) += ns_cgroup.o | 63 | obj-$(CONFIG_CGROUP_NS) += ns_cgroup.o |
diff --git a/kernel/audit.c b/kernel/audit.c index defc2e6f1e3b..5feed232be9d 100644 --- a/kernel/audit.c +++ b/kernel/audit.c | |||
| @@ -855,18 +855,24 @@ static int audit_receive_msg(struct sk_buff *skb, struct nlmsghdr *nlh) | |||
| 855 | break; | 855 | break; |
| 856 | } | 856 | } |
| 857 | case AUDIT_SIGNAL_INFO: | 857 | case AUDIT_SIGNAL_INFO: |
| 858 | err = security_secid_to_secctx(audit_sig_sid, &ctx, &len); | 858 | len = 0; |
| 859 | if (err) | 859 | if (audit_sig_sid) { |
| 860 | return err; | 860 | err = security_secid_to_secctx(audit_sig_sid, &ctx, &len); |
| 861 | if (err) | ||
| 862 | return err; | ||
| 863 | } | ||
| 861 | sig_data = kmalloc(sizeof(*sig_data) + len, GFP_KERNEL); | 864 | sig_data = kmalloc(sizeof(*sig_data) + len, GFP_KERNEL); |
| 862 | if (!sig_data) { | 865 | if (!sig_data) { |
| 863 | security_release_secctx(ctx, len); | 866 | if (audit_sig_sid) |
| 867 | security_release_secctx(ctx, len); | ||
| 864 | return -ENOMEM; | 868 | return -ENOMEM; |
| 865 | } | 869 | } |
| 866 | sig_data->uid = audit_sig_uid; | 870 | sig_data->uid = audit_sig_uid; |
| 867 | sig_data->pid = audit_sig_pid; | 871 | sig_data->pid = audit_sig_pid; |
| 868 | memcpy(sig_data->ctx, ctx, len); | 872 | if (audit_sig_sid) { |
| 869 | security_release_secctx(ctx, len); | 873 | memcpy(sig_data->ctx, ctx, len); |
| 874 | security_release_secctx(ctx, len); | ||
| 875 | } | ||
| 870 | audit_send_reply(NETLINK_CB(skb).pid, seq, AUDIT_SIGNAL_INFO, | 876 | audit_send_reply(NETLINK_CB(skb).pid, seq, AUDIT_SIGNAL_INFO, |
| 871 | 0, 0, sig_data, sizeof(*sig_data) + len); | 877 | 0, 0, sig_data, sizeof(*sig_data) + len); |
| 872 | kfree(sig_data); | 878 | kfree(sig_data); |
diff --git a/kernel/audit_watch.c b/kernel/audit_watch.c index 0e96dbc60ea9..cc7e87936cbc 100644 --- a/kernel/audit_watch.c +++ b/kernel/audit_watch.c | |||
| @@ -45,8 +45,8 @@ | |||
| 45 | 45 | ||
| 46 | struct audit_watch { | 46 | struct audit_watch { |
| 47 | atomic_t count; /* reference count */ | 47 | atomic_t count; /* reference count */ |
| 48 | char *path; /* insertion path */ | ||
| 49 | dev_t dev; /* associated superblock device */ | 48 | dev_t dev; /* associated superblock device */ |
| 49 | char *path; /* insertion path */ | ||
| 50 | unsigned long ino; /* associated inode number */ | 50 | unsigned long ino; /* associated inode number */ |
| 51 | struct audit_parent *parent; /* associated parent */ | 51 | struct audit_parent *parent; /* associated parent */ |
| 52 | struct list_head wlist; /* entry in parent->watches list */ | 52 | struct list_head wlist; /* entry in parent->watches list */ |
diff --git a/kernel/auditsc.c b/kernel/auditsc.c index 68d3c6a0ecd6..267e484f0198 100644 --- a/kernel/auditsc.c +++ b/kernel/auditsc.c | |||
| @@ -168,12 +168,12 @@ struct audit_context { | |||
| 168 | int in_syscall; /* 1 if task is in a syscall */ | 168 | int in_syscall; /* 1 if task is in a syscall */ |
| 169 | enum audit_state state, current_state; | 169 | enum audit_state state, current_state; |
| 170 | unsigned int serial; /* serial number for record */ | 170 | unsigned int serial; /* serial number for record */ |
| 171 | struct timespec ctime; /* time of syscall entry */ | ||
| 172 | int major; /* syscall number */ | 171 | int major; /* syscall number */ |
| 172 | struct timespec ctime; /* time of syscall entry */ | ||
| 173 | unsigned long argv[4]; /* syscall arguments */ | 173 | unsigned long argv[4]; /* syscall arguments */ |
| 174 | int return_valid; /* return code is valid */ | ||
| 175 | long return_code;/* syscall return code */ | 174 | long return_code;/* syscall return code */ |
| 176 | u64 prio; | 175 | u64 prio; |
| 176 | int return_valid; /* return code is valid */ | ||
| 177 | int name_count; | 177 | int name_count; |
| 178 | struct audit_names names[AUDIT_NAMES]; | 178 | struct audit_names names[AUDIT_NAMES]; |
| 179 | char * filterkey; /* key for rule that triggered record */ | 179 | char * filterkey; /* key for rule that triggered record */ |
| @@ -198,8 +198,8 @@ struct audit_context { | |||
| 198 | char target_comm[TASK_COMM_LEN]; | 198 | char target_comm[TASK_COMM_LEN]; |
| 199 | 199 | ||
| 200 | struct audit_tree_refs *trees, *first_trees; | 200 | struct audit_tree_refs *trees, *first_trees; |
| 201 | int tree_count; | ||
| 202 | struct list_head killed_trees; | 201 | struct list_head killed_trees; |
| 202 | int tree_count; | ||
| 203 | 203 | ||
| 204 | int type; | 204 | int type; |
| 205 | union { | 205 | union { |
diff --git a/kernel/cgroup.c b/kernel/cgroup.c index 213b7f92fcdd..ca83b73fba19 100644 --- a/kernel/cgroup.c +++ b/kernel/cgroup.c | |||
| @@ -23,6 +23,7 @@ | |||
| 23 | */ | 23 | */ |
| 24 | 24 | ||
| 25 | #include <linux/cgroup.h> | 25 | #include <linux/cgroup.h> |
| 26 | #include <linux/ctype.h> | ||
| 26 | #include <linux/errno.h> | 27 | #include <linux/errno.h> |
| 27 | #include <linux/fs.h> | 28 | #include <linux/fs.h> |
| 28 | #include <linux/kernel.h> | 29 | #include <linux/kernel.h> |
| @@ -48,6 +49,8 @@ | |||
| 48 | #include <linux/namei.h> | 49 | #include <linux/namei.h> |
| 49 | #include <linux/smp_lock.h> | 50 | #include <linux/smp_lock.h> |
| 50 | #include <linux/pid_namespace.h> | 51 | #include <linux/pid_namespace.h> |
| 52 | #include <linux/idr.h> | ||
| 53 | #include <linux/vmalloc.h> /* TODO: replace with more sophisticated array */ | ||
| 51 | 54 | ||
| 52 | #include <asm/atomic.h> | 55 | #include <asm/atomic.h> |
| 53 | 56 | ||
| @@ -60,6 +63,8 @@ static struct cgroup_subsys *subsys[] = { | |||
| 60 | #include <linux/cgroup_subsys.h> | 63 | #include <linux/cgroup_subsys.h> |
| 61 | }; | 64 | }; |
| 62 | 65 | ||
| 66 | #define MAX_CGROUP_ROOT_NAMELEN 64 | ||
| 67 | |||
| 63 | /* | 68 | /* |
| 64 | * A cgroupfs_root represents the root of a cgroup hierarchy, | 69 | * A cgroupfs_root represents the root of a cgroup hierarchy, |
| 65 | * and may be associated with a superblock to form an active | 70 | * and may be associated with a superblock to form an active |
| @@ -74,6 +79,9 @@ struct cgroupfs_root { | |||
| 74 | */ | 79 | */ |
| 75 | unsigned long subsys_bits; | 80 | unsigned long subsys_bits; |
| 76 | 81 | ||
| 82 | /* Unique id for this hierarchy. */ | ||
| 83 | int hierarchy_id; | ||
| 84 | |||
| 77 | /* The bitmask of subsystems currently attached to this hierarchy */ | 85 | /* The bitmask of subsystems currently attached to this hierarchy */ |
| 78 | unsigned long actual_subsys_bits; | 86 | unsigned long actual_subsys_bits; |
| 79 | 87 | ||
| @@ -94,6 +102,9 @@ struct cgroupfs_root { | |||
| 94 | 102 | ||
| 95 | /* The path to use for release notifications. */ | 103 | /* The path to use for release notifications. */ |
| 96 | char release_agent_path[PATH_MAX]; | 104 | char release_agent_path[PATH_MAX]; |
| 105 | |||
| 106 | /* The name for this hierarchy - may be empty */ | ||
| 107 | char name[MAX_CGROUP_ROOT_NAMELEN]; | ||
| 97 | }; | 108 | }; |
| 98 | 109 | ||
| 99 | /* | 110 | /* |
| @@ -141,6 +152,10 @@ struct css_id { | |||
| 141 | static LIST_HEAD(roots); | 152 | static LIST_HEAD(roots); |
| 142 | static int root_count; | 153 | static int root_count; |
| 143 | 154 | ||
| 155 | static DEFINE_IDA(hierarchy_ida); | ||
| 156 | static int next_hierarchy_id; | ||
| 157 | static DEFINE_SPINLOCK(hierarchy_id_lock); | ||
| 158 | |||
| 144 | /* dummytop is a shorthand for the dummy hierarchy's top cgroup */ | 159 | /* dummytop is a shorthand for the dummy hierarchy's top cgroup */ |
| 145 | #define dummytop (&rootnode.top_cgroup) | 160 | #define dummytop (&rootnode.top_cgroup) |
| 146 | 161 | ||
| @@ -201,6 +216,7 @@ struct cg_cgroup_link { | |||
| 201 | * cgroup, anchored on cgroup->css_sets | 216 | * cgroup, anchored on cgroup->css_sets |
| 202 | */ | 217 | */ |
| 203 | struct list_head cgrp_link_list; | 218 | struct list_head cgrp_link_list; |
| 219 | struct cgroup *cgrp; | ||
| 204 | /* | 220 | /* |
| 205 | * List running through cg_cgroup_links pointing at a | 221 | * List running through cg_cgroup_links pointing at a |
| 206 | * single css_set object, anchored on css_set->cg_links | 222 | * single css_set object, anchored on css_set->cg_links |
| @@ -227,8 +243,11 @@ static int cgroup_subsys_init_idr(struct cgroup_subsys *ss); | |||
| 227 | static DEFINE_RWLOCK(css_set_lock); | 243 | static DEFINE_RWLOCK(css_set_lock); |
| 228 | static int css_set_count; | 244 | static int css_set_count; |
| 229 | 245 | ||
| 230 | /* hash table for cgroup groups. This improves the performance to | 246 | /* |
| 231 | * find an existing css_set */ | 247 | * hash table for cgroup groups. This improves the performance to find |
| 248 | * an existing css_set. This hash doesn't (currently) take into | ||
| 249 | * account cgroups in empty hierarchies. | ||
| 250 | */ | ||
| 232 | #define CSS_SET_HASH_BITS 7 | 251 | #define CSS_SET_HASH_BITS 7 |
| 233 | #define CSS_SET_TABLE_SIZE (1 << CSS_SET_HASH_BITS) | 252 | #define CSS_SET_TABLE_SIZE (1 << CSS_SET_HASH_BITS) |
| 234 | static struct hlist_head css_set_table[CSS_SET_TABLE_SIZE]; | 253 | static struct hlist_head css_set_table[CSS_SET_TABLE_SIZE]; |
| @@ -248,48 +267,22 @@ static struct hlist_head *css_set_hash(struct cgroup_subsys_state *css[]) | |||
| 248 | return &css_set_table[index]; | 267 | return &css_set_table[index]; |
| 249 | } | 268 | } |
| 250 | 269 | ||
| 270 | static void free_css_set_rcu(struct rcu_head *obj) | ||
| 271 | { | ||
| 272 | struct css_set *cg = container_of(obj, struct css_set, rcu_head); | ||
| 273 | kfree(cg); | ||
| 274 | } | ||
| 275 | |||
| 251 | /* We don't maintain the lists running through each css_set to its | 276 | /* We don't maintain the lists running through each css_set to its |
| 252 | * task until after the first call to cgroup_iter_start(). This | 277 | * task until after the first call to cgroup_iter_start(). This |
| 253 | * reduces the fork()/exit() overhead for people who have cgroups | 278 | * reduces the fork()/exit() overhead for people who have cgroups |
| 254 | * compiled into their kernel but not actually in use */ | 279 | * compiled into their kernel but not actually in use */ |
| 255 | static int use_task_css_set_links __read_mostly; | 280 | static int use_task_css_set_links __read_mostly; |
| 256 | 281 | ||
| 257 | /* When we create or destroy a css_set, the operation simply | 282 | static void __put_css_set(struct css_set *cg, int taskexit) |
| 258 | * takes/releases a reference count on all the cgroups referenced | ||
| 259 | * by subsystems in this css_set. This can end up multiple-counting | ||
| 260 | * some cgroups, but that's OK - the ref-count is just a | ||
| 261 | * busy/not-busy indicator; ensuring that we only count each cgroup | ||
| 262 | * once would require taking a global lock to ensure that no | ||
| 263 | * subsystems moved between hierarchies while we were doing so. | ||
| 264 | * | ||
| 265 | * Possible TODO: decide at boot time based on the number of | ||
| 266 | * registered subsystems and the number of CPUs or NUMA nodes whether | ||
| 267 | * it's better for performance to ref-count every subsystem, or to | ||
| 268 | * take a global lock and only add one ref count to each hierarchy. | ||
| 269 | */ | ||
| 270 | |||
| 271 | /* | ||
| 272 | * unlink a css_set from the list and free it | ||
| 273 | */ | ||
| 274 | static void unlink_css_set(struct css_set *cg) | ||
| 275 | { | 283 | { |
| 276 | struct cg_cgroup_link *link; | 284 | struct cg_cgroup_link *link; |
| 277 | struct cg_cgroup_link *saved_link; | 285 | struct cg_cgroup_link *saved_link; |
| 278 | |||
| 279 | hlist_del(&cg->hlist); | ||
| 280 | css_set_count--; | ||
| 281 | |||
| 282 | list_for_each_entry_safe(link, saved_link, &cg->cg_links, | ||
| 283 | cg_link_list) { | ||
| 284 | list_del(&link->cg_link_list); | ||
| 285 | list_del(&link->cgrp_link_list); | ||
| 286 | kfree(link); | ||
| 287 | } | ||
| 288 | } | ||
| 289 | |||
| 290 | static void __put_css_set(struct css_set *cg, int taskexit) | ||
| 291 | { | ||
| 292 | int i; | ||
| 293 | /* | 286 | /* |
| 294 | * Ensure that the refcount doesn't hit zero while any readers | 287 | * Ensure that the refcount doesn't hit zero while any readers |
| 295 | * can see it. Similar to atomic_dec_and_lock(), but for an | 288 | * can see it. Similar to atomic_dec_and_lock(), but for an |
| @@ -302,21 +295,28 @@ static void __put_css_set(struct css_set *cg, int taskexit) | |||
| 302 | write_unlock(&css_set_lock); | 295 | write_unlock(&css_set_lock); |
| 303 | return; | 296 | return; |
| 304 | } | 297 | } |
| 305 | unlink_css_set(cg); | ||
| 306 | write_unlock(&css_set_lock); | ||
| 307 | 298 | ||
| 308 | rcu_read_lock(); | 299 | /* This css_set is dead. unlink it and release cgroup refcounts */ |
| 309 | for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) { | 300 | hlist_del(&cg->hlist); |
| 310 | struct cgroup *cgrp = rcu_dereference(cg->subsys[i]->cgroup); | 301 | css_set_count--; |
| 302 | |||
| 303 | list_for_each_entry_safe(link, saved_link, &cg->cg_links, | ||
| 304 | cg_link_list) { | ||
| 305 | struct cgroup *cgrp = link->cgrp; | ||
| 306 | list_del(&link->cg_link_list); | ||
| 307 | list_del(&link->cgrp_link_list); | ||
| 311 | if (atomic_dec_and_test(&cgrp->count) && | 308 | if (atomic_dec_and_test(&cgrp->count) && |
| 312 | notify_on_release(cgrp)) { | 309 | notify_on_release(cgrp)) { |
| 313 | if (taskexit) | 310 | if (taskexit) |
| 314 | set_bit(CGRP_RELEASABLE, &cgrp->flags); | 311 | set_bit(CGRP_RELEASABLE, &cgrp->flags); |
| 315 | check_for_release(cgrp); | 312 | check_for_release(cgrp); |
| 316 | } | 313 | } |
| 314 | |||
| 315 | kfree(link); | ||
| 317 | } | 316 | } |
| 318 | rcu_read_unlock(); | 317 | |
| 319 | kfree(cg); | 318 | write_unlock(&css_set_lock); |
| 319 | call_rcu(&cg->rcu_head, free_css_set_rcu); | ||
| 320 | } | 320 | } |
| 321 | 321 | ||
| 322 | /* | 322 | /* |
| @@ -338,6 +338,78 @@ static inline void put_css_set_taskexit(struct css_set *cg) | |||
| 338 | } | 338 | } |
| 339 | 339 | ||
| 340 | /* | 340 | /* |
| 341 | * compare_css_sets - helper function for find_existing_css_set(). | ||
| 342 | * @cg: candidate css_set being tested | ||
| 343 | * @old_cg: existing css_set for a task | ||
| 344 | * @new_cgrp: cgroup that's being entered by the task | ||
| 345 | * @template: desired set of css pointers in css_set (pre-calculated) | ||
| 346 | * | ||
| 347 | * Returns true if "cg" matches "old_cg" except for the hierarchy | ||
| 348 | * which "new_cgrp" belongs to, for which it should match "new_cgrp". | ||
| 349 | */ | ||
| 350 | static bool compare_css_sets(struct css_set *cg, | ||
| 351 | struct css_set *old_cg, | ||
| 352 | struct cgroup *new_cgrp, | ||
| 353 | struct cgroup_subsys_state *template[]) | ||
| 354 | { | ||
| 355 | struct list_head *l1, *l2; | ||
| 356 | |||
| 357 | if (memcmp(template, cg->subsys, sizeof(cg->subsys))) { | ||
| 358 | /* Not all subsystems matched */ | ||
| 359 | return false; | ||
| 360 | } | ||
| 361 | |||
| 362 | /* | ||
| 363 | * Compare cgroup pointers in order to distinguish between | ||
| 364 | * different cgroups in heirarchies with no subsystems. We | ||
| 365 | * could get by with just this check alone (and skip the | ||
| 366 | * memcmp above) but on most setups the memcmp check will | ||
| 367 | * avoid the need for this more expensive check on almost all | ||
| 368 | * candidates. | ||
| 369 | */ | ||
| 370 | |||
| 371 | l1 = &cg->cg_links; | ||
| 372 | l2 = &old_cg->cg_links; | ||
| 373 | while (1) { | ||
| 374 | struct cg_cgroup_link *cgl1, *cgl2; | ||
| 375 | struct cgroup *cg1, *cg2; | ||
| 376 | |||
| 377 | l1 = l1->next; | ||
| 378 | l2 = l2->next; | ||
| 379 | /* See if we reached the end - both lists are equal length. */ | ||
| 380 | if (l1 == &cg->cg_links) { | ||
| 381 | BUG_ON(l2 != &old_cg->cg_links); | ||
| 382 | break; | ||
| 383 | } else { | ||
| 384 | BUG_ON(l2 == &old_cg->cg_links); | ||
| 385 | } | ||
| 386 | /* Locate the cgroups associated with these links. */ | ||
| 387 | cgl1 = list_entry(l1, struct cg_cgroup_link, cg_link_list); | ||
| 388 | cgl2 = list_entry(l2, struct cg_cgroup_link, cg_link_list); | ||
| 389 | cg1 = cgl1->cgrp; | ||
| 390 | cg2 = cgl2->cgrp; | ||
| 391 | /* Hierarchies should be linked in the same order. */ | ||
| 392 | BUG_ON(cg1->root != cg2->root); | ||
| 393 | |||
| 394 | /* | ||
| 395 | * If this hierarchy is the hierarchy of the cgroup | ||
| 396 | * that's changing, then we need to check that this | ||
| 397 | * css_set points to the new cgroup; if it's any other | ||
| 398 | * hierarchy, then this css_set should point to the | ||
| 399 | * same cgroup as the old css_set. | ||
| 400 | */ | ||
| 401 | if (cg1->root == new_cgrp->root) { | ||
| 402 | if (cg1 != new_cgrp) | ||
| 403 | return false; | ||
| 404 | } else { | ||
| 405 | if (cg1 != cg2) | ||
| 406 | return false; | ||
| 407 | } | ||
| 408 | } | ||
| 409 | return true; | ||
| 410 | } | ||
| 411 | |||
| 412 | /* | ||
| 341 | * find_existing_css_set() is a helper for | 413 | * find_existing_css_set() is a helper for |
| 342 | * find_css_set(), and checks to see whether an existing | 414 | * find_css_set(), and checks to see whether an existing |
| 343 | * css_set is suitable. | 415 | * css_set is suitable. |
| @@ -378,10 +450,11 @@ static struct css_set *find_existing_css_set( | |||
| 378 | 450 | ||
| 379 | hhead = css_set_hash(template); | 451 | hhead = css_set_hash(template); |
| 380 | hlist_for_each_entry(cg, node, hhead, hlist) { | 452 | hlist_for_each_entry(cg, node, hhead, hlist) { |
| 381 | if (!memcmp(template, cg->subsys, sizeof(cg->subsys))) { | 453 | if (!compare_css_sets(cg, oldcg, cgrp, template)) |
| 382 | /* All subsystems matched */ | 454 | continue; |
| 383 | return cg; | 455 | |
| 384 | } | 456 | /* This css_set matches what we need */ |
| 457 | return cg; | ||
| 385 | } | 458 | } |
| 386 | 459 | ||
| 387 | /* No existing cgroup group matched */ | 460 | /* No existing cgroup group matched */ |
| @@ -435,8 +508,14 @@ static void link_css_set(struct list_head *tmp_cg_links, | |||
| 435 | link = list_first_entry(tmp_cg_links, struct cg_cgroup_link, | 508 | link = list_first_entry(tmp_cg_links, struct cg_cgroup_link, |
| 436 | cgrp_link_list); | 509 | cgrp_link_list); |
| 437 | link->cg = cg; | 510 | link->cg = cg; |
| 511 | link->cgrp = cgrp; | ||
| 512 | atomic_inc(&cgrp->count); | ||
| 438 | list_move(&link->cgrp_link_list, &cgrp->css_sets); | 513 | list_move(&link->cgrp_link_list, &cgrp->css_sets); |
| 439 | list_add(&link->cg_link_list, &cg->cg_links); | 514 | /* |
| 515 | * Always add links to the tail of the list so that the list | ||
| 516 | * is sorted by order of hierarchy creation | ||
| 517 | */ | ||
| 518 | list_add_tail(&link->cg_link_list, &cg->cg_links); | ||
| 440 | } | 519 | } |
| 441 | 520 | ||
| 442 | /* | 521 | /* |
| @@ -451,11 +530,11 @@ static struct css_set *find_css_set( | |||
| 451 | { | 530 | { |
| 452 | struct css_set *res; | 531 | struct css_set *res; |
| 453 | struct cgroup_subsys_state *template[CGROUP_SUBSYS_COUNT]; | 532 | struct cgroup_subsys_state *template[CGROUP_SUBSYS_COUNT]; |
| 454 | int i; | ||
| 455 | 533 | ||
| 456 | struct list_head tmp_cg_links; | 534 | struct list_head tmp_cg_links; |
| 457 | 535 | ||
| 458 | struct hlist_head *hhead; | 536 | struct hlist_head *hhead; |
| 537 | struct cg_cgroup_link *link; | ||
| 459 | 538 | ||
| 460 | /* First see if we already have a cgroup group that matches | 539 | /* First see if we already have a cgroup group that matches |
| 461 | * the desired set */ | 540 | * the desired set */ |
| @@ -489,20 +568,12 @@ static struct css_set *find_css_set( | |||
| 489 | 568 | ||
| 490 | write_lock(&css_set_lock); | 569 | write_lock(&css_set_lock); |
| 491 | /* Add reference counts and links from the new css_set. */ | 570 | /* Add reference counts and links from the new css_set. */ |
| 492 | for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) { | 571 | list_for_each_entry(link, &oldcg->cg_links, cg_link_list) { |
| 493 | struct cgroup *cgrp = res->subsys[i]->cgroup; | 572 | struct cgroup *c = link->cgrp; |
| 494 | struct cgroup_subsys *ss = subsys[i]; | 573 | if (c->root == cgrp->root) |
| 495 | atomic_inc(&cgrp->count); | 574 | c = cgrp; |
| 496 | /* | 575 | link_css_set(&tmp_cg_links, res, c); |
| 497 | * We want to add a link once per cgroup, so we | ||
| 498 | * only do it for the first subsystem in each | ||
| 499 | * hierarchy | ||
| 500 | */ | ||
| 501 | if (ss->root->subsys_list.next == &ss->sibling) | ||
| 502 | link_css_set(&tmp_cg_links, res, cgrp); | ||
| 503 | } | 576 | } |
| 504 | if (list_empty(&rootnode.subsys_list)) | ||
| 505 | link_css_set(&tmp_cg_links, res, dummytop); | ||
| 506 | 577 | ||
| 507 | BUG_ON(!list_empty(&tmp_cg_links)); | 578 | BUG_ON(!list_empty(&tmp_cg_links)); |
| 508 | 579 | ||
| @@ -518,6 +589,41 @@ static struct css_set *find_css_set( | |||
| 518 | } | 589 | } |
| 519 | 590 | ||
| 520 | /* | 591 | /* |
| 592 | * Return the cgroup for "task" from the given hierarchy. Must be | ||
| 593 | * called with cgroup_mutex held. | ||
| 594 | */ | ||
| 595 | static struct cgroup *task_cgroup_from_root(struct task_struct *task, | ||
| 596 | struct cgroupfs_root *root) | ||
| 597 | { | ||
| 598 | struct css_set *css; | ||
| 599 | struct cgroup *res = NULL; | ||
| 600 | |||
| 601 | BUG_ON(!mutex_is_locked(&cgroup_mutex)); | ||
| 602 | read_lock(&css_set_lock); | ||
| 603 | /* | ||
| 604 | * No need to lock the task - since we hold cgroup_mutex the | ||
| 605 | * task can't change groups, so the only thing that can happen | ||
| 606 | * is that it exits and its css is set back to init_css_set. | ||
| 607 | */ | ||
| 608 | css = task->cgroups; | ||
| 609 | if (css == &init_css_set) { | ||
| 610 | res = &root->top_cgroup; | ||
| 611 | } else { | ||
| 612 | struct cg_cgroup_link *link; | ||
| 613 | list_for_each_entry(link, &css->cg_links, cg_link_list) { | ||
| 614 | struct cgroup *c = link->cgrp; | ||
| 615 | if (c->root == root) { | ||
| 616 | res = c; | ||
| 617 | break; | ||
| 618 | } | ||
| 619 | } | ||
| 620 | } | ||
| 621 | read_unlock(&css_set_lock); | ||
| 622 | BUG_ON(!res); | ||
| 623 | return res; | ||
| 624 | } | ||
| 625 | |||
| 626 | /* | ||
| 521 | * There is one global cgroup mutex. We also require taking | 627 | * There is one global cgroup mutex. We also require taking |
| 522 | * task_lock() when dereferencing a task's cgroup subsys pointers. | 628 | * task_lock() when dereferencing a task's cgroup subsys pointers. |
| 523 | * See "The task_lock() exception", at the end of this comment. | 629 | * See "The task_lock() exception", at the end of this comment. |
| @@ -597,7 +703,7 @@ static int cgroup_mkdir(struct inode *dir, struct dentry *dentry, int mode); | |||
| 597 | static int cgroup_rmdir(struct inode *unused_dir, struct dentry *dentry); | 703 | static int cgroup_rmdir(struct inode *unused_dir, struct dentry *dentry); |
| 598 | static int cgroup_populate_dir(struct cgroup *cgrp); | 704 | static int cgroup_populate_dir(struct cgroup *cgrp); |
| 599 | static const struct inode_operations cgroup_dir_inode_operations; | 705 | static const struct inode_operations cgroup_dir_inode_operations; |
| 600 | static struct file_operations proc_cgroupstats_operations; | 706 | static const struct file_operations proc_cgroupstats_operations; |
| 601 | 707 | ||
| 602 | static struct backing_dev_info cgroup_backing_dev_info = { | 708 | static struct backing_dev_info cgroup_backing_dev_info = { |
| 603 | .name = "cgroup", | 709 | .name = "cgroup", |
| @@ -677,6 +783,12 @@ static void cgroup_diput(struct dentry *dentry, struct inode *inode) | |||
| 677 | */ | 783 | */ |
| 678 | deactivate_super(cgrp->root->sb); | 784 | deactivate_super(cgrp->root->sb); |
| 679 | 785 | ||
| 786 | /* | ||
| 787 | * if we're getting rid of the cgroup, refcount should ensure | ||
| 788 | * that there are no pidlists left. | ||
| 789 | */ | ||
| 790 | BUG_ON(!list_empty(&cgrp->pidlists)); | ||
| 791 | |||
| 680 | call_rcu(&cgrp->rcu_head, free_cgroup_rcu); | 792 | call_rcu(&cgrp->rcu_head, free_cgroup_rcu); |
| 681 | } | 793 | } |
| 682 | iput(inode); | 794 | iput(inode); |
| @@ -841,6 +953,8 @@ static int cgroup_show_options(struct seq_file *seq, struct vfsmount *vfs) | |||
| 841 | seq_puts(seq, ",noprefix"); | 953 | seq_puts(seq, ",noprefix"); |
| 842 | if (strlen(root->release_agent_path)) | 954 | if (strlen(root->release_agent_path)) |
| 843 | seq_printf(seq, ",release_agent=%s", root->release_agent_path); | 955 | seq_printf(seq, ",release_agent=%s", root->release_agent_path); |
| 956 | if (strlen(root->name)) | ||
| 957 | seq_printf(seq, ",name=%s", root->name); | ||
| 844 | mutex_unlock(&cgroup_mutex); | 958 | mutex_unlock(&cgroup_mutex); |
| 845 | return 0; | 959 | return 0; |
| 846 | } | 960 | } |
| @@ -849,6 +963,12 @@ struct cgroup_sb_opts { | |||
| 849 | unsigned long subsys_bits; | 963 | unsigned long subsys_bits; |
| 850 | unsigned long flags; | 964 | unsigned long flags; |
| 851 | char *release_agent; | 965 | char *release_agent; |
| 966 | char *name; | ||
| 967 | /* User explicitly requested empty subsystem */ | ||
| 968 | bool none; | ||
| 969 | |||
| 970 | struct cgroupfs_root *new_root; | ||
| 971 | |||
| 852 | }; | 972 | }; |
| 853 | 973 | ||
| 854 | /* Convert a hierarchy specifier into a bitmask of subsystems and | 974 | /* Convert a hierarchy specifier into a bitmask of subsystems and |
| @@ -863,9 +983,7 @@ static int parse_cgroupfs_options(char *data, | |||
| 863 | mask = ~(1UL << cpuset_subsys_id); | 983 | mask = ~(1UL << cpuset_subsys_id); |
| 864 | #endif | 984 | #endif |
| 865 | 985 | ||
| 866 | opts->subsys_bits = 0; | 986 | memset(opts, 0, sizeof(*opts)); |
| 867 | opts->flags = 0; | ||
| 868 | opts->release_agent = NULL; | ||
| 869 | 987 | ||
| 870 | while ((token = strsep(&o, ",")) != NULL) { | 988 | while ((token = strsep(&o, ",")) != NULL) { |
| 871 | if (!*token) | 989 | if (!*token) |
| @@ -879,17 +997,42 @@ static int parse_cgroupfs_options(char *data, | |||
| 879 | if (!ss->disabled) | 997 | if (!ss->disabled) |
| 880 | opts->subsys_bits |= 1ul << i; | 998 | opts->subsys_bits |= 1ul << i; |
| 881 | } | 999 | } |
| 1000 | } else if (!strcmp(token, "none")) { | ||
| 1001 | /* Explicitly have no subsystems */ | ||
| 1002 | opts->none = true; | ||
| 882 | } else if (!strcmp(token, "noprefix")) { | 1003 | } else if (!strcmp(token, "noprefix")) { |
| 883 | set_bit(ROOT_NOPREFIX, &opts->flags); | 1004 | set_bit(ROOT_NOPREFIX, &opts->flags); |
| 884 | } else if (!strncmp(token, "release_agent=", 14)) { | 1005 | } else if (!strncmp(token, "release_agent=", 14)) { |
| 885 | /* Specifying two release agents is forbidden */ | 1006 | /* Specifying two release agents is forbidden */ |
| 886 | if (opts->release_agent) | 1007 | if (opts->release_agent) |
| 887 | return -EINVAL; | 1008 | return -EINVAL; |
| 888 | opts->release_agent = kzalloc(PATH_MAX, GFP_KERNEL); | 1009 | opts->release_agent = |
| 1010 | kstrndup(token + 14, PATH_MAX, GFP_KERNEL); | ||
| 889 | if (!opts->release_agent) | 1011 | if (!opts->release_agent) |
| 890 | return -ENOMEM; | 1012 | return -ENOMEM; |
| 891 | strncpy(opts->release_agent, token + 14, PATH_MAX - 1); | 1013 | } else if (!strncmp(token, "name=", 5)) { |
| 892 | opts->release_agent[PATH_MAX - 1] = 0; | 1014 | int i; |
| 1015 | const char *name = token + 5; | ||
| 1016 | /* Can't specify an empty name */ | ||
| 1017 | if (!strlen(name)) | ||
| 1018 | return -EINVAL; | ||
| 1019 | /* Must match [\w.-]+ */ | ||
| 1020 | for (i = 0; i < strlen(name); i++) { | ||
| 1021 | char c = name[i]; | ||
| 1022 | if (isalnum(c)) | ||
| 1023 | continue; | ||
| 1024 | if ((c == '.') || (c == '-') || (c == '_')) | ||
| 1025 | continue; | ||
| 1026 | return -EINVAL; | ||
| 1027 | } | ||
| 1028 | /* Specifying two names is forbidden */ | ||
| 1029 | if (opts->name) | ||
| 1030 | return -EINVAL; | ||
| 1031 | opts->name = kstrndup(name, | ||
| 1032 | MAX_CGROUP_ROOT_NAMELEN, | ||
| 1033 | GFP_KERNEL); | ||
| 1034 | if (!opts->name) | ||
| 1035 | return -ENOMEM; | ||
| 893 | } else { | 1036 | } else { |
| 894 | struct cgroup_subsys *ss; | 1037 | struct cgroup_subsys *ss; |
| 895 | int i; | 1038 | int i; |
| @@ -906,6 +1049,8 @@ static int parse_cgroupfs_options(char *data, | |||
| 906 | } | 1049 | } |
| 907 | } | 1050 | } |
| 908 | 1051 | ||
| 1052 | /* Consistency checks */ | ||
| 1053 | |||
| 909 | /* | 1054 | /* |
| 910 | * Option noprefix was introduced just for backward compatibility | 1055 | * Option noprefix was introduced just for backward compatibility |
| 911 | * with the old cpuset, so we allow noprefix only if mounting just | 1056 | * with the old cpuset, so we allow noprefix only if mounting just |
| @@ -915,8 +1060,16 @@ static int parse_cgroupfs_options(char *data, | |||
| 915 | (opts->subsys_bits & mask)) | 1060 | (opts->subsys_bits & mask)) |
| 916 | return -EINVAL; | 1061 | return -EINVAL; |
| 917 | 1062 | ||
| 918 | /* We can't have an empty hierarchy */ | 1063 | |
| 919 | if (!opts->subsys_bits) | 1064 | /* Can't specify "none" and some subsystems */ |
| 1065 | if (opts->subsys_bits && opts->none) | ||
| 1066 | return -EINVAL; | ||
| 1067 | |||
| 1068 | /* | ||
| 1069 | * We either have to specify by name or by subsystems. (So all | ||
| 1070 | * empty hierarchies must have a name). | ||
| 1071 | */ | ||
| 1072 | if (!opts->subsys_bits && !opts->name) | ||
| 920 | return -EINVAL; | 1073 | return -EINVAL; |
| 921 | 1074 | ||
| 922 | return 0; | 1075 | return 0; |
| @@ -944,6 +1097,12 @@ static int cgroup_remount(struct super_block *sb, int *flags, char *data) | |||
| 944 | goto out_unlock; | 1097 | goto out_unlock; |
| 945 | } | 1098 | } |
| 946 | 1099 | ||
| 1100 | /* Don't allow name to change at remount */ | ||
| 1101 | if (opts.name && strcmp(opts.name, root->name)) { | ||
| 1102 | ret = -EINVAL; | ||
| 1103 | goto out_unlock; | ||
| 1104 | } | ||
| 1105 | |||
| 947 | ret = rebind_subsystems(root, opts.subsys_bits); | 1106 | ret = rebind_subsystems(root, opts.subsys_bits); |
| 948 | if (ret) | 1107 | if (ret) |
| 949 | goto out_unlock; | 1108 | goto out_unlock; |
| @@ -955,6 +1114,7 @@ static int cgroup_remount(struct super_block *sb, int *flags, char *data) | |||
| 955 | strcpy(root->release_agent_path, opts.release_agent); | 1114 | strcpy(root->release_agent_path, opts.release_agent); |
| 956 | out_unlock: | 1115 | out_unlock: |
| 957 | kfree(opts.release_agent); | 1116 | kfree(opts.release_agent); |
| 1117 | kfree(opts.name); | ||
| 958 | mutex_unlock(&cgroup_mutex); | 1118 | mutex_unlock(&cgroup_mutex); |
| 959 | mutex_unlock(&cgrp->dentry->d_inode->i_mutex); | 1119 | mutex_unlock(&cgrp->dentry->d_inode->i_mutex); |
| 960 | unlock_kernel(); | 1120 | unlock_kernel(); |
| @@ -974,9 +1134,10 @@ static void init_cgroup_housekeeping(struct cgroup *cgrp) | |||
| 974 | INIT_LIST_HEAD(&cgrp->children); | 1134 | INIT_LIST_HEAD(&cgrp->children); |
| 975 | INIT_LIST_HEAD(&cgrp->css_sets); | 1135 | INIT_LIST_HEAD(&cgrp->css_sets); |
| 976 | INIT_LIST_HEAD(&cgrp->release_list); | 1136 | INIT_LIST_HEAD(&cgrp->release_list); |
| 977 | INIT_LIST_HEAD(&cgrp->pids_list); | 1137 | INIT_LIST_HEAD(&cgrp->pidlists); |
| 978 | init_rwsem(&cgrp->pids_mutex); | 1138 | mutex_init(&cgrp->pidlist_mutex); |
| 979 | } | 1139 | } |
| 1140 | |||
| 980 | static void init_cgroup_root(struct cgroupfs_root *root) | 1141 | static void init_cgroup_root(struct cgroupfs_root *root) |
| 981 | { | 1142 | { |
| 982 | struct cgroup *cgrp = &root->top_cgroup; | 1143 | struct cgroup *cgrp = &root->top_cgroup; |
| @@ -988,33 +1149,106 @@ static void init_cgroup_root(struct cgroupfs_root *root) | |||
| 988 | init_cgroup_housekeeping(cgrp); | 1149 | init_cgroup_housekeeping(cgrp); |
| 989 | } | 1150 | } |
| 990 | 1151 | ||
| 1152 | static bool init_root_id(struct cgroupfs_root *root) | ||
| 1153 | { | ||
| 1154 | int ret = 0; | ||
| 1155 | |||
| 1156 | do { | ||
| 1157 | if (!ida_pre_get(&hierarchy_ida, GFP_KERNEL)) | ||
| 1158 | return false; | ||
| 1159 | spin_lock(&hierarchy_id_lock); | ||
| 1160 | /* Try to allocate the next unused ID */ | ||
| 1161 | ret = ida_get_new_above(&hierarchy_ida, next_hierarchy_id, | ||
| 1162 | &root->hierarchy_id); | ||
| 1163 | if (ret == -ENOSPC) | ||
| 1164 | /* Try again starting from 0 */ | ||
| 1165 | ret = ida_get_new(&hierarchy_ida, &root->hierarchy_id); | ||
| 1166 | if (!ret) { | ||
| 1167 | next_hierarchy_id = root->hierarchy_id + 1; | ||
| 1168 | } else if (ret != -EAGAIN) { | ||
| 1169 | /* Can only get here if the 31-bit IDR is full ... */ | ||
| 1170 | BUG_ON(ret); | ||
| 1171 | } | ||
| 1172 | spin_unlock(&hierarchy_id_lock); | ||
| 1173 | } while (ret); | ||
| 1174 | return true; | ||
| 1175 | } | ||
| 1176 | |||
| 991 | static int cgroup_test_super(struct super_block *sb, void *data) | 1177 | static int cgroup_test_super(struct super_block *sb, void *data) |
| 992 | { | 1178 | { |
| 993 | struct cgroupfs_root *new = data; | 1179 | struct cgroup_sb_opts *opts = data; |
| 994 | struct cgroupfs_root *root = sb->s_fs_info; | 1180 | struct cgroupfs_root *root = sb->s_fs_info; |
| 995 | 1181 | ||
| 996 | /* First check subsystems */ | 1182 | /* If we asked for a name then it must match */ |
| 997 | if (new->subsys_bits != root->subsys_bits) | 1183 | if (opts->name && strcmp(opts->name, root->name)) |
| 998 | return 0; | 1184 | return 0; |
| 999 | 1185 | ||
| 1000 | /* Next check flags */ | 1186 | /* |
| 1001 | if (new->flags != root->flags) | 1187 | * If we asked for subsystems (or explicitly for no |
| 1188 | * subsystems) then they must match | ||
| 1189 | */ | ||
| 1190 | if ((opts->subsys_bits || opts->none) | ||
| 1191 | && (opts->subsys_bits != root->subsys_bits)) | ||
| 1002 | return 0; | 1192 | return 0; |
| 1003 | 1193 | ||
| 1004 | return 1; | 1194 | return 1; |
| 1005 | } | 1195 | } |
| 1006 | 1196 | ||
| 1197 | static struct cgroupfs_root *cgroup_root_from_opts(struct cgroup_sb_opts *opts) | ||
| 1198 | { | ||
| 1199 | struct cgroupfs_root *root; | ||
| 1200 | |||
| 1201 | if (!opts->subsys_bits && !opts->none) | ||
| 1202 | return NULL; | ||
| 1203 | |||
| 1204 | root = kzalloc(sizeof(*root), GFP_KERNEL); | ||
| 1205 | if (!root) | ||
| 1206 | return ERR_PTR(-ENOMEM); | ||
| 1207 | |||
| 1208 | if (!init_root_id(root)) { | ||
| 1209 | kfree(root); | ||
| 1210 | return ERR_PTR(-ENOMEM); | ||
| 1211 | } | ||
| 1212 | init_cgroup_root(root); | ||
| 1213 | |||
| 1214 | root->subsys_bits = opts->subsys_bits; | ||
| 1215 | root->flags = opts->flags; | ||
| 1216 | if (opts->release_agent) | ||
| 1217 | strcpy(root->release_agent_path, opts->release_agent); | ||
| 1218 | if (opts->name) | ||
| 1219 | strcpy(root->name, opts->name); | ||
| 1220 | return root; | ||
| 1221 | } | ||
| 1222 | |||
| 1223 | static void cgroup_drop_root(struct cgroupfs_root *root) | ||
| 1224 | { | ||
| 1225 | if (!root) | ||
| 1226 | return; | ||
| 1227 | |||
| 1228 | BUG_ON(!root->hierarchy_id); | ||
| 1229 | spin_lock(&hierarchy_id_lock); | ||
| 1230 | ida_remove(&hierarchy_ida, root->hierarchy_id); | ||
| 1231 | spin_unlock(&hierarchy_id_lock); | ||
| 1232 | kfree(root); | ||
| 1233 | } | ||
| 1234 | |||
| 1007 | static int cgroup_set_super(struct super_block *sb, void *data) | 1235 | static int cgroup_set_super(struct super_block *sb, void *data) |
| 1008 | { | 1236 | { |
| 1009 | int ret; | 1237 | int ret; |
| 1010 | struct cgroupfs_root *root = data; | 1238 | struct cgroup_sb_opts *opts = data; |
| 1239 | |||
| 1240 | /* If we don't have a new root, we can't set up a new sb */ | ||
| 1241 | if (!opts->new_root) | ||
| 1242 | return -EINVAL; | ||
| 1243 | |||
| 1244 | BUG_ON(!opts->subsys_bits && !opts->none); | ||
| 1011 | 1245 | ||
| 1012 | ret = set_anon_super(sb, NULL); | 1246 | ret = set_anon_super(sb, NULL); |
| 1013 | if (ret) | 1247 | if (ret) |
| 1014 | return ret; | 1248 | return ret; |
| 1015 | 1249 | ||
| 1016 | sb->s_fs_info = root; | 1250 | sb->s_fs_info = opts->new_root; |
| 1017 | root->sb = sb; | 1251 | opts->new_root->sb = sb; |
| 1018 | 1252 | ||
| 1019 | sb->s_blocksize = PAGE_CACHE_SIZE; | 1253 | sb->s_blocksize = PAGE_CACHE_SIZE; |
| 1020 | sb->s_blocksize_bits = PAGE_CACHE_SHIFT; | 1254 | sb->s_blocksize_bits = PAGE_CACHE_SHIFT; |
| @@ -1051,48 +1285,43 @@ static int cgroup_get_sb(struct file_system_type *fs_type, | |||
| 1051 | void *data, struct vfsmount *mnt) | 1285 | void *data, struct vfsmount *mnt) |
| 1052 | { | 1286 | { |
| 1053 | struct cgroup_sb_opts opts; | 1287 | struct cgroup_sb_opts opts; |
| 1288 | struct cgroupfs_root *root; | ||
| 1054 | int ret = 0; | 1289 | int ret = 0; |
| 1055 | struct super_block *sb; | 1290 | struct super_block *sb; |
| 1056 | struct cgroupfs_root *root; | 1291 | struct cgroupfs_root *new_root; |
| 1057 | struct list_head tmp_cg_links; | ||
| 1058 | 1292 | ||
| 1059 | /* First find the desired set of subsystems */ | 1293 | /* First find the desired set of subsystems */ |
| 1060 | ret = parse_cgroupfs_options(data, &opts); | 1294 | ret = parse_cgroupfs_options(data, &opts); |
| 1061 | if (ret) { | 1295 | if (ret) |
| 1062 | kfree(opts.release_agent); | 1296 | goto out_err; |
| 1063 | return ret; | ||
| 1064 | } | ||
| 1065 | |||
| 1066 | root = kzalloc(sizeof(*root), GFP_KERNEL); | ||
| 1067 | if (!root) { | ||
| 1068 | kfree(opts.release_agent); | ||
| 1069 | return -ENOMEM; | ||
| 1070 | } | ||
| 1071 | 1297 | ||
| 1072 | init_cgroup_root(root); | 1298 | /* |
| 1073 | root->subsys_bits = opts.subsys_bits; | 1299 | * Allocate a new cgroup root. We may not need it if we're |
| 1074 | root->flags = opts.flags; | 1300 | * reusing an existing hierarchy. |
| 1075 | if (opts.release_agent) { | 1301 | */ |
| 1076 | strcpy(root->release_agent_path, opts.release_agent); | 1302 | new_root = cgroup_root_from_opts(&opts); |
| 1077 | kfree(opts.release_agent); | 1303 | if (IS_ERR(new_root)) { |
| 1304 | ret = PTR_ERR(new_root); | ||
| 1305 | goto out_err; | ||
| 1078 | } | 1306 | } |
| 1307 | opts.new_root = new_root; | ||
| 1079 | 1308 | ||
| 1080 | sb = sget(fs_type, cgroup_test_super, cgroup_set_super, root); | 1309 | /* Locate an existing or new sb for this hierarchy */ |
| 1081 | 1310 | sb = sget(fs_type, cgroup_test_super, cgroup_set_super, &opts); | |
| 1082 | if (IS_ERR(sb)) { | 1311 | if (IS_ERR(sb)) { |
| 1083 | kfree(root); | 1312 | ret = PTR_ERR(sb); |
| 1084 | return PTR_ERR(sb); | 1313 | cgroup_drop_root(opts.new_root); |
| 1314 | goto out_err; | ||
| 1085 | } | 1315 | } |
| 1086 | 1316 | ||
| 1087 | if (sb->s_fs_info != root) { | 1317 | root = sb->s_fs_info; |
| 1088 | /* Reusing an existing superblock */ | 1318 | BUG_ON(!root); |
| 1089 | BUG_ON(sb->s_root == NULL); | 1319 | if (root == opts.new_root) { |
| 1090 | kfree(root); | 1320 | /* We used the new root structure, so this is a new hierarchy */ |
| 1091 | root = NULL; | 1321 | struct list_head tmp_cg_links; |
| 1092 | } else { | ||
| 1093 | /* New superblock */ | ||
| 1094 | struct cgroup *root_cgrp = &root->top_cgroup; | 1322 | struct cgroup *root_cgrp = &root->top_cgroup; |
| 1095 | struct inode *inode; | 1323 | struct inode *inode; |
| 1324 | struct cgroupfs_root *existing_root; | ||
| 1096 | int i; | 1325 | int i; |
| 1097 | 1326 | ||
| 1098 | BUG_ON(sb->s_root != NULL); | 1327 | BUG_ON(sb->s_root != NULL); |
| @@ -1105,6 +1334,18 @@ static int cgroup_get_sb(struct file_system_type *fs_type, | |||
| 1105 | mutex_lock(&inode->i_mutex); | 1334 | mutex_lock(&inode->i_mutex); |
| 1106 | mutex_lock(&cgroup_mutex); | 1335 | mutex_lock(&cgroup_mutex); |
| 1107 | 1336 | ||
| 1337 | if (strlen(root->name)) { | ||
| 1338 | /* Check for name clashes with existing mounts */ | ||
| 1339 | for_each_active_root(existing_root) { | ||
| 1340 | if (!strcmp(existing_root->name, root->name)) { | ||
| 1341 | ret = -EBUSY; | ||
| 1342 | mutex_unlock(&cgroup_mutex); | ||
| 1343 | mutex_unlock(&inode->i_mutex); | ||
| 1344 | goto drop_new_super; | ||
| 1345 | } | ||
| 1346 | } | ||
| 1347 | } | ||
| 1348 | |||
| 1108 | /* | 1349 | /* |
| 1109 | * We're accessing css_set_count without locking | 1350 | * We're accessing css_set_count without locking |
| 1110 | * css_set_lock here, but that's OK - it can only be | 1351 | * css_set_lock here, but that's OK - it can only be |
| @@ -1123,7 +1364,8 @@ static int cgroup_get_sb(struct file_system_type *fs_type, | |||
| 1123 | if (ret == -EBUSY) { | 1364 | if (ret == -EBUSY) { |
| 1124 | mutex_unlock(&cgroup_mutex); | 1365 | mutex_unlock(&cgroup_mutex); |
| 1125 | mutex_unlock(&inode->i_mutex); | 1366 | mutex_unlock(&inode->i_mutex); |
| 1126 | goto free_cg_links; | 1367 | free_cg_links(&tmp_cg_links); |
| 1368 | goto drop_new_super; | ||
| 1127 | } | 1369 | } |
| 1128 | 1370 | ||
| 1129 | /* EBUSY should be the only error here */ | 1371 | /* EBUSY should be the only error here */ |
| @@ -1155,17 +1397,27 @@ static int cgroup_get_sb(struct file_system_type *fs_type, | |||
| 1155 | BUG_ON(root->number_of_cgroups != 1); | 1397 | BUG_ON(root->number_of_cgroups != 1); |
| 1156 | 1398 | ||
| 1157 | cgroup_populate_dir(root_cgrp); | 1399 | cgroup_populate_dir(root_cgrp); |
| 1158 | mutex_unlock(&inode->i_mutex); | ||
| 1159 | mutex_unlock(&cgroup_mutex); | 1400 | mutex_unlock(&cgroup_mutex); |
| 1401 | mutex_unlock(&inode->i_mutex); | ||
| 1402 | } else { | ||
| 1403 | /* | ||
| 1404 | * We re-used an existing hierarchy - the new root (if | ||
| 1405 | * any) is not needed | ||
| 1406 | */ | ||
| 1407 | cgroup_drop_root(opts.new_root); | ||
| 1160 | } | 1408 | } |
| 1161 | 1409 | ||
| 1162 | simple_set_mnt(mnt, sb); | 1410 | simple_set_mnt(mnt, sb); |
| 1411 | kfree(opts.release_agent); | ||
| 1412 | kfree(opts.name); | ||
| 1163 | return 0; | 1413 | return 0; |
| 1164 | 1414 | ||
| 1165 | free_cg_links: | ||
| 1166 | free_cg_links(&tmp_cg_links); | ||
| 1167 | drop_new_super: | 1415 | drop_new_super: |
| 1168 | deactivate_locked_super(sb); | 1416 | deactivate_locked_super(sb); |
| 1417 | out_err: | ||
| 1418 | kfree(opts.release_agent); | ||
| 1419 | kfree(opts.name); | ||
| 1420 | |||
| 1169 | return ret; | 1421 | return ret; |
| 1170 | } | 1422 | } |
| 1171 | 1423 | ||
| @@ -1211,7 +1463,7 @@ static void cgroup_kill_sb(struct super_block *sb) { | |||
| 1211 | mutex_unlock(&cgroup_mutex); | 1463 | mutex_unlock(&cgroup_mutex); |
| 1212 | 1464 | ||
| 1213 | kill_litter_super(sb); | 1465 | kill_litter_super(sb); |
| 1214 | kfree(root); | 1466 | cgroup_drop_root(root); |
| 1215 | } | 1467 | } |
| 1216 | 1468 | ||
| 1217 | static struct file_system_type cgroup_fs_type = { | 1469 | static struct file_system_type cgroup_fs_type = { |
| @@ -1276,27 +1528,6 @@ int cgroup_path(const struct cgroup *cgrp, char *buf, int buflen) | |||
| 1276 | return 0; | 1528 | return 0; |
| 1277 | } | 1529 | } |
| 1278 | 1530 | ||
| 1279 | /* | ||
| 1280 | * Return the first subsystem attached to a cgroup's hierarchy, and | ||
| 1281 | * its subsystem id. | ||
| 1282 | */ | ||
| 1283 | |||
| 1284 | static void get_first_subsys(const struct cgroup *cgrp, | ||
| 1285 | struct cgroup_subsys_state **css, int *subsys_id) | ||
| 1286 | { | ||
| 1287 | const struct cgroupfs_root *root = cgrp->root; | ||
| 1288 | const struct cgroup_subsys *test_ss; | ||
| 1289 | BUG_ON(list_empty(&root->subsys_list)); | ||
| 1290 | test_ss = list_entry(root->subsys_list.next, | ||
| 1291 | struct cgroup_subsys, sibling); | ||
| 1292 | if (css) { | ||
| 1293 | *css = cgrp->subsys[test_ss->subsys_id]; | ||
| 1294 | BUG_ON(!*css); | ||
| 1295 | } | ||
| 1296 | if (subsys_id) | ||
| 1297 | *subsys_id = test_ss->subsys_id; | ||
| 1298 | } | ||
| 1299 | |||
| 1300 | /** | 1531 | /** |
| 1301 | * cgroup_attach_task - attach task 'tsk' to cgroup 'cgrp' | 1532 | * cgroup_attach_task - attach task 'tsk' to cgroup 'cgrp' |
| 1302 | * @cgrp: the cgroup the task is attaching to | 1533 | * @cgrp: the cgroup the task is attaching to |
| @@ -1313,18 +1544,15 @@ int cgroup_attach_task(struct cgroup *cgrp, struct task_struct *tsk) | |||
| 1313 | struct css_set *cg; | 1544 | struct css_set *cg; |
| 1314 | struct css_set *newcg; | 1545 | struct css_set *newcg; |
| 1315 | struct cgroupfs_root *root = cgrp->root; | 1546 | struct cgroupfs_root *root = cgrp->root; |
| 1316 | int subsys_id; | ||
| 1317 | |||
| 1318 | get_first_subsys(cgrp, NULL, &subsys_id); | ||
| 1319 | 1547 | ||
| 1320 | /* Nothing to do if the task is already in that cgroup */ | 1548 | /* Nothing to do if the task is already in that cgroup */ |
| 1321 | oldcgrp = task_cgroup(tsk, subsys_id); | 1549 | oldcgrp = task_cgroup_from_root(tsk, root); |
| 1322 | if (cgrp == oldcgrp) | 1550 | if (cgrp == oldcgrp) |
| 1323 | return 0; | 1551 | return 0; |
| 1324 | 1552 | ||
| 1325 | for_each_subsys(root, ss) { | 1553 | for_each_subsys(root, ss) { |
| 1326 | if (ss->can_attach) { | 1554 | if (ss->can_attach) { |
| 1327 | retval = ss->can_attach(ss, cgrp, tsk); | 1555 | retval = ss->can_attach(ss, cgrp, tsk, false); |
| 1328 | if (retval) | 1556 | if (retval) |
| 1329 | return retval; | 1557 | return retval; |
| 1330 | } | 1558 | } |
| @@ -1362,7 +1590,7 @@ int cgroup_attach_task(struct cgroup *cgrp, struct task_struct *tsk) | |||
| 1362 | 1590 | ||
| 1363 | for_each_subsys(root, ss) { | 1591 | for_each_subsys(root, ss) { |
| 1364 | if (ss->attach) | 1592 | if (ss->attach) |
| 1365 | ss->attach(ss, cgrp, oldcgrp, tsk); | 1593 | ss->attach(ss, cgrp, oldcgrp, tsk, false); |
| 1366 | } | 1594 | } |
| 1367 | set_bit(CGRP_RELEASABLE, &oldcgrp->flags); | 1595 | set_bit(CGRP_RELEASABLE, &oldcgrp->flags); |
| 1368 | synchronize_rcu(); | 1596 | synchronize_rcu(); |
| @@ -1423,15 +1651,6 @@ static int cgroup_tasks_write(struct cgroup *cgrp, struct cftype *cft, u64 pid) | |||
| 1423 | return ret; | 1651 | return ret; |
| 1424 | } | 1652 | } |
| 1425 | 1653 | ||
| 1426 | /* The various types of files and directories in a cgroup file system */ | ||
| 1427 | enum cgroup_filetype { | ||
| 1428 | FILE_ROOT, | ||
| 1429 | FILE_DIR, | ||
| 1430 | FILE_TASKLIST, | ||
| 1431 | FILE_NOTIFY_ON_RELEASE, | ||
| 1432 | FILE_RELEASE_AGENT, | ||
| 1433 | }; | ||
| 1434 | |||
| 1435 | /** | 1654 | /** |
| 1436 | * cgroup_lock_live_group - take cgroup_mutex and check that cgrp is alive. | 1655 | * cgroup_lock_live_group - take cgroup_mutex and check that cgrp is alive. |
| 1437 | * @cgrp: the cgroup to be checked for liveness | 1656 | * @cgrp: the cgroup to be checked for liveness |
| @@ -1644,7 +1863,7 @@ static int cgroup_seqfile_release(struct inode *inode, struct file *file) | |||
| 1644 | return single_release(inode, file); | 1863 | return single_release(inode, file); |
| 1645 | } | 1864 | } |
| 1646 | 1865 | ||
| 1647 | static struct file_operations cgroup_seqfile_operations = { | 1866 | static const struct file_operations cgroup_seqfile_operations = { |
| 1648 | .read = seq_read, | 1867 | .read = seq_read, |
| 1649 | .write = cgroup_file_write, | 1868 | .write = cgroup_file_write, |
| 1650 | .llseek = seq_lseek, | 1869 | .llseek = seq_lseek, |
| @@ -1703,7 +1922,7 @@ static int cgroup_rename(struct inode *old_dir, struct dentry *old_dentry, | |||
| 1703 | return simple_rename(old_dir, old_dentry, new_dir, new_dentry); | 1922 | return simple_rename(old_dir, old_dentry, new_dir, new_dentry); |
| 1704 | } | 1923 | } |
| 1705 | 1924 | ||
| 1706 | static struct file_operations cgroup_file_operations = { | 1925 | static const struct file_operations cgroup_file_operations = { |
| 1707 | .read = cgroup_file_read, | 1926 | .read = cgroup_file_read, |
| 1708 | .write = cgroup_file_write, | 1927 | .write = cgroup_file_write, |
| 1709 | .llseek = generic_file_llseek, | 1928 | .llseek = generic_file_llseek, |
| @@ -1876,7 +2095,7 @@ int cgroup_task_count(const struct cgroup *cgrp) | |||
| 1876 | * the start of a css_set | 2095 | * the start of a css_set |
| 1877 | */ | 2096 | */ |
| 1878 | static void cgroup_advance_iter(struct cgroup *cgrp, | 2097 | static void cgroup_advance_iter(struct cgroup *cgrp, |
| 1879 | struct cgroup_iter *it) | 2098 | struct cgroup_iter *it) |
| 1880 | { | 2099 | { |
| 1881 | struct list_head *l = it->cg_link; | 2100 | struct list_head *l = it->cg_link; |
| 1882 | struct cg_cgroup_link *link; | 2101 | struct cg_cgroup_link *link; |
| @@ -2129,7 +2348,7 @@ int cgroup_scan_tasks(struct cgroup_scanner *scan) | |||
| 2129 | } | 2348 | } |
| 2130 | 2349 | ||
| 2131 | /* | 2350 | /* |
| 2132 | * Stuff for reading the 'tasks' file. | 2351 | * Stuff for reading the 'tasks'/'procs' files. |
| 2133 | * | 2352 | * |
| 2134 | * Reading this file can return large amounts of data if a cgroup has | 2353 | * Reading this file can return large amounts of data if a cgroup has |
| 2135 | * *lots* of attached tasks. So it may need several calls to read(), | 2354 | * *lots* of attached tasks. So it may need several calls to read(), |
| @@ -2139,27 +2358,196 @@ int cgroup_scan_tasks(struct cgroup_scanner *scan) | |||
| 2139 | */ | 2358 | */ |
| 2140 | 2359 | ||
| 2141 | /* | 2360 | /* |
| 2142 | * Load into 'pidarray' up to 'npids' of the tasks using cgroup | 2361 | * The following two functions "fix" the issue where there are more pids |
| 2143 | * 'cgrp'. Return actual number of pids loaded. No need to | 2362 | * than kmalloc will give memory for; in such cases, we use vmalloc/vfree. |
| 2144 | * task_lock(p) when reading out p->cgroup, since we're in an RCU | 2363 | * TODO: replace with a kernel-wide solution to this problem |
| 2145 | * read section, so the css_set can't go away, and is | 2364 | */ |
| 2146 | * immutable after creation. | 2365 | #define PIDLIST_TOO_LARGE(c) ((c) * sizeof(pid_t) > (PAGE_SIZE * 2)) |
| 2366 | static void *pidlist_allocate(int count) | ||
| 2367 | { | ||
| 2368 | if (PIDLIST_TOO_LARGE(count)) | ||
| 2369 | return vmalloc(count * sizeof(pid_t)); | ||
| 2370 | else | ||
| 2371 | return kmalloc(count * sizeof(pid_t), GFP_KERNEL); | ||
| 2372 | } | ||
| 2373 | static void pidlist_free(void *p) | ||
| 2374 | { | ||
| 2375 | if (is_vmalloc_addr(p)) | ||
| 2376 | vfree(p); | ||
| 2377 | else | ||
| 2378 | kfree(p); | ||
| 2379 | } | ||
| 2380 | static void *pidlist_resize(void *p, int newcount) | ||
| 2381 | { | ||
| 2382 | void *newlist; | ||
| 2383 | /* note: if new alloc fails, old p will still be valid either way */ | ||
| 2384 | if (is_vmalloc_addr(p)) { | ||
| 2385 | newlist = vmalloc(newcount * sizeof(pid_t)); | ||
| 2386 | if (!newlist) | ||
| 2387 | return NULL; | ||
| 2388 | memcpy(newlist, p, newcount * sizeof(pid_t)); | ||
| 2389 | vfree(p); | ||
| 2390 | } else { | ||
| 2391 | newlist = krealloc(p, newcount * sizeof(pid_t), GFP_KERNEL); | ||
| 2392 | } | ||
| 2393 | return newlist; | ||
| 2394 | } | ||
| 2395 | |||
| 2396 | /* | ||
| 2397 | * pidlist_uniq - given a kmalloc()ed list, strip out all duplicate entries | ||
| 2398 | * If the new stripped list is sufficiently smaller and there's enough memory | ||
| 2399 | * to allocate a new buffer, will let go of the unneeded memory. Returns the | ||
| 2400 | * number of unique elements. | ||
| 2401 | */ | ||
| 2402 | /* is the size difference enough that we should re-allocate the array? */ | ||
| 2403 | #define PIDLIST_REALLOC_DIFFERENCE(old, new) ((old) - PAGE_SIZE >= (new)) | ||
| 2404 | static int pidlist_uniq(pid_t **p, int length) | ||
| 2405 | { | ||
| 2406 | int src, dest = 1; | ||
| 2407 | pid_t *list = *p; | ||
| 2408 | pid_t *newlist; | ||
| 2409 | |||
| 2410 | /* | ||
| 2411 | * we presume the 0th element is unique, so i starts at 1. trivial | ||
| 2412 | * edge cases first; no work needs to be done for either | ||
| 2413 | */ | ||
| 2414 | if (length == 0 || length == 1) | ||
| 2415 | return length; | ||
| 2416 | /* src and dest walk down the list; dest counts unique elements */ | ||
| 2417 | for (src = 1; src < length; src++) { | ||
| 2418 | /* find next unique element */ | ||
| 2419 | while (list[src] == list[src-1]) { | ||
| 2420 | src++; | ||
| 2421 | if (src == length) | ||
| 2422 | goto after; | ||
| 2423 | } | ||
| 2424 | /* dest always points to where the next unique element goes */ | ||
| 2425 | list[dest] = list[src]; | ||
| 2426 | dest++; | ||
| 2427 | } | ||
| 2428 | after: | ||
| 2429 | /* | ||
| 2430 | * if the length difference is large enough, we want to allocate a | ||
| 2431 | * smaller buffer to save memory. if this fails due to out of memory, | ||
| 2432 | * we'll just stay with what we've got. | ||
| 2433 | */ | ||
| 2434 | if (PIDLIST_REALLOC_DIFFERENCE(length, dest)) { | ||
| 2435 | newlist = pidlist_resize(list, dest); | ||
| 2436 | if (newlist) | ||
| 2437 | *p = newlist; | ||
| 2438 | } | ||
| 2439 | return dest; | ||
| 2440 | } | ||
| 2441 | |||
| 2442 | static int cmppid(const void *a, const void *b) | ||
| 2443 | { | ||
| 2444 | return *(pid_t *)a - *(pid_t *)b; | ||
| 2445 | } | ||
| 2446 | |||
| 2447 | /* | ||
| 2448 | * find the appropriate pidlist for our purpose (given procs vs tasks) | ||
| 2449 | * returns with the lock on that pidlist already held, and takes care | ||
| 2450 | * of the use count, or returns NULL with no locks held if we're out of | ||
| 2451 | * memory. | ||
| 2147 | */ | 2452 | */ |
| 2148 | static int pid_array_load(pid_t *pidarray, int npids, struct cgroup *cgrp) | 2453 | static struct cgroup_pidlist *cgroup_pidlist_find(struct cgroup *cgrp, |
| 2454 | enum cgroup_filetype type) | ||
| 2149 | { | 2455 | { |
| 2150 | int n = 0, pid; | 2456 | struct cgroup_pidlist *l; |
| 2457 | /* don't need task_nsproxy() if we're looking at ourself */ | ||
| 2458 | struct pid_namespace *ns = get_pid_ns(current->nsproxy->pid_ns); | ||
| 2459 | /* | ||
| 2460 | * We can't drop the pidlist_mutex before taking the l->mutex in case | ||
| 2461 | * the last ref-holder is trying to remove l from the list at the same | ||
| 2462 | * time. Holding the pidlist_mutex precludes somebody taking whichever | ||
| 2463 | * list we find out from under us - compare release_pid_array(). | ||
| 2464 | */ | ||
| 2465 | mutex_lock(&cgrp->pidlist_mutex); | ||
| 2466 | list_for_each_entry(l, &cgrp->pidlists, links) { | ||
| 2467 | if (l->key.type == type && l->key.ns == ns) { | ||
| 2468 | /* found a matching list - drop the extra refcount */ | ||
| 2469 | put_pid_ns(ns); | ||
| 2470 | /* make sure l doesn't vanish out from under us */ | ||
| 2471 | down_write(&l->mutex); | ||
| 2472 | mutex_unlock(&cgrp->pidlist_mutex); | ||
| 2473 | l->use_count++; | ||
| 2474 | return l; | ||
| 2475 | } | ||
| 2476 | } | ||
| 2477 | /* entry not found; create a new one */ | ||
| 2478 | l = kmalloc(sizeof(struct cgroup_pidlist), GFP_KERNEL); | ||
| 2479 | if (!l) { | ||
| 2480 | mutex_unlock(&cgrp->pidlist_mutex); | ||
| 2481 | put_pid_ns(ns); | ||
| 2482 | return l; | ||
| 2483 | } | ||
| 2484 | init_rwsem(&l->mutex); | ||
| 2485 | down_write(&l->mutex); | ||
| 2486 | l->key.type = type; | ||
| 2487 | l->key.ns = ns; | ||
| 2488 | l->use_count = 0; /* don't increment here */ | ||
| 2489 | l->list = NULL; | ||
| 2490 | l->owner = cgrp; | ||
| 2491 | list_add(&l->links, &cgrp->pidlists); | ||
| 2492 | mutex_unlock(&cgrp->pidlist_mutex); | ||
| 2493 | return l; | ||
| 2494 | } | ||
| 2495 | |||
| 2496 | /* | ||
| 2497 | * Load a cgroup's pidarray with either procs' tgids or tasks' pids | ||
| 2498 | */ | ||
| 2499 | static int pidlist_array_load(struct cgroup *cgrp, enum cgroup_filetype type, | ||
| 2500 | struct cgroup_pidlist **lp) | ||
| 2501 | { | ||
| 2502 | pid_t *array; | ||
| 2503 | int length; | ||
| 2504 | int pid, n = 0; /* used for populating the array */ | ||
| 2151 | struct cgroup_iter it; | 2505 | struct cgroup_iter it; |
| 2152 | struct task_struct *tsk; | 2506 | struct task_struct *tsk; |
| 2507 | struct cgroup_pidlist *l; | ||
| 2508 | |||
| 2509 | /* | ||
| 2510 | * If cgroup gets more users after we read count, we won't have | ||
| 2511 | * enough space - tough. This race is indistinguishable to the | ||
| 2512 | * caller from the case that the additional cgroup users didn't | ||
| 2513 | * show up until sometime later on. | ||
| 2514 | */ | ||
| 2515 | length = cgroup_task_count(cgrp); | ||
| 2516 | array = pidlist_allocate(length); | ||
| 2517 | if (!array) | ||
| 2518 | return -ENOMEM; | ||
| 2519 | /* now, populate the array */ | ||
| 2153 | cgroup_iter_start(cgrp, &it); | 2520 | cgroup_iter_start(cgrp, &it); |
| 2154 | while ((tsk = cgroup_iter_next(cgrp, &it))) { | 2521 | while ((tsk = cgroup_iter_next(cgrp, &it))) { |
| 2155 | if (unlikely(n == npids)) | 2522 | if (unlikely(n == length)) |
| 2156 | break; | 2523 | break; |
| 2157 | pid = task_pid_vnr(tsk); | 2524 | /* get tgid or pid for procs or tasks file respectively */ |
| 2158 | if (pid > 0) | 2525 | if (type == CGROUP_FILE_PROCS) |
| 2159 | pidarray[n++] = pid; | 2526 | pid = task_tgid_vnr(tsk); |
| 2527 | else | ||
| 2528 | pid = task_pid_vnr(tsk); | ||
| 2529 | if (pid > 0) /* make sure to only use valid results */ | ||
| 2530 | array[n++] = pid; | ||
| 2160 | } | 2531 | } |
| 2161 | cgroup_iter_end(cgrp, &it); | 2532 | cgroup_iter_end(cgrp, &it); |
| 2162 | return n; | 2533 | length = n; |
| 2534 | /* now sort & (if procs) strip out duplicates */ | ||
| 2535 | sort(array, length, sizeof(pid_t), cmppid, NULL); | ||
| 2536 | if (type == CGROUP_FILE_PROCS) | ||
| 2537 | length = pidlist_uniq(&array, length); | ||
| 2538 | l = cgroup_pidlist_find(cgrp, type); | ||
| 2539 | if (!l) { | ||
| 2540 | pidlist_free(array); | ||
| 2541 | return -ENOMEM; | ||
| 2542 | } | ||
| 2543 | /* store array, freeing old if necessary - lock already held */ | ||
| 2544 | pidlist_free(l->list); | ||
| 2545 | l->list = array; | ||
| 2546 | l->length = length; | ||
| 2547 | l->use_count++; | ||
| 2548 | up_write(&l->mutex); | ||
| 2549 | *lp = l; | ||
| 2550 | return 0; | ||
| 2163 | } | 2551 | } |
| 2164 | 2552 | ||
| 2165 | /** | 2553 | /** |
| @@ -2216,37 +2604,14 @@ err: | |||
| 2216 | return ret; | 2604 | return ret; |
| 2217 | } | 2605 | } |
| 2218 | 2606 | ||
| 2219 | /* | ||
| 2220 | * Cache pids for all threads in the same pid namespace that are | ||
| 2221 | * opening the same "tasks" file. | ||
| 2222 | */ | ||
| 2223 | struct cgroup_pids { | ||
| 2224 | /* The node in cgrp->pids_list */ | ||
| 2225 | struct list_head list; | ||
| 2226 | /* The cgroup those pids belong to */ | ||
| 2227 | struct cgroup *cgrp; | ||
| 2228 | /* The namepsace those pids belong to */ | ||
| 2229 | struct pid_namespace *ns; | ||
| 2230 | /* Array of process ids in the cgroup */ | ||
| 2231 | pid_t *tasks_pids; | ||
| 2232 | /* How many files are using the this tasks_pids array */ | ||
| 2233 | int use_count; | ||
| 2234 | /* Length of the current tasks_pids array */ | ||
| 2235 | int length; | ||
| 2236 | }; | ||
| 2237 | |||
| 2238 | static int cmppid(const void *a, const void *b) | ||
| 2239 | { | ||
| 2240 | return *(pid_t *)a - *(pid_t *)b; | ||
| 2241 | } | ||
| 2242 | 2607 | ||
| 2243 | /* | 2608 | /* |
| 2244 | * seq_file methods for the "tasks" file. The seq_file position is the | 2609 | * seq_file methods for the tasks/procs files. The seq_file position is the |
| 2245 | * next pid to display; the seq_file iterator is a pointer to the pid | 2610 | * next pid to display; the seq_file iterator is a pointer to the pid |
| 2246 | * in the cgroup->tasks_pids array. | 2611 | * in the cgroup->l->list array. |
| 2247 | */ | 2612 | */ |
| 2248 | 2613 | ||
| 2249 | static void *cgroup_tasks_start(struct seq_file *s, loff_t *pos) | 2614 | static void *cgroup_pidlist_start(struct seq_file *s, loff_t *pos) |
| 2250 | { | 2615 | { |
| 2251 | /* | 2616 | /* |
| 2252 | * Initially we receive a position value that corresponds to | 2617 | * Initially we receive a position value that corresponds to |
| @@ -2254,48 +2619,45 @@ static void *cgroup_tasks_start(struct seq_file *s, loff_t *pos) | |||
| 2254 | * after a seek to the start). Use a binary-search to find the | 2619 | * after a seek to the start). Use a binary-search to find the |
| 2255 | * next pid to display, if any | 2620 | * next pid to display, if any |
| 2256 | */ | 2621 | */ |
| 2257 | struct cgroup_pids *cp = s->private; | 2622 | struct cgroup_pidlist *l = s->private; |
| 2258 | struct cgroup *cgrp = cp->cgrp; | ||
| 2259 | int index = 0, pid = *pos; | 2623 | int index = 0, pid = *pos; |
| 2260 | int *iter; | 2624 | int *iter; |
| 2261 | 2625 | ||
| 2262 | down_read(&cgrp->pids_mutex); | 2626 | down_read(&l->mutex); |
| 2263 | if (pid) { | 2627 | if (pid) { |
| 2264 | int end = cp->length; | 2628 | int end = l->length; |
| 2265 | 2629 | ||
| 2266 | while (index < end) { | 2630 | while (index < end) { |
| 2267 | int mid = (index + end) / 2; | 2631 | int mid = (index + end) / 2; |
| 2268 | if (cp->tasks_pids[mid] == pid) { | 2632 | if (l->list[mid] == pid) { |
| 2269 | index = mid; | 2633 | index = mid; |
| 2270 | break; | 2634 | break; |
| 2271 | } else if (cp->tasks_pids[mid] <= pid) | 2635 | } else if (l->list[mid] <= pid) |
| 2272 | index = mid + 1; | 2636 | index = mid + 1; |
| 2273 | else | 2637 | else |
| 2274 | end = mid; | 2638 | end = mid; |
| 2275 | } | 2639 | } |
| 2276 | } | 2640 | } |
| 2277 | /* If we're off the end of the array, we're done */ | 2641 | /* If we're off the end of the array, we're done */ |
| 2278 | if (index >= cp->length) | 2642 | if (index >= l->length) |
| 2279 | return NULL; | 2643 | return NULL; |
| 2280 | /* Update the abstract position to be the actual pid that we found */ | 2644 | /* Update the abstract position to be the actual pid that we found */ |
| 2281 | iter = cp->tasks_pids + index; | 2645 | iter = l->list + index; |
| 2282 | *pos = *iter; | 2646 | *pos = *iter; |
| 2283 | return iter; | 2647 | return iter; |
| 2284 | } | 2648 | } |
| 2285 | 2649 | ||
| 2286 | static void cgroup_tasks_stop(struct seq_file *s, void *v) | 2650 | static void cgroup_pidlist_stop(struct seq_file *s, void *v) |
| 2287 | { | 2651 | { |
| 2288 | struct cgroup_pids *cp = s->private; | 2652 | struct cgroup_pidlist *l = s->private; |
| 2289 | struct cgroup *cgrp = cp->cgrp; | 2653 | up_read(&l->mutex); |
| 2290 | up_read(&cgrp->pids_mutex); | ||
| 2291 | } | 2654 | } |
| 2292 | 2655 | ||
| 2293 | static void *cgroup_tasks_next(struct seq_file *s, void *v, loff_t *pos) | 2656 | static void *cgroup_pidlist_next(struct seq_file *s, void *v, loff_t *pos) |
| 2294 | { | 2657 | { |
| 2295 | struct cgroup_pids *cp = s->private; | 2658 | struct cgroup_pidlist *l = s->private; |
| 2296 | int *p = v; | 2659 | pid_t *p = v; |
| 2297 | int *end = cp->tasks_pids + cp->length; | 2660 | pid_t *end = l->list + l->length; |
| 2298 | |||
| 2299 | /* | 2661 | /* |
| 2300 | * Advance to the next pid in the array. If this goes off the | 2662 | * Advance to the next pid in the array. If this goes off the |
| 2301 | * end, we're done | 2663 | * end, we're done |
| @@ -2309,124 +2671,107 @@ static void *cgroup_tasks_next(struct seq_file *s, void *v, loff_t *pos) | |||
| 2309 | } | 2671 | } |
| 2310 | } | 2672 | } |
| 2311 | 2673 | ||
| 2312 | static int cgroup_tasks_show(struct seq_file *s, void *v) | 2674 | static int cgroup_pidlist_show(struct seq_file *s, void *v) |
| 2313 | { | 2675 | { |
| 2314 | return seq_printf(s, "%d\n", *(int *)v); | 2676 | return seq_printf(s, "%d\n", *(int *)v); |
| 2315 | } | 2677 | } |
| 2316 | 2678 | ||
| 2317 | static struct seq_operations cgroup_tasks_seq_operations = { | 2679 | /* |
| 2318 | .start = cgroup_tasks_start, | 2680 | * seq_operations functions for iterating on pidlists through seq_file - |
| 2319 | .stop = cgroup_tasks_stop, | 2681 | * independent of whether it's tasks or procs |
| 2320 | .next = cgroup_tasks_next, | 2682 | */ |
| 2321 | .show = cgroup_tasks_show, | 2683 | static const struct seq_operations cgroup_pidlist_seq_operations = { |
| 2684 | .start = cgroup_pidlist_start, | ||
| 2685 | .stop = cgroup_pidlist_stop, | ||
| 2686 | .next = cgroup_pidlist_next, | ||
| 2687 | .show = cgroup_pidlist_show, | ||
| 2322 | }; | 2688 | }; |
| 2323 | 2689 | ||
| 2324 | static void release_cgroup_pid_array(struct cgroup_pids *cp) | 2690 | static void cgroup_release_pid_array(struct cgroup_pidlist *l) |
| 2325 | { | 2691 | { |
| 2326 | struct cgroup *cgrp = cp->cgrp; | 2692 | /* |
| 2327 | 2693 | * the case where we're the last user of this particular pidlist will | |
| 2328 | down_write(&cgrp->pids_mutex); | 2694 | * have us remove it from the cgroup's list, which entails taking the |
| 2329 | BUG_ON(!cp->use_count); | 2695 | * mutex. since in pidlist_find the pidlist->lock depends on cgroup-> |
| 2330 | if (!--cp->use_count) { | 2696 | * pidlist_mutex, we have to take pidlist_mutex first. |
| 2331 | list_del(&cp->list); | 2697 | */ |
| 2332 | put_pid_ns(cp->ns); | 2698 | mutex_lock(&l->owner->pidlist_mutex); |
| 2333 | kfree(cp->tasks_pids); | 2699 | down_write(&l->mutex); |
| 2334 | kfree(cp); | 2700 | BUG_ON(!l->use_count); |
| 2701 | if (!--l->use_count) { | ||
| 2702 | /* we're the last user if refcount is 0; remove and free */ | ||
| 2703 | list_del(&l->links); | ||
| 2704 | mutex_unlock(&l->owner->pidlist_mutex); | ||
| 2705 | pidlist_free(l->list); | ||
| 2706 | put_pid_ns(l->key.ns); | ||
| 2707 | up_write(&l->mutex); | ||
| 2708 | kfree(l); | ||
| 2709 | return; | ||
| 2335 | } | 2710 | } |
| 2336 | up_write(&cgrp->pids_mutex); | 2711 | mutex_unlock(&l->owner->pidlist_mutex); |
| 2712 | up_write(&l->mutex); | ||
| 2337 | } | 2713 | } |
| 2338 | 2714 | ||
| 2339 | static int cgroup_tasks_release(struct inode *inode, struct file *file) | 2715 | static int cgroup_pidlist_release(struct inode *inode, struct file *file) |
| 2340 | { | 2716 | { |
| 2341 | struct seq_file *seq; | 2717 | struct cgroup_pidlist *l; |
| 2342 | struct cgroup_pids *cp; | ||
| 2343 | |||
| 2344 | if (!(file->f_mode & FMODE_READ)) | 2718 | if (!(file->f_mode & FMODE_READ)) |
| 2345 | return 0; | 2719 | return 0; |
| 2346 | 2720 | /* | |
| 2347 | seq = file->private_data; | 2721 | * the seq_file will only be initialized if the file was opened for |
| 2348 | cp = seq->private; | 2722 | * reading; hence we check if it's not null only in that case. |
| 2349 | 2723 | */ | |
| 2350 | release_cgroup_pid_array(cp); | 2724 | l = ((struct seq_file *)file->private_data)->private; |
| 2725 | cgroup_release_pid_array(l); | ||
| 2351 | return seq_release(inode, file); | 2726 | return seq_release(inode, file); |
| 2352 | } | 2727 | } |
| 2353 | 2728 | ||
| 2354 | static struct file_operations cgroup_tasks_operations = { | 2729 | static const struct file_operations cgroup_pidlist_operations = { |
| 2355 | .read = seq_read, | 2730 | .read = seq_read, |
| 2356 | .llseek = seq_lseek, | 2731 | .llseek = seq_lseek, |
| 2357 | .write = cgroup_file_write, | 2732 | .write = cgroup_file_write, |
| 2358 | .release = cgroup_tasks_release, | 2733 | .release = cgroup_pidlist_release, |
| 2359 | }; | 2734 | }; |
| 2360 | 2735 | ||
| 2361 | /* | 2736 | /* |
| 2362 | * Handle an open on 'tasks' file. Prepare an array containing the | 2737 | * The following functions handle opens on a file that displays a pidlist |
| 2363 | * process id's of tasks currently attached to the cgroup being opened. | 2738 | * (tasks or procs). Prepare an array of the process/thread IDs of whoever's |
| 2739 | * in the cgroup. | ||
| 2364 | */ | 2740 | */ |
| 2365 | 2741 | /* helper function for the two below it */ | |
| 2366 | static int cgroup_tasks_open(struct inode *unused, struct file *file) | 2742 | static int cgroup_pidlist_open(struct file *file, enum cgroup_filetype type) |
| 2367 | { | 2743 | { |
| 2368 | struct cgroup *cgrp = __d_cgrp(file->f_dentry->d_parent); | 2744 | struct cgroup *cgrp = __d_cgrp(file->f_dentry->d_parent); |
| 2369 | struct pid_namespace *ns = current->nsproxy->pid_ns; | 2745 | struct cgroup_pidlist *l; |
| 2370 | struct cgroup_pids *cp; | ||
| 2371 | pid_t *pidarray; | ||
| 2372 | int npids; | ||
| 2373 | int retval; | 2746 | int retval; |
| 2374 | 2747 | ||
| 2375 | /* Nothing to do for write-only files */ | 2748 | /* Nothing to do for write-only files */ |
| 2376 | if (!(file->f_mode & FMODE_READ)) | 2749 | if (!(file->f_mode & FMODE_READ)) |
| 2377 | return 0; | 2750 | return 0; |
| 2378 | 2751 | ||
| 2379 | /* | 2752 | /* have the array populated */ |
| 2380 | * If cgroup gets more users after we read count, we won't have | 2753 | retval = pidlist_array_load(cgrp, type, &l); |
| 2381 | * enough space - tough. This race is indistinguishable to the | 2754 | if (retval) |
| 2382 | * caller from the case that the additional cgroup users didn't | 2755 | return retval; |
| 2383 | * show up until sometime later on. | 2756 | /* configure file information */ |
| 2384 | */ | 2757 | file->f_op = &cgroup_pidlist_operations; |
| 2385 | npids = cgroup_task_count(cgrp); | ||
| 2386 | pidarray = kmalloc(npids * sizeof(pid_t), GFP_KERNEL); | ||
| 2387 | if (!pidarray) | ||
| 2388 | return -ENOMEM; | ||
| 2389 | npids = pid_array_load(pidarray, npids, cgrp); | ||
| 2390 | sort(pidarray, npids, sizeof(pid_t), cmppid, NULL); | ||
| 2391 | |||
| 2392 | /* | ||
| 2393 | * Store the array in the cgroup, freeing the old | ||
| 2394 | * array if necessary | ||
| 2395 | */ | ||
| 2396 | down_write(&cgrp->pids_mutex); | ||
| 2397 | |||
| 2398 | list_for_each_entry(cp, &cgrp->pids_list, list) { | ||
| 2399 | if (ns == cp->ns) | ||
| 2400 | goto found; | ||
| 2401 | } | ||
| 2402 | |||
| 2403 | cp = kzalloc(sizeof(*cp), GFP_KERNEL); | ||
| 2404 | if (!cp) { | ||
| 2405 | up_write(&cgrp->pids_mutex); | ||
| 2406 | kfree(pidarray); | ||
| 2407 | return -ENOMEM; | ||
| 2408 | } | ||
| 2409 | cp->cgrp = cgrp; | ||
| 2410 | cp->ns = ns; | ||
| 2411 | get_pid_ns(ns); | ||
| 2412 | list_add(&cp->list, &cgrp->pids_list); | ||
| 2413 | found: | ||
| 2414 | kfree(cp->tasks_pids); | ||
| 2415 | cp->tasks_pids = pidarray; | ||
| 2416 | cp->length = npids; | ||
| 2417 | cp->use_count++; | ||
| 2418 | up_write(&cgrp->pids_mutex); | ||
| 2419 | |||
| 2420 | file->f_op = &cgroup_tasks_operations; | ||
| 2421 | 2758 | ||
| 2422 | retval = seq_open(file, &cgroup_tasks_seq_operations); | 2759 | retval = seq_open(file, &cgroup_pidlist_seq_operations); |
| 2423 | if (retval) { | 2760 | if (retval) { |
| 2424 | release_cgroup_pid_array(cp); | 2761 | cgroup_release_pid_array(l); |
| 2425 | return retval; | 2762 | return retval; |
| 2426 | } | 2763 | } |
| 2427 | ((struct seq_file *)file->private_data)->private = cp; | 2764 | ((struct seq_file *)file->private_data)->private = l; |
| 2428 | return 0; | 2765 | return 0; |
| 2429 | } | 2766 | } |
| 2767 | static int cgroup_tasks_open(struct inode *unused, struct file *file) | ||
| 2768 | { | ||
| 2769 | return cgroup_pidlist_open(file, CGROUP_FILE_TASKS); | ||
| 2770 | } | ||
| 2771 | static int cgroup_procs_open(struct inode *unused, struct file *file) | ||
| 2772 | { | ||
| 2773 | return cgroup_pidlist_open(file, CGROUP_FILE_PROCS); | ||
| 2774 | } | ||
| 2430 | 2775 | ||
| 2431 | static u64 cgroup_read_notify_on_release(struct cgroup *cgrp, | 2776 | static u64 cgroup_read_notify_on_release(struct cgroup *cgrp, |
| 2432 | struct cftype *cft) | 2777 | struct cftype *cft) |
| @@ -2449,21 +2794,27 @@ static int cgroup_write_notify_on_release(struct cgroup *cgrp, | |||
| 2449 | /* | 2794 | /* |
| 2450 | * for the common functions, 'private' gives the type of file | 2795 | * for the common functions, 'private' gives the type of file |
| 2451 | */ | 2796 | */ |
| 2797 | /* for hysterical raisins, we can't put this on the older files */ | ||
| 2798 | #define CGROUP_FILE_GENERIC_PREFIX "cgroup." | ||
| 2452 | static struct cftype files[] = { | 2799 | static struct cftype files[] = { |
| 2453 | { | 2800 | { |
| 2454 | .name = "tasks", | 2801 | .name = "tasks", |
| 2455 | .open = cgroup_tasks_open, | 2802 | .open = cgroup_tasks_open, |
| 2456 | .write_u64 = cgroup_tasks_write, | 2803 | .write_u64 = cgroup_tasks_write, |
| 2457 | .release = cgroup_tasks_release, | 2804 | .release = cgroup_pidlist_release, |
| 2458 | .private = FILE_TASKLIST, | ||
| 2459 | .mode = S_IRUGO | S_IWUSR, | 2805 | .mode = S_IRUGO | S_IWUSR, |
| 2460 | }, | 2806 | }, |
| 2461 | 2807 | { | |
| 2808 | .name = CGROUP_FILE_GENERIC_PREFIX "procs", | ||
| 2809 | .open = cgroup_procs_open, | ||
| 2810 | /* .write_u64 = cgroup_procs_write, TODO */ | ||
| 2811 | .release = cgroup_pidlist_release, | ||
| 2812 | .mode = S_IRUGO, | ||
| 2813 | }, | ||
| 2462 | { | 2814 | { |
| 2463 | .name = "notify_on_release", | 2815 | .name = "notify_on_release", |
| 2464 | .read_u64 = cgroup_read_notify_on_release, | 2816 | .read_u64 = cgroup_read_notify_on_release, |
| 2465 | .write_u64 = cgroup_write_notify_on_release, | 2817 | .write_u64 = cgroup_write_notify_on_release, |
| 2466 | .private = FILE_NOTIFY_ON_RELEASE, | ||
| 2467 | }, | 2818 | }, |
| 2468 | }; | 2819 | }; |
| 2469 | 2820 | ||
| @@ -2472,7 +2823,6 @@ static struct cftype cft_release_agent = { | |||
| 2472 | .read_seq_string = cgroup_release_agent_show, | 2823 | .read_seq_string = cgroup_release_agent_show, |
| 2473 | .write_string = cgroup_release_agent_write, | 2824 | .write_string = cgroup_release_agent_write, |
| 2474 | .max_write_len = PATH_MAX, | 2825 | .max_write_len = PATH_MAX, |
| 2475 | .private = FILE_RELEASE_AGENT, | ||
| 2476 | }; | 2826 | }; |
| 2477 | 2827 | ||
| 2478 | static int cgroup_populate_dir(struct cgroup *cgrp) | 2828 | static int cgroup_populate_dir(struct cgroup *cgrp) |
| @@ -2879,6 +3229,7 @@ int __init cgroup_init_early(void) | |||
| 2879 | init_task.cgroups = &init_css_set; | 3229 | init_task.cgroups = &init_css_set; |
| 2880 | 3230 | ||
| 2881 | init_css_set_link.cg = &init_css_set; | 3231 | init_css_set_link.cg = &init_css_set; |
| 3232 | init_css_set_link.cgrp = dummytop; | ||
| 2882 | list_add(&init_css_set_link.cgrp_link_list, | 3233 | list_add(&init_css_set_link.cgrp_link_list, |
| 2883 | &rootnode.top_cgroup.css_sets); | 3234 | &rootnode.top_cgroup.css_sets); |
| 2884 | list_add(&init_css_set_link.cg_link_list, | 3235 | list_add(&init_css_set_link.cg_link_list, |
| @@ -2933,7 +3284,7 @@ int __init cgroup_init(void) | |||
| 2933 | /* Add init_css_set to the hash table */ | 3284 | /* Add init_css_set to the hash table */ |
| 2934 | hhead = css_set_hash(init_css_set.subsys); | 3285 | hhead = css_set_hash(init_css_set.subsys); |
| 2935 | hlist_add_head(&init_css_set.hlist, hhead); | 3286 | hlist_add_head(&init_css_set.hlist, hhead); |
| 2936 | 3287 | BUG_ON(!init_root_id(&rootnode)); | |
| 2937 | err = register_filesystem(&cgroup_fs_type); | 3288 | err = register_filesystem(&cgroup_fs_type); |
| 2938 | if (err < 0) | 3289 | if (err < 0) |
| 2939 | goto out; | 3290 | goto out; |
| @@ -2986,15 +3337,16 @@ static int proc_cgroup_show(struct seq_file *m, void *v) | |||
| 2986 | for_each_active_root(root) { | 3337 | for_each_active_root(root) { |
| 2987 | struct cgroup_subsys *ss; | 3338 | struct cgroup_subsys *ss; |
| 2988 | struct cgroup *cgrp; | 3339 | struct cgroup *cgrp; |
| 2989 | int subsys_id; | ||
| 2990 | int count = 0; | 3340 | int count = 0; |
| 2991 | 3341 | ||
| 2992 | seq_printf(m, "%lu:", root->subsys_bits); | 3342 | seq_printf(m, "%d:", root->hierarchy_id); |
| 2993 | for_each_subsys(root, ss) | 3343 | for_each_subsys(root, ss) |
| 2994 | seq_printf(m, "%s%s", count++ ? "," : "", ss->name); | 3344 | seq_printf(m, "%s%s", count++ ? "," : "", ss->name); |
| 3345 | if (strlen(root->name)) | ||
| 3346 | seq_printf(m, "%sname=%s", count ? "," : "", | ||
| 3347 | root->name); | ||
| 2995 | seq_putc(m, ':'); | 3348 | seq_putc(m, ':'); |
| 2996 | get_first_subsys(&root->top_cgroup, NULL, &subsys_id); | 3349 | cgrp = task_cgroup_from_root(tsk, root); |
| 2997 | cgrp = task_cgroup(tsk, subsys_id); | ||
| 2998 | retval = cgroup_path(cgrp, buf, PAGE_SIZE); | 3350 | retval = cgroup_path(cgrp, buf, PAGE_SIZE); |
| 2999 | if (retval < 0) | 3351 | if (retval < 0) |
| 3000 | goto out_unlock; | 3352 | goto out_unlock; |
| @@ -3017,7 +3369,7 @@ static int cgroup_open(struct inode *inode, struct file *file) | |||
| 3017 | return single_open(file, proc_cgroup_show, pid); | 3369 | return single_open(file, proc_cgroup_show, pid); |
| 3018 | } | 3370 | } |
| 3019 | 3371 | ||
| 3020 | struct file_operations proc_cgroup_operations = { | 3372 | const struct file_operations proc_cgroup_operations = { |
| 3021 | .open = cgroup_open, | 3373 | .open = cgroup_open, |
| 3022 | .read = seq_read, | 3374 | .read = seq_read, |
| 3023 | .llseek = seq_lseek, | 3375 | .llseek = seq_lseek, |
| @@ -3033,8 +3385,8 @@ static int proc_cgroupstats_show(struct seq_file *m, void *v) | |||
| 3033 | mutex_lock(&cgroup_mutex); | 3385 | mutex_lock(&cgroup_mutex); |
| 3034 | for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) { | 3386 | for (i = 0; i < CGROUP_SUBSYS_COUNT; i++) { |
| 3035 | struct cgroup_subsys *ss = subsys[i]; | 3387 | struct cgroup_subsys *ss = subsys[i]; |
| 3036 | seq_printf(m, "%s\t%lu\t%d\t%d\n", | 3388 | seq_printf(m, "%s\t%d\t%d\t%d\n", |
| 3037 | ss->name, ss->root->subsys_bits, | 3389 | ss->name, ss->root->hierarchy_id, |
| 3038 | ss->root->number_of_cgroups, !ss->disabled); | 3390 | ss->root->number_of_cgroups, !ss->disabled); |
| 3039 | } | 3391 | } |
| 3040 | mutex_unlock(&cgroup_mutex); | 3392 | mutex_unlock(&cgroup_mutex); |
| @@ -3046,7 +3398,7 @@ static int cgroupstats_open(struct inode *inode, struct file *file) | |||
| 3046 | return single_open(file, proc_cgroupstats_show, NULL); | 3398 | return single_open(file, proc_cgroupstats_show, NULL); |
| 3047 | } | 3399 | } |
| 3048 | 3400 | ||
| 3049 | static struct file_operations proc_cgroupstats_operations = { | 3401 | static const struct file_operations proc_cgroupstats_operations = { |
| 3050 | .open = cgroupstats_open, | 3402 | .open = cgroupstats_open, |
| 3051 | .read = seq_read, | 3403 | .read = seq_read, |
| 3052 | .llseek = seq_lseek, | 3404 | .llseek = seq_lseek, |
| @@ -3320,13 +3672,11 @@ int cgroup_is_descendant(const struct cgroup *cgrp, struct task_struct *task) | |||
| 3320 | { | 3672 | { |
| 3321 | int ret; | 3673 | int ret; |
| 3322 | struct cgroup *target; | 3674 | struct cgroup *target; |
| 3323 | int subsys_id; | ||
| 3324 | 3675 | ||
| 3325 | if (cgrp == dummytop) | 3676 | if (cgrp == dummytop) |
| 3326 | return 1; | 3677 | return 1; |
| 3327 | 3678 | ||
| 3328 | get_first_subsys(cgrp, NULL, &subsys_id); | 3679 | target = task_cgroup_from_root(task, cgrp->root); |
| 3329 | target = task_cgroup(task, subsys_id); | ||
| 3330 | while (cgrp != target && cgrp!= cgrp->top_cgroup) | 3680 | while (cgrp != target && cgrp!= cgrp->top_cgroup) |
| 3331 | cgrp = cgrp->parent; | 3681 | cgrp = cgrp->parent; |
| 3332 | ret = (cgrp == target); | 3682 | ret = (cgrp == target); |
| @@ -3358,8 +3708,10 @@ static void check_for_release(struct cgroup *cgrp) | |||
| 3358 | void __css_put(struct cgroup_subsys_state *css) | 3708 | void __css_put(struct cgroup_subsys_state *css) |
| 3359 | { | 3709 | { |
| 3360 | struct cgroup *cgrp = css->cgroup; | 3710 | struct cgroup *cgrp = css->cgroup; |
| 3711 | int val; | ||
| 3361 | rcu_read_lock(); | 3712 | rcu_read_lock(); |
| 3362 | if (atomic_dec_return(&css->refcnt) == 1) { | 3713 | val = atomic_dec_return(&css->refcnt); |
| 3714 | if (val == 1) { | ||
| 3363 | if (notify_on_release(cgrp)) { | 3715 | if (notify_on_release(cgrp)) { |
| 3364 | set_bit(CGRP_RELEASABLE, &cgrp->flags); | 3716 | set_bit(CGRP_RELEASABLE, &cgrp->flags); |
| 3365 | check_for_release(cgrp); | 3717 | check_for_release(cgrp); |
| @@ -3367,6 +3719,7 @@ void __css_put(struct cgroup_subsys_state *css) | |||
| 3367 | cgroup_wakeup_rmdir_waiter(cgrp); | 3719 | cgroup_wakeup_rmdir_waiter(cgrp); |
| 3368 | } | 3720 | } |
| 3369 | rcu_read_unlock(); | 3721 | rcu_read_unlock(); |
| 3722 | WARN_ON_ONCE(val < 1); | ||
| 3370 | } | 3723 | } |
| 3371 | 3724 | ||
| 3372 | /* | 3725 | /* |
| @@ -3693,3 +4046,154 @@ css_get_next(struct cgroup_subsys *ss, int id, | |||
| 3693 | return ret; | 4046 | return ret; |
| 3694 | } | 4047 | } |
| 3695 | 4048 | ||
| 4049 | #ifdef CONFIG_CGROUP_DEBUG | ||
| 4050 | static struct cgroup_subsys_state *debug_create(struct cgroup_subsys *ss, | ||
| 4051 | struct cgroup *cont) | ||
| 4052 | { | ||
| 4053 | struct cgroup_subsys_state *css = kzalloc(sizeof(*css), GFP_KERNEL); | ||
| 4054 | |||
| 4055 | if (!css) | ||
| 4056 | return ERR_PTR(-ENOMEM); | ||
| 4057 | |||
| 4058 | return css; | ||
| 4059 | } | ||
| 4060 | |||
| 4061 | static void debug_destroy(struct cgroup_subsys *ss, struct cgroup *cont) | ||
| 4062 | { | ||
| 4063 | kfree(cont->subsys[debug_subsys_id]); | ||
| 4064 | } | ||
| 4065 | |||
| 4066 | static u64 cgroup_refcount_read(struct cgroup *cont, struct cftype *cft) | ||
| 4067 | { | ||
| 4068 | return atomic_read(&cont->count); | ||
| 4069 | } | ||
| 4070 | |||
| 4071 | static u64 debug_taskcount_read(struct cgroup *cont, struct cftype *cft) | ||
| 4072 | { | ||
| 4073 | return cgroup_task_count(cont); | ||
| 4074 | } | ||
| 4075 | |||
| 4076 | static u64 current_css_set_read(struct cgroup *cont, struct cftype *cft) | ||
| 4077 | { | ||
| 4078 | return (u64)(unsigned long)current->cgroups; | ||
| 4079 | } | ||
| 4080 | |||
| 4081 | static u64 current_css_set_refcount_read(struct cgroup *cont, | ||
| 4082 | struct cftype *cft) | ||
| 4083 | { | ||
| 4084 | u64 count; | ||
| 4085 | |||
| 4086 | rcu_read_lock(); | ||
| 4087 | count = atomic_read(¤t->cgroups->refcount); | ||
| 4088 | rcu_read_unlock(); | ||
| 4089 | return count; | ||
| 4090 | } | ||
| 4091 | |||
| 4092 | static int current_css_set_cg_links_read(struct cgroup *cont, | ||
| 4093 | struct cftype *cft, | ||
| 4094 | struct seq_file *seq) | ||
| 4095 | { | ||
| 4096 | struct cg_cgroup_link *link; | ||
| 4097 | struct css_set *cg; | ||
| 4098 | |||
| 4099 | read_lock(&css_set_lock); | ||
| 4100 | rcu_read_lock(); | ||
| 4101 | cg = rcu_dereference(current->cgroups); | ||
| 4102 | list_for_each_entry(link, &cg->cg_links, cg_link_list) { | ||
| 4103 | struct cgroup *c = link->cgrp; | ||
| 4104 | const char *name; | ||
| 4105 | |||
| 4106 | if (c->dentry) | ||
| 4107 | name = c->dentry->d_name.name; | ||
| 4108 | else | ||
| 4109 | name = "?"; | ||
| 4110 | seq_printf(seq, "Root %d group %s\n", | ||
| 4111 | c->root->hierarchy_id, name); | ||
| 4112 | } | ||
| 4113 | rcu_read_unlock(); | ||
| 4114 | read_unlock(&css_set_lock); | ||
| 4115 | return 0; | ||
| 4116 | } | ||
| 4117 | |||
| 4118 | #define MAX_TASKS_SHOWN_PER_CSS 25 | ||
| 4119 | static int cgroup_css_links_read(struct cgroup *cont, | ||
| 4120 | struct cftype *cft, | ||
| 4121 | struct seq_file *seq) | ||
| 4122 | { | ||
| 4123 | struct cg_cgroup_link *link; | ||
| 4124 | |||
| 4125 | read_lock(&css_set_lock); | ||
| 4126 | list_for_each_entry(link, &cont->css_sets, cgrp_link_list) { | ||
| 4127 | struct css_set *cg = link->cg; | ||
| 4128 | struct task_struct *task; | ||
| 4129 | int count = 0; | ||
| 4130 | seq_printf(seq, "css_set %p\n", cg); | ||
| 4131 | list_for_each_entry(task, &cg->tasks, cg_list) { | ||
| 4132 | if (count++ > MAX_TASKS_SHOWN_PER_CSS) { | ||
| 4133 | seq_puts(seq, " ...\n"); | ||
| 4134 | break; | ||
| 4135 | } else { | ||
| 4136 | seq_printf(seq, " task %d\n", | ||
| 4137 | task_pid_vnr(task)); | ||
| 4138 | } | ||
| 4139 | } | ||
| 4140 | } | ||
| 4141 | read_unlock(&css_set_lock); | ||
| 4142 | return 0; | ||
| 4143 | } | ||
| 4144 | |||
| 4145 | static u64 releasable_read(struct cgroup *cgrp, struct cftype *cft) | ||
| 4146 | { | ||
| 4147 | return test_bit(CGRP_RELEASABLE, &cgrp->flags); | ||
| 4148 | } | ||
| 4149 | |||
| 4150 | static struct cftype debug_files[] = { | ||
| 4151 | { | ||
| 4152 | .name = "cgroup_refcount", | ||
| 4153 | .read_u64 = cgroup_refcount_read, | ||
| 4154 | }, | ||
| 4155 | { | ||
| 4156 | .name = "taskcount", | ||
| 4157 | .read_u64 = debug_taskcount_read, | ||
| 4158 | }, | ||
| 4159 | |||
| 4160 | { | ||
| 4161 | .name = "current_css_set", | ||
| 4162 | .read_u64 = current_css_set_read, | ||
| 4163 | }, | ||
| 4164 | |||
| 4165 | { | ||
| 4166 | .name = "current_css_set_refcount", | ||
| 4167 | .read_u64 = current_css_set_refcount_read, | ||
| 4168 | }, | ||
| 4169 | |||
| 4170 | { | ||
| 4171 | .name = "current_css_set_cg_links", | ||
| 4172 | .read_seq_string = current_css_set_cg_links_read, | ||
| 4173 | }, | ||
| 4174 | |||
| 4175 | { | ||
| 4176 | .name = "cgroup_css_links", | ||
| 4177 | .read_seq_string = cgroup_css_links_read, | ||
| 4178 | }, | ||
| 4179 | |||
| 4180 | { | ||
| 4181 | .name = "releasable", | ||
| 4182 | .read_u64 = releasable_read, | ||
| 4183 | }, | ||
| 4184 | }; | ||
| 4185 | |||
| 4186 | static int debug_populate(struct cgroup_subsys *ss, struct cgroup *cont) | ||
| 4187 | { | ||
| 4188 | return cgroup_add_files(cont, ss, debug_files, | ||
| 4189 | ARRAY_SIZE(debug_files)); | ||
| 4190 | } | ||
| 4191 | |||
| 4192 | struct cgroup_subsys debug_subsys = { | ||
| 4193 | .name = "debug", | ||
| 4194 | .create = debug_create, | ||
| 4195 | .destroy = debug_destroy, | ||
| 4196 | .populate = debug_populate, | ||
| 4197 | .subsys_id = debug_subsys_id, | ||
| 4198 | }; | ||
| 4199 | #endif /* CONFIG_CGROUP_DEBUG */ | ||
diff --git a/kernel/cgroup_debug.c b/kernel/cgroup_debug.c deleted file mode 100644 index 0c92d797baa6..000000000000 --- a/kernel/cgroup_debug.c +++ /dev/null | |||
| @@ -1,105 +0,0 @@ | |||
| 1 | /* | ||
| 2 | * kernel/cgroup_debug.c - Example cgroup subsystem that | ||
| 3 | * exposes debug info | ||
| 4 | * | ||
| 5 | * Copyright (C) Google Inc, 2007 | ||
| 6 | * | ||
| 7 | * Developed by Paul Menage (menage@google.com) | ||
| 8 | * | ||
| 9 | */ | ||
| 10 | |||
| 11 | #include <linux/cgroup.h> | ||
| 12 | #include <linux/fs.h> | ||
| 13 | #include <linux/slab.h> | ||
| 14 | #include <linux/rcupdate.h> | ||
| 15 | |||
| 16 | #include <asm/atomic.h> | ||
| 17 | |||
| 18 | static struct cgroup_subsys_state *debug_create(struct cgroup_subsys *ss, | ||
| 19 | struct cgroup *cont) | ||
| 20 | { | ||
| 21 | struct cgroup_subsys_state *css = kzalloc(sizeof(*css), GFP_KERNEL); | ||
| 22 | |||
| 23 | if (!css) | ||
| 24 | return ERR_PTR(-ENOMEM); | ||
| 25 | |||
| 26 | return css; | ||
| 27 | } | ||
| 28 | |||
| 29 | static void debug_destroy(struct cgroup_subsys *ss, struct cgroup *cont) | ||
| 30 | { | ||
| 31 | kfree(cont->subsys[debug_subsys_id]); | ||
| 32 | } | ||
| 33 | |||
| 34 | static u64 cgroup_refcount_read(struct cgroup *cont, struct cftype *cft) | ||
| 35 | { | ||
| 36 | return atomic_read(&cont->count); | ||
| 37 | } | ||
| 38 | |||
| 39 | static u64 taskcount_read(struct cgroup *cont, struct cftype *cft) | ||
| 40 | { | ||
| 41 | u64 count; | ||
| 42 | |||
| 43 | count = cgroup_task_count(cont); | ||
| 44 | return count; | ||
| 45 | } | ||
| 46 | |||
| 47 | static u64 current_css_set_read(struct cgroup *cont, struct cftype *cft) | ||
| 48 | { | ||
| 49 | return (u64)(long)current->cgroups; | ||
| 50 | } | ||
| 51 | |||
| 52 | static u64 current_css_set_refcount_read(struct cgroup *cont, | ||
| 53 | struct cftype *cft) | ||
| 54 | { | ||
| 55 | u64 count; | ||
| 56 | |||
| 57 | rcu_read_lock(); | ||
| 58 | count = atomic_read(¤t->cgroups->refcount); | ||
| 59 | rcu_read_unlock(); | ||
| 60 | return count; | ||
| 61 | } | ||
| 62 | |||
| 63 | static u64 releasable_read(struct cgroup *cgrp, struct cftype *cft) | ||
| 64 | { | ||
| 65 | return test_bit(CGRP_RELEASABLE, &cgrp->flags); | ||
| 66 | } | ||
| 67 | |||
| 68 | static struct cftype files[] = { | ||
| 69 | { | ||
| 70 | .name = "cgroup_refcount", | ||
| 71 | .read_u64 = cgroup_refcount_read, | ||
| 72 | }, | ||
| 73 | { | ||
| 74 | .name = "taskcount", | ||
| 75 | .read_u64 = taskcount_read, | ||
| 76 | }, | ||
| 77 | |||
| 78 | { | ||
| 79 | .name = "current_css_set", | ||
| 80 | .read_u64 = current_css_set_read, | ||
| 81 | }, | ||
| 82 | |||
| 83 | { | ||
| 84 | .name = "current_css_set_refcount", | ||
| 85 | .read_u64 = current_css_set_refcount_read, | ||
| 86 | }, | ||
| 87 | |||
| 88 | { | ||
| 89 | .name = "releasable", | ||
| 90 | .read_u64 = releasable_read, | ||
| 91 | }, | ||
| 92 | }; | ||
| 93 | |||
| 94 | static int debug_populate(struct cgroup_subsys *ss, struct cgroup *cont) | ||
| 95 | { | ||
| 96 | return cgroup_add_files(cont, ss, files, ARRAY_SIZE(files)); | ||
| 97 | } | ||
| 98 | |||
| 99 | struct cgroup_subsys debug_subsys = { | ||
| 100 | .name = "debug", | ||
| 101 | .create = debug_create, | ||
| 102 | .destroy = debug_destroy, | ||
| 103 | .populate = debug_populate, | ||
| 104 | .subsys_id = debug_subsys_id, | ||
| 105 | }; | ||
diff --git a/kernel/cgroup_freezer.c b/kernel/cgroup_freezer.c index fb249e2bcada..59e9ef6aab40 100644 --- a/kernel/cgroup_freezer.c +++ b/kernel/cgroup_freezer.c | |||
| @@ -159,7 +159,7 @@ static bool is_task_frozen_enough(struct task_struct *task) | |||
| 159 | */ | 159 | */ |
| 160 | static int freezer_can_attach(struct cgroup_subsys *ss, | 160 | static int freezer_can_attach(struct cgroup_subsys *ss, |
| 161 | struct cgroup *new_cgroup, | 161 | struct cgroup *new_cgroup, |
| 162 | struct task_struct *task) | 162 | struct task_struct *task, bool threadgroup) |
| 163 | { | 163 | { |
| 164 | struct freezer *freezer; | 164 | struct freezer *freezer; |
| 165 | 165 | ||
| @@ -177,6 +177,19 @@ static int freezer_can_attach(struct cgroup_subsys *ss, | |||
| 177 | if (freezer->state == CGROUP_FROZEN) | 177 | if (freezer->state == CGROUP_FROZEN) |
| 178 | return -EBUSY; | 178 | return -EBUSY; |
| 179 | 179 | ||
| 180 | if (threadgroup) { | ||
| 181 | struct task_struct *c; | ||
| 182 | |||
| 183 | rcu_read_lock(); | ||
| 184 | list_for_each_entry_rcu(c, &task->thread_group, thread_group) { | ||
| 185 | if (is_task_frozen_enough(c)) { | ||
| 186 | rcu_read_unlock(); | ||
| 187 | return -EBUSY; | ||
| 188 | } | ||
| 189 | } | ||
| 190 | rcu_read_unlock(); | ||
| 191 | } | ||
| 192 | |||
| 180 | return 0; | 193 | return 0; |
| 181 | } | 194 | } |
| 182 | 195 | ||
diff --git a/kernel/cpuset.c b/kernel/cpuset.c index 7e75a41bd508..b5cb469d2545 100644 --- a/kernel/cpuset.c +++ b/kernel/cpuset.c | |||
| @@ -1324,9 +1324,10 @@ static int fmeter_getrate(struct fmeter *fmp) | |||
| 1324 | static cpumask_var_t cpus_attach; | 1324 | static cpumask_var_t cpus_attach; |
| 1325 | 1325 | ||
| 1326 | /* Called by cgroups to determine if a cpuset is usable; cgroup_mutex held */ | 1326 | /* Called by cgroups to determine if a cpuset is usable; cgroup_mutex held */ |
| 1327 | static int cpuset_can_attach(struct cgroup_subsys *ss, | 1327 | static int cpuset_can_attach(struct cgroup_subsys *ss, struct cgroup *cont, |
| 1328 | struct cgroup *cont, struct task_struct *tsk) | 1328 | struct task_struct *tsk, bool threadgroup) |
| 1329 | { | 1329 | { |
| 1330 | int ret; | ||
| 1330 | struct cpuset *cs = cgroup_cs(cont); | 1331 | struct cpuset *cs = cgroup_cs(cont); |
| 1331 | 1332 | ||
| 1332 | if (cpumask_empty(cs->cpus_allowed) || nodes_empty(cs->mems_allowed)) | 1333 | if (cpumask_empty(cs->cpus_allowed) || nodes_empty(cs->mems_allowed)) |
| @@ -1343,18 +1344,51 @@ static int cpuset_can_attach(struct cgroup_subsys *ss, | |||
| 1343 | if (tsk->flags & PF_THREAD_BOUND) | 1344 | if (tsk->flags & PF_THREAD_BOUND) |
| 1344 | return -EINVAL; | 1345 | return -EINVAL; |
| 1345 | 1346 | ||
| 1346 | return security_task_setscheduler(tsk, 0, NULL); | 1347 | ret = security_task_setscheduler(tsk, 0, NULL); |
| 1348 | if (ret) | ||
| 1349 | return ret; | ||
| 1350 | if (threadgroup) { | ||
| 1351 | struct task_struct *c; | ||
| 1352 | |||
| 1353 | rcu_read_lock(); | ||
| 1354 | list_for_each_entry_rcu(c, &tsk->thread_group, thread_group) { | ||
| 1355 | ret = security_task_setscheduler(c, 0, NULL); | ||
| 1356 | if (ret) { | ||
| 1357 | rcu_read_unlock(); | ||
| 1358 | return ret; | ||
| 1359 | } | ||
| 1360 | } | ||
| 1361 | rcu_read_unlock(); | ||
| 1362 | } | ||
| 1363 | return 0; | ||
| 1364 | } | ||
| 1365 | |||
| 1366 | static void cpuset_attach_task(struct task_struct *tsk, nodemask_t *to, | ||
| 1367 | struct cpuset *cs) | ||
| 1368 | { | ||
| 1369 | int err; | ||
| 1370 | /* | ||
| 1371 | * can_attach beforehand should guarantee that this doesn't fail. | ||
| 1372 | * TODO: have a better way to handle failure here | ||
| 1373 | */ | ||
| 1374 | err = set_cpus_allowed_ptr(tsk, cpus_attach); | ||
| 1375 | WARN_ON_ONCE(err); | ||
| 1376 | |||
| 1377 | task_lock(tsk); | ||
| 1378 | cpuset_change_task_nodemask(tsk, to); | ||
| 1379 | task_unlock(tsk); | ||
| 1380 | cpuset_update_task_spread_flag(cs, tsk); | ||
| 1381 | |||
| 1347 | } | 1382 | } |
| 1348 | 1383 | ||
| 1349 | static void cpuset_attach(struct cgroup_subsys *ss, | 1384 | static void cpuset_attach(struct cgroup_subsys *ss, struct cgroup *cont, |
| 1350 | struct cgroup *cont, struct cgroup *oldcont, | 1385 | struct cgroup *oldcont, struct task_struct *tsk, |
| 1351 | struct task_struct *tsk) | 1386 | bool threadgroup) |
| 1352 | { | 1387 | { |
| 1353 | nodemask_t from, to; | 1388 | nodemask_t from, to; |
| 1354 | struct mm_struct *mm; | 1389 | struct mm_struct *mm; |
| 1355 | struct cpuset *cs = cgroup_cs(cont); | 1390 | struct cpuset *cs = cgroup_cs(cont); |
| 1356 | struct cpuset *oldcs = cgroup_cs(oldcont); | 1391 | struct cpuset *oldcs = cgroup_cs(oldcont); |
| 1357 | int err; | ||
| 1358 | 1392 | ||
| 1359 | if (cs == &top_cpuset) { | 1393 | if (cs == &top_cpuset) { |
| 1360 | cpumask_copy(cpus_attach, cpu_possible_mask); | 1394 | cpumask_copy(cpus_attach, cpu_possible_mask); |
| @@ -1363,15 +1397,19 @@ static void cpuset_attach(struct cgroup_subsys *ss, | |||
| 1363 | guarantee_online_cpus(cs, cpus_attach); | 1397 | guarantee_online_cpus(cs, cpus_attach); |
| 1364 | guarantee_online_mems(cs, &to); | 1398 | guarantee_online_mems(cs, &to); |
| 1365 | } | 1399 | } |
| 1366 | err = set_cpus_allowed_ptr(tsk, cpus_attach); | ||
| 1367 | if (err) | ||
| 1368 | return; | ||
| 1369 | 1400 | ||
| 1370 | task_lock(tsk); | 1401 | /* do per-task migration stuff possibly for each in the threadgroup */ |
| 1371 | cpuset_change_task_nodemask(tsk, &to); | 1402 | cpuset_attach_task(tsk, &to, cs); |
| 1372 | task_unlock(tsk); | 1403 | if (threadgroup) { |
| 1373 | cpuset_update_task_spread_flag(cs, tsk); | 1404 | struct task_struct *c; |
| 1405 | rcu_read_lock(); | ||
| 1406 | list_for_each_entry_rcu(c, &tsk->thread_group, thread_group) { | ||
| 1407 | cpuset_attach_task(c, &to, cs); | ||
| 1408 | } | ||
| 1409 | rcu_read_unlock(); | ||
| 1410 | } | ||
| 1374 | 1411 | ||
| 1412 | /* change mm; only needs to be done once even if threadgroup */ | ||
| 1375 | from = oldcs->mems_allowed; | 1413 | from = oldcs->mems_allowed; |
| 1376 | to = cs->mems_allowed; | 1414 | to = cs->mems_allowed; |
| 1377 | mm = get_task_mm(tsk); | 1415 | mm = get_task_mm(tsk); |
diff --git a/kernel/cred.c b/kernel/cred.c index d7f7a01082eb..dd76cfe5f5b0 100644 --- a/kernel/cred.c +++ b/kernel/cred.c | |||
| @@ -782,6 +782,25 @@ EXPORT_SYMBOL(set_create_files_as); | |||
| 782 | 782 | ||
| 783 | #ifdef CONFIG_DEBUG_CREDENTIALS | 783 | #ifdef CONFIG_DEBUG_CREDENTIALS |
| 784 | 784 | ||
| 785 | bool creds_are_invalid(const struct cred *cred) | ||
| 786 | { | ||
| 787 | if (cred->magic != CRED_MAGIC) | ||
| 788 | return true; | ||
| 789 | if (atomic_read(&cred->usage) < atomic_read(&cred->subscribers)) | ||
| 790 | return true; | ||
| 791 | #ifdef CONFIG_SECURITY_SELINUX | ||
| 792 | if (selinux_is_enabled()) { | ||
| 793 | if ((unsigned long) cred->security < PAGE_SIZE) | ||
| 794 | return true; | ||
| 795 | if ((*(u32 *)cred->security & 0xffffff00) == | ||
| 796 | (POISON_FREE << 24 | POISON_FREE << 16 | POISON_FREE << 8)) | ||
| 797 | return true; | ||
| 798 | } | ||
| 799 | #endif | ||
| 800 | return false; | ||
| 801 | } | ||
| 802 | EXPORT_SYMBOL(creds_are_invalid); | ||
| 803 | |||
| 785 | /* | 804 | /* |
| 786 | * dump invalid credentials | 805 | * dump invalid credentials |
| 787 | */ | 806 | */ |
diff --git a/kernel/exit.c b/kernel/exit.c index e47ee8a06135..e61891f80123 100644 --- a/kernel/exit.c +++ b/kernel/exit.c | |||
| @@ -359,8 +359,10 @@ void __set_special_pids(struct pid *pid) | |||
| 359 | { | 359 | { |
| 360 | struct task_struct *curr = current->group_leader; | 360 | struct task_struct *curr = current->group_leader; |
| 361 | 361 | ||
| 362 | if (task_session(curr) != pid) | 362 | if (task_session(curr) != pid) { |
| 363 | change_pid(curr, PIDTYPE_SID, pid); | 363 | change_pid(curr, PIDTYPE_SID, pid); |
| 364 | proc_sid_connector(curr); | ||
| 365 | } | ||
| 364 | 366 | ||
| 365 | if (task_pgrp(curr) != pid) | 367 | if (task_pgrp(curr) != pid) |
| 366 | change_pid(curr, PIDTYPE_PGID, pid); | 368 | change_pid(curr, PIDTYPE_PGID, pid); |
| @@ -945,6 +947,8 @@ NORET_TYPE void do_exit(long code) | |||
| 945 | if (group_dead) { | 947 | if (group_dead) { |
| 946 | hrtimer_cancel(&tsk->signal->real_timer); | 948 | hrtimer_cancel(&tsk->signal->real_timer); |
| 947 | exit_itimers(tsk->signal); | 949 | exit_itimers(tsk->signal); |
| 950 | if (tsk->mm) | ||
| 951 | setmax_mm_hiwater_rss(&tsk->signal->maxrss, tsk->mm); | ||
| 948 | } | 952 | } |
| 949 | acct_collect(code, group_dead); | 953 | acct_collect(code, group_dead); |
| 950 | if (group_dead) | 954 | if (group_dead) |
| @@ -972,8 +976,6 @@ NORET_TYPE void do_exit(long code) | |||
| 972 | disassociate_ctty(1); | 976 | disassociate_ctty(1); |
| 973 | 977 | ||
| 974 | module_put(task_thread_info(tsk)->exec_domain->module); | 978 | module_put(task_thread_info(tsk)->exec_domain->module); |
| 975 | if (tsk->binfmt) | ||
| 976 | module_put(tsk->binfmt->module); | ||
| 977 | 979 | ||
| 978 | proc_exit_connector(tsk); | 980 | proc_exit_connector(tsk); |
| 979 | 981 | ||
| @@ -989,8 +991,6 @@ NORET_TYPE void do_exit(long code) | |||
| 989 | tsk->mempolicy = NULL; | 991 | tsk->mempolicy = NULL; |
| 990 | #endif | 992 | #endif |
| 991 | #ifdef CONFIG_FUTEX | 993 | #ifdef CONFIG_FUTEX |
| 992 | if (unlikely(!list_empty(&tsk->pi_state_list))) | ||
| 993 | exit_pi_state_list(tsk); | ||
| 994 | if (unlikely(current->pi_state_cache)) | 994 | if (unlikely(current->pi_state_cache)) |
| 995 | kfree(current->pi_state_cache); | 995 | kfree(current->pi_state_cache); |
| 996 | #endif | 996 | #endif |
| @@ -1093,28 +1093,28 @@ struct wait_opts { | |||
| 1093 | int __user *wo_stat; | 1093 | int __user *wo_stat; |
| 1094 | struct rusage __user *wo_rusage; | 1094 | struct rusage __user *wo_rusage; |
| 1095 | 1095 | ||
| 1096 | wait_queue_t child_wait; | ||
| 1096 | int notask_error; | 1097 | int notask_error; |
| 1097 | }; | 1098 | }; |
| 1098 | 1099 | ||
| 1099 | static struct pid *task_pid_type(struct task_struct *task, enum pid_type type) | 1100 | static inline |
| 1101 | struct pid *task_pid_type(struct task_struct *task, enum pid_type type) | ||
| 1100 | { | 1102 | { |
| 1101 | struct pid *pid = NULL; | 1103 | if (type != PIDTYPE_PID) |
| 1102 | if (type == PIDTYPE_PID) | 1104 | task = task->group_leader; |
| 1103 | pid = task->pids[type].pid; | 1105 | return task->pids[type].pid; |
| 1104 | else if (type < PIDTYPE_MAX) | ||
| 1105 | pid = task->group_leader->pids[type].pid; | ||
| 1106 | return pid; | ||
| 1107 | } | 1106 | } |
| 1108 | 1107 | ||
| 1109 | static int eligible_child(struct wait_opts *wo, struct task_struct *p) | 1108 | static int eligible_pid(struct wait_opts *wo, struct task_struct *p) |
| 1110 | { | 1109 | { |
| 1111 | int err; | 1110 | return wo->wo_type == PIDTYPE_MAX || |
| 1112 | 1111 | task_pid_type(p, wo->wo_type) == wo->wo_pid; | |
| 1113 | if (wo->wo_type < PIDTYPE_MAX) { | 1112 | } |
| 1114 | if (task_pid_type(p, wo->wo_type) != wo->wo_pid) | ||
| 1115 | return 0; | ||
| 1116 | } | ||
| 1117 | 1113 | ||
| 1114 | static int eligible_child(struct wait_opts *wo, struct task_struct *p) | ||
| 1115 | { | ||
| 1116 | if (!eligible_pid(wo, p)) | ||
| 1117 | return 0; | ||
| 1118 | /* Wait for all children (clone and not) if __WALL is set; | 1118 | /* Wait for all children (clone and not) if __WALL is set; |
| 1119 | * otherwise, wait for clone children *only* if __WCLONE is | 1119 | * otherwise, wait for clone children *only* if __WCLONE is |
| 1120 | * set; otherwise, wait for non-clone children *only*. (Note: | 1120 | * set; otherwise, wait for non-clone children *only*. (Note: |
| @@ -1124,10 +1124,6 @@ static int eligible_child(struct wait_opts *wo, struct task_struct *p) | |||
| 1124 | && !(wo->wo_flags & __WALL)) | 1124 | && !(wo->wo_flags & __WALL)) |
| 1125 | return 0; | 1125 | return 0; |
| 1126 | 1126 | ||
| 1127 | err = security_task_wait(p); | ||
| 1128 | if (err) | ||
| 1129 | return err; | ||
| 1130 | |||
| 1131 | return 1; | 1127 | return 1; |
| 1132 | } | 1128 | } |
| 1133 | 1129 | ||
| @@ -1140,18 +1136,20 @@ static int wait_noreap_copyout(struct wait_opts *wo, struct task_struct *p, | |||
| 1140 | 1136 | ||
| 1141 | put_task_struct(p); | 1137 | put_task_struct(p); |
| 1142 | infop = wo->wo_info; | 1138 | infop = wo->wo_info; |
| 1143 | if (!retval) | 1139 | if (infop) { |
| 1144 | retval = put_user(SIGCHLD, &infop->si_signo); | 1140 | if (!retval) |
| 1145 | if (!retval) | 1141 | retval = put_user(SIGCHLD, &infop->si_signo); |
| 1146 | retval = put_user(0, &infop->si_errno); | 1142 | if (!retval) |
| 1147 | if (!retval) | 1143 | retval = put_user(0, &infop->si_errno); |
| 1148 | retval = put_user((short)why, &infop->si_code); | 1144 | if (!retval) |
| 1149 | if (!retval) | 1145 | retval = put_user((short)why, &infop->si_code); |
| 1150 | retval = put_user(pid, &infop->si_pid); | 1146 | if (!retval) |
| 1151 | if (!retval) | 1147 | retval = put_user(pid, &infop->si_pid); |
| 1152 | retval = put_user(uid, &infop->si_uid); | 1148 | if (!retval) |
| 1153 | if (!retval) | 1149 | retval = put_user(uid, &infop->si_uid); |
| 1154 | retval = put_user(status, &infop->si_status); | 1150 | if (!retval) |
| 1151 | retval = put_user(status, &infop->si_status); | ||
| 1152 | } | ||
| 1155 | if (!retval) | 1153 | if (!retval) |
| 1156 | retval = pid; | 1154 | retval = pid; |
| 1157 | return retval; | 1155 | return retval; |
| @@ -1208,6 +1206,7 @@ static int wait_task_zombie(struct wait_opts *wo, struct task_struct *p) | |||
| 1208 | if (likely(!traced) && likely(!task_detached(p))) { | 1206 | if (likely(!traced) && likely(!task_detached(p))) { |
| 1209 | struct signal_struct *psig; | 1207 | struct signal_struct *psig; |
| 1210 | struct signal_struct *sig; | 1208 | struct signal_struct *sig; |
| 1209 | unsigned long maxrss; | ||
| 1211 | 1210 | ||
| 1212 | /* | 1211 | /* |
| 1213 | * The resource counters for the group leader are in its | 1212 | * The resource counters for the group leader are in its |
| @@ -1256,6 +1255,9 @@ static int wait_task_zombie(struct wait_opts *wo, struct task_struct *p) | |||
| 1256 | psig->coublock += | 1255 | psig->coublock += |
| 1257 | task_io_get_oublock(p) + | 1256 | task_io_get_oublock(p) + |
| 1258 | sig->oublock + sig->coublock; | 1257 | sig->oublock + sig->coublock; |
| 1258 | maxrss = max(sig->maxrss, sig->cmaxrss); | ||
| 1259 | if (psig->cmaxrss < maxrss) | ||
| 1260 | psig->cmaxrss = maxrss; | ||
| 1259 | task_io_accounting_add(&psig->ioac, &p->ioac); | 1261 | task_io_accounting_add(&psig->ioac, &p->ioac); |
| 1260 | task_io_accounting_add(&psig->ioac, &sig->ioac); | 1262 | task_io_accounting_add(&psig->ioac, &sig->ioac); |
| 1261 | spin_unlock_irq(&p->real_parent->sighand->siglock); | 1263 | spin_unlock_irq(&p->real_parent->sighand->siglock); |
| @@ -1477,13 +1479,14 @@ static int wait_task_continued(struct wait_opts *wo, struct task_struct *p) | |||
| 1477 | * then ->notask_error is 0 if @p is an eligible child, | 1479 | * then ->notask_error is 0 if @p is an eligible child, |
| 1478 | * or another error from security_task_wait(), or still -ECHILD. | 1480 | * or another error from security_task_wait(), or still -ECHILD. |
| 1479 | */ | 1481 | */ |
| 1480 | static int wait_consider_task(struct wait_opts *wo, struct task_struct *parent, | 1482 | static int wait_consider_task(struct wait_opts *wo, int ptrace, |
| 1481 | int ptrace, struct task_struct *p) | 1483 | struct task_struct *p) |
| 1482 | { | 1484 | { |
| 1483 | int ret = eligible_child(wo, p); | 1485 | int ret = eligible_child(wo, p); |
| 1484 | if (!ret) | 1486 | if (!ret) |
| 1485 | return ret; | 1487 | return ret; |
| 1486 | 1488 | ||
| 1489 | ret = security_task_wait(p); | ||
| 1487 | if (unlikely(ret < 0)) { | 1490 | if (unlikely(ret < 0)) { |
| 1488 | /* | 1491 | /* |
| 1489 | * If we have not yet seen any eligible child, | 1492 | * If we have not yet seen any eligible child, |
| @@ -1545,7 +1548,7 @@ static int do_wait_thread(struct wait_opts *wo, struct task_struct *tsk) | |||
| 1545 | * Do not consider detached threads. | 1548 | * Do not consider detached threads. |
| 1546 | */ | 1549 | */ |
| 1547 | if (!task_detached(p)) { | 1550 | if (!task_detached(p)) { |
| 1548 | int ret = wait_consider_task(wo, tsk, 0, p); | 1551 | int ret = wait_consider_task(wo, 0, p); |
| 1549 | if (ret) | 1552 | if (ret) |
| 1550 | return ret; | 1553 | return ret; |
| 1551 | } | 1554 | } |
| @@ -1559,7 +1562,7 @@ static int ptrace_do_wait(struct wait_opts *wo, struct task_struct *tsk) | |||
| 1559 | struct task_struct *p; | 1562 | struct task_struct *p; |
| 1560 | 1563 | ||
| 1561 | list_for_each_entry(p, &tsk->ptraced, ptrace_entry) { | 1564 | list_for_each_entry(p, &tsk->ptraced, ptrace_entry) { |
| 1562 | int ret = wait_consider_task(wo, tsk, 1, p); | 1565 | int ret = wait_consider_task(wo, 1, p); |
| 1563 | if (ret) | 1566 | if (ret) |
| 1564 | return ret; | 1567 | return ret; |
| 1565 | } | 1568 | } |
| @@ -1567,15 +1570,38 @@ static int ptrace_do_wait(struct wait_opts *wo, struct task_struct *tsk) | |||
| 1567 | return 0; | 1570 | return 0; |
| 1568 | } | 1571 | } |
| 1569 | 1572 | ||
| 1573 | static int child_wait_callback(wait_queue_t *wait, unsigned mode, | ||
| 1574 | int sync, void *key) | ||
| 1575 | { | ||
| 1576 | struct wait_opts *wo = container_of(wait, struct wait_opts, | ||
| 1577 | child_wait); | ||
| 1578 | struct task_struct *p = key; | ||
| 1579 | |||
| 1580 | if (!eligible_pid(wo, p)) | ||
| 1581 | return 0; | ||
| 1582 | |||
| 1583 | if ((wo->wo_flags & __WNOTHREAD) && wait->private != p->parent) | ||
| 1584 | return 0; | ||
| 1585 | |||
| 1586 | return default_wake_function(wait, mode, sync, key); | ||
| 1587 | } | ||
| 1588 | |||
| 1589 | void __wake_up_parent(struct task_struct *p, struct task_struct *parent) | ||
| 1590 | { | ||
| 1591 | __wake_up_sync_key(&parent->signal->wait_chldexit, | ||
| 1592 | TASK_INTERRUPTIBLE, 1, p); | ||
| 1593 | } | ||
| 1594 | |||
| 1570 | static long do_wait(struct wait_opts *wo) | 1595 | static long do_wait(struct wait_opts *wo) |
| 1571 | { | 1596 | { |
| 1572 | DECLARE_WAITQUEUE(wait, current); | ||
| 1573 | struct task_struct *tsk; | 1597 | struct task_struct *tsk; |
| 1574 | int retval; | 1598 | int retval; |
| 1575 | 1599 | ||
| 1576 | trace_sched_process_wait(wo->wo_pid); | 1600 | trace_sched_process_wait(wo->wo_pid); |
| 1577 | 1601 | ||
| 1578 | add_wait_queue(¤t->signal->wait_chldexit,&wait); | 1602 | init_waitqueue_func_entry(&wo->child_wait, child_wait_callback); |
| 1603 | wo->child_wait.private = current; | ||
| 1604 | add_wait_queue(¤t->signal->wait_chldexit, &wo->child_wait); | ||
| 1579 | repeat: | 1605 | repeat: |
| 1580 | /* | 1606 | /* |
| 1581 | * If there is nothing that can match our critiera just get out. | 1607 | * If there is nothing that can match our critiera just get out. |
| @@ -1616,32 +1642,7 @@ notask: | |||
| 1616 | } | 1642 | } |
| 1617 | end: | 1643 | end: |
| 1618 | __set_current_state(TASK_RUNNING); | 1644 | __set_current_state(TASK_RUNNING); |
| 1619 | remove_wait_queue(¤t->signal->wait_chldexit,&wait); | 1645 | remove_wait_queue(¤t->signal->wait_chldexit, &wo->child_wait); |
| 1620 | if (wo->wo_info) { | ||
| 1621 | struct siginfo __user *infop = wo->wo_info; | ||
| 1622 | |||
| 1623 | if (retval > 0) | ||
| 1624 | retval = 0; | ||
| 1625 | else { | ||
| 1626 | /* | ||
| 1627 | * For a WNOHANG return, clear out all the fields | ||
| 1628 | * we would set so the user can easily tell the | ||
| 1629 | * difference. | ||
| 1630 | */ | ||
| 1631 | if (!retval) | ||
| 1632 | retval = put_user(0, &infop->si_signo); | ||
| 1633 | if (!retval) | ||
| 1634 | retval = put_user(0, &infop->si_errno); | ||
| 1635 | if (!retval) | ||
| 1636 | retval = put_user(0, &infop->si_code); | ||
| 1637 | if (!retval) | ||
| 1638 | retval = put_user(0, &infop->si_pid); | ||
| 1639 | if (!retval) | ||
| 1640 | retval = put_user(0, &infop->si_uid); | ||
| 1641 | if (!retval) | ||
| 1642 | retval = put_user(0, &infop->si_status); | ||
| 1643 | } | ||
| 1644 | } | ||
| 1645 | return retval; | 1646 | return retval; |
| 1646 | } | 1647 | } |
| 1647 | 1648 | ||
| @@ -1686,6 +1687,29 @@ SYSCALL_DEFINE5(waitid, int, which, pid_t, upid, struct siginfo __user *, | |||
| 1686 | wo.wo_stat = NULL; | 1687 | wo.wo_stat = NULL; |
| 1687 | wo.wo_rusage = ru; | 1688 | wo.wo_rusage = ru; |
| 1688 | ret = do_wait(&wo); | 1689 | ret = do_wait(&wo); |
| 1690 | |||
| 1691 | if (ret > 0) { | ||
| 1692 | ret = 0; | ||
| 1693 | } else if (infop) { | ||
| 1694 | /* | ||
| 1695 | * For a WNOHANG return, clear out all the fields | ||
| 1696 | * we would set so the user can easily tell the | ||
| 1697 | * difference. | ||
| 1698 | */ | ||
| 1699 | if (!ret) | ||
| 1700 | ret = put_user(0, &infop->si_signo); | ||
| 1701 | if (!ret) | ||
| 1702 | ret = put_user(0, &infop->si_errno); | ||
| 1703 | if (!ret) | ||
| 1704 | ret = put_user(0, &infop->si_code); | ||
| 1705 | if (!ret) | ||
| 1706 | ret = put_user(0, &infop->si_pid); | ||
| 1707 | if (!ret) | ||
| 1708 | ret = put_user(0, &infop->si_uid); | ||
| 1709 | if (!ret) | ||
| 1710 | ret = put_user(0, &infop->si_status); | ||
| 1711 | } | ||
| 1712 | |||
| 1689 | put_pid(pid); | 1713 | put_pid(pid); |
| 1690 | 1714 | ||
| 1691 | /* avoid REGPARM breakage on x86: */ | 1715 | /* avoid REGPARM breakage on x86: */ |
diff --git a/kernel/fork.c b/kernel/fork.c index 1020977b57ca..4c20fff8c13a 100644 --- a/kernel/fork.c +++ b/kernel/fork.c | |||
| @@ -63,6 +63,7 @@ | |||
| 63 | #include <linux/fs_struct.h> | 63 | #include <linux/fs_struct.h> |
| 64 | #include <linux/magic.h> | 64 | #include <linux/magic.h> |
| 65 | #include <linux/perf_event.h> | 65 | #include <linux/perf_event.h> |
| 66 | #include <linux/posix-timers.h> | ||
| 66 | 67 | ||
| 67 | #include <asm/pgtable.h> | 68 | #include <asm/pgtable.h> |
| 68 | #include <asm/pgalloc.h> | 69 | #include <asm/pgalloc.h> |
| @@ -433,6 +434,14 @@ __setup("coredump_filter=", coredump_filter_setup); | |||
| 433 | 434 | ||
| 434 | #include <linux/init_task.h> | 435 | #include <linux/init_task.h> |
| 435 | 436 | ||
| 437 | static void mm_init_aio(struct mm_struct *mm) | ||
| 438 | { | ||
| 439 | #ifdef CONFIG_AIO | ||
| 440 | spin_lock_init(&mm->ioctx_lock); | ||
| 441 | INIT_HLIST_HEAD(&mm->ioctx_list); | ||
| 442 | #endif | ||
| 443 | } | ||
| 444 | |||
| 436 | static struct mm_struct * mm_init(struct mm_struct * mm, struct task_struct *p) | 445 | static struct mm_struct * mm_init(struct mm_struct * mm, struct task_struct *p) |
| 437 | { | 446 | { |
| 438 | atomic_set(&mm->mm_users, 1); | 447 | atomic_set(&mm->mm_users, 1); |
| @@ -446,10 +455,9 @@ static struct mm_struct * mm_init(struct mm_struct * mm, struct task_struct *p) | |||
| 446 | set_mm_counter(mm, file_rss, 0); | 455 | set_mm_counter(mm, file_rss, 0); |
| 447 | set_mm_counter(mm, anon_rss, 0); | 456 | set_mm_counter(mm, anon_rss, 0); |
| 448 | spin_lock_init(&mm->page_table_lock); | 457 | spin_lock_init(&mm->page_table_lock); |
| 449 | spin_lock_init(&mm->ioctx_lock); | ||
| 450 | INIT_HLIST_HEAD(&mm->ioctx_list); | ||
| 451 | mm->free_area_cache = TASK_UNMAPPED_BASE; | 458 | mm->free_area_cache = TASK_UNMAPPED_BASE; |
| 452 | mm->cached_hole_size = ~0UL; | 459 | mm->cached_hole_size = ~0UL; |
| 460 | mm_init_aio(mm); | ||
| 453 | mm_init_owner(mm, p); | 461 | mm_init_owner(mm, p); |
| 454 | 462 | ||
| 455 | if (likely(!mm_alloc_pgd(mm))) { | 463 | if (likely(!mm_alloc_pgd(mm))) { |
| @@ -510,6 +518,8 @@ void mmput(struct mm_struct *mm) | |||
| 510 | spin_unlock(&mmlist_lock); | 518 | spin_unlock(&mmlist_lock); |
| 511 | } | 519 | } |
| 512 | put_swap_token(mm); | 520 | put_swap_token(mm); |
| 521 | if (mm->binfmt) | ||
| 522 | module_put(mm->binfmt->module); | ||
| 513 | mmdrop(mm); | 523 | mmdrop(mm); |
| 514 | } | 524 | } |
| 515 | } | 525 | } |
| @@ -560,12 +570,18 @@ void mm_release(struct task_struct *tsk, struct mm_struct *mm) | |||
| 560 | 570 | ||
| 561 | /* Get rid of any futexes when releasing the mm */ | 571 | /* Get rid of any futexes when releasing the mm */ |
| 562 | #ifdef CONFIG_FUTEX | 572 | #ifdef CONFIG_FUTEX |
| 563 | if (unlikely(tsk->robust_list)) | 573 | if (unlikely(tsk->robust_list)) { |
| 564 | exit_robust_list(tsk); | 574 | exit_robust_list(tsk); |
| 575 | tsk->robust_list = NULL; | ||
| 576 | } | ||
| 565 | #ifdef CONFIG_COMPAT | 577 | #ifdef CONFIG_COMPAT |
| 566 | if (unlikely(tsk->compat_robust_list)) | 578 | if (unlikely(tsk->compat_robust_list)) { |
| 567 | compat_exit_robust_list(tsk); | 579 | compat_exit_robust_list(tsk); |
| 580 | tsk->compat_robust_list = NULL; | ||
| 581 | } | ||
| 568 | #endif | 582 | #endif |
| 583 | if (unlikely(!list_empty(&tsk->pi_state_list))) | ||
| 584 | exit_pi_state_list(tsk); | ||
| 569 | #endif | 585 | #endif |
| 570 | 586 | ||
| 571 | /* Get rid of any cached register state */ | 587 | /* Get rid of any cached register state */ |
| @@ -635,9 +651,14 @@ struct mm_struct *dup_mm(struct task_struct *tsk) | |||
| 635 | mm->hiwater_rss = get_mm_rss(mm); | 651 | mm->hiwater_rss = get_mm_rss(mm); |
| 636 | mm->hiwater_vm = mm->total_vm; | 652 | mm->hiwater_vm = mm->total_vm; |
| 637 | 653 | ||
| 654 | if (mm->binfmt && !try_module_get(mm->binfmt->module)) | ||
| 655 | goto free_pt; | ||
| 656 | |||
| 638 | return mm; | 657 | return mm; |
| 639 | 658 | ||
| 640 | free_pt: | 659 | free_pt: |
| 660 | /* don't put binfmt in mmput, we haven't got module yet */ | ||
| 661 | mm->binfmt = NULL; | ||
| 641 | mmput(mm); | 662 | mmput(mm); |
| 642 | 663 | ||
| 643 | fail_nomem: | 664 | fail_nomem: |
| @@ -805,10 +826,10 @@ static void posix_cpu_timers_init_group(struct signal_struct *sig) | |||
| 805 | thread_group_cputime_init(sig); | 826 | thread_group_cputime_init(sig); |
| 806 | 827 | ||
| 807 | /* Expiration times and increments. */ | 828 | /* Expiration times and increments. */ |
| 808 | sig->it_virt_expires = cputime_zero; | 829 | sig->it[CPUCLOCK_PROF].expires = cputime_zero; |
| 809 | sig->it_virt_incr = cputime_zero; | 830 | sig->it[CPUCLOCK_PROF].incr = cputime_zero; |
| 810 | sig->it_prof_expires = cputime_zero; | 831 | sig->it[CPUCLOCK_VIRT].expires = cputime_zero; |
| 811 | sig->it_prof_incr = cputime_zero; | 832 | sig->it[CPUCLOCK_VIRT].incr = cputime_zero; |
| 812 | 833 | ||
| 813 | /* Cached expiration times. */ | 834 | /* Cached expiration times. */ |
| 814 | sig->cputime_expires.prof_exp = cputime_zero; | 835 | sig->cputime_expires.prof_exp = cputime_zero; |
| @@ -866,6 +887,7 @@ static int copy_signal(unsigned long clone_flags, struct task_struct *tsk) | |||
| 866 | sig->nvcsw = sig->nivcsw = sig->cnvcsw = sig->cnivcsw = 0; | 887 | sig->nvcsw = sig->nivcsw = sig->cnvcsw = sig->cnivcsw = 0; |
| 867 | sig->min_flt = sig->maj_flt = sig->cmin_flt = sig->cmaj_flt = 0; | 888 | sig->min_flt = sig->maj_flt = sig->cmin_flt = sig->cmaj_flt = 0; |
| 868 | sig->inblock = sig->oublock = sig->cinblock = sig->coublock = 0; | 889 | sig->inblock = sig->oublock = sig->cinblock = sig->coublock = 0; |
| 890 | sig->maxrss = sig->cmaxrss = 0; | ||
| 869 | task_io_accounting_init(&sig->ioac); | 891 | task_io_accounting_init(&sig->ioac); |
| 870 | sig->sum_sched_runtime = 0; | 892 | sig->sum_sched_runtime = 0; |
| 871 | taskstats_tgid_init(sig); | 893 | taskstats_tgid_init(sig); |
| @@ -977,6 +999,16 @@ static struct task_struct *copy_process(unsigned long clone_flags, | |||
| 977 | if ((clone_flags & CLONE_SIGHAND) && !(clone_flags & CLONE_VM)) | 999 | if ((clone_flags & CLONE_SIGHAND) && !(clone_flags & CLONE_VM)) |
| 978 | return ERR_PTR(-EINVAL); | 1000 | return ERR_PTR(-EINVAL); |
| 979 | 1001 | ||
| 1002 | /* | ||
| 1003 | * Siblings of global init remain as zombies on exit since they are | ||
| 1004 | * not reaped by their parent (swapper). To solve this and to avoid | ||
| 1005 | * multi-rooted process trees, prevent global and container-inits | ||
| 1006 | * from creating siblings. | ||
| 1007 | */ | ||
| 1008 | if ((clone_flags & CLONE_PARENT) && | ||
| 1009 | current->signal->flags & SIGNAL_UNKILLABLE) | ||
| 1010 | return ERR_PTR(-EINVAL); | ||
| 1011 | |||
| 980 | retval = security_task_create(clone_flags); | 1012 | retval = security_task_create(clone_flags); |
| 981 | if (retval) | 1013 | if (retval) |
| 982 | goto fork_out; | 1014 | goto fork_out; |
| @@ -1018,9 +1050,6 @@ static struct task_struct *copy_process(unsigned long clone_flags, | |||
| 1018 | if (!try_module_get(task_thread_info(p)->exec_domain->module)) | 1050 | if (!try_module_get(task_thread_info(p)->exec_domain->module)) |
| 1019 | goto bad_fork_cleanup_count; | 1051 | goto bad_fork_cleanup_count; |
| 1020 | 1052 | ||
| 1021 | if (p->binfmt && !try_module_get(p->binfmt->module)) | ||
| 1022 | goto bad_fork_cleanup_put_domain; | ||
| 1023 | |||
| 1024 | p->did_exec = 0; | 1053 | p->did_exec = 0; |
| 1025 | delayacct_tsk_init(p); /* Must remain after dup_task_struct() */ | 1054 | delayacct_tsk_init(p); /* Must remain after dup_task_struct() */ |
| 1026 | copy_flags(clone_flags, p); | 1055 | copy_flags(clone_flags, p); |
| @@ -1094,6 +1123,8 @@ static struct task_struct *copy_process(unsigned long clone_flags, | |||
| 1094 | 1123 | ||
| 1095 | p->bts = NULL; | 1124 | p->bts = NULL; |
| 1096 | 1125 | ||
| 1126 | p->stack_start = stack_start; | ||
| 1127 | |||
| 1097 | /* Perform scheduler related setup. Assign this task to a CPU. */ | 1128 | /* Perform scheduler related setup. Assign this task to a CPU. */ |
| 1098 | sched_fork(p, clone_flags); | 1129 | sched_fork(p, clone_flags); |
| 1099 | 1130 | ||
| @@ -1306,9 +1337,6 @@ bad_fork_cleanup_cgroup: | |||
| 1306 | #endif | 1337 | #endif |
| 1307 | cgroup_exit(p, cgroup_callbacks_done); | 1338 | cgroup_exit(p, cgroup_callbacks_done); |
| 1308 | delayacct_tsk_free(p); | 1339 | delayacct_tsk_free(p); |
| 1309 | if (p->binfmt) | ||
| 1310 | module_put(p->binfmt->module); | ||
| 1311 | bad_fork_cleanup_put_domain: | ||
| 1312 | module_put(task_thread_info(p)->exec_domain->module); | 1340 | module_put(task_thread_info(p)->exec_domain->module); |
| 1313 | bad_fork_cleanup_count: | 1341 | bad_fork_cleanup_count: |
| 1314 | atomic_dec(&p->cred->user->processes); | 1342 | atomic_dec(&p->cred->user->processes); |
diff --git a/kernel/futex.c b/kernel/futex.c index 248dd119a86e..4949d336d88d 100644 --- a/kernel/futex.c +++ b/kernel/futex.c | |||
| @@ -89,36 +89,36 @@ struct futex_pi_state { | |||
| 89 | union futex_key key; | 89 | union futex_key key; |
| 90 | }; | 90 | }; |
| 91 | 91 | ||
| 92 | /* | 92 | /** |
| 93 | * We use this hashed waitqueue instead of a normal wait_queue_t, so | 93 | * struct futex_q - The hashed futex queue entry, one per waiting task |
| 94 | * @task: the task waiting on the futex | ||
| 95 | * @lock_ptr: the hash bucket lock | ||
| 96 | * @key: the key the futex is hashed on | ||
| 97 | * @pi_state: optional priority inheritance state | ||
| 98 | * @rt_waiter: rt_waiter storage for use with requeue_pi | ||
| 99 | * @requeue_pi_key: the requeue_pi target futex key | ||
| 100 | * @bitset: bitset for the optional bitmasked wakeup | ||
| 101 | * | ||
| 102 | * We use this hashed waitqueue, instead of a normal wait_queue_t, so | ||
| 94 | * we can wake only the relevant ones (hashed queues may be shared). | 103 | * we can wake only the relevant ones (hashed queues may be shared). |
| 95 | * | 104 | * |
| 96 | * A futex_q has a woken state, just like tasks have TASK_RUNNING. | 105 | * A futex_q has a woken state, just like tasks have TASK_RUNNING. |
| 97 | * It is considered woken when plist_node_empty(&q->list) || q->lock_ptr == 0. | 106 | * It is considered woken when plist_node_empty(&q->list) || q->lock_ptr == 0. |
| 98 | * The order of wakup is always to make the first condition true, then | 107 | * The order of wakup is always to make the first condition true, then |
| 99 | * wake up q->waiter, then make the second condition true. | 108 | * the second. |
| 109 | * | ||
| 110 | * PI futexes are typically woken before they are removed from the hash list via | ||
| 111 | * the rt_mutex code. See unqueue_me_pi(). | ||
| 100 | */ | 112 | */ |
| 101 | struct futex_q { | 113 | struct futex_q { |
| 102 | struct plist_node list; | 114 | struct plist_node list; |
| 103 | /* Waiter reference */ | ||
| 104 | struct task_struct *task; | ||
| 105 | 115 | ||
| 106 | /* Which hash list lock to use: */ | 116 | struct task_struct *task; |
| 107 | spinlock_t *lock_ptr; | 117 | spinlock_t *lock_ptr; |
| 108 | |||
| 109 | /* Key which the futex is hashed on: */ | ||
| 110 | union futex_key key; | 118 | union futex_key key; |
| 111 | |||
| 112 | /* Optional priority inheritance state: */ | ||
| 113 | struct futex_pi_state *pi_state; | 119 | struct futex_pi_state *pi_state; |
| 114 | |||
| 115 | /* rt_waiter storage for requeue_pi: */ | ||
| 116 | struct rt_mutex_waiter *rt_waiter; | 120 | struct rt_mutex_waiter *rt_waiter; |
| 117 | |||
| 118 | /* The expected requeue pi target futex key: */ | ||
| 119 | union futex_key *requeue_pi_key; | 121 | union futex_key *requeue_pi_key; |
| 120 | |||
| 121 | /* Bitset for the optional bitmasked wakeup */ | ||
| 122 | u32 bitset; | 122 | u32 bitset; |
| 123 | }; | 123 | }; |
| 124 | 124 | ||
| @@ -198,11 +198,12 @@ static void drop_futex_key_refs(union futex_key *key) | |||
| 198 | } | 198 | } |
| 199 | 199 | ||
| 200 | /** | 200 | /** |
| 201 | * get_futex_key - Get parameters which are the keys for a futex. | 201 | * get_futex_key() - Get parameters which are the keys for a futex |
| 202 | * @uaddr: virtual address of the futex | 202 | * @uaddr: virtual address of the futex |
| 203 | * @fshared: 0 for a PROCESS_PRIVATE futex, 1 for PROCESS_SHARED | 203 | * @fshared: 0 for a PROCESS_PRIVATE futex, 1 for PROCESS_SHARED |
| 204 | * @key: address where result is stored. | 204 | * @key: address where result is stored. |
| 205 | * @rw: mapping needs to be read/write (values: VERIFY_READ, VERIFY_WRITE) | 205 | * @rw: mapping needs to be read/write (values: VERIFY_READ, |
| 206 | * VERIFY_WRITE) | ||
| 206 | * | 207 | * |
| 207 | * Returns a negative error code or 0 | 208 | * Returns a negative error code or 0 |
| 208 | * The key words are stored in *key on success. | 209 | * The key words are stored in *key on success. |
| @@ -288,8 +289,8 @@ void put_futex_key(int fshared, union futex_key *key) | |||
| 288 | drop_futex_key_refs(key); | 289 | drop_futex_key_refs(key); |
| 289 | } | 290 | } |
| 290 | 291 | ||
| 291 | /* | 292 | /** |
| 292 | * fault_in_user_writeable - fault in user address and verify RW access | 293 | * fault_in_user_writeable() - Fault in user address and verify RW access |
| 293 | * @uaddr: pointer to faulting user space address | 294 | * @uaddr: pointer to faulting user space address |
| 294 | * | 295 | * |
| 295 | * Slow path to fixup the fault we just took in the atomic write | 296 | * Slow path to fixup the fault we just took in the atomic write |
| @@ -309,8 +310,8 @@ static int fault_in_user_writeable(u32 __user *uaddr) | |||
| 309 | 310 | ||
| 310 | /** | 311 | /** |
| 311 | * futex_top_waiter() - Return the highest priority waiter on a futex | 312 | * futex_top_waiter() - Return the highest priority waiter on a futex |
| 312 | * @hb: the hash bucket the futex_q's reside in | 313 | * @hb: the hash bucket the futex_q's reside in |
| 313 | * @key: the futex key (to distinguish it from other futex futex_q's) | 314 | * @key: the futex key (to distinguish it from other futex futex_q's) |
| 314 | * | 315 | * |
| 315 | * Must be called with the hb lock held. | 316 | * Must be called with the hb lock held. |
| 316 | */ | 317 | */ |
| @@ -588,7 +589,7 @@ lookup_pi_state(u32 uval, struct futex_hash_bucket *hb, | |||
| 588 | } | 589 | } |
| 589 | 590 | ||
| 590 | /** | 591 | /** |
| 591 | * futex_lock_pi_atomic() - atomic work required to acquire a pi aware futex | 592 | * futex_lock_pi_atomic() - Atomic work required to acquire a pi aware futex |
| 592 | * @uaddr: the pi futex user address | 593 | * @uaddr: the pi futex user address |
| 593 | * @hb: the pi futex hash bucket | 594 | * @hb: the pi futex hash bucket |
| 594 | * @key: the futex key associated with uaddr and hb | 595 | * @key: the futex key associated with uaddr and hb |
| @@ -915,8 +916,8 @@ retry: | |||
| 915 | hb1 = hash_futex(&key1); | 916 | hb1 = hash_futex(&key1); |
| 916 | hb2 = hash_futex(&key2); | 917 | hb2 = hash_futex(&key2); |
| 917 | 918 | ||
| 918 | double_lock_hb(hb1, hb2); | ||
| 919 | retry_private: | 919 | retry_private: |
| 920 | double_lock_hb(hb1, hb2); | ||
| 920 | op_ret = futex_atomic_op_inuser(op, uaddr2); | 921 | op_ret = futex_atomic_op_inuser(op, uaddr2); |
| 921 | if (unlikely(op_ret < 0)) { | 922 | if (unlikely(op_ret < 0)) { |
| 922 | 923 | ||
| @@ -1011,9 +1012,9 @@ void requeue_futex(struct futex_q *q, struct futex_hash_bucket *hb1, | |||
| 1011 | 1012 | ||
| 1012 | /** | 1013 | /** |
| 1013 | * requeue_pi_wake_futex() - Wake a task that acquired the lock during requeue | 1014 | * requeue_pi_wake_futex() - Wake a task that acquired the lock during requeue |
| 1014 | * q: the futex_q | 1015 | * @q: the futex_q |
| 1015 | * key: the key of the requeue target futex | 1016 | * @key: the key of the requeue target futex |
| 1016 | * hb: the hash_bucket of the requeue target futex | 1017 | * @hb: the hash_bucket of the requeue target futex |
| 1017 | * | 1018 | * |
| 1018 | * During futex_requeue, with requeue_pi=1, it is possible to acquire the | 1019 | * During futex_requeue, with requeue_pi=1, it is possible to acquire the |
| 1019 | * target futex if it is uncontended or via a lock steal. Set the futex_q key | 1020 | * target futex if it is uncontended or via a lock steal. Set the futex_q key |
| @@ -1350,6 +1351,25 @@ static inline struct futex_hash_bucket *queue_lock(struct futex_q *q) | |||
| 1350 | return hb; | 1351 | return hb; |
| 1351 | } | 1352 | } |
| 1352 | 1353 | ||
| 1354 | static inline void | ||
| 1355 | queue_unlock(struct futex_q *q, struct futex_hash_bucket *hb) | ||
| 1356 | { | ||
| 1357 | spin_unlock(&hb->lock); | ||
| 1358 | drop_futex_key_refs(&q->key); | ||
| 1359 | } | ||
| 1360 | |||
| 1361 | /** | ||
| 1362 | * queue_me() - Enqueue the futex_q on the futex_hash_bucket | ||
| 1363 | * @q: The futex_q to enqueue | ||
| 1364 | * @hb: The destination hash bucket | ||
| 1365 | * | ||
| 1366 | * The hb->lock must be held by the caller, and is released here. A call to | ||
| 1367 | * queue_me() is typically paired with exactly one call to unqueue_me(). The | ||
| 1368 | * exceptions involve the PI related operations, which may use unqueue_me_pi() | ||
| 1369 | * or nothing if the unqueue is done as part of the wake process and the unqueue | ||
| 1370 | * state is implicit in the state of woken task (see futex_wait_requeue_pi() for | ||
| 1371 | * an example). | ||
| 1372 | */ | ||
| 1353 | static inline void queue_me(struct futex_q *q, struct futex_hash_bucket *hb) | 1373 | static inline void queue_me(struct futex_q *q, struct futex_hash_bucket *hb) |
| 1354 | { | 1374 | { |
| 1355 | int prio; | 1375 | int prio; |
| @@ -1373,19 +1393,17 @@ static inline void queue_me(struct futex_q *q, struct futex_hash_bucket *hb) | |||
| 1373 | spin_unlock(&hb->lock); | 1393 | spin_unlock(&hb->lock); |
| 1374 | } | 1394 | } |
| 1375 | 1395 | ||
| 1376 | static inline void | 1396 | /** |
| 1377 | queue_unlock(struct futex_q *q, struct futex_hash_bucket *hb) | 1397 | * unqueue_me() - Remove the futex_q from its futex_hash_bucket |
| 1378 | { | 1398 | * @q: The futex_q to unqueue |
| 1379 | spin_unlock(&hb->lock); | 1399 | * |
| 1380 | drop_futex_key_refs(&q->key); | 1400 | * The q->lock_ptr must not be held by the caller. A call to unqueue_me() must |
| 1381 | } | 1401 | * be paired with exactly one earlier call to queue_me(). |
| 1382 | 1402 | * | |
| 1383 | /* | 1403 | * Returns: |
| 1384 | * queue_me and unqueue_me must be called as a pair, each | 1404 | * 1 - if the futex_q was still queued (and we removed unqueued it) |
| 1385 | * exactly once. They are called with the hashed spinlock held. | 1405 | * 0 - if the futex_q was already removed by the waking thread |
| 1386 | */ | 1406 | */ |
| 1387 | |||
| 1388 | /* Return 1 if we were still queued (ie. 0 means we were woken) */ | ||
| 1389 | static int unqueue_me(struct futex_q *q) | 1407 | static int unqueue_me(struct futex_q *q) |
| 1390 | { | 1408 | { |
| 1391 | spinlock_t *lock_ptr; | 1409 | spinlock_t *lock_ptr; |
| @@ -1638,17 +1656,14 @@ out: | |||
| 1638 | static void futex_wait_queue_me(struct futex_hash_bucket *hb, struct futex_q *q, | 1656 | static void futex_wait_queue_me(struct futex_hash_bucket *hb, struct futex_q *q, |
| 1639 | struct hrtimer_sleeper *timeout) | 1657 | struct hrtimer_sleeper *timeout) |
| 1640 | { | 1658 | { |
| 1641 | queue_me(q, hb); | ||
| 1642 | |||
| 1643 | /* | 1659 | /* |
| 1644 | * There might have been scheduling since the queue_me(), as we | 1660 | * The task state is guaranteed to be set before another task can |
| 1645 | * cannot hold a spinlock across the get_user() in case it | 1661 | * wake it. set_current_state() is implemented using set_mb() and |
| 1646 | * faults, and we cannot just set TASK_INTERRUPTIBLE state when | 1662 | * queue_me() calls spin_unlock() upon completion, both serializing |
| 1647 | * queueing ourselves into the futex hash. This code thus has to | 1663 | * access to the hash list and forcing another memory barrier. |
| 1648 | * rely on the futex_wake() code removing us from hash when it | ||
| 1649 | * wakes us up. | ||
| 1650 | */ | 1664 | */ |
| 1651 | set_current_state(TASK_INTERRUPTIBLE); | 1665 | set_current_state(TASK_INTERRUPTIBLE); |
| 1666 | queue_me(q, hb); | ||
| 1652 | 1667 | ||
| 1653 | /* Arm the timer */ | 1668 | /* Arm the timer */ |
| 1654 | if (timeout) { | 1669 | if (timeout) { |
| @@ -1658,8 +1673,8 @@ static void futex_wait_queue_me(struct futex_hash_bucket *hb, struct futex_q *q, | |||
| 1658 | } | 1673 | } |
| 1659 | 1674 | ||
| 1660 | /* | 1675 | /* |
| 1661 | * !plist_node_empty() is safe here without any lock. | 1676 | * If we have been removed from the hash list, then another task |
| 1662 | * q.lock_ptr != 0 is not safe, because of ordering against wakeup. | 1677 | * has tried to wake us, and we can skip the call to schedule(). |
| 1663 | */ | 1678 | */ |
| 1664 | if (likely(!plist_node_empty(&q->list))) { | 1679 | if (likely(!plist_node_empty(&q->list))) { |
| 1665 | /* | 1680 | /* |
| @@ -2102,7 +2117,6 @@ int handle_early_requeue_pi_wakeup(struct futex_hash_bucket *hb, | |||
| 2102 | * Unqueue the futex_q and determine which it was. | 2117 | * Unqueue the futex_q and determine which it was. |
| 2103 | */ | 2118 | */ |
| 2104 | plist_del(&q->list, &q->list.plist); | 2119 | plist_del(&q->list, &q->list.plist); |
| 2105 | drop_futex_key_refs(&q->key); | ||
| 2106 | 2120 | ||
| 2107 | if (timeout && !timeout->task) | 2121 | if (timeout && !timeout->task) |
| 2108 | ret = -ETIMEDOUT; | 2122 | ret = -ETIMEDOUT; |
| @@ -2114,12 +2128,12 @@ int handle_early_requeue_pi_wakeup(struct futex_hash_bucket *hb, | |||
| 2114 | 2128 | ||
| 2115 | /** | 2129 | /** |
| 2116 | * futex_wait_requeue_pi() - Wait on uaddr and take uaddr2 | 2130 | * futex_wait_requeue_pi() - Wait on uaddr and take uaddr2 |
| 2117 | * @uaddr: the futex we initialyl wait on (non-pi) | 2131 | * @uaddr: the futex we initially wait on (non-pi) |
| 2118 | * @fshared: whether the futexes are shared (1) or not (0). They must be | 2132 | * @fshared: whether the futexes are shared (1) or not (0). They must be |
| 2119 | * the same type, no requeueing from private to shared, etc. | 2133 | * the same type, no requeueing from private to shared, etc. |
| 2120 | * @val: the expected value of uaddr | 2134 | * @val: the expected value of uaddr |
| 2121 | * @abs_time: absolute timeout | 2135 | * @abs_time: absolute timeout |
| 2122 | * @bitset: 32 bit wakeup bitset set by userspace, defaults to all. | 2136 | * @bitset: 32 bit wakeup bitset set by userspace, defaults to all |
| 2123 | * @clockrt: whether to use CLOCK_REALTIME (1) or CLOCK_MONOTONIC (0) | 2137 | * @clockrt: whether to use CLOCK_REALTIME (1) or CLOCK_MONOTONIC (0) |
| 2124 | * @uaddr2: the pi futex we will take prior to returning to user-space | 2138 | * @uaddr2: the pi futex we will take prior to returning to user-space |
| 2125 | * | 2139 | * |
| @@ -2246,7 +2260,7 @@ static int futex_wait_requeue_pi(u32 __user *uaddr, int fshared, | |||
| 2246 | res = fixup_owner(uaddr2, fshared, &q, !ret); | 2260 | res = fixup_owner(uaddr2, fshared, &q, !ret); |
| 2247 | /* | 2261 | /* |
| 2248 | * If fixup_owner() returned an error, proprogate that. If it | 2262 | * If fixup_owner() returned an error, proprogate that. If it |
| 2249 | * acquired the lock, clear our -ETIMEDOUT or -EINTR. | 2263 | * acquired the lock, clear -ETIMEDOUT or -EINTR. |
| 2250 | */ | 2264 | */ |
| 2251 | if (res) | 2265 | if (res) |
| 2252 | ret = (res < 0) ? res : 0; | 2266 | ret = (res < 0) ? res : 0; |
| @@ -2302,9 +2316,9 @@ out: | |||
| 2302 | */ | 2316 | */ |
| 2303 | 2317 | ||
| 2304 | /** | 2318 | /** |
| 2305 | * sys_set_robust_list - set the robust-futex list head of a task | 2319 | * sys_set_robust_list() - Set the robust-futex list head of a task |
| 2306 | * @head: pointer to the list-head | 2320 | * @head: pointer to the list-head |
| 2307 | * @len: length of the list-head, as userspace expects | 2321 | * @len: length of the list-head, as userspace expects |
| 2308 | */ | 2322 | */ |
| 2309 | SYSCALL_DEFINE2(set_robust_list, struct robust_list_head __user *, head, | 2323 | SYSCALL_DEFINE2(set_robust_list, struct robust_list_head __user *, head, |
| 2310 | size_t, len) | 2324 | size_t, len) |
| @@ -2323,10 +2337,10 @@ SYSCALL_DEFINE2(set_robust_list, struct robust_list_head __user *, head, | |||
| 2323 | } | 2337 | } |
| 2324 | 2338 | ||
| 2325 | /** | 2339 | /** |
| 2326 | * sys_get_robust_list - get the robust-futex list head of a task | 2340 | * sys_get_robust_list() - Get the robust-futex list head of a task |
| 2327 | * @pid: pid of the process [zero for current task] | 2341 | * @pid: pid of the process [zero for current task] |
| 2328 | * @head_ptr: pointer to a list-head pointer, the kernel fills it in | 2342 | * @head_ptr: pointer to a list-head pointer, the kernel fills it in |
| 2329 | * @len_ptr: pointer to a length field, the kernel fills in the header size | 2343 | * @len_ptr: pointer to a length field, the kernel fills in the header size |
| 2330 | */ | 2344 | */ |
| 2331 | SYSCALL_DEFINE3(get_robust_list, int, pid, | 2345 | SYSCALL_DEFINE3(get_robust_list, int, pid, |
| 2332 | struct robust_list_head __user * __user *, head_ptr, | 2346 | struct robust_list_head __user * __user *, head_ptr, |
diff --git a/kernel/gcov/Kconfig b/kernel/gcov/Kconfig index 654efd09f6a9..70a298d6da71 100644 --- a/kernel/gcov/Kconfig +++ b/kernel/gcov/Kconfig | |||
| @@ -34,7 +34,7 @@ config GCOV_KERNEL | |||
| 34 | config GCOV_PROFILE_ALL | 34 | config GCOV_PROFILE_ALL |
| 35 | bool "Profile entire Kernel" | 35 | bool "Profile entire Kernel" |
| 36 | depends on GCOV_KERNEL | 36 | depends on GCOV_KERNEL |
| 37 | depends on S390 || X86 || (PPC && EXPERIMENTAL) | 37 | depends on S390 || X86 || (PPC && EXPERIMENTAL) || MICROBLAZE |
| 38 | default n | 38 | default n |
| 39 | ---help--- | 39 | ---help--- |
| 40 | This options activates profiling for the entire kernel. | 40 | This options activates profiling for the entire kernel. |
diff --git a/kernel/hrtimer.c b/kernel/hrtimer.c index c03f221fee44..3e1c36e7998f 100644 --- a/kernel/hrtimer.c +++ b/kernel/hrtimer.c | |||
| @@ -48,6 +48,8 @@ | |||
| 48 | 48 | ||
| 49 | #include <asm/uaccess.h> | 49 | #include <asm/uaccess.h> |
| 50 | 50 | ||
| 51 | #include <trace/events/timer.h> | ||
| 52 | |||
| 51 | /* | 53 | /* |
| 52 | * The timer bases: | 54 | * The timer bases: |
| 53 | * | 55 | * |
| @@ -442,6 +444,26 @@ static inline void debug_hrtimer_activate(struct hrtimer *timer) { } | |||
| 442 | static inline void debug_hrtimer_deactivate(struct hrtimer *timer) { } | 444 | static inline void debug_hrtimer_deactivate(struct hrtimer *timer) { } |
| 443 | #endif | 445 | #endif |
| 444 | 446 | ||
| 447 | static inline void | ||
| 448 | debug_init(struct hrtimer *timer, clockid_t clockid, | ||
| 449 | enum hrtimer_mode mode) | ||
| 450 | { | ||
| 451 | debug_hrtimer_init(timer); | ||
| 452 | trace_hrtimer_init(timer, clockid, mode); | ||
| 453 | } | ||
| 454 | |||
| 455 | static inline void debug_activate(struct hrtimer *timer) | ||
| 456 | { | ||
| 457 | debug_hrtimer_activate(timer); | ||
| 458 | trace_hrtimer_start(timer); | ||
| 459 | } | ||
| 460 | |||
| 461 | static inline void debug_deactivate(struct hrtimer *timer) | ||
| 462 | { | ||
| 463 | debug_hrtimer_deactivate(timer); | ||
| 464 | trace_hrtimer_cancel(timer); | ||
| 465 | } | ||
| 466 | |||
| 445 | /* High resolution timer related functions */ | 467 | /* High resolution timer related functions */ |
| 446 | #ifdef CONFIG_HIGH_RES_TIMERS | 468 | #ifdef CONFIG_HIGH_RES_TIMERS |
| 447 | 469 | ||
| @@ -487,13 +509,14 @@ static inline int hrtimer_hres_active(void) | |||
| 487 | * next event | 509 | * next event |
| 488 | * Called with interrupts disabled and base->lock held | 510 | * Called with interrupts disabled and base->lock held |
| 489 | */ | 511 | */ |
| 490 | static void hrtimer_force_reprogram(struct hrtimer_cpu_base *cpu_base) | 512 | static void |
| 513 | hrtimer_force_reprogram(struct hrtimer_cpu_base *cpu_base, int skip_equal) | ||
| 491 | { | 514 | { |
| 492 | int i; | 515 | int i; |
| 493 | struct hrtimer_clock_base *base = cpu_base->clock_base; | 516 | struct hrtimer_clock_base *base = cpu_base->clock_base; |
| 494 | ktime_t expires; | 517 | ktime_t expires, expires_next; |
| 495 | 518 | ||
| 496 | cpu_base->expires_next.tv64 = KTIME_MAX; | 519 | expires_next.tv64 = KTIME_MAX; |
| 497 | 520 | ||
| 498 | for (i = 0; i < HRTIMER_MAX_CLOCK_BASES; i++, base++) { | 521 | for (i = 0; i < HRTIMER_MAX_CLOCK_BASES; i++, base++) { |
| 499 | struct hrtimer *timer; | 522 | struct hrtimer *timer; |
| @@ -509,10 +532,15 @@ static void hrtimer_force_reprogram(struct hrtimer_cpu_base *cpu_base) | |||
| 509 | */ | 532 | */ |
| 510 | if (expires.tv64 < 0) | 533 | if (expires.tv64 < 0) |
| 511 | expires.tv64 = 0; | 534 | expires.tv64 = 0; |
| 512 | if (expires.tv64 < cpu_base->expires_next.tv64) | 535 | if (expires.tv64 < expires_next.tv64) |
| 513 | cpu_base->expires_next = expires; | 536 | expires_next = expires; |
| 514 | } | 537 | } |
| 515 | 538 | ||
| 539 | if (skip_equal && expires_next.tv64 == cpu_base->expires_next.tv64) | ||
| 540 | return; | ||
| 541 | |||
| 542 | cpu_base->expires_next.tv64 = expires_next.tv64; | ||
| 543 | |||
| 516 | if (cpu_base->expires_next.tv64 != KTIME_MAX) | 544 | if (cpu_base->expires_next.tv64 != KTIME_MAX) |
| 517 | tick_program_event(cpu_base->expires_next, 1); | 545 | tick_program_event(cpu_base->expires_next, 1); |
| 518 | } | 546 | } |
| @@ -595,7 +623,7 @@ static void retrigger_next_event(void *arg) | |||
| 595 | base->clock_base[CLOCK_REALTIME].offset = | 623 | base->clock_base[CLOCK_REALTIME].offset = |
| 596 | timespec_to_ktime(realtime_offset); | 624 | timespec_to_ktime(realtime_offset); |
| 597 | 625 | ||
| 598 | hrtimer_force_reprogram(base); | 626 | hrtimer_force_reprogram(base, 0); |
| 599 | spin_unlock(&base->lock); | 627 | spin_unlock(&base->lock); |
| 600 | } | 628 | } |
| 601 | 629 | ||
| @@ -698,8 +726,6 @@ static int hrtimer_switch_to_hres(void) | |||
| 698 | /* "Retrigger" the interrupt to get things going */ | 726 | /* "Retrigger" the interrupt to get things going */ |
| 699 | retrigger_next_event(NULL); | 727 | retrigger_next_event(NULL); |
| 700 | local_irq_restore(flags); | 728 | local_irq_restore(flags); |
| 701 | printk(KERN_DEBUG "Switched to high resolution mode on CPU %d\n", | ||
| 702 | smp_processor_id()); | ||
| 703 | return 1; | 729 | return 1; |
| 704 | } | 730 | } |
| 705 | 731 | ||
| @@ -708,7 +734,8 @@ static int hrtimer_switch_to_hres(void) | |||
| 708 | static inline int hrtimer_hres_active(void) { return 0; } | 734 | static inline int hrtimer_hres_active(void) { return 0; } |
| 709 | static inline int hrtimer_is_hres_enabled(void) { return 0; } | 735 | static inline int hrtimer_is_hres_enabled(void) { return 0; } |
| 710 | static inline int hrtimer_switch_to_hres(void) { return 0; } | 736 | static inline int hrtimer_switch_to_hres(void) { return 0; } |
| 711 | static inline void hrtimer_force_reprogram(struct hrtimer_cpu_base *base) { } | 737 | static inline void |
| 738 | hrtimer_force_reprogram(struct hrtimer_cpu_base *base, int skip_equal) { } | ||
| 712 | static inline int hrtimer_enqueue_reprogram(struct hrtimer *timer, | 739 | static inline int hrtimer_enqueue_reprogram(struct hrtimer *timer, |
| 713 | struct hrtimer_clock_base *base, | 740 | struct hrtimer_clock_base *base, |
| 714 | int wakeup) | 741 | int wakeup) |
| @@ -798,7 +825,7 @@ static int enqueue_hrtimer(struct hrtimer *timer, | |||
| 798 | struct hrtimer *entry; | 825 | struct hrtimer *entry; |
| 799 | int leftmost = 1; | 826 | int leftmost = 1; |
| 800 | 827 | ||
| 801 | debug_hrtimer_activate(timer); | 828 | debug_activate(timer); |
| 802 | 829 | ||
| 803 | /* | 830 | /* |
| 804 | * Find the right place in the rbtree: | 831 | * Find the right place in the rbtree: |
| @@ -851,19 +878,29 @@ static void __remove_hrtimer(struct hrtimer *timer, | |||
| 851 | struct hrtimer_clock_base *base, | 878 | struct hrtimer_clock_base *base, |
| 852 | unsigned long newstate, int reprogram) | 879 | unsigned long newstate, int reprogram) |
| 853 | { | 880 | { |
| 854 | if (timer->state & HRTIMER_STATE_ENQUEUED) { | 881 | if (!(timer->state & HRTIMER_STATE_ENQUEUED)) |
| 855 | /* | 882 | goto out; |
| 856 | * Remove the timer from the rbtree and replace the | 883 | |
| 857 | * first entry pointer if necessary. | 884 | /* |
| 858 | */ | 885 | * Remove the timer from the rbtree and replace the first |
| 859 | if (base->first == &timer->node) { | 886 | * entry pointer if necessary. |
| 860 | base->first = rb_next(&timer->node); | 887 | */ |
| 861 | /* Reprogram the clock event device. if enabled */ | 888 | if (base->first == &timer->node) { |
| 862 | if (reprogram && hrtimer_hres_active()) | 889 | base->first = rb_next(&timer->node); |
| 863 | hrtimer_force_reprogram(base->cpu_base); | 890 | #ifdef CONFIG_HIGH_RES_TIMERS |
| 891 | /* Reprogram the clock event device. if enabled */ | ||
| 892 | if (reprogram && hrtimer_hres_active()) { | ||
| 893 | ktime_t expires; | ||
| 894 | |||
| 895 | expires = ktime_sub(hrtimer_get_expires(timer), | ||
| 896 | base->offset); | ||
| 897 | if (base->cpu_base->expires_next.tv64 == expires.tv64) | ||
| 898 | hrtimer_force_reprogram(base->cpu_base, 1); | ||
| 864 | } | 899 | } |
| 865 | rb_erase(&timer->node, &base->active); | 900 | #endif |
| 866 | } | 901 | } |
| 902 | rb_erase(&timer->node, &base->active); | ||
| 903 | out: | ||
| 867 | timer->state = newstate; | 904 | timer->state = newstate; |
| 868 | } | 905 | } |
| 869 | 906 | ||
| @@ -884,7 +921,7 @@ remove_hrtimer(struct hrtimer *timer, struct hrtimer_clock_base *base) | |||
| 884 | * reprogramming happens in the interrupt handler. This is a | 921 | * reprogramming happens in the interrupt handler. This is a |
| 885 | * rare case and less expensive than a smp call. | 922 | * rare case and less expensive than a smp call. |
| 886 | */ | 923 | */ |
| 887 | debug_hrtimer_deactivate(timer); | 924 | debug_deactivate(timer); |
| 888 | timer_stats_hrtimer_clear_start_info(timer); | 925 | timer_stats_hrtimer_clear_start_info(timer); |
| 889 | reprogram = base->cpu_base == &__get_cpu_var(hrtimer_bases); | 926 | reprogram = base->cpu_base == &__get_cpu_var(hrtimer_bases); |
| 890 | __remove_hrtimer(timer, base, HRTIMER_STATE_INACTIVE, | 927 | __remove_hrtimer(timer, base, HRTIMER_STATE_INACTIVE, |
| @@ -1117,7 +1154,7 @@ static void __hrtimer_init(struct hrtimer *timer, clockid_t clock_id, | |||
| 1117 | void hrtimer_init(struct hrtimer *timer, clockid_t clock_id, | 1154 | void hrtimer_init(struct hrtimer *timer, clockid_t clock_id, |
| 1118 | enum hrtimer_mode mode) | 1155 | enum hrtimer_mode mode) |
| 1119 | { | 1156 | { |
| 1120 | debug_hrtimer_init(timer); | 1157 | debug_init(timer, clock_id, mode); |
| 1121 | __hrtimer_init(timer, clock_id, mode); | 1158 | __hrtimer_init(timer, clock_id, mode); |
| 1122 | } | 1159 | } |
| 1123 | EXPORT_SYMBOL_GPL(hrtimer_init); | 1160 | EXPORT_SYMBOL_GPL(hrtimer_init); |
| @@ -1141,7 +1178,7 @@ int hrtimer_get_res(const clockid_t which_clock, struct timespec *tp) | |||
| 1141 | } | 1178 | } |
| 1142 | EXPORT_SYMBOL_GPL(hrtimer_get_res); | 1179 | EXPORT_SYMBOL_GPL(hrtimer_get_res); |
| 1143 | 1180 | ||
| 1144 | static void __run_hrtimer(struct hrtimer *timer) | 1181 | static void __run_hrtimer(struct hrtimer *timer, ktime_t *now) |
| 1145 | { | 1182 | { |
| 1146 | struct hrtimer_clock_base *base = timer->base; | 1183 | struct hrtimer_clock_base *base = timer->base; |
| 1147 | struct hrtimer_cpu_base *cpu_base = base->cpu_base; | 1184 | struct hrtimer_cpu_base *cpu_base = base->cpu_base; |
| @@ -1150,7 +1187,7 @@ static void __run_hrtimer(struct hrtimer *timer) | |||
| 1150 | 1187 | ||
| 1151 | WARN_ON(!irqs_disabled()); | 1188 | WARN_ON(!irqs_disabled()); |
| 1152 | 1189 | ||
| 1153 | debug_hrtimer_deactivate(timer); | 1190 | debug_deactivate(timer); |
| 1154 | __remove_hrtimer(timer, base, HRTIMER_STATE_CALLBACK, 0); | 1191 | __remove_hrtimer(timer, base, HRTIMER_STATE_CALLBACK, 0); |
| 1155 | timer_stats_account_hrtimer(timer); | 1192 | timer_stats_account_hrtimer(timer); |
| 1156 | fn = timer->function; | 1193 | fn = timer->function; |
| @@ -1161,7 +1198,9 @@ static void __run_hrtimer(struct hrtimer *timer) | |||
| 1161 | * the timer base. | 1198 | * the timer base. |
| 1162 | */ | 1199 | */ |
| 1163 | spin_unlock(&cpu_base->lock); | 1200 | spin_unlock(&cpu_base->lock); |
| 1201 | trace_hrtimer_expire_entry(timer, now); | ||
| 1164 | restart = fn(timer); | 1202 | restart = fn(timer); |
| 1203 | trace_hrtimer_expire_exit(timer); | ||
| 1165 | spin_lock(&cpu_base->lock); | 1204 | spin_lock(&cpu_base->lock); |
| 1166 | 1205 | ||
| 1167 | /* | 1206 | /* |
| @@ -1272,7 +1311,7 @@ void hrtimer_interrupt(struct clock_event_device *dev) | |||
| 1272 | break; | 1311 | break; |
| 1273 | } | 1312 | } |
| 1274 | 1313 | ||
| 1275 | __run_hrtimer(timer); | 1314 | __run_hrtimer(timer, &basenow); |
| 1276 | } | 1315 | } |
| 1277 | base++; | 1316 | base++; |
| 1278 | } | 1317 | } |
| @@ -1394,7 +1433,7 @@ void hrtimer_run_queues(void) | |||
| 1394 | hrtimer_get_expires_tv64(timer)) | 1433 | hrtimer_get_expires_tv64(timer)) |
| 1395 | break; | 1434 | break; |
| 1396 | 1435 | ||
| 1397 | __run_hrtimer(timer); | 1436 | __run_hrtimer(timer, &base->softirq_time); |
| 1398 | } | 1437 | } |
| 1399 | spin_unlock(&cpu_base->lock); | 1438 | spin_unlock(&cpu_base->lock); |
| 1400 | } | 1439 | } |
| @@ -1571,7 +1610,7 @@ static void migrate_hrtimer_list(struct hrtimer_clock_base *old_base, | |||
| 1571 | while ((node = rb_first(&old_base->active))) { | 1610 | while ((node = rb_first(&old_base->active))) { |
| 1572 | timer = rb_entry(node, struct hrtimer, node); | 1611 | timer = rb_entry(node, struct hrtimer, node); |
| 1573 | BUG_ON(hrtimer_callback_running(timer)); | 1612 | BUG_ON(hrtimer_callback_running(timer)); |
| 1574 | debug_hrtimer_deactivate(timer); | 1613 | debug_deactivate(timer); |
| 1575 | 1614 | ||
| 1576 | /* | 1615 | /* |
| 1577 | * Mark it as STATE_MIGRATE not INACTIVE otherwise the | 1616 | * Mark it as STATE_MIGRATE not INACTIVE otherwise the |
diff --git a/kernel/hung_task.c b/kernel/hung_task.c index 022a4927b785..d4e841747400 100644 --- a/kernel/hung_task.c +++ b/kernel/hung_task.c | |||
| @@ -171,12 +171,12 @@ static unsigned long timeout_jiffies(unsigned long timeout) | |||
| 171 | * Process updating of timeout sysctl | 171 | * Process updating of timeout sysctl |
| 172 | */ | 172 | */ |
| 173 | int proc_dohung_task_timeout_secs(struct ctl_table *table, int write, | 173 | int proc_dohung_task_timeout_secs(struct ctl_table *table, int write, |
| 174 | struct file *filp, void __user *buffer, | 174 | void __user *buffer, |
| 175 | size_t *lenp, loff_t *ppos) | 175 | size_t *lenp, loff_t *ppos) |
| 176 | { | 176 | { |
| 177 | int ret; | 177 | int ret; |
| 178 | 178 | ||
| 179 | ret = proc_doulongvec_minmax(table, write, filp, buffer, lenp, ppos); | 179 | ret = proc_doulongvec_minmax(table, write, buffer, lenp, ppos); |
| 180 | 180 | ||
| 181 | if (ret || !write) | 181 | if (ret || !write) |
| 182 | goto out; | 182 | goto out; |
diff --git a/kernel/irq/handle.c b/kernel/irq/handle.c index a81cf80554db..17c71bb565c6 100644 --- a/kernel/irq/handle.c +++ b/kernel/irq/handle.c | |||
| @@ -11,6 +11,7 @@ | |||
| 11 | */ | 11 | */ |
| 12 | 12 | ||
| 13 | #include <linux/irq.h> | 13 | #include <linux/irq.h> |
| 14 | #include <linux/sched.h> | ||
| 14 | #include <linux/slab.h> | 15 | #include <linux/slab.h> |
| 15 | #include <linux/module.h> | 16 | #include <linux/module.h> |
| 16 | #include <linux/random.h> | 17 | #include <linux/random.h> |
diff --git a/kernel/itimer.c b/kernel/itimer.c index 58762f7077ec..b03451ede528 100644 --- a/kernel/itimer.c +++ b/kernel/itimer.c | |||
| @@ -12,6 +12,7 @@ | |||
| 12 | #include <linux/time.h> | 12 | #include <linux/time.h> |
| 13 | #include <linux/posix-timers.h> | 13 | #include <linux/posix-timers.h> |
| 14 | #include <linux/hrtimer.h> | 14 | #include <linux/hrtimer.h> |
| 15 | #include <trace/events/timer.h> | ||
| 15 | 16 | ||
| 16 | #include <asm/uaccess.h> | 17 | #include <asm/uaccess.h> |
| 17 | 18 | ||
| @@ -41,10 +42,43 @@ static struct timeval itimer_get_remtime(struct hrtimer *timer) | |||
| 41 | return ktime_to_timeval(rem); | 42 | return ktime_to_timeval(rem); |
| 42 | } | 43 | } |
| 43 | 44 | ||
| 45 | static void get_cpu_itimer(struct task_struct *tsk, unsigned int clock_id, | ||
| 46 | struct itimerval *const value) | ||
| 47 | { | ||
| 48 | cputime_t cval, cinterval; | ||
| 49 | struct cpu_itimer *it = &tsk->signal->it[clock_id]; | ||
| 50 | |||
| 51 | spin_lock_irq(&tsk->sighand->siglock); | ||
| 52 | |||
| 53 | cval = it->expires; | ||
| 54 | cinterval = it->incr; | ||
| 55 | if (!cputime_eq(cval, cputime_zero)) { | ||
| 56 | struct task_cputime cputime; | ||
| 57 | cputime_t t; | ||
| 58 | |||
| 59 | thread_group_cputimer(tsk, &cputime); | ||
| 60 | if (clock_id == CPUCLOCK_PROF) | ||
| 61 | t = cputime_add(cputime.utime, cputime.stime); | ||
| 62 | else | ||
| 63 | /* CPUCLOCK_VIRT */ | ||
| 64 | t = cputime.utime; | ||
| 65 | |||
| 66 | if (cputime_le(cval, t)) | ||
| 67 | /* about to fire */ | ||
| 68 | cval = cputime_one_jiffy; | ||
| 69 | else | ||
| 70 | cval = cputime_sub(cval, t); | ||
| 71 | } | ||
| 72 | |||
| 73 | spin_unlock_irq(&tsk->sighand->siglock); | ||
| 74 | |||
| 75 | cputime_to_timeval(cval, &value->it_value); | ||
| 76 | cputime_to_timeval(cinterval, &value->it_interval); | ||
| 77 | } | ||
| 78 | |||
| 44 | int do_getitimer(int which, struct itimerval *value) | 79 | int do_getitimer(int which, struct itimerval *value) |
| 45 | { | 80 | { |
| 46 | struct task_struct *tsk = current; | 81 | struct task_struct *tsk = current; |
| 47 | cputime_t cinterval, cval; | ||
| 48 | 82 | ||
| 49 | switch (which) { | 83 | switch (which) { |
| 50 | case ITIMER_REAL: | 84 | case ITIMER_REAL: |
| @@ -55,44 +89,10 @@ int do_getitimer(int which, struct itimerval *value) | |||
| 55 | spin_unlock_irq(&tsk->sighand->siglock); | 89 | spin_unlock_irq(&tsk->sighand->siglock); |
| 56 | break; | 90 | break; |
| 57 | case ITIMER_VIRTUAL: | 91 | case ITIMER_VIRTUAL: |
| 58 | spin_lock_irq(&tsk->sighand->siglock); | 92 | get_cpu_itimer(tsk, CPUCLOCK_VIRT, value); |
| 59 | cval = tsk->signal->it_virt_expires; | ||
| 60 | cinterval = tsk->signal->it_virt_incr; | ||
| 61 | if (!cputime_eq(cval, cputime_zero)) { | ||
| 62 | struct task_cputime cputime; | ||
| 63 | cputime_t utime; | ||
| 64 | |||
| 65 | thread_group_cputimer(tsk, &cputime); | ||
| 66 | utime = cputime.utime; | ||
| 67 | if (cputime_le(cval, utime)) { /* about to fire */ | ||
| 68 | cval = jiffies_to_cputime(1); | ||
| 69 | } else { | ||
| 70 | cval = cputime_sub(cval, utime); | ||
| 71 | } | ||
| 72 | } | ||
| 73 | spin_unlock_irq(&tsk->sighand->siglock); | ||
| 74 | cputime_to_timeval(cval, &value->it_value); | ||
| 75 | cputime_to_timeval(cinterval, &value->it_interval); | ||
| 76 | break; | 93 | break; |
| 77 | case ITIMER_PROF: | 94 | case ITIMER_PROF: |
| 78 | spin_lock_irq(&tsk->sighand->siglock); | 95 | get_cpu_itimer(tsk, CPUCLOCK_PROF, value); |
| 79 | cval = tsk->signal->it_prof_expires; | ||
| 80 | cinterval = tsk->signal->it_prof_incr; | ||
| 81 | if (!cputime_eq(cval, cputime_zero)) { | ||
| 82 | struct task_cputime times; | ||
| 83 | cputime_t ptime; | ||
| 84 | |||
| 85 | thread_group_cputimer(tsk, ×); | ||
| 86 | ptime = cputime_add(times.utime, times.stime); | ||
| 87 | if (cputime_le(cval, ptime)) { /* about to fire */ | ||
| 88 | cval = jiffies_to_cputime(1); | ||
| 89 | } else { | ||
| 90 | cval = cputime_sub(cval, ptime); | ||
| 91 | } | ||
| 92 | } | ||
| 93 | spin_unlock_irq(&tsk->sighand->siglock); | ||
| 94 | cputime_to_timeval(cval, &value->it_value); | ||
| 95 | cputime_to_timeval(cinterval, &value->it_interval); | ||
| 96 | break; | 96 | break; |
| 97 | default: | 97 | default: |
| 98 | return(-EINVAL); | 98 | return(-EINVAL); |
| @@ -123,11 +123,62 @@ enum hrtimer_restart it_real_fn(struct hrtimer *timer) | |||
| 123 | struct signal_struct *sig = | 123 | struct signal_struct *sig = |
| 124 | container_of(timer, struct signal_struct, real_timer); | 124 | container_of(timer, struct signal_struct, real_timer); |
| 125 | 125 | ||
| 126 | trace_itimer_expire(ITIMER_REAL, sig->leader_pid, 0); | ||
| 126 | kill_pid_info(SIGALRM, SEND_SIG_PRIV, sig->leader_pid); | 127 | kill_pid_info(SIGALRM, SEND_SIG_PRIV, sig->leader_pid); |
| 127 | 128 | ||
| 128 | return HRTIMER_NORESTART; | 129 | return HRTIMER_NORESTART; |
| 129 | } | 130 | } |
| 130 | 131 | ||
| 132 | static inline u32 cputime_sub_ns(cputime_t ct, s64 real_ns) | ||
| 133 | { | ||
| 134 | struct timespec ts; | ||
| 135 | s64 cpu_ns; | ||
| 136 | |||
| 137 | cputime_to_timespec(ct, &ts); | ||
| 138 | cpu_ns = timespec_to_ns(&ts); | ||
| 139 | |||
| 140 | return (cpu_ns <= real_ns) ? 0 : cpu_ns - real_ns; | ||
| 141 | } | ||
| 142 | |||
| 143 | static void set_cpu_itimer(struct task_struct *tsk, unsigned int clock_id, | ||
| 144 | const struct itimerval *const value, | ||
| 145 | struct itimerval *const ovalue) | ||
| 146 | { | ||
| 147 | cputime_t cval, nval, cinterval, ninterval; | ||
| 148 | s64 ns_ninterval, ns_nval; | ||
| 149 | struct cpu_itimer *it = &tsk->signal->it[clock_id]; | ||
| 150 | |||
| 151 | nval = timeval_to_cputime(&value->it_value); | ||
| 152 | ns_nval = timeval_to_ns(&value->it_value); | ||
| 153 | ninterval = timeval_to_cputime(&value->it_interval); | ||
| 154 | ns_ninterval = timeval_to_ns(&value->it_interval); | ||
| 155 | |||
| 156 | it->incr_error = cputime_sub_ns(ninterval, ns_ninterval); | ||
| 157 | it->error = cputime_sub_ns(nval, ns_nval); | ||
| 158 | |||
| 159 | spin_lock_irq(&tsk->sighand->siglock); | ||
| 160 | |||
| 161 | cval = it->expires; | ||
| 162 | cinterval = it->incr; | ||
| 163 | if (!cputime_eq(cval, cputime_zero) || | ||
| 164 | !cputime_eq(nval, cputime_zero)) { | ||
| 165 | if (cputime_gt(nval, cputime_zero)) | ||
| 166 | nval = cputime_add(nval, cputime_one_jiffy); | ||
| 167 | set_process_cpu_timer(tsk, clock_id, &nval, &cval); | ||
| 168 | } | ||
| 169 | it->expires = nval; | ||
| 170 | it->incr = ninterval; | ||
| 171 | trace_itimer_state(clock_id == CPUCLOCK_VIRT ? | ||
| 172 | ITIMER_VIRTUAL : ITIMER_PROF, value, nval); | ||
| 173 | |||
| 174 | spin_unlock_irq(&tsk->sighand->siglock); | ||
| 175 | |||
| 176 | if (ovalue) { | ||
| 177 | cputime_to_timeval(cval, &ovalue->it_value); | ||
| 178 | cputime_to_timeval(cinterval, &ovalue->it_interval); | ||
| 179 | } | ||
| 180 | } | ||
| 181 | |||
| 131 | /* | 182 | /* |
| 132 | * Returns true if the timeval is in canonical form | 183 | * Returns true if the timeval is in canonical form |
| 133 | */ | 184 | */ |
| @@ -139,7 +190,6 @@ int do_setitimer(int which, struct itimerval *value, struct itimerval *ovalue) | |||
| 139 | struct task_struct *tsk = current; | 190 | struct task_struct *tsk = current; |
| 140 | struct hrtimer *timer; | 191 | struct hrtimer *timer; |
| 141 | ktime_t expires; | 192 | ktime_t expires; |
| 142 | cputime_t cval, cinterval, nval, ninterval; | ||
| 143 | 193 | ||
| 144 | /* | 194 | /* |
| 145 | * Validate the timevals in value. | 195 | * Validate the timevals in value. |
| @@ -171,51 +221,14 @@ again: | |||
| 171 | } else | 221 | } else |
| 172 | tsk->signal->it_real_incr.tv64 = 0; | 222 | tsk->signal->it_real_incr.tv64 = 0; |
| 173 | 223 | ||
| 224 | trace_itimer_state(ITIMER_REAL, value, 0); | ||
| 174 | spin_unlock_irq(&tsk->sighand->siglock); | 225 | spin_unlock_irq(&tsk->sighand->siglock); |
| 175 | break; | 226 | break; |
| 176 | case ITIMER_VIRTUAL: | 227 | case ITIMER_VIRTUAL: |
| 177 | nval = timeval_to_cputime(&value->it_value); | 228 | set_cpu_itimer(tsk, CPUCLOCK_VIRT, value, ovalue); |
| 178 | ninterval = timeval_to_cputime(&value->it_interval); | ||
| 179 | spin_lock_irq(&tsk->sighand->siglock); | ||
| 180 | cval = tsk->signal->it_virt_expires; | ||
| 181 | cinterval = tsk->signal->it_virt_incr; | ||
| 182 | if (!cputime_eq(cval, cputime_zero) || | ||
| 183 | !cputime_eq(nval, cputime_zero)) { | ||
| 184 | if (cputime_gt(nval, cputime_zero)) | ||
| 185 | nval = cputime_add(nval, | ||
| 186 | jiffies_to_cputime(1)); | ||
| 187 | set_process_cpu_timer(tsk, CPUCLOCK_VIRT, | ||
| 188 | &nval, &cval); | ||
| 189 | } | ||
| 190 | tsk->signal->it_virt_expires = nval; | ||
| 191 | tsk->signal->it_virt_incr = ninterval; | ||
| 192 | spin_unlock_irq(&tsk->sighand->siglock); | ||
| 193 | if (ovalue) { | ||
| 194 | cputime_to_timeval(cval, &ovalue->it_value); | ||
| 195 | cputime_to_timeval(cinterval, &ovalue->it_interval); | ||
| 196 | } | ||
| 197 | break; | 229 | break; |
| 198 | case ITIMER_PROF: | 230 | case ITIMER_PROF: |
| 199 | nval = timeval_to_cputime(&value->it_value); | 231 | set_cpu_itimer(tsk, CPUCLOCK_PROF, value, ovalue); |
| 200 | ninterval = timeval_to_cputime(&value->it_interval); | ||
| 201 | spin_lock_irq(&tsk->sighand->siglock); | ||
| 202 | cval = tsk->signal->it_prof_expires; | ||
| 203 | cinterval = tsk->signal->it_prof_incr; | ||
| 204 | if (!cputime_eq(cval, cputime_zero) || | ||
| 205 | !cputime_eq(nval, cputime_zero)) { | ||
| 206 | if (cputime_gt(nval, cputime_zero)) | ||
| 207 | nval = cputime_add(nval, | ||
| 208 | jiffies_to_cputime(1)); | ||
| 209 | set_process_cpu_timer(tsk, CPUCLOCK_PROF, | ||
| 210 | &nval, &cval); | ||
| 211 | } | ||
| 212 | tsk->signal->it_prof_expires = nval; | ||
| 213 | tsk->signal->it_prof_incr = ninterval; | ||
| 214 | spin_unlock_irq(&tsk->sighand->siglock); | ||
| 215 | if (ovalue) { | ||
| 216 | cputime_to_timeval(cval, &ovalue->it_value); | ||
| 217 | cputime_to_timeval(cinterval, &ovalue->it_interval); | ||
| 218 | } | ||
| 219 | break; | 232 | break; |
| 220 | default: | 233 | default: |
| 221 | return -EINVAL; | 234 | return -EINVAL; |
diff --git a/kernel/kallsyms.c b/kernel/kallsyms.c index 3a29dbe7898e..8b6b8b697c68 100644 --- a/kernel/kallsyms.c +++ b/kernel/kallsyms.c | |||
| @@ -59,7 +59,8 @@ static inline int is_kernel_inittext(unsigned long addr) | |||
| 59 | 59 | ||
| 60 | static inline int is_kernel_text(unsigned long addr) | 60 | static inline int is_kernel_text(unsigned long addr) |
| 61 | { | 61 | { |
| 62 | if (addr >= (unsigned long)_stext && addr <= (unsigned long)_etext) | 62 | if ((addr >= (unsigned long)_stext && addr <= (unsigned long)_etext) || |
| 63 | arch_is_kernel_text(addr)) | ||
| 63 | return 1; | 64 | return 1; |
| 64 | return in_gate_area_no_task(addr); | 65 | return in_gate_area_no_task(addr); |
| 65 | } | 66 | } |
diff --git a/kernel/kprobes.c b/kernel/kprobes.c index ef177d653b2c..5240d75f4c60 100644 --- a/kernel/kprobes.c +++ b/kernel/kprobes.c | |||
| @@ -1321,7 +1321,7 @@ static int __kprobes show_kprobe_addr(struct seq_file *pi, void *v) | |||
| 1321 | return 0; | 1321 | return 0; |
| 1322 | } | 1322 | } |
| 1323 | 1323 | ||
| 1324 | static struct seq_operations kprobes_seq_ops = { | 1324 | static const struct seq_operations kprobes_seq_ops = { |
| 1325 | .start = kprobe_seq_start, | 1325 | .start = kprobe_seq_start, |
| 1326 | .next = kprobe_seq_next, | 1326 | .next = kprobe_seq_next, |
| 1327 | .stop = kprobe_seq_stop, | 1327 | .stop = kprobe_seq_stop, |
| @@ -1333,7 +1333,7 @@ static int __kprobes kprobes_open(struct inode *inode, struct file *filp) | |||
| 1333 | return seq_open(filp, &kprobes_seq_ops); | 1333 | return seq_open(filp, &kprobes_seq_ops); |
| 1334 | } | 1334 | } |
| 1335 | 1335 | ||
| 1336 | static struct file_operations debugfs_kprobes_operations = { | 1336 | static const struct file_operations debugfs_kprobes_operations = { |
| 1337 | .open = kprobes_open, | 1337 | .open = kprobes_open, |
| 1338 | .read = seq_read, | 1338 | .read = seq_read, |
| 1339 | .llseek = seq_lseek, | 1339 | .llseek = seq_lseek, |
| @@ -1515,7 +1515,7 @@ static ssize_t write_enabled_file_bool(struct file *file, | |||
| 1515 | return count; | 1515 | return count; |
| 1516 | } | 1516 | } |
| 1517 | 1517 | ||
| 1518 | static struct file_operations fops_kp = { | 1518 | static const struct file_operations fops_kp = { |
| 1519 | .read = read_enabled_file_bool, | 1519 | .read = read_enabled_file_bool, |
| 1520 | .write = write_enabled_file_bool, | 1520 | .write = write_enabled_file_bool, |
| 1521 | }; | 1521 | }; |
diff --git a/kernel/lockdep.c b/kernel/lockdep.c index f74d2d7aa605..3815ac1d58b2 100644 --- a/kernel/lockdep.c +++ b/kernel/lockdep.c | |||
| @@ -578,6 +578,9 @@ static int static_obj(void *obj) | |||
| 578 | if ((addr >= start) && (addr < end)) | 578 | if ((addr >= start) && (addr < end)) |
| 579 | return 1; | 579 | return 1; |
| 580 | 580 | ||
| 581 | if (arch_is_kernel_data(addr)) | ||
| 582 | return 1; | ||
| 583 | |||
| 581 | #ifdef CONFIG_SMP | 584 | #ifdef CONFIG_SMP |
| 582 | /* | 585 | /* |
| 583 | * percpu var? | 586 | * percpu var? |
diff --git a/kernel/lockdep_proc.c b/kernel/lockdep_proc.c index d4b3dbc79fdb..d4aba4f3584c 100644 --- a/kernel/lockdep_proc.c +++ b/kernel/lockdep_proc.c | |||
| @@ -594,7 +594,7 @@ static int ls_show(struct seq_file *m, void *v) | |||
| 594 | return 0; | 594 | return 0; |
| 595 | } | 595 | } |
| 596 | 596 | ||
| 597 | static struct seq_operations lockstat_ops = { | 597 | static const struct seq_operations lockstat_ops = { |
| 598 | .start = ls_start, | 598 | .start = ls_start, |
| 599 | .next = ls_next, | 599 | .next = ls_next, |
| 600 | .stop = ls_stop, | 600 | .stop = ls_stop, |
diff --git a/kernel/module.c b/kernel/module.c index e6bc4b28aa62..8b7d8805819d 100644 --- a/kernel/module.c +++ b/kernel/module.c | |||
| @@ -1797,6 +1797,17 @@ static void setup_modinfo(struct module *mod, Elf_Shdr *sechdrs, | |||
| 1797 | } | 1797 | } |
| 1798 | } | 1798 | } |
| 1799 | 1799 | ||
| 1800 | static void free_modinfo(struct module *mod) | ||
| 1801 | { | ||
| 1802 | struct module_attribute *attr; | ||
| 1803 | int i; | ||
| 1804 | |||
| 1805 | for (i = 0; (attr = modinfo_attrs[i]); i++) { | ||
| 1806 | if (attr->free) | ||
| 1807 | attr->free(mod); | ||
| 1808 | } | ||
| 1809 | } | ||
| 1810 | |||
| 1800 | #ifdef CONFIG_KALLSYMS | 1811 | #ifdef CONFIG_KALLSYMS |
| 1801 | 1812 | ||
| 1802 | /* lookup symbol in given range of kernel_symbols */ | 1813 | /* lookup symbol in given range of kernel_symbols */ |
| @@ -1862,13 +1873,93 @@ static char elf_type(const Elf_Sym *sym, | |||
| 1862 | return '?'; | 1873 | return '?'; |
| 1863 | } | 1874 | } |
| 1864 | 1875 | ||
| 1876 | static bool is_core_symbol(const Elf_Sym *src, const Elf_Shdr *sechdrs, | ||
| 1877 | unsigned int shnum) | ||
| 1878 | { | ||
| 1879 | const Elf_Shdr *sec; | ||
| 1880 | |||
| 1881 | if (src->st_shndx == SHN_UNDEF | ||
| 1882 | || src->st_shndx >= shnum | ||
| 1883 | || !src->st_name) | ||
| 1884 | return false; | ||
| 1885 | |||
| 1886 | sec = sechdrs + src->st_shndx; | ||
| 1887 | if (!(sec->sh_flags & SHF_ALLOC) | ||
| 1888 | #ifndef CONFIG_KALLSYMS_ALL | ||
| 1889 | || !(sec->sh_flags & SHF_EXECINSTR) | ||
| 1890 | #endif | ||
| 1891 | || (sec->sh_entsize & INIT_OFFSET_MASK)) | ||
| 1892 | return false; | ||
| 1893 | |||
| 1894 | return true; | ||
| 1895 | } | ||
| 1896 | |||
| 1897 | static unsigned long layout_symtab(struct module *mod, | ||
| 1898 | Elf_Shdr *sechdrs, | ||
| 1899 | unsigned int symindex, | ||
| 1900 | unsigned int strindex, | ||
| 1901 | const Elf_Ehdr *hdr, | ||
| 1902 | const char *secstrings, | ||
| 1903 | unsigned long *pstroffs, | ||
| 1904 | unsigned long *strmap) | ||
| 1905 | { | ||
| 1906 | unsigned long symoffs; | ||
| 1907 | Elf_Shdr *symsect = sechdrs + symindex; | ||
| 1908 | Elf_Shdr *strsect = sechdrs + strindex; | ||
| 1909 | const Elf_Sym *src; | ||
| 1910 | const char *strtab; | ||
| 1911 | unsigned int i, nsrc, ndst; | ||
| 1912 | |||
| 1913 | /* Put symbol section at end of init part of module. */ | ||
| 1914 | symsect->sh_flags |= SHF_ALLOC; | ||
| 1915 | symsect->sh_entsize = get_offset(mod, &mod->init_size, symsect, | ||
| 1916 | symindex) | INIT_OFFSET_MASK; | ||
| 1917 | DEBUGP("\t%s\n", secstrings + symsect->sh_name); | ||
| 1918 | |||
| 1919 | src = (void *)hdr + symsect->sh_offset; | ||
| 1920 | nsrc = symsect->sh_size / sizeof(*src); | ||
| 1921 | strtab = (void *)hdr + strsect->sh_offset; | ||
| 1922 | for (ndst = i = 1; i < nsrc; ++i, ++src) | ||
| 1923 | if (is_core_symbol(src, sechdrs, hdr->e_shnum)) { | ||
| 1924 | unsigned int j = src->st_name; | ||
| 1925 | |||
| 1926 | while(!__test_and_set_bit(j, strmap) && strtab[j]) | ||
| 1927 | ++j; | ||
| 1928 | ++ndst; | ||
| 1929 | } | ||
| 1930 | |||
| 1931 | /* Append room for core symbols at end of core part. */ | ||
| 1932 | symoffs = ALIGN(mod->core_size, symsect->sh_addralign ?: 1); | ||
| 1933 | mod->core_size = symoffs + ndst * sizeof(Elf_Sym); | ||
| 1934 | |||
| 1935 | /* Put string table section at end of init part of module. */ | ||
| 1936 | strsect->sh_flags |= SHF_ALLOC; | ||
| 1937 | strsect->sh_entsize = get_offset(mod, &mod->init_size, strsect, | ||
| 1938 | strindex) | INIT_OFFSET_MASK; | ||
| 1939 | DEBUGP("\t%s\n", secstrings + strsect->sh_name); | ||
| 1940 | |||
| 1941 | /* Append room for core symbols' strings at end of core part. */ | ||
| 1942 | *pstroffs = mod->core_size; | ||
| 1943 | __set_bit(0, strmap); | ||
| 1944 | mod->core_size += bitmap_weight(strmap, strsect->sh_size); | ||
| 1945 | |||
| 1946 | return symoffs; | ||
| 1947 | } | ||
| 1948 | |||
| 1865 | static void add_kallsyms(struct module *mod, | 1949 | static void add_kallsyms(struct module *mod, |
| 1866 | Elf_Shdr *sechdrs, | 1950 | Elf_Shdr *sechdrs, |
| 1951 | unsigned int shnum, | ||
| 1867 | unsigned int symindex, | 1952 | unsigned int symindex, |
| 1868 | unsigned int strindex, | 1953 | unsigned int strindex, |
| 1869 | const char *secstrings) | 1954 | unsigned long symoffs, |
| 1955 | unsigned long stroffs, | ||
| 1956 | const char *secstrings, | ||
| 1957 | unsigned long *strmap) | ||
| 1870 | { | 1958 | { |
| 1871 | unsigned int i; | 1959 | unsigned int i, ndst; |
| 1960 | const Elf_Sym *src; | ||
| 1961 | Elf_Sym *dst; | ||
| 1962 | char *s; | ||
| 1872 | 1963 | ||
| 1873 | mod->symtab = (void *)sechdrs[symindex].sh_addr; | 1964 | mod->symtab = (void *)sechdrs[symindex].sh_addr; |
| 1874 | mod->num_symtab = sechdrs[symindex].sh_size / sizeof(Elf_Sym); | 1965 | mod->num_symtab = sechdrs[symindex].sh_size / sizeof(Elf_Sym); |
| @@ -1878,13 +1969,46 @@ static void add_kallsyms(struct module *mod, | |||
| 1878 | for (i = 0; i < mod->num_symtab; i++) | 1969 | for (i = 0; i < mod->num_symtab; i++) |
| 1879 | mod->symtab[i].st_info | 1970 | mod->symtab[i].st_info |
| 1880 | = elf_type(&mod->symtab[i], sechdrs, secstrings, mod); | 1971 | = elf_type(&mod->symtab[i], sechdrs, secstrings, mod); |
| 1972 | |||
| 1973 | mod->core_symtab = dst = mod->module_core + symoffs; | ||
| 1974 | src = mod->symtab; | ||
| 1975 | *dst = *src; | ||
| 1976 | for (ndst = i = 1; i < mod->num_symtab; ++i, ++src) { | ||
| 1977 | if (!is_core_symbol(src, sechdrs, shnum)) | ||
| 1978 | continue; | ||
| 1979 | dst[ndst] = *src; | ||
| 1980 | dst[ndst].st_name = bitmap_weight(strmap, dst[ndst].st_name); | ||
| 1981 | ++ndst; | ||
| 1982 | } | ||
| 1983 | mod->core_num_syms = ndst; | ||
| 1984 | |||
| 1985 | mod->core_strtab = s = mod->module_core + stroffs; | ||
| 1986 | for (*s = 0, i = 1; i < sechdrs[strindex].sh_size; ++i) | ||
| 1987 | if (test_bit(i, strmap)) | ||
| 1988 | *++s = mod->strtab[i]; | ||
| 1881 | } | 1989 | } |
| 1882 | #else | 1990 | #else |
| 1991 | static inline unsigned long layout_symtab(struct module *mod, | ||
| 1992 | Elf_Shdr *sechdrs, | ||
| 1993 | unsigned int symindex, | ||
| 1994 | unsigned int strindex, | ||
| 1995 | const Elf_Ehdr *hdr, | ||
| 1996 | const char *secstrings, | ||
| 1997 | unsigned long *pstroffs, | ||
| 1998 | unsigned long *strmap) | ||
| 1999 | { | ||
| 2000 | return 0; | ||
| 2001 | } | ||
| 2002 | |||
| 1883 | static inline void add_kallsyms(struct module *mod, | 2003 | static inline void add_kallsyms(struct module *mod, |
| 1884 | Elf_Shdr *sechdrs, | 2004 | Elf_Shdr *sechdrs, |
| 2005 | unsigned int shnum, | ||
| 1885 | unsigned int symindex, | 2006 | unsigned int symindex, |
| 1886 | unsigned int strindex, | 2007 | unsigned int strindex, |
| 1887 | const char *secstrings) | 2008 | unsigned long symoffs, |
| 2009 | unsigned long stroffs, | ||
| 2010 | const char *secstrings, | ||
| 2011 | const unsigned long *strmap) | ||
| 1888 | { | 2012 | { |
| 1889 | } | 2013 | } |
| 1890 | #endif /* CONFIG_KALLSYMS */ | 2014 | #endif /* CONFIG_KALLSYMS */ |
| @@ -1959,6 +2083,8 @@ static noinline struct module *load_module(void __user *umod, | |||
| 1959 | struct module *mod; | 2083 | struct module *mod; |
| 1960 | long err = 0; | 2084 | long err = 0; |
| 1961 | void *percpu = NULL, *ptr = NULL; /* Stops spurious gcc warning */ | 2085 | void *percpu = NULL, *ptr = NULL; /* Stops spurious gcc warning */ |
| 2086 | unsigned long symoffs, stroffs, *strmap; | ||
| 2087 | |||
| 1962 | mm_segment_t old_fs; | 2088 | mm_segment_t old_fs; |
| 1963 | 2089 | ||
| 1964 | DEBUGP("load_module: umod=%p, len=%lu, uargs=%p\n", | 2090 | DEBUGP("load_module: umod=%p, len=%lu, uargs=%p\n", |
| @@ -2040,11 +2166,6 @@ static noinline struct module *load_module(void __user *umod, | |||
| 2040 | /* Don't keep modinfo and version sections. */ | 2166 | /* Don't keep modinfo and version sections. */ |
| 2041 | sechdrs[infoindex].sh_flags &= ~(unsigned long)SHF_ALLOC; | 2167 | sechdrs[infoindex].sh_flags &= ~(unsigned long)SHF_ALLOC; |
| 2042 | sechdrs[versindex].sh_flags &= ~(unsigned long)SHF_ALLOC; | 2168 | sechdrs[versindex].sh_flags &= ~(unsigned long)SHF_ALLOC; |
| 2043 | #ifdef CONFIG_KALLSYMS | ||
| 2044 | /* Keep symbol and string tables for decoding later. */ | ||
| 2045 | sechdrs[symindex].sh_flags |= SHF_ALLOC; | ||
| 2046 | sechdrs[strindex].sh_flags |= SHF_ALLOC; | ||
| 2047 | #endif | ||
| 2048 | 2169 | ||
| 2049 | /* Check module struct version now, before we try to use module. */ | 2170 | /* Check module struct version now, before we try to use module. */ |
| 2050 | if (!check_modstruct_version(sechdrs, versindex, mod)) { | 2171 | if (!check_modstruct_version(sechdrs, versindex, mod)) { |
| @@ -2080,6 +2201,13 @@ static noinline struct module *load_module(void __user *umod, | |||
| 2080 | goto free_hdr; | 2201 | goto free_hdr; |
| 2081 | } | 2202 | } |
| 2082 | 2203 | ||
| 2204 | strmap = kzalloc(BITS_TO_LONGS(sechdrs[strindex].sh_size) | ||
| 2205 | * sizeof(long), GFP_KERNEL); | ||
| 2206 | if (!strmap) { | ||
| 2207 | err = -ENOMEM; | ||
| 2208 | goto free_mod; | ||
| 2209 | } | ||
| 2210 | |||
| 2083 | if (find_module(mod->name)) { | 2211 | if (find_module(mod->name)) { |
| 2084 | err = -EEXIST; | 2212 | err = -EEXIST; |
| 2085 | goto free_mod; | 2213 | goto free_mod; |
| @@ -2109,6 +2237,8 @@ static noinline struct module *load_module(void __user *umod, | |||
| 2109 | this is done generically; there doesn't appear to be any | 2237 | this is done generically; there doesn't appear to be any |
| 2110 | special cases for the architectures. */ | 2238 | special cases for the architectures. */ |
| 2111 | layout_sections(mod, hdr, sechdrs, secstrings); | 2239 | layout_sections(mod, hdr, sechdrs, secstrings); |
| 2240 | symoffs = layout_symtab(mod, sechdrs, symindex, strindex, hdr, | ||
| 2241 | secstrings, &stroffs, strmap); | ||
| 2112 | 2242 | ||
| 2113 | /* Do the allocs. */ | 2243 | /* Do the allocs. */ |
| 2114 | ptr = module_alloc_update_bounds(mod->core_size); | 2244 | ptr = module_alloc_update_bounds(mod->core_size); |
| @@ -2313,7 +2443,10 @@ static noinline struct module *load_module(void __user *umod, | |||
| 2313 | percpu_modcopy(mod->percpu, (void *)sechdrs[pcpuindex].sh_addr, | 2443 | percpu_modcopy(mod->percpu, (void *)sechdrs[pcpuindex].sh_addr, |
| 2314 | sechdrs[pcpuindex].sh_size); | 2444 | sechdrs[pcpuindex].sh_size); |
| 2315 | 2445 | ||
| 2316 | add_kallsyms(mod, sechdrs, symindex, strindex, secstrings); | 2446 | add_kallsyms(mod, sechdrs, hdr->e_shnum, symindex, strindex, |
| 2447 | symoffs, stroffs, secstrings, strmap); | ||
| 2448 | kfree(strmap); | ||
| 2449 | strmap = NULL; | ||
| 2317 | 2450 | ||
| 2318 | if (!mod->taints) { | 2451 | if (!mod->taints) { |
| 2319 | struct _ddebug *debug; | 2452 | struct _ddebug *debug; |
| @@ -2385,13 +2518,14 @@ static noinline struct module *load_module(void __user *umod, | |||
| 2385 | synchronize_sched(); | 2518 | synchronize_sched(); |
| 2386 | module_arch_cleanup(mod); | 2519 | module_arch_cleanup(mod); |
| 2387 | cleanup: | 2520 | cleanup: |
| 2521 | free_modinfo(mod); | ||
| 2388 | kobject_del(&mod->mkobj.kobj); | 2522 | kobject_del(&mod->mkobj.kobj); |
| 2389 | kobject_put(&mod->mkobj.kobj); | 2523 | kobject_put(&mod->mkobj.kobj); |
| 2390 | free_unload: | 2524 | free_unload: |
| 2391 | module_unload_free(mod); | 2525 | module_unload_free(mod); |
| 2392 | #if defined(CONFIG_MODULE_UNLOAD) && defined(CONFIG_SMP) | 2526 | #if defined(CONFIG_MODULE_UNLOAD) && defined(CONFIG_SMP) |
| 2393 | free_init: | ||
| 2394 | percpu_modfree(mod->refptr); | 2527 | percpu_modfree(mod->refptr); |
| 2528 | free_init: | ||
| 2395 | #endif | 2529 | #endif |
| 2396 | module_free(mod, mod->module_init); | 2530 | module_free(mod, mod->module_init); |
| 2397 | free_core: | 2531 | free_core: |
| @@ -2402,6 +2536,7 @@ static noinline struct module *load_module(void __user *umod, | |||
| 2402 | percpu_modfree(percpu); | 2536 | percpu_modfree(percpu); |
| 2403 | free_mod: | 2537 | free_mod: |
| 2404 | kfree(args); | 2538 | kfree(args); |
| 2539 | kfree(strmap); | ||
| 2405 | free_hdr: | 2540 | free_hdr: |
| 2406 | vfree(hdr); | 2541 | vfree(hdr); |
| 2407 | return ERR_PTR(err); | 2542 | return ERR_PTR(err); |
| @@ -2491,6 +2626,11 @@ SYSCALL_DEFINE3(init_module, void __user *, umod, | |||
| 2491 | /* Drop initial reference. */ | 2626 | /* Drop initial reference. */ |
| 2492 | module_put(mod); | 2627 | module_put(mod); |
| 2493 | trim_init_extable(mod); | 2628 | trim_init_extable(mod); |
| 2629 | #ifdef CONFIG_KALLSYMS | ||
| 2630 | mod->num_symtab = mod->core_num_syms; | ||
| 2631 | mod->symtab = mod->core_symtab; | ||
| 2632 | mod->strtab = mod->core_strtab; | ||
| 2633 | #endif | ||
| 2494 | module_free(mod, mod->module_init); | 2634 | module_free(mod, mod->module_init); |
| 2495 | mod->module_init = NULL; | 2635 | mod->module_init = NULL; |
| 2496 | mod->init_size = 0; | 2636 | mod->init_size = 0; |
| @@ -2952,7 +3092,6 @@ void module_layout(struct module *mod, | |||
| 2952 | struct modversion_info *ver, | 3092 | struct modversion_info *ver, |
| 2953 | struct kernel_param *kp, | 3093 | struct kernel_param *kp, |
| 2954 | struct kernel_symbol *ks, | 3094 | struct kernel_symbol *ks, |
| 2955 | struct marker *marker, | ||
| 2956 | struct tracepoint *tp) | 3095 | struct tracepoint *tp) |
| 2957 | { | 3096 | { |
| 2958 | } | 3097 | } |
diff --git a/kernel/mutex-debug.c b/kernel/mutex-debug.c index 50d022e5a560..ec815a960b5d 100644 --- a/kernel/mutex-debug.c +++ b/kernel/mutex-debug.c | |||
| @@ -16,6 +16,7 @@ | |||
| 16 | #include <linux/delay.h> | 16 | #include <linux/delay.h> |
| 17 | #include <linux/module.h> | 17 | #include <linux/module.h> |
| 18 | #include <linux/poison.h> | 18 | #include <linux/poison.h> |
| 19 | #include <linux/sched.h> | ||
| 19 | #include <linux/spinlock.h> | 20 | #include <linux/spinlock.h> |
| 20 | #include <linux/kallsyms.h> | 21 | #include <linux/kallsyms.h> |
| 21 | #include <linux/interrupt.h> | 22 | #include <linux/interrupt.h> |
diff --git a/kernel/ns_cgroup.c b/kernel/ns_cgroup.c index 5aa854f9e5ae..2a5dfec8efe0 100644 --- a/kernel/ns_cgroup.c +++ b/kernel/ns_cgroup.c | |||
| @@ -42,8 +42,8 @@ int ns_cgroup_clone(struct task_struct *task, struct pid *pid) | |||
| 42 | * (hence either you are in the same cgroup as task, or in an | 42 | * (hence either you are in the same cgroup as task, or in an |
| 43 | * ancestor cgroup thereof) | 43 | * ancestor cgroup thereof) |
| 44 | */ | 44 | */ |
| 45 | static int ns_can_attach(struct cgroup_subsys *ss, | 45 | static int ns_can_attach(struct cgroup_subsys *ss, struct cgroup *new_cgroup, |
| 46 | struct cgroup *new_cgroup, struct task_struct *task) | 46 | struct task_struct *task, bool threadgroup) |
| 47 | { | 47 | { |
| 48 | if (current != task) { | 48 | if (current != task) { |
| 49 | if (!capable(CAP_SYS_ADMIN)) | 49 | if (!capable(CAP_SYS_ADMIN)) |
| @@ -56,6 +56,18 @@ static int ns_can_attach(struct cgroup_subsys *ss, | |||
| 56 | if (!cgroup_is_descendant(new_cgroup, task)) | 56 | if (!cgroup_is_descendant(new_cgroup, task)) |
| 57 | return -EPERM; | 57 | return -EPERM; |
| 58 | 58 | ||
| 59 | if (threadgroup) { | ||
| 60 | struct task_struct *c; | ||
| 61 | rcu_read_lock(); | ||
| 62 | list_for_each_entry_rcu(c, &task->thread_group, thread_group) { | ||
| 63 | if (!cgroup_is_descendant(new_cgroup, c)) { | ||
| 64 | rcu_read_unlock(); | ||
| 65 | return -EPERM; | ||
| 66 | } | ||
| 67 | } | ||
| 68 | rcu_read_unlock(); | ||
| 69 | } | ||
| 70 | |||
| 59 | return 0; | 71 | return 0; |
| 60 | } | 72 | } |
| 61 | 73 | ||
diff --git a/kernel/panic.c b/kernel/panic.c index bcdef26e3332..96b45d0b4ba5 100644 --- a/kernel/panic.c +++ b/kernel/panic.c | |||
| @@ -90,6 +90,8 @@ NORET_TYPE void panic(const char * fmt, ...) | |||
| 90 | 90 | ||
| 91 | atomic_notifier_call_chain(&panic_notifier_list, 0, buf); | 91 | atomic_notifier_call_chain(&panic_notifier_list, 0, buf); |
| 92 | 92 | ||
| 93 | bust_spinlocks(0); | ||
| 94 | |||
| 93 | if (!panic_blink) | 95 | if (!panic_blink) |
| 94 | panic_blink = no_blink; | 96 | panic_blink = no_blink; |
| 95 | 97 | ||
| @@ -136,7 +138,6 @@ NORET_TYPE void panic(const char * fmt, ...) | |||
| 136 | mdelay(1); | 138 | mdelay(1); |
| 137 | i++; | 139 | i++; |
| 138 | } | 140 | } |
| 139 | bust_spinlocks(0); | ||
| 140 | } | 141 | } |
| 141 | 142 | ||
| 142 | EXPORT_SYMBOL(panic); | 143 | EXPORT_SYMBOL(panic); |
diff --git a/kernel/params.c b/kernel/params.c index 7f6912ced2ba..9da58eabdcb2 100644 --- a/kernel/params.c +++ b/kernel/params.c | |||
| @@ -23,6 +23,7 @@ | |||
| 23 | #include <linux/device.h> | 23 | #include <linux/device.h> |
| 24 | #include <linux/err.h> | 24 | #include <linux/err.h> |
| 25 | #include <linux/slab.h> | 25 | #include <linux/slab.h> |
| 26 | #include <linux/ctype.h> | ||
| 26 | 27 | ||
| 27 | #if 0 | 28 | #if 0 |
| 28 | #define DEBUGP printk | 29 | #define DEBUGP printk |
| @@ -87,7 +88,7 @@ static char *next_arg(char *args, char **param, char **val) | |||
| 87 | } | 88 | } |
| 88 | 89 | ||
| 89 | for (i = 0; args[i]; i++) { | 90 | for (i = 0; args[i]; i++) { |
| 90 | if (args[i] == ' ' && !in_quote) | 91 | if (isspace(args[i]) && !in_quote) |
| 91 | break; | 92 | break; |
| 92 | if (equals == 0) { | 93 | if (equals == 0) { |
| 93 | if (args[i] == '=') | 94 | if (args[i] == '=') |
| @@ -121,7 +122,7 @@ static char *next_arg(char *args, char **param, char **val) | |||
| 121 | next = args + i; | 122 | next = args + i; |
| 122 | 123 | ||
| 123 | /* Chew up trailing spaces. */ | 124 | /* Chew up trailing spaces. */ |
| 124 | while (*next == ' ') | 125 | while (isspace(*next)) |
| 125 | next++; | 126 | next++; |
| 126 | return next; | 127 | return next; |
| 127 | } | 128 | } |
| @@ -138,7 +139,7 @@ int parse_args(const char *name, | |||
| 138 | DEBUGP("Parsing ARGS: %s\n", args); | 139 | DEBUGP("Parsing ARGS: %s\n", args); |
| 139 | 140 | ||
| 140 | /* Chew leading spaces */ | 141 | /* Chew leading spaces */ |
| 141 | while (*args == ' ') | 142 | while (isspace(*args)) |
| 142 | args++; | 143 | args++; |
| 143 | 144 | ||
| 144 | while (*args) { | 145 | while (*args) { |
diff --git a/kernel/perf_event.c b/kernel/perf_event.c index 76ac4db405e9..9d0b5c665883 100644 --- a/kernel/perf_event.c +++ b/kernel/perf_event.c | |||
| @@ -20,6 +20,7 @@ | |||
| 20 | #include <linux/percpu.h> | 20 | #include <linux/percpu.h> |
| 21 | #include <linux/ptrace.h> | 21 | #include <linux/ptrace.h> |
| 22 | #include <linux/vmstat.h> | 22 | #include <linux/vmstat.h> |
| 23 | #include <linux/vmalloc.h> | ||
| 23 | #include <linux/hardirq.h> | 24 | #include <linux/hardirq.h> |
| 24 | #include <linux/rculist.h> | 25 | #include <linux/rculist.h> |
| 25 | #include <linux/uaccess.h> | 26 | #include <linux/uaccess.h> |
| @@ -1030,14 +1031,10 @@ void __perf_event_sched_out(struct perf_event_context *ctx, | |||
| 1030 | update_context_time(ctx); | 1031 | update_context_time(ctx); |
| 1031 | 1032 | ||
| 1032 | perf_disable(); | 1033 | perf_disable(); |
| 1033 | if (ctx->nr_active) { | 1034 | if (ctx->nr_active) |
| 1034 | list_for_each_entry(event, &ctx->group_list, group_entry) { | 1035 | list_for_each_entry(event, &ctx->group_list, group_entry) |
| 1035 | if (event != event->group_leader) | 1036 | group_sched_out(event, cpuctx, ctx); |
| 1036 | event_sched_out(event, cpuctx, ctx); | 1037 | |
| 1037 | else | ||
| 1038 | group_sched_out(event, cpuctx, ctx); | ||
| 1039 | } | ||
| 1040 | } | ||
| 1041 | perf_enable(); | 1038 | perf_enable(); |
| 1042 | out: | 1039 | out: |
| 1043 | spin_unlock(&ctx->lock); | 1040 | spin_unlock(&ctx->lock); |
| @@ -1258,12 +1255,8 @@ __perf_event_sched_in(struct perf_event_context *ctx, | |||
| 1258 | if (event->cpu != -1 && event->cpu != cpu) | 1255 | if (event->cpu != -1 && event->cpu != cpu) |
| 1259 | continue; | 1256 | continue; |
| 1260 | 1257 | ||
| 1261 | if (event != event->group_leader) | 1258 | if (group_can_go_on(event, cpuctx, 1)) |
| 1262 | event_sched_in(event, cpuctx, ctx, cpu); | 1259 | group_sched_in(event, cpuctx, ctx, cpu); |
| 1263 | else { | ||
| 1264 | if (group_can_go_on(event, cpuctx, 1)) | ||
| 1265 | group_sched_in(event, cpuctx, ctx, cpu); | ||
| 1266 | } | ||
| 1267 | 1260 | ||
| 1268 | /* | 1261 | /* |
| 1269 | * If this pinned group hasn't been scheduled, | 1262 | * If this pinned group hasn't been scheduled, |
| @@ -1291,15 +1284,9 @@ __perf_event_sched_in(struct perf_event_context *ctx, | |||
| 1291 | if (event->cpu != -1 && event->cpu != cpu) | 1284 | if (event->cpu != -1 && event->cpu != cpu) |
| 1292 | continue; | 1285 | continue; |
| 1293 | 1286 | ||
| 1294 | if (event != event->group_leader) { | 1287 | if (group_can_go_on(event, cpuctx, can_add_hw)) |
| 1295 | if (event_sched_in(event, cpuctx, ctx, cpu)) | 1288 | if (group_sched_in(event, cpuctx, ctx, cpu)) |
| 1296 | can_add_hw = 0; | 1289 | can_add_hw = 0; |
| 1297 | } else { | ||
| 1298 | if (group_can_go_on(event, cpuctx, can_add_hw)) { | ||
| 1299 | if (group_sched_in(event, cpuctx, ctx, cpu)) | ||
| 1300 | can_add_hw = 0; | ||
| 1301 | } | ||
| 1302 | } | ||
| 1303 | } | 1290 | } |
| 1304 | perf_enable(); | 1291 | perf_enable(); |
| 1305 | out: | 1292 | out: |
| @@ -2105,49 +2092,31 @@ unlock: | |||
| 2105 | rcu_read_unlock(); | 2092 | rcu_read_unlock(); |
| 2106 | } | 2093 | } |
| 2107 | 2094 | ||
| 2108 | static int perf_mmap_fault(struct vm_area_struct *vma, struct vm_fault *vmf) | 2095 | static unsigned long perf_data_size(struct perf_mmap_data *data) |
| 2109 | { | 2096 | { |
| 2110 | struct perf_event *event = vma->vm_file->private_data; | 2097 | return data->nr_pages << (PAGE_SHIFT + data->data_order); |
| 2111 | struct perf_mmap_data *data; | 2098 | } |
| 2112 | int ret = VM_FAULT_SIGBUS; | ||
| 2113 | |||
| 2114 | if (vmf->flags & FAULT_FLAG_MKWRITE) { | ||
| 2115 | if (vmf->pgoff == 0) | ||
| 2116 | ret = 0; | ||
| 2117 | return ret; | ||
| 2118 | } | ||
| 2119 | |||
| 2120 | rcu_read_lock(); | ||
| 2121 | data = rcu_dereference(event->data); | ||
| 2122 | if (!data) | ||
| 2123 | goto unlock; | ||
| 2124 | |||
| 2125 | if (vmf->pgoff == 0) { | ||
| 2126 | vmf->page = virt_to_page(data->user_page); | ||
| 2127 | } else { | ||
| 2128 | int nr = vmf->pgoff - 1; | ||
| 2129 | |||
| 2130 | if ((unsigned)nr > data->nr_pages) | ||
| 2131 | goto unlock; | ||
| 2132 | 2099 | ||
| 2133 | if (vmf->flags & FAULT_FLAG_WRITE) | 2100 | #ifndef CONFIG_PERF_USE_VMALLOC |
| 2134 | goto unlock; | ||
| 2135 | 2101 | ||
| 2136 | vmf->page = virt_to_page(data->data_pages[nr]); | 2102 | /* |
| 2137 | } | 2103 | * Back perf_mmap() with regular GFP_KERNEL-0 pages. |
| 2104 | */ | ||
| 2138 | 2105 | ||
| 2139 | get_page(vmf->page); | 2106 | static struct page * |
| 2140 | vmf->page->mapping = vma->vm_file->f_mapping; | 2107 | perf_mmap_to_page(struct perf_mmap_data *data, unsigned long pgoff) |
| 2141 | vmf->page->index = vmf->pgoff; | 2108 | { |
| 2109 | if (pgoff > data->nr_pages) | ||
| 2110 | return NULL; | ||
| 2142 | 2111 | ||
| 2143 | ret = 0; | 2112 | if (pgoff == 0) |
| 2144 | unlock: | 2113 | return virt_to_page(data->user_page); |
| 2145 | rcu_read_unlock(); | ||
| 2146 | 2114 | ||
| 2147 | return ret; | 2115 | return virt_to_page(data->data_pages[pgoff - 1]); |
| 2148 | } | 2116 | } |
| 2149 | 2117 | ||
| 2150 | static int perf_mmap_data_alloc(struct perf_event *event, int nr_pages) | 2118 | static struct perf_mmap_data * |
| 2119 | perf_mmap_data_alloc(struct perf_event *event, int nr_pages) | ||
| 2151 | { | 2120 | { |
| 2152 | struct perf_mmap_data *data; | 2121 | struct perf_mmap_data *data; |
| 2153 | unsigned long size; | 2122 | unsigned long size; |
| @@ -2172,19 +2141,10 @@ static int perf_mmap_data_alloc(struct perf_event *event, int nr_pages) | |||
| 2172 | goto fail_data_pages; | 2141 | goto fail_data_pages; |
| 2173 | } | 2142 | } |
| 2174 | 2143 | ||
| 2144 | data->data_order = 0; | ||
| 2175 | data->nr_pages = nr_pages; | 2145 | data->nr_pages = nr_pages; |
| 2176 | atomic_set(&data->lock, -1); | ||
| 2177 | |||
| 2178 | if (event->attr.watermark) { | ||
| 2179 | data->watermark = min_t(long, PAGE_SIZE * nr_pages, | ||
| 2180 | event->attr.wakeup_watermark); | ||
| 2181 | } | ||
| 2182 | if (!data->watermark) | ||
| 2183 | data->watermark = max(PAGE_SIZE, PAGE_SIZE * nr_pages / 4); | ||
| 2184 | 2146 | ||
| 2185 | rcu_assign_pointer(event->data, data); | 2147 | return data; |
| 2186 | |||
| 2187 | return 0; | ||
| 2188 | 2148 | ||
| 2189 | fail_data_pages: | 2149 | fail_data_pages: |
| 2190 | for (i--; i >= 0; i--) | 2150 | for (i--; i >= 0; i--) |
| @@ -2196,7 +2156,7 @@ fail_user_page: | |||
| 2196 | kfree(data); | 2156 | kfree(data); |
| 2197 | 2157 | ||
| 2198 | fail: | 2158 | fail: |
| 2199 | return -ENOMEM; | 2159 | return NULL; |
| 2200 | } | 2160 | } |
| 2201 | 2161 | ||
| 2202 | static void perf_mmap_free_page(unsigned long addr) | 2162 | static void perf_mmap_free_page(unsigned long addr) |
| @@ -2207,28 +2167,169 @@ static void perf_mmap_free_page(unsigned long addr) | |||
| 2207 | __free_page(page); | 2167 | __free_page(page); |
| 2208 | } | 2168 | } |
| 2209 | 2169 | ||
| 2210 | static void __perf_mmap_data_free(struct rcu_head *rcu_head) | 2170 | static void perf_mmap_data_free(struct perf_mmap_data *data) |
| 2211 | { | 2171 | { |
| 2212 | struct perf_mmap_data *data; | ||
| 2213 | int i; | 2172 | int i; |
| 2214 | 2173 | ||
| 2215 | data = container_of(rcu_head, struct perf_mmap_data, rcu_head); | ||
| 2216 | |||
| 2217 | perf_mmap_free_page((unsigned long)data->user_page); | 2174 | perf_mmap_free_page((unsigned long)data->user_page); |
| 2218 | for (i = 0; i < data->nr_pages; i++) | 2175 | for (i = 0; i < data->nr_pages; i++) |
| 2219 | perf_mmap_free_page((unsigned long)data->data_pages[i]); | 2176 | perf_mmap_free_page((unsigned long)data->data_pages[i]); |
| 2177 | } | ||
| 2178 | |||
| 2179 | #else | ||
| 2180 | |||
| 2181 | /* | ||
| 2182 | * Back perf_mmap() with vmalloc memory. | ||
| 2183 | * | ||
| 2184 | * Required for architectures that have d-cache aliasing issues. | ||
| 2185 | */ | ||
| 2186 | |||
| 2187 | static struct page * | ||
| 2188 | perf_mmap_to_page(struct perf_mmap_data *data, unsigned long pgoff) | ||
| 2189 | { | ||
| 2190 | if (pgoff > (1UL << data->data_order)) | ||
| 2191 | return NULL; | ||
| 2192 | |||
| 2193 | return vmalloc_to_page((void *)data->user_page + pgoff * PAGE_SIZE); | ||
| 2194 | } | ||
| 2195 | |||
| 2196 | static void perf_mmap_unmark_page(void *addr) | ||
| 2197 | { | ||
| 2198 | struct page *page = vmalloc_to_page(addr); | ||
| 2199 | |||
| 2200 | page->mapping = NULL; | ||
| 2201 | } | ||
| 2202 | |||
| 2203 | static void perf_mmap_data_free_work(struct work_struct *work) | ||
| 2204 | { | ||
| 2205 | struct perf_mmap_data *data; | ||
| 2206 | void *base; | ||
| 2207 | int i, nr; | ||
| 2208 | |||
| 2209 | data = container_of(work, struct perf_mmap_data, work); | ||
| 2210 | nr = 1 << data->data_order; | ||
| 2211 | |||
| 2212 | base = data->user_page; | ||
| 2213 | for (i = 0; i < nr + 1; i++) | ||
| 2214 | perf_mmap_unmark_page(base + (i * PAGE_SIZE)); | ||
| 2215 | |||
| 2216 | vfree(base); | ||
| 2217 | } | ||
| 2220 | 2218 | ||
| 2219 | static void perf_mmap_data_free(struct perf_mmap_data *data) | ||
| 2220 | { | ||
| 2221 | schedule_work(&data->work); | ||
| 2222 | } | ||
| 2223 | |||
| 2224 | static struct perf_mmap_data * | ||
| 2225 | perf_mmap_data_alloc(struct perf_event *event, int nr_pages) | ||
| 2226 | { | ||
| 2227 | struct perf_mmap_data *data; | ||
| 2228 | unsigned long size; | ||
| 2229 | void *all_buf; | ||
| 2230 | |||
| 2231 | WARN_ON(atomic_read(&event->mmap_count)); | ||
| 2232 | |||
| 2233 | size = sizeof(struct perf_mmap_data); | ||
| 2234 | size += sizeof(void *); | ||
| 2235 | |||
| 2236 | data = kzalloc(size, GFP_KERNEL); | ||
| 2237 | if (!data) | ||
| 2238 | goto fail; | ||
| 2239 | |||
| 2240 | INIT_WORK(&data->work, perf_mmap_data_free_work); | ||
| 2241 | |||
| 2242 | all_buf = vmalloc_user((nr_pages + 1) * PAGE_SIZE); | ||
| 2243 | if (!all_buf) | ||
| 2244 | goto fail_all_buf; | ||
| 2245 | |||
| 2246 | data->user_page = all_buf; | ||
| 2247 | data->data_pages[0] = all_buf + PAGE_SIZE; | ||
| 2248 | data->data_order = ilog2(nr_pages); | ||
| 2249 | data->nr_pages = 1; | ||
| 2250 | |||
| 2251 | return data; | ||
| 2252 | |||
| 2253 | fail_all_buf: | ||
| 2254 | kfree(data); | ||
| 2255 | |||
| 2256 | fail: | ||
| 2257 | return NULL; | ||
| 2258 | } | ||
| 2259 | |||
| 2260 | #endif | ||
| 2261 | |||
| 2262 | static int perf_mmap_fault(struct vm_area_struct *vma, struct vm_fault *vmf) | ||
| 2263 | { | ||
| 2264 | struct perf_event *event = vma->vm_file->private_data; | ||
| 2265 | struct perf_mmap_data *data; | ||
| 2266 | int ret = VM_FAULT_SIGBUS; | ||
| 2267 | |||
| 2268 | if (vmf->flags & FAULT_FLAG_MKWRITE) { | ||
| 2269 | if (vmf->pgoff == 0) | ||
| 2270 | ret = 0; | ||
| 2271 | return ret; | ||
| 2272 | } | ||
| 2273 | |||
| 2274 | rcu_read_lock(); | ||
| 2275 | data = rcu_dereference(event->data); | ||
| 2276 | if (!data) | ||
| 2277 | goto unlock; | ||
| 2278 | |||
| 2279 | if (vmf->pgoff && (vmf->flags & FAULT_FLAG_WRITE)) | ||
| 2280 | goto unlock; | ||
| 2281 | |||
| 2282 | vmf->page = perf_mmap_to_page(data, vmf->pgoff); | ||
| 2283 | if (!vmf->page) | ||
| 2284 | goto unlock; | ||
| 2285 | |||
| 2286 | get_page(vmf->page); | ||
| 2287 | vmf->page->mapping = vma->vm_file->f_mapping; | ||
| 2288 | vmf->page->index = vmf->pgoff; | ||
| 2289 | |||
| 2290 | ret = 0; | ||
| 2291 | unlock: | ||
| 2292 | rcu_read_unlock(); | ||
| 2293 | |||
| 2294 | return ret; | ||
| 2295 | } | ||
| 2296 | |||
| 2297 | static void | ||
| 2298 | perf_mmap_data_init(struct perf_event *event, struct perf_mmap_data *data) | ||
| 2299 | { | ||
| 2300 | long max_size = perf_data_size(data); | ||
| 2301 | |||
| 2302 | atomic_set(&data->lock, -1); | ||
| 2303 | |||
| 2304 | if (event->attr.watermark) { | ||
| 2305 | data->watermark = min_t(long, max_size, | ||
| 2306 | event->attr.wakeup_watermark); | ||
| 2307 | } | ||
| 2308 | |||
| 2309 | if (!data->watermark) | ||
| 2310 | data->watermark = max_t(long, PAGE_SIZE, max_size / 2); | ||
| 2311 | |||
| 2312 | |||
| 2313 | rcu_assign_pointer(event->data, data); | ||
| 2314 | } | ||
| 2315 | |||
| 2316 | static void perf_mmap_data_free_rcu(struct rcu_head *rcu_head) | ||
| 2317 | { | ||
| 2318 | struct perf_mmap_data *data; | ||
| 2319 | |||
| 2320 | data = container_of(rcu_head, struct perf_mmap_data, rcu_head); | ||
| 2321 | perf_mmap_data_free(data); | ||
| 2221 | kfree(data); | 2322 | kfree(data); |
| 2222 | } | 2323 | } |
| 2223 | 2324 | ||
| 2224 | static void perf_mmap_data_free(struct perf_event *event) | 2325 | static void perf_mmap_data_release(struct perf_event *event) |
| 2225 | { | 2326 | { |
| 2226 | struct perf_mmap_data *data = event->data; | 2327 | struct perf_mmap_data *data = event->data; |
| 2227 | 2328 | ||
| 2228 | WARN_ON(atomic_read(&event->mmap_count)); | 2329 | WARN_ON(atomic_read(&event->mmap_count)); |
| 2229 | 2330 | ||
| 2230 | rcu_assign_pointer(event->data, NULL); | 2331 | rcu_assign_pointer(event->data, NULL); |
| 2231 | call_rcu(&data->rcu_head, __perf_mmap_data_free); | 2332 | call_rcu(&data->rcu_head, perf_mmap_data_free_rcu); |
| 2232 | } | 2333 | } |
| 2233 | 2334 | ||
| 2234 | static void perf_mmap_open(struct vm_area_struct *vma) | 2335 | static void perf_mmap_open(struct vm_area_struct *vma) |
| @@ -2244,16 +2345,17 @@ static void perf_mmap_close(struct vm_area_struct *vma) | |||
| 2244 | 2345 | ||
| 2245 | WARN_ON_ONCE(event->ctx->parent_ctx); | 2346 | WARN_ON_ONCE(event->ctx->parent_ctx); |
| 2246 | if (atomic_dec_and_mutex_lock(&event->mmap_count, &event->mmap_mutex)) { | 2347 | if (atomic_dec_and_mutex_lock(&event->mmap_count, &event->mmap_mutex)) { |
| 2348 | unsigned long size = perf_data_size(event->data); | ||
| 2247 | struct user_struct *user = current_user(); | 2349 | struct user_struct *user = current_user(); |
| 2248 | 2350 | ||
| 2249 | atomic_long_sub(event->data->nr_pages + 1, &user->locked_vm); | 2351 | atomic_long_sub((size >> PAGE_SHIFT) + 1, &user->locked_vm); |
| 2250 | vma->vm_mm->locked_vm -= event->data->nr_locked; | 2352 | vma->vm_mm->locked_vm -= event->data->nr_locked; |
| 2251 | perf_mmap_data_free(event); | 2353 | perf_mmap_data_release(event); |
| 2252 | mutex_unlock(&event->mmap_mutex); | 2354 | mutex_unlock(&event->mmap_mutex); |
| 2253 | } | 2355 | } |
| 2254 | } | 2356 | } |
| 2255 | 2357 | ||
| 2256 | static struct vm_operations_struct perf_mmap_vmops = { | 2358 | static const struct vm_operations_struct perf_mmap_vmops = { |
| 2257 | .open = perf_mmap_open, | 2359 | .open = perf_mmap_open, |
| 2258 | .close = perf_mmap_close, | 2360 | .close = perf_mmap_close, |
| 2259 | .fault = perf_mmap_fault, | 2361 | .fault = perf_mmap_fault, |
| @@ -2266,6 +2368,7 @@ static int perf_mmap(struct file *file, struct vm_area_struct *vma) | |||
| 2266 | unsigned long user_locked, user_lock_limit; | 2368 | unsigned long user_locked, user_lock_limit; |
| 2267 | struct user_struct *user = current_user(); | 2369 | struct user_struct *user = current_user(); |
| 2268 | unsigned long locked, lock_limit; | 2370 | unsigned long locked, lock_limit; |
| 2371 | struct perf_mmap_data *data; | ||
| 2269 | unsigned long vma_size; | 2372 | unsigned long vma_size; |
| 2270 | unsigned long nr_pages; | 2373 | unsigned long nr_pages; |
| 2271 | long user_extra, extra; | 2374 | long user_extra, extra; |
| @@ -2328,10 +2431,15 @@ static int perf_mmap(struct file *file, struct vm_area_struct *vma) | |||
| 2328 | } | 2431 | } |
| 2329 | 2432 | ||
| 2330 | WARN_ON(event->data); | 2433 | WARN_ON(event->data); |
| 2331 | ret = perf_mmap_data_alloc(event, nr_pages); | 2434 | |
| 2332 | if (ret) | 2435 | data = perf_mmap_data_alloc(event, nr_pages); |
| 2436 | ret = -ENOMEM; | ||
| 2437 | if (!data) | ||
| 2333 | goto unlock; | 2438 | goto unlock; |
| 2334 | 2439 | ||
| 2440 | ret = 0; | ||
| 2441 | perf_mmap_data_init(event, data); | ||
| 2442 | |||
| 2335 | atomic_set(&event->mmap_count, 1); | 2443 | atomic_set(&event->mmap_count, 1); |
| 2336 | atomic_long_add(user_extra, &user->locked_vm); | 2444 | atomic_long_add(user_extra, &user->locked_vm); |
| 2337 | vma->vm_mm->locked_vm += extra; | 2445 | vma->vm_mm->locked_vm += extra; |
| @@ -2519,7 +2627,7 @@ static bool perf_output_space(struct perf_mmap_data *data, unsigned long tail, | |||
| 2519 | if (!data->writable) | 2627 | if (!data->writable) |
| 2520 | return true; | 2628 | return true; |
| 2521 | 2629 | ||
| 2522 | mask = (data->nr_pages << PAGE_SHIFT) - 1; | 2630 | mask = perf_data_size(data) - 1; |
| 2523 | 2631 | ||
| 2524 | offset = (offset - tail) & mask; | 2632 | offset = (offset - tail) & mask; |
| 2525 | head = (head - tail) & mask; | 2633 | head = (head - tail) & mask; |
| @@ -2624,7 +2732,7 @@ void perf_output_copy(struct perf_output_handle *handle, | |||
| 2624 | const void *buf, unsigned int len) | 2732 | const void *buf, unsigned int len) |
| 2625 | { | 2733 | { |
| 2626 | unsigned int pages_mask; | 2734 | unsigned int pages_mask; |
| 2627 | unsigned int offset; | 2735 | unsigned long offset; |
| 2628 | unsigned int size; | 2736 | unsigned int size; |
| 2629 | void **pages; | 2737 | void **pages; |
| 2630 | 2738 | ||
| @@ -2633,12 +2741,14 @@ void perf_output_copy(struct perf_output_handle *handle, | |||
| 2633 | pages = handle->data->data_pages; | 2741 | pages = handle->data->data_pages; |
| 2634 | 2742 | ||
| 2635 | do { | 2743 | do { |
| 2636 | unsigned int page_offset; | 2744 | unsigned long page_offset; |
| 2745 | unsigned long page_size; | ||
| 2637 | int nr; | 2746 | int nr; |
| 2638 | 2747 | ||
| 2639 | nr = (offset >> PAGE_SHIFT) & pages_mask; | 2748 | nr = (offset >> PAGE_SHIFT) & pages_mask; |
| 2640 | page_offset = offset & (PAGE_SIZE - 1); | 2749 | page_size = 1UL << (handle->data->data_order + PAGE_SHIFT); |
| 2641 | size = min_t(unsigned int, PAGE_SIZE - page_offset, len); | 2750 | page_offset = offset & (page_size - 1); |
| 2751 | size = min_t(unsigned int, page_size - page_offset, len); | ||
| 2642 | 2752 | ||
| 2643 | memcpy(pages[nr] + page_offset, buf, size); | 2753 | memcpy(pages[nr] + page_offset, buf, size); |
| 2644 | 2754 | ||
| @@ -4781,9 +4891,7 @@ int perf_event_init_task(struct task_struct *child) | |||
| 4781 | * We dont have to disable NMIs - we are only looking at | 4891 | * We dont have to disable NMIs - we are only looking at |
| 4782 | * the list, not manipulating it: | 4892 | * the list, not manipulating it: |
| 4783 | */ | 4893 | */ |
| 4784 | list_for_each_entry_rcu(event, &parent_ctx->event_list, event_entry) { | 4894 | list_for_each_entry(event, &parent_ctx->group_list, group_entry) { |
| 4785 | if (event != event->group_leader) | ||
| 4786 | continue; | ||
| 4787 | 4895 | ||
| 4788 | if (!event->attr.inherit) { | 4896 | if (!event->attr.inherit) { |
| 4789 | inherited_all = 0; | 4897 | inherited_all = 0; |
diff --git a/kernel/pid_namespace.c b/kernel/pid_namespace.c index 821722ae58a7..86b3796b0436 100644 --- a/kernel/pid_namespace.c +++ b/kernel/pid_namespace.c | |||
| @@ -118,7 +118,7 @@ struct pid_namespace *copy_pid_ns(unsigned long flags, struct pid_namespace *old | |||
| 118 | { | 118 | { |
| 119 | if (!(flags & CLONE_NEWPID)) | 119 | if (!(flags & CLONE_NEWPID)) |
| 120 | return get_pid_ns(old_ns); | 120 | return get_pid_ns(old_ns); |
| 121 | if (flags & CLONE_THREAD) | 121 | if (flags & (CLONE_THREAD|CLONE_PARENT)) |
| 122 | return ERR_PTR(-EINVAL); | 122 | return ERR_PTR(-EINVAL); |
| 123 | return create_pid_namespace(old_ns); | 123 | return create_pid_namespace(old_ns); |
| 124 | } | 124 | } |
diff --git a/kernel/posix-cpu-timers.c b/kernel/posix-cpu-timers.c index e33a21cb9407..5c9dc228747b 100644 --- a/kernel/posix-cpu-timers.c +++ b/kernel/posix-cpu-timers.c | |||
| @@ -8,17 +8,18 @@ | |||
| 8 | #include <linux/math64.h> | 8 | #include <linux/math64.h> |
| 9 | #include <asm/uaccess.h> | 9 | #include <asm/uaccess.h> |
| 10 | #include <linux/kernel_stat.h> | 10 | #include <linux/kernel_stat.h> |
| 11 | #include <trace/events/timer.h> | ||
| 11 | 12 | ||
| 12 | /* | 13 | /* |
| 13 | * Called after updating RLIMIT_CPU to set timer expiration if necessary. | 14 | * Called after updating RLIMIT_CPU to set timer expiration if necessary. |
| 14 | */ | 15 | */ |
| 15 | void update_rlimit_cpu(unsigned long rlim_new) | 16 | void update_rlimit_cpu(unsigned long rlim_new) |
| 16 | { | 17 | { |
| 17 | cputime_t cputime; | 18 | cputime_t cputime = secs_to_cputime(rlim_new); |
| 19 | struct signal_struct *const sig = current->signal; | ||
| 18 | 20 | ||
| 19 | cputime = secs_to_cputime(rlim_new); | 21 | if (cputime_eq(sig->it[CPUCLOCK_PROF].expires, cputime_zero) || |
| 20 | if (cputime_eq(current->signal->it_prof_expires, cputime_zero) || | 22 | cputime_gt(sig->it[CPUCLOCK_PROF].expires, cputime)) { |
| 21 | cputime_gt(current->signal->it_prof_expires, cputime)) { | ||
| 22 | spin_lock_irq(¤t->sighand->siglock); | 23 | spin_lock_irq(¤t->sighand->siglock); |
| 23 | set_process_cpu_timer(current, CPUCLOCK_PROF, &cputime, NULL); | 24 | set_process_cpu_timer(current, CPUCLOCK_PROF, &cputime, NULL); |
| 24 | spin_unlock_irq(¤t->sighand->siglock); | 25 | spin_unlock_irq(¤t->sighand->siglock); |
| @@ -542,6 +543,17 @@ static void clear_dead_task(struct k_itimer *timer, union cpu_time_count now) | |||
| 542 | now); | 543 | now); |
| 543 | } | 544 | } |
| 544 | 545 | ||
| 546 | static inline int expires_gt(cputime_t expires, cputime_t new_exp) | ||
| 547 | { | ||
| 548 | return cputime_eq(expires, cputime_zero) || | ||
| 549 | cputime_gt(expires, new_exp); | ||
| 550 | } | ||
| 551 | |||
| 552 | static inline int expires_le(cputime_t expires, cputime_t new_exp) | ||
| 553 | { | ||
| 554 | return !cputime_eq(expires, cputime_zero) && | ||
| 555 | cputime_le(expires, new_exp); | ||
| 556 | } | ||
| 545 | /* | 557 | /* |
| 546 | * Insert the timer on the appropriate list before any timers that | 558 | * Insert the timer on the appropriate list before any timers that |
| 547 | * expire later. This must be called with the tasklist_lock held | 559 | * expire later. This must be called with the tasklist_lock held |
| @@ -586,34 +598,32 @@ static void arm_timer(struct k_itimer *timer, union cpu_time_count now) | |||
| 586 | */ | 598 | */ |
| 587 | 599 | ||
| 588 | if (CPUCLOCK_PERTHREAD(timer->it_clock)) { | 600 | if (CPUCLOCK_PERTHREAD(timer->it_clock)) { |
| 601 | union cpu_time_count *exp = &nt->expires; | ||
| 602 | |||
| 589 | switch (CPUCLOCK_WHICH(timer->it_clock)) { | 603 | switch (CPUCLOCK_WHICH(timer->it_clock)) { |
| 590 | default: | 604 | default: |
| 591 | BUG(); | 605 | BUG(); |
| 592 | case CPUCLOCK_PROF: | 606 | case CPUCLOCK_PROF: |
| 593 | if (cputime_eq(p->cputime_expires.prof_exp, | 607 | if (expires_gt(p->cputime_expires.prof_exp, |
| 594 | cputime_zero) || | 608 | exp->cpu)) |
| 595 | cputime_gt(p->cputime_expires.prof_exp, | 609 | p->cputime_expires.prof_exp = exp->cpu; |
| 596 | nt->expires.cpu)) | ||
| 597 | p->cputime_expires.prof_exp = | ||
| 598 | nt->expires.cpu; | ||
| 599 | break; | 610 | break; |
| 600 | case CPUCLOCK_VIRT: | 611 | case CPUCLOCK_VIRT: |
| 601 | if (cputime_eq(p->cputime_expires.virt_exp, | 612 | if (expires_gt(p->cputime_expires.virt_exp, |
| 602 | cputime_zero) || | 613 | exp->cpu)) |
| 603 | cputime_gt(p->cputime_expires.virt_exp, | 614 | p->cputime_expires.virt_exp = exp->cpu; |
| 604 | nt->expires.cpu)) | ||
| 605 | p->cputime_expires.virt_exp = | ||
| 606 | nt->expires.cpu; | ||
| 607 | break; | 615 | break; |
| 608 | case CPUCLOCK_SCHED: | 616 | case CPUCLOCK_SCHED: |
| 609 | if (p->cputime_expires.sched_exp == 0 || | 617 | if (p->cputime_expires.sched_exp == 0 || |
| 610 | p->cputime_expires.sched_exp > | 618 | p->cputime_expires.sched_exp > exp->sched) |
| 611 | nt->expires.sched) | ||
| 612 | p->cputime_expires.sched_exp = | 619 | p->cputime_expires.sched_exp = |
| 613 | nt->expires.sched; | 620 | exp->sched; |
| 614 | break; | 621 | break; |
| 615 | } | 622 | } |
| 616 | } else { | 623 | } else { |
| 624 | struct signal_struct *const sig = p->signal; | ||
| 625 | union cpu_time_count *exp = &timer->it.cpu.expires; | ||
| 626 | |||
| 617 | /* | 627 | /* |
| 618 | * For a process timer, set the cached expiration time. | 628 | * For a process timer, set the cached expiration time. |
| 619 | */ | 629 | */ |
| @@ -621,30 +631,23 @@ static void arm_timer(struct k_itimer *timer, union cpu_time_count now) | |||
| 621 | default: | 631 | default: |
| 622 | BUG(); | 632 | BUG(); |
| 623 | case CPUCLOCK_VIRT: | 633 | case CPUCLOCK_VIRT: |
| 624 | if (!cputime_eq(p->signal->it_virt_expires, | 634 | if (expires_le(sig->it[CPUCLOCK_VIRT].expires, |
| 625 | cputime_zero) && | 635 | exp->cpu)) |
| 626 | cputime_lt(p->signal->it_virt_expires, | ||
| 627 | timer->it.cpu.expires.cpu)) | ||
| 628 | break; | 636 | break; |
| 629 | p->signal->cputime_expires.virt_exp = | 637 | sig->cputime_expires.virt_exp = exp->cpu; |
| 630 | timer->it.cpu.expires.cpu; | ||
| 631 | break; | 638 | break; |
| 632 | case CPUCLOCK_PROF: | 639 | case CPUCLOCK_PROF: |
| 633 | if (!cputime_eq(p->signal->it_prof_expires, | 640 | if (expires_le(sig->it[CPUCLOCK_PROF].expires, |
| 634 | cputime_zero) && | 641 | exp->cpu)) |
| 635 | cputime_lt(p->signal->it_prof_expires, | ||
| 636 | timer->it.cpu.expires.cpu)) | ||
| 637 | break; | 642 | break; |
| 638 | i = p->signal->rlim[RLIMIT_CPU].rlim_cur; | 643 | i = sig->rlim[RLIMIT_CPU].rlim_cur; |
| 639 | if (i != RLIM_INFINITY && | 644 | if (i != RLIM_INFINITY && |
| 640 | i <= cputime_to_secs(timer->it.cpu.expires.cpu)) | 645 | i <= cputime_to_secs(exp->cpu)) |
| 641 | break; | 646 | break; |
| 642 | p->signal->cputime_expires.prof_exp = | 647 | sig->cputime_expires.prof_exp = exp->cpu; |
| 643 | timer->it.cpu.expires.cpu; | ||
| 644 | break; | 648 | break; |
| 645 | case CPUCLOCK_SCHED: | 649 | case CPUCLOCK_SCHED: |
| 646 | p->signal->cputime_expires.sched_exp = | 650 | sig->cputime_expires.sched_exp = exp->sched; |
| 647 | timer->it.cpu.expires.sched; | ||
| 648 | break; | 651 | break; |
| 649 | } | 652 | } |
| 650 | } | 653 | } |
| @@ -1071,6 +1074,40 @@ static void stop_process_timers(struct task_struct *tsk) | |||
| 1071 | spin_unlock_irqrestore(&cputimer->lock, flags); | 1074 | spin_unlock_irqrestore(&cputimer->lock, flags); |
| 1072 | } | 1075 | } |
| 1073 | 1076 | ||
| 1077 | static u32 onecputick; | ||
| 1078 | |||
| 1079 | static void check_cpu_itimer(struct task_struct *tsk, struct cpu_itimer *it, | ||
| 1080 | cputime_t *expires, cputime_t cur_time, int signo) | ||
| 1081 | { | ||
| 1082 | if (cputime_eq(it->expires, cputime_zero)) | ||
| 1083 | return; | ||
| 1084 | |||
| 1085 | if (cputime_ge(cur_time, it->expires)) { | ||
| 1086 | if (!cputime_eq(it->incr, cputime_zero)) { | ||
| 1087 | it->expires = cputime_add(it->expires, it->incr); | ||
| 1088 | it->error += it->incr_error; | ||
| 1089 | if (it->error >= onecputick) { | ||
| 1090 | it->expires = cputime_sub(it->expires, | ||
| 1091 | cputime_one_jiffy); | ||
| 1092 | it->error -= onecputick; | ||
| 1093 | } | ||
| 1094 | } else { | ||
| 1095 | it->expires = cputime_zero; | ||
| 1096 | } | ||
| 1097 | |||
| 1098 | trace_itimer_expire(signo == SIGPROF ? | ||
| 1099 | ITIMER_PROF : ITIMER_VIRTUAL, | ||
| 1100 | tsk->signal->leader_pid, cur_time); | ||
| 1101 | __group_send_sig_info(signo, SEND_SIG_PRIV, tsk); | ||
| 1102 | } | ||
| 1103 | |||
| 1104 | if (!cputime_eq(it->expires, cputime_zero) && | ||
| 1105 | (cputime_eq(*expires, cputime_zero) || | ||
| 1106 | cputime_lt(it->expires, *expires))) { | ||
| 1107 | *expires = it->expires; | ||
| 1108 | } | ||
| 1109 | } | ||
| 1110 | |||
| 1074 | /* | 1111 | /* |
| 1075 | * Check for any per-thread CPU timers that have fired and move them | 1112 | * Check for any per-thread CPU timers that have fired and move them |
| 1076 | * off the tsk->*_timers list onto the firing list. Per-thread timers | 1113 | * off the tsk->*_timers list onto the firing list. Per-thread timers |
| @@ -1090,10 +1127,10 @@ static void check_process_timers(struct task_struct *tsk, | |||
| 1090 | * Don't sample the current process CPU clocks if there are no timers. | 1127 | * Don't sample the current process CPU clocks if there are no timers. |
| 1091 | */ | 1128 | */ |
| 1092 | if (list_empty(&timers[CPUCLOCK_PROF]) && | 1129 | if (list_empty(&timers[CPUCLOCK_PROF]) && |
| 1093 | cputime_eq(sig->it_prof_expires, cputime_zero) && | 1130 | cputime_eq(sig->it[CPUCLOCK_PROF].expires, cputime_zero) && |
| 1094 | sig->rlim[RLIMIT_CPU].rlim_cur == RLIM_INFINITY && | 1131 | sig->rlim[RLIMIT_CPU].rlim_cur == RLIM_INFINITY && |
| 1095 | list_empty(&timers[CPUCLOCK_VIRT]) && | 1132 | list_empty(&timers[CPUCLOCK_VIRT]) && |
| 1096 | cputime_eq(sig->it_virt_expires, cputime_zero) && | 1133 | cputime_eq(sig->it[CPUCLOCK_VIRT].expires, cputime_zero) && |
| 1097 | list_empty(&timers[CPUCLOCK_SCHED])) { | 1134 | list_empty(&timers[CPUCLOCK_SCHED])) { |
| 1098 | stop_process_timers(tsk); | 1135 | stop_process_timers(tsk); |
| 1099 | return; | 1136 | return; |
| @@ -1153,38 +1190,11 @@ static void check_process_timers(struct task_struct *tsk, | |||
| 1153 | /* | 1190 | /* |
| 1154 | * Check for the special case process timers. | 1191 | * Check for the special case process timers. |
| 1155 | */ | 1192 | */ |
| 1156 | if (!cputime_eq(sig->it_prof_expires, cputime_zero)) { | 1193 | check_cpu_itimer(tsk, &sig->it[CPUCLOCK_PROF], &prof_expires, ptime, |
| 1157 | if (cputime_ge(ptime, sig->it_prof_expires)) { | 1194 | SIGPROF); |
| 1158 | /* ITIMER_PROF fires and reloads. */ | 1195 | check_cpu_itimer(tsk, &sig->it[CPUCLOCK_VIRT], &virt_expires, utime, |
| 1159 | sig->it_prof_expires = sig->it_prof_incr; | 1196 | SIGVTALRM); |
| 1160 | if (!cputime_eq(sig->it_prof_expires, cputime_zero)) { | 1197 | |
| 1161 | sig->it_prof_expires = cputime_add( | ||
| 1162 | sig->it_prof_expires, ptime); | ||
| 1163 | } | ||
| 1164 | __group_send_sig_info(SIGPROF, SEND_SIG_PRIV, tsk); | ||
| 1165 | } | ||
| 1166 | if (!cputime_eq(sig->it_prof_expires, cputime_zero) && | ||
| 1167 | (cputime_eq(prof_expires, cputime_zero) || | ||
| 1168 | cputime_lt(sig->it_prof_expires, prof_expires))) { | ||
| 1169 | prof_expires = sig->it_prof_expires; | ||
| 1170 | } | ||
| 1171 | } | ||
| 1172 | if (!cputime_eq(sig->it_virt_expires, cputime_zero)) { | ||
| 1173 | if (cputime_ge(utime, sig->it_virt_expires)) { | ||
| 1174 | /* ITIMER_VIRTUAL fires and reloads. */ | ||
| 1175 | sig->it_virt_expires = sig->it_virt_incr; | ||
| 1176 | if (!cputime_eq(sig->it_virt_expires, cputime_zero)) { | ||
| 1177 | sig->it_virt_expires = cputime_add( | ||
| 1178 | sig->it_virt_expires, utime); | ||
| 1179 | } | ||
| 1180 | __group_send_sig_info(SIGVTALRM, SEND_SIG_PRIV, tsk); | ||
| 1181 | } | ||
| 1182 | if (!cputime_eq(sig->it_virt_expires, cputime_zero) && | ||
| 1183 | (cputime_eq(virt_expires, cputime_zero) || | ||
| 1184 | cputime_lt(sig->it_virt_expires, virt_expires))) { | ||
| 1185 | virt_expires = sig->it_virt_expires; | ||
| 1186 | } | ||
| 1187 | } | ||
| 1188 | if (sig->rlim[RLIMIT_CPU].rlim_cur != RLIM_INFINITY) { | 1198 | if (sig->rlim[RLIMIT_CPU].rlim_cur != RLIM_INFINITY) { |
| 1189 | unsigned long psecs = cputime_to_secs(ptime); | 1199 | unsigned long psecs = cputime_to_secs(ptime); |
| 1190 | cputime_t x; | 1200 | cputime_t x; |
| @@ -1457,7 +1467,7 @@ void set_process_cpu_timer(struct task_struct *tsk, unsigned int clock_idx, | |||
| 1457 | if (!cputime_eq(*oldval, cputime_zero)) { | 1467 | if (!cputime_eq(*oldval, cputime_zero)) { |
| 1458 | if (cputime_le(*oldval, now.cpu)) { | 1468 | if (cputime_le(*oldval, now.cpu)) { |
| 1459 | /* Just about to fire. */ | 1469 | /* Just about to fire. */ |
| 1460 | *oldval = jiffies_to_cputime(1); | 1470 | *oldval = cputime_one_jiffy; |
| 1461 | } else { | 1471 | } else { |
| 1462 | *oldval = cputime_sub(*oldval, now.cpu); | 1472 | *oldval = cputime_sub(*oldval, now.cpu); |
| 1463 | } | 1473 | } |
| @@ -1703,10 +1713,15 @@ static __init int init_posix_cpu_timers(void) | |||
| 1703 | .nsleep = thread_cpu_nsleep, | 1713 | .nsleep = thread_cpu_nsleep, |
| 1704 | .nsleep_restart = thread_cpu_nsleep_restart, | 1714 | .nsleep_restart = thread_cpu_nsleep_restart, |
| 1705 | }; | 1715 | }; |
| 1716 | struct timespec ts; | ||
| 1706 | 1717 | ||
| 1707 | register_posix_clock(CLOCK_PROCESS_CPUTIME_ID, &process); | 1718 | register_posix_clock(CLOCK_PROCESS_CPUTIME_ID, &process); |
| 1708 | register_posix_clock(CLOCK_THREAD_CPUTIME_ID, &thread); | 1719 | register_posix_clock(CLOCK_THREAD_CPUTIME_ID, &thread); |
| 1709 | 1720 | ||
| 1721 | cputime_to_timespec(cputime_one_jiffy, &ts); | ||
| 1722 | onecputick = ts.tv_nsec; | ||
| 1723 | WARN_ON(ts.tv_sec != 0); | ||
| 1724 | |||
| 1710 | return 0; | 1725 | return 0; |
| 1711 | } | 1726 | } |
| 1712 | __initcall(init_posix_cpu_timers); | 1727 | __initcall(init_posix_cpu_timers); |
diff --git a/kernel/power/swap.c b/kernel/power/swap.c index 8ba052c86d48..b101cdc4df3f 100644 --- a/kernel/power/swap.c +++ b/kernel/power/swap.c | |||
| @@ -13,7 +13,6 @@ | |||
| 13 | 13 | ||
| 14 | #include <linux/module.h> | 14 | #include <linux/module.h> |
| 15 | #include <linux/file.h> | 15 | #include <linux/file.h> |
| 16 | #include <linux/utsname.h> | ||
| 17 | #include <linux/delay.h> | 16 | #include <linux/delay.h> |
| 18 | #include <linux/bitops.h> | 17 | #include <linux/bitops.h> |
| 19 | #include <linux/genhd.h> | 18 | #include <linux/genhd.h> |
diff --git a/kernel/printk.c b/kernel/printk.c index 602033acd6c7..f38b07f78a4e 100644 --- a/kernel/printk.c +++ b/kernel/printk.c | |||
| @@ -206,12 +206,11 @@ __setup("log_buf_len=", log_buf_len_setup); | |||
| 206 | #ifdef CONFIG_BOOT_PRINTK_DELAY | 206 | #ifdef CONFIG_BOOT_PRINTK_DELAY |
| 207 | 207 | ||
| 208 | static unsigned int boot_delay; /* msecs delay after each printk during bootup */ | 208 | static unsigned int boot_delay; /* msecs delay after each printk during bootup */ |
| 209 | static unsigned long long printk_delay_msec; /* per msec, based on boot_delay */ | 209 | static unsigned long long loops_per_msec; /* based on boot_delay */ |
| 210 | 210 | ||
| 211 | static int __init boot_delay_setup(char *str) | 211 | static int __init boot_delay_setup(char *str) |
| 212 | { | 212 | { |
| 213 | unsigned long lpj; | 213 | unsigned long lpj; |
| 214 | unsigned long long loops_per_msec; | ||
| 215 | 214 | ||
| 216 | lpj = preset_lpj ? preset_lpj : 1000000; /* some guess */ | 215 | lpj = preset_lpj ? preset_lpj : 1000000; /* some guess */ |
| 217 | loops_per_msec = (unsigned long long)lpj / 1000 * HZ; | 216 | loops_per_msec = (unsigned long long)lpj / 1000 * HZ; |
| @@ -220,10 +219,9 @@ static int __init boot_delay_setup(char *str) | |||
| 220 | if (boot_delay > 10 * 1000) | 219 | if (boot_delay > 10 * 1000) |
| 221 | boot_delay = 0; | 220 | boot_delay = 0; |
| 222 | 221 | ||
| 223 | printk_delay_msec = loops_per_msec; | 222 | pr_debug("boot_delay: %u, preset_lpj: %ld, lpj: %lu, " |
| 224 | printk(KERN_DEBUG "boot_delay: %u, preset_lpj: %ld, lpj: %lu, " | 223 | "HZ: %d, loops_per_msec: %llu\n", |
| 225 | "HZ: %d, printk_delay_msec: %llu\n", | 224 | boot_delay, preset_lpj, lpj, HZ, loops_per_msec); |
| 226 | boot_delay, preset_lpj, lpj, HZ, printk_delay_msec); | ||
| 227 | return 1; | 225 | return 1; |
| 228 | } | 226 | } |
| 229 | __setup("boot_delay=", boot_delay_setup); | 227 | __setup("boot_delay=", boot_delay_setup); |
| @@ -236,7 +234,7 @@ static void boot_delay_msec(void) | |||
| 236 | if (boot_delay == 0 || system_state != SYSTEM_BOOTING) | 234 | if (boot_delay == 0 || system_state != SYSTEM_BOOTING) |
| 237 | return; | 235 | return; |
| 238 | 236 | ||
| 239 | k = (unsigned long long)printk_delay_msec * boot_delay; | 237 | k = (unsigned long long)loops_per_msec * boot_delay; |
| 240 | 238 | ||
| 241 | timeout = jiffies + msecs_to_jiffies(boot_delay); | 239 | timeout = jiffies + msecs_to_jiffies(boot_delay); |
| 242 | while (k) { | 240 | while (k) { |
| @@ -655,6 +653,20 @@ static int recursion_bug; | |||
| 655 | static int new_text_line = 1; | 653 | static int new_text_line = 1; |
| 656 | static char printk_buf[1024]; | 654 | static char printk_buf[1024]; |
| 657 | 655 | ||
| 656 | int printk_delay_msec __read_mostly; | ||
| 657 | |||
| 658 | static inline void printk_delay(void) | ||
| 659 | { | ||
| 660 | if (unlikely(printk_delay_msec)) { | ||
| 661 | int m = printk_delay_msec; | ||
| 662 | |||
| 663 | while (m--) { | ||
| 664 | mdelay(1); | ||
| 665 | touch_nmi_watchdog(); | ||
| 666 | } | ||
| 667 | } | ||
| 668 | } | ||
| 669 | |||
| 658 | asmlinkage int vprintk(const char *fmt, va_list args) | 670 | asmlinkage int vprintk(const char *fmt, va_list args) |
| 659 | { | 671 | { |
| 660 | int printed_len = 0; | 672 | int printed_len = 0; |
| @@ -664,6 +676,7 @@ asmlinkage int vprintk(const char *fmt, va_list args) | |||
| 664 | char *p; | 676 | char *p; |
| 665 | 677 | ||
| 666 | boot_delay_msec(); | 678 | boot_delay_msec(); |
| 679 | printk_delay(); | ||
| 667 | 680 | ||
| 668 | preempt_disable(); | 681 | preempt_disable(); |
| 669 | /* This stops the holder of console_sem just where we want him */ | 682 | /* This stops the holder of console_sem just where we want him */ |
diff --git a/kernel/ptrace.c b/kernel/ptrace.c index 307c285af59e..23bd09cd042e 100644 --- a/kernel/ptrace.c +++ b/kernel/ptrace.c | |||
| @@ -266,9 +266,10 @@ static int ignoring_children(struct sighand_struct *sigh) | |||
| 266 | * or self-reaping. Do notification now if it would have happened earlier. | 266 | * or self-reaping. Do notification now if it would have happened earlier. |
| 267 | * If it should reap itself, return true. | 267 | * If it should reap itself, return true. |
| 268 | * | 268 | * |
| 269 | * If it's our own child, there is no notification to do. | 269 | * If it's our own child, there is no notification to do. But if our normal |
| 270 | * But if our normal children self-reap, then this child | 270 | * children self-reap, then this child was prevented by ptrace and we must |
| 271 | * was prevented by ptrace and we must reap it now. | 271 | * reap it now, in that case we must also wake up sub-threads sleeping in |
| 272 | * do_wait(). | ||
| 272 | */ | 273 | */ |
| 273 | static bool __ptrace_detach(struct task_struct *tracer, struct task_struct *p) | 274 | static bool __ptrace_detach(struct task_struct *tracer, struct task_struct *p) |
| 274 | { | 275 | { |
| @@ -278,8 +279,10 @@ static bool __ptrace_detach(struct task_struct *tracer, struct task_struct *p) | |||
| 278 | if (!task_detached(p) && thread_group_empty(p)) { | 279 | if (!task_detached(p) && thread_group_empty(p)) { |
| 279 | if (!same_thread_group(p->real_parent, tracer)) | 280 | if (!same_thread_group(p->real_parent, tracer)) |
| 280 | do_notify_parent(p, p->exit_signal); | 281 | do_notify_parent(p, p->exit_signal); |
| 281 | else if (ignoring_children(tracer->sighand)) | 282 | else if (ignoring_children(tracer->sighand)) { |
| 283 | __wake_up_parent(p, tracer); | ||
| 282 | p->exit_signal = -1; | 284 | p->exit_signal = -1; |
| 285 | } | ||
| 283 | } | 286 | } |
| 284 | if (task_detached(p)) { | 287 | if (task_detached(p)) { |
| 285 | /* Mark it as in the process of being reaped. */ | 288 | /* Mark it as in the process of being reaped. */ |
diff --git a/kernel/rcupdate.c b/kernel/rcupdate.c index 37ac45483082..400183346ad2 100644 --- a/kernel/rcupdate.c +++ b/kernel/rcupdate.c | |||
| @@ -46,22 +46,15 @@ | |||
| 46 | #include <linux/module.h> | 46 | #include <linux/module.h> |
| 47 | #include <linux/kernel_stat.h> | 47 | #include <linux/kernel_stat.h> |
| 48 | 48 | ||
| 49 | enum rcu_barrier { | 49 | #ifdef CONFIG_DEBUG_LOCK_ALLOC |
| 50 | RCU_BARRIER_STD, | 50 | static struct lock_class_key rcu_lock_key; |
| 51 | RCU_BARRIER_BH, | 51 | struct lockdep_map rcu_lock_map = |
| 52 | RCU_BARRIER_SCHED, | 52 | STATIC_LOCKDEP_MAP_INIT("rcu_read_lock", &rcu_lock_key); |
| 53 | }; | 53 | EXPORT_SYMBOL_GPL(rcu_lock_map); |
| 54 | #endif | ||
| 54 | 55 | ||
| 55 | static DEFINE_PER_CPU(struct rcu_head, rcu_barrier_head) = {NULL}; | ||
| 56 | static atomic_t rcu_barrier_cpu_count; | ||
| 57 | static DEFINE_MUTEX(rcu_barrier_mutex); | ||
| 58 | static struct completion rcu_barrier_completion; | ||
| 59 | int rcu_scheduler_active __read_mostly; | 56 | int rcu_scheduler_active __read_mostly; |
| 60 | 57 | ||
| 61 | static atomic_t rcu_migrate_type_count = ATOMIC_INIT(0); | ||
| 62 | static struct rcu_head rcu_migrate_head[3]; | ||
| 63 | static DECLARE_WAIT_QUEUE_HEAD(rcu_migrate_wq); | ||
| 64 | |||
| 65 | /* | 58 | /* |
| 66 | * Awaken the corresponding synchronize_rcu() instance now that a | 59 | * Awaken the corresponding synchronize_rcu() instance now that a |
| 67 | * grace period has elapsed. | 60 | * grace period has elapsed. |
| @@ -164,129 +157,10 @@ void synchronize_rcu_bh(void) | |||
| 164 | } | 157 | } |
| 165 | EXPORT_SYMBOL_GPL(synchronize_rcu_bh); | 158 | EXPORT_SYMBOL_GPL(synchronize_rcu_bh); |
| 166 | 159 | ||
| 167 | static void rcu_barrier_callback(struct rcu_head *notused) | ||
| 168 | { | ||
| 169 | if (atomic_dec_and_test(&rcu_barrier_cpu_count)) | ||
| 170 | complete(&rcu_barrier_completion); | ||
| 171 | } | ||
| 172 | |||
| 173 | /* | ||
| 174 | * Called with preemption disabled, and from cross-cpu IRQ context. | ||
| 175 | */ | ||
| 176 | static void rcu_barrier_func(void *type) | ||
| 177 | { | ||
| 178 | int cpu = smp_processor_id(); | ||
| 179 | struct rcu_head *head = &per_cpu(rcu_barrier_head, cpu); | ||
| 180 | |||
| 181 | atomic_inc(&rcu_barrier_cpu_count); | ||
| 182 | switch ((enum rcu_barrier)type) { | ||
| 183 | case RCU_BARRIER_STD: | ||
| 184 | call_rcu(head, rcu_barrier_callback); | ||
| 185 | break; | ||
| 186 | case RCU_BARRIER_BH: | ||
| 187 | call_rcu_bh(head, rcu_barrier_callback); | ||
| 188 | break; | ||
| 189 | case RCU_BARRIER_SCHED: | ||
| 190 | call_rcu_sched(head, rcu_barrier_callback); | ||
| 191 | break; | ||
| 192 | } | ||
| 193 | } | ||
| 194 | |||
| 195 | static inline void wait_migrated_callbacks(void) | ||
| 196 | { | ||
| 197 | wait_event(rcu_migrate_wq, !atomic_read(&rcu_migrate_type_count)); | ||
| 198 | smp_mb(); /* In case we didn't sleep. */ | ||
| 199 | } | ||
| 200 | |||
| 201 | /* | ||
| 202 | * Orchestrate the specified type of RCU barrier, waiting for all | ||
| 203 | * RCU callbacks of the specified type to complete. | ||
| 204 | */ | ||
| 205 | static void _rcu_barrier(enum rcu_barrier type) | ||
| 206 | { | ||
| 207 | BUG_ON(in_interrupt()); | ||
| 208 | /* Take cpucontrol mutex to protect against CPU hotplug */ | ||
| 209 | mutex_lock(&rcu_barrier_mutex); | ||
| 210 | init_completion(&rcu_barrier_completion); | ||
| 211 | /* | ||
| 212 | * Initialize rcu_barrier_cpu_count to 1, then invoke | ||
| 213 | * rcu_barrier_func() on each CPU, so that each CPU also has | ||
| 214 | * incremented rcu_barrier_cpu_count. Only then is it safe to | ||
| 215 | * decrement rcu_barrier_cpu_count -- otherwise the first CPU | ||
| 216 | * might complete its grace period before all of the other CPUs | ||
| 217 | * did their increment, causing this function to return too | ||
| 218 | * early. | ||
| 219 | */ | ||
| 220 | atomic_set(&rcu_barrier_cpu_count, 1); | ||
| 221 | on_each_cpu(rcu_barrier_func, (void *)type, 1); | ||
| 222 | if (atomic_dec_and_test(&rcu_barrier_cpu_count)) | ||
| 223 | complete(&rcu_barrier_completion); | ||
| 224 | wait_for_completion(&rcu_barrier_completion); | ||
| 225 | mutex_unlock(&rcu_barrier_mutex); | ||
| 226 | wait_migrated_callbacks(); | ||
| 227 | } | ||
| 228 | |||
| 229 | /** | ||
| 230 | * rcu_barrier - Wait until all in-flight call_rcu() callbacks complete. | ||
| 231 | */ | ||
| 232 | void rcu_barrier(void) | ||
| 233 | { | ||
| 234 | _rcu_barrier(RCU_BARRIER_STD); | ||
| 235 | } | ||
| 236 | EXPORT_SYMBOL_GPL(rcu_barrier); | ||
| 237 | |||
| 238 | /** | ||
| 239 | * rcu_barrier_bh - Wait until all in-flight call_rcu_bh() callbacks complete. | ||
| 240 | */ | ||
| 241 | void rcu_barrier_bh(void) | ||
| 242 | { | ||
| 243 | _rcu_barrier(RCU_BARRIER_BH); | ||
| 244 | } | ||
| 245 | EXPORT_SYMBOL_GPL(rcu_barrier_bh); | ||
| 246 | |||
| 247 | /** | ||
| 248 | * rcu_barrier_sched - Wait for in-flight call_rcu_sched() callbacks. | ||
| 249 | */ | ||
| 250 | void rcu_barrier_sched(void) | ||
| 251 | { | ||
| 252 | _rcu_barrier(RCU_BARRIER_SCHED); | ||
| 253 | } | ||
| 254 | EXPORT_SYMBOL_GPL(rcu_barrier_sched); | ||
| 255 | |||
| 256 | static void rcu_migrate_callback(struct rcu_head *notused) | ||
| 257 | { | ||
| 258 | if (atomic_dec_and_test(&rcu_migrate_type_count)) | ||
| 259 | wake_up(&rcu_migrate_wq); | ||
| 260 | } | ||
| 261 | |||
| 262 | extern int rcu_cpu_notify(struct notifier_block *self, | ||
| 263 | unsigned long action, void *hcpu); | ||
| 264 | |||
| 265 | static int __cpuinit rcu_barrier_cpu_hotplug(struct notifier_block *self, | 160 | static int __cpuinit rcu_barrier_cpu_hotplug(struct notifier_block *self, |
| 266 | unsigned long action, void *hcpu) | 161 | unsigned long action, void *hcpu) |
| 267 | { | 162 | { |
| 268 | rcu_cpu_notify(self, action, hcpu); | 163 | return rcu_cpu_notify(self, action, hcpu); |
| 269 | if (action == CPU_DYING) { | ||
| 270 | /* | ||
| 271 | * preempt_disable() in on_each_cpu() prevents stop_machine(), | ||
| 272 | * so when "on_each_cpu(rcu_barrier_func, (void *)type, 1);" | ||
| 273 | * returns, all online cpus have queued rcu_barrier_func(), | ||
| 274 | * and the dead cpu(if it exist) queues rcu_migrate_callback()s. | ||
| 275 | * | ||
| 276 | * These callbacks ensure _rcu_barrier() waits for all | ||
| 277 | * RCU callbacks of the specified type to complete. | ||
| 278 | */ | ||
| 279 | atomic_set(&rcu_migrate_type_count, 3); | ||
| 280 | call_rcu_bh(rcu_migrate_head, rcu_migrate_callback); | ||
| 281 | call_rcu_sched(rcu_migrate_head + 1, rcu_migrate_callback); | ||
| 282 | call_rcu(rcu_migrate_head + 2, rcu_migrate_callback); | ||
| 283 | } else if (action == CPU_DOWN_PREPARE) { | ||
| 284 | /* Don't need to wait until next removal operation. */ | ||
| 285 | /* rcu_migrate_head is protected by cpu_add_remove_lock */ | ||
| 286 | wait_migrated_callbacks(); | ||
| 287 | } | ||
| 288 | |||
| 289 | return NOTIFY_OK; | ||
| 290 | } | 164 | } |
| 291 | 165 | ||
| 292 | void __init rcu_init(void) | 166 | void __init rcu_init(void) |
diff --git a/kernel/rcutorture.c b/kernel/rcutorture.c index 233768f21f97..697c0a0229d4 100644 --- a/kernel/rcutorture.c +++ b/kernel/rcutorture.c | |||
| @@ -606,8 +606,6 @@ static struct rcu_torture_ops sched_ops_sync = { | |||
| 606 | .name = "sched_sync" | 606 | .name = "sched_sync" |
| 607 | }; | 607 | }; |
| 608 | 608 | ||
| 609 | extern int rcu_expedited_torture_stats(char *page); | ||
| 610 | |||
| 611 | static struct rcu_torture_ops sched_expedited_ops = { | 609 | static struct rcu_torture_ops sched_expedited_ops = { |
| 612 | .init = rcu_sync_torture_init, | 610 | .init = rcu_sync_torture_init, |
| 613 | .cleanup = NULL, | 611 | .cleanup = NULL, |
| @@ -650,7 +648,7 @@ rcu_torture_writer(void *arg) | |||
| 650 | old_rp = rcu_torture_current; | 648 | old_rp = rcu_torture_current; |
| 651 | rp->rtort_mbtest = 1; | 649 | rp->rtort_mbtest = 1; |
| 652 | rcu_assign_pointer(rcu_torture_current, rp); | 650 | rcu_assign_pointer(rcu_torture_current, rp); |
| 653 | smp_wmb(); | 651 | smp_wmb(); /* Mods to old_rp must follow rcu_assign_pointer() */ |
| 654 | if (old_rp) { | 652 | if (old_rp) { |
| 655 | i = old_rp->rtort_pipe_count; | 653 | i = old_rp->rtort_pipe_count; |
| 656 | if (i > RCU_TORTURE_PIPE_LEN) | 654 | if (i > RCU_TORTURE_PIPE_LEN) |
diff --git a/kernel/rcutree.c b/kernel/rcutree.c index 52b06f6e158c..705f02ac7433 100644 --- a/kernel/rcutree.c +++ b/kernel/rcutree.c | |||
| @@ -49,13 +49,6 @@ | |||
| 49 | 49 | ||
| 50 | #include "rcutree.h" | 50 | #include "rcutree.h" |
| 51 | 51 | ||
| 52 | #ifdef CONFIG_DEBUG_LOCK_ALLOC | ||
| 53 | static struct lock_class_key rcu_lock_key; | ||
| 54 | struct lockdep_map rcu_lock_map = | ||
| 55 | STATIC_LOCKDEP_MAP_INIT("rcu_read_lock", &rcu_lock_key); | ||
| 56 | EXPORT_SYMBOL_GPL(rcu_lock_map); | ||
| 57 | #endif | ||
| 58 | |||
| 59 | /* Data structures. */ | 52 | /* Data structures. */ |
| 60 | 53 | ||
| 61 | #define RCU_STATE_INITIALIZER(name) { \ | 54 | #define RCU_STATE_INITIALIZER(name) { \ |
| @@ -70,6 +63,9 @@ EXPORT_SYMBOL_GPL(rcu_lock_map); | |||
| 70 | .gpnum = -300, \ | 63 | .gpnum = -300, \ |
| 71 | .completed = -300, \ | 64 | .completed = -300, \ |
| 72 | .onofflock = __SPIN_LOCK_UNLOCKED(&name.onofflock), \ | 65 | .onofflock = __SPIN_LOCK_UNLOCKED(&name.onofflock), \ |
| 66 | .orphan_cbs_list = NULL, \ | ||
| 67 | .orphan_cbs_tail = &name.orphan_cbs_list, \ | ||
| 68 | .orphan_qlen = 0, \ | ||
| 73 | .fqslock = __SPIN_LOCK_UNLOCKED(&name.fqslock), \ | 69 | .fqslock = __SPIN_LOCK_UNLOCKED(&name.fqslock), \ |
| 74 | .n_force_qs = 0, \ | 70 | .n_force_qs = 0, \ |
| 75 | .n_force_qs_ngp = 0, \ | 71 | .n_force_qs_ngp = 0, \ |
| @@ -81,24 +77,16 @@ DEFINE_PER_CPU(struct rcu_data, rcu_sched_data); | |||
| 81 | struct rcu_state rcu_bh_state = RCU_STATE_INITIALIZER(rcu_bh_state); | 77 | struct rcu_state rcu_bh_state = RCU_STATE_INITIALIZER(rcu_bh_state); |
| 82 | DEFINE_PER_CPU(struct rcu_data, rcu_bh_data); | 78 | DEFINE_PER_CPU(struct rcu_data, rcu_bh_data); |
| 83 | 79 | ||
| 84 | extern long rcu_batches_completed_sched(void); | ||
| 85 | static struct rcu_node *rcu_get_root(struct rcu_state *rsp); | ||
| 86 | static void cpu_quiet_msk(unsigned long mask, struct rcu_state *rsp, | ||
| 87 | struct rcu_node *rnp, unsigned long flags); | ||
| 88 | static void cpu_quiet_msk_finish(struct rcu_state *rsp, unsigned long flags); | ||
| 89 | #ifdef CONFIG_HOTPLUG_CPU | ||
| 90 | static void __rcu_offline_cpu(int cpu, struct rcu_state *rsp); | ||
| 91 | #endif /* #ifdef CONFIG_HOTPLUG_CPU */ | ||
| 92 | static void __rcu_process_callbacks(struct rcu_state *rsp, | ||
| 93 | struct rcu_data *rdp); | ||
| 94 | static void __call_rcu(struct rcu_head *head, | ||
| 95 | void (*func)(struct rcu_head *rcu), | ||
| 96 | struct rcu_state *rsp); | ||
| 97 | static int __rcu_pending(struct rcu_state *rsp, struct rcu_data *rdp); | ||
| 98 | static void __cpuinit rcu_init_percpu_data(int cpu, struct rcu_state *rsp, | ||
| 99 | int preemptable); | ||
| 100 | 80 | ||
| 101 | #include "rcutree_plugin.h" | 81 | /* |
| 82 | * Return true if an RCU grace period is in progress. The ACCESS_ONCE()s | ||
| 83 | * permit this function to be invoked without holding the root rcu_node | ||
| 84 | * structure's ->lock, but of course results can be subject to change. | ||
| 85 | */ | ||
| 86 | static int rcu_gp_in_progress(struct rcu_state *rsp) | ||
| 87 | { | ||
| 88 | return ACCESS_ONCE(rsp->completed) != ACCESS_ONCE(rsp->gpnum); | ||
| 89 | } | ||
| 102 | 90 | ||
| 103 | /* | 91 | /* |
| 104 | * Note a quiescent state. Because we do not need to know | 92 | * Note a quiescent state. Because we do not need to know |
| @@ -137,6 +125,10 @@ static int blimit = 10; /* Maximum callbacks per softirq. */ | |||
| 137 | static int qhimark = 10000; /* If this many pending, ignore blimit. */ | 125 | static int qhimark = 10000; /* If this many pending, ignore blimit. */ |
| 138 | static int qlowmark = 100; /* Once only this many pending, use blimit. */ | 126 | static int qlowmark = 100; /* Once only this many pending, use blimit. */ |
| 139 | 127 | ||
| 128 | module_param(blimit, int, 0); | ||
| 129 | module_param(qhimark, int, 0); | ||
| 130 | module_param(qlowmark, int, 0); | ||
| 131 | |||
| 140 | static void force_quiescent_state(struct rcu_state *rsp, int relaxed); | 132 | static void force_quiescent_state(struct rcu_state *rsp, int relaxed); |
| 141 | static int rcu_pending(int cpu); | 133 | static int rcu_pending(int cpu); |
| 142 | 134 | ||
| @@ -173,9 +165,7 @@ cpu_has_callbacks_ready_to_invoke(struct rcu_data *rdp) | |||
| 173 | static int | 165 | static int |
| 174 | cpu_needs_another_gp(struct rcu_state *rsp, struct rcu_data *rdp) | 166 | cpu_needs_another_gp(struct rcu_state *rsp, struct rcu_data *rdp) |
| 175 | { | 167 | { |
| 176 | /* ACCESS_ONCE() because we are accessing outside of lock. */ | 168 | return *rdp->nxttail[RCU_DONE_TAIL] && !rcu_gp_in_progress(rsp); |
| 177 | return *rdp->nxttail[RCU_DONE_TAIL] && | ||
| 178 | ACCESS_ONCE(rsp->completed) == ACCESS_ONCE(rsp->gpnum); | ||
| 179 | } | 169 | } |
| 180 | 170 | ||
| 181 | /* | 171 | /* |
| @@ -369,7 +359,7 @@ static long dyntick_recall_completed(struct rcu_state *rsp) | |||
| 369 | /* | 359 | /* |
| 370 | * Snapshot the specified CPU's dynticks counter so that we can later | 360 | * Snapshot the specified CPU's dynticks counter so that we can later |
| 371 | * credit them with an implicit quiescent state. Return 1 if this CPU | 361 | * credit them with an implicit quiescent state. Return 1 if this CPU |
| 372 | * is already in a quiescent state courtesy of dynticks idle mode. | 362 | * is in dynticks idle mode, which is an extended quiescent state. |
| 373 | */ | 363 | */ |
| 374 | static int dyntick_save_progress_counter(struct rcu_data *rdp) | 364 | static int dyntick_save_progress_counter(struct rcu_data *rdp) |
| 375 | { | 365 | { |
| @@ -475,30 +465,34 @@ static void print_other_cpu_stall(struct rcu_state *rsp) | |||
| 475 | long delta; | 465 | long delta; |
| 476 | unsigned long flags; | 466 | unsigned long flags; |
| 477 | struct rcu_node *rnp = rcu_get_root(rsp); | 467 | struct rcu_node *rnp = rcu_get_root(rsp); |
| 478 | struct rcu_node *rnp_cur = rsp->level[NUM_RCU_LVLS - 1]; | ||
| 479 | struct rcu_node *rnp_end = &rsp->node[NUM_RCU_NODES]; | ||
| 480 | 468 | ||
| 481 | /* Only let one CPU complain about others per time interval. */ | 469 | /* Only let one CPU complain about others per time interval. */ |
| 482 | 470 | ||
| 483 | spin_lock_irqsave(&rnp->lock, flags); | 471 | spin_lock_irqsave(&rnp->lock, flags); |
| 484 | delta = jiffies - rsp->jiffies_stall; | 472 | delta = jiffies - rsp->jiffies_stall; |
| 485 | if (delta < RCU_STALL_RAT_DELAY || rsp->gpnum == rsp->completed) { | 473 | if (delta < RCU_STALL_RAT_DELAY || !rcu_gp_in_progress(rsp)) { |
| 486 | spin_unlock_irqrestore(&rnp->lock, flags); | 474 | spin_unlock_irqrestore(&rnp->lock, flags); |
| 487 | return; | 475 | return; |
| 488 | } | 476 | } |
| 489 | rsp->jiffies_stall = jiffies + RCU_SECONDS_TILL_STALL_RECHECK; | 477 | rsp->jiffies_stall = jiffies + RCU_SECONDS_TILL_STALL_RECHECK; |
| 478 | |||
| 479 | /* | ||
| 480 | * Now rat on any tasks that got kicked up to the root rcu_node | ||
| 481 | * due to CPU offlining. | ||
| 482 | */ | ||
| 483 | rcu_print_task_stall(rnp); | ||
| 490 | spin_unlock_irqrestore(&rnp->lock, flags); | 484 | spin_unlock_irqrestore(&rnp->lock, flags); |
| 491 | 485 | ||
| 492 | /* OK, time to rat on our buddy... */ | 486 | /* OK, time to rat on our buddy... */ |
| 493 | 487 | ||
| 494 | printk(KERN_ERR "INFO: RCU detected CPU stalls:"); | 488 | printk(KERN_ERR "INFO: RCU detected CPU stalls:"); |
| 495 | for (; rnp_cur < rnp_end; rnp_cur++) { | 489 | rcu_for_each_leaf_node(rsp, rnp) { |
| 496 | rcu_print_task_stall(rnp); | 490 | rcu_print_task_stall(rnp); |
| 497 | if (rnp_cur->qsmask == 0) | 491 | if (rnp->qsmask == 0) |
| 498 | continue; | 492 | continue; |
| 499 | for (cpu = 0; cpu <= rnp_cur->grphi - rnp_cur->grplo; cpu++) | 493 | for (cpu = 0; cpu <= rnp->grphi - rnp->grplo; cpu++) |
| 500 | if (rnp_cur->qsmask & (1UL << cpu)) | 494 | if (rnp->qsmask & (1UL << cpu)) |
| 501 | printk(" %d", rnp_cur->grplo + cpu); | 495 | printk(" %d", rnp->grplo + cpu); |
| 502 | } | 496 | } |
| 503 | printk(" (detected by %d, t=%ld jiffies)\n", | 497 | printk(" (detected by %d, t=%ld jiffies)\n", |
| 504 | smp_processor_id(), (long)(jiffies - rsp->gp_start)); | 498 | smp_processor_id(), (long)(jiffies - rsp->gp_start)); |
| @@ -537,8 +531,7 @@ static void check_cpu_stall(struct rcu_state *rsp, struct rcu_data *rdp) | |||
| 537 | /* We haven't checked in, so go dump stack. */ | 531 | /* We haven't checked in, so go dump stack. */ |
| 538 | print_cpu_stall(rsp); | 532 | print_cpu_stall(rsp); |
| 539 | 533 | ||
| 540 | } else if (rsp->gpnum != rsp->completed && | 534 | } else if (rcu_gp_in_progress(rsp) && delta >= RCU_STALL_RAT_DELAY) { |
| 541 | delta >= RCU_STALL_RAT_DELAY) { | ||
| 542 | 535 | ||
| 543 | /* They had two time units to dump stack, so complain. */ | 536 | /* They had two time units to dump stack, so complain. */ |
| 544 | print_other_cpu_stall(rsp); | 537 | print_other_cpu_stall(rsp); |
| @@ -617,9 +610,15 @@ rcu_start_gp(struct rcu_state *rsp, unsigned long flags) | |||
| 617 | note_new_gpnum(rsp, rdp); | 610 | note_new_gpnum(rsp, rdp); |
| 618 | 611 | ||
| 619 | /* | 612 | /* |
| 620 | * Because we are first, we know that all our callbacks will | 613 | * Because this CPU just now started the new grace period, we know |
| 621 | * be covered by this upcoming grace period, even the ones | 614 | * that all of its callbacks will be covered by this upcoming grace |
| 622 | * that were registered arbitrarily recently. | 615 | * period, even the ones that were registered arbitrarily recently. |
| 616 | * Therefore, advance all outstanding callbacks to RCU_WAIT_TAIL. | ||
| 617 | * | ||
| 618 | * Other CPUs cannot be sure exactly when the grace period started. | ||
| 619 | * Therefore, their recently registered callbacks must pass through | ||
| 620 | * an additional RCU_NEXT_READY stage, so that they will be handled | ||
| 621 | * by the next RCU grace period. | ||
| 623 | */ | 622 | */ |
| 624 | rdp->nxttail[RCU_NEXT_READY_TAIL] = rdp->nxttail[RCU_NEXT_TAIL]; | 623 | rdp->nxttail[RCU_NEXT_READY_TAIL] = rdp->nxttail[RCU_NEXT_TAIL]; |
| 625 | rdp->nxttail[RCU_WAIT_TAIL] = rdp->nxttail[RCU_NEXT_TAIL]; | 624 | rdp->nxttail[RCU_WAIT_TAIL] = rdp->nxttail[RCU_NEXT_TAIL]; |
| @@ -657,7 +656,7 @@ rcu_start_gp(struct rcu_state *rsp, unsigned long flags) | |||
| 657 | * one corresponding to this CPU, due to the fact that we have | 656 | * one corresponding to this CPU, due to the fact that we have |
| 658 | * irqs disabled. | 657 | * irqs disabled. |
| 659 | */ | 658 | */ |
| 660 | for (rnp = &rsp->node[0]; rnp < &rsp->node[NUM_RCU_NODES]; rnp++) { | 659 | rcu_for_each_node_breadth_first(rsp, rnp) { |
| 661 | spin_lock(&rnp->lock); /* irqs already disabled. */ | 660 | spin_lock(&rnp->lock); /* irqs already disabled. */ |
| 662 | rcu_preempt_check_blocked_tasks(rnp); | 661 | rcu_preempt_check_blocked_tasks(rnp); |
| 663 | rnp->qsmask = rnp->qsmaskinit; | 662 | rnp->qsmask = rnp->qsmaskinit; |
| @@ -703,9 +702,9 @@ rcu_process_gp_end(struct rcu_state *rsp, struct rcu_data *rdp) | |||
| 703 | * hold rnp->lock, as required by rcu_start_gp(), which will release it. | 702 | * hold rnp->lock, as required by rcu_start_gp(), which will release it. |
| 704 | */ | 703 | */ |
| 705 | static void cpu_quiet_msk_finish(struct rcu_state *rsp, unsigned long flags) | 704 | static void cpu_quiet_msk_finish(struct rcu_state *rsp, unsigned long flags) |
| 706 | __releases(rnp->lock) | 705 | __releases(rcu_get_root(rsp)->lock) |
| 707 | { | 706 | { |
| 708 | WARN_ON_ONCE(rsp->completed == rsp->gpnum); | 707 | WARN_ON_ONCE(!rcu_gp_in_progress(rsp)); |
| 709 | rsp->completed = rsp->gpnum; | 708 | rsp->completed = rsp->gpnum; |
| 710 | rcu_process_gp_end(rsp, rsp->rda[smp_processor_id()]); | 709 | rcu_process_gp_end(rsp, rsp->rda[smp_processor_id()]); |
| 711 | rcu_start_gp(rsp, flags); /* releases root node's rnp->lock. */ | 710 | rcu_start_gp(rsp, flags); /* releases root node's rnp->lock. */ |
| @@ -842,17 +841,63 @@ rcu_check_quiescent_state(struct rcu_state *rsp, struct rcu_data *rdp) | |||
| 842 | #ifdef CONFIG_HOTPLUG_CPU | 841 | #ifdef CONFIG_HOTPLUG_CPU |
| 843 | 842 | ||
| 844 | /* | 843 | /* |
| 844 | * Move a dying CPU's RCU callbacks to the ->orphan_cbs_list for the | ||
| 845 | * specified flavor of RCU. The callbacks will be adopted by the next | ||
| 846 | * _rcu_barrier() invocation or by the CPU_DEAD notifier, whichever | ||
| 847 | * comes first. Because this is invoked from the CPU_DYING notifier, | ||
| 848 | * irqs are already disabled. | ||
| 849 | */ | ||
| 850 | static void rcu_send_cbs_to_orphanage(struct rcu_state *rsp) | ||
| 851 | { | ||
| 852 | int i; | ||
| 853 | struct rcu_data *rdp = rsp->rda[smp_processor_id()]; | ||
| 854 | |||
| 855 | if (rdp->nxtlist == NULL) | ||
| 856 | return; /* irqs disabled, so comparison is stable. */ | ||
| 857 | spin_lock(&rsp->onofflock); /* irqs already disabled. */ | ||
| 858 | *rsp->orphan_cbs_tail = rdp->nxtlist; | ||
| 859 | rsp->orphan_cbs_tail = rdp->nxttail[RCU_NEXT_TAIL]; | ||
| 860 | rdp->nxtlist = NULL; | ||
| 861 | for (i = 0; i < RCU_NEXT_SIZE; i++) | ||
| 862 | rdp->nxttail[i] = &rdp->nxtlist; | ||
| 863 | rsp->orphan_qlen += rdp->qlen; | ||
| 864 | rdp->qlen = 0; | ||
| 865 | spin_unlock(&rsp->onofflock); /* irqs remain disabled. */ | ||
| 866 | } | ||
| 867 | |||
| 868 | /* | ||
| 869 | * Adopt previously orphaned RCU callbacks. | ||
| 870 | */ | ||
| 871 | static void rcu_adopt_orphan_cbs(struct rcu_state *rsp) | ||
| 872 | { | ||
| 873 | unsigned long flags; | ||
| 874 | struct rcu_data *rdp; | ||
| 875 | |||
| 876 | spin_lock_irqsave(&rsp->onofflock, flags); | ||
| 877 | rdp = rsp->rda[smp_processor_id()]; | ||
| 878 | if (rsp->orphan_cbs_list == NULL) { | ||
| 879 | spin_unlock_irqrestore(&rsp->onofflock, flags); | ||
| 880 | return; | ||
| 881 | } | ||
| 882 | *rdp->nxttail[RCU_NEXT_TAIL] = rsp->orphan_cbs_list; | ||
| 883 | rdp->nxttail[RCU_NEXT_TAIL] = rsp->orphan_cbs_tail; | ||
| 884 | rdp->qlen += rsp->orphan_qlen; | ||
| 885 | rsp->orphan_cbs_list = NULL; | ||
| 886 | rsp->orphan_cbs_tail = &rsp->orphan_cbs_list; | ||
| 887 | rsp->orphan_qlen = 0; | ||
| 888 | spin_unlock_irqrestore(&rsp->onofflock, flags); | ||
| 889 | } | ||
| 890 | |||
| 891 | /* | ||
| 845 | * Remove the outgoing CPU from the bitmasks in the rcu_node hierarchy | 892 | * Remove the outgoing CPU from the bitmasks in the rcu_node hierarchy |
| 846 | * and move all callbacks from the outgoing CPU to the current one. | 893 | * and move all callbacks from the outgoing CPU to the current one. |
| 847 | */ | 894 | */ |
| 848 | static void __rcu_offline_cpu(int cpu, struct rcu_state *rsp) | 895 | static void __rcu_offline_cpu(int cpu, struct rcu_state *rsp) |
| 849 | { | 896 | { |
| 850 | int i; | ||
| 851 | unsigned long flags; | 897 | unsigned long flags; |
| 852 | long lastcomp; | 898 | long lastcomp; |
| 853 | unsigned long mask; | 899 | unsigned long mask; |
| 854 | struct rcu_data *rdp = rsp->rda[cpu]; | 900 | struct rcu_data *rdp = rsp->rda[cpu]; |
| 855 | struct rcu_data *rdp_me; | ||
| 856 | struct rcu_node *rnp; | 901 | struct rcu_node *rnp; |
| 857 | 902 | ||
| 858 | /* Exclude any attempts to start a new grace period. */ | 903 | /* Exclude any attempts to start a new grace period. */ |
| @@ -875,32 +920,9 @@ static void __rcu_offline_cpu(int cpu, struct rcu_state *rsp) | |||
| 875 | } while (rnp != NULL); | 920 | } while (rnp != NULL); |
| 876 | lastcomp = rsp->completed; | 921 | lastcomp = rsp->completed; |
| 877 | 922 | ||
| 878 | spin_unlock(&rsp->onofflock); /* irqs remain disabled. */ | 923 | spin_unlock_irqrestore(&rsp->onofflock, flags); |
| 879 | 924 | ||
| 880 | /* | 925 | rcu_adopt_orphan_cbs(rsp); |
| 881 | * Move callbacks from the outgoing CPU to the running CPU. | ||
| 882 | * Note that the outgoing CPU is now quiscent, so it is now | ||
| 883 | * (uncharacteristically) safe to access its rcu_data structure. | ||
| 884 | * Note also that we must carefully retain the order of the | ||
| 885 | * outgoing CPU's callbacks in order for rcu_barrier() to work | ||
| 886 | * correctly. Finally, note that we start all the callbacks | ||
| 887 | * afresh, even those that have passed through a grace period | ||
| 888 | * and are therefore ready to invoke. The theory is that hotplug | ||
| 889 | * events are rare, and that if they are frequent enough to | ||
| 890 | * indefinitely delay callbacks, you have far worse things to | ||
| 891 | * be worrying about. | ||
| 892 | */ | ||
| 893 | rdp_me = rsp->rda[smp_processor_id()]; | ||
| 894 | if (rdp->nxtlist != NULL) { | ||
| 895 | *rdp_me->nxttail[RCU_NEXT_TAIL] = rdp->nxtlist; | ||
| 896 | rdp_me->nxttail[RCU_NEXT_TAIL] = rdp->nxttail[RCU_NEXT_TAIL]; | ||
| 897 | rdp->nxtlist = NULL; | ||
| 898 | for (i = 0; i < RCU_NEXT_SIZE; i++) | ||
| 899 | rdp->nxttail[i] = &rdp->nxtlist; | ||
| 900 | rdp_me->qlen += rdp->qlen; | ||
| 901 | rdp->qlen = 0; | ||
| 902 | } | ||
| 903 | local_irq_restore(flags); | ||
| 904 | } | 926 | } |
| 905 | 927 | ||
| 906 | /* | 928 | /* |
| @@ -918,6 +940,14 @@ static void rcu_offline_cpu(int cpu) | |||
| 918 | 940 | ||
| 919 | #else /* #ifdef CONFIG_HOTPLUG_CPU */ | 941 | #else /* #ifdef CONFIG_HOTPLUG_CPU */ |
| 920 | 942 | ||
| 943 | static void rcu_send_cbs_to_orphanage(struct rcu_state *rsp) | ||
| 944 | { | ||
| 945 | } | ||
| 946 | |||
| 947 | static void rcu_adopt_orphan_cbs(struct rcu_state *rsp) | ||
| 948 | { | ||
| 949 | } | ||
| 950 | |||
| 921 | static void rcu_offline_cpu(int cpu) | 951 | static void rcu_offline_cpu(int cpu) |
| 922 | { | 952 | { |
| 923 | } | 953 | } |
| @@ -1050,33 +1080,32 @@ static int rcu_process_dyntick(struct rcu_state *rsp, long lastcomp, | |||
| 1050 | int cpu; | 1080 | int cpu; |
| 1051 | unsigned long flags; | 1081 | unsigned long flags; |
| 1052 | unsigned long mask; | 1082 | unsigned long mask; |
| 1053 | struct rcu_node *rnp_cur = rsp->level[NUM_RCU_LVLS - 1]; | 1083 | struct rcu_node *rnp; |
| 1054 | struct rcu_node *rnp_end = &rsp->node[NUM_RCU_NODES]; | ||
| 1055 | 1084 | ||
| 1056 | for (; rnp_cur < rnp_end; rnp_cur++) { | 1085 | rcu_for_each_leaf_node(rsp, rnp) { |
| 1057 | mask = 0; | 1086 | mask = 0; |
| 1058 | spin_lock_irqsave(&rnp_cur->lock, flags); | 1087 | spin_lock_irqsave(&rnp->lock, flags); |
| 1059 | if (rsp->completed != lastcomp) { | 1088 | if (rsp->completed != lastcomp) { |
| 1060 | spin_unlock_irqrestore(&rnp_cur->lock, flags); | 1089 | spin_unlock_irqrestore(&rnp->lock, flags); |
| 1061 | return 1; | 1090 | return 1; |
| 1062 | } | 1091 | } |
| 1063 | if (rnp_cur->qsmask == 0) { | 1092 | if (rnp->qsmask == 0) { |
| 1064 | spin_unlock_irqrestore(&rnp_cur->lock, flags); | 1093 | spin_unlock_irqrestore(&rnp->lock, flags); |
| 1065 | continue; | 1094 | continue; |
| 1066 | } | 1095 | } |
| 1067 | cpu = rnp_cur->grplo; | 1096 | cpu = rnp->grplo; |
| 1068 | bit = 1; | 1097 | bit = 1; |
| 1069 | for (; cpu <= rnp_cur->grphi; cpu++, bit <<= 1) { | 1098 | for (; cpu <= rnp->grphi; cpu++, bit <<= 1) { |
| 1070 | if ((rnp_cur->qsmask & bit) != 0 && f(rsp->rda[cpu])) | 1099 | if ((rnp->qsmask & bit) != 0 && f(rsp->rda[cpu])) |
| 1071 | mask |= bit; | 1100 | mask |= bit; |
| 1072 | } | 1101 | } |
| 1073 | if (mask != 0 && rsp->completed == lastcomp) { | 1102 | if (mask != 0 && rsp->completed == lastcomp) { |
| 1074 | 1103 | ||
| 1075 | /* cpu_quiet_msk() releases rnp_cur->lock. */ | 1104 | /* cpu_quiet_msk() releases rnp->lock. */ |
| 1076 | cpu_quiet_msk(mask, rsp, rnp_cur, flags); | 1105 | cpu_quiet_msk(mask, rsp, rnp, flags); |
| 1077 | continue; | 1106 | continue; |
| 1078 | } | 1107 | } |
| 1079 | spin_unlock_irqrestore(&rnp_cur->lock, flags); | 1108 | spin_unlock_irqrestore(&rnp->lock, flags); |
| 1080 | } | 1109 | } |
| 1081 | return 0; | 1110 | return 0; |
| 1082 | } | 1111 | } |
| @@ -1092,7 +1121,7 @@ static void force_quiescent_state(struct rcu_state *rsp, int relaxed) | |||
| 1092 | struct rcu_node *rnp = rcu_get_root(rsp); | 1121 | struct rcu_node *rnp = rcu_get_root(rsp); |
| 1093 | u8 signaled; | 1122 | u8 signaled; |
| 1094 | 1123 | ||
| 1095 | if (ACCESS_ONCE(rsp->completed) == ACCESS_ONCE(rsp->gpnum)) | 1124 | if (!rcu_gp_in_progress(rsp)) |
| 1096 | return; /* No grace period in progress, nothing to force. */ | 1125 | return; /* No grace period in progress, nothing to force. */ |
| 1097 | if (!spin_trylock_irqsave(&rsp->fqslock, flags)) { | 1126 | if (!spin_trylock_irqsave(&rsp->fqslock, flags)) { |
| 1098 | rsp->n_force_qs_lh++; /* Inexact, can lose counts. Tough! */ | 1127 | rsp->n_force_qs_lh++; /* Inexact, can lose counts. Tough! */ |
| @@ -1251,7 +1280,7 @@ __call_rcu(struct rcu_head *head, void (*func)(struct rcu_head *rcu), | |||
| 1251 | rdp->nxttail[RCU_NEXT_TAIL] = &head->next; | 1280 | rdp->nxttail[RCU_NEXT_TAIL] = &head->next; |
| 1252 | 1281 | ||
| 1253 | /* Start a new grace period if one not already started. */ | 1282 | /* Start a new grace period if one not already started. */ |
| 1254 | if (ACCESS_ONCE(rsp->completed) == ACCESS_ONCE(rsp->gpnum)) { | 1283 | if (!rcu_gp_in_progress(rsp)) { |
| 1255 | unsigned long nestflag; | 1284 | unsigned long nestflag; |
| 1256 | struct rcu_node *rnp_root = rcu_get_root(rsp); | 1285 | struct rcu_node *rnp_root = rcu_get_root(rsp); |
| 1257 | 1286 | ||
| @@ -1331,7 +1360,7 @@ static int __rcu_pending(struct rcu_state *rsp, struct rcu_data *rdp) | |||
| 1331 | } | 1360 | } |
| 1332 | 1361 | ||
| 1333 | /* Has an RCU GP gone long enough to send resched IPIs &c? */ | 1362 | /* Has an RCU GP gone long enough to send resched IPIs &c? */ |
| 1334 | if (ACCESS_ONCE(rsp->completed) != ACCESS_ONCE(rsp->gpnum) && | 1363 | if (rcu_gp_in_progress(rsp) && |
| 1335 | ((long)(ACCESS_ONCE(rsp->jiffies_force_qs) - jiffies) < 0)) { | 1364 | ((long)(ACCESS_ONCE(rsp->jiffies_force_qs) - jiffies) < 0)) { |
| 1336 | rdp->n_rp_need_fqs++; | 1365 | rdp->n_rp_need_fqs++; |
| 1337 | return 1; | 1366 | return 1; |
| @@ -1368,6 +1397,82 @@ int rcu_needs_cpu(int cpu) | |||
| 1368 | rcu_preempt_needs_cpu(cpu); | 1397 | rcu_preempt_needs_cpu(cpu); |
| 1369 | } | 1398 | } |
| 1370 | 1399 | ||
| 1400 | static DEFINE_PER_CPU(struct rcu_head, rcu_barrier_head) = {NULL}; | ||
| 1401 | static atomic_t rcu_barrier_cpu_count; | ||
| 1402 | static DEFINE_MUTEX(rcu_barrier_mutex); | ||
| 1403 | static struct completion rcu_barrier_completion; | ||
| 1404 | |||
| 1405 | static void rcu_barrier_callback(struct rcu_head *notused) | ||
| 1406 | { | ||
| 1407 | if (atomic_dec_and_test(&rcu_barrier_cpu_count)) | ||
| 1408 | complete(&rcu_barrier_completion); | ||
| 1409 | } | ||
| 1410 | |||
| 1411 | /* | ||
| 1412 | * Called with preemption disabled, and from cross-cpu IRQ context. | ||
| 1413 | */ | ||
| 1414 | static void rcu_barrier_func(void *type) | ||
| 1415 | { | ||
| 1416 | int cpu = smp_processor_id(); | ||
| 1417 | struct rcu_head *head = &per_cpu(rcu_barrier_head, cpu); | ||
| 1418 | void (*call_rcu_func)(struct rcu_head *head, | ||
| 1419 | void (*func)(struct rcu_head *head)); | ||
| 1420 | |||
| 1421 | atomic_inc(&rcu_barrier_cpu_count); | ||
| 1422 | call_rcu_func = type; | ||
| 1423 | call_rcu_func(head, rcu_barrier_callback); | ||
| 1424 | } | ||
| 1425 | |||
| 1426 | /* | ||
| 1427 | * Orchestrate the specified type of RCU barrier, waiting for all | ||
| 1428 | * RCU callbacks of the specified type to complete. | ||
| 1429 | */ | ||
| 1430 | static void _rcu_barrier(struct rcu_state *rsp, | ||
| 1431 | void (*call_rcu_func)(struct rcu_head *head, | ||
| 1432 | void (*func)(struct rcu_head *head))) | ||
| 1433 | { | ||
| 1434 | BUG_ON(in_interrupt()); | ||
| 1435 | /* Take mutex to serialize concurrent rcu_barrier() requests. */ | ||
| 1436 | mutex_lock(&rcu_barrier_mutex); | ||
| 1437 | init_completion(&rcu_barrier_completion); | ||
| 1438 | /* | ||
| 1439 | * Initialize rcu_barrier_cpu_count to 1, then invoke | ||
| 1440 | * rcu_barrier_func() on each CPU, so that each CPU also has | ||
| 1441 | * incremented rcu_barrier_cpu_count. Only then is it safe to | ||
| 1442 | * decrement rcu_barrier_cpu_count -- otherwise the first CPU | ||
| 1443 | * might complete its grace period before all of the other CPUs | ||
| 1444 | * did their increment, causing this function to return too | ||
| 1445 | * early. | ||
| 1446 | */ | ||
| 1447 | atomic_set(&rcu_barrier_cpu_count, 1); | ||
| 1448 | preempt_disable(); /* stop CPU_DYING from filling orphan_cbs_list */ | ||
| 1449 | rcu_adopt_orphan_cbs(rsp); | ||
| 1450 | on_each_cpu(rcu_barrier_func, (void *)call_rcu_func, 1); | ||
| 1451 | preempt_enable(); /* CPU_DYING can again fill orphan_cbs_list */ | ||
| 1452 | if (atomic_dec_and_test(&rcu_barrier_cpu_count)) | ||
| 1453 | complete(&rcu_barrier_completion); | ||
| 1454 | wait_for_completion(&rcu_barrier_completion); | ||
| 1455 | mutex_unlock(&rcu_barrier_mutex); | ||
| 1456 | } | ||
| 1457 | |||
| 1458 | /** | ||
| 1459 | * rcu_barrier_bh - Wait until all in-flight call_rcu_bh() callbacks complete. | ||
| 1460 | */ | ||
| 1461 | void rcu_barrier_bh(void) | ||
| 1462 | { | ||
| 1463 | _rcu_barrier(&rcu_bh_state, call_rcu_bh); | ||
| 1464 | } | ||
| 1465 | EXPORT_SYMBOL_GPL(rcu_barrier_bh); | ||
| 1466 | |||
| 1467 | /** | ||
| 1468 | * rcu_barrier_sched - Wait for in-flight call_rcu_sched() callbacks. | ||
| 1469 | */ | ||
| 1470 | void rcu_barrier_sched(void) | ||
| 1471 | { | ||
| 1472 | _rcu_barrier(&rcu_sched_state, call_rcu_sched); | ||
| 1473 | } | ||
| 1474 | EXPORT_SYMBOL_GPL(rcu_barrier_sched); | ||
| 1475 | |||
| 1371 | /* | 1476 | /* |
| 1372 | * Do boot-time initialization of a CPU's per-CPU RCU data. | 1477 | * Do boot-time initialization of a CPU's per-CPU RCU data. |
| 1373 | */ | 1478 | */ |
| @@ -1464,6 +1569,22 @@ int __cpuinit rcu_cpu_notify(struct notifier_block *self, | |||
| 1464 | case CPU_UP_PREPARE_FROZEN: | 1569 | case CPU_UP_PREPARE_FROZEN: |
| 1465 | rcu_online_cpu(cpu); | 1570 | rcu_online_cpu(cpu); |
| 1466 | break; | 1571 | break; |
| 1572 | case CPU_DYING: | ||
| 1573 | case CPU_DYING_FROZEN: | ||
| 1574 | /* | ||
| 1575 | * preempt_disable() in _rcu_barrier() prevents stop_machine(), | ||
| 1576 | * so when "on_each_cpu(rcu_barrier_func, (void *)type, 1);" | ||
| 1577 | * returns, all online cpus have queued rcu_barrier_func(). | ||
| 1578 | * The dying CPU clears its cpu_online_mask bit and | ||
| 1579 | * moves all of its RCU callbacks to ->orphan_cbs_list | ||
| 1580 | * in the context of stop_machine(), so subsequent calls | ||
| 1581 | * to _rcu_barrier() will adopt these callbacks and only | ||
| 1582 | * then queue rcu_barrier_func() on all remaining CPUs. | ||
| 1583 | */ | ||
| 1584 | rcu_send_cbs_to_orphanage(&rcu_bh_state); | ||
| 1585 | rcu_send_cbs_to_orphanage(&rcu_sched_state); | ||
| 1586 | rcu_preempt_send_cbs_to_orphanage(); | ||
| 1587 | break; | ||
| 1467 | case CPU_DEAD: | 1588 | case CPU_DEAD: |
| 1468 | case CPU_DEAD_FROZEN: | 1589 | case CPU_DEAD_FROZEN: |
| 1469 | case CPU_UP_CANCELED: | 1590 | case CPU_UP_CANCELED: |
| @@ -1526,7 +1647,8 @@ static void __init rcu_init_one(struct rcu_state *rsp) | |||
| 1526 | cpustride *= rsp->levelspread[i]; | 1647 | cpustride *= rsp->levelspread[i]; |
| 1527 | rnp = rsp->level[i]; | 1648 | rnp = rsp->level[i]; |
| 1528 | for (j = 0; j < rsp->levelcnt[i]; j++, rnp++) { | 1649 | for (j = 0; j < rsp->levelcnt[i]; j++, rnp++) { |
| 1529 | spin_lock_init(&rnp->lock); | 1650 | if (rnp != rcu_get_root(rsp)) |
| 1651 | spin_lock_init(&rnp->lock); | ||
| 1530 | rnp->gpnum = 0; | 1652 | rnp->gpnum = 0; |
| 1531 | rnp->qsmask = 0; | 1653 | rnp->qsmask = 0; |
| 1532 | rnp->qsmaskinit = 0; | 1654 | rnp->qsmaskinit = 0; |
| @@ -1549,6 +1671,7 @@ static void __init rcu_init_one(struct rcu_state *rsp) | |||
| 1549 | INIT_LIST_HEAD(&rnp->blocked_tasks[1]); | 1671 | INIT_LIST_HEAD(&rnp->blocked_tasks[1]); |
| 1550 | } | 1672 | } |
| 1551 | } | 1673 | } |
| 1674 | spin_lock_init(&rcu_get_root(rsp)->lock); | ||
| 1552 | } | 1675 | } |
| 1553 | 1676 | ||
| 1554 | /* | 1677 | /* |
| @@ -1558,6 +1681,10 @@ static void __init rcu_init_one(struct rcu_state *rsp) | |||
| 1558 | */ | 1681 | */ |
| 1559 | #define RCU_INIT_FLAVOR(rsp, rcu_data) \ | 1682 | #define RCU_INIT_FLAVOR(rsp, rcu_data) \ |
| 1560 | do { \ | 1683 | do { \ |
| 1684 | int i; \ | ||
| 1685 | int j; \ | ||
| 1686 | struct rcu_node *rnp; \ | ||
| 1687 | \ | ||
| 1561 | rcu_init_one(rsp); \ | 1688 | rcu_init_one(rsp); \ |
| 1562 | rnp = (rsp)->level[NUM_RCU_LVLS - 1]; \ | 1689 | rnp = (rsp)->level[NUM_RCU_LVLS - 1]; \ |
| 1563 | j = 0; \ | 1690 | j = 0; \ |
| @@ -1570,31 +1697,8 @@ do { \ | |||
| 1570 | } \ | 1697 | } \ |
| 1571 | } while (0) | 1698 | } while (0) |
| 1572 | 1699 | ||
| 1573 | #ifdef CONFIG_TREE_PREEMPT_RCU | ||
| 1574 | |||
| 1575 | void __init __rcu_init_preempt(void) | ||
| 1576 | { | ||
| 1577 | int i; /* All used by RCU_INIT_FLAVOR(). */ | ||
| 1578 | int j; | ||
| 1579 | struct rcu_node *rnp; | ||
| 1580 | |||
| 1581 | RCU_INIT_FLAVOR(&rcu_preempt_state, rcu_preempt_data); | ||
| 1582 | } | ||
| 1583 | |||
| 1584 | #else /* #ifdef CONFIG_TREE_PREEMPT_RCU */ | ||
| 1585 | |||
| 1586 | void __init __rcu_init_preempt(void) | ||
| 1587 | { | ||
| 1588 | } | ||
| 1589 | |||
| 1590 | #endif /* #else #ifdef CONFIG_TREE_PREEMPT_RCU */ | ||
| 1591 | |||
| 1592 | void __init __rcu_init(void) | 1700 | void __init __rcu_init(void) |
| 1593 | { | 1701 | { |
| 1594 | int i; /* All used by RCU_INIT_FLAVOR(). */ | ||
| 1595 | int j; | ||
| 1596 | struct rcu_node *rnp; | ||
| 1597 | |||
| 1598 | rcu_bootup_announce(); | 1702 | rcu_bootup_announce(); |
| 1599 | #ifdef CONFIG_RCU_CPU_STALL_DETECTOR | 1703 | #ifdef CONFIG_RCU_CPU_STALL_DETECTOR |
| 1600 | printk(KERN_INFO "RCU-based detection of stalled CPUs is enabled.\n"); | 1704 | printk(KERN_INFO "RCU-based detection of stalled CPUs is enabled.\n"); |
| @@ -1605,6 +1709,4 @@ void __init __rcu_init(void) | |||
| 1605 | open_softirq(RCU_SOFTIRQ, rcu_process_callbacks); | 1709 | open_softirq(RCU_SOFTIRQ, rcu_process_callbacks); |
| 1606 | } | 1710 | } |
| 1607 | 1711 | ||
| 1608 | module_param(blimit, int, 0); | 1712 | #include "rcutree_plugin.h" |
| 1609 | module_param(qhimark, int, 0); | ||
| 1610 | module_param(qlowmark, int, 0); | ||
diff --git a/kernel/rcutree.h b/kernel/rcutree.h index 8e8287a983c2..b40ac5706040 100644 --- a/kernel/rcutree.h +++ b/kernel/rcutree.h | |||
| @@ -48,14 +48,14 @@ | |||
| 48 | #elif NR_CPUS <= RCU_FANOUT_SQ | 48 | #elif NR_CPUS <= RCU_FANOUT_SQ |
| 49 | # define NUM_RCU_LVLS 2 | 49 | # define NUM_RCU_LVLS 2 |
| 50 | # define NUM_RCU_LVL_0 1 | 50 | # define NUM_RCU_LVL_0 1 |
| 51 | # define NUM_RCU_LVL_1 (((NR_CPUS) + RCU_FANOUT - 1) / RCU_FANOUT) | 51 | # define NUM_RCU_LVL_1 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT) |
| 52 | # define NUM_RCU_LVL_2 (NR_CPUS) | 52 | # define NUM_RCU_LVL_2 (NR_CPUS) |
| 53 | # define NUM_RCU_LVL_3 0 | 53 | # define NUM_RCU_LVL_3 0 |
| 54 | #elif NR_CPUS <= RCU_FANOUT_CUBE | 54 | #elif NR_CPUS <= RCU_FANOUT_CUBE |
| 55 | # define NUM_RCU_LVLS 3 | 55 | # define NUM_RCU_LVLS 3 |
| 56 | # define NUM_RCU_LVL_0 1 | 56 | # define NUM_RCU_LVL_0 1 |
| 57 | # define NUM_RCU_LVL_1 (((NR_CPUS) + RCU_FANOUT_SQ - 1) / RCU_FANOUT_SQ) | 57 | # define NUM_RCU_LVL_1 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT_SQ) |
| 58 | # define NUM_RCU_LVL_2 (((NR_CPUS) + (RCU_FANOUT) - 1) / (RCU_FANOUT)) | 58 | # define NUM_RCU_LVL_2 DIV_ROUND_UP(NR_CPUS, RCU_FANOUT) |
| 59 | # define NUM_RCU_LVL_3 NR_CPUS | 59 | # define NUM_RCU_LVL_3 NR_CPUS |
| 60 | #else | 60 | #else |
| 61 | # error "CONFIG_RCU_FANOUT insufficient for NR_CPUS" | 61 | # error "CONFIG_RCU_FANOUT insufficient for NR_CPUS" |
| @@ -79,15 +79,21 @@ struct rcu_dynticks { | |||
| 79 | * Definition for node within the RCU grace-period-detection hierarchy. | 79 | * Definition for node within the RCU grace-period-detection hierarchy. |
| 80 | */ | 80 | */ |
| 81 | struct rcu_node { | 81 | struct rcu_node { |
| 82 | spinlock_t lock; | 82 | spinlock_t lock; /* Root rcu_node's lock protects some */ |
| 83 | /* rcu_state fields as well as following. */ | ||
| 83 | long gpnum; /* Current grace period for this node. */ | 84 | long gpnum; /* Current grace period for this node. */ |
| 84 | /* This will either be equal to or one */ | 85 | /* This will either be equal to or one */ |
| 85 | /* behind the root rcu_node's gpnum. */ | 86 | /* behind the root rcu_node's gpnum. */ |
| 86 | unsigned long qsmask; /* CPUs or groups that need to switch in */ | 87 | unsigned long qsmask; /* CPUs or groups that need to switch in */ |
| 87 | /* order for current grace period to proceed.*/ | 88 | /* order for current grace period to proceed.*/ |
| 89 | /* In leaf rcu_node, each bit corresponds to */ | ||
| 90 | /* an rcu_data structure, otherwise, each */ | ||
| 91 | /* bit corresponds to a child rcu_node */ | ||
| 92 | /* structure. */ | ||
| 88 | unsigned long qsmaskinit; | 93 | unsigned long qsmaskinit; |
| 89 | /* Per-GP initialization for qsmask. */ | 94 | /* Per-GP initialization for qsmask. */ |
| 90 | unsigned long grpmask; /* Mask to apply to parent qsmask. */ | 95 | unsigned long grpmask; /* Mask to apply to parent qsmask. */ |
| 96 | /* Only one bit will be set in this mask. */ | ||
| 91 | int grplo; /* lowest-numbered CPU or group here. */ | 97 | int grplo; /* lowest-numbered CPU or group here. */ |
| 92 | int grphi; /* highest-numbered CPU or group here. */ | 98 | int grphi; /* highest-numbered CPU or group here. */ |
| 93 | u8 grpnum; /* CPU/group number for next level up. */ | 99 | u8 grpnum; /* CPU/group number for next level up. */ |
| @@ -95,8 +101,23 @@ struct rcu_node { | |||
| 95 | struct rcu_node *parent; | 101 | struct rcu_node *parent; |
| 96 | struct list_head blocked_tasks[2]; | 102 | struct list_head blocked_tasks[2]; |
| 97 | /* Tasks blocked in RCU read-side critsect. */ | 103 | /* Tasks blocked in RCU read-side critsect. */ |
| 104 | /* Grace period number (->gpnum) x blocked */ | ||
| 105 | /* by tasks on the (x & 0x1) element of the */ | ||
| 106 | /* blocked_tasks[] array. */ | ||
| 98 | } ____cacheline_internodealigned_in_smp; | 107 | } ____cacheline_internodealigned_in_smp; |
| 99 | 108 | ||
| 109 | /* | ||
| 110 | * Do a full breadth-first scan of the rcu_node structures for the | ||
| 111 | * specified rcu_state structure. | ||
| 112 | */ | ||
| 113 | #define rcu_for_each_node_breadth_first(rsp, rnp) \ | ||
| 114 | for ((rnp) = &(rsp)->node[0]; \ | ||
| 115 | (rnp) < &(rsp)->node[NUM_RCU_NODES]; (rnp)++) | ||
| 116 | |||
| 117 | #define rcu_for_each_leaf_node(rsp, rnp) \ | ||
| 118 | for ((rnp) = (rsp)->level[NUM_RCU_LVLS - 1]; \ | ||
| 119 | (rnp) < &(rsp)->node[NUM_RCU_NODES]; (rnp)++) | ||
| 120 | |||
| 100 | /* Index values for nxttail array in struct rcu_data. */ | 121 | /* Index values for nxttail array in struct rcu_data. */ |
| 101 | #define RCU_DONE_TAIL 0 /* Also RCU_WAIT head. */ | 122 | #define RCU_DONE_TAIL 0 /* Also RCU_WAIT head. */ |
| 102 | #define RCU_WAIT_TAIL 1 /* Also RCU_NEXT_READY head. */ | 123 | #define RCU_WAIT_TAIL 1 /* Also RCU_NEXT_READY head. */ |
| @@ -126,19 +147,22 @@ struct rcu_data { | |||
| 126 | * Any of the partitions might be empty, in which case the | 147 | * Any of the partitions might be empty, in which case the |
| 127 | * pointer to that partition will be equal to the pointer for | 148 | * pointer to that partition will be equal to the pointer for |
| 128 | * the following partition. When the list is empty, all of | 149 | * the following partition. When the list is empty, all of |
| 129 | * the nxttail elements point to nxtlist, which is NULL. | 150 | * the nxttail elements point to the ->nxtlist pointer itself, |
| 151 | * which in that case is NULL. | ||
| 130 | * | 152 | * |
| 131 | * [*nxttail[RCU_NEXT_READY_TAIL], NULL = *nxttail[RCU_NEXT_TAIL]): | ||
| 132 | * Entries that might have arrived after current GP ended | ||
| 133 | * [*nxttail[RCU_WAIT_TAIL], *nxttail[RCU_NEXT_READY_TAIL]): | ||
| 134 | * Entries known to have arrived before current GP ended | ||
| 135 | * [*nxttail[RCU_DONE_TAIL], *nxttail[RCU_WAIT_TAIL]): | ||
| 136 | * Entries that batch # <= ->completed - 1: waiting for current GP | ||
| 137 | * [nxtlist, *nxttail[RCU_DONE_TAIL]): | 153 | * [nxtlist, *nxttail[RCU_DONE_TAIL]): |
| 138 | * Entries that batch # <= ->completed | 154 | * Entries that batch # <= ->completed |
| 139 | * The grace period for these entries has completed, and | 155 | * The grace period for these entries has completed, and |
| 140 | * the other grace-period-completed entries may be moved | 156 | * the other grace-period-completed entries may be moved |
| 141 | * here temporarily in rcu_process_callbacks(). | 157 | * here temporarily in rcu_process_callbacks(). |
| 158 | * [*nxttail[RCU_DONE_TAIL], *nxttail[RCU_WAIT_TAIL]): | ||
| 159 | * Entries that batch # <= ->completed - 1: waiting for current GP | ||
| 160 | * [*nxttail[RCU_WAIT_TAIL], *nxttail[RCU_NEXT_READY_TAIL]): | ||
| 161 | * Entries known to have arrived before current GP ended | ||
| 162 | * [*nxttail[RCU_NEXT_READY_TAIL], *nxttail[RCU_NEXT_TAIL]): | ||
| 163 | * Entries that might have arrived after current GP ended | ||
| 164 | * Note that the value of *nxttail[RCU_NEXT_TAIL] will | ||
| 165 | * always be NULL, as this is the end of the list. | ||
| 142 | */ | 166 | */ |
| 143 | struct rcu_head *nxtlist; | 167 | struct rcu_head *nxtlist; |
| 144 | struct rcu_head **nxttail[RCU_NEXT_SIZE]; | 168 | struct rcu_head **nxttail[RCU_NEXT_SIZE]; |
| @@ -216,8 +240,19 @@ struct rcu_state { | |||
| 216 | /* Force QS state. */ | 240 | /* Force QS state. */ |
| 217 | long gpnum; /* Current gp number. */ | 241 | long gpnum; /* Current gp number. */ |
| 218 | long completed; /* # of last completed gp. */ | 242 | long completed; /* # of last completed gp. */ |
| 243 | |||
| 244 | /* End of fields guarded by root rcu_node's lock. */ | ||
| 245 | |||
| 219 | spinlock_t onofflock; /* exclude on/offline and */ | 246 | spinlock_t onofflock; /* exclude on/offline and */ |
| 220 | /* starting new GP. */ | 247 | /* starting new GP. Also */ |
| 248 | /* protects the following */ | ||
| 249 | /* orphan_cbs fields. */ | ||
| 250 | struct rcu_head *orphan_cbs_list; /* list of rcu_head structs */ | ||
| 251 | /* orphaned by all CPUs in */ | ||
| 252 | /* a given leaf rcu_node */ | ||
| 253 | /* going offline. */ | ||
| 254 | struct rcu_head **orphan_cbs_tail; /* And tail pointer. */ | ||
| 255 | long orphan_qlen; /* Number of orphaned cbs. */ | ||
| 221 | spinlock_t fqslock; /* Only one task forcing */ | 256 | spinlock_t fqslock; /* Only one task forcing */ |
| 222 | /* quiescent states. */ | 257 | /* quiescent states. */ |
| 223 | unsigned long jiffies_force_qs; /* Time at which to invoke */ | 258 | unsigned long jiffies_force_qs; /* Time at which to invoke */ |
| @@ -255,5 +290,30 @@ extern struct rcu_state rcu_preempt_state; | |||
| 255 | DECLARE_PER_CPU(struct rcu_data, rcu_preempt_data); | 290 | DECLARE_PER_CPU(struct rcu_data, rcu_preempt_data); |
| 256 | #endif /* #ifdef CONFIG_TREE_PREEMPT_RCU */ | 291 | #endif /* #ifdef CONFIG_TREE_PREEMPT_RCU */ |
| 257 | 292 | ||
| 258 | #endif /* #ifdef RCU_TREE_NONCORE */ | 293 | #else /* #ifdef RCU_TREE_NONCORE */ |
| 294 | |||
| 295 | /* Forward declarations for rcutree_plugin.h */ | ||
| 296 | static inline void rcu_bootup_announce(void); | ||
| 297 | long rcu_batches_completed(void); | ||
| 298 | static void rcu_preempt_note_context_switch(int cpu); | ||
| 299 | static int rcu_preempted_readers(struct rcu_node *rnp); | ||
| 300 | #ifdef CONFIG_RCU_CPU_STALL_DETECTOR | ||
| 301 | static void rcu_print_task_stall(struct rcu_node *rnp); | ||
| 302 | #endif /* #ifdef CONFIG_RCU_CPU_STALL_DETECTOR */ | ||
| 303 | static void rcu_preempt_check_blocked_tasks(struct rcu_node *rnp); | ||
| 304 | #ifdef CONFIG_HOTPLUG_CPU | ||
| 305 | static void rcu_preempt_offline_tasks(struct rcu_state *rsp, | ||
| 306 | struct rcu_node *rnp, | ||
| 307 | struct rcu_data *rdp); | ||
| 308 | static void rcu_preempt_offline_cpu(int cpu); | ||
| 309 | #endif /* #ifdef CONFIG_HOTPLUG_CPU */ | ||
| 310 | static void rcu_preempt_check_callbacks(int cpu); | ||
| 311 | static void rcu_preempt_process_callbacks(void); | ||
| 312 | void call_rcu(struct rcu_head *head, void (*func)(struct rcu_head *rcu)); | ||
| 313 | static int rcu_preempt_pending(int cpu); | ||
| 314 | static int rcu_preempt_needs_cpu(int cpu); | ||
| 315 | static void __cpuinit rcu_preempt_init_percpu_data(int cpu); | ||
| 316 | static void rcu_preempt_send_cbs_to_orphanage(void); | ||
| 317 | static void __init __rcu_init_preempt(void); | ||
| 259 | 318 | ||
| 319 | #endif /* #else #ifdef RCU_TREE_NONCORE */ | ||
diff --git a/kernel/rcutree_plugin.h b/kernel/rcutree_plugin.h index 1cee04f627eb..c0cb783aa16a 100644 --- a/kernel/rcutree_plugin.h +++ b/kernel/rcutree_plugin.h | |||
| @@ -150,6 +150,16 @@ void __rcu_read_lock(void) | |||
| 150 | } | 150 | } |
| 151 | EXPORT_SYMBOL_GPL(__rcu_read_lock); | 151 | EXPORT_SYMBOL_GPL(__rcu_read_lock); |
| 152 | 152 | ||
| 153 | /* | ||
| 154 | * Check for preempted RCU readers blocking the current grace period | ||
| 155 | * for the specified rcu_node structure. If the caller needs a reliable | ||
| 156 | * answer, it must hold the rcu_node's ->lock. | ||
| 157 | */ | ||
| 158 | static int rcu_preempted_readers(struct rcu_node *rnp) | ||
| 159 | { | ||
| 160 | return !list_empty(&rnp->blocked_tasks[rnp->gpnum & 0x1]); | ||
| 161 | } | ||
| 162 | |||
| 153 | static void rcu_read_unlock_special(struct task_struct *t) | 163 | static void rcu_read_unlock_special(struct task_struct *t) |
| 154 | { | 164 | { |
| 155 | int empty; | 165 | int empty; |
| @@ -196,7 +206,7 @@ static void rcu_read_unlock_special(struct task_struct *t) | |||
| 196 | break; | 206 | break; |
| 197 | spin_unlock(&rnp->lock); /* irqs remain disabled. */ | 207 | spin_unlock(&rnp->lock); /* irqs remain disabled. */ |
| 198 | } | 208 | } |
| 199 | empty = list_empty(&rnp->blocked_tasks[rnp->gpnum & 0x1]); | 209 | empty = !rcu_preempted_readers(rnp); |
| 200 | list_del_init(&t->rcu_node_entry); | 210 | list_del_init(&t->rcu_node_entry); |
| 201 | t->rcu_blocked_node = NULL; | 211 | t->rcu_blocked_node = NULL; |
| 202 | 212 | ||
| @@ -207,7 +217,7 @@ static void rcu_read_unlock_special(struct task_struct *t) | |||
| 207 | * drop rnp->lock and restore irq. | 217 | * drop rnp->lock and restore irq. |
| 208 | */ | 218 | */ |
| 209 | if (!empty && rnp->qsmask == 0 && | 219 | if (!empty && rnp->qsmask == 0 && |
| 210 | list_empty(&rnp->blocked_tasks[rnp->gpnum & 0x1])) { | 220 | !rcu_preempted_readers(rnp)) { |
| 211 | struct rcu_node *rnp_p; | 221 | struct rcu_node *rnp_p; |
| 212 | 222 | ||
| 213 | if (rnp->parent == NULL) { | 223 | if (rnp->parent == NULL) { |
| @@ -257,12 +267,12 @@ static void rcu_print_task_stall(struct rcu_node *rnp) | |||
| 257 | { | 267 | { |
| 258 | unsigned long flags; | 268 | unsigned long flags; |
| 259 | struct list_head *lp; | 269 | struct list_head *lp; |
| 260 | int phase = rnp->gpnum & 0x1; | 270 | int phase; |
| 261 | struct task_struct *t; | 271 | struct task_struct *t; |
| 262 | 272 | ||
| 263 | if (!list_empty(&rnp->blocked_tasks[phase])) { | 273 | if (rcu_preempted_readers(rnp)) { |
| 264 | spin_lock_irqsave(&rnp->lock, flags); | 274 | spin_lock_irqsave(&rnp->lock, flags); |
| 265 | phase = rnp->gpnum & 0x1; /* re-read under lock. */ | 275 | phase = rnp->gpnum & 0x1; |
| 266 | lp = &rnp->blocked_tasks[phase]; | 276 | lp = &rnp->blocked_tasks[phase]; |
| 267 | list_for_each_entry(t, lp, rcu_node_entry) | 277 | list_for_each_entry(t, lp, rcu_node_entry) |
| 268 | printk(" P%d", t->pid); | 278 | printk(" P%d", t->pid); |
| @@ -281,20 +291,10 @@ static void rcu_print_task_stall(struct rcu_node *rnp) | |||
| 281 | */ | 291 | */ |
| 282 | static void rcu_preempt_check_blocked_tasks(struct rcu_node *rnp) | 292 | static void rcu_preempt_check_blocked_tasks(struct rcu_node *rnp) |
| 283 | { | 293 | { |
| 284 | WARN_ON_ONCE(!list_empty(&rnp->blocked_tasks[rnp->gpnum & 0x1])); | 294 | WARN_ON_ONCE(rcu_preempted_readers(rnp)); |
| 285 | WARN_ON_ONCE(rnp->qsmask); | 295 | WARN_ON_ONCE(rnp->qsmask); |
| 286 | } | 296 | } |
| 287 | 297 | ||
| 288 | /* | ||
| 289 | * Check for preempted RCU readers for the specified rcu_node structure. | ||
| 290 | * If the caller needs a reliable answer, it must hold the rcu_node's | ||
| 291 | * >lock. | ||
| 292 | */ | ||
| 293 | static int rcu_preempted_readers(struct rcu_node *rnp) | ||
| 294 | { | ||
| 295 | return !list_empty(&rnp->blocked_tasks[rnp->gpnum & 0x1]); | ||
| 296 | } | ||
| 297 | |||
| 298 | #ifdef CONFIG_HOTPLUG_CPU | 298 | #ifdef CONFIG_HOTPLUG_CPU |
| 299 | 299 | ||
| 300 | /* | 300 | /* |
| @@ -410,6 +410,15 @@ static int rcu_preempt_needs_cpu(int cpu) | |||
| 410 | return !!per_cpu(rcu_preempt_data, cpu).nxtlist; | 410 | return !!per_cpu(rcu_preempt_data, cpu).nxtlist; |
| 411 | } | 411 | } |
| 412 | 412 | ||
| 413 | /** | ||
| 414 | * rcu_barrier - Wait until all in-flight call_rcu() callbacks complete. | ||
| 415 | */ | ||
| 416 | void rcu_barrier(void) | ||
| 417 | { | ||
| 418 | _rcu_barrier(&rcu_preempt_state, call_rcu); | ||
| 419 | } | ||
| 420 | EXPORT_SYMBOL_GPL(rcu_barrier); | ||
| 421 | |||
| 413 | /* | 422 | /* |
| 414 | * Initialize preemptable RCU's per-CPU data. | 423 | * Initialize preemptable RCU's per-CPU data. |
| 415 | */ | 424 | */ |
| @@ -419,6 +428,22 @@ static void __cpuinit rcu_preempt_init_percpu_data(int cpu) | |||
| 419 | } | 428 | } |
| 420 | 429 | ||
| 421 | /* | 430 | /* |
| 431 | * Move preemptable RCU's callbacks to ->orphan_cbs_list. | ||
| 432 | */ | ||
| 433 | static void rcu_preempt_send_cbs_to_orphanage(void) | ||
| 434 | { | ||
| 435 | rcu_send_cbs_to_orphanage(&rcu_preempt_state); | ||
| 436 | } | ||
| 437 | |||
| 438 | /* | ||
| 439 | * Initialize preemptable RCU's state structures. | ||
| 440 | */ | ||
| 441 | static void __init __rcu_init_preempt(void) | ||
| 442 | { | ||
| 443 | RCU_INIT_FLAVOR(&rcu_preempt_state, rcu_preempt_data); | ||
| 444 | } | ||
| 445 | |||
| 446 | /* | ||
| 422 | * Check for a task exiting while in a preemptable-RCU read-side | 447 | * Check for a task exiting while in a preemptable-RCU read-side |
| 423 | * critical section, clean up if so. No need to issue warnings, | 448 | * critical section, clean up if so. No need to issue warnings, |
| 424 | * as debug_check_no_locks_held() already does this if lockdep | 449 | * as debug_check_no_locks_held() already does this if lockdep |
| @@ -461,6 +486,15 @@ static void rcu_preempt_note_context_switch(int cpu) | |||
| 461 | { | 486 | { |
| 462 | } | 487 | } |
| 463 | 488 | ||
| 489 | /* | ||
| 490 | * Because preemptable RCU does not exist, there are never any preempted | ||
| 491 | * RCU readers. | ||
| 492 | */ | ||
| 493 | static int rcu_preempted_readers(struct rcu_node *rnp) | ||
| 494 | { | ||
| 495 | return 0; | ||
| 496 | } | ||
| 497 | |||
| 464 | #ifdef CONFIG_RCU_CPU_STALL_DETECTOR | 498 | #ifdef CONFIG_RCU_CPU_STALL_DETECTOR |
| 465 | 499 | ||
| 466 | /* | 500 | /* |
| @@ -483,15 +517,6 @@ static void rcu_preempt_check_blocked_tasks(struct rcu_node *rnp) | |||
| 483 | WARN_ON_ONCE(rnp->qsmask); | 517 | WARN_ON_ONCE(rnp->qsmask); |
| 484 | } | 518 | } |
| 485 | 519 | ||
| 486 | /* | ||
| 487 | * Because preemptable RCU does not exist, there are never any preempted | ||
| 488 | * RCU readers. | ||
| 489 | */ | ||
| 490 | static int rcu_preempted_readers(struct rcu_node *rnp) | ||
| 491 | { | ||
| 492 | return 0; | ||
| 493 | } | ||
| 494 | |||
| 495 | #ifdef CONFIG_HOTPLUG_CPU | 520 | #ifdef CONFIG_HOTPLUG_CPU |
| 496 | 521 | ||
| 497 | /* | 522 | /* |
| @@ -518,7 +543,7 @@ static void rcu_preempt_offline_cpu(int cpu) | |||
| 518 | * Because preemptable RCU does not exist, it never has any callbacks | 543 | * Because preemptable RCU does not exist, it never has any callbacks |
| 519 | * to check. | 544 | * to check. |
| 520 | */ | 545 | */ |
| 521 | void rcu_preempt_check_callbacks(int cpu) | 546 | static void rcu_preempt_check_callbacks(int cpu) |
| 522 | { | 547 | { |
| 523 | } | 548 | } |
| 524 | 549 | ||
| @@ -526,7 +551,7 @@ void rcu_preempt_check_callbacks(int cpu) | |||
| 526 | * Because preemptable RCU does not exist, it never has any callbacks | 551 | * Because preemptable RCU does not exist, it never has any callbacks |
| 527 | * to process. | 552 | * to process. |
| 528 | */ | 553 | */ |
| 529 | void rcu_preempt_process_callbacks(void) | 554 | static void rcu_preempt_process_callbacks(void) |
| 530 | { | 555 | { |
| 531 | } | 556 | } |
| 532 | 557 | ||
| @@ -556,6 +581,16 @@ static int rcu_preempt_needs_cpu(int cpu) | |||
| 556 | } | 581 | } |
| 557 | 582 | ||
| 558 | /* | 583 | /* |
| 584 | * Because preemptable RCU does not exist, rcu_barrier() is just | ||
| 585 | * another name for rcu_barrier_sched(). | ||
| 586 | */ | ||
| 587 | void rcu_barrier(void) | ||
| 588 | { | ||
| 589 | rcu_barrier_sched(); | ||
| 590 | } | ||
| 591 | EXPORT_SYMBOL_GPL(rcu_barrier); | ||
| 592 | |||
| 593 | /* | ||
| 559 | * Because preemptable RCU does not exist, there is no per-CPU | 594 | * Because preemptable RCU does not exist, there is no per-CPU |
| 560 | * data to initialize. | 595 | * data to initialize. |
| 561 | */ | 596 | */ |
| @@ -563,4 +598,18 @@ static void __cpuinit rcu_preempt_init_percpu_data(int cpu) | |||
| 563 | { | 598 | { |
| 564 | } | 599 | } |
| 565 | 600 | ||
| 601 | /* | ||
| 602 | * Because there is no preemptable RCU, there are no callbacks to move. | ||
| 603 | */ | ||
| 604 | static void rcu_preempt_send_cbs_to_orphanage(void) | ||
| 605 | { | ||
| 606 | } | ||
| 607 | |||
| 608 | /* | ||
| 609 | * Because preemptable RCU does not exist, it need not be initialized. | ||
| 610 | */ | ||
| 611 | static void __init __rcu_init_preempt(void) | ||
| 612 | { | ||
| 613 | } | ||
| 614 | |||
| 566 | #endif /* #else #ifdef CONFIG_TREE_PREEMPT_RCU */ | 615 | #endif /* #else #ifdef CONFIG_TREE_PREEMPT_RCU */ |
diff --git a/kernel/rcutree_trace.c b/kernel/rcutree_trace.c index c89f5e9fd173..4b31c779e62e 100644 --- a/kernel/rcutree_trace.c +++ b/kernel/rcutree_trace.c | |||
| @@ -93,7 +93,7 @@ static int rcudata_open(struct inode *inode, struct file *file) | |||
| 93 | return single_open(file, show_rcudata, NULL); | 93 | return single_open(file, show_rcudata, NULL); |
| 94 | } | 94 | } |
| 95 | 95 | ||
| 96 | static struct file_operations rcudata_fops = { | 96 | static const struct file_operations rcudata_fops = { |
| 97 | .owner = THIS_MODULE, | 97 | .owner = THIS_MODULE, |
| 98 | .open = rcudata_open, | 98 | .open = rcudata_open, |
| 99 | .read = seq_read, | 99 | .read = seq_read, |
| @@ -145,7 +145,7 @@ static int rcudata_csv_open(struct inode *inode, struct file *file) | |||
| 145 | return single_open(file, show_rcudata_csv, NULL); | 145 | return single_open(file, show_rcudata_csv, NULL); |
| 146 | } | 146 | } |
| 147 | 147 | ||
| 148 | static struct file_operations rcudata_csv_fops = { | 148 | static const struct file_operations rcudata_csv_fops = { |
| 149 | .owner = THIS_MODULE, | 149 | .owner = THIS_MODULE, |
| 150 | .open = rcudata_csv_open, | 150 | .open = rcudata_csv_open, |
| 151 | .read = seq_read, | 151 | .read = seq_read, |
| @@ -159,13 +159,13 @@ static void print_one_rcu_state(struct seq_file *m, struct rcu_state *rsp) | |||
| 159 | struct rcu_node *rnp; | 159 | struct rcu_node *rnp; |
| 160 | 160 | ||
| 161 | seq_printf(m, "c=%ld g=%ld s=%d jfq=%ld j=%x " | 161 | seq_printf(m, "c=%ld g=%ld s=%d jfq=%ld j=%x " |
| 162 | "nfqs=%lu/nfqsng=%lu(%lu) fqlh=%lu\n", | 162 | "nfqs=%lu/nfqsng=%lu(%lu) fqlh=%lu oqlen=%ld\n", |
| 163 | rsp->completed, rsp->gpnum, rsp->signaled, | 163 | rsp->completed, rsp->gpnum, rsp->signaled, |
| 164 | (long)(rsp->jiffies_force_qs - jiffies), | 164 | (long)(rsp->jiffies_force_qs - jiffies), |
| 165 | (int)(jiffies & 0xffff), | 165 | (int)(jiffies & 0xffff), |
| 166 | rsp->n_force_qs, rsp->n_force_qs_ngp, | 166 | rsp->n_force_qs, rsp->n_force_qs_ngp, |
| 167 | rsp->n_force_qs - rsp->n_force_qs_ngp, | 167 | rsp->n_force_qs - rsp->n_force_qs_ngp, |
| 168 | rsp->n_force_qs_lh); | 168 | rsp->n_force_qs_lh, rsp->orphan_qlen); |
| 169 | for (rnp = &rsp->node[0]; rnp - &rsp->node[0] < NUM_RCU_NODES; rnp++) { | 169 | for (rnp = &rsp->node[0]; rnp - &rsp->node[0] < NUM_RCU_NODES; rnp++) { |
| 170 | if (rnp->level != level) { | 170 | if (rnp->level != level) { |
| 171 | seq_puts(m, "\n"); | 171 | seq_puts(m, "\n"); |
| @@ -196,7 +196,7 @@ static int rcuhier_open(struct inode *inode, struct file *file) | |||
| 196 | return single_open(file, show_rcuhier, NULL); | 196 | return single_open(file, show_rcuhier, NULL); |
| 197 | } | 197 | } |
| 198 | 198 | ||
| 199 | static struct file_operations rcuhier_fops = { | 199 | static const struct file_operations rcuhier_fops = { |
| 200 | .owner = THIS_MODULE, | 200 | .owner = THIS_MODULE, |
| 201 | .open = rcuhier_open, | 201 | .open = rcuhier_open, |
| 202 | .read = seq_read, | 202 | .read = seq_read, |
| @@ -222,7 +222,7 @@ static int rcugp_open(struct inode *inode, struct file *file) | |||
| 222 | return single_open(file, show_rcugp, NULL); | 222 | return single_open(file, show_rcugp, NULL); |
| 223 | } | 223 | } |
| 224 | 224 | ||
| 225 | static struct file_operations rcugp_fops = { | 225 | static const struct file_operations rcugp_fops = { |
| 226 | .owner = THIS_MODULE, | 226 | .owner = THIS_MODULE, |
| 227 | .open = rcugp_open, | 227 | .open = rcugp_open, |
| 228 | .read = seq_read, | 228 | .read = seq_read, |
| @@ -276,7 +276,7 @@ static int rcu_pending_open(struct inode *inode, struct file *file) | |||
| 276 | return single_open(file, show_rcu_pending, NULL); | 276 | return single_open(file, show_rcu_pending, NULL); |
| 277 | } | 277 | } |
| 278 | 278 | ||
| 279 | static struct file_operations rcu_pending_fops = { | 279 | static const struct file_operations rcu_pending_fops = { |
| 280 | .owner = THIS_MODULE, | 280 | .owner = THIS_MODULE, |
| 281 | .open = rcu_pending_open, | 281 | .open = rcu_pending_open, |
| 282 | .read = seq_read, | 282 | .read = seq_read, |
diff --git a/kernel/relay.c b/kernel/relay.c index bc188549788f..760c26209a3c 100644 --- a/kernel/relay.c +++ b/kernel/relay.c | |||
| @@ -60,7 +60,7 @@ static int relay_buf_fault(struct vm_area_struct *vma, struct vm_fault *vmf) | |||
| 60 | /* | 60 | /* |
| 61 | * vm_ops for relay file mappings. | 61 | * vm_ops for relay file mappings. |
| 62 | */ | 62 | */ |
| 63 | static struct vm_operations_struct relay_file_mmap_ops = { | 63 | static const struct vm_operations_struct relay_file_mmap_ops = { |
| 64 | .fault = relay_buf_fault, | 64 | .fault = relay_buf_fault, |
| 65 | .close = relay_file_mmap_close, | 65 | .close = relay_file_mmap_close, |
| 66 | }; | 66 | }; |
diff --git a/kernel/res_counter.c b/kernel/res_counter.c index e1338f074314..bcdabf37c40b 100644 --- a/kernel/res_counter.c +++ b/kernel/res_counter.c | |||
| @@ -19,6 +19,7 @@ void res_counter_init(struct res_counter *counter, struct res_counter *parent) | |||
| 19 | { | 19 | { |
| 20 | spin_lock_init(&counter->lock); | 20 | spin_lock_init(&counter->lock); |
| 21 | counter->limit = RESOURCE_MAX; | 21 | counter->limit = RESOURCE_MAX; |
| 22 | counter->soft_limit = RESOURCE_MAX; | ||
| 22 | counter->parent = parent; | 23 | counter->parent = parent; |
| 23 | } | 24 | } |
| 24 | 25 | ||
| @@ -101,6 +102,8 @@ res_counter_member(struct res_counter *counter, int member) | |||
| 101 | return &counter->limit; | 102 | return &counter->limit; |
| 102 | case RES_FAILCNT: | 103 | case RES_FAILCNT: |
| 103 | return &counter->failcnt; | 104 | return &counter->failcnt; |
| 105 | case RES_SOFT_LIMIT: | ||
| 106 | return &counter->soft_limit; | ||
| 104 | }; | 107 | }; |
| 105 | 108 | ||
| 106 | BUG(); | 109 | BUG(); |
diff --git a/kernel/resource.c b/kernel/resource.c index 78b087221c15..fb11a58b9594 100644 --- a/kernel/resource.c +++ b/kernel/resource.c | |||
| @@ -223,13 +223,13 @@ int release_resource(struct resource *old) | |||
| 223 | 223 | ||
| 224 | EXPORT_SYMBOL(release_resource); | 224 | EXPORT_SYMBOL(release_resource); |
| 225 | 225 | ||
| 226 | #if defined(CONFIG_MEMORY_HOTPLUG) && !defined(CONFIG_ARCH_HAS_WALK_MEMORY) | 226 | #if !defined(CONFIG_ARCH_HAS_WALK_MEMORY) |
| 227 | /* | 227 | /* |
| 228 | * Finds the lowest memory reosurce exists within [res->start.res->end) | 228 | * Finds the lowest memory reosurce exists within [res->start.res->end) |
| 229 | * the caller must specify res->start, res->end, res->flags. | 229 | * the caller must specify res->start, res->end, res->flags and "name". |
| 230 | * If found, returns 0, res is overwritten, if not found, returns -1. | 230 | * If found, returns 0, res is overwritten, if not found, returns -1. |
| 231 | */ | 231 | */ |
| 232 | static int find_next_system_ram(struct resource *res) | 232 | static int find_next_system_ram(struct resource *res, char *name) |
| 233 | { | 233 | { |
| 234 | resource_size_t start, end; | 234 | resource_size_t start, end; |
| 235 | struct resource *p; | 235 | struct resource *p; |
| @@ -245,6 +245,8 @@ static int find_next_system_ram(struct resource *res) | |||
| 245 | /* system ram is just marked as IORESOURCE_MEM */ | 245 | /* system ram is just marked as IORESOURCE_MEM */ |
| 246 | if (p->flags != res->flags) | 246 | if (p->flags != res->flags) |
| 247 | continue; | 247 | continue; |
| 248 | if (name && strcmp(p->name, name)) | ||
| 249 | continue; | ||
| 248 | if (p->start > end) { | 250 | if (p->start > end) { |
| 249 | p = NULL; | 251 | p = NULL; |
| 250 | break; | 252 | break; |
| @@ -262,19 +264,26 @@ static int find_next_system_ram(struct resource *res) | |||
| 262 | res->end = p->end; | 264 | res->end = p->end; |
| 263 | return 0; | 265 | return 0; |
| 264 | } | 266 | } |
| 265 | int | 267 | |
| 266 | walk_memory_resource(unsigned long start_pfn, unsigned long nr_pages, void *arg, | 268 | /* |
| 267 | int (*func)(unsigned long, unsigned long, void *)) | 269 | * This function calls callback against all memory range of "System RAM" |
| 270 | * which are marked as IORESOURCE_MEM and IORESOUCE_BUSY. | ||
| 271 | * Now, this function is only for "System RAM". | ||
| 272 | */ | ||
| 273 | int walk_system_ram_range(unsigned long start_pfn, unsigned long nr_pages, | ||
| 274 | void *arg, int (*func)(unsigned long, unsigned long, void *)) | ||
| 268 | { | 275 | { |
| 269 | struct resource res; | 276 | struct resource res; |
| 270 | unsigned long pfn, len; | 277 | unsigned long pfn, len; |
| 271 | u64 orig_end; | 278 | u64 orig_end; |
| 272 | int ret = -1; | 279 | int ret = -1; |
| 280 | |||
| 273 | res.start = (u64) start_pfn << PAGE_SHIFT; | 281 | res.start = (u64) start_pfn << PAGE_SHIFT; |
| 274 | res.end = ((u64)(start_pfn + nr_pages) << PAGE_SHIFT) - 1; | 282 | res.end = ((u64)(start_pfn + nr_pages) << PAGE_SHIFT) - 1; |
| 275 | res.flags = IORESOURCE_MEM | IORESOURCE_BUSY; | 283 | res.flags = IORESOURCE_MEM | IORESOURCE_BUSY; |
| 276 | orig_end = res.end; | 284 | orig_end = res.end; |
| 277 | while ((res.start < res.end) && (find_next_system_ram(&res) >= 0)) { | 285 | while ((res.start < res.end) && |
| 286 | (find_next_system_ram(&res, "System RAM") >= 0)) { | ||
| 278 | pfn = (unsigned long)(res.start >> PAGE_SHIFT); | 287 | pfn = (unsigned long)(res.start >> PAGE_SHIFT); |
| 279 | len = (unsigned long)((res.end + 1 - res.start) >> PAGE_SHIFT); | 288 | len = (unsigned long)((res.end + 1 - res.start) >> PAGE_SHIFT); |
| 280 | ret = (*func)(pfn, len, arg); | 289 | ret = (*func)(pfn, len, arg); |
diff --git a/kernel/sched.c b/kernel/sched.c index 0ac9053c21d6..76c0e9691fc0 100644 --- a/kernel/sched.c +++ b/kernel/sched.c | |||
| @@ -780,7 +780,7 @@ static int sched_feat_open(struct inode *inode, struct file *filp) | |||
| 780 | return single_open(filp, sched_feat_show, NULL); | 780 | return single_open(filp, sched_feat_show, NULL); |
| 781 | } | 781 | } |
| 782 | 782 | ||
| 783 | static struct file_operations sched_feat_fops = { | 783 | static const struct file_operations sched_feat_fops = { |
| 784 | .open = sched_feat_open, | 784 | .open = sched_feat_open, |
| 785 | .write = sched_feat_write, | 785 | .write = sched_feat_write, |
| 786 | .read = seq_read, | 786 | .read = seq_read, |
| @@ -2515,22 +2515,17 @@ void sched_fork(struct task_struct *p, int clone_flags) | |||
| 2515 | __sched_fork(p); | 2515 | __sched_fork(p); |
| 2516 | 2516 | ||
| 2517 | /* | 2517 | /* |
| 2518 | * Make sure we do not leak PI boosting priority to the child. | ||
| 2519 | */ | ||
| 2520 | p->prio = current->normal_prio; | ||
| 2521 | |||
| 2522 | /* | ||
| 2523 | * Revert to default priority/policy on fork if requested. | 2518 | * Revert to default priority/policy on fork if requested. |
| 2524 | */ | 2519 | */ |
| 2525 | if (unlikely(p->sched_reset_on_fork)) { | 2520 | if (unlikely(p->sched_reset_on_fork)) { |
| 2526 | if (p->policy == SCHED_FIFO || p->policy == SCHED_RR) | 2521 | if (p->policy == SCHED_FIFO || p->policy == SCHED_RR) { |
| 2527 | p->policy = SCHED_NORMAL; | 2522 | p->policy = SCHED_NORMAL; |
| 2528 | 2523 | p->normal_prio = p->static_prio; | |
| 2529 | if (p->normal_prio < DEFAULT_PRIO) | 2524 | } |
| 2530 | p->prio = DEFAULT_PRIO; | ||
| 2531 | 2525 | ||
| 2532 | if (PRIO_TO_NICE(p->static_prio) < 0) { | 2526 | if (PRIO_TO_NICE(p->static_prio) < 0) { |
| 2533 | p->static_prio = NICE_TO_PRIO(0); | 2527 | p->static_prio = NICE_TO_PRIO(0); |
| 2528 | p->normal_prio = p->static_prio; | ||
| 2534 | set_load_weight(p); | 2529 | set_load_weight(p); |
| 2535 | } | 2530 | } |
| 2536 | 2531 | ||
| @@ -2541,6 +2536,11 @@ void sched_fork(struct task_struct *p, int clone_flags) | |||
| 2541 | p->sched_reset_on_fork = 0; | 2536 | p->sched_reset_on_fork = 0; |
| 2542 | } | 2537 | } |
| 2543 | 2538 | ||
| 2539 | /* | ||
| 2540 | * Make sure we do not leak PI boosting priority to the child. | ||
| 2541 | */ | ||
| 2542 | p->prio = current->normal_prio; | ||
| 2543 | |||
| 2544 | if (!rt_prio(p->prio)) | 2544 | if (!rt_prio(p->prio)) |
| 2545 | p->sched_class = &fair_sched_class; | 2545 | p->sched_class = &fair_sched_class; |
| 2546 | 2546 | ||
| @@ -2581,8 +2581,6 @@ void wake_up_new_task(struct task_struct *p, unsigned long clone_flags) | |||
| 2581 | BUG_ON(p->state != TASK_RUNNING); | 2581 | BUG_ON(p->state != TASK_RUNNING); |
| 2582 | update_rq_clock(rq); | 2582 | update_rq_clock(rq); |
| 2583 | 2583 | ||
| 2584 | p->prio = effective_prio(p); | ||
| 2585 | |||
| 2586 | if (!p->sched_class->task_new || !current->se.on_rq) { | 2584 | if (!p->sched_class->task_new || !current->se.on_rq) { |
| 2587 | activate_task(rq, p, 0); | 2585 | activate_task(rq, p, 0); |
| 2588 | } else { | 2586 | } else { |
| @@ -5092,17 +5090,16 @@ void account_idle_time(cputime_t cputime) | |||
| 5092 | */ | 5090 | */ |
| 5093 | void account_process_tick(struct task_struct *p, int user_tick) | 5091 | void account_process_tick(struct task_struct *p, int user_tick) |
| 5094 | { | 5092 | { |
| 5095 | cputime_t one_jiffy = jiffies_to_cputime(1); | 5093 | cputime_t one_jiffy_scaled = cputime_to_scaled(cputime_one_jiffy); |
| 5096 | cputime_t one_jiffy_scaled = cputime_to_scaled(one_jiffy); | ||
| 5097 | struct rq *rq = this_rq(); | 5094 | struct rq *rq = this_rq(); |
| 5098 | 5095 | ||
| 5099 | if (user_tick) | 5096 | if (user_tick) |
| 5100 | account_user_time(p, one_jiffy, one_jiffy_scaled); | 5097 | account_user_time(p, cputime_one_jiffy, one_jiffy_scaled); |
| 5101 | else if ((p != rq->idle) || (irq_count() != HARDIRQ_OFFSET)) | 5098 | else if ((p != rq->idle) || (irq_count() != HARDIRQ_OFFSET)) |
| 5102 | account_system_time(p, HARDIRQ_OFFSET, one_jiffy, | 5099 | account_system_time(p, HARDIRQ_OFFSET, cputime_one_jiffy, |
| 5103 | one_jiffy_scaled); | 5100 | one_jiffy_scaled); |
| 5104 | else | 5101 | else |
| 5105 | account_idle_time(one_jiffy); | 5102 | account_idle_time(cputime_one_jiffy); |
| 5106 | } | 5103 | } |
| 5107 | 5104 | ||
| 5108 | /* | 5105 | /* |
| @@ -10313,7 +10310,7 @@ static int sched_rt_global_constraints(void) | |||
| 10313 | #endif /* CONFIG_RT_GROUP_SCHED */ | 10310 | #endif /* CONFIG_RT_GROUP_SCHED */ |
| 10314 | 10311 | ||
| 10315 | int sched_rt_handler(struct ctl_table *table, int write, | 10312 | int sched_rt_handler(struct ctl_table *table, int write, |
| 10316 | struct file *filp, void __user *buffer, size_t *lenp, | 10313 | void __user *buffer, size_t *lenp, |
| 10317 | loff_t *ppos) | 10314 | loff_t *ppos) |
| 10318 | { | 10315 | { |
| 10319 | int ret; | 10316 | int ret; |
| @@ -10324,7 +10321,7 @@ int sched_rt_handler(struct ctl_table *table, int write, | |||
| 10324 | old_period = sysctl_sched_rt_period; | 10321 | old_period = sysctl_sched_rt_period; |
| 10325 | old_runtime = sysctl_sched_rt_runtime; | 10322 | old_runtime = sysctl_sched_rt_runtime; |
| 10326 | 10323 | ||
| 10327 | ret = proc_dointvec(table, write, filp, buffer, lenp, ppos); | 10324 | ret = proc_dointvec(table, write, buffer, lenp, ppos); |
| 10328 | 10325 | ||
| 10329 | if (!ret && write) { | 10326 | if (!ret && write) { |
| 10330 | ret = sched_rt_global_constraints(); | 10327 | ret = sched_rt_global_constraints(); |
| @@ -10378,8 +10375,7 @@ cpu_cgroup_destroy(struct cgroup_subsys *ss, struct cgroup *cgrp) | |||
| 10378 | } | 10375 | } |
| 10379 | 10376 | ||
| 10380 | static int | 10377 | static int |
| 10381 | cpu_cgroup_can_attach(struct cgroup_subsys *ss, struct cgroup *cgrp, | 10378 | cpu_cgroup_can_attach_task(struct cgroup *cgrp, struct task_struct *tsk) |
| 10382 | struct task_struct *tsk) | ||
| 10383 | { | 10379 | { |
| 10384 | #ifdef CONFIG_RT_GROUP_SCHED | 10380 | #ifdef CONFIG_RT_GROUP_SCHED |
| 10385 | if (!sched_rt_can_attach(cgroup_tg(cgrp), tsk)) | 10381 | if (!sched_rt_can_attach(cgroup_tg(cgrp), tsk)) |
| @@ -10389,15 +10385,45 @@ cpu_cgroup_can_attach(struct cgroup_subsys *ss, struct cgroup *cgrp, | |||
| 10389 | if (tsk->sched_class != &fair_sched_class) | 10385 | if (tsk->sched_class != &fair_sched_class) |
| 10390 | return -EINVAL; | 10386 | return -EINVAL; |
| 10391 | #endif | 10387 | #endif |
| 10388 | return 0; | ||
| 10389 | } | ||
| 10392 | 10390 | ||
| 10391 | static int | ||
| 10392 | cpu_cgroup_can_attach(struct cgroup_subsys *ss, struct cgroup *cgrp, | ||
| 10393 | struct task_struct *tsk, bool threadgroup) | ||
| 10394 | { | ||
| 10395 | int retval = cpu_cgroup_can_attach_task(cgrp, tsk); | ||
| 10396 | if (retval) | ||
| 10397 | return retval; | ||
| 10398 | if (threadgroup) { | ||
| 10399 | struct task_struct *c; | ||
| 10400 | rcu_read_lock(); | ||
| 10401 | list_for_each_entry_rcu(c, &tsk->thread_group, thread_group) { | ||
| 10402 | retval = cpu_cgroup_can_attach_task(cgrp, c); | ||
| 10403 | if (retval) { | ||
| 10404 | rcu_read_unlock(); | ||
| 10405 | return retval; | ||
| 10406 | } | ||
| 10407 | } | ||
| 10408 | rcu_read_unlock(); | ||
| 10409 | } | ||
| 10393 | return 0; | 10410 | return 0; |
| 10394 | } | 10411 | } |
| 10395 | 10412 | ||
| 10396 | static void | 10413 | static void |
| 10397 | cpu_cgroup_attach(struct cgroup_subsys *ss, struct cgroup *cgrp, | 10414 | cpu_cgroup_attach(struct cgroup_subsys *ss, struct cgroup *cgrp, |
| 10398 | struct cgroup *old_cont, struct task_struct *tsk) | 10415 | struct cgroup *old_cont, struct task_struct *tsk, |
| 10416 | bool threadgroup) | ||
| 10399 | { | 10417 | { |
| 10400 | sched_move_task(tsk); | 10418 | sched_move_task(tsk); |
| 10419 | if (threadgroup) { | ||
| 10420 | struct task_struct *c; | ||
| 10421 | rcu_read_lock(); | ||
| 10422 | list_for_each_entry_rcu(c, &tsk->thread_group, thread_group) { | ||
| 10423 | sched_move_task(c); | ||
| 10424 | } | ||
| 10425 | rcu_read_unlock(); | ||
| 10426 | } | ||
| 10401 | } | 10427 | } |
| 10402 | 10428 | ||
| 10403 | #ifdef CONFIG_FAIR_GROUP_SCHED | 10429 | #ifdef CONFIG_FAIR_GROUP_SCHED |
diff --git a/kernel/sched_clock.c b/kernel/sched_clock.c index ac2e1dc708bd..479ce5682d7c 100644 --- a/kernel/sched_clock.c +++ b/kernel/sched_clock.c | |||
| @@ -127,7 +127,7 @@ again: | |||
| 127 | clock = wrap_max(clock, min_clock); | 127 | clock = wrap_max(clock, min_clock); |
| 128 | clock = wrap_min(clock, max_clock); | 128 | clock = wrap_min(clock, max_clock); |
| 129 | 129 | ||
| 130 | if (cmpxchg(&scd->clock, old_clock, clock) != old_clock) | 130 | if (cmpxchg64(&scd->clock, old_clock, clock) != old_clock) |
| 131 | goto again; | 131 | goto again; |
| 132 | 132 | ||
| 133 | return clock; | 133 | return clock; |
| @@ -163,7 +163,7 @@ again: | |||
| 163 | val = remote_clock; | 163 | val = remote_clock; |
| 164 | } | 164 | } |
| 165 | 165 | ||
| 166 | if (cmpxchg(ptr, old_val, val) != old_val) | 166 | if (cmpxchg64(ptr, old_val, val) != old_val) |
| 167 | goto again; | 167 | goto again; |
| 168 | 168 | ||
| 169 | return val; | 169 | return val; |
diff --git a/kernel/sched_fair.c b/kernel/sched_fair.c index ecc637a0d591..4e777b47eeda 100644 --- a/kernel/sched_fair.c +++ b/kernel/sched_fair.c | |||
| @@ -384,10 +384,10 @@ static struct sched_entity *__pick_last_entity(struct cfs_rq *cfs_rq) | |||
| 384 | 384 | ||
| 385 | #ifdef CONFIG_SCHED_DEBUG | 385 | #ifdef CONFIG_SCHED_DEBUG |
| 386 | int sched_nr_latency_handler(struct ctl_table *table, int write, | 386 | int sched_nr_latency_handler(struct ctl_table *table, int write, |
| 387 | struct file *filp, void __user *buffer, size_t *lenp, | 387 | void __user *buffer, size_t *lenp, |
| 388 | loff_t *ppos) | 388 | loff_t *ppos) |
| 389 | { | 389 | { |
| 390 | int ret = proc_dointvec_minmax(table, write, filp, buffer, lenp, ppos); | 390 | int ret = proc_dointvec_minmax(table, write, buffer, lenp, ppos); |
| 391 | 391 | ||
| 392 | if (ret || !write) | 392 | if (ret || !write) |
| 393 | return ret; | 393 | return ret; |
diff --git a/kernel/signal.c b/kernel/signal.c index 64c5deeaca5d..6705320784fd 100644 --- a/kernel/signal.c +++ b/kernel/signal.c | |||
| @@ -705,7 +705,7 @@ static int prepare_signal(int sig, struct task_struct *p, int from_ancestor_ns) | |||
| 705 | 705 | ||
| 706 | if (why) { | 706 | if (why) { |
| 707 | /* | 707 | /* |
| 708 | * The first thread which returns from finish_stop() | 708 | * The first thread which returns from do_signal_stop() |
| 709 | * will take ->siglock, notice SIGNAL_CLD_MASK, and | 709 | * will take ->siglock, notice SIGNAL_CLD_MASK, and |
| 710 | * notify its parent. See get_signal_to_deliver(). | 710 | * notify its parent. See get_signal_to_deliver(). |
| 711 | */ | 711 | */ |
| @@ -971,6 +971,20 @@ specific_send_sig_info(int sig, struct siginfo *info, struct task_struct *t) | |||
| 971 | return send_signal(sig, info, t, 0); | 971 | return send_signal(sig, info, t, 0); |
| 972 | } | 972 | } |
| 973 | 973 | ||
| 974 | int do_send_sig_info(int sig, struct siginfo *info, struct task_struct *p, | ||
| 975 | bool group) | ||
| 976 | { | ||
| 977 | unsigned long flags; | ||
| 978 | int ret = -ESRCH; | ||
| 979 | |||
| 980 | if (lock_task_sighand(p, &flags)) { | ||
| 981 | ret = send_signal(sig, info, p, group); | ||
| 982 | unlock_task_sighand(p, &flags); | ||
| 983 | } | ||
| 984 | |||
| 985 | return ret; | ||
| 986 | } | ||
| 987 | |||
| 974 | /* | 988 | /* |
| 975 | * Force a signal that the process can't ignore: if necessary | 989 | * Force a signal that the process can't ignore: if necessary |
| 976 | * we unblock the signal and change any SIG_IGN to SIG_DFL. | 990 | * we unblock the signal and change any SIG_IGN to SIG_DFL. |
| @@ -1036,12 +1050,6 @@ void zap_other_threads(struct task_struct *p) | |||
| 1036 | } | 1050 | } |
| 1037 | } | 1051 | } |
| 1038 | 1052 | ||
| 1039 | int __fatal_signal_pending(struct task_struct *tsk) | ||
| 1040 | { | ||
| 1041 | return sigismember(&tsk->pending.signal, SIGKILL); | ||
| 1042 | } | ||
| 1043 | EXPORT_SYMBOL(__fatal_signal_pending); | ||
| 1044 | |||
| 1045 | struct sighand_struct *lock_task_sighand(struct task_struct *tsk, unsigned long *flags) | 1053 | struct sighand_struct *lock_task_sighand(struct task_struct *tsk, unsigned long *flags) |
| 1046 | { | 1054 | { |
| 1047 | struct sighand_struct *sighand; | 1055 | struct sighand_struct *sighand; |
| @@ -1068,18 +1076,10 @@ struct sighand_struct *lock_task_sighand(struct task_struct *tsk, unsigned long | |||
| 1068 | */ | 1076 | */ |
| 1069 | int group_send_sig_info(int sig, struct siginfo *info, struct task_struct *p) | 1077 | int group_send_sig_info(int sig, struct siginfo *info, struct task_struct *p) |
| 1070 | { | 1078 | { |
| 1071 | unsigned long flags; | 1079 | int ret = check_kill_permission(sig, info, p); |
| 1072 | int ret; | ||
| 1073 | 1080 | ||
| 1074 | ret = check_kill_permission(sig, info, p); | 1081 | if (!ret && sig) |
| 1075 | 1082 | ret = do_send_sig_info(sig, info, p, true); | |
| 1076 | if (!ret && sig) { | ||
| 1077 | ret = -ESRCH; | ||
| 1078 | if (lock_task_sighand(p, &flags)) { | ||
| 1079 | ret = __group_send_sig_info(sig, info, p); | ||
| 1080 | unlock_task_sighand(p, &flags); | ||
| 1081 | } | ||
| 1082 | } | ||
| 1083 | 1083 | ||
| 1084 | return ret; | 1084 | return ret; |
| 1085 | } | 1085 | } |
| @@ -1224,15 +1224,9 @@ static int kill_something_info(int sig, struct siginfo *info, pid_t pid) | |||
| 1224 | * These are for backward compatibility with the rest of the kernel source. | 1224 | * These are for backward compatibility with the rest of the kernel source. |
| 1225 | */ | 1225 | */ |
| 1226 | 1226 | ||
| 1227 | /* | ||
| 1228 | * The caller must ensure the task can't exit. | ||
| 1229 | */ | ||
| 1230 | int | 1227 | int |
| 1231 | send_sig_info(int sig, struct siginfo *info, struct task_struct *p) | 1228 | send_sig_info(int sig, struct siginfo *info, struct task_struct *p) |
| 1232 | { | 1229 | { |
| 1233 | int ret; | ||
| 1234 | unsigned long flags; | ||
| 1235 | |||
| 1236 | /* | 1230 | /* |
| 1237 | * Make sure legacy kernel users don't send in bad values | 1231 | * Make sure legacy kernel users don't send in bad values |
| 1238 | * (normal paths check this in check_kill_permission). | 1232 | * (normal paths check this in check_kill_permission). |
| @@ -1240,10 +1234,7 @@ send_sig_info(int sig, struct siginfo *info, struct task_struct *p) | |||
| 1240 | if (!valid_signal(sig)) | 1234 | if (!valid_signal(sig)) |
| 1241 | return -EINVAL; | 1235 | return -EINVAL; |
| 1242 | 1236 | ||
| 1243 | spin_lock_irqsave(&p->sighand->siglock, flags); | 1237 | return do_send_sig_info(sig, info, p, false); |
| 1244 | ret = specific_send_sig_info(sig, info, p); | ||
| 1245 | spin_unlock_irqrestore(&p->sighand->siglock, flags); | ||
| 1246 | return ret; | ||
| 1247 | } | 1238 | } |
| 1248 | 1239 | ||
| 1249 | #define __si_special(priv) \ | 1240 | #define __si_special(priv) \ |
| @@ -1383,15 +1374,6 @@ ret: | |||
| 1383 | } | 1374 | } |
| 1384 | 1375 | ||
| 1385 | /* | 1376 | /* |
| 1386 | * Wake up any threads in the parent blocked in wait* syscalls. | ||
| 1387 | */ | ||
| 1388 | static inline void __wake_up_parent(struct task_struct *p, | ||
| 1389 | struct task_struct *parent) | ||
| 1390 | { | ||
| 1391 | wake_up_interruptible_sync(&parent->signal->wait_chldexit); | ||
| 1392 | } | ||
| 1393 | |||
| 1394 | /* | ||
| 1395 | * Let a parent know about the death of a child. | 1377 | * Let a parent know about the death of a child. |
| 1396 | * For a stopped/continued status change, use do_notify_parent_cldstop instead. | 1378 | * For a stopped/continued status change, use do_notify_parent_cldstop instead. |
| 1397 | * | 1379 | * |
| @@ -1673,29 +1655,6 @@ void ptrace_notify(int exit_code) | |||
| 1673 | spin_unlock_irq(¤t->sighand->siglock); | 1655 | spin_unlock_irq(¤t->sighand->siglock); |
| 1674 | } | 1656 | } |
| 1675 | 1657 | ||
| 1676 | static void | ||
| 1677 | finish_stop(int stop_count) | ||
| 1678 | { | ||
| 1679 | /* | ||
| 1680 | * If there are no other threads in the group, or if there is | ||
| 1681 | * a group stop in progress and we are the last to stop, | ||
| 1682 | * report to the parent. When ptraced, every thread reports itself. | ||
| 1683 | */ | ||
| 1684 | if (tracehook_notify_jctl(stop_count == 0, CLD_STOPPED)) { | ||
| 1685 | read_lock(&tasklist_lock); | ||
| 1686 | do_notify_parent_cldstop(current, CLD_STOPPED); | ||
| 1687 | read_unlock(&tasklist_lock); | ||
| 1688 | } | ||
| 1689 | |||
| 1690 | do { | ||
| 1691 | schedule(); | ||
| 1692 | } while (try_to_freeze()); | ||
| 1693 | /* | ||
| 1694 | * Now we don't run again until continued. | ||
| 1695 | */ | ||
| 1696 | current->exit_code = 0; | ||
| 1697 | } | ||
| 1698 | |||
| 1699 | /* | 1658 | /* |
| 1700 | * This performs the stopping for SIGSTOP and other stop signals. | 1659 | * This performs the stopping for SIGSTOP and other stop signals. |
| 1701 | * We have to stop all threads in the thread group. | 1660 | * We have to stop all threads in the thread group. |
| @@ -1705,15 +1664,9 @@ finish_stop(int stop_count) | |||
| 1705 | static int do_signal_stop(int signr) | 1664 | static int do_signal_stop(int signr) |
| 1706 | { | 1665 | { |
| 1707 | struct signal_struct *sig = current->signal; | 1666 | struct signal_struct *sig = current->signal; |
| 1708 | int stop_count; | 1667 | int notify; |
| 1709 | 1668 | ||
| 1710 | if (sig->group_stop_count > 0) { | 1669 | if (!sig->group_stop_count) { |
| 1711 | /* | ||
| 1712 | * There is a group stop in progress. We don't need to | ||
| 1713 | * start another one. | ||
| 1714 | */ | ||
| 1715 | stop_count = --sig->group_stop_count; | ||
| 1716 | } else { | ||
| 1717 | struct task_struct *t; | 1670 | struct task_struct *t; |
| 1718 | 1671 | ||
| 1719 | if (!likely(sig->flags & SIGNAL_STOP_DEQUEUED) || | 1672 | if (!likely(sig->flags & SIGNAL_STOP_DEQUEUED) || |
| @@ -1725,7 +1678,7 @@ static int do_signal_stop(int signr) | |||
| 1725 | */ | 1678 | */ |
| 1726 | sig->group_exit_code = signr; | 1679 | sig->group_exit_code = signr; |
| 1727 | 1680 | ||
| 1728 | stop_count = 0; | 1681 | sig->group_stop_count = 1; |
| 1729 | for (t = next_thread(current); t != current; t = next_thread(t)) | 1682 | for (t = next_thread(current); t != current; t = next_thread(t)) |
| 1730 | /* | 1683 | /* |
| 1731 | * Setting state to TASK_STOPPED for a group | 1684 | * Setting state to TASK_STOPPED for a group |
| @@ -1734,19 +1687,44 @@ static int do_signal_stop(int signr) | |||
| 1734 | */ | 1687 | */ |
| 1735 | if (!(t->flags & PF_EXITING) && | 1688 | if (!(t->flags & PF_EXITING) && |
| 1736 | !task_is_stopped_or_traced(t)) { | 1689 | !task_is_stopped_or_traced(t)) { |
| 1737 | stop_count++; | 1690 | sig->group_stop_count++; |
| 1738 | signal_wake_up(t, 0); | 1691 | signal_wake_up(t, 0); |
| 1739 | } | 1692 | } |
| 1740 | sig->group_stop_count = stop_count; | ||
| 1741 | } | 1693 | } |
| 1694 | /* | ||
| 1695 | * If there are no other threads in the group, or if there is | ||
| 1696 | * a group stop in progress and we are the last to stop, report | ||
| 1697 | * to the parent. When ptraced, every thread reports itself. | ||
| 1698 | */ | ||
| 1699 | notify = sig->group_stop_count == 1 ? CLD_STOPPED : 0; | ||
| 1700 | notify = tracehook_notify_jctl(notify, CLD_STOPPED); | ||
| 1701 | /* | ||
| 1702 | * tracehook_notify_jctl() can drop and reacquire siglock, so | ||
| 1703 | * we keep ->group_stop_count != 0 before the call. If SIGCONT | ||
| 1704 | * or SIGKILL comes in between ->group_stop_count == 0. | ||
| 1705 | */ | ||
| 1706 | if (sig->group_stop_count) { | ||
| 1707 | if (!--sig->group_stop_count) | ||
| 1708 | sig->flags = SIGNAL_STOP_STOPPED; | ||
| 1709 | current->exit_code = sig->group_exit_code; | ||
| 1710 | __set_current_state(TASK_STOPPED); | ||
| 1711 | } | ||
| 1712 | spin_unlock_irq(¤t->sighand->siglock); | ||
| 1742 | 1713 | ||
| 1743 | if (stop_count == 0) | 1714 | if (notify) { |
| 1744 | sig->flags = SIGNAL_STOP_STOPPED; | 1715 | read_lock(&tasklist_lock); |
| 1745 | current->exit_code = sig->group_exit_code; | 1716 | do_notify_parent_cldstop(current, notify); |
| 1746 | __set_current_state(TASK_STOPPED); | 1717 | read_unlock(&tasklist_lock); |
| 1718 | } | ||
| 1719 | |||
| 1720 | /* Now we don't run again until woken by SIGCONT or SIGKILL */ | ||
| 1721 | do { | ||
| 1722 | schedule(); | ||
| 1723 | } while (try_to_freeze()); | ||
| 1724 | |||
| 1725 | tracehook_finish_jctl(); | ||
| 1726 | current->exit_code = 0; | ||
| 1747 | 1727 | ||
| 1748 | spin_unlock_irq(¤t->sighand->siglock); | ||
| 1749 | finish_stop(stop_count); | ||
| 1750 | return 1; | 1728 | return 1; |
| 1751 | } | 1729 | } |
| 1752 | 1730 | ||
| @@ -1815,14 +1793,15 @@ relock: | |||
| 1815 | int why = (signal->flags & SIGNAL_STOP_CONTINUED) | 1793 | int why = (signal->flags & SIGNAL_STOP_CONTINUED) |
| 1816 | ? CLD_CONTINUED : CLD_STOPPED; | 1794 | ? CLD_CONTINUED : CLD_STOPPED; |
| 1817 | signal->flags &= ~SIGNAL_CLD_MASK; | 1795 | signal->flags &= ~SIGNAL_CLD_MASK; |
| 1818 | spin_unlock_irq(&sighand->siglock); | ||
| 1819 | 1796 | ||
| 1820 | if (unlikely(!tracehook_notify_jctl(1, why))) | 1797 | why = tracehook_notify_jctl(why, CLD_CONTINUED); |
| 1821 | goto relock; | 1798 | spin_unlock_irq(&sighand->siglock); |
| 1822 | 1799 | ||
| 1823 | read_lock(&tasklist_lock); | 1800 | if (why) { |
| 1824 | do_notify_parent_cldstop(current->group_leader, why); | 1801 | read_lock(&tasklist_lock); |
| 1825 | read_unlock(&tasklist_lock); | 1802 | do_notify_parent_cldstop(current->group_leader, why); |
| 1803 | read_unlock(&tasklist_lock); | ||
| 1804 | } | ||
| 1826 | goto relock; | 1805 | goto relock; |
| 1827 | } | 1806 | } |
| 1828 | 1807 | ||
| @@ -1987,14 +1966,14 @@ void exit_signals(struct task_struct *tsk) | |||
| 1987 | if (unlikely(tsk->signal->group_stop_count) && | 1966 | if (unlikely(tsk->signal->group_stop_count) && |
| 1988 | !--tsk->signal->group_stop_count) { | 1967 | !--tsk->signal->group_stop_count) { |
| 1989 | tsk->signal->flags = SIGNAL_STOP_STOPPED; | 1968 | tsk->signal->flags = SIGNAL_STOP_STOPPED; |
| 1990 | group_stop = 1; | 1969 | group_stop = tracehook_notify_jctl(CLD_STOPPED, CLD_STOPPED); |
| 1991 | } | 1970 | } |
| 1992 | out: | 1971 | out: |
| 1993 | spin_unlock_irq(&tsk->sighand->siglock); | 1972 | spin_unlock_irq(&tsk->sighand->siglock); |
| 1994 | 1973 | ||
| 1995 | if (unlikely(group_stop) && tracehook_notify_jctl(1, CLD_STOPPED)) { | 1974 | if (unlikely(group_stop)) { |
| 1996 | read_lock(&tasklist_lock); | 1975 | read_lock(&tasklist_lock); |
| 1997 | do_notify_parent_cldstop(tsk, CLD_STOPPED); | 1976 | do_notify_parent_cldstop(tsk, group_stop); |
| 1998 | read_unlock(&tasklist_lock); | 1977 | read_unlock(&tasklist_lock); |
| 1999 | } | 1978 | } |
| 2000 | } | 1979 | } |
| @@ -2290,7 +2269,6 @@ static int | |||
| 2290 | do_send_specific(pid_t tgid, pid_t pid, int sig, struct siginfo *info) | 2269 | do_send_specific(pid_t tgid, pid_t pid, int sig, struct siginfo *info) |
| 2291 | { | 2270 | { |
| 2292 | struct task_struct *p; | 2271 | struct task_struct *p; |
| 2293 | unsigned long flags; | ||
| 2294 | int error = -ESRCH; | 2272 | int error = -ESRCH; |
| 2295 | 2273 | ||
| 2296 | rcu_read_lock(); | 2274 | rcu_read_lock(); |
| @@ -2300,14 +2278,16 @@ do_send_specific(pid_t tgid, pid_t pid, int sig, struct siginfo *info) | |||
| 2300 | /* | 2278 | /* |
| 2301 | * The null signal is a permissions and process existence | 2279 | * The null signal is a permissions and process existence |
| 2302 | * probe. No signal is actually delivered. | 2280 | * probe. No signal is actually delivered. |
| 2303 | * | ||
| 2304 | * If lock_task_sighand() fails we pretend the task dies | ||
| 2305 | * after receiving the signal. The window is tiny, and the | ||
| 2306 | * signal is private anyway. | ||
| 2307 | */ | 2281 | */ |
| 2308 | if (!error && sig && lock_task_sighand(p, &flags)) { | 2282 | if (!error && sig) { |
| 2309 | error = specific_send_sig_info(sig, info, p); | 2283 | error = do_send_sig_info(sig, info, p, false); |
| 2310 | unlock_task_sighand(p, &flags); | 2284 | /* |
| 2285 | * If lock_task_sighand() failed we pretend the task | ||
| 2286 | * dies after receiving the signal. The window is tiny, | ||
| 2287 | * and the signal is private anyway. | ||
| 2288 | */ | ||
| 2289 | if (unlikely(error == -ESRCH)) | ||
| 2290 | error = 0; | ||
| 2311 | } | 2291 | } |
| 2312 | } | 2292 | } |
| 2313 | rcu_read_unlock(); | 2293 | rcu_read_unlock(); |
diff --git a/kernel/slow-work.c b/kernel/slow-work.c index 09d7519557d3..0d31135efbf4 100644 --- a/kernel/slow-work.c +++ b/kernel/slow-work.c | |||
| @@ -26,10 +26,10 @@ static void slow_work_cull_timeout(unsigned long); | |||
| 26 | static void slow_work_oom_timeout(unsigned long); | 26 | static void slow_work_oom_timeout(unsigned long); |
| 27 | 27 | ||
| 28 | #ifdef CONFIG_SYSCTL | 28 | #ifdef CONFIG_SYSCTL |
| 29 | static int slow_work_min_threads_sysctl(struct ctl_table *, int, struct file *, | 29 | static int slow_work_min_threads_sysctl(struct ctl_table *, int, |
| 30 | void __user *, size_t *, loff_t *); | 30 | void __user *, size_t *, loff_t *); |
| 31 | 31 | ||
| 32 | static int slow_work_max_threads_sysctl(struct ctl_table *, int , struct file *, | 32 | static int slow_work_max_threads_sysctl(struct ctl_table *, int , |
| 33 | void __user *, size_t *, loff_t *); | 33 | void __user *, size_t *, loff_t *); |
| 34 | #endif | 34 | #endif |
| 35 | 35 | ||
| @@ -493,10 +493,10 @@ static void slow_work_oom_timeout(unsigned long data) | |||
| 493 | * Handle adjustment of the minimum number of threads | 493 | * Handle adjustment of the minimum number of threads |
| 494 | */ | 494 | */ |
| 495 | static int slow_work_min_threads_sysctl(struct ctl_table *table, int write, | 495 | static int slow_work_min_threads_sysctl(struct ctl_table *table, int write, |
| 496 | struct file *filp, void __user *buffer, | 496 | void __user *buffer, |
| 497 | size_t *lenp, loff_t *ppos) | 497 | size_t *lenp, loff_t *ppos) |
| 498 | { | 498 | { |
| 499 | int ret = proc_dointvec_minmax(table, write, filp, buffer, lenp, ppos); | 499 | int ret = proc_dointvec_minmax(table, write, buffer, lenp, ppos); |
| 500 | int n; | 500 | int n; |
| 501 | 501 | ||
| 502 | if (ret == 0) { | 502 | if (ret == 0) { |
| @@ -521,10 +521,10 @@ static int slow_work_min_threads_sysctl(struct ctl_table *table, int write, | |||
| 521 | * Handle adjustment of the maximum number of threads | 521 | * Handle adjustment of the maximum number of threads |
| 522 | */ | 522 | */ |
| 523 | static int slow_work_max_threads_sysctl(struct ctl_table *table, int write, | 523 | static int slow_work_max_threads_sysctl(struct ctl_table *table, int write, |
| 524 | struct file *filp, void __user *buffer, | 524 | void __user *buffer, |
| 525 | size_t *lenp, loff_t *ppos) | 525 | size_t *lenp, loff_t *ppos) |
| 526 | { | 526 | { |
| 527 | int ret = proc_dointvec_minmax(table, write, filp, buffer, lenp, ppos); | 527 | int ret = proc_dointvec_minmax(table, write, buffer, lenp, ppos); |
| 528 | int n; | 528 | int n; |
| 529 | 529 | ||
| 530 | if (ret == 0) { | 530 | if (ret == 0) { |
diff --git a/kernel/smp.c b/kernel/smp.c index 8e218500ab14..c9d1c7835c2f 100644 --- a/kernel/smp.c +++ b/kernel/smp.c | |||
| @@ -29,8 +29,7 @@ enum { | |||
| 29 | 29 | ||
| 30 | struct call_function_data { | 30 | struct call_function_data { |
| 31 | struct call_single_data csd; | 31 | struct call_single_data csd; |
| 32 | spinlock_t lock; | 32 | atomic_t refs; |
| 33 | unsigned int refs; | ||
| 34 | cpumask_var_t cpumask; | 33 | cpumask_var_t cpumask; |
| 35 | }; | 34 | }; |
| 36 | 35 | ||
| @@ -39,9 +38,7 @@ struct call_single_queue { | |||
| 39 | spinlock_t lock; | 38 | spinlock_t lock; |
| 40 | }; | 39 | }; |
| 41 | 40 | ||
| 42 | static DEFINE_PER_CPU(struct call_function_data, cfd_data) = { | 41 | static DEFINE_PER_CPU(struct call_function_data, cfd_data); |
| 43 | .lock = __SPIN_LOCK_UNLOCKED(cfd_data.lock), | ||
| 44 | }; | ||
| 45 | 42 | ||
| 46 | static int | 43 | static int |
| 47 | hotplug_cfd(struct notifier_block *nfb, unsigned long action, void *hcpu) | 44 | hotplug_cfd(struct notifier_block *nfb, unsigned long action, void *hcpu) |
| @@ -196,25 +193,18 @@ void generic_smp_call_function_interrupt(void) | |||
| 196 | list_for_each_entry_rcu(data, &call_function.queue, csd.list) { | 193 | list_for_each_entry_rcu(data, &call_function.queue, csd.list) { |
| 197 | int refs; | 194 | int refs; |
| 198 | 195 | ||
| 199 | spin_lock(&data->lock); | 196 | if (!cpumask_test_and_clear_cpu(cpu, data->cpumask)) |
| 200 | if (!cpumask_test_cpu(cpu, data->cpumask)) { | ||
| 201 | spin_unlock(&data->lock); | ||
| 202 | continue; | 197 | continue; |
| 203 | } | ||
| 204 | cpumask_clear_cpu(cpu, data->cpumask); | ||
| 205 | spin_unlock(&data->lock); | ||
| 206 | 198 | ||
| 207 | data->csd.func(data->csd.info); | 199 | data->csd.func(data->csd.info); |
| 208 | 200 | ||
| 209 | spin_lock(&data->lock); | 201 | refs = atomic_dec_return(&data->refs); |
| 210 | WARN_ON(data->refs == 0); | 202 | WARN_ON(refs < 0); |
| 211 | refs = --data->refs; | ||
| 212 | if (!refs) { | 203 | if (!refs) { |
| 213 | spin_lock(&call_function.lock); | 204 | spin_lock(&call_function.lock); |
| 214 | list_del_rcu(&data->csd.list); | 205 | list_del_rcu(&data->csd.list); |
| 215 | spin_unlock(&call_function.lock); | 206 | spin_unlock(&call_function.lock); |
| 216 | } | 207 | } |
| 217 | spin_unlock(&data->lock); | ||
| 218 | 208 | ||
| 219 | if (refs) | 209 | if (refs) |
| 220 | continue; | 210 | continue; |
| @@ -357,13 +347,6 @@ void __smp_call_function_single(int cpu, struct call_single_data *data, | |||
| 357 | generic_exec_single(cpu, data, wait); | 347 | generic_exec_single(cpu, data, wait); |
| 358 | } | 348 | } |
| 359 | 349 | ||
| 360 | /* Deprecated: shim for archs using old arch_send_call_function_ipi API. */ | ||
| 361 | |||
| 362 | #ifndef arch_send_call_function_ipi_mask | ||
| 363 | # define arch_send_call_function_ipi_mask(maskp) \ | ||
| 364 | arch_send_call_function_ipi(*(maskp)) | ||
| 365 | #endif | ||
| 366 | |||
| 367 | /** | 350 | /** |
| 368 | * smp_call_function_many(): Run a function on a set of other CPUs. | 351 | * smp_call_function_many(): Run a function on a set of other CPUs. |
| 369 | * @mask: The set of cpus to run on (only runs on online subset). | 352 | * @mask: The set of cpus to run on (only runs on online subset). |
| @@ -419,23 +402,20 @@ void smp_call_function_many(const struct cpumask *mask, | |||
| 419 | data = &__get_cpu_var(cfd_data); | 402 | data = &__get_cpu_var(cfd_data); |
| 420 | csd_lock(&data->csd); | 403 | csd_lock(&data->csd); |
| 421 | 404 | ||
| 422 | spin_lock_irqsave(&data->lock, flags); | ||
| 423 | data->csd.func = func; | 405 | data->csd.func = func; |
| 424 | data->csd.info = info; | 406 | data->csd.info = info; |
| 425 | cpumask_and(data->cpumask, mask, cpu_online_mask); | 407 | cpumask_and(data->cpumask, mask, cpu_online_mask); |
| 426 | cpumask_clear_cpu(this_cpu, data->cpumask); | 408 | cpumask_clear_cpu(this_cpu, data->cpumask); |
| 427 | data->refs = cpumask_weight(data->cpumask); | 409 | atomic_set(&data->refs, cpumask_weight(data->cpumask)); |
| 428 | 410 | ||
| 429 | spin_lock(&call_function.lock); | 411 | spin_lock_irqsave(&call_function.lock, flags); |
| 430 | /* | 412 | /* |
| 431 | * Place entry at the _HEAD_ of the list, so that any cpu still | 413 | * Place entry at the _HEAD_ of the list, so that any cpu still |
| 432 | * observing the entry in generic_smp_call_function_interrupt() | 414 | * observing the entry in generic_smp_call_function_interrupt() |
| 433 | * will not miss any other list entries: | 415 | * will not miss any other list entries: |
| 434 | */ | 416 | */ |
| 435 | list_add_rcu(&data->csd.list, &call_function.queue); | 417 | list_add_rcu(&data->csd.list, &call_function.queue); |
| 436 | spin_unlock(&call_function.lock); | 418 | spin_unlock_irqrestore(&call_function.lock, flags); |
| 437 | |||
| 438 | spin_unlock_irqrestore(&data->lock, flags); | ||
| 439 | 419 | ||
| 440 | /* | 420 | /* |
| 441 | * Make the list addition visible before sending the ipi. | 421 | * Make the list addition visible before sending the ipi. |
diff --git a/kernel/softlockup.c b/kernel/softlockup.c index 88796c330838..81324d12eb35 100644 --- a/kernel/softlockup.c +++ b/kernel/softlockup.c | |||
| @@ -90,11 +90,11 @@ void touch_all_softlockup_watchdogs(void) | |||
| 90 | EXPORT_SYMBOL(touch_all_softlockup_watchdogs); | 90 | EXPORT_SYMBOL(touch_all_softlockup_watchdogs); |
| 91 | 91 | ||
| 92 | int proc_dosoftlockup_thresh(struct ctl_table *table, int write, | 92 | int proc_dosoftlockup_thresh(struct ctl_table *table, int write, |
| 93 | struct file *filp, void __user *buffer, | 93 | void __user *buffer, |
| 94 | size_t *lenp, loff_t *ppos) | 94 | size_t *lenp, loff_t *ppos) |
| 95 | { | 95 | { |
| 96 | touch_all_softlockup_watchdogs(); | 96 | touch_all_softlockup_watchdogs(); |
| 97 | return proc_dointvec_minmax(table, write, filp, buffer, lenp, ppos); | 97 | return proc_dointvec_minmax(table, write, buffer, lenp, ppos); |
| 98 | } | 98 | } |
| 99 | 99 | ||
| 100 | /* | 100 | /* |
diff --git a/kernel/sys.c b/kernel/sys.c index ea5c3bcac881..255475d163e0 100644 --- a/kernel/sys.c +++ b/kernel/sys.c | |||
| @@ -1338,6 +1338,7 @@ static void k_getrusage(struct task_struct *p, int who, struct rusage *r) | |||
| 1338 | unsigned long flags; | 1338 | unsigned long flags; |
| 1339 | cputime_t utime, stime; | 1339 | cputime_t utime, stime; |
| 1340 | struct task_cputime cputime; | 1340 | struct task_cputime cputime; |
| 1341 | unsigned long maxrss = 0; | ||
| 1341 | 1342 | ||
| 1342 | memset((char *) r, 0, sizeof *r); | 1343 | memset((char *) r, 0, sizeof *r); |
| 1343 | utime = stime = cputime_zero; | 1344 | utime = stime = cputime_zero; |
| @@ -1346,6 +1347,7 @@ static void k_getrusage(struct task_struct *p, int who, struct rusage *r) | |||
| 1346 | utime = task_utime(current); | 1347 | utime = task_utime(current); |
| 1347 | stime = task_stime(current); | 1348 | stime = task_stime(current); |
| 1348 | accumulate_thread_rusage(p, r); | 1349 | accumulate_thread_rusage(p, r); |
| 1350 | maxrss = p->signal->maxrss; | ||
| 1349 | goto out; | 1351 | goto out; |
| 1350 | } | 1352 | } |
| 1351 | 1353 | ||
| @@ -1363,6 +1365,7 @@ static void k_getrusage(struct task_struct *p, int who, struct rusage *r) | |||
| 1363 | r->ru_majflt = p->signal->cmaj_flt; | 1365 | r->ru_majflt = p->signal->cmaj_flt; |
| 1364 | r->ru_inblock = p->signal->cinblock; | 1366 | r->ru_inblock = p->signal->cinblock; |
| 1365 | r->ru_oublock = p->signal->coublock; | 1367 | r->ru_oublock = p->signal->coublock; |
| 1368 | maxrss = p->signal->cmaxrss; | ||
| 1366 | 1369 | ||
| 1367 | if (who == RUSAGE_CHILDREN) | 1370 | if (who == RUSAGE_CHILDREN) |
| 1368 | break; | 1371 | break; |
| @@ -1377,6 +1380,8 @@ static void k_getrusage(struct task_struct *p, int who, struct rusage *r) | |||
| 1377 | r->ru_majflt += p->signal->maj_flt; | 1380 | r->ru_majflt += p->signal->maj_flt; |
| 1378 | r->ru_inblock += p->signal->inblock; | 1381 | r->ru_inblock += p->signal->inblock; |
| 1379 | r->ru_oublock += p->signal->oublock; | 1382 | r->ru_oublock += p->signal->oublock; |
| 1383 | if (maxrss < p->signal->maxrss) | ||
| 1384 | maxrss = p->signal->maxrss; | ||
| 1380 | t = p; | 1385 | t = p; |
| 1381 | do { | 1386 | do { |
| 1382 | accumulate_thread_rusage(t, r); | 1387 | accumulate_thread_rusage(t, r); |
| @@ -1392,6 +1397,15 @@ static void k_getrusage(struct task_struct *p, int who, struct rusage *r) | |||
| 1392 | out: | 1397 | out: |
| 1393 | cputime_to_timeval(utime, &r->ru_utime); | 1398 | cputime_to_timeval(utime, &r->ru_utime); |
| 1394 | cputime_to_timeval(stime, &r->ru_stime); | 1399 | cputime_to_timeval(stime, &r->ru_stime); |
| 1400 | |||
| 1401 | if (who != RUSAGE_CHILDREN) { | ||
| 1402 | struct mm_struct *mm = get_task_mm(p); | ||
| 1403 | if (mm) { | ||
| 1404 | setmax_mm_hiwater_rss(&maxrss, mm); | ||
| 1405 | mmput(mm); | ||
| 1406 | } | ||
| 1407 | } | ||
| 1408 | r->ru_maxrss = maxrss * (PAGE_SIZE / 1024); /* convert pages to KBs */ | ||
| 1395 | } | 1409 | } |
| 1396 | 1410 | ||
| 1397 | int getrusage(struct task_struct *p, int who, struct rusage __user *ru) | 1411 | int getrusage(struct task_struct *p, int who, struct rusage __user *ru) |
| @@ -1528,6 +1542,28 @@ SYSCALL_DEFINE5(prctl, int, option, unsigned long, arg2, unsigned long, arg3, | |||
| 1528 | current->timer_slack_ns = arg2; | 1542 | current->timer_slack_ns = arg2; |
| 1529 | error = 0; | 1543 | error = 0; |
| 1530 | break; | 1544 | break; |
| 1545 | case PR_MCE_KILL: | ||
| 1546 | if (arg4 | arg5) | ||
| 1547 | return -EINVAL; | ||
| 1548 | switch (arg2) { | ||
| 1549 | case 0: | ||
| 1550 | if (arg3 != 0) | ||
| 1551 | return -EINVAL; | ||
| 1552 | current->flags &= ~PF_MCE_PROCESS; | ||
| 1553 | break; | ||
| 1554 | case 1: | ||
| 1555 | current->flags |= PF_MCE_PROCESS; | ||
| 1556 | if (arg3 != 0) | ||
| 1557 | current->flags |= PF_MCE_EARLY; | ||
| 1558 | else | ||
| 1559 | current->flags &= ~PF_MCE_EARLY; | ||
| 1560 | break; | ||
| 1561 | default: | ||
| 1562 | return -EINVAL; | ||
| 1563 | } | ||
| 1564 | error = 0; | ||
| 1565 | break; | ||
| 1566 | |||
| 1531 | default: | 1567 | default: |
| 1532 | error = -EINVAL; | 1568 | error = -EINVAL; |
| 1533 | break; | 1569 | break; |
diff --git a/kernel/sys_ni.c b/kernel/sys_ni.c index 515bc230ac2a..e06d0b8d1951 100644 --- a/kernel/sys_ni.c +++ b/kernel/sys_ni.c | |||
| @@ -49,6 +49,7 @@ cond_syscall(sys_sendmsg); | |||
| 49 | cond_syscall(compat_sys_sendmsg); | 49 | cond_syscall(compat_sys_sendmsg); |
| 50 | cond_syscall(sys_recvmsg); | 50 | cond_syscall(sys_recvmsg); |
| 51 | cond_syscall(compat_sys_recvmsg); | 51 | cond_syscall(compat_sys_recvmsg); |
| 52 | cond_syscall(compat_sys_recvfrom); | ||
| 52 | cond_syscall(sys_socketcall); | 53 | cond_syscall(sys_socketcall); |
| 53 | cond_syscall(sys_futex); | 54 | cond_syscall(sys_futex); |
| 54 | cond_syscall(compat_sys_futex); | 55 | cond_syscall(compat_sys_futex); |
diff --git a/kernel/sysctl.c b/kernel/sysctl.c index 6ba49c7cb128..0d949c517412 100644 --- a/kernel/sysctl.c +++ b/kernel/sysctl.c | |||
| @@ -26,7 +26,6 @@ | |||
| 26 | #include <linux/proc_fs.h> | 26 | #include <linux/proc_fs.h> |
| 27 | #include <linux/security.h> | 27 | #include <linux/security.h> |
| 28 | #include <linux/ctype.h> | 28 | #include <linux/ctype.h> |
| 29 | #include <linux/utsname.h> | ||
| 30 | #include <linux/kmemcheck.h> | 29 | #include <linux/kmemcheck.h> |
| 31 | #include <linux/smp_lock.h> | 30 | #include <linux/smp_lock.h> |
| 32 | #include <linux/fs.h> | 31 | #include <linux/fs.h> |
| @@ -77,6 +76,7 @@ extern int max_threads; | |||
| 77 | extern int core_uses_pid; | 76 | extern int core_uses_pid; |
| 78 | extern int suid_dumpable; | 77 | extern int suid_dumpable; |
| 79 | extern char core_pattern[]; | 78 | extern char core_pattern[]; |
| 79 | extern unsigned int core_pipe_limit; | ||
| 80 | extern int pid_max; | 80 | extern int pid_max; |
| 81 | extern int min_free_kbytes; | 81 | extern int min_free_kbytes; |
| 82 | extern int pid_max_min, pid_max_max; | 82 | extern int pid_max_min, pid_max_max; |
| @@ -106,6 +106,9 @@ static int __maybe_unused one = 1; | |||
| 106 | static int __maybe_unused two = 2; | 106 | static int __maybe_unused two = 2; |
| 107 | static unsigned long one_ul = 1; | 107 | static unsigned long one_ul = 1; |
| 108 | static int one_hundred = 100; | 108 | static int one_hundred = 100; |
| 109 | #ifdef CONFIG_PRINTK | ||
| 110 | static int ten_thousand = 10000; | ||
| 111 | #endif | ||
| 109 | 112 | ||
| 110 | /* this is needed for the proc_doulongvec_minmax of vm_dirty_bytes */ | 113 | /* this is needed for the proc_doulongvec_minmax of vm_dirty_bytes */ |
| 111 | static unsigned long dirty_bytes_min = 2 * PAGE_SIZE; | 114 | static unsigned long dirty_bytes_min = 2 * PAGE_SIZE; |
| @@ -160,9 +163,9 @@ extern int max_lock_depth; | |||
| 160 | #endif | 163 | #endif |
| 161 | 164 | ||
| 162 | #ifdef CONFIG_PROC_SYSCTL | 165 | #ifdef CONFIG_PROC_SYSCTL |
| 163 | static int proc_do_cad_pid(struct ctl_table *table, int write, struct file *filp, | 166 | static int proc_do_cad_pid(struct ctl_table *table, int write, |
| 164 | void __user *buffer, size_t *lenp, loff_t *ppos); | 167 | void __user *buffer, size_t *lenp, loff_t *ppos); |
| 165 | static int proc_taint(struct ctl_table *table, int write, struct file *filp, | 168 | static int proc_taint(struct ctl_table *table, int write, |
| 166 | void __user *buffer, size_t *lenp, loff_t *ppos); | 169 | void __user *buffer, size_t *lenp, loff_t *ppos); |
| 167 | #endif | 170 | #endif |
| 168 | 171 | ||
| @@ -421,6 +424,14 @@ static struct ctl_table kern_table[] = { | |||
| 421 | .proc_handler = &proc_dostring, | 424 | .proc_handler = &proc_dostring, |
| 422 | .strategy = &sysctl_string, | 425 | .strategy = &sysctl_string, |
| 423 | }, | 426 | }, |
| 427 | { | ||
| 428 | .ctl_name = CTL_UNNUMBERED, | ||
| 429 | .procname = "core_pipe_limit", | ||
| 430 | .data = &core_pipe_limit, | ||
| 431 | .maxlen = sizeof(unsigned int), | ||
| 432 | .mode = 0644, | ||
| 433 | .proc_handler = &proc_dointvec, | ||
| 434 | }, | ||
| 424 | #ifdef CONFIG_PROC_SYSCTL | 435 | #ifdef CONFIG_PROC_SYSCTL |
| 425 | { | 436 | { |
| 426 | .procname = "tainted", | 437 | .procname = "tainted", |
| @@ -722,6 +733,17 @@ static struct ctl_table kern_table[] = { | |||
| 722 | .mode = 0644, | 733 | .mode = 0644, |
| 723 | .proc_handler = &proc_dointvec, | 734 | .proc_handler = &proc_dointvec, |
| 724 | }, | 735 | }, |
| 736 | { | ||
| 737 | .ctl_name = CTL_UNNUMBERED, | ||
| 738 | .procname = "printk_delay", | ||
| 739 | .data = &printk_delay_msec, | ||
| 740 | .maxlen = sizeof(int), | ||
| 741 | .mode = 0644, | ||
| 742 | .proc_handler = &proc_dointvec_minmax, | ||
| 743 | .strategy = &sysctl_intvec, | ||
| 744 | .extra1 = &zero, | ||
| 745 | .extra2 = &ten_thousand, | ||
| 746 | }, | ||
| 725 | #endif | 747 | #endif |
| 726 | { | 748 | { |
| 727 | .ctl_name = KERN_NGROUPS_MAX, | 749 | .ctl_name = KERN_NGROUPS_MAX, |
| @@ -1376,6 +1398,31 @@ static struct ctl_table vm_table[] = { | |||
| 1376 | .mode = 0644, | 1398 | .mode = 0644, |
| 1377 | .proc_handler = &scan_unevictable_handler, | 1399 | .proc_handler = &scan_unevictable_handler, |
| 1378 | }, | 1400 | }, |
| 1401 | #ifdef CONFIG_MEMORY_FAILURE | ||
| 1402 | { | ||
| 1403 | .ctl_name = CTL_UNNUMBERED, | ||
| 1404 | .procname = "memory_failure_early_kill", | ||
| 1405 | .data = &sysctl_memory_failure_early_kill, | ||
| 1406 | .maxlen = sizeof(sysctl_memory_failure_early_kill), | ||
| 1407 | .mode = 0644, | ||
| 1408 | .proc_handler = &proc_dointvec_minmax, | ||
| 1409 | .strategy = &sysctl_intvec, | ||
| 1410 | .extra1 = &zero, | ||
| 1411 | .extra2 = &one, | ||
| 1412 | }, | ||
| 1413 | { | ||
| 1414 | .ctl_name = CTL_UNNUMBERED, | ||
| 1415 | .procname = "memory_failure_recovery", | ||
| 1416 | .data = &sysctl_memory_failure_recovery, | ||
| 1417 | .maxlen = sizeof(sysctl_memory_failure_recovery), | ||
| 1418 | .mode = 0644, | ||
| 1419 | .proc_handler = &proc_dointvec_minmax, | ||
| 1420 | .strategy = &sysctl_intvec, | ||
| 1421 | .extra1 = &zero, | ||
| 1422 | .extra2 = &one, | ||
| 1423 | }, | ||
| 1424 | #endif | ||
| 1425 | |||
| 1379 | /* | 1426 | /* |
| 1380 | * NOTE: do not add new entries to this table unless you have read | 1427 | * NOTE: do not add new entries to this table unless you have read |
| 1381 | * Documentation/sysctl/ctl_unnumbered.txt | 1428 | * Documentation/sysctl/ctl_unnumbered.txt |
| @@ -2204,7 +2251,7 @@ void sysctl_head_put(struct ctl_table_header *head) | |||
| 2204 | #ifdef CONFIG_PROC_SYSCTL | 2251 | #ifdef CONFIG_PROC_SYSCTL |
| 2205 | 2252 | ||
| 2206 | static int _proc_do_string(void* data, int maxlen, int write, | 2253 | static int _proc_do_string(void* data, int maxlen, int write, |
| 2207 | struct file *filp, void __user *buffer, | 2254 | void __user *buffer, |
| 2208 | size_t *lenp, loff_t *ppos) | 2255 | size_t *lenp, loff_t *ppos) |
| 2209 | { | 2256 | { |
| 2210 | size_t len; | 2257 | size_t len; |
| @@ -2265,7 +2312,6 @@ static int _proc_do_string(void* data, int maxlen, int write, | |||
| 2265 | * proc_dostring - read a string sysctl | 2312 | * proc_dostring - read a string sysctl |
| 2266 | * @table: the sysctl table | 2313 | * @table: the sysctl table |
| 2267 | * @write: %TRUE if this is a write to the sysctl file | 2314 | * @write: %TRUE if this is a write to the sysctl file |
| 2268 | * @filp: the file structure | ||
| 2269 | * @buffer: the user buffer | 2315 | * @buffer: the user buffer |
| 2270 | * @lenp: the size of the user buffer | 2316 | * @lenp: the size of the user buffer |
| 2271 | * @ppos: file position | 2317 | * @ppos: file position |
| @@ -2279,10 +2325,10 @@ static int _proc_do_string(void* data, int maxlen, int write, | |||
| 2279 | * | 2325 | * |
| 2280 | * Returns 0 on success. | 2326 | * Returns 0 on success. |
| 2281 | */ | 2327 | */ |
| 2282 | int proc_dostring(struct ctl_table *table, int write, struct file *filp, | 2328 | int proc_dostring(struct ctl_table *table, int write, |
| 2283 | void __user *buffer, size_t *lenp, loff_t *ppos) | 2329 | void __user *buffer, size_t *lenp, loff_t *ppos) |
| 2284 | { | 2330 | { |
| 2285 | return _proc_do_string(table->data, table->maxlen, write, filp, | 2331 | return _proc_do_string(table->data, table->maxlen, write, |
| 2286 | buffer, lenp, ppos); | 2332 | buffer, lenp, ppos); |
| 2287 | } | 2333 | } |
| 2288 | 2334 | ||
| @@ -2307,7 +2353,7 @@ static int do_proc_dointvec_conv(int *negp, unsigned long *lvalp, | |||
| 2307 | } | 2353 | } |
| 2308 | 2354 | ||
| 2309 | static int __do_proc_dointvec(void *tbl_data, struct ctl_table *table, | 2355 | static int __do_proc_dointvec(void *tbl_data, struct ctl_table *table, |
| 2310 | int write, struct file *filp, void __user *buffer, | 2356 | int write, void __user *buffer, |
| 2311 | size_t *lenp, loff_t *ppos, | 2357 | size_t *lenp, loff_t *ppos, |
| 2312 | int (*conv)(int *negp, unsigned long *lvalp, int *valp, | 2358 | int (*conv)(int *negp, unsigned long *lvalp, int *valp, |
| 2313 | int write, void *data), | 2359 | int write, void *data), |
| @@ -2414,13 +2460,13 @@ static int __do_proc_dointvec(void *tbl_data, struct ctl_table *table, | |||
| 2414 | #undef TMPBUFLEN | 2460 | #undef TMPBUFLEN |
| 2415 | } | 2461 | } |
| 2416 | 2462 | ||
| 2417 | static int do_proc_dointvec(struct ctl_table *table, int write, struct file *filp, | 2463 | static int do_proc_dointvec(struct ctl_table *table, int write, |
| 2418 | void __user *buffer, size_t *lenp, loff_t *ppos, | 2464 | void __user *buffer, size_t *lenp, loff_t *ppos, |
| 2419 | int (*conv)(int *negp, unsigned long *lvalp, int *valp, | 2465 | int (*conv)(int *negp, unsigned long *lvalp, int *valp, |
| 2420 | int write, void *data), | 2466 | int write, void *data), |
| 2421 | void *data) | 2467 | void *data) |
| 2422 | { | 2468 | { |
| 2423 | return __do_proc_dointvec(table->data, table, write, filp, | 2469 | return __do_proc_dointvec(table->data, table, write, |
| 2424 | buffer, lenp, ppos, conv, data); | 2470 | buffer, lenp, ppos, conv, data); |
| 2425 | } | 2471 | } |
| 2426 | 2472 | ||
| @@ -2428,7 +2474,6 @@ static int do_proc_dointvec(struct ctl_table *table, int write, struct file *fil | |||
| 2428 | * proc_dointvec - read a vector of integers | 2474 | * proc_dointvec - read a vector of integers |
| 2429 | * @table: the sysctl table | 2475 | * @table: the sysctl table |
| 2430 | * @write: %TRUE if this is a write to the sysctl file | 2476 | * @write: %TRUE if this is a write to the sysctl file |
| 2431 | * @filp: the file structure | ||
| 2432 | * @buffer: the user buffer | 2477 | * @buffer: the user buffer |
| 2433 | * @lenp: the size of the user buffer | 2478 | * @lenp: the size of the user buffer |
| 2434 | * @ppos: file position | 2479 | * @ppos: file position |
| @@ -2438,10 +2483,10 @@ static int do_proc_dointvec(struct ctl_table *table, int write, struct file *fil | |||
| 2438 | * | 2483 | * |
| 2439 | * Returns 0 on success. | 2484 | * Returns 0 on success. |
| 2440 | */ | 2485 | */ |
| 2441 | int proc_dointvec(struct ctl_table *table, int write, struct file *filp, | 2486 | int proc_dointvec(struct ctl_table *table, int write, |
| 2442 | void __user *buffer, size_t *lenp, loff_t *ppos) | 2487 | void __user *buffer, size_t *lenp, loff_t *ppos) |
| 2443 | { | 2488 | { |
| 2444 | return do_proc_dointvec(table,write,filp,buffer,lenp,ppos, | 2489 | return do_proc_dointvec(table,write,buffer,lenp,ppos, |
| 2445 | NULL,NULL); | 2490 | NULL,NULL); |
| 2446 | } | 2491 | } |
| 2447 | 2492 | ||
| @@ -2449,7 +2494,7 @@ int proc_dointvec(struct ctl_table *table, int write, struct file *filp, | |||
| 2449 | * Taint values can only be increased | 2494 | * Taint values can only be increased |
| 2450 | * This means we can safely use a temporary. | 2495 | * This means we can safely use a temporary. |
| 2451 | */ | 2496 | */ |
| 2452 | static int proc_taint(struct ctl_table *table, int write, struct file *filp, | 2497 | static int proc_taint(struct ctl_table *table, int write, |
| 2453 | void __user *buffer, size_t *lenp, loff_t *ppos) | 2498 | void __user *buffer, size_t *lenp, loff_t *ppos) |
| 2454 | { | 2499 | { |
| 2455 | struct ctl_table t; | 2500 | struct ctl_table t; |
| @@ -2461,7 +2506,7 @@ static int proc_taint(struct ctl_table *table, int write, struct file *filp, | |||
| 2461 | 2506 | ||
| 2462 | t = *table; | 2507 | t = *table; |
| 2463 | t.data = &tmptaint; | 2508 | t.data = &tmptaint; |
| 2464 | err = proc_doulongvec_minmax(&t, write, filp, buffer, lenp, ppos); | 2509 | err = proc_doulongvec_minmax(&t, write, buffer, lenp, ppos); |
| 2465 | if (err < 0) | 2510 | if (err < 0) |
| 2466 | return err; | 2511 | return err; |
| 2467 | 2512 | ||
| @@ -2513,7 +2558,6 @@ static int do_proc_dointvec_minmax_conv(int *negp, unsigned long *lvalp, | |||
| 2513 | * proc_dointvec_minmax - read a vector of integers with min/max values | 2558 | * proc_dointvec_minmax - read a vector of integers with min/max values |
| 2514 | * @table: the sysctl table | 2559 | * @table: the sysctl table |
| 2515 | * @write: %TRUE if this is a write to the sysctl file | 2560 | * @write: %TRUE if this is a write to the sysctl file |
| 2516 | * @filp: the file structure | ||
| 2517 | * @buffer: the user buffer | 2561 | * @buffer: the user buffer |
| 2518 | * @lenp: the size of the user buffer | 2562 | * @lenp: the size of the user buffer |
| 2519 | * @ppos: file position | 2563 | * @ppos: file position |
| @@ -2526,19 +2570,18 @@ static int do_proc_dointvec_minmax_conv(int *negp, unsigned long *lvalp, | |||
| 2526 | * | 2570 | * |
| 2527 | * Returns 0 on success. | 2571 | * Returns 0 on success. |
| 2528 | */ | 2572 | */ |
| 2529 | int proc_dointvec_minmax(struct ctl_table *table, int write, struct file *filp, | 2573 | int proc_dointvec_minmax(struct ctl_table *table, int write, |
| 2530 | void __user *buffer, size_t *lenp, loff_t *ppos) | 2574 | void __user *buffer, size_t *lenp, loff_t *ppos) |
| 2531 | { | 2575 | { |
| 2532 | struct do_proc_dointvec_minmax_conv_param param = { | 2576 | struct do_proc_dointvec_minmax_conv_param param = { |
| 2533 | .min = (int *) table->extra1, | 2577 | .min = (int *) table->extra1, |
| 2534 | .max = (int *) table->extra2, | 2578 | .max = (int *) table->extra2, |
| 2535 | }; | 2579 | }; |
| 2536 | return do_proc_dointvec(table, write, filp, buffer, lenp, ppos, | 2580 | return do_proc_dointvec(table, write, buffer, lenp, ppos, |
| 2537 | do_proc_dointvec_minmax_conv, ¶m); | 2581 | do_proc_dointvec_minmax_conv, ¶m); |
| 2538 | } | 2582 | } |
| 2539 | 2583 | ||
| 2540 | static int __do_proc_doulongvec_minmax(void *data, struct ctl_table *table, int write, | 2584 | static int __do_proc_doulongvec_minmax(void *data, struct ctl_table *table, int write, |
| 2541 | struct file *filp, | ||
| 2542 | void __user *buffer, | 2585 | void __user *buffer, |
| 2543 | size_t *lenp, loff_t *ppos, | 2586 | size_t *lenp, loff_t *ppos, |
| 2544 | unsigned long convmul, | 2587 | unsigned long convmul, |
| @@ -2643,21 +2686,19 @@ static int __do_proc_doulongvec_minmax(void *data, struct ctl_table *table, int | |||
| 2643 | } | 2686 | } |
| 2644 | 2687 | ||
| 2645 | static int do_proc_doulongvec_minmax(struct ctl_table *table, int write, | 2688 | static int do_proc_doulongvec_minmax(struct ctl_table *table, int write, |
| 2646 | struct file *filp, | ||
| 2647 | void __user *buffer, | 2689 | void __user *buffer, |
| 2648 | size_t *lenp, loff_t *ppos, | 2690 | size_t *lenp, loff_t *ppos, |
| 2649 | unsigned long convmul, | 2691 | unsigned long convmul, |
| 2650 | unsigned long convdiv) | 2692 | unsigned long convdiv) |
| 2651 | { | 2693 | { |
| 2652 | return __do_proc_doulongvec_minmax(table->data, table, write, | 2694 | return __do_proc_doulongvec_minmax(table->data, table, write, |
| 2653 | filp, buffer, lenp, ppos, convmul, convdiv); | 2695 | buffer, lenp, ppos, convmul, convdiv); |
| 2654 | } | 2696 | } |
| 2655 | 2697 | ||
| 2656 | /** | 2698 | /** |
| 2657 | * proc_doulongvec_minmax - read a vector of long integers with min/max values | 2699 | * proc_doulongvec_minmax - read a vector of long integers with min/max values |
| 2658 | * @table: the sysctl table | 2700 | * @table: the sysctl table |
| 2659 | * @write: %TRUE if this is a write to the sysctl file | 2701 | * @write: %TRUE if this is a write to the sysctl file |
| 2660 | * @filp: the file structure | ||
| 2661 | * @buffer: the user buffer | 2702 | * @buffer: the user buffer |
| 2662 | * @lenp: the size of the user buffer | 2703 | * @lenp: the size of the user buffer |
| 2663 | * @ppos: file position | 2704 | * @ppos: file position |
| @@ -2670,17 +2711,16 @@ static int do_proc_doulongvec_minmax(struct ctl_table *table, int write, | |||
| 2670 | * | 2711 | * |
| 2671 | * Returns 0 on success. | 2712 | * Returns 0 on success. |
| 2672 | */ | 2713 | */ |
| 2673 | int proc_doulongvec_minmax(struct ctl_table *table, int write, struct file *filp, | 2714 | int proc_doulongvec_minmax(struct ctl_table *table, int write, |
| 2674 | void __user *buffer, size_t *lenp, loff_t *ppos) | 2715 | void __user *buffer, size_t *lenp, loff_t *ppos) |
| 2675 | { | 2716 | { |
| 2676 | return do_proc_doulongvec_minmax(table, write, filp, buffer, lenp, ppos, 1l, 1l); | 2717 | return do_proc_doulongvec_minmax(table, write, buffer, lenp, ppos, 1l, 1l); |
| 2677 | } | 2718 | } |
| 2678 | 2719 | ||
| 2679 | /** | 2720 | /** |
| 2680 | * proc_doulongvec_ms_jiffies_minmax - read a vector of millisecond values with min/max values | 2721 | * proc_doulongvec_ms_jiffies_minmax - read a vector of millisecond values with min/max values |
| 2681 | * @table: the sysctl table | 2722 | * @table: the sysctl table |
| 2682 | * @write: %TRUE if this is a write to the sysctl file | 2723 | * @write: %TRUE if this is a write to the sysctl file |
| 2683 | * @filp: the file structure | ||
| 2684 | * @buffer: the user buffer | 2724 | * @buffer: the user buffer |
| 2685 | * @lenp: the size of the user buffer | 2725 | * @lenp: the size of the user buffer |
| 2686 | * @ppos: file position | 2726 | * @ppos: file position |
| @@ -2695,11 +2735,10 @@ int proc_doulongvec_minmax(struct ctl_table *table, int write, struct file *filp | |||
| 2695 | * Returns 0 on success. | 2735 | * Returns 0 on success. |
| 2696 | */ | 2736 | */ |
| 2697 | int proc_doulongvec_ms_jiffies_minmax(struct ctl_table *table, int write, | 2737 | int proc_doulongvec_ms_jiffies_minmax(struct ctl_table *table, int write, |
| 2698 | struct file *filp, | ||
| 2699 | void __user *buffer, | 2738 | void __user *buffer, |
| 2700 | size_t *lenp, loff_t *ppos) | 2739 | size_t *lenp, loff_t *ppos) |
| 2701 | { | 2740 | { |
| 2702 | return do_proc_doulongvec_minmax(table, write, filp, buffer, | 2741 | return do_proc_doulongvec_minmax(table, write, buffer, |
| 2703 | lenp, ppos, HZ, 1000l); | 2742 | lenp, ppos, HZ, 1000l); |
| 2704 | } | 2743 | } |
| 2705 | 2744 | ||
| @@ -2775,7 +2814,6 @@ static int do_proc_dointvec_ms_jiffies_conv(int *negp, unsigned long *lvalp, | |||
| 2775 | * proc_dointvec_jiffies - read a vector of integers as seconds | 2814 | * proc_dointvec_jiffies - read a vector of integers as seconds |
| 2776 | * @table: the sysctl table | 2815 | * @table: the sysctl table |
| 2777 | * @write: %TRUE if this is a write to the sysctl file | 2816 | * @write: %TRUE if this is a write to the sysctl file |
| 2778 | * @filp: the file structure | ||
| 2779 | * @buffer: the user buffer | 2817 | * @buffer: the user buffer |
| 2780 | * @lenp: the size of the user buffer | 2818 | * @lenp: the size of the user buffer |
| 2781 | * @ppos: file position | 2819 | * @ppos: file position |
| @@ -2787,10 +2825,10 @@ static int do_proc_dointvec_ms_jiffies_conv(int *negp, unsigned long *lvalp, | |||
| 2787 | * | 2825 | * |
| 2788 | * Returns 0 on success. | 2826 | * Returns 0 on success. |
| 2789 | */ | 2827 | */ |
| 2790 | int proc_dointvec_jiffies(struct ctl_table *table, int write, struct file *filp, | 2828 | int proc_dointvec_jiffies(struct ctl_table *table, int write, |
| 2791 | void __user *buffer, size_t *lenp, loff_t *ppos) | 2829 | void __user *buffer, size_t *lenp, loff_t *ppos) |
| 2792 | { | 2830 | { |
| 2793 | return do_proc_dointvec(table,write,filp,buffer,lenp,ppos, | 2831 | return do_proc_dointvec(table,write,buffer,lenp,ppos, |
| 2794 | do_proc_dointvec_jiffies_conv,NULL); | 2832 | do_proc_dointvec_jiffies_conv,NULL); |
| 2795 | } | 2833 | } |
| 2796 | 2834 | ||
| @@ -2798,7 +2836,6 @@ int proc_dointvec_jiffies(struct ctl_table *table, int write, struct file *filp, | |||
| 2798 | * proc_dointvec_userhz_jiffies - read a vector of integers as 1/USER_HZ seconds | 2836 | * proc_dointvec_userhz_jiffies - read a vector of integers as 1/USER_HZ seconds |
| 2799 | * @table: the sysctl table | 2837 | * @table: the sysctl table |
| 2800 | * @write: %TRUE if this is a write to the sysctl file | 2838 | * @write: %TRUE if this is a write to the sysctl file |
| 2801 | * @filp: the file structure | ||
| 2802 | * @buffer: the user buffer | 2839 | * @buffer: the user buffer |
| 2803 | * @lenp: the size of the user buffer | 2840 | * @lenp: the size of the user buffer |
| 2804 | * @ppos: pointer to the file position | 2841 | * @ppos: pointer to the file position |
| @@ -2810,10 +2847,10 @@ int proc_dointvec_jiffies(struct ctl_table *table, int write, struct file *filp, | |||
| 2810 | * | 2847 | * |
| 2811 | * Returns 0 on success. | 2848 | * Returns 0 on success. |
| 2812 | */ | 2849 | */ |
| 2813 | int proc_dointvec_userhz_jiffies(struct ctl_table *table, int write, struct file *filp, | 2850 | int proc_dointvec_userhz_jiffies(struct ctl_table *table, int write, |
| 2814 | void __user *buffer, size_t *lenp, loff_t *ppos) | 2851 | void __user *buffer, size_t *lenp, loff_t *ppos) |
| 2815 | { | 2852 | { |
| 2816 | return do_proc_dointvec(table,write,filp,buffer,lenp,ppos, | 2853 | return do_proc_dointvec(table,write,buffer,lenp,ppos, |
| 2817 | do_proc_dointvec_userhz_jiffies_conv,NULL); | 2854 | do_proc_dointvec_userhz_jiffies_conv,NULL); |
| 2818 | } | 2855 | } |
| 2819 | 2856 | ||
| @@ -2821,7 +2858,6 @@ int proc_dointvec_userhz_jiffies(struct ctl_table *table, int write, struct file | |||
| 2821 | * proc_dointvec_ms_jiffies - read a vector of integers as 1 milliseconds | 2858 | * proc_dointvec_ms_jiffies - read a vector of integers as 1 milliseconds |
| 2822 | * @table: the sysctl table | 2859 | * @table: the sysctl table |
| 2823 | * @write: %TRUE if this is a write to the sysctl file | 2860 | * @write: %TRUE if this is a write to the sysctl file |
| 2824 | * @filp: the file structure | ||
| 2825 | * @buffer: the user buffer | 2861 | * @buffer: the user buffer |
| 2826 | * @lenp: the size of the user buffer | 2862 | * @lenp: the size of the user buffer |
| 2827 | * @ppos: file position | 2863 | * @ppos: file position |
| @@ -2834,14 +2870,14 @@ int proc_dointvec_userhz_jiffies(struct ctl_table *table, int write, struct file | |||
| 2834 | * | 2870 | * |
| 2835 | * Returns 0 on success. | 2871 | * Returns 0 on success. |
| 2836 | */ | 2872 | */ |
| 2837 | int proc_dointvec_ms_jiffies(struct ctl_table *table, int write, struct file *filp, | 2873 | int proc_dointvec_ms_jiffies(struct ctl_table *table, int write, |
| 2838 | void __user *buffer, size_t *lenp, loff_t *ppos) | 2874 | void __user *buffer, size_t *lenp, loff_t *ppos) |
| 2839 | { | 2875 | { |
| 2840 | return do_proc_dointvec(table, write, filp, buffer, lenp, ppos, | 2876 | return do_proc_dointvec(table, write, buffer, lenp, ppos, |
| 2841 | do_proc_dointvec_ms_jiffies_conv, NULL); | 2877 | do_proc_dointvec_ms_jiffies_conv, NULL); |
| 2842 | } | 2878 | } |
| 2843 | 2879 | ||
| 2844 | static int proc_do_cad_pid(struct ctl_table *table, int write, struct file *filp, | 2880 | static int proc_do_cad_pid(struct ctl_table *table, int write, |
| 2845 | void __user *buffer, size_t *lenp, loff_t *ppos) | 2881 | void __user *buffer, size_t *lenp, loff_t *ppos) |
| 2846 | { | 2882 | { |
| 2847 | struct pid *new_pid; | 2883 | struct pid *new_pid; |
| @@ -2850,7 +2886,7 @@ static int proc_do_cad_pid(struct ctl_table *table, int write, struct file *filp | |||
| 2850 | 2886 | ||
| 2851 | tmp = pid_vnr(cad_pid); | 2887 | tmp = pid_vnr(cad_pid); |
| 2852 | 2888 | ||
| 2853 | r = __do_proc_dointvec(&tmp, table, write, filp, buffer, | 2889 | r = __do_proc_dointvec(&tmp, table, write, buffer, |
| 2854 | lenp, ppos, NULL, NULL); | 2890 | lenp, ppos, NULL, NULL); |
| 2855 | if (r || !write) | 2891 | if (r || !write) |
| 2856 | return r; | 2892 | return r; |
| @@ -2865,50 +2901,49 @@ static int proc_do_cad_pid(struct ctl_table *table, int write, struct file *filp | |||
| 2865 | 2901 | ||
| 2866 | #else /* CONFIG_PROC_FS */ | 2902 | #else /* CONFIG_PROC_FS */ |
| 2867 | 2903 | ||
| 2868 | int proc_dostring(struct ctl_table *table, int write, struct file *filp, | 2904 | int proc_dostring(struct ctl_table *table, int write, |
| 2869 | void __user *buffer, size_t *lenp, loff_t *ppos) | 2905 | void __user *buffer, size_t *lenp, loff_t *ppos) |
| 2870 | { | 2906 | { |
| 2871 | return -ENOSYS; | 2907 | return -ENOSYS; |
| 2872 | } | 2908 | } |
| 2873 | 2909 | ||
| 2874 | int proc_dointvec(struct ctl_table *table, int write, struct file *filp, | 2910 | int proc_dointvec(struct ctl_table *table, int write, |
| 2875 | void __user *buffer, size_t *lenp, loff_t *ppos) | 2911 | void __user *buffer, size_t *lenp, loff_t *ppos) |
| 2876 | { | 2912 | { |
| 2877 | return -ENOSYS; | 2913 | return -ENOSYS; |
| 2878 | } | 2914 | } |
| 2879 | 2915 | ||
| 2880 | int proc_dointvec_minmax(struct ctl_table *table, int write, struct file *filp, | 2916 | int proc_dointvec_minmax(struct ctl_table *table, int write, |
| 2881 | void __user *buffer, size_t *lenp, loff_t *ppos) | 2917 | void __user *buffer, size_t *lenp, loff_t *ppos) |
| 2882 | { | 2918 | { |
| 2883 | return -ENOSYS; | 2919 | return -ENOSYS; |
| 2884 | } | 2920 | } |
| 2885 | 2921 | ||
| 2886 | int proc_dointvec_jiffies(struct ctl_table *table, int write, struct file *filp, | 2922 | int proc_dointvec_jiffies(struct ctl_table *table, int write, |
| 2887 | void __user *buffer, size_t *lenp, loff_t *ppos) | 2923 | void __user *buffer, size_t *lenp, loff_t *ppos) |
| 2888 | { | 2924 | { |
| 2889 | return -ENOSYS; | 2925 | return -ENOSYS; |
| 2890 | } | 2926 | } |
| 2891 | 2927 | ||
| 2892 | int proc_dointvec_userhz_jiffies(struct ctl_table *table, int write, struct file *filp, | 2928 | int proc_dointvec_userhz_jiffies(struct ctl_table *table, int write, |
| 2893 | void __user *buffer, size_t *lenp, loff_t *ppos) | 2929 | void __user *buffer, size_t *lenp, loff_t *ppos) |
| 2894 | { | 2930 | { |
| 2895 | return -ENOSYS; | 2931 | return -ENOSYS; |
| 2896 | } | 2932 | } |
| 2897 | 2933 | ||
| 2898 | int proc_dointvec_ms_jiffies(struct ctl_table *table, int write, struct file *filp, | 2934 | int proc_dointvec_ms_jiffies(struct ctl_table *table, int write, |
| 2899 | void __user *buffer, size_t *lenp, loff_t *ppos) | 2935 | void __user *buffer, size_t *lenp, loff_t *ppos) |
| 2900 | { | 2936 | { |
| 2901 | return -ENOSYS; | 2937 | return -ENOSYS; |
| 2902 | } | 2938 | } |
| 2903 | 2939 | ||
| 2904 | int proc_doulongvec_minmax(struct ctl_table *table, int write, struct file *filp, | 2940 | int proc_doulongvec_minmax(struct ctl_table *table, int write, |
| 2905 | void __user *buffer, size_t *lenp, loff_t *ppos) | 2941 | void __user *buffer, size_t *lenp, loff_t *ppos) |
| 2906 | { | 2942 | { |
| 2907 | return -ENOSYS; | 2943 | return -ENOSYS; |
| 2908 | } | 2944 | } |
| 2909 | 2945 | ||
| 2910 | int proc_doulongvec_ms_jiffies_minmax(struct ctl_table *table, int write, | 2946 | int proc_doulongvec_ms_jiffies_minmax(struct ctl_table *table, int write, |
| 2911 | struct file *filp, | ||
| 2912 | void __user *buffer, | 2947 | void __user *buffer, |
| 2913 | size_t *lenp, loff_t *ppos) | 2948 | size_t *lenp, loff_t *ppos) |
| 2914 | { | 2949 | { |
diff --git a/kernel/time/Makefile b/kernel/time/Makefile index 0b0a6366c9d4..ee266620b06c 100644 --- a/kernel/time/Makefile +++ b/kernel/time/Makefile | |||
| @@ -1,4 +1,4 @@ | |||
| 1 | obj-y += timekeeping.o ntp.o clocksource.o jiffies.o timer_list.o timecompare.o | 1 | obj-y += timekeeping.o ntp.o clocksource.o jiffies.o timer_list.o timecompare.o timeconv.o |
| 2 | 2 | ||
| 3 | obj-$(CONFIG_GENERIC_CLOCKEVENTS_BUILD) += clockevents.o | 3 | obj-$(CONFIG_GENERIC_CLOCKEVENTS_BUILD) += clockevents.o |
| 4 | obj-$(CONFIG_GENERIC_CLOCKEVENTS) += tick-common.o | 4 | obj-$(CONFIG_GENERIC_CLOCKEVENTS) += tick-common.o |
diff --git a/kernel/time/clocksource.c b/kernel/time/clocksource.c index 09113347d328..5e18c6ab2c6a 100644 --- a/kernel/time/clocksource.c +++ b/kernel/time/clocksource.c | |||
| @@ -394,15 +394,11 @@ void clocksource_resume(void) | |||
| 394 | { | 394 | { |
| 395 | struct clocksource *cs; | 395 | struct clocksource *cs; |
| 396 | 396 | ||
| 397 | mutex_lock(&clocksource_mutex); | ||
| 398 | |||
| 399 | list_for_each_entry(cs, &clocksource_list, list) | 397 | list_for_each_entry(cs, &clocksource_list, list) |
| 400 | if (cs->resume) | 398 | if (cs->resume) |
| 401 | cs->resume(); | 399 | cs->resume(); |
| 402 | 400 | ||
| 403 | clocksource_resume_watchdog(); | 401 | clocksource_resume_watchdog(); |
| 404 | |||
| 405 | mutex_unlock(&clocksource_mutex); | ||
| 406 | } | 402 | } |
| 407 | 403 | ||
| 408 | /** | 404 | /** |
diff --git a/kernel/time/tick-sched.c b/kernel/time/tick-sched.c index e0f59a21c061..89aed5933ed4 100644 --- a/kernel/time/tick-sched.c +++ b/kernel/time/tick-sched.c | |||
| @@ -231,6 +231,13 @@ void tick_nohz_stop_sched_tick(int inidle) | |||
| 231 | if (!inidle && !ts->inidle) | 231 | if (!inidle && !ts->inidle) |
| 232 | goto end; | 232 | goto end; |
| 233 | 233 | ||
| 234 | /* | ||
| 235 | * Set ts->inidle unconditionally. Even if the system did not | ||
| 236 | * switch to NOHZ mode the cpu frequency governers rely on the | ||
| 237 | * update of the idle time accounting in tick_nohz_start_idle(). | ||
| 238 | */ | ||
| 239 | ts->inidle = 1; | ||
| 240 | |||
| 234 | now = tick_nohz_start_idle(ts); | 241 | now = tick_nohz_start_idle(ts); |
| 235 | 242 | ||
| 236 | /* | 243 | /* |
| @@ -248,8 +255,6 @@ void tick_nohz_stop_sched_tick(int inidle) | |||
| 248 | if (unlikely(ts->nohz_mode == NOHZ_MODE_INACTIVE)) | 255 | if (unlikely(ts->nohz_mode == NOHZ_MODE_INACTIVE)) |
| 249 | goto end; | 256 | goto end; |
| 250 | 257 | ||
| 251 | ts->inidle = 1; | ||
| 252 | |||
| 253 | if (need_resched()) | 258 | if (need_resched()) |
| 254 | goto end; | 259 | goto end; |
| 255 | 260 | ||
diff --git a/kernel/time/timeconv.c b/kernel/time/timeconv.c new file mode 100644 index 000000000000..86628e755f38 --- /dev/null +++ b/kernel/time/timeconv.c | |||
| @@ -0,0 +1,127 @@ | |||
| 1 | /* | ||
| 2 | * Copyright (C) 1993, 1994, 1995, 1996, 1997 Free Software Foundation, Inc. | ||
| 3 | * This file is part of the GNU C Library. | ||
| 4 | * Contributed by Paul Eggert (eggert@twinsun.com). | ||
| 5 | * | ||
| 6 | * The GNU C Library is free software; you can redistribute it and/or | ||
| 7 | * modify it under the terms of the GNU Library General Public License as | ||
| 8 | * published by the Free Software Foundation; either version 2 of the | ||
| 9 | * License, or (at your option) any later version. | ||
| 10 | * | ||
| 11 | * The GNU C Library is distributed in the hope that it will be useful, | ||
| 12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | ||
| 13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | ||
| 14 | * Library General Public License for more details. | ||
| 15 | * | ||
| 16 | * You should have received a copy of the GNU Library General Public | ||
| 17 | * License along with the GNU C Library; see the file COPYING.LIB. If not, | ||
| 18 | * write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330, | ||
| 19 | * Boston, MA 02111-1307, USA. | ||
| 20 | */ | ||
| 21 | |||
| 22 | /* | ||
| 23 | * Converts the calendar time to broken-down time representation | ||
| 24 | * Based on code from glibc-2.6 | ||
| 25 | * | ||
| 26 | * 2009-7-14: | ||
| 27 | * Moved from glibc-2.6 to kernel by Zhaolei<zhaolei@cn.fujitsu.com> | ||
| 28 | */ | ||
| 29 | |||
| 30 | #include <linux/time.h> | ||
| 31 | #include <linux/module.h> | ||
| 32 | |||
| 33 | /* | ||
| 34 | * Nonzero if YEAR is a leap year (every 4 years, | ||
| 35 | * except every 100th isn't, and every 400th is). | ||
| 36 | */ | ||
| 37 | static int __isleap(long year) | ||
| 38 | { | ||
| 39 | return (year) % 4 == 0 && ((year) % 100 != 0 || (year) % 400 == 0); | ||
| 40 | } | ||
| 41 | |||
| 42 | /* do a mathdiv for long type */ | ||
| 43 | static long math_div(long a, long b) | ||
| 44 | { | ||
| 45 | return a / b - (a % b < 0); | ||
| 46 | } | ||
| 47 | |||
| 48 | /* How many leap years between y1 and y2, y1 must less or equal to y2 */ | ||
| 49 | static long leaps_between(long y1, long y2) | ||
| 50 | { | ||
| 51 | long leaps1 = math_div(y1 - 1, 4) - math_div(y1 - 1, 100) | ||
| 52 | + math_div(y1 - 1, 400); | ||
| 53 | long leaps2 = math_div(y2 - 1, 4) - math_div(y2 - 1, 100) | ||
| 54 | + math_div(y2 - 1, 400); | ||
| 55 | return leaps2 - leaps1; | ||
| 56 | } | ||
| 57 | |||
| 58 | /* How many days come before each month (0-12). */ | ||
| 59 | static const unsigned short __mon_yday[2][13] = { | ||
| 60 | /* Normal years. */ | ||
| 61 | {0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334, 365}, | ||
| 62 | /* Leap years. */ | ||
| 63 | {0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335, 366} | ||
| 64 | }; | ||
| 65 | |||
| 66 | #define SECS_PER_HOUR (60 * 60) | ||
| 67 | #define SECS_PER_DAY (SECS_PER_HOUR * 24) | ||
| 68 | |||
| 69 | /** | ||
| 70 | * time_to_tm - converts the calendar time to local broken-down time | ||
| 71 | * | ||
| 72 | * @totalsecs the number of seconds elapsed since 00:00:00 on January 1, 1970, | ||
| 73 | * Coordinated Universal Time (UTC). | ||
| 74 | * @offset offset seconds adding to totalsecs. | ||
| 75 | * @result pointer to struct tm variable to receive broken-down time | ||
| 76 | */ | ||
| 77 | void time_to_tm(time_t totalsecs, int offset, struct tm *result) | ||
| 78 | { | ||
| 79 | long days, rem, y; | ||
| 80 | const unsigned short *ip; | ||
| 81 | |||
| 82 | days = totalsecs / SECS_PER_DAY; | ||
| 83 | rem = totalsecs % SECS_PER_DAY; | ||
| 84 | rem += offset; | ||
| 85 | while (rem < 0) { | ||
| 86 | rem += SECS_PER_DAY; | ||
| 87 | --days; | ||
| 88 | } | ||
| 89 | while (rem >= SECS_PER_DAY) { | ||
| 90 | rem -= SECS_PER_DAY; | ||
| 91 | ++days; | ||
| 92 | } | ||
| 93 | |||
| 94 | result->tm_hour = rem / SECS_PER_HOUR; | ||
| 95 | rem %= SECS_PER_HOUR; | ||
| 96 | result->tm_min = rem / 60; | ||
| 97 | result->tm_sec = rem % 60; | ||
| 98 | |||
| 99 | /* January 1, 1970 was a Thursday. */ | ||
| 100 | result->tm_wday = (4 + days) % 7; | ||
| 101 | if (result->tm_wday < 0) | ||
| 102 | result->tm_wday += 7; | ||
| 103 | |||
| 104 | y = 1970; | ||
| 105 | |||
| 106 | while (days < 0 || days >= (__isleap(y) ? 366 : 365)) { | ||
| 107 | /* Guess a corrected year, assuming 365 days per year. */ | ||
| 108 | long yg = y + math_div(days, 365); | ||
| 109 | |||
| 110 | /* Adjust DAYS and Y to match the guessed year. */ | ||
| 111 | days -= (yg - y) * 365 + leaps_between(y, yg); | ||
| 112 | y = yg; | ||
| 113 | } | ||
| 114 | |||
| 115 | result->tm_year = y - 1900; | ||
| 116 | |||
| 117 | result->tm_yday = days; | ||
| 118 | |||
| 119 | ip = __mon_yday[__isleap(y)]; | ||
| 120 | for (y = 11; days < ip[y]; y--) | ||
| 121 | continue; | ||
| 122 | days -= ip[y]; | ||
| 123 | |||
| 124 | result->tm_mon = y; | ||
| 125 | result->tm_mday = days + 1; | ||
| 126 | } | ||
| 127 | EXPORT_SYMBOL(time_to_tm); | ||
diff --git a/kernel/time/timekeeping.c b/kernel/time/timekeeping.c index fb0f46fa1ecd..c3a4e2907eaa 100644 --- a/kernel/time/timekeeping.c +++ b/kernel/time/timekeeping.c | |||
| @@ -13,6 +13,7 @@ | |||
| 13 | #include <linux/percpu.h> | 13 | #include <linux/percpu.h> |
| 14 | #include <linux/init.h> | 14 | #include <linux/init.h> |
| 15 | #include <linux/mm.h> | 15 | #include <linux/mm.h> |
| 16 | #include <linux/sched.h> | ||
| 16 | #include <linux/sysdev.h> | 17 | #include <linux/sysdev.h> |
| 17 | #include <linux/clocksource.h> | 18 | #include <linux/clocksource.h> |
| 18 | #include <linux/jiffies.h> | 19 | #include <linux/jiffies.h> |
diff --git a/kernel/time/timer_list.c b/kernel/time/timer_list.c index fddd69d16e03..1b5b7aa2fdfd 100644 --- a/kernel/time/timer_list.c +++ b/kernel/time/timer_list.c | |||
| @@ -275,7 +275,7 @@ static int timer_list_open(struct inode *inode, struct file *filp) | |||
| 275 | return single_open(filp, timer_list_show, NULL); | 275 | return single_open(filp, timer_list_show, NULL); |
| 276 | } | 276 | } |
| 277 | 277 | ||
| 278 | static struct file_operations timer_list_fops = { | 278 | static const struct file_operations timer_list_fops = { |
| 279 | .open = timer_list_open, | 279 | .open = timer_list_open, |
| 280 | .read = seq_read, | 280 | .read = seq_read, |
| 281 | .llseek = seq_lseek, | 281 | .llseek = seq_lseek, |
diff --git a/kernel/time/timer_stats.c b/kernel/time/timer_stats.c index 4cde8b9c716f..ee5681f8d7ec 100644 --- a/kernel/time/timer_stats.c +++ b/kernel/time/timer_stats.c | |||
| @@ -395,7 +395,7 @@ static int tstats_open(struct inode *inode, struct file *filp) | |||
| 395 | return single_open(filp, tstats_show, NULL); | 395 | return single_open(filp, tstats_show, NULL); |
| 396 | } | 396 | } |
| 397 | 397 | ||
| 398 | static struct file_operations tstats_fops = { | 398 | static const struct file_operations tstats_fops = { |
| 399 | .open = tstats_open, | 399 | .open = tstats_open, |
| 400 | .read = seq_read, | 400 | .read = seq_read, |
| 401 | .write = tstats_write, | 401 | .write = tstats_write, |
diff --git a/kernel/timer.c b/kernel/timer.c index 811e5c391456..5db5a8d26811 100644 --- a/kernel/timer.c +++ b/kernel/timer.c | |||
| @@ -46,6 +46,9 @@ | |||
| 46 | #include <asm/timex.h> | 46 | #include <asm/timex.h> |
| 47 | #include <asm/io.h> | 47 | #include <asm/io.h> |
| 48 | 48 | ||
| 49 | #define CREATE_TRACE_POINTS | ||
| 50 | #include <trace/events/timer.h> | ||
| 51 | |||
| 49 | u64 jiffies_64 __cacheline_aligned_in_smp = INITIAL_JIFFIES; | 52 | u64 jiffies_64 __cacheline_aligned_in_smp = INITIAL_JIFFIES; |
| 50 | 53 | ||
| 51 | EXPORT_SYMBOL(jiffies_64); | 54 | EXPORT_SYMBOL(jiffies_64); |
| @@ -521,6 +524,25 @@ static inline void debug_timer_activate(struct timer_list *timer) { } | |||
| 521 | static inline void debug_timer_deactivate(struct timer_list *timer) { } | 524 | static inline void debug_timer_deactivate(struct timer_list *timer) { } |
| 522 | #endif | 525 | #endif |
| 523 | 526 | ||
| 527 | static inline void debug_init(struct timer_list *timer) | ||
| 528 | { | ||
| 529 | debug_timer_init(timer); | ||
| 530 | trace_timer_init(timer); | ||
| 531 | } | ||
| 532 | |||
| 533 | static inline void | ||
| 534 | debug_activate(struct timer_list *timer, unsigned long expires) | ||
| 535 | { | ||
| 536 | debug_timer_activate(timer); | ||
| 537 | trace_timer_start(timer, expires); | ||
| 538 | } | ||
| 539 | |||
| 540 | static inline void debug_deactivate(struct timer_list *timer) | ||
| 541 | { | ||
| 542 | debug_timer_deactivate(timer); | ||
| 543 | trace_timer_cancel(timer); | ||
| 544 | } | ||
| 545 | |||
| 524 | static void __init_timer(struct timer_list *timer, | 546 | static void __init_timer(struct timer_list *timer, |
| 525 | const char *name, | 547 | const char *name, |
| 526 | struct lock_class_key *key) | 548 | struct lock_class_key *key) |
| @@ -549,7 +571,7 @@ void init_timer_key(struct timer_list *timer, | |||
| 549 | const char *name, | 571 | const char *name, |
| 550 | struct lock_class_key *key) | 572 | struct lock_class_key *key) |
| 551 | { | 573 | { |
| 552 | debug_timer_init(timer); | 574 | debug_init(timer); |
| 553 | __init_timer(timer, name, key); | 575 | __init_timer(timer, name, key); |
| 554 | } | 576 | } |
| 555 | EXPORT_SYMBOL(init_timer_key); | 577 | EXPORT_SYMBOL(init_timer_key); |
| @@ -568,7 +590,7 @@ static inline void detach_timer(struct timer_list *timer, | |||
| 568 | { | 590 | { |
| 569 | struct list_head *entry = &timer->entry; | 591 | struct list_head *entry = &timer->entry; |
| 570 | 592 | ||
| 571 | debug_timer_deactivate(timer); | 593 | debug_deactivate(timer); |
| 572 | 594 | ||
| 573 | __list_del(entry->prev, entry->next); | 595 | __list_del(entry->prev, entry->next); |
| 574 | if (clear_pending) | 596 | if (clear_pending) |
| @@ -632,7 +654,7 @@ __mod_timer(struct timer_list *timer, unsigned long expires, | |||
| 632 | goto out_unlock; | 654 | goto out_unlock; |
| 633 | } | 655 | } |
| 634 | 656 | ||
| 635 | debug_timer_activate(timer); | 657 | debug_activate(timer, expires); |
| 636 | 658 | ||
| 637 | new_base = __get_cpu_var(tvec_bases); | 659 | new_base = __get_cpu_var(tvec_bases); |
| 638 | 660 | ||
| @@ -787,7 +809,7 @@ void add_timer_on(struct timer_list *timer, int cpu) | |||
| 787 | BUG_ON(timer_pending(timer) || !timer->function); | 809 | BUG_ON(timer_pending(timer) || !timer->function); |
| 788 | spin_lock_irqsave(&base->lock, flags); | 810 | spin_lock_irqsave(&base->lock, flags); |
| 789 | timer_set_base(timer, base); | 811 | timer_set_base(timer, base); |
| 790 | debug_timer_activate(timer); | 812 | debug_activate(timer, timer->expires); |
| 791 | if (time_before(timer->expires, base->next_timer) && | 813 | if (time_before(timer->expires, base->next_timer) && |
| 792 | !tbase_get_deferrable(timer->base)) | 814 | !tbase_get_deferrable(timer->base)) |
| 793 | base->next_timer = timer->expires; | 815 | base->next_timer = timer->expires; |
| @@ -1000,7 +1022,9 @@ static inline void __run_timers(struct tvec_base *base) | |||
| 1000 | */ | 1022 | */ |
| 1001 | lock_map_acquire(&lockdep_map); | 1023 | lock_map_acquire(&lockdep_map); |
| 1002 | 1024 | ||
| 1025 | trace_timer_expire_entry(timer); | ||
| 1003 | fn(data); | 1026 | fn(data); |
| 1027 | trace_timer_expire_exit(timer); | ||
| 1004 | 1028 | ||
| 1005 | lock_map_release(&lockdep_map); | 1029 | lock_map_release(&lockdep_map); |
| 1006 | 1030 | ||
diff --git a/kernel/trace/blktrace.c b/kernel/trace/blktrace.c index 3eb159c277c8..d9d6206e0b14 100644 --- a/kernel/trace/blktrace.c +++ b/kernel/trace/blktrace.c | |||
| @@ -856,6 +856,37 @@ static void blk_add_trace_remap(struct request_queue *q, struct bio *bio, | |||
| 856 | } | 856 | } |
| 857 | 857 | ||
| 858 | /** | 858 | /** |
| 859 | * blk_add_trace_rq_remap - Add a trace for a request-remap operation | ||
| 860 | * @q: queue the io is for | ||
| 861 | * @rq: the source request | ||
| 862 | * @dev: target device | ||
| 863 | * @from: source sector | ||
| 864 | * | ||
| 865 | * Description: | ||
| 866 | * Device mapper remaps request to other devices. | ||
| 867 | * Add a trace for that action. | ||
| 868 | * | ||
| 869 | **/ | ||
| 870 | static void blk_add_trace_rq_remap(struct request_queue *q, | ||
| 871 | struct request *rq, dev_t dev, | ||
| 872 | sector_t from) | ||
| 873 | { | ||
| 874 | struct blk_trace *bt = q->blk_trace; | ||
| 875 | struct blk_io_trace_remap r; | ||
| 876 | |||
| 877 | if (likely(!bt)) | ||
| 878 | return; | ||
| 879 | |||
| 880 | r.device_from = cpu_to_be32(dev); | ||
| 881 | r.device_to = cpu_to_be32(disk_devt(rq->rq_disk)); | ||
| 882 | r.sector_from = cpu_to_be64(from); | ||
| 883 | |||
| 884 | __blk_add_trace(bt, blk_rq_pos(rq), blk_rq_bytes(rq), | ||
| 885 | rq_data_dir(rq), BLK_TA_REMAP, !!rq->errors, | ||
| 886 | sizeof(r), &r); | ||
| 887 | } | ||
| 888 | |||
| 889 | /** | ||
| 859 | * blk_add_driver_data - Add binary message with driver-specific data | 890 | * blk_add_driver_data - Add binary message with driver-specific data |
| 860 | * @q: queue the io is for | 891 | * @q: queue the io is for |
| 861 | * @rq: io request | 892 | * @rq: io request |
| @@ -922,10 +953,13 @@ static void blk_register_tracepoints(void) | |||
| 922 | WARN_ON(ret); | 953 | WARN_ON(ret); |
| 923 | ret = register_trace_block_remap(blk_add_trace_remap); | 954 | ret = register_trace_block_remap(blk_add_trace_remap); |
| 924 | WARN_ON(ret); | 955 | WARN_ON(ret); |
| 956 | ret = register_trace_block_rq_remap(blk_add_trace_rq_remap); | ||
| 957 | WARN_ON(ret); | ||
| 925 | } | 958 | } |
| 926 | 959 | ||
| 927 | static void blk_unregister_tracepoints(void) | 960 | static void blk_unregister_tracepoints(void) |
| 928 | { | 961 | { |
| 962 | unregister_trace_block_rq_remap(blk_add_trace_rq_remap); | ||
| 929 | unregister_trace_block_remap(blk_add_trace_remap); | 963 | unregister_trace_block_remap(blk_add_trace_remap); |
| 930 | unregister_trace_block_split(blk_add_trace_split); | 964 | unregister_trace_block_split(blk_add_trace_split); |
| 931 | unregister_trace_block_unplug_io(blk_add_trace_unplug_io); | 965 | unregister_trace_block_unplug_io(blk_add_trace_unplug_io); |
| @@ -1657,6 +1691,11 @@ int blk_trace_init_sysfs(struct device *dev) | |||
| 1657 | return sysfs_create_group(&dev->kobj, &blk_trace_attr_group); | 1691 | return sysfs_create_group(&dev->kobj, &blk_trace_attr_group); |
| 1658 | } | 1692 | } |
| 1659 | 1693 | ||
| 1694 | void blk_trace_remove_sysfs(struct device *dev) | ||
| 1695 | { | ||
| 1696 | sysfs_remove_group(&dev->kobj, &blk_trace_attr_group); | ||
| 1697 | } | ||
| 1698 | |||
| 1660 | #endif /* CONFIG_BLK_DEV_IO_TRACE */ | 1699 | #endif /* CONFIG_BLK_DEV_IO_TRACE */ |
| 1661 | 1700 | ||
| 1662 | #ifdef CONFIG_EVENT_TRACING | 1701 | #ifdef CONFIG_EVENT_TRACING |
diff --git a/kernel/trace/ftrace.c b/kernel/trace/ftrace.c index c71e91bf7372..37ba67e33265 100644 --- a/kernel/trace/ftrace.c +++ b/kernel/trace/ftrace.c | |||
| @@ -225,7 +225,11 @@ static void ftrace_update_pid_func(void) | |||
| 225 | if (ftrace_trace_function == ftrace_stub) | 225 | if (ftrace_trace_function == ftrace_stub) |
| 226 | return; | 226 | return; |
| 227 | 227 | ||
| 228 | #ifdef CONFIG_HAVE_FUNCTION_TRACE_MCOUNT_TEST | ||
| 228 | func = ftrace_trace_function; | 229 | func = ftrace_trace_function; |
| 230 | #else | ||
| 231 | func = __ftrace_trace_function; | ||
| 232 | #endif | ||
| 229 | 233 | ||
| 230 | if (ftrace_pid_trace) { | 234 | if (ftrace_pid_trace) { |
| 231 | set_ftrace_pid_function(func); | 235 | set_ftrace_pid_function(func); |
| @@ -1074,14 +1078,9 @@ static void ftrace_replace_code(int enable) | |||
| 1074 | failed = __ftrace_replace_code(rec, enable); | 1078 | failed = __ftrace_replace_code(rec, enable); |
| 1075 | if (failed) { | 1079 | if (failed) { |
| 1076 | rec->flags |= FTRACE_FL_FAILED; | 1080 | rec->flags |= FTRACE_FL_FAILED; |
| 1077 | if ((system_state == SYSTEM_BOOTING) || | 1081 | ftrace_bug(failed, rec->ip); |
| 1078 | !core_kernel_text(rec->ip)) { | 1082 | /* Stop processing */ |
| 1079 | ftrace_free_rec(rec); | 1083 | return; |
| 1080 | } else { | ||
| 1081 | ftrace_bug(failed, rec->ip); | ||
| 1082 | /* Stop processing */ | ||
| 1083 | return; | ||
| 1084 | } | ||
| 1085 | } | 1084 | } |
| 1086 | } while_for_each_ftrace_rec(); | 1085 | } while_for_each_ftrace_rec(); |
| 1087 | } | 1086 | } |
| @@ -1520,7 +1519,7 @@ static int t_show(struct seq_file *m, void *v) | |||
| 1520 | return 0; | 1519 | return 0; |
| 1521 | } | 1520 | } |
| 1522 | 1521 | ||
| 1523 | static struct seq_operations show_ftrace_seq_ops = { | 1522 | static const struct seq_operations show_ftrace_seq_ops = { |
| 1524 | .start = t_start, | 1523 | .start = t_start, |
| 1525 | .next = t_next, | 1524 | .next = t_next, |
| 1526 | .stop = t_stop, | 1525 | .stop = t_stop, |
| @@ -1621,8 +1620,10 @@ ftrace_regex_open(struct inode *inode, struct file *file, int enable) | |||
| 1621 | if (!ret) { | 1620 | if (!ret) { |
| 1622 | struct seq_file *m = file->private_data; | 1621 | struct seq_file *m = file->private_data; |
| 1623 | m->private = iter; | 1622 | m->private = iter; |
| 1624 | } else | 1623 | } else { |
| 1624 | trace_parser_put(&iter->parser); | ||
| 1625 | kfree(iter); | 1625 | kfree(iter); |
| 1626 | } | ||
| 1626 | } else | 1627 | } else |
| 1627 | file->private_data = iter; | 1628 | file->private_data = iter; |
| 1628 | mutex_unlock(&ftrace_regex_lock); | 1629 | mutex_unlock(&ftrace_regex_lock); |
| @@ -2202,7 +2203,7 @@ ftrace_regex_write(struct file *file, const char __user *ubuf, | |||
| 2202 | struct trace_parser *parser; | 2203 | struct trace_parser *parser; |
| 2203 | ssize_t ret, read; | 2204 | ssize_t ret, read; |
| 2204 | 2205 | ||
| 2205 | if (!cnt || cnt < 0) | 2206 | if (!cnt) |
| 2206 | return 0; | 2207 | return 0; |
| 2207 | 2208 | ||
| 2208 | mutex_lock(&ftrace_regex_lock); | 2209 | mutex_lock(&ftrace_regex_lock); |
| @@ -2216,7 +2217,7 @@ ftrace_regex_write(struct file *file, const char __user *ubuf, | |||
| 2216 | parser = &iter->parser; | 2217 | parser = &iter->parser; |
| 2217 | read = trace_get_user(parser, ubuf, cnt, ppos); | 2218 | read = trace_get_user(parser, ubuf, cnt, ppos); |
| 2218 | 2219 | ||
| 2219 | if (trace_parser_loaded(parser) && | 2220 | if (read >= 0 && trace_parser_loaded(parser) && |
| 2220 | !trace_parser_cont(parser)) { | 2221 | !trace_parser_cont(parser)) { |
| 2221 | ret = ftrace_process_regex(parser->buffer, | 2222 | ret = ftrace_process_regex(parser->buffer, |
| 2222 | parser->idx, enable); | 2223 | parser->idx, enable); |
| @@ -2459,7 +2460,7 @@ static int g_show(struct seq_file *m, void *v) | |||
| 2459 | return 0; | 2460 | return 0; |
| 2460 | } | 2461 | } |
| 2461 | 2462 | ||
| 2462 | static struct seq_operations ftrace_graph_seq_ops = { | 2463 | static const struct seq_operations ftrace_graph_seq_ops = { |
| 2463 | .start = g_start, | 2464 | .start = g_start, |
| 2464 | .next = g_next, | 2465 | .next = g_next, |
| 2465 | .stop = g_stop, | 2466 | .stop = g_stop, |
| @@ -2552,8 +2553,7 @@ ftrace_graph_write(struct file *file, const char __user *ubuf, | |||
| 2552 | size_t cnt, loff_t *ppos) | 2553 | size_t cnt, loff_t *ppos) |
| 2553 | { | 2554 | { |
| 2554 | struct trace_parser parser; | 2555 | struct trace_parser parser; |
| 2555 | size_t read = 0; | 2556 | ssize_t read, ret; |
| 2556 | ssize_t ret; | ||
| 2557 | 2557 | ||
| 2558 | if (!cnt || cnt < 0) | 2558 | if (!cnt || cnt < 0) |
| 2559 | return 0; | 2559 | return 0; |
| @@ -2562,29 +2562,31 @@ ftrace_graph_write(struct file *file, const char __user *ubuf, | |||
| 2562 | 2562 | ||
| 2563 | if (ftrace_graph_count >= FTRACE_GRAPH_MAX_FUNCS) { | 2563 | if (ftrace_graph_count >= FTRACE_GRAPH_MAX_FUNCS) { |
| 2564 | ret = -EBUSY; | 2564 | ret = -EBUSY; |
| 2565 | goto out; | 2565 | goto out_unlock; |
| 2566 | } | 2566 | } |
| 2567 | 2567 | ||
| 2568 | if (trace_parser_get_init(&parser, FTRACE_BUFF_MAX)) { | 2568 | if (trace_parser_get_init(&parser, FTRACE_BUFF_MAX)) { |
| 2569 | ret = -ENOMEM; | 2569 | ret = -ENOMEM; |
| 2570 | goto out; | 2570 | goto out_unlock; |
| 2571 | } | 2571 | } |
| 2572 | 2572 | ||
| 2573 | read = trace_get_user(&parser, ubuf, cnt, ppos); | 2573 | read = trace_get_user(&parser, ubuf, cnt, ppos); |
| 2574 | 2574 | ||
| 2575 | if (trace_parser_loaded((&parser))) { | 2575 | if (read >= 0 && trace_parser_loaded((&parser))) { |
| 2576 | parser.buffer[parser.idx] = 0; | 2576 | parser.buffer[parser.idx] = 0; |
| 2577 | 2577 | ||
| 2578 | /* we allow only one expression at a time */ | 2578 | /* we allow only one expression at a time */ |
| 2579 | ret = ftrace_set_func(ftrace_graph_funcs, &ftrace_graph_count, | 2579 | ret = ftrace_set_func(ftrace_graph_funcs, &ftrace_graph_count, |
| 2580 | parser.buffer); | 2580 | parser.buffer); |
| 2581 | if (ret) | 2581 | if (ret) |
| 2582 | goto out; | 2582 | goto out_free; |
| 2583 | } | 2583 | } |
| 2584 | 2584 | ||
| 2585 | ret = read; | 2585 | ret = read; |
| 2586 | out: | 2586 | |
| 2587 | out_free: | ||
| 2587 | trace_parser_put(&parser); | 2588 | trace_parser_put(&parser); |
| 2589 | out_unlock: | ||
| 2588 | mutex_unlock(&graph_lock); | 2590 | mutex_unlock(&graph_lock); |
| 2589 | 2591 | ||
| 2590 | return ret; | 2592 | return ret; |
| @@ -2655,19 +2657,17 @@ static int ftrace_convert_nops(struct module *mod, | |||
| 2655 | } | 2657 | } |
| 2656 | 2658 | ||
| 2657 | #ifdef CONFIG_MODULES | 2659 | #ifdef CONFIG_MODULES |
| 2658 | void ftrace_release(void *start, void *end) | 2660 | void ftrace_release_mod(struct module *mod) |
| 2659 | { | 2661 | { |
| 2660 | struct dyn_ftrace *rec; | 2662 | struct dyn_ftrace *rec; |
| 2661 | struct ftrace_page *pg; | 2663 | struct ftrace_page *pg; |
| 2662 | unsigned long s = (unsigned long)start; | ||
| 2663 | unsigned long e = (unsigned long)end; | ||
| 2664 | 2664 | ||
| 2665 | if (ftrace_disabled || !start || start == end) | 2665 | if (ftrace_disabled) |
| 2666 | return; | 2666 | return; |
| 2667 | 2667 | ||
| 2668 | mutex_lock(&ftrace_lock); | 2668 | mutex_lock(&ftrace_lock); |
| 2669 | do_for_each_ftrace_rec(pg, rec) { | 2669 | do_for_each_ftrace_rec(pg, rec) { |
| 2670 | if ((rec->ip >= s) && (rec->ip < e)) { | 2670 | if (within_module_core(rec->ip, mod)) { |
| 2671 | /* | 2671 | /* |
| 2672 | * rec->ip is changed in ftrace_free_rec() | 2672 | * rec->ip is changed in ftrace_free_rec() |
| 2673 | * It should not between s and e if record was freed. | 2673 | * It should not between s and e if record was freed. |
| @@ -2699,9 +2699,7 @@ static int ftrace_module_notify(struct notifier_block *self, | |||
| 2699 | mod->num_ftrace_callsites); | 2699 | mod->num_ftrace_callsites); |
| 2700 | break; | 2700 | break; |
| 2701 | case MODULE_STATE_GOING: | 2701 | case MODULE_STATE_GOING: |
| 2702 | ftrace_release(mod->ftrace_callsites, | 2702 | ftrace_release_mod(mod); |
| 2703 | mod->ftrace_callsites + | ||
| 2704 | mod->num_ftrace_callsites); | ||
| 2705 | break; | 2703 | break; |
| 2706 | } | 2704 | } |
| 2707 | 2705 | ||
| @@ -3015,7 +3013,7 @@ int unregister_ftrace_function(struct ftrace_ops *ops) | |||
| 3015 | 3013 | ||
| 3016 | int | 3014 | int |
| 3017 | ftrace_enable_sysctl(struct ctl_table *table, int write, | 3015 | ftrace_enable_sysctl(struct ctl_table *table, int write, |
| 3018 | struct file *file, void __user *buffer, size_t *lenp, | 3016 | void __user *buffer, size_t *lenp, |
| 3019 | loff_t *ppos) | 3017 | loff_t *ppos) |
| 3020 | { | 3018 | { |
| 3021 | int ret; | 3019 | int ret; |
| @@ -3025,7 +3023,7 @@ ftrace_enable_sysctl(struct ctl_table *table, int write, | |||
| 3025 | 3023 | ||
| 3026 | mutex_lock(&ftrace_lock); | 3024 | mutex_lock(&ftrace_lock); |
| 3027 | 3025 | ||
| 3028 | ret = proc_dointvec(table, write, file, buffer, lenp, ppos); | 3026 | ret = proc_dointvec(table, write, buffer, lenp, ppos); |
| 3029 | 3027 | ||
| 3030 | if (ret || !write || (last_ftrace_enabled == !!ftrace_enabled)) | 3028 | if (ret || !write || (last_ftrace_enabled == !!ftrace_enabled)) |
| 3031 | goto out; | 3029 | goto out; |
diff --git a/kernel/trace/kmemtrace.c b/kernel/trace/kmemtrace.c index 81b1645c8549..a91da69f153a 100644 --- a/kernel/trace/kmemtrace.c +++ b/kernel/trace/kmemtrace.c | |||
| @@ -501,7 +501,7 @@ static int __init init_kmem_tracer(void) | |||
| 501 | return 1; | 501 | return 1; |
| 502 | } | 502 | } |
| 503 | 503 | ||
| 504 | if (!register_tracer(&kmem_tracer)) { | 504 | if (register_tracer(&kmem_tracer) != 0) { |
| 505 | pr_warning("Warning: could not register the kmem tracer\n"); | 505 | pr_warning("Warning: could not register the kmem tracer\n"); |
| 506 | return 1; | 506 | return 1; |
| 507 | } | 507 | } |
diff --git a/kernel/trace/trace.c b/kernel/trace/trace.c index a35925d222ba..45068269ebb1 100644 --- a/kernel/trace/trace.c +++ b/kernel/trace/trace.c | |||
| @@ -415,7 +415,7 @@ int trace_get_user(struct trace_parser *parser, const char __user *ubuf, | |||
| 415 | 415 | ||
| 416 | /* read the non-space input */ | 416 | /* read the non-space input */ |
| 417 | while (cnt && !isspace(ch)) { | 417 | while (cnt && !isspace(ch)) { |
| 418 | if (parser->idx < parser->size) | 418 | if (parser->idx < parser->size - 1) |
| 419 | parser->buffer[parser->idx++] = ch; | 419 | parser->buffer[parser->idx++] = ch; |
| 420 | else { | 420 | else { |
| 421 | ret = -EINVAL; | 421 | ret = -EINVAL; |
| @@ -1949,7 +1949,7 @@ static int s_show(struct seq_file *m, void *v) | |||
| 1949 | return 0; | 1949 | return 0; |
| 1950 | } | 1950 | } |
| 1951 | 1951 | ||
| 1952 | static struct seq_operations tracer_seq_ops = { | 1952 | static const struct seq_operations tracer_seq_ops = { |
| 1953 | .start = s_start, | 1953 | .start = s_start, |
| 1954 | .next = s_next, | 1954 | .next = s_next, |
| 1955 | .stop = s_stop, | 1955 | .stop = s_stop, |
| @@ -1984,11 +1984,9 @@ __tracing_open(struct inode *inode, struct file *file) | |||
| 1984 | if (current_trace) | 1984 | if (current_trace) |
| 1985 | *iter->trace = *current_trace; | 1985 | *iter->trace = *current_trace; |
| 1986 | 1986 | ||
| 1987 | if (!alloc_cpumask_var(&iter->started, GFP_KERNEL)) | 1987 | if (!zalloc_cpumask_var(&iter->started, GFP_KERNEL)) |
| 1988 | goto fail; | 1988 | goto fail; |
| 1989 | 1989 | ||
| 1990 | cpumask_clear(iter->started); | ||
| 1991 | |||
| 1992 | if (current_trace && current_trace->print_max) | 1990 | if (current_trace && current_trace->print_max) |
| 1993 | iter->tr = &max_tr; | 1991 | iter->tr = &max_tr; |
| 1994 | else | 1992 | else |
| @@ -2163,7 +2161,7 @@ static int t_show(struct seq_file *m, void *v) | |||
| 2163 | return 0; | 2161 | return 0; |
| 2164 | } | 2162 | } |
| 2165 | 2163 | ||
| 2166 | static struct seq_operations show_traces_seq_ops = { | 2164 | static const struct seq_operations show_traces_seq_ops = { |
| 2167 | .start = t_start, | 2165 | .start = t_start, |
| 2168 | .next = t_next, | 2166 | .next = t_next, |
| 2169 | .stop = t_stop, | 2167 | .stop = t_stop, |
| @@ -4389,7 +4387,7 @@ __init static int tracer_alloc_buffers(void) | |||
| 4389 | if (!alloc_cpumask_var(&tracing_cpumask, GFP_KERNEL)) | 4387 | if (!alloc_cpumask_var(&tracing_cpumask, GFP_KERNEL)) |
| 4390 | goto out_free_buffer_mask; | 4388 | goto out_free_buffer_mask; |
| 4391 | 4389 | ||
| 4392 | if (!alloc_cpumask_var(&tracing_reader_cpumask, GFP_KERNEL)) | 4390 | if (!zalloc_cpumask_var(&tracing_reader_cpumask, GFP_KERNEL)) |
| 4393 | goto out_free_tracing_cpumask; | 4391 | goto out_free_tracing_cpumask; |
| 4394 | 4392 | ||
| 4395 | /* To save memory, keep the ring buffer size to its minimum */ | 4393 | /* To save memory, keep the ring buffer size to its minimum */ |
| @@ -4400,7 +4398,6 @@ __init static int tracer_alloc_buffers(void) | |||
| 4400 | 4398 | ||
| 4401 | cpumask_copy(tracing_buffer_mask, cpu_possible_mask); | 4399 | cpumask_copy(tracing_buffer_mask, cpu_possible_mask); |
| 4402 | cpumask_copy(tracing_cpumask, cpu_all_mask); | 4400 | cpumask_copy(tracing_cpumask, cpu_all_mask); |
| 4403 | cpumask_clear(tracing_reader_cpumask); | ||
| 4404 | 4401 | ||
| 4405 | /* TODO: make the number of buffers hot pluggable with CPUS */ | 4402 | /* TODO: make the number of buffers hot pluggable with CPUS */ |
| 4406 | global_trace.buffer = ring_buffer_alloc(ring_buf_size, | 4403 | global_trace.buffer = ring_buffer_alloc(ring_buf_size, |
diff --git a/kernel/trace/trace_branch.c b/kernel/trace/trace_branch.c index 7a7a9fd249a9..4a194f08f88c 100644 --- a/kernel/trace/trace_branch.c +++ b/kernel/trace/trace_branch.c | |||
| @@ -34,6 +34,7 @@ probe_likely_condition(struct ftrace_branch_data *f, int val, int expect) | |||
| 34 | struct trace_array *tr = branch_tracer; | 34 | struct trace_array *tr = branch_tracer; |
| 35 | struct ring_buffer_event *event; | 35 | struct ring_buffer_event *event; |
| 36 | struct trace_branch *entry; | 36 | struct trace_branch *entry; |
| 37 | struct ring_buffer *buffer; | ||
| 37 | unsigned long flags; | 38 | unsigned long flags; |
| 38 | int cpu, pc; | 39 | int cpu, pc; |
| 39 | const char *p; | 40 | const char *p; |
| @@ -54,7 +55,8 @@ probe_likely_condition(struct ftrace_branch_data *f, int val, int expect) | |||
| 54 | goto out; | 55 | goto out; |
| 55 | 56 | ||
| 56 | pc = preempt_count(); | 57 | pc = preempt_count(); |
| 57 | event = trace_buffer_lock_reserve(tr, TRACE_BRANCH, | 58 | buffer = tr->buffer; |
| 59 | event = trace_buffer_lock_reserve(buffer, TRACE_BRANCH, | ||
| 58 | sizeof(*entry), flags, pc); | 60 | sizeof(*entry), flags, pc); |
| 59 | if (!event) | 61 | if (!event) |
| 60 | goto out; | 62 | goto out; |
| @@ -74,8 +76,8 @@ probe_likely_condition(struct ftrace_branch_data *f, int val, int expect) | |||
| 74 | entry->line = f->line; | 76 | entry->line = f->line; |
| 75 | entry->correct = val == expect; | 77 | entry->correct = val == expect; |
| 76 | 78 | ||
| 77 | if (!filter_check_discard(call, entry, tr->buffer, event)) | 79 | if (!filter_check_discard(call, entry, buffer, event)) |
| 78 | ring_buffer_unlock_commit(tr->buffer, event); | 80 | ring_buffer_unlock_commit(buffer, event); |
| 79 | 81 | ||
| 80 | out: | 82 | out: |
| 81 | atomic_dec(&tr->data[cpu]->disabled); | 83 | atomic_dec(&tr->data[cpu]->disabled); |
diff --git a/kernel/trace/trace_event_profile.c b/kernel/trace/trace_event_profile.c index dd44b8768867..8d5c171cc998 100644 --- a/kernel/trace/trace_event_profile.c +++ b/kernel/trace/trace_event_profile.c | |||
| @@ -31,7 +31,7 @@ static int ftrace_profile_enable_event(struct ftrace_event_call *event) | |||
| 31 | if (atomic_inc_return(&event->profile_count)) | 31 | if (atomic_inc_return(&event->profile_count)) |
| 32 | return 0; | 32 | return 0; |
| 33 | 33 | ||
| 34 | if (!total_profile_count++) { | 34 | if (!total_profile_count) { |
| 35 | buf = (char *)alloc_percpu(profile_buf_t); | 35 | buf = (char *)alloc_percpu(profile_buf_t); |
| 36 | if (!buf) | 36 | if (!buf) |
| 37 | goto fail_buf; | 37 | goto fail_buf; |
| @@ -46,14 +46,19 @@ static int ftrace_profile_enable_event(struct ftrace_event_call *event) | |||
| 46 | } | 46 | } |
| 47 | 47 | ||
| 48 | ret = event->profile_enable(); | 48 | ret = event->profile_enable(); |
| 49 | if (!ret) | 49 | if (!ret) { |
| 50 | total_profile_count++; | ||
| 50 | return 0; | 51 | return 0; |
| 52 | } | ||
| 51 | 53 | ||
| 52 | kfree(trace_profile_buf_nmi); | ||
| 53 | fail_buf_nmi: | 54 | fail_buf_nmi: |
| 54 | kfree(trace_profile_buf); | 55 | if (!total_profile_count) { |
| 56 | free_percpu(trace_profile_buf_nmi); | ||
| 57 | free_percpu(trace_profile_buf); | ||
| 58 | trace_profile_buf_nmi = NULL; | ||
| 59 | trace_profile_buf = NULL; | ||
| 60 | } | ||
| 55 | fail_buf: | 61 | fail_buf: |
| 56 | total_profile_count--; | ||
| 57 | atomic_dec(&event->profile_count); | 62 | atomic_dec(&event->profile_count); |
| 58 | 63 | ||
| 59 | return ret; | 64 | return ret; |
diff --git a/kernel/trace/trace_events.c b/kernel/trace/trace_events.c index 6f03c8a1105e..d128f65778e6 100644 --- a/kernel/trace/trace_events.c +++ b/kernel/trace/trace_events.c | |||
| @@ -232,10 +232,9 @@ ftrace_event_write(struct file *file, const char __user *ubuf, | |||
| 232 | size_t cnt, loff_t *ppos) | 232 | size_t cnt, loff_t *ppos) |
| 233 | { | 233 | { |
| 234 | struct trace_parser parser; | 234 | struct trace_parser parser; |
| 235 | size_t read = 0; | 235 | ssize_t read, ret; |
| 236 | ssize_t ret; | ||
| 237 | 236 | ||
| 238 | if (!cnt || cnt < 0) | 237 | if (!cnt) |
| 239 | return 0; | 238 | return 0; |
| 240 | 239 | ||
| 241 | ret = tracing_update_buffers(); | 240 | ret = tracing_update_buffers(); |
| @@ -247,7 +246,7 @@ ftrace_event_write(struct file *file, const char __user *ubuf, | |||
| 247 | 246 | ||
| 248 | read = trace_get_user(&parser, ubuf, cnt, ppos); | 247 | read = trace_get_user(&parser, ubuf, cnt, ppos); |
| 249 | 248 | ||
| 250 | if (trace_parser_loaded((&parser))) { | 249 | if (read >= 0 && trace_parser_loaded((&parser))) { |
| 251 | int set = 1; | 250 | int set = 1; |
| 252 | 251 | ||
| 253 | if (*parser.buffer == '!') | 252 | if (*parser.buffer == '!') |
diff --git a/kernel/trace/trace_hw_branches.c b/kernel/trace/trace_hw_branches.c index 23b63859130e..69543a905cd5 100644 --- a/kernel/trace/trace_hw_branches.c +++ b/kernel/trace/trace_hw_branches.c | |||
| @@ -165,6 +165,7 @@ void trace_hw_branch(u64 from, u64 to) | |||
| 165 | struct ftrace_event_call *call = &event_hw_branch; | 165 | struct ftrace_event_call *call = &event_hw_branch; |
| 166 | struct trace_array *tr = hw_branch_trace; | 166 | struct trace_array *tr = hw_branch_trace; |
| 167 | struct ring_buffer_event *event; | 167 | struct ring_buffer_event *event; |
| 168 | struct ring_buffer *buf; | ||
| 168 | struct hw_branch_entry *entry; | 169 | struct hw_branch_entry *entry; |
| 169 | unsigned long irq1; | 170 | unsigned long irq1; |
| 170 | int cpu; | 171 | int cpu; |
| @@ -180,7 +181,8 @@ void trace_hw_branch(u64 from, u64 to) | |||
| 180 | if (atomic_inc_return(&tr->data[cpu]->disabled) != 1) | 181 | if (atomic_inc_return(&tr->data[cpu]->disabled) != 1) |
| 181 | goto out; | 182 | goto out; |
| 182 | 183 | ||
| 183 | event = trace_buffer_lock_reserve(tr, TRACE_HW_BRANCHES, | 184 | buf = tr->buffer; |
| 185 | event = trace_buffer_lock_reserve(buf, TRACE_HW_BRANCHES, | ||
| 184 | sizeof(*entry), 0, 0); | 186 | sizeof(*entry), 0, 0); |
| 185 | if (!event) | 187 | if (!event) |
| 186 | goto out; | 188 | goto out; |
| @@ -189,8 +191,8 @@ void trace_hw_branch(u64 from, u64 to) | |||
| 189 | entry->ent.type = TRACE_HW_BRANCHES; | 191 | entry->ent.type = TRACE_HW_BRANCHES; |
| 190 | entry->from = from; | 192 | entry->from = from; |
| 191 | entry->to = to; | 193 | entry->to = to; |
| 192 | if (!filter_check_discard(call, entry, tr->buffer, event)) | 194 | if (!filter_check_discard(call, entry, buf, event)) |
| 193 | trace_buffer_unlock_commit(tr, event, 0, 0); | 195 | trace_buffer_unlock_commit(buf, event, 0, 0); |
| 194 | 196 | ||
| 195 | out: | 197 | out: |
| 196 | atomic_dec(&tr->data[cpu]->disabled); | 198 | atomic_dec(&tr->data[cpu]->disabled); |
diff --git a/kernel/trace/trace_output.c b/kernel/trace/trace_output.c index f572f44c6e1e..ed17565826b0 100644 --- a/kernel/trace/trace_output.c +++ b/kernel/trace/trace_output.c | |||
| @@ -486,16 +486,18 @@ int trace_print_lat_fmt(struct trace_seq *s, struct trace_entry *entry) | |||
| 486 | hardirq ? 'h' : softirq ? 's' : '.')) | 486 | hardirq ? 'h' : softirq ? 's' : '.')) |
| 487 | return 0; | 487 | return 0; |
| 488 | 488 | ||
| 489 | if (entry->lock_depth < 0) | 489 | if (entry->preempt_count) |
| 490 | ret = trace_seq_putc(s, '.'); | 490 | ret = trace_seq_printf(s, "%x", entry->preempt_count); |
| 491 | else | 491 | else |
| 492 | ret = trace_seq_printf(s, "%d", entry->lock_depth); | 492 | ret = trace_seq_putc(s, '.'); |
| 493 | |||
| 493 | if (!ret) | 494 | if (!ret) |
| 494 | return 0; | 495 | return 0; |
| 495 | 496 | ||
| 496 | if (entry->preempt_count) | 497 | if (entry->lock_depth < 0) |
| 497 | return trace_seq_printf(s, "%x", entry->preempt_count); | 498 | return trace_seq_putc(s, '.'); |
| 498 | return trace_seq_putc(s, '.'); | 499 | |
| 500 | return trace_seq_printf(s, "%d", entry->lock_depth); | ||
| 499 | } | 501 | } |
| 500 | 502 | ||
| 501 | static int | 503 | static int |
| @@ -883,7 +885,7 @@ static int trace_ctxwake_raw(struct trace_iterator *iter, char S) | |||
| 883 | trace_assign_type(field, iter->ent); | 885 | trace_assign_type(field, iter->ent); |
| 884 | 886 | ||
| 885 | if (!S) | 887 | if (!S) |
| 886 | task_state_char(field->prev_state); | 888 | S = task_state_char(field->prev_state); |
| 887 | T = task_state_char(field->next_state); | 889 | T = task_state_char(field->next_state); |
| 888 | if (!trace_seq_printf(&iter->seq, "%d %d %c %d %d %d %c\n", | 890 | if (!trace_seq_printf(&iter->seq, "%d %d %c %d %d %d %c\n", |
| 889 | field->prev_pid, | 891 | field->prev_pid, |
| @@ -918,7 +920,7 @@ static int trace_ctxwake_hex(struct trace_iterator *iter, char S) | |||
| 918 | trace_assign_type(field, iter->ent); | 920 | trace_assign_type(field, iter->ent); |
| 919 | 921 | ||
| 920 | if (!S) | 922 | if (!S) |
| 921 | task_state_char(field->prev_state); | 923 | S = task_state_char(field->prev_state); |
| 922 | T = task_state_char(field->next_state); | 924 | T = task_state_char(field->next_state); |
| 923 | 925 | ||
| 924 | SEQ_PUT_HEX_FIELD_RET(s, field->prev_pid); | 926 | SEQ_PUT_HEX_FIELD_RET(s, field->prev_pid); |
diff --git a/kernel/trace/trace_stack.c b/kernel/trace/trace_stack.c index 0f6facb050a1..8504ac71e4e8 100644 --- a/kernel/trace/trace_stack.c +++ b/kernel/trace/trace_stack.c | |||
| @@ -296,14 +296,14 @@ static const struct file_operations stack_trace_fops = { | |||
| 296 | 296 | ||
| 297 | int | 297 | int |
| 298 | stack_trace_sysctl(struct ctl_table *table, int write, | 298 | stack_trace_sysctl(struct ctl_table *table, int write, |
| 299 | struct file *file, void __user *buffer, size_t *lenp, | 299 | void __user *buffer, size_t *lenp, |
| 300 | loff_t *ppos) | 300 | loff_t *ppos) |
| 301 | { | 301 | { |
| 302 | int ret; | 302 | int ret; |
| 303 | 303 | ||
| 304 | mutex_lock(&stack_sysctl_mutex); | 304 | mutex_lock(&stack_sysctl_mutex); |
| 305 | 305 | ||
| 306 | ret = proc_dointvec(table, write, file, buffer, lenp, ppos); | 306 | ret = proc_dointvec(table, write, buffer, lenp, ppos); |
| 307 | 307 | ||
| 308 | if (ret || !write || | 308 | if (ret || !write || |
| 309 | (last_stack_tracer_enabled == !!stack_tracer_enabled)) | 309 | (last_stack_tracer_enabled == !!stack_tracer_enabled)) |
diff --git a/kernel/trace/trace_syscalls.c b/kernel/trace/trace_syscalls.c index 9fbce6c9d2e1..527e17eae575 100644 --- a/kernel/trace/trace_syscalls.c +++ b/kernel/trace/trace_syscalls.c | |||
| @@ -166,7 +166,7 @@ int syscall_exit_format(struct ftrace_event_call *call, struct trace_seq *s) | |||
| 166 | "\tfield:%s %s;\toffset:%zu;\tsize:%zu;\n" | 166 | "\tfield:%s %s;\toffset:%zu;\tsize:%zu;\n" |
| 167 | "\tfield:%s %s;\toffset:%zu;\tsize:%zu;\n", | 167 | "\tfield:%s %s;\toffset:%zu;\tsize:%zu;\n", |
| 168 | SYSCALL_FIELD(int, nr), | 168 | SYSCALL_FIELD(int, nr), |
| 169 | SYSCALL_FIELD(unsigned long, ret)); | 169 | SYSCALL_FIELD(long, ret)); |
| 170 | if (!ret) | 170 | if (!ret) |
| 171 | return 0; | 171 | return 0; |
| 172 | 172 | ||
| @@ -212,7 +212,7 @@ int syscall_exit_define_fields(struct ftrace_event_call *call) | |||
| 212 | if (ret) | 212 | if (ret) |
| 213 | return ret; | 213 | return ret; |
| 214 | 214 | ||
| 215 | ret = trace_define_field(call, SYSCALL_FIELD(unsigned long, ret), 0, | 215 | ret = trace_define_field(call, SYSCALL_FIELD(long, ret), 0, |
| 216 | FILTER_OTHER); | 216 | FILTER_OTHER); |
| 217 | 217 | ||
| 218 | return ret; | 218 | return ret; |
diff --git a/kernel/uid16.c b/kernel/uid16.c index 0314501688b9..419209893d87 100644 --- a/kernel/uid16.c +++ b/kernel/uid16.c | |||
| @@ -4,7 +4,6 @@ | |||
| 4 | */ | 4 | */ |
| 5 | 5 | ||
| 6 | #include <linux/mm.h> | 6 | #include <linux/mm.h> |
| 7 | #include <linux/utsname.h> | ||
| 8 | #include <linux/mman.h> | 7 | #include <linux/mman.h> |
| 9 | #include <linux/notifier.h> | 8 | #include <linux/notifier.h> |
| 10 | #include <linux/reboot.h> | 9 | #include <linux/reboot.h> |
diff --git a/kernel/utsname_sysctl.c b/kernel/utsname_sysctl.c index 92359cc747a7..69eae358a726 100644 --- a/kernel/utsname_sysctl.c +++ b/kernel/utsname_sysctl.c | |||
| @@ -42,14 +42,14 @@ static void put_uts(ctl_table *table, int write, void *which) | |||
| 42 | * Special case of dostring for the UTS structure. This has locks | 42 | * Special case of dostring for the UTS structure. This has locks |
| 43 | * to observe. Should this be in kernel/sys.c ???? | 43 | * to observe. Should this be in kernel/sys.c ???? |
| 44 | */ | 44 | */ |
| 45 | static int proc_do_uts_string(ctl_table *table, int write, struct file *filp, | 45 | static int proc_do_uts_string(ctl_table *table, int write, |
| 46 | void __user *buffer, size_t *lenp, loff_t *ppos) | 46 | void __user *buffer, size_t *lenp, loff_t *ppos) |
| 47 | { | 47 | { |
| 48 | struct ctl_table uts_table; | 48 | struct ctl_table uts_table; |
| 49 | int r; | 49 | int r; |
| 50 | memcpy(&uts_table, table, sizeof(uts_table)); | 50 | memcpy(&uts_table, table, sizeof(uts_table)); |
| 51 | uts_table.data = get_uts(table, write); | 51 | uts_table.data = get_uts(table, write); |
| 52 | r = proc_dostring(&uts_table,write,filp,buffer,lenp, ppos); | 52 | r = proc_dostring(&uts_table,write,buffer,lenp, ppos); |
| 53 | put_uts(table, write, uts_table.data); | 53 | put_uts(table, write, uts_table.data); |
| 54 | return r; | 54 | return r; |
| 55 | } | 55 | } |
