audit.c 41 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545
  1. /* audit.c -- Auditing support
  2. * Gateway between the kernel (e.g., selinux) and the user-space audit daemon.
  3. * System-call specific features have moved to auditsc.c
  4. *
  5. * Copyright 2003-2007 Red Hat Inc., Durham, North Carolina.
  6. * All Rights Reserved.
  7. *
  8. * This program is free software; you can redistribute it and/or modify
  9. * it under the terms of the GNU General Public License as published by
  10. * the Free Software Foundation; either version 2 of the License, or
  11. * (at your option) any later version.
  12. *
  13. * This program is distributed in the hope that it will be useful,
  14. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  15. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  16. * GNU General Public License for more details.
  17. *
  18. * You should have received a copy of the GNU General Public License
  19. * along with this program; if not, write to the Free Software
  20. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  21. *
  22. * Written by Rickard E. (Rik) Faith <faith@redhat.com>
  23. *
  24. * Goals: 1) Integrate fully with Security Modules.
  25. * 2) Minimal run-time overhead:
  26. * a) Minimal when syscall auditing is disabled (audit_enable=0).
  27. * b) Small when syscall auditing is enabled and no audit record
  28. * is generated (defer as much work as possible to record
  29. * generation time):
  30. * i) context is allocated,
  31. * ii) names from getname are stored without a copy, and
  32. * iii) inode information stored from path_lookup.
  33. * 3) Ability to disable syscall auditing at boot time (audit=0).
  34. * 4) Usable by other parts of the kernel (if audit_log* is called,
  35. * then a syscall record will be generated automatically for the
  36. * current syscall).
  37. * 5) Netlink interface to user-space.
  38. * 6) Support low-overhead kernel-based filtering to minimize the
  39. * information that must be passed to user-space.
  40. *
  41. * Example user-space utilities: http://people.redhat.com/sgrubb/audit/
  42. */
  43. #include <linux/init.h>
  44. #include <asm/types.h>
  45. #include <linux/atomic.h>
  46. #include <linux/mm.h>
  47. #include <linux/export.h>
  48. #include <linux/slab.h>
  49. #include <linux/err.h>
  50. #include <linux/kthread.h>
  51. #include <linux/audit.h>
  52. #include <net/sock.h>
  53. #include <net/netlink.h>
  54. #include <linux/skbuff.h>
  55. #ifdef CONFIG_SECURITY
  56. #include <linux/security.h>
  57. #endif
  58. #include <linux/netlink.h>
  59. #include <linux/freezer.h>
  60. #include <linux/tty.h>
  61. #include <linux/pid_namespace.h>
  62. #include "audit.h"
  63. /* No auditing will take place until audit_initialized == AUDIT_INITIALIZED.
  64. * (Initialization happens after skb_init is called.) */
  65. #define AUDIT_DISABLED -1
  66. #define AUDIT_UNINITIALIZED 0
  67. #define AUDIT_INITIALIZED 1
  68. static int audit_initialized;
  69. #define AUDIT_OFF 0
  70. #define AUDIT_ON 1
  71. #define AUDIT_LOCKED 2
  72. int audit_enabled;
  73. int audit_ever_enabled;
  74. EXPORT_SYMBOL_GPL(audit_enabled);
  75. /* Default state when kernel boots without any parameters. */
  76. static int audit_default;
  77. /* If auditing cannot proceed, audit_failure selects what happens. */
  78. static int audit_failure = AUDIT_FAIL_PRINTK;
  79. /*
  80. * If audit records are to be written to the netlink socket, audit_pid
  81. * contains the pid of the auditd process and audit_nlk_portid contains
  82. * the portid to use to send netlink messages to that process.
  83. */
  84. int audit_pid;
  85. static int audit_nlk_portid;
  86. /* If audit_rate_limit is non-zero, limit the rate of sending audit records
  87. * to that number per second. This prevents DoS attacks, but results in
  88. * audit records being dropped. */
  89. static int audit_rate_limit;
  90. /* Number of outstanding audit_buffers allowed. */
  91. static int audit_backlog_limit = 64;
  92. static int audit_backlog_wait_time = 60 * HZ;
  93. static int audit_backlog_wait_overflow = 0;
  94. /* The identity of the user shutting down the audit system. */
  95. kuid_t audit_sig_uid = INVALID_UID;
  96. pid_t audit_sig_pid = -1;
  97. u32 audit_sig_sid = 0;
  98. /* Records can be lost in several ways:
  99. 0) [suppressed in audit_alloc]
  100. 1) out of memory in audit_log_start [kmalloc of struct audit_buffer]
  101. 2) out of memory in audit_log_move [alloc_skb]
  102. 3) suppressed due to audit_rate_limit
  103. 4) suppressed due to audit_backlog_limit
  104. */
  105. static atomic_t audit_lost = ATOMIC_INIT(0);
  106. /* The netlink socket. */
  107. static struct sock *audit_sock;
  108. /* Hash for inode-based rules */
  109. struct list_head audit_inode_hash[AUDIT_INODE_BUCKETS];
  110. /* The audit_freelist is a list of pre-allocated audit buffers (if more
  111. * than AUDIT_MAXFREE are in use, the audit buffer is freed instead of
  112. * being placed on the freelist). */
  113. static DEFINE_SPINLOCK(audit_freelist_lock);
  114. static int audit_freelist_count;
  115. static LIST_HEAD(audit_freelist);
  116. static struct sk_buff_head audit_skb_queue;
  117. /* queue of skbs to send to auditd when/if it comes back */
  118. static struct sk_buff_head audit_skb_hold_queue;
  119. static struct task_struct *kauditd_task;
  120. static DECLARE_WAIT_QUEUE_HEAD(kauditd_wait);
  121. static DECLARE_WAIT_QUEUE_HEAD(audit_backlog_wait);
  122. /* Serialize requests from userspace. */
  123. DEFINE_MUTEX(audit_cmd_mutex);
  124. /* AUDIT_BUFSIZ is the size of the temporary buffer used for formatting
  125. * audit records. Since printk uses a 1024 byte buffer, this buffer
  126. * should be at least that large. */
  127. #define AUDIT_BUFSIZ 1024
  128. /* AUDIT_MAXFREE is the number of empty audit_buffers we keep on the
  129. * audit_freelist. Doing so eliminates many kmalloc/kfree calls. */
  130. #define AUDIT_MAXFREE (2*NR_CPUS)
  131. /* The audit_buffer is used when formatting an audit record. The caller
  132. * locks briefly to get the record off the freelist or to allocate the
  133. * buffer, and locks briefly to send the buffer to the netlink layer or
  134. * to place it on a transmit queue. Multiple audit_buffers can be in
  135. * use simultaneously. */
  136. struct audit_buffer {
  137. struct list_head list;
  138. struct sk_buff *skb; /* formatted skb ready to send */
  139. struct audit_context *ctx; /* NULL or associated context */
  140. gfp_t gfp_mask;
  141. };
  142. struct audit_reply {
  143. int pid;
  144. struct sk_buff *skb;
  145. };
  146. static void audit_set_pid(struct audit_buffer *ab, pid_t pid)
  147. {
  148. if (ab) {
  149. struct nlmsghdr *nlh = nlmsg_hdr(ab->skb);
  150. nlh->nlmsg_pid = pid;
  151. }
  152. }
  153. void audit_panic(const char *message)
  154. {
  155. switch (audit_failure)
  156. {
  157. case AUDIT_FAIL_SILENT:
  158. break;
  159. case AUDIT_FAIL_PRINTK:
  160. if (printk_ratelimit())
  161. printk(KERN_ERR "audit: %s\n", message);
  162. break;
  163. case AUDIT_FAIL_PANIC:
  164. /* test audit_pid since printk is always losey, why bother? */
  165. if (audit_pid)
  166. panic("audit: %s\n", message);
  167. break;
  168. }
  169. }
  170. static inline int audit_rate_check(void)
  171. {
  172. static unsigned long last_check = 0;
  173. static int messages = 0;
  174. static DEFINE_SPINLOCK(lock);
  175. unsigned long flags;
  176. unsigned long now;
  177. unsigned long elapsed;
  178. int retval = 0;
  179. if (!audit_rate_limit) return 1;
  180. spin_lock_irqsave(&lock, flags);
  181. if (++messages < audit_rate_limit) {
  182. retval = 1;
  183. } else {
  184. now = jiffies;
  185. elapsed = now - last_check;
  186. if (elapsed > HZ) {
  187. last_check = now;
  188. messages = 0;
  189. retval = 1;
  190. }
  191. }
  192. spin_unlock_irqrestore(&lock, flags);
  193. return retval;
  194. }
  195. /**
  196. * audit_log_lost - conditionally log lost audit message event
  197. * @message: the message stating reason for lost audit message
  198. *
  199. * Emit at least 1 message per second, even if audit_rate_check is
  200. * throttling.
  201. * Always increment the lost messages counter.
  202. */
  203. void audit_log_lost(const char *message)
  204. {
  205. static unsigned long last_msg = 0;
  206. static DEFINE_SPINLOCK(lock);
  207. unsigned long flags;
  208. unsigned long now;
  209. int print;
  210. atomic_inc(&audit_lost);
  211. print = (audit_failure == AUDIT_FAIL_PANIC || !audit_rate_limit);
  212. if (!print) {
  213. spin_lock_irqsave(&lock, flags);
  214. now = jiffies;
  215. if (now - last_msg > HZ) {
  216. print = 1;
  217. last_msg = now;
  218. }
  219. spin_unlock_irqrestore(&lock, flags);
  220. }
  221. if (print) {
  222. if (printk_ratelimit())
  223. printk(KERN_WARNING
  224. "audit: audit_lost=%d audit_rate_limit=%d "
  225. "audit_backlog_limit=%d\n",
  226. atomic_read(&audit_lost),
  227. audit_rate_limit,
  228. audit_backlog_limit);
  229. audit_panic(message);
  230. }
  231. }
  232. static int audit_log_config_change(char *function_name, int new, int old,
  233. kuid_t loginuid, u32 sessionid, u32 sid,
  234. int allow_changes)
  235. {
  236. struct audit_buffer *ab;
  237. int rc = 0;
  238. ab = audit_log_start(NULL, GFP_KERNEL, AUDIT_CONFIG_CHANGE);
  239. if (unlikely(!ab))
  240. return rc;
  241. audit_log_format(ab, "%s=%d old=%d auid=%u ses=%u", function_name, new,
  242. old, from_kuid(&init_user_ns, loginuid), sessionid);
  243. if (sid) {
  244. char *ctx = NULL;
  245. u32 len;
  246. rc = security_secid_to_secctx(sid, &ctx, &len);
  247. if (rc) {
  248. audit_log_format(ab, " sid=%u", sid);
  249. allow_changes = 0; /* Something weird, deny request */
  250. } else {
  251. audit_log_format(ab, " subj=%s", ctx);
  252. security_release_secctx(ctx, len);
  253. }
  254. }
  255. audit_log_format(ab, " res=%d", allow_changes);
  256. audit_log_end(ab);
  257. return rc;
  258. }
  259. static int audit_do_config_change(char *function_name, int *to_change,
  260. int new, kuid_t loginuid, u32 sessionid,
  261. u32 sid)
  262. {
  263. int allow_changes, rc = 0, old = *to_change;
  264. /* check if we are locked */
  265. if (audit_enabled == AUDIT_LOCKED)
  266. allow_changes = 0;
  267. else
  268. allow_changes = 1;
  269. if (audit_enabled != AUDIT_OFF) {
  270. rc = audit_log_config_change(function_name, new, old, loginuid,
  271. sessionid, sid, allow_changes);
  272. if (rc)
  273. allow_changes = 0;
  274. }
  275. /* If we are allowed, make the change */
  276. if (allow_changes == 1)
  277. *to_change = new;
  278. /* Not allowed, update reason */
  279. else if (rc == 0)
  280. rc = -EPERM;
  281. return rc;
  282. }
  283. static int audit_set_rate_limit(int limit, kuid_t loginuid, u32 sessionid,
  284. u32 sid)
  285. {
  286. return audit_do_config_change("audit_rate_limit", &audit_rate_limit,
  287. limit, loginuid, sessionid, sid);
  288. }
  289. static int audit_set_backlog_limit(int limit, kuid_t loginuid, u32 sessionid,
  290. u32 sid)
  291. {
  292. return audit_do_config_change("audit_backlog_limit", &audit_backlog_limit,
  293. limit, loginuid, sessionid, sid);
  294. }
  295. static int audit_set_enabled(int state, kuid_t loginuid, u32 sessionid, u32 sid)
  296. {
  297. int rc;
  298. if (state < AUDIT_OFF || state > AUDIT_LOCKED)
  299. return -EINVAL;
  300. rc = audit_do_config_change("audit_enabled", &audit_enabled, state,
  301. loginuid, sessionid, sid);
  302. if (!rc)
  303. audit_ever_enabled |= !!state;
  304. return rc;
  305. }
  306. static int audit_set_failure(int state, kuid_t loginuid, u32 sessionid, u32 sid)
  307. {
  308. if (state != AUDIT_FAIL_SILENT
  309. && state != AUDIT_FAIL_PRINTK
  310. && state != AUDIT_FAIL_PANIC)
  311. return -EINVAL;
  312. return audit_do_config_change("audit_failure", &audit_failure, state,
  313. loginuid, sessionid, sid);
  314. }
  315. /*
  316. * Queue skbs to be sent to auditd when/if it comes back. These skbs should
  317. * already have been sent via prink/syslog and so if these messages are dropped
  318. * it is not a huge concern since we already passed the audit_log_lost()
  319. * notification and stuff. This is just nice to get audit messages during
  320. * boot before auditd is running or messages generated while auditd is stopped.
  321. * This only holds messages is audit_default is set, aka booting with audit=1
  322. * or building your kernel that way.
  323. */
  324. static void audit_hold_skb(struct sk_buff *skb)
  325. {
  326. if (audit_default &&
  327. skb_queue_len(&audit_skb_hold_queue) < audit_backlog_limit)
  328. skb_queue_tail(&audit_skb_hold_queue, skb);
  329. else
  330. kfree_skb(skb);
  331. }
  332. /*
  333. * For one reason or another this nlh isn't getting delivered to the userspace
  334. * audit daemon, just send it to printk.
  335. */
  336. static void audit_printk_skb(struct sk_buff *skb)
  337. {
  338. struct nlmsghdr *nlh = nlmsg_hdr(skb);
  339. char *data = nlmsg_data(nlh);
  340. if (nlh->nlmsg_type != AUDIT_EOE) {
  341. if (printk_ratelimit())
  342. printk(KERN_NOTICE "type=%d %s\n", nlh->nlmsg_type, data);
  343. else
  344. audit_log_lost("printk limit exceeded\n");
  345. }
  346. audit_hold_skb(skb);
  347. }
  348. static void kauditd_send_skb(struct sk_buff *skb)
  349. {
  350. int err;
  351. /* take a reference in case we can't send it and we want to hold it */
  352. skb_get(skb);
  353. err = netlink_unicast(audit_sock, skb, audit_nlk_portid, 0);
  354. if (err < 0) {
  355. BUG_ON(err != -ECONNREFUSED); /* Shouldn't happen */
  356. printk(KERN_ERR "audit: *NO* daemon at audit_pid=%d\n", audit_pid);
  357. audit_log_lost("auditd disappeared\n");
  358. audit_pid = 0;
  359. /* we might get lucky and get this in the next auditd */
  360. audit_hold_skb(skb);
  361. } else
  362. /* drop the extra reference if sent ok */
  363. consume_skb(skb);
  364. }
  365. static int kauditd_thread(void *dummy)
  366. {
  367. struct sk_buff *skb;
  368. set_freezable();
  369. while (!kthread_should_stop()) {
  370. /*
  371. * if auditd just started drain the queue of messages already
  372. * sent to syslog/printk. remember loss here is ok. we already
  373. * called audit_log_lost() if it didn't go out normally. so the
  374. * race between the skb_dequeue and the next check for audit_pid
  375. * doesn't matter.
  376. *
  377. * if you ever find kauditd to be too slow we can get a perf win
  378. * by doing our own locking and keeping better track if there
  379. * are messages in this queue. I don't see the need now, but
  380. * in 5 years when I want to play with this again I'll see this
  381. * note and still have no friggin idea what i'm thinking today.
  382. */
  383. if (audit_default && audit_pid) {
  384. skb = skb_dequeue(&audit_skb_hold_queue);
  385. if (unlikely(skb)) {
  386. while (skb && audit_pid) {
  387. kauditd_send_skb(skb);
  388. skb = skb_dequeue(&audit_skb_hold_queue);
  389. }
  390. }
  391. }
  392. skb = skb_dequeue(&audit_skb_queue);
  393. wake_up(&audit_backlog_wait);
  394. if (skb) {
  395. if (audit_pid)
  396. kauditd_send_skb(skb);
  397. else
  398. audit_printk_skb(skb);
  399. } else {
  400. DECLARE_WAITQUEUE(wait, current);
  401. set_current_state(TASK_INTERRUPTIBLE);
  402. add_wait_queue(&kauditd_wait, &wait);
  403. if (!skb_queue_len(&audit_skb_queue)) {
  404. try_to_freeze();
  405. schedule();
  406. }
  407. __set_current_state(TASK_RUNNING);
  408. remove_wait_queue(&kauditd_wait, &wait);
  409. }
  410. }
  411. return 0;
  412. }
  413. int audit_send_list(void *_dest)
  414. {
  415. struct audit_netlink_list *dest = _dest;
  416. int pid = dest->pid;
  417. struct sk_buff *skb;
  418. /* wait for parent to finish and send an ACK */
  419. mutex_lock(&audit_cmd_mutex);
  420. mutex_unlock(&audit_cmd_mutex);
  421. while ((skb = __skb_dequeue(&dest->q)) != NULL)
  422. netlink_unicast(audit_sock, skb, pid, 0);
  423. kfree(dest);
  424. return 0;
  425. }
  426. struct sk_buff *audit_make_reply(int pid, int seq, int type, int done,
  427. int multi, const void *payload, int size)
  428. {
  429. struct sk_buff *skb;
  430. struct nlmsghdr *nlh;
  431. void *data;
  432. int flags = multi ? NLM_F_MULTI : 0;
  433. int t = done ? NLMSG_DONE : type;
  434. skb = nlmsg_new(size, GFP_KERNEL);
  435. if (!skb)
  436. return NULL;
  437. nlh = nlmsg_put(skb, pid, seq, t, size, flags);
  438. if (!nlh)
  439. goto out_kfree_skb;
  440. data = nlmsg_data(nlh);
  441. memcpy(data, payload, size);
  442. return skb;
  443. out_kfree_skb:
  444. kfree_skb(skb);
  445. return NULL;
  446. }
  447. static int audit_send_reply_thread(void *arg)
  448. {
  449. struct audit_reply *reply = (struct audit_reply *)arg;
  450. mutex_lock(&audit_cmd_mutex);
  451. mutex_unlock(&audit_cmd_mutex);
  452. /* Ignore failure. It'll only happen if the sender goes away,
  453. because our timeout is set to infinite. */
  454. netlink_unicast(audit_sock, reply->skb, reply->pid, 0);
  455. kfree(reply);
  456. return 0;
  457. }
  458. /**
  459. * audit_send_reply - send an audit reply message via netlink
  460. * @pid: process id to send reply to
  461. * @seq: sequence number
  462. * @type: audit message type
  463. * @done: done (last) flag
  464. * @multi: multi-part message flag
  465. * @payload: payload data
  466. * @size: payload size
  467. *
  468. * Allocates an skb, builds the netlink message, and sends it to the pid.
  469. * No failure notifications.
  470. */
  471. static void audit_send_reply(int pid, int seq, int type, int done, int multi,
  472. const void *payload, int size)
  473. {
  474. struct sk_buff *skb;
  475. struct task_struct *tsk;
  476. struct audit_reply *reply = kmalloc(sizeof(struct audit_reply),
  477. GFP_KERNEL);
  478. if (!reply)
  479. return;
  480. skb = audit_make_reply(pid, seq, type, done, multi, payload, size);
  481. if (!skb)
  482. goto out;
  483. reply->pid = pid;
  484. reply->skb = skb;
  485. tsk = kthread_run(audit_send_reply_thread, reply, "audit_send_reply");
  486. if (!IS_ERR(tsk))
  487. return;
  488. kfree_skb(skb);
  489. out:
  490. kfree(reply);
  491. }
  492. /*
  493. * Check for appropriate CAP_AUDIT_ capabilities on incoming audit
  494. * control messages.
  495. */
  496. static int audit_netlink_ok(struct sk_buff *skb, u16 msg_type)
  497. {
  498. int err = 0;
  499. /* Only support the initial namespaces for now. */
  500. if ((current_user_ns() != &init_user_ns) ||
  501. (task_active_pid_ns(current) != &init_pid_ns))
  502. return -EPERM;
  503. switch (msg_type) {
  504. case AUDIT_GET:
  505. case AUDIT_LIST:
  506. case AUDIT_LIST_RULES:
  507. case AUDIT_SET:
  508. case AUDIT_ADD:
  509. case AUDIT_ADD_RULE:
  510. case AUDIT_DEL:
  511. case AUDIT_DEL_RULE:
  512. case AUDIT_SIGNAL_INFO:
  513. case AUDIT_TTY_GET:
  514. case AUDIT_TTY_SET:
  515. case AUDIT_TRIM:
  516. case AUDIT_MAKE_EQUIV:
  517. if (!capable(CAP_AUDIT_CONTROL))
  518. err = -EPERM;
  519. break;
  520. case AUDIT_USER:
  521. case AUDIT_FIRST_USER_MSG ... AUDIT_LAST_USER_MSG:
  522. case AUDIT_FIRST_USER_MSG2 ... AUDIT_LAST_USER_MSG2:
  523. if (!capable(CAP_AUDIT_WRITE))
  524. err = -EPERM;
  525. break;
  526. default: /* bad msg */
  527. err = -EINVAL;
  528. }
  529. return err;
  530. }
  531. static int audit_log_common_recv_msg(struct audit_buffer **ab, u16 msg_type,
  532. kuid_t auid, u32 ses, u32 sid)
  533. {
  534. int rc = 0;
  535. char *ctx = NULL;
  536. u32 len;
  537. if (!audit_enabled) {
  538. *ab = NULL;
  539. return rc;
  540. }
  541. *ab = audit_log_start(NULL, GFP_KERNEL, msg_type);
  542. if (unlikely(!*ab))
  543. return rc;
  544. audit_log_format(*ab, "pid=%d uid=%u auid=%u ses=%u",
  545. task_tgid_vnr(current),
  546. from_kuid(&init_user_ns, current_uid()),
  547. from_kuid(&init_user_ns, auid), ses);
  548. if (sid) {
  549. rc = security_secid_to_secctx(sid, &ctx, &len);
  550. if (rc)
  551. audit_log_format(*ab, " ssid=%u", sid);
  552. else {
  553. audit_log_format(*ab, " subj=%s", ctx);
  554. security_release_secctx(ctx, len);
  555. }
  556. }
  557. return rc;
  558. }
  559. static int audit_receive_msg(struct sk_buff *skb, struct nlmsghdr *nlh)
  560. {
  561. u32 seq, sid;
  562. void *data;
  563. struct audit_status *status_get, status_set;
  564. int err;
  565. struct audit_buffer *ab;
  566. u16 msg_type = nlh->nlmsg_type;
  567. kuid_t loginuid; /* loginuid of sender */
  568. u32 sessionid;
  569. struct audit_sig_info *sig_data;
  570. char *ctx = NULL;
  571. u32 len;
  572. err = audit_netlink_ok(skb, msg_type);
  573. if (err)
  574. return err;
  575. /* As soon as there's any sign of userspace auditd,
  576. * start kauditd to talk to it */
  577. if (!kauditd_task)
  578. kauditd_task = kthread_run(kauditd_thread, NULL, "kauditd");
  579. if (IS_ERR(kauditd_task)) {
  580. err = PTR_ERR(kauditd_task);
  581. kauditd_task = NULL;
  582. return err;
  583. }
  584. loginuid = audit_get_loginuid(current);
  585. sessionid = audit_get_sessionid(current);
  586. security_task_getsecid(current, &sid);
  587. seq = nlh->nlmsg_seq;
  588. data = nlmsg_data(nlh);
  589. switch (msg_type) {
  590. case AUDIT_GET:
  591. status_set.enabled = audit_enabled;
  592. status_set.failure = audit_failure;
  593. status_set.pid = audit_pid;
  594. status_set.rate_limit = audit_rate_limit;
  595. status_set.backlog_limit = audit_backlog_limit;
  596. status_set.lost = atomic_read(&audit_lost);
  597. status_set.backlog = skb_queue_len(&audit_skb_queue);
  598. audit_send_reply(NETLINK_CB(skb).portid, seq, AUDIT_GET, 0, 0,
  599. &status_set, sizeof(status_set));
  600. break;
  601. case AUDIT_SET:
  602. if (nlh->nlmsg_len < sizeof(struct audit_status))
  603. return -EINVAL;
  604. status_get = (struct audit_status *)data;
  605. if (status_get->mask & AUDIT_STATUS_ENABLED) {
  606. err = audit_set_enabled(status_get->enabled,
  607. loginuid, sessionid, sid);
  608. if (err < 0)
  609. return err;
  610. }
  611. if (status_get->mask & AUDIT_STATUS_FAILURE) {
  612. err = audit_set_failure(status_get->failure,
  613. loginuid, sessionid, sid);
  614. if (err < 0)
  615. return err;
  616. }
  617. if (status_get->mask & AUDIT_STATUS_PID) {
  618. int new_pid = status_get->pid;
  619. if (audit_enabled != AUDIT_OFF)
  620. audit_log_config_change("audit_pid", new_pid,
  621. audit_pid, loginuid,
  622. sessionid, sid, 1);
  623. audit_pid = new_pid;
  624. audit_nlk_portid = NETLINK_CB(skb).portid;
  625. }
  626. if (status_get->mask & AUDIT_STATUS_RATE_LIMIT) {
  627. err = audit_set_rate_limit(status_get->rate_limit,
  628. loginuid, sessionid, sid);
  629. if (err < 0)
  630. return err;
  631. }
  632. if (status_get->mask & AUDIT_STATUS_BACKLOG_LIMIT)
  633. err = audit_set_backlog_limit(status_get->backlog_limit,
  634. loginuid, sessionid, sid);
  635. break;
  636. case AUDIT_USER:
  637. case AUDIT_FIRST_USER_MSG ... AUDIT_LAST_USER_MSG:
  638. case AUDIT_FIRST_USER_MSG2 ... AUDIT_LAST_USER_MSG2:
  639. if (!audit_enabled && msg_type != AUDIT_USER_AVC)
  640. return 0;
  641. err = audit_filter_user();
  642. if (err == 1) {
  643. err = 0;
  644. if (msg_type == AUDIT_USER_TTY) {
  645. err = tty_audit_push_task(current, loginuid,
  646. sessionid);
  647. if (err)
  648. break;
  649. }
  650. audit_log_common_recv_msg(&ab, msg_type,
  651. loginuid, sessionid, sid);
  652. if (msg_type != AUDIT_USER_TTY)
  653. audit_log_format(ab, " msg='%.1024s'",
  654. (char *)data);
  655. else {
  656. int size;
  657. audit_log_format(ab, " msg=");
  658. size = nlmsg_len(nlh);
  659. if (size > 0 &&
  660. ((unsigned char *)data)[size - 1] == '\0')
  661. size--;
  662. audit_log_n_untrustedstring(ab, data, size);
  663. }
  664. audit_set_pid(ab, NETLINK_CB(skb).portid);
  665. audit_log_end(ab);
  666. }
  667. break;
  668. case AUDIT_ADD:
  669. case AUDIT_DEL:
  670. if (nlmsg_len(nlh) < sizeof(struct audit_rule))
  671. return -EINVAL;
  672. if (audit_enabled == AUDIT_LOCKED) {
  673. audit_log_common_recv_msg(&ab, AUDIT_CONFIG_CHANGE,
  674. loginuid, sessionid, sid);
  675. audit_log_format(ab, " audit_enabled=%d res=0",
  676. audit_enabled);
  677. audit_log_end(ab);
  678. return -EPERM;
  679. }
  680. /* fallthrough */
  681. case AUDIT_LIST:
  682. err = audit_receive_filter(msg_type, NETLINK_CB(skb).portid,
  683. seq, data, nlmsg_len(nlh),
  684. loginuid, sessionid, sid);
  685. break;
  686. case AUDIT_ADD_RULE:
  687. case AUDIT_DEL_RULE:
  688. if (nlmsg_len(nlh) < sizeof(struct audit_rule_data))
  689. return -EINVAL;
  690. if (audit_enabled == AUDIT_LOCKED) {
  691. audit_log_common_recv_msg(&ab, AUDIT_CONFIG_CHANGE,
  692. loginuid, sessionid, sid);
  693. audit_log_format(ab, " audit_enabled=%d res=0",
  694. audit_enabled);
  695. audit_log_end(ab);
  696. return -EPERM;
  697. }
  698. /* fallthrough */
  699. case AUDIT_LIST_RULES:
  700. err = audit_receive_filter(msg_type, NETLINK_CB(skb).portid,
  701. seq, data, nlmsg_len(nlh),
  702. loginuid, sessionid, sid);
  703. break;
  704. case AUDIT_TRIM:
  705. audit_trim_trees();
  706. audit_log_common_recv_msg(&ab, AUDIT_CONFIG_CHANGE,
  707. loginuid, sessionid, sid);
  708. audit_log_format(ab, " op=trim res=1");
  709. audit_log_end(ab);
  710. break;
  711. case AUDIT_MAKE_EQUIV: {
  712. void *bufp = data;
  713. u32 sizes[2];
  714. size_t msglen = nlmsg_len(nlh);
  715. char *old, *new;
  716. err = -EINVAL;
  717. if (msglen < 2 * sizeof(u32))
  718. break;
  719. memcpy(sizes, bufp, 2 * sizeof(u32));
  720. bufp += 2 * sizeof(u32);
  721. msglen -= 2 * sizeof(u32);
  722. old = audit_unpack_string(&bufp, &msglen, sizes[0]);
  723. if (IS_ERR(old)) {
  724. err = PTR_ERR(old);
  725. break;
  726. }
  727. new = audit_unpack_string(&bufp, &msglen, sizes[1]);
  728. if (IS_ERR(new)) {
  729. err = PTR_ERR(new);
  730. kfree(old);
  731. break;
  732. }
  733. /* OK, here comes... */
  734. err = audit_tag_tree(old, new);
  735. audit_log_common_recv_msg(&ab, AUDIT_CONFIG_CHANGE,
  736. loginuid, sessionid, sid);
  737. audit_log_format(ab, " op=make_equiv old=");
  738. audit_log_untrustedstring(ab, old);
  739. audit_log_format(ab, " new=");
  740. audit_log_untrustedstring(ab, new);
  741. audit_log_format(ab, " res=%d", !err);
  742. audit_log_end(ab);
  743. kfree(old);
  744. kfree(new);
  745. break;
  746. }
  747. case AUDIT_SIGNAL_INFO:
  748. len = 0;
  749. if (audit_sig_sid) {
  750. err = security_secid_to_secctx(audit_sig_sid, &ctx, &len);
  751. if (err)
  752. return err;
  753. }
  754. sig_data = kmalloc(sizeof(*sig_data) + len, GFP_KERNEL);
  755. if (!sig_data) {
  756. if (audit_sig_sid)
  757. security_release_secctx(ctx, len);
  758. return -ENOMEM;
  759. }
  760. sig_data->uid = from_kuid(&init_user_ns, audit_sig_uid);
  761. sig_data->pid = audit_sig_pid;
  762. if (audit_sig_sid) {
  763. memcpy(sig_data->ctx, ctx, len);
  764. security_release_secctx(ctx, len);
  765. }
  766. audit_send_reply(NETLINK_CB(skb).portid, seq, AUDIT_SIGNAL_INFO,
  767. 0, 0, sig_data, sizeof(*sig_data) + len);
  768. kfree(sig_data);
  769. break;
  770. case AUDIT_TTY_GET: {
  771. struct audit_tty_status s;
  772. struct task_struct *tsk = current;
  773. spin_lock_irq(&tsk->sighand->siglock);
  774. s.enabled = tsk->signal->audit_tty != 0;
  775. spin_unlock_irq(&tsk->sighand->siglock);
  776. audit_send_reply(NETLINK_CB(skb).portid, seq,
  777. AUDIT_TTY_GET, 0, 0, &s, sizeof(s));
  778. break;
  779. }
  780. case AUDIT_TTY_SET: {
  781. struct audit_tty_status *s;
  782. struct task_struct *tsk = current;
  783. if (nlh->nlmsg_len < sizeof(struct audit_tty_status))
  784. return -EINVAL;
  785. s = data;
  786. if (s->enabled != 0 && s->enabled != 1)
  787. return -EINVAL;
  788. spin_lock_irq(&tsk->sighand->siglock);
  789. tsk->signal->audit_tty = s->enabled != 0;
  790. spin_unlock_irq(&tsk->sighand->siglock);
  791. break;
  792. }
  793. default:
  794. err = -EINVAL;
  795. break;
  796. }
  797. return err < 0 ? err : 0;
  798. }
  799. /*
  800. * Get message from skb. Each message is processed by audit_receive_msg.
  801. * Malformed skbs with wrong length are discarded silently.
  802. */
  803. static void audit_receive_skb(struct sk_buff *skb)
  804. {
  805. struct nlmsghdr *nlh;
  806. /*
  807. * len MUST be signed for NLMSG_NEXT to be able to dec it below 0
  808. * if the nlmsg_len was not aligned
  809. */
  810. int len;
  811. int err;
  812. nlh = nlmsg_hdr(skb);
  813. len = skb->len;
  814. while (NLMSG_OK(nlh, len)) {
  815. err = audit_receive_msg(skb, nlh);
  816. /* if err or if this message says it wants a response */
  817. if (err || (nlh->nlmsg_flags & NLM_F_ACK))
  818. netlink_ack(skb, nlh, err);
  819. nlh = NLMSG_NEXT(nlh, len);
  820. }
  821. }
  822. /* Receive messages from netlink socket. */
  823. static void audit_receive(struct sk_buff *skb)
  824. {
  825. mutex_lock(&audit_cmd_mutex);
  826. audit_receive_skb(skb);
  827. mutex_unlock(&audit_cmd_mutex);
  828. }
  829. /* Initialize audit support at boot time. */
  830. static int __init audit_init(void)
  831. {
  832. int i;
  833. struct netlink_kernel_cfg cfg = {
  834. .input = audit_receive,
  835. };
  836. if (audit_initialized == AUDIT_DISABLED)
  837. return 0;
  838. printk(KERN_INFO "audit: initializing netlink socket (%s)\n",
  839. audit_default ? "enabled" : "disabled");
  840. audit_sock = netlink_kernel_create(&init_net, NETLINK_AUDIT, &cfg);
  841. if (!audit_sock)
  842. audit_panic("cannot initialize netlink socket");
  843. else
  844. audit_sock->sk_sndtimeo = MAX_SCHEDULE_TIMEOUT;
  845. skb_queue_head_init(&audit_skb_queue);
  846. skb_queue_head_init(&audit_skb_hold_queue);
  847. audit_initialized = AUDIT_INITIALIZED;
  848. audit_enabled = audit_default;
  849. audit_ever_enabled |= !!audit_default;
  850. audit_log(NULL, GFP_KERNEL, AUDIT_KERNEL, "initialized");
  851. for (i = 0; i < AUDIT_INODE_BUCKETS; i++)
  852. INIT_LIST_HEAD(&audit_inode_hash[i]);
  853. return 0;
  854. }
  855. __initcall(audit_init);
  856. /* Process kernel command-line parameter at boot time. audit=0 or audit=1. */
  857. static int __init audit_enable(char *str)
  858. {
  859. audit_default = !!simple_strtol(str, NULL, 0);
  860. if (!audit_default)
  861. audit_initialized = AUDIT_DISABLED;
  862. printk(KERN_INFO "audit: %s", audit_default ? "enabled" : "disabled");
  863. if (audit_initialized == AUDIT_INITIALIZED) {
  864. audit_enabled = audit_default;
  865. audit_ever_enabled |= !!audit_default;
  866. } else if (audit_initialized == AUDIT_UNINITIALIZED) {
  867. printk(" (after initialization)");
  868. } else {
  869. printk(" (until reboot)");
  870. }
  871. printk("\n");
  872. return 1;
  873. }
  874. __setup("audit=", audit_enable);
  875. static void audit_buffer_free(struct audit_buffer *ab)
  876. {
  877. unsigned long flags;
  878. if (!ab)
  879. return;
  880. if (ab->skb)
  881. kfree_skb(ab->skb);
  882. spin_lock_irqsave(&audit_freelist_lock, flags);
  883. if (audit_freelist_count > AUDIT_MAXFREE)
  884. kfree(ab);
  885. else {
  886. audit_freelist_count++;
  887. list_add(&ab->list, &audit_freelist);
  888. }
  889. spin_unlock_irqrestore(&audit_freelist_lock, flags);
  890. }
  891. static struct audit_buffer * audit_buffer_alloc(struct audit_context *ctx,
  892. gfp_t gfp_mask, int type)
  893. {
  894. unsigned long flags;
  895. struct audit_buffer *ab = NULL;
  896. struct nlmsghdr *nlh;
  897. spin_lock_irqsave(&audit_freelist_lock, flags);
  898. if (!list_empty(&audit_freelist)) {
  899. ab = list_entry(audit_freelist.next,
  900. struct audit_buffer, list);
  901. list_del(&ab->list);
  902. --audit_freelist_count;
  903. }
  904. spin_unlock_irqrestore(&audit_freelist_lock, flags);
  905. if (!ab) {
  906. ab = kmalloc(sizeof(*ab), gfp_mask);
  907. if (!ab)
  908. goto err;
  909. }
  910. ab->ctx = ctx;
  911. ab->gfp_mask = gfp_mask;
  912. ab->skb = nlmsg_new(AUDIT_BUFSIZ, gfp_mask);
  913. if (!ab->skb)
  914. goto err;
  915. nlh = nlmsg_put(ab->skb, 0, 0, type, 0, 0);
  916. if (!nlh)
  917. goto out_kfree_skb;
  918. return ab;
  919. out_kfree_skb:
  920. kfree_skb(ab->skb);
  921. ab->skb = NULL;
  922. err:
  923. audit_buffer_free(ab);
  924. return NULL;
  925. }
  926. /**
  927. * audit_serial - compute a serial number for the audit record
  928. *
  929. * Compute a serial number for the audit record. Audit records are
  930. * written to user-space as soon as they are generated, so a complete
  931. * audit record may be written in several pieces. The timestamp of the
  932. * record and this serial number are used by the user-space tools to
  933. * determine which pieces belong to the same audit record. The
  934. * (timestamp,serial) tuple is unique for each syscall and is live from
  935. * syscall entry to syscall exit.
  936. *
  937. * NOTE: Another possibility is to store the formatted records off the
  938. * audit context (for those records that have a context), and emit them
  939. * all at syscall exit. However, this could delay the reporting of
  940. * significant errors until syscall exit (or never, if the system
  941. * halts).
  942. */
  943. unsigned int audit_serial(void)
  944. {
  945. static DEFINE_SPINLOCK(serial_lock);
  946. static unsigned int serial = 0;
  947. unsigned long flags;
  948. unsigned int ret;
  949. spin_lock_irqsave(&serial_lock, flags);
  950. do {
  951. ret = ++serial;
  952. } while (unlikely(!ret));
  953. spin_unlock_irqrestore(&serial_lock, flags);
  954. return ret;
  955. }
  956. static inline void audit_get_stamp(struct audit_context *ctx,
  957. struct timespec *t, unsigned int *serial)
  958. {
  959. if (!ctx || !auditsc_get_stamp(ctx, t, serial)) {
  960. *t = CURRENT_TIME;
  961. *serial = audit_serial();
  962. }
  963. }
  964. /* Obtain an audit buffer. This routine does locking to obtain the
  965. * audit buffer, but then no locking is required for calls to
  966. * audit_log_*format. If the tsk is a task that is currently in a
  967. * syscall, then the syscall is marked as auditable and an audit record
  968. * will be written at syscall exit. If there is no associated task, tsk
  969. * should be NULL. */
  970. /**
  971. * audit_log_start - obtain an audit buffer
  972. * @ctx: audit_context (may be NULL)
  973. * @gfp_mask: type of allocation
  974. * @type: audit message type
  975. *
  976. * Returns audit_buffer pointer on success or NULL on error.
  977. *
  978. * Obtain an audit buffer. This routine does locking to obtain the
  979. * audit buffer, but then no locking is required for calls to
  980. * audit_log_*format. If the task (ctx) is a task that is currently in a
  981. * syscall, then the syscall is marked as auditable and an audit record
  982. * will be written at syscall exit. If there is no associated task, then
  983. * task context (ctx) should be NULL.
  984. */
  985. struct audit_buffer *audit_log_start(struct audit_context *ctx, gfp_t gfp_mask,
  986. int type)
  987. {
  988. struct audit_buffer *ab = NULL;
  989. struct timespec t;
  990. unsigned int uninitialized_var(serial);
  991. int reserve;
  992. unsigned long timeout_start = jiffies;
  993. if (audit_initialized != AUDIT_INITIALIZED)
  994. return NULL;
  995. if (unlikely(audit_filter_type(type)))
  996. return NULL;
  997. if (gfp_mask & __GFP_WAIT)
  998. reserve = 0;
  999. else
  1000. reserve = 5; /* Allow atomic callers to go up to five
  1001. entries over the normal backlog limit */
  1002. while (audit_backlog_limit
  1003. && skb_queue_len(&audit_skb_queue) > audit_backlog_limit + reserve) {
  1004. if (gfp_mask & __GFP_WAIT && audit_backlog_wait_time
  1005. && time_before(jiffies, timeout_start + audit_backlog_wait_time)) {
  1006. /* Wait for auditd to drain the queue a little */
  1007. DECLARE_WAITQUEUE(wait, current);
  1008. set_current_state(TASK_INTERRUPTIBLE);
  1009. add_wait_queue(&audit_backlog_wait, &wait);
  1010. if (audit_backlog_limit &&
  1011. skb_queue_len(&audit_skb_queue) > audit_backlog_limit)
  1012. schedule_timeout(timeout_start + audit_backlog_wait_time - jiffies);
  1013. __set_current_state(TASK_RUNNING);
  1014. remove_wait_queue(&audit_backlog_wait, &wait);
  1015. continue;
  1016. }
  1017. if (audit_rate_check() && printk_ratelimit())
  1018. printk(KERN_WARNING
  1019. "audit: audit_backlog=%d > "
  1020. "audit_backlog_limit=%d\n",
  1021. skb_queue_len(&audit_skb_queue),
  1022. audit_backlog_limit);
  1023. audit_log_lost("backlog limit exceeded");
  1024. audit_backlog_wait_time = audit_backlog_wait_overflow;
  1025. wake_up(&audit_backlog_wait);
  1026. return NULL;
  1027. }
  1028. ab = audit_buffer_alloc(ctx, gfp_mask, type);
  1029. if (!ab) {
  1030. audit_log_lost("out of memory in audit_log_start");
  1031. return NULL;
  1032. }
  1033. audit_get_stamp(ab->ctx, &t, &serial);
  1034. audit_log_format(ab, "audit(%lu.%03lu:%u): ",
  1035. t.tv_sec, t.tv_nsec/1000000, serial);
  1036. return ab;
  1037. }
  1038. /**
  1039. * audit_expand - expand skb in the audit buffer
  1040. * @ab: audit_buffer
  1041. * @extra: space to add at tail of the skb
  1042. *
  1043. * Returns 0 (no space) on failed expansion, or available space if
  1044. * successful.
  1045. */
  1046. static inline int audit_expand(struct audit_buffer *ab, int extra)
  1047. {
  1048. struct sk_buff *skb = ab->skb;
  1049. int oldtail = skb_tailroom(skb);
  1050. int ret = pskb_expand_head(skb, 0, extra, ab->gfp_mask);
  1051. int newtail = skb_tailroom(skb);
  1052. if (ret < 0) {
  1053. audit_log_lost("out of memory in audit_expand");
  1054. return 0;
  1055. }
  1056. skb->truesize += newtail - oldtail;
  1057. return newtail;
  1058. }
  1059. /*
  1060. * Format an audit message into the audit buffer. If there isn't enough
  1061. * room in the audit buffer, more room will be allocated and vsnprint
  1062. * will be called a second time. Currently, we assume that a printk
  1063. * can't format message larger than 1024 bytes, so we don't either.
  1064. */
  1065. static void audit_log_vformat(struct audit_buffer *ab, const char *fmt,
  1066. va_list args)
  1067. {
  1068. int len, avail;
  1069. struct sk_buff *skb;
  1070. va_list args2;
  1071. if (!ab)
  1072. return;
  1073. BUG_ON(!ab->skb);
  1074. skb = ab->skb;
  1075. avail = skb_tailroom(skb);
  1076. if (avail == 0) {
  1077. avail = audit_expand(ab, AUDIT_BUFSIZ);
  1078. if (!avail)
  1079. goto out;
  1080. }
  1081. va_copy(args2, args);
  1082. len = vsnprintf(skb_tail_pointer(skb), avail, fmt, args);
  1083. if (len >= avail) {
  1084. /* The printk buffer is 1024 bytes long, so if we get
  1085. * here and AUDIT_BUFSIZ is at least 1024, then we can
  1086. * log everything that printk could have logged. */
  1087. avail = audit_expand(ab,
  1088. max_t(unsigned, AUDIT_BUFSIZ, 1+len-avail));
  1089. if (!avail)
  1090. goto out_va_end;
  1091. len = vsnprintf(skb_tail_pointer(skb), avail, fmt, args2);
  1092. }
  1093. if (len > 0)
  1094. skb_put(skb, len);
  1095. out_va_end:
  1096. va_end(args2);
  1097. out:
  1098. return;
  1099. }
  1100. /**
  1101. * audit_log_format - format a message into the audit buffer.
  1102. * @ab: audit_buffer
  1103. * @fmt: format string
  1104. * @...: optional parameters matching @fmt string
  1105. *
  1106. * All the work is done in audit_log_vformat.
  1107. */
  1108. void audit_log_format(struct audit_buffer *ab, const char *fmt, ...)
  1109. {
  1110. va_list args;
  1111. if (!ab)
  1112. return;
  1113. va_start(args, fmt);
  1114. audit_log_vformat(ab, fmt, args);
  1115. va_end(args);
  1116. }
  1117. /**
  1118. * audit_log_hex - convert a buffer to hex and append it to the audit skb
  1119. * @ab: the audit_buffer
  1120. * @buf: buffer to convert to hex
  1121. * @len: length of @buf to be converted
  1122. *
  1123. * No return value; failure to expand is silently ignored.
  1124. *
  1125. * This function will take the passed buf and convert it into a string of
  1126. * ascii hex digits. The new string is placed onto the skb.
  1127. */
  1128. void audit_log_n_hex(struct audit_buffer *ab, const unsigned char *buf,
  1129. size_t len)
  1130. {
  1131. int i, avail, new_len;
  1132. unsigned char *ptr;
  1133. struct sk_buff *skb;
  1134. static const unsigned char *hex = "0123456789ABCDEF";
  1135. if (!ab)
  1136. return;
  1137. BUG_ON(!ab->skb);
  1138. skb = ab->skb;
  1139. avail = skb_tailroom(skb);
  1140. new_len = len<<1;
  1141. if (new_len >= avail) {
  1142. /* Round the buffer request up to the next multiple */
  1143. new_len = AUDIT_BUFSIZ*(((new_len-avail)/AUDIT_BUFSIZ) + 1);
  1144. avail = audit_expand(ab, new_len);
  1145. if (!avail)
  1146. return;
  1147. }
  1148. ptr = skb_tail_pointer(skb);
  1149. for (i=0; i<len; i++) {
  1150. *ptr++ = hex[(buf[i] & 0xF0)>>4]; /* Upper nibble */
  1151. *ptr++ = hex[buf[i] & 0x0F]; /* Lower nibble */
  1152. }
  1153. *ptr = 0;
  1154. skb_put(skb, len << 1); /* new string is twice the old string */
  1155. }
  1156. /*
  1157. * Format a string of no more than slen characters into the audit buffer,
  1158. * enclosed in quote marks.
  1159. */
  1160. void audit_log_n_string(struct audit_buffer *ab, const char *string,
  1161. size_t slen)
  1162. {
  1163. int avail, new_len;
  1164. unsigned char *ptr;
  1165. struct sk_buff *skb;
  1166. if (!ab)
  1167. return;
  1168. BUG_ON(!ab->skb);
  1169. skb = ab->skb;
  1170. avail = skb_tailroom(skb);
  1171. new_len = slen + 3; /* enclosing quotes + null terminator */
  1172. if (new_len > avail) {
  1173. avail = audit_expand(ab, new_len);
  1174. if (!avail)
  1175. return;
  1176. }
  1177. ptr = skb_tail_pointer(skb);
  1178. *ptr++ = '"';
  1179. memcpy(ptr, string, slen);
  1180. ptr += slen;
  1181. *ptr++ = '"';
  1182. *ptr = 0;
  1183. skb_put(skb, slen + 2); /* don't include null terminator */
  1184. }
  1185. /**
  1186. * audit_string_contains_control - does a string need to be logged in hex
  1187. * @string: string to be checked
  1188. * @len: max length of the string to check
  1189. */
  1190. int audit_string_contains_control(const char *string, size_t len)
  1191. {
  1192. const unsigned char *p;
  1193. for (p = string; p < (const unsigned char *)string + len; p++) {
  1194. if (*p == '"' || *p < 0x21 || *p > 0x7e)
  1195. return 1;
  1196. }
  1197. return 0;
  1198. }
  1199. /**
  1200. * audit_log_n_untrustedstring - log a string that may contain random characters
  1201. * @ab: audit_buffer
  1202. * @len: length of string (not including trailing null)
  1203. * @string: string to be logged
  1204. *
  1205. * This code will escape a string that is passed to it if the string
  1206. * contains a control character, unprintable character, double quote mark,
  1207. * or a space. Unescaped strings will start and end with a double quote mark.
  1208. * Strings that are escaped are printed in hex (2 digits per char).
  1209. *
  1210. * The caller specifies the number of characters in the string to log, which may
  1211. * or may not be the entire string.
  1212. */
  1213. void audit_log_n_untrustedstring(struct audit_buffer *ab, const char *string,
  1214. size_t len)
  1215. {
  1216. if (audit_string_contains_control(string, len))
  1217. audit_log_n_hex(ab, string, len);
  1218. else
  1219. audit_log_n_string(ab, string, len);
  1220. }
  1221. /**
  1222. * audit_log_untrustedstring - log a string that may contain random characters
  1223. * @ab: audit_buffer
  1224. * @string: string to be logged
  1225. *
  1226. * Same as audit_log_n_untrustedstring(), except that strlen is used to
  1227. * determine string length.
  1228. */
  1229. void audit_log_untrustedstring(struct audit_buffer *ab, const char *string)
  1230. {
  1231. audit_log_n_untrustedstring(ab, string, strlen(string));
  1232. }
  1233. /* This is a helper-function to print the escaped d_path */
  1234. void audit_log_d_path(struct audit_buffer *ab, const char *prefix,
  1235. const struct path *path)
  1236. {
  1237. char *p, *pathname;
  1238. if (prefix)
  1239. audit_log_format(ab, "%s", prefix);
  1240. /* We will allow 11 spaces for ' (deleted)' to be appended */
  1241. pathname = kmalloc(PATH_MAX+11, ab->gfp_mask);
  1242. if (!pathname) {
  1243. audit_log_string(ab, "<no_memory>");
  1244. return;
  1245. }
  1246. p = d_path(path, pathname, PATH_MAX+11);
  1247. if (IS_ERR(p)) { /* Should never happen since we send PATH_MAX */
  1248. /* FIXME: can we save some information here? */
  1249. audit_log_string(ab, "<too_long>");
  1250. } else
  1251. audit_log_untrustedstring(ab, p);
  1252. kfree(pathname);
  1253. }
  1254. void audit_log_key(struct audit_buffer *ab, char *key)
  1255. {
  1256. audit_log_format(ab, " key=");
  1257. if (key)
  1258. audit_log_untrustedstring(ab, key);
  1259. else
  1260. audit_log_format(ab, "(null)");
  1261. }
  1262. /**
  1263. * audit_log_link_denied - report a link restriction denial
  1264. * @operation: specific link opreation
  1265. * @link: the path that triggered the restriction
  1266. */
  1267. void audit_log_link_denied(const char *operation, struct path *link)
  1268. {
  1269. struct audit_buffer *ab;
  1270. ab = audit_log_start(current->audit_context, GFP_KERNEL,
  1271. AUDIT_ANOM_LINK);
  1272. if (!ab)
  1273. return;
  1274. audit_log_format(ab, "op=%s action=denied", operation);
  1275. audit_log_format(ab, " pid=%d comm=", current->pid);
  1276. audit_log_untrustedstring(ab, current->comm);
  1277. audit_log_d_path(ab, " path=", link);
  1278. audit_log_format(ab, " dev=");
  1279. audit_log_untrustedstring(ab, link->dentry->d_inode->i_sb->s_id);
  1280. audit_log_format(ab, " ino=%lu", link->dentry->d_inode->i_ino);
  1281. audit_log_end(ab);
  1282. }
  1283. /**
  1284. * audit_log_end - end one audit record
  1285. * @ab: the audit_buffer
  1286. *
  1287. * The netlink_* functions cannot be called inside an irq context, so
  1288. * the audit buffer is placed on a queue and a tasklet is scheduled to
  1289. * remove them from the queue outside the irq context. May be called in
  1290. * any context.
  1291. */
  1292. void audit_log_end(struct audit_buffer *ab)
  1293. {
  1294. if (!ab)
  1295. return;
  1296. if (!audit_rate_check()) {
  1297. audit_log_lost("rate limit exceeded");
  1298. } else {
  1299. struct nlmsghdr *nlh = nlmsg_hdr(ab->skb);
  1300. nlh->nlmsg_len = ab->skb->len - NLMSG_SPACE(0);
  1301. if (audit_pid) {
  1302. skb_queue_tail(&audit_skb_queue, ab->skb);
  1303. wake_up_interruptible(&kauditd_wait);
  1304. } else {
  1305. audit_printk_skb(ab->skb);
  1306. }
  1307. ab->skb = NULL;
  1308. }
  1309. audit_buffer_free(ab);
  1310. }
  1311. /**
  1312. * audit_log - Log an audit record
  1313. * @ctx: audit context
  1314. * @gfp_mask: type of allocation
  1315. * @type: audit message type
  1316. * @fmt: format string to use
  1317. * @...: variable parameters matching the format string
  1318. *
  1319. * This is a convenience function that calls audit_log_start,
  1320. * audit_log_vformat, and audit_log_end. It may be called
  1321. * in any context.
  1322. */
  1323. void audit_log(struct audit_context *ctx, gfp_t gfp_mask, int type,
  1324. const char *fmt, ...)
  1325. {
  1326. struct audit_buffer *ab;
  1327. va_list args;
  1328. ab = audit_log_start(ctx, gfp_mask, type);
  1329. if (ab) {
  1330. va_start(args, fmt);
  1331. audit_log_vformat(ab, fmt, args);
  1332. va_end(args);
  1333. audit_log_end(ab);
  1334. }
  1335. }
  1336. #ifdef CONFIG_SECURITY
  1337. /**
  1338. * audit_log_secctx - Converts and logs SELinux context
  1339. * @ab: audit_buffer
  1340. * @secid: security number
  1341. *
  1342. * This is a helper function that calls security_secid_to_secctx to convert
  1343. * secid to secctx and then adds the (converted) SELinux context to the audit
  1344. * log by calling audit_log_format, thus also preventing leak of internal secid
  1345. * to userspace. If secid cannot be converted audit_panic is called.
  1346. */
  1347. void audit_log_secctx(struct audit_buffer *ab, u32 secid)
  1348. {
  1349. u32 len;
  1350. char *secctx;
  1351. if (security_secid_to_secctx(secid, &secctx, &len)) {
  1352. audit_panic("Cannot convert secid to context");
  1353. } else {
  1354. audit_log_format(ab, " obj=%s", secctx);
  1355. security_release_secctx(secctx, len);
  1356. }
  1357. }
  1358. EXPORT_SYMBOL(audit_log_secctx);
  1359. #endif
  1360. EXPORT_SYMBOL(audit_log_start);
  1361. EXPORT_SYMBOL(audit_log_end);
  1362. EXPORT_SYMBOL(audit_log_format);
  1363. EXPORT_SYMBOL(audit_log);