acct.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605
  1. /*
  2. * linux/kernel/acct.c
  3. *
  4. * BSD Process Accounting for Linux
  5. *
  6. * Author: Marco van Wieringen <mvw@planets.elm.net>
  7. *
  8. * Some code based on ideas and code from:
  9. * Thomas K. Dyas <tdyas@eden.rutgers.edu>
  10. *
  11. * This file implements BSD-style process accounting. Whenever any
  12. * process exits, an accounting record of type "struct acct" is
  13. * written to the file specified with the acct() system call. It is
  14. * up to user-level programs to do useful things with the accounting
  15. * log. The kernel just provides the raw accounting information.
  16. *
  17. * (C) Copyright 1995 - 1997 Marco van Wieringen - ELM Consultancy B.V.
  18. *
  19. * Plugged two leaks. 1) It didn't return acct_file into the free_filps if
  20. * the file happened to be read-only. 2) If the accounting was suspended
  21. * due to the lack of space it happily allowed to reopen it and completely
  22. * lost the old acct_file. 3/10/98, Al Viro.
  23. *
  24. * Now we silently close acct_file on attempt to reopen. Cleaned sys_acct().
  25. * XTerms and EMACS are manifestations of pure evil. 21/10/98, AV.
  26. *
  27. * Fixed a nasty interaction with with sys_umount(). If the accointing
  28. * was suspeneded we failed to stop it on umount(). Messy.
  29. * Another one: remount to readonly didn't stop accounting.
  30. * Question: what should we do if we have CAP_SYS_ADMIN but not
  31. * CAP_SYS_PACCT? Current code does the following: umount returns -EBUSY
  32. * unless we are messing with the root. In that case we are getting a
  33. * real mess with do_remount_sb(). 9/11/98, AV.
  34. *
  35. * Fixed a bunch of races (and pair of leaks). Probably not the best way,
  36. * but this one obviously doesn't introduce deadlocks. Later. BTW, found
  37. * one race (and leak) in BSD implementation.
  38. * OK, that's better. ANOTHER race and leak in BSD variant. There always
  39. * is one more bug... 10/11/98, AV.
  40. *
  41. * Oh, fsck... Oopsable SMP race in do_process_acct() - we must hold
  42. * ->mmap_sem to walk the vma list of current->mm. Nasty, since it leaks
  43. * a struct file opened for write. Fixed. 2/6/2000, AV.
  44. */
  45. #include <linux/mm.h>
  46. #include <linux/slab.h>
  47. #include <linux/acct.h>
  48. #include <linux/capability.h>
  49. #include <linux/file.h>
  50. #include <linux/tty.h>
  51. #include <linux/security.h>
  52. #include <linux/vfs.h>
  53. #include <linux/jiffies.h>
  54. #include <linux/times.h>
  55. #include <linux/syscalls.h>
  56. #include <linux/mount.h>
  57. #include <linux/uaccess.h>
  58. #include <linux/sched/cputime.h>
  59. #include <asm/div64.h>
  60. #include <linux/blkdev.h> /* sector_div */
  61. #include <linux/pid_namespace.h>
  62. #include <linux/fs_pin.h>
  63. /*
  64. * These constants control the amount of freespace that suspend and
  65. * resume the process accounting system, and the time delay between
  66. * each check.
  67. * Turned into sysctl-controllable parameters. AV, 12/11/98
  68. */
  69. int acct_parm[3] = {4, 2, 30};
  70. #define RESUME (acct_parm[0]) /* >foo% free space - resume */
  71. #define SUSPEND (acct_parm[1]) /* <foo% free space - suspend */
  72. #define ACCT_TIMEOUT (acct_parm[2]) /* foo second timeout between checks */
  73. /*
  74. * External references and all of the globals.
  75. */
  76. struct bsd_acct_struct {
  77. struct fs_pin pin;
  78. atomic_long_t count;
  79. struct rcu_head rcu;
  80. struct mutex lock;
  81. int active;
  82. unsigned long needcheck;
  83. struct file *file;
  84. struct pid_namespace *ns;
  85. struct work_struct work;
  86. struct completion done;
  87. };
  88. static void do_acct_process(struct bsd_acct_struct *acct);
  89. /*
  90. * Check the amount of free space and suspend/resume accordingly.
  91. */
  92. static int check_free_space(struct bsd_acct_struct *acct)
  93. {
  94. struct kstatfs sbuf;
  95. if (time_is_before_jiffies(acct->needcheck))
  96. goto out;
  97. /* May block */
  98. if (vfs_statfs(&acct->file->f_path, &sbuf))
  99. goto out;
  100. if (acct->active) {
  101. u64 suspend = sbuf.f_blocks * SUSPEND;
  102. do_div(suspend, 100);
  103. if (sbuf.f_bavail <= suspend) {
  104. acct->active = 0;
  105. pr_info("Process accounting paused\n");
  106. }
  107. } else {
  108. u64 resume = sbuf.f_blocks * RESUME;
  109. do_div(resume, 100);
  110. if (sbuf.f_bavail >= resume) {
  111. acct->active = 1;
  112. pr_info("Process accounting resumed\n");
  113. }
  114. }
  115. acct->needcheck = jiffies + ACCT_TIMEOUT*HZ;
  116. out:
  117. return acct->active;
  118. }
  119. static void acct_put(struct bsd_acct_struct *p)
  120. {
  121. if (atomic_long_dec_and_test(&p->count))
  122. kfree_rcu(p, rcu);
  123. }
  124. static inline struct bsd_acct_struct *to_acct(struct fs_pin *p)
  125. {
  126. return p ? container_of(p, struct bsd_acct_struct, pin) : NULL;
  127. }
  128. static struct bsd_acct_struct *acct_get(struct pid_namespace *ns)
  129. {
  130. struct bsd_acct_struct *res;
  131. again:
  132. smp_rmb();
  133. rcu_read_lock();
  134. res = to_acct(ACCESS_ONCE(ns->bacct));
  135. if (!res) {
  136. rcu_read_unlock();
  137. return NULL;
  138. }
  139. if (!atomic_long_inc_not_zero(&res->count)) {
  140. rcu_read_unlock();
  141. cpu_relax();
  142. goto again;
  143. }
  144. rcu_read_unlock();
  145. mutex_lock(&res->lock);
  146. if (res != to_acct(ACCESS_ONCE(ns->bacct))) {
  147. mutex_unlock(&res->lock);
  148. acct_put(res);
  149. goto again;
  150. }
  151. return res;
  152. }
  153. static void acct_pin_kill(struct fs_pin *pin)
  154. {
  155. struct bsd_acct_struct *acct = to_acct(pin);
  156. mutex_lock(&acct->lock);
  157. do_acct_process(acct);
  158. schedule_work(&acct->work);
  159. wait_for_completion(&acct->done);
  160. cmpxchg(&acct->ns->bacct, pin, NULL);
  161. mutex_unlock(&acct->lock);
  162. pin_remove(pin);
  163. acct_put(acct);
  164. }
  165. static void close_work(struct work_struct *work)
  166. {
  167. struct bsd_acct_struct *acct = container_of(work, struct bsd_acct_struct, work);
  168. struct file *file = acct->file;
  169. if (file->f_op->flush)
  170. file->f_op->flush(file, NULL);
  171. __fput_sync(file);
  172. complete(&acct->done);
  173. }
  174. static int acct_on(struct filename *pathname)
  175. {
  176. struct file *file;
  177. struct vfsmount *mnt, *internal;
  178. struct pid_namespace *ns = task_active_pid_ns(current);
  179. struct bsd_acct_struct *acct;
  180. struct fs_pin *old;
  181. int err;
  182. acct = kzalloc(sizeof(struct bsd_acct_struct), GFP_KERNEL);
  183. if (!acct)
  184. return -ENOMEM;
  185. /* Difference from BSD - they don't do O_APPEND */
  186. file = file_open_name(pathname, O_WRONLY|O_APPEND|O_LARGEFILE, 0);
  187. if (IS_ERR(file)) {
  188. kfree(acct);
  189. return PTR_ERR(file);
  190. }
  191. if (!S_ISREG(file_inode(file)->i_mode)) {
  192. kfree(acct);
  193. filp_close(file, NULL);
  194. return -EACCES;
  195. }
  196. if (!(file->f_mode & FMODE_CAN_WRITE)) {
  197. kfree(acct);
  198. filp_close(file, NULL);
  199. return -EIO;
  200. }
  201. internal = mnt_clone_internal(&file->f_path);
  202. if (IS_ERR(internal)) {
  203. kfree(acct);
  204. filp_close(file, NULL);
  205. return PTR_ERR(internal);
  206. }
  207. err = mnt_want_write(internal);
  208. if (err) {
  209. mntput(internal);
  210. kfree(acct);
  211. filp_close(file, NULL);
  212. return err;
  213. }
  214. mnt = file->f_path.mnt;
  215. file->f_path.mnt = internal;
  216. atomic_long_set(&acct->count, 1);
  217. init_fs_pin(&acct->pin, acct_pin_kill);
  218. acct->file = file;
  219. acct->needcheck = jiffies;
  220. acct->ns = ns;
  221. mutex_init(&acct->lock);
  222. INIT_WORK(&acct->work, close_work);
  223. init_completion(&acct->done);
  224. mutex_lock_nested(&acct->lock, 1); /* nobody has seen it yet */
  225. pin_insert(&acct->pin, mnt);
  226. rcu_read_lock();
  227. old = xchg(&ns->bacct, &acct->pin);
  228. mutex_unlock(&acct->lock);
  229. pin_kill(old);
  230. mnt_drop_write(mnt);
  231. mntput(mnt);
  232. return 0;
  233. }
  234. static DEFINE_MUTEX(acct_on_mutex);
  235. /**
  236. * sys_acct - enable/disable process accounting
  237. * @name: file name for accounting records or NULL to shutdown accounting
  238. *
  239. * Returns 0 for success or negative errno values for failure.
  240. *
  241. * sys_acct() is the only system call needed to implement process
  242. * accounting. It takes the name of the file where accounting records
  243. * should be written. If the filename is NULL, accounting will be
  244. * shutdown.
  245. */
  246. SYSCALL_DEFINE1(acct, const char __user *, name)
  247. {
  248. int error = 0;
  249. if (!capable(CAP_SYS_PACCT))
  250. return -EPERM;
  251. if (name) {
  252. struct filename *tmp = getname(name);
  253. if (IS_ERR(tmp))
  254. return PTR_ERR(tmp);
  255. mutex_lock(&acct_on_mutex);
  256. error = acct_on(tmp);
  257. mutex_unlock(&acct_on_mutex);
  258. putname(tmp);
  259. } else {
  260. rcu_read_lock();
  261. pin_kill(task_active_pid_ns(current)->bacct);
  262. }
  263. return error;
  264. }
  265. void acct_exit_ns(struct pid_namespace *ns)
  266. {
  267. rcu_read_lock();
  268. pin_kill(ns->bacct);
  269. }
  270. /*
  271. * encode an unsigned long into a comp_t
  272. *
  273. * This routine has been adopted from the encode_comp_t() function in
  274. * the kern_acct.c file of the FreeBSD operating system. The encoding
  275. * is a 13-bit fraction with a 3-bit (base 8) exponent.
  276. */
  277. #define MANTSIZE 13 /* 13 bit mantissa. */
  278. #define EXPSIZE 3 /* Base 8 (3 bit) exponent. */
  279. #define MAXFRACT ((1 << MANTSIZE) - 1) /* Maximum fractional value. */
  280. static comp_t encode_comp_t(unsigned long value)
  281. {
  282. int exp, rnd;
  283. exp = rnd = 0;
  284. while (value > MAXFRACT) {
  285. rnd = value & (1 << (EXPSIZE - 1)); /* Round up? */
  286. value >>= EXPSIZE; /* Base 8 exponent == 3 bit shift. */
  287. exp++;
  288. }
  289. /*
  290. * If we need to round up, do it (and handle overflow correctly).
  291. */
  292. if (rnd && (++value > MAXFRACT)) {
  293. value >>= EXPSIZE;
  294. exp++;
  295. }
  296. /*
  297. * Clean it up and polish it off.
  298. */
  299. exp <<= MANTSIZE; /* Shift the exponent into place */
  300. exp += value; /* and add on the mantissa. */
  301. return exp;
  302. }
  303. #if ACCT_VERSION == 1 || ACCT_VERSION == 2
  304. /*
  305. * encode an u64 into a comp2_t (24 bits)
  306. *
  307. * Format: 5 bit base 2 exponent, 20 bits mantissa.
  308. * The leading bit of the mantissa is not stored, but implied for
  309. * non-zero exponents.
  310. * Largest encodable value is 50 bits.
  311. */
  312. #define MANTSIZE2 20 /* 20 bit mantissa. */
  313. #define EXPSIZE2 5 /* 5 bit base 2 exponent. */
  314. #define MAXFRACT2 ((1ul << MANTSIZE2) - 1) /* Maximum fractional value. */
  315. #define MAXEXP2 ((1 << EXPSIZE2) - 1) /* Maximum exponent. */
  316. static comp2_t encode_comp2_t(u64 value)
  317. {
  318. int exp, rnd;
  319. exp = (value > (MAXFRACT2>>1));
  320. rnd = 0;
  321. while (value > MAXFRACT2) {
  322. rnd = value & 1;
  323. value >>= 1;
  324. exp++;
  325. }
  326. /*
  327. * If we need to round up, do it (and handle overflow correctly).
  328. */
  329. if (rnd && (++value > MAXFRACT2)) {
  330. value >>= 1;
  331. exp++;
  332. }
  333. if (exp > MAXEXP2) {
  334. /* Overflow. Return largest representable number instead. */
  335. return (1ul << (MANTSIZE2+EXPSIZE2-1)) - 1;
  336. } else {
  337. return (value & (MAXFRACT2>>1)) | (exp << (MANTSIZE2-1));
  338. }
  339. }
  340. #endif
  341. #if ACCT_VERSION == 3
  342. /*
  343. * encode an u64 into a 32 bit IEEE float
  344. */
  345. static u32 encode_float(u64 value)
  346. {
  347. unsigned exp = 190;
  348. unsigned u;
  349. if (value == 0)
  350. return 0;
  351. while ((s64)value > 0) {
  352. value <<= 1;
  353. exp--;
  354. }
  355. u = (u32)(value >> 40) & 0x7fffffu;
  356. return u | (exp << 23);
  357. }
  358. #endif
  359. /*
  360. * Write an accounting entry for an exiting process
  361. *
  362. * The acct_process() call is the workhorse of the process
  363. * accounting system. The struct acct is built here and then written
  364. * into the accounting file. This function should only be called from
  365. * do_exit() or when switching to a different output file.
  366. */
  367. static void fill_ac(acct_t *ac)
  368. {
  369. struct pacct_struct *pacct = &current->signal->pacct;
  370. u64 elapsed, run_time;
  371. struct tty_struct *tty;
  372. /*
  373. * Fill the accounting struct with the needed info as recorded
  374. * by the different kernel functions.
  375. */
  376. memset(ac, 0, sizeof(acct_t));
  377. ac->ac_version = ACCT_VERSION | ACCT_BYTEORDER;
  378. strlcpy(ac->ac_comm, current->comm, sizeof(ac->ac_comm));
  379. /* calculate run_time in nsec*/
  380. run_time = ktime_get_ns();
  381. run_time -= current->group_leader->start_time;
  382. /* convert nsec -> AHZ */
  383. elapsed = nsec_to_AHZ(run_time);
  384. #if ACCT_VERSION == 3
  385. ac->ac_etime = encode_float(elapsed);
  386. #else
  387. ac->ac_etime = encode_comp_t(elapsed < (unsigned long) -1l ?
  388. (unsigned long) elapsed : (unsigned long) -1l);
  389. #endif
  390. #if ACCT_VERSION == 1 || ACCT_VERSION == 2
  391. {
  392. /* new enlarged etime field */
  393. comp2_t etime = encode_comp2_t(elapsed);
  394. ac->ac_etime_hi = etime >> 16;
  395. ac->ac_etime_lo = (u16) etime;
  396. }
  397. #endif
  398. do_div(elapsed, AHZ);
  399. ac->ac_btime = get_seconds() - elapsed;
  400. #if ACCT_VERSION==2
  401. ac->ac_ahz = AHZ;
  402. #endif
  403. spin_lock_irq(&current->sighand->siglock);
  404. tty = current->signal->tty; /* Safe as we hold the siglock */
  405. ac->ac_tty = tty ? old_encode_dev(tty_devnum(tty)) : 0;
  406. ac->ac_utime = encode_comp_t(nsec_to_AHZ(pacct->ac_utime));
  407. ac->ac_stime = encode_comp_t(nsec_to_AHZ(pacct->ac_stime));
  408. ac->ac_flag = pacct->ac_flag;
  409. ac->ac_mem = encode_comp_t(pacct->ac_mem);
  410. ac->ac_minflt = encode_comp_t(pacct->ac_minflt);
  411. ac->ac_majflt = encode_comp_t(pacct->ac_majflt);
  412. ac->ac_exitcode = pacct->ac_exitcode;
  413. spin_unlock_irq(&current->sighand->siglock);
  414. }
  415. /*
  416. * do_acct_process does all actual work. Caller holds the reference to file.
  417. */
  418. static void do_acct_process(struct bsd_acct_struct *acct)
  419. {
  420. acct_t ac;
  421. unsigned long flim;
  422. const struct cred *orig_cred;
  423. struct file *file = acct->file;
  424. /*
  425. * Accounting records are not subject to resource limits.
  426. */
  427. flim = current->signal->rlim[RLIMIT_FSIZE].rlim_cur;
  428. current->signal->rlim[RLIMIT_FSIZE].rlim_cur = RLIM_INFINITY;
  429. /* Perform file operations on behalf of whoever enabled accounting */
  430. orig_cred = override_creds(file->f_cred);
  431. /*
  432. * First check to see if there is enough free_space to continue
  433. * the process accounting system.
  434. */
  435. if (!check_free_space(acct))
  436. goto out;
  437. fill_ac(&ac);
  438. /* we really need to bite the bullet and change layout */
  439. ac.ac_uid = from_kuid_munged(file->f_cred->user_ns, orig_cred->uid);
  440. ac.ac_gid = from_kgid_munged(file->f_cred->user_ns, orig_cred->gid);
  441. #if ACCT_VERSION == 1 || ACCT_VERSION == 2
  442. /* backward-compatible 16 bit fields */
  443. ac.ac_uid16 = ac.ac_uid;
  444. ac.ac_gid16 = ac.ac_gid;
  445. #endif
  446. #if ACCT_VERSION == 3
  447. {
  448. struct pid_namespace *ns = acct->ns;
  449. ac.ac_pid = task_tgid_nr_ns(current, ns);
  450. rcu_read_lock();
  451. ac.ac_ppid = task_tgid_nr_ns(rcu_dereference(current->real_parent),
  452. ns);
  453. rcu_read_unlock();
  454. }
  455. #endif
  456. /*
  457. * Get freeze protection. If the fs is frozen, just skip the write
  458. * as we could deadlock the system otherwise.
  459. */
  460. if (file_start_write_trylock(file)) {
  461. /* it's been opened O_APPEND, so position is irrelevant */
  462. loff_t pos = 0;
  463. __kernel_write(file, (char *)&ac, sizeof(acct_t), &pos);
  464. file_end_write(file);
  465. }
  466. out:
  467. current->signal->rlim[RLIMIT_FSIZE].rlim_cur = flim;
  468. revert_creds(orig_cred);
  469. }
  470. /**
  471. * acct_collect - collect accounting information into pacct_struct
  472. * @exitcode: task exit code
  473. * @group_dead: not 0, if this thread is the last one in the process.
  474. */
  475. void acct_collect(long exitcode, int group_dead)
  476. {
  477. struct pacct_struct *pacct = &current->signal->pacct;
  478. u64 utime, stime;
  479. unsigned long vsize = 0;
  480. if (group_dead && current->mm) {
  481. struct vm_area_struct *vma;
  482. down_read(&current->mm->mmap_sem);
  483. vma = current->mm->mmap;
  484. while (vma) {
  485. vsize += vma->vm_end - vma->vm_start;
  486. vma = vma->vm_next;
  487. }
  488. up_read(&current->mm->mmap_sem);
  489. }
  490. spin_lock_irq(&current->sighand->siglock);
  491. if (group_dead)
  492. pacct->ac_mem = vsize / 1024;
  493. if (thread_group_leader(current)) {
  494. pacct->ac_exitcode = exitcode;
  495. if (current->flags & PF_FORKNOEXEC)
  496. pacct->ac_flag |= AFORK;
  497. }
  498. if (current->flags & PF_SUPERPRIV)
  499. pacct->ac_flag |= ASU;
  500. if (current->flags & PF_DUMPCORE)
  501. pacct->ac_flag |= ACORE;
  502. if (current->flags & PF_SIGNALED)
  503. pacct->ac_flag |= AXSIG;
  504. task_cputime(current, &utime, &stime);
  505. pacct->ac_utime += utime;
  506. pacct->ac_stime += stime;
  507. pacct->ac_minflt += current->min_flt;
  508. pacct->ac_majflt += current->maj_flt;
  509. spin_unlock_irq(&current->sighand->siglock);
  510. }
  511. static void slow_acct_process(struct pid_namespace *ns)
  512. {
  513. for ( ; ns; ns = ns->parent) {
  514. struct bsd_acct_struct *acct = acct_get(ns);
  515. if (acct) {
  516. do_acct_process(acct);
  517. mutex_unlock(&acct->lock);
  518. acct_put(acct);
  519. }
  520. }
  521. }
  522. /**
  523. * acct_process
  524. *
  525. * handles process accounting for an exiting task
  526. */
  527. void acct_process(void)
  528. {
  529. struct pid_namespace *ns;
  530. /*
  531. * This loop is safe lockless, since current is still
  532. * alive and holds its namespace, which in turn holds
  533. * its parent.
  534. */
  535. for (ns = task_active_pid_ns(current); ns != NULL; ns = ns->parent) {
  536. if (ns->bacct)
  537. break;
  538. }
  539. if (unlikely(ns))
  540. slow_acct_process(ns);
  541. }