audit.c 53 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046
  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. #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
  44. #include <linux/init.h>
  45. #include <linux/types.h>
  46. #include <linux/atomic.h>
  47. #include <linux/mm.h>
  48. #include <linux/export.h>
  49. #include <linux/slab.h>
  50. #include <linux/err.h>
  51. #include <linux/kthread.h>
  52. #include <linux/kernel.h>
  53. #include <linux/syscalls.h>
  54. #include <linux/audit.h>
  55. #include <net/sock.h>
  56. #include <net/netlink.h>
  57. #include <linux/skbuff.h>
  58. #ifdef CONFIG_SECURITY
  59. #include <linux/security.h>
  60. #endif
  61. #include <linux/freezer.h>
  62. #include <linux/tty.h>
  63. #include <linux/pid_namespace.h>
  64. #include <net/netns/generic.h>
  65. #include "audit.h"
  66. /* No auditing will take place until audit_initialized == AUDIT_INITIALIZED.
  67. * (Initialization happens after skb_init is called.) */
  68. #define AUDIT_DISABLED -1
  69. #define AUDIT_UNINITIALIZED 0
  70. #define AUDIT_INITIALIZED 1
  71. static int audit_initialized;
  72. #define AUDIT_OFF 0
  73. #define AUDIT_ON 1
  74. #define AUDIT_LOCKED 2
  75. u32 audit_enabled;
  76. u32 audit_ever_enabled;
  77. EXPORT_SYMBOL_GPL(audit_enabled);
  78. /* Default state when kernel boots without any parameters. */
  79. static u32 audit_default;
  80. /* If auditing cannot proceed, audit_failure selects what happens. */
  81. static u32 audit_failure = AUDIT_FAIL_PRINTK;
  82. /*
  83. * If audit records are to be written to the netlink socket, audit_pid
  84. * contains the pid of the auditd process and audit_nlk_portid contains
  85. * the portid to use to send netlink messages to that process.
  86. */
  87. int audit_pid;
  88. static __u32 audit_nlk_portid;
  89. /* If audit_rate_limit is non-zero, limit the rate of sending audit records
  90. * to that number per second. This prevents DoS attacks, but results in
  91. * audit records being dropped. */
  92. static u32 audit_rate_limit;
  93. /* Number of outstanding audit_buffers allowed.
  94. * When set to zero, this means unlimited. */
  95. static u32 audit_backlog_limit = 64;
  96. #define AUDIT_BACKLOG_WAIT_TIME (60 * HZ)
  97. static u32 audit_backlog_wait_time = AUDIT_BACKLOG_WAIT_TIME;
  98. static u32 audit_backlog_wait_overflow = 0;
  99. /* The identity of the user shutting down the audit system. */
  100. kuid_t audit_sig_uid = INVALID_UID;
  101. pid_t audit_sig_pid = -1;
  102. u32 audit_sig_sid = 0;
  103. /* Records can be lost in several ways:
  104. 0) [suppressed in audit_alloc]
  105. 1) out of memory in audit_log_start [kmalloc of struct audit_buffer]
  106. 2) out of memory in audit_log_move [alloc_skb]
  107. 3) suppressed due to audit_rate_limit
  108. 4) suppressed due to audit_backlog_limit
  109. */
  110. static atomic_t audit_lost = ATOMIC_INIT(0);
  111. /* The netlink socket. */
  112. static struct sock *audit_sock;
  113. static int audit_net_id;
  114. /* Hash for inode-based rules */
  115. struct list_head audit_inode_hash[AUDIT_INODE_BUCKETS];
  116. /* The audit_freelist is a list of pre-allocated audit buffers (if more
  117. * than AUDIT_MAXFREE are in use, the audit buffer is freed instead of
  118. * being placed on the freelist). */
  119. static DEFINE_SPINLOCK(audit_freelist_lock);
  120. static int audit_freelist_count;
  121. static LIST_HEAD(audit_freelist);
  122. static struct sk_buff_head audit_skb_queue;
  123. /* queue of skbs to send to auditd when/if it comes back */
  124. static struct sk_buff_head audit_skb_hold_queue;
  125. static struct task_struct *kauditd_task;
  126. static DECLARE_WAIT_QUEUE_HEAD(kauditd_wait);
  127. static DECLARE_WAIT_QUEUE_HEAD(audit_backlog_wait);
  128. static struct audit_features af = {.vers = AUDIT_FEATURE_VERSION,
  129. .mask = -1,
  130. .features = 0,
  131. .lock = 0,};
  132. static char *audit_feature_names[2] = {
  133. "only_unset_loginuid",
  134. "loginuid_immutable",
  135. };
  136. /* Serialize requests from userspace. */
  137. DEFINE_MUTEX(audit_cmd_mutex);
  138. /* AUDIT_BUFSIZ is the size of the temporary buffer used for formatting
  139. * audit records. Since printk uses a 1024 byte buffer, this buffer
  140. * should be at least that large. */
  141. #define AUDIT_BUFSIZ 1024
  142. /* AUDIT_MAXFREE is the number of empty audit_buffers we keep on the
  143. * audit_freelist. Doing so eliminates many kmalloc/kfree calls. */
  144. #define AUDIT_MAXFREE (2*NR_CPUS)
  145. /* The audit_buffer is used when formatting an audit record. The caller
  146. * locks briefly to get the record off the freelist or to allocate the
  147. * buffer, and locks briefly to send the buffer to the netlink layer or
  148. * to place it on a transmit queue. Multiple audit_buffers can be in
  149. * use simultaneously. */
  150. struct audit_buffer {
  151. struct list_head list;
  152. struct sk_buff *skb; /* formatted skb ready to send */
  153. struct audit_context *ctx; /* NULL or associated context */
  154. gfp_t gfp_mask;
  155. };
  156. struct audit_reply {
  157. __u32 portid;
  158. struct net *net;
  159. struct sk_buff *skb;
  160. };
  161. static void audit_set_portid(struct audit_buffer *ab, __u32 portid)
  162. {
  163. if (ab) {
  164. struct nlmsghdr *nlh = nlmsg_hdr(ab->skb);
  165. nlh->nlmsg_pid = portid;
  166. }
  167. }
  168. void audit_panic(const char *message)
  169. {
  170. switch (audit_failure) {
  171. case AUDIT_FAIL_SILENT:
  172. break;
  173. case AUDIT_FAIL_PRINTK:
  174. if (printk_ratelimit())
  175. pr_err("%s\n", message);
  176. break;
  177. case AUDIT_FAIL_PANIC:
  178. /* test audit_pid since printk is always losey, why bother? */
  179. if (audit_pid)
  180. panic("audit: %s\n", message);
  181. break;
  182. }
  183. }
  184. static inline int audit_rate_check(void)
  185. {
  186. static unsigned long last_check = 0;
  187. static int messages = 0;
  188. static DEFINE_SPINLOCK(lock);
  189. unsigned long flags;
  190. unsigned long now;
  191. unsigned long elapsed;
  192. int retval = 0;
  193. if (!audit_rate_limit) return 1;
  194. spin_lock_irqsave(&lock, flags);
  195. if (++messages < audit_rate_limit) {
  196. retval = 1;
  197. } else {
  198. now = jiffies;
  199. elapsed = now - last_check;
  200. if (elapsed > HZ) {
  201. last_check = now;
  202. messages = 0;
  203. retval = 1;
  204. }
  205. }
  206. spin_unlock_irqrestore(&lock, flags);
  207. return retval;
  208. }
  209. /**
  210. * audit_log_lost - conditionally log lost audit message event
  211. * @message: the message stating reason for lost audit message
  212. *
  213. * Emit at least 1 message per second, even if audit_rate_check is
  214. * throttling.
  215. * Always increment the lost messages counter.
  216. */
  217. void audit_log_lost(const char *message)
  218. {
  219. static unsigned long last_msg = 0;
  220. static DEFINE_SPINLOCK(lock);
  221. unsigned long flags;
  222. unsigned long now;
  223. int print;
  224. atomic_inc(&audit_lost);
  225. print = (audit_failure == AUDIT_FAIL_PANIC || !audit_rate_limit);
  226. if (!print) {
  227. spin_lock_irqsave(&lock, flags);
  228. now = jiffies;
  229. if (now - last_msg > HZ) {
  230. print = 1;
  231. last_msg = now;
  232. }
  233. spin_unlock_irqrestore(&lock, flags);
  234. }
  235. if (print) {
  236. if (printk_ratelimit())
  237. pr_warn("audit_lost=%u audit_rate_limit=%u audit_backlog_limit=%u\n",
  238. atomic_read(&audit_lost),
  239. audit_rate_limit,
  240. audit_backlog_limit);
  241. audit_panic(message);
  242. }
  243. }
  244. static int audit_log_config_change(char *function_name, u32 new, u32 old,
  245. int allow_changes)
  246. {
  247. struct audit_buffer *ab;
  248. int rc = 0;
  249. ab = audit_log_start(NULL, GFP_KERNEL, AUDIT_CONFIG_CHANGE);
  250. if (unlikely(!ab))
  251. return rc;
  252. audit_log_format(ab, "%s=%u old=%u", function_name, new, old);
  253. audit_log_session_info(ab);
  254. rc = audit_log_task_context(ab);
  255. if (rc)
  256. allow_changes = 0; /* Something weird, deny request */
  257. audit_log_format(ab, " res=%d", allow_changes);
  258. audit_log_end(ab);
  259. return rc;
  260. }
  261. static int audit_do_config_change(char *function_name, u32 *to_change, u32 new)
  262. {
  263. int allow_changes, rc = 0;
  264. u32 old = *to_change;
  265. /* check if we are locked */
  266. if (audit_enabled == AUDIT_LOCKED)
  267. allow_changes = 0;
  268. else
  269. allow_changes = 1;
  270. if (audit_enabled != AUDIT_OFF) {
  271. rc = audit_log_config_change(function_name, new, old, 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(u32 limit)
  284. {
  285. return audit_do_config_change("audit_rate_limit", &audit_rate_limit, limit);
  286. }
  287. static int audit_set_backlog_limit(u32 limit)
  288. {
  289. return audit_do_config_change("audit_backlog_limit", &audit_backlog_limit, limit);
  290. }
  291. static int audit_set_backlog_wait_time(u32 timeout)
  292. {
  293. return audit_do_config_change("audit_backlog_wait_time",
  294. &audit_backlog_wait_time, timeout);
  295. }
  296. static int audit_set_enabled(u32 state)
  297. {
  298. int rc;
  299. if (state < AUDIT_OFF || state > AUDIT_LOCKED)
  300. return -EINVAL;
  301. rc = audit_do_config_change("audit_enabled", &audit_enabled, state);
  302. if (!rc)
  303. audit_ever_enabled |= !!state;
  304. return rc;
  305. }
  306. static int audit_set_failure(u32 state)
  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. }
  314. /*
  315. * Queue skbs to be sent to auditd when/if it comes back. These skbs should
  316. * already have been sent via prink/syslog and so if these messages are dropped
  317. * it is not a huge concern since we already passed the audit_log_lost()
  318. * notification and stuff. This is just nice to get audit messages during
  319. * boot before auditd is running or messages generated while auditd is stopped.
  320. * This only holds messages is audit_default is set, aka booting with audit=1
  321. * or building your kernel that way.
  322. */
  323. static void audit_hold_skb(struct sk_buff *skb)
  324. {
  325. if (audit_default &&
  326. (!audit_backlog_limit ||
  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. pr_notice("type=%d %s\n", nlh->nlmsg_type, data);
  343. else
  344. audit_log_lost("printk limit exceeded");
  345. }
  346. audit_hold_skb(skb);
  347. }
  348. #ifdef CONFIG_MTK_AEE_FEATURE
  349. /*
  350. * return skb field of audit buffer
  351. */
  352. struct sk_buff *audit_get_skb(struct audit_buffer *ab)
  353. {
  354. if (ab)
  355. return (struct sk_buff *)(ab->skb);
  356. else
  357. return NULL;
  358. }
  359. #endif
  360. static void kauditd_send_skb(struct sk_buff *skb)
  361. {
  362. int err;
  363. /* take a reference in case we can't send it and we want to hold it */
  364. skb_get(skb);
  365. err = netlink_unicast(audit_sock, skb, audit_nlk_portid, 0);
  366. if (err < 0) {
  367. BUG_ON(err != -ECONNREFUSED); /* Shouldn't happen */
  368. if (audit_pid) {
  369. pr_err("*NO* daemon at audit_pid=%d\n", audit_pid);
  370. audit_log_lost("auditd disappeared");
  371. audit_pid = 0;
  372. audit_sock = NULL;
  373. }
  374. /* we might get lucky and get this in the next auditd */
  375. audit_hold_skb(skb);
  376. } else
  377. /* drop the extra reference if sent ok */
  378. consume_skb(skb);
  379. }
  380. /*
  381. * kauditd_send_multicast_skb - send the skb to multicast userspace listeners
  382. *
  383. * This function doesn't consume an skb as might be expected since it has to
  384. * copy it anyways.
  385. */
  386. static void kauditd_send_multicast_skb(struct sk_buff *skb, gfp_t gfp_mask)
  387. {
  388. struct sk_buff *copy;
  389. struct audit_net *aunet = net_generic(&init_net, audit_net_id);
  390. struct sock *sock = aunet->nlsk;
  391. if (!netlink_has_listeners(sock, AUDIT_NLGRP_READLOG))
  392. return;
  393. /*
  394. * The seemingly wasteful skb_copy() rather than bumping the refcount
  395. * using skb_get() is necessary because non-standard mods are made to
  396. * the skb by the original kaudit unicast socket send routine. The
  397. * existing auditd daemon assumes this breakage. Fixing this would
  398. * require co-ordinating a change in the established protocol between
  399. * the kaudit kernel subsystem and the auditd userspace code. There is
  400. * no reason for new multicast clients to continue with this
  401. * non-compliance.
  402. */
  403. copy = skb_copy(skb, gfp_mask);
  404. if (!copy)
  405. return;
  406. nlmsg_multicast(sock, copy, 0, AUDIT_NLGRP_READLOG, gfp_mask);
  407. }
  408. /*
  409. * flush_hold_queue - empty the hold queue if auditd appears
  410. *
  411. * If auditd just started, drain the queue of messages already
  412. * sent to syslog/printk. Remember loss here is ok. We already
  413. * called audit_log_lost() if it didn't go out normally. so the
  414. * race between the skb_dequeue and the next check for audit_pid
  415. * doesn't matter.
  416. *
  417. * If you ever find kauditd to be too slow we can get a perf win
  418. * by doing our own locking and keeping better track if there
  419. * are messages in this queue. I don't see the need now, but
  420. * in 5 years when I want to play with this again I'll see this
  421. * note and still have no friggin idea what i'm thinking today.
  422. */
  423. static void flush_hold_queue(void)
  424. {
  425. struct sk_buff *skb;
  426. if (!audit_default || !audit_pid)
  427. return;
  428. skb = skb_dequeue(&audit_skb_hold_queue);
  429. if (likely(!skb))
  430. return;
  431. while (skb && audit_pid) {
  432. kauditd_send_skb(skb);
  433. skb = skb_dequeue(&audit_skb_hold_queue);
  434. }
  435. /*
  436. * if auditd just disappeared but we
  437. * dequeued an skb we need to drop ref
  438. */
  439. if (skb)
  440. consume_skb(skb);
  441. }
  442. static int kauditd_thread(void *dummy)
  443. {
  444. set_freezable();
  445. while (!kthread_should_stop()) {
  446. struct sk_buff *skb;
  447. DECLARE_WAITQUEUE(wait, current);
  448. flush_hold_queue();
  449. skb = skb_dequeue(&audit_skb_queue);
  450. if (skb) {
  451. if (skb_queue_len(&audit_skb_queue) <= audit_backlog_limit)
  452. wake_up(&audit_backlog_wait);
  453. if (audit_pid)
  454. kauditd_send_skb(skb);
  455. else
  456. audit_printk_skb(skb);
  457. continue;
  458. }
  459. set_current_state(TASK_INTERRUPTIBLE);
  460. add_wait_queue(&kauditd_wait, &wait);
  461. if (!skb_queue_len(&audit_skb_queue)) {
  462. try_to_freeze();
  463. schedule();
  464. }
  465. __set_current_state(TASK_RUNNING);
  466. remove_wait_queue(&kauditd_wait, &wait);
  467. }
  468. return 0;
  469. }
  470. int audit_send_list(void *_dest)
  471. {
  472. struct audit_netlink_list *dest = _dest;
  473. struct sk_buff *skb;
  474. struct net *net = dest->net;
  475. struct audit_net *aunet = net_generic(net, audit_net_id);
  476. /* wait for parent to finish and send an ACK */
  477. mutex_lock(&audit_cmd_mutex);
  478. mutex_unlock(&audit_cmd_mutex);
  479. while ((skb = __skb_dequeue(&dest->q)) != NULL)
  480. netlink_unicast(aunet->nlsk, skb, dest->portid, 0);
  481. put_net(net);
  482. kfree(dest);
  483. return 0;
  484. }
  485. struct sk_buff *audit_make_reply(__u32 portid, int seq, int type, int done,
  486. int multi, const void *payload, int size)
  487. {
  488. struct sk_buff *skb;
  489. struct nlmsghdr *nlh;
  490. void *data;
  491. int flags = multi ? NLM_F_MULTI : 0;
  492. int t = done ? NLMSG_DONE : type;
  493. skb = nlmsg_new(size, GFP_KERNEL);
  494. if (!skb)
  495. return NULL;
  496. nlh = nlmsg_put(skb, portid, seq, t, size, flags);
  497. if (!nlh)
  498. goto out_kfree_skb;
  499. data = nlmsg_data(nlh);
  500. memcpy(data, payload, size);
  501. return skb;
  502. out_kfree_skb:
  503. kfree_skb(skb);
  504. return NULL;
  505. }
  506. static int audit_send_reply_thread(void *arg)
  507. {
  508. struct audit_reply *reply = (struct audit_reply *)arg;
  509. struct net *net = reply->net;
  510. struct audit_net *aunet = net_generic(net, audit_net_id);
  511. mutex_lock(&audit_cmd_mutex);
  512. mutex_unlock(&audit_cmd_mutex);
  513. /* Ignore failure. It'll only happen if the sender goes away,
  514. because our timeout is set to infinite. */
  515. netlink_unicast(aunet->nlsk , reply->skb, reply->portid, 0);
  516. put_net(net);
  517. kfree(reply);
  518. return 0;
  519. }
  520. /**
  521. * audit_send_reply - send an audit reply message via netlink
  522. * @request_skb: skb of request we are replying to (used to target the reply)
  523. * @seq: sequence number
  524. * @type: audit message type
  525. * @done: done (last) flag
  526. * @multi: multi-part message flag
  527. * @payload: payload data
  528. * @size: payload size
  529. *
  530. * Allocates an skb, builds the netlink message, and sends it to the port id.
  531. * No failure notifications.
  532. */
  533. static void audit_send_reply(struct sk_buff *request_skb, int seq, int type, int done,
  534. int multi, const void *payload, int size)
  535. {
  536. u32 portid = NETLINK_CB(request_skb).portid;
  537. struct net *net = sock_net(NETLINK_CB(request_skb).sk);
  538. struct sk_buff *skb;
  539. struct task_struct *tsk;
  540. struct audit_reply *reply = kmalloc(sizeof(struct audit_reply),
  541. GFP_KERNEL);
  542. if (!reply)
  543. return;
  544. skb = audit_make_reply(portid, seq, type, done, multi, payload, size);
  545. if (!skb)
  546. goto out;
  547. reply->net = get_net(net);
  548. reply->portid = portid;
  549. reply->skb = skb;
  550. tsk = kthread_run(audit_send_reply_thread, reply, "audit_send_reply");
  551. if (!IS_ERR(tsk))
  552. return;
  553. kfree_skb(skb);
  554. out:
  555. kfree(reply);
  556. }
  557. /*
  558. * Check for appropriate CAP_AUDIT_ capabilities on incoming audit
  559. * control messages.
  560. */
  561. static int audit_netlink_ok(struct sk_buff *skb, u16 msg_type)
  562. {
  563. int err = 0;
  564. /* Only support initial user namespace for now. */
  565. /*
  566. * We return ECONNREFUSED because it tricks userspace into thinking
  567. * that audit was not configured into the kernel. Lots of users
  568. * configure their PAM stack (because that's what the distro does)
  569. * to reject login if unable to send messages to audit. If we return
  570. * ECONNREFUSED the PAM stack thinks the kernel does not have audit
  571. * configured in and will let login proceed. If we return EPERM
  572. * userspace will reject all logins. This should be removed when we
  573. * support non init namespaces!!
  574. */
  575. if (current_user_ns() != &init_user_ns)
  576. return -ECONNREFUSED;
  577. switch (msg_type) {
  578. case AUDIT_LIST:
  579. case AUDIT_ADD:
  580. case AUDIT_DEL:
  581. return -EOPNOTSUPP;
  582. case AUDIT_GET:
  583. case AUDIT_SET:
  584. case AUDIT_GET_FEATURE:
  585. case AUDIT_SET_FEATURE:
  586. case AUDIT_LIST_RULES:
  587. case AUDIT_ADD_RULE:
  588. case AUDIT_DEL_RULE:
  589. case AUDIT_SIGNAL_INFO:
  590. case AUDIT_TTY_GET:
  591. case AUDIT_TTY_SET:
  592. case AUDIT_TRIM:
  593. case AUDIT_MAKE_EQUIV:
  594. /* Only support auditd and auditctl in initial pid namespace
  595. * for now. */
  596. if ((task_active_pid_ns(current) != &init_pid_ns))
  597. return -EPERM;
  598. if (!netlink_capable(skb, CAP_AUDIT_CONTROL))
  599. err = -EPERM;
  600. break;
  601. case AUDIT_USER:
  602. case AUDIT_FIRST_USER_MSG ... AUDIT_LAST_USER_MSG:
  603. case AUDIT_FIRST_USER_MSG2 ... AUDIT_LAST_USER_MSG2:
  604. if (!netlink_capable(skb, CAP_AUDIT_WRITE))
  605. err = -EPERM;
  606. break;
  607. default: /* bad msg */
  608. err = -EINVAL;
  609. }
  610. return err;
  611. }
  612. static int audit_log_common_recv_msg(struct audit_buffer **ab, u16 msg_type)
  613. {
  614. int rc = 0;
  615. uid_t uid = from_kuid(&init_user_ns, current_uid());
  616. pid_t pid = task_tgid_nr(current);
  617. if (!audit_enabled && msg_type != AUDIT_USER_AVC) {
  618. *ab = NULL;
  619. return rc;
  620. }
  621. *ab = audit_log_start(NULL, GFP_KERNEL, msg_type);
  622. if (unlikely(!*ab))
  623. return rc;
  624. audit_log_format(*ab, "pid=%d uid=%u", pid, uid);
  625. audit_log_session_info(*ab);
  626. audit_log_task_context(*ab);
  627. return rc;
  628. }
  629. int is_audit_feature_set(int i)
  630. {
  631. return af.features & AUDIT_FEATURE_TO_MASK(i);
  632. }
  633. static int audit_get_feature(struct sk_buff *skb)
  634. {
  635. u32 seq;
  636. seq = nlmsg_hdr(skb)->nlmsg_seq;
  637. audit_send_reply(skb, seq, AUDIT_GET_FEATURE, 0, 0, &af, sizeof(af));
  638. return 0;
  639. }
  640. static void audit_log_feature_change(int which, u32 old_feature, u32 new_feature,
  641. u32 old_lock, u32 new_lock, int res)
  642. {
  643. struct audit_buffer *ab;
  644. if (audit_enabled == AUDIT_OFF)
  645. return;
  646. ab = audit_log_start(NULL, GFP_KERNEL, AUDIT_FEATURE_CHANGE);
  647. audit_log_task_info(ab, current);
  648. audit_log_format(ab, " feature=%s old=%u new=%u old_lock=%u new_lock=%u res=%d",
  649. audit_feature_names[which], !!old_feature, !!new_feature,
  650. !!old_lock, !!new_lock, res);
  651. audit_log_end(ab);
  652. }
  653. static int audit_set_feature(struct sk_buff *skb)
  654. {
  655. struct audit_features *uaf;
  656. int i;
  657. BUILD_BUG_ON(AUDIT_LAST_FEATURE + 1 > ARRAY_SIZE(audit_feature_names));
  658. uaf = nlmsg_data(nlmsg_hdr(skb));
  659. /* if there is ever a version 2 we should handle that here */
  660. for (i = 0; i <= AUDIT_LAST_FEATURE; i++) {
  661. u32 feature = AUDIT_FEATURE_TO_MASK(i);
  662. u32 old_feature, new_feature, old_lock, new_lock;
  663. /* if we are not changing this feature, move along */
  664. if (!(feature & uaf->mask))
  665. continue;
  666. old_feature = af.features & feature;
  667. new_feature = uaf->features & feature;
  668. new_lock = (uaf->lock | af.lock) & feature;
  669. old_lock = af.lock & feature;
  670. /* are we changing a locked feature? */
  671. if (old_lock && (new_feature != old_feature)) {
  672. audit_log_feature_change(i, old_feature, new_feature,
  673. old_lock, new_lock, 0);
  674. return -EPERM;
  675. }
  676. }
  677. /* nothing invalid, do the changes */
  678. for (i = 0; i <= AUDIT_LAST_FEATURE; i++) {
  679. u32 feature = AUDIT_FEATURE_TO_MASK(i);
  680. u32 old_feature, new_feature, old_lock, new_lock;
  681. /* if we are not changing this feature, move along */
  682. if (!(feature & uaf->mask))
  683. continue;
  684. old_feature = af.features & feature;
  685. new_feature = uaf->features & feature;
  686. old_lock = af.lock & feature;
  687. new_lock = (uaf->lock | af.lock) & feature;
  688. if (new_feature != old_feature)
  689. audit_log_feature_change(i, old_feature, new_feature,
  690. old_lock, new_lock, 1);
  691. if (new_feature)
  692. af.features |= feature;
  693. else
  694. af.features &= ~feature;
  695. af.lock |= new_lock;
  696. }
  697. return 0;
  698. }
  699. static int audit_receive_msg(struct sk_buff *skb, struct nlmsghdr *nlh)
  700. {
  701. u32 seq;
  702. void *data;
  703. int err;
  704. struct audit_buffer *ab;
  705. u16 msg_type = nlh->nlmsg_type;
  706. struct audit_sig_info *sig_data;
  707. char *ctx = NULL;
  708. u32 len;
  709. err = audit_netlink_ok(skb, msg_type);
  710. if (err)
  711. return err;
  712. /* As soon as there's any sign of userspace auditd,
  713. * start kauditd to talk to it */
  714. if (!kauditd_task) {
  715. kauditd_task = kthread_run(kauditd_thread, NULL, "kauditd");
  716. if (IS_ERR(kauditd_task)) {
  717. err = PTR_ERR(kauditd_task);
  718. kauditd_task = NULL;
  719. return err;
  720. }
  721. }
  722. seq = nlh->nlmsg_seq;
  723. data = nlmsg_data(nlh);
  724. switch (msg_type) {
  725. case AUDIT_GET: {
  726. struct audit_status s;
  727. memset(&s, 0, sizeof(s));
  728. s.enabled = audit_enabled;
  729. s.failure = audit_failure;
  730. s.pid = audit_pid;
  731. s.rate_limit = audit_rate_limit;
  732. s.backlog_limit = audit_backlog_limit;
  733. s.lost = atomic_read(&audit_lost);
  734. s.backlog = skb_queue_len(&audit_skb_queue);
  735. s.version = AUDIT_VERSION_LATEST;
  736. s.backlog_wait_time = audit_backlog_wait_time;
  737. audit_send_reply(skb, seq, AUDIT_GET, 0, 0, &s, sizeof(s));
  738. break;
  739. }
  740. case AUDIT_SET: {
  741. struct audit_status s;
  742. memset(&s, 0, sizeof(s));
  743. /* guard against past and future API changes */
  744. memcpy(&s, data, min_t(size_t, sizeof(s), nlmsg_len(nlh)));
  745. if (s.mask & AUDIT_STATUS_ENABLED) {
  746. err = audit_set_enabled(s.enabled);
  747. if (err < 0)
  748. return err;
  749. }
  750. if (s.mask & AUDIT_STATUS_FAILURE) {
  751. err = audit_set_failure(s.failure);
  752. if (err < 0)
  753. return err;
  754. }
  755. if (s.mask & AUDIT_STATUS_PID) {
  756. int new_pid = s.pid;
  757. if ((!new_pid) && (task_tgid_vnr(current) != audit_pid))
  758. return -EACCES;
  759. if (audit_enabled != AUDIT_OFF)
  760. audit_log_config_change("audit_pid", new_pid, audit_pid, 1);
  761. audit_pid = new_pid;
  762. audit_nlk_portid = NETLINK_CB(skb).portid;
  763. audit_sock = skb->sk;
  764. }
  765. if (s.mask & AUDIT_STATUS_RATE_LIMIT) {
  766. err = audit_set_rate_limit(s.rate_limit);
  767. if (err < 0)
  768. return err;
  769. }
  770. if (s.mask & AUDIT_STATUS_BACKLOG_LIMIT) {
  771. err = audit_set_backlog_limit(s.backlog_limit);
  772. if (err < 0)
  773. return err;
  774. }
  775. if (s.mask & AUDIT_STATUS_BACKLOG_WAIT_TIME) {
  776. if (sizeof(s) > (size_t)nlh->nlmsg_len)
  777. return -EINVAL;
  778. if (s.backlog_wait_time < 0 ||
  779. s.backlog_wait_time > 10*AUDIT_BACKLOG_WAIT_TIME)
  780. return -EINVAL;
  781. err = audit_set_backlog_wait_time(s.backlog_wait_time);
  782. if (err < 0)
  783. return err;
  784. }
  785. break;
  786. }
  787. case AUDIT_GET_FEATURE:
  788. err = audit_get_feature(skb);
  789. if (err)
  790. return err;
  791. break;
  792. case AUDIT_SET_FEATURE:
  793. err = audit_set_feature(skb);
  794. if (err)
  795. return err;
  796. break;
  797. case AUDIT_USER:
  798. case AUDIT_FIRST_USER_MSG ... AUDIT_LAST_USER_MSG:
  799. case AUDIT_FIRST_USER_MSG2 ... AUDIT_LAST_USER_MSG2:
  800. if (!audit_enabled && msg_type != AUDIT_USER_AVC)
  801. return 0;
  802. err = audit_filter_user(msg_type);
  803. if (err == 1) { /* match or error */
  804. err = 0;
  805. if (msg_type == AUDIT_USER_TTY) {
  806. err = tty_audit_push_current();
  807. if (err)
  808. break;
  809. }
  810. mutex_unlock(&audit_cmd_mutex);
  811. audit_log_common_recv_msg(&ab, msg_type);
  812. if (msg_type != AUDIT_USER_TTY)
  813. audit_log_format(ab, " msg='%.*s'",
  814. AUDIT_MESSAGE_TEXT_MAX,
  815. (char *)data);
  816. else {
  817. int size;
  818. audit_log_format(ab, " data=");
  819. size = nlmsg_len(nlh);
  820. if (size > 0 &&
  821. ((unsigned char *)data)[size - 1] == '\0')
  822. size--;
  823. audit_log_n_untrustedstring(ab, data, size);
  824. }
  825. audit_set_portid(ab, NETLINK_CB(skb).portid);
  826. audit_log_end(ab);
  827. mutex_lock(&audit_cmd_mutex);
  828. }
  829. break;
  830. case AUDIT_ADD_RULE:
  831. case AUDIT_DEL_RULE:
  832. if (nlmsg_len(nlh) < sizeof(struct audit_rule_data))
  833. return -EINVAL;
  834. if (audit_enabled == AUDIT_LOCKED) {
  835. audit_log_common_recv_msg(&ab, AUDIT_CONFIG_CHANGE);
  836. audit_log_format(ab, " audit_enabled=%d res=0", audit_enabled);
  837. audit_log_end(ab);
  838. return -EPERM;
  839. }
  840. err = audit_rule_change(msg_type, NETLINK_CB(skb).portid,
  841. seq, data, nlmsg_len(nlh));
  842. break;
  843. case AUDIT_LIST_RULES:
  844. err = audit_list_rules_send(skb, seq);
  845. break;
  846. case AUDIT_TRIM:
  847. audit_trim_trees();
  848. audit_log_common_recv_msg(&ab, AUDIT_CONFIG_CHANGE);
  849. audit_log_format(ab, " op=trim res=1");
  850. audit_log_end(ab);
  851. break;
  852. case AUDIT_MAKE_EQUIV: {
  853. void *bufp = data;
  854. u32 sizes[2];
  855. size_t msglen = nlmsg_len(nlh);
  856. char *old, *new;
  857. err = -EINVAL;
  858. if (msglen < 2 * sizeof(u32))
  859. break;
  860. memcpy(sizes, bufp, 2 * sizeof(u32));
  861. bufp += 2 * sizeof(u32);
  862. msglen -= 2 * sizeof(u32);
  863. old = audit_unpack_string(&bufp, &msglen, sizes[0]);
  864. if (IS_ERR(old)) {
  865. err = PTR_ERR(old);
  866. break;
  867. }
  868. new = audit_unpack_string(&bufp, &msglen, sizes[1]);
  869. if (IS_ERR(new)) {
  870. err = PTR_ERR(new);
  871. kfree(old);
  872. break;
  873. }
  874. /* OK, here comes... */
  875. err = audit_tag_tree(old, new);
  876. audit_log_common_recv_msg(&ab, AUDIT_CONFIG_CHANGE);
  877. audit_log_format(ab, " op=make_equiv old=");
  878. audit_log_untrustedstring(ab, old);
  879. audit_log_format(ab, " new=");
  880. audit_log_untrustedstring(ab, new);
  881. audit_log_format(ab, " res=%d", !err);
  882. audit_log_end(ab);
  883. kfree(old);
  884. kfree(new);
  885. break;
  886. }
  887. case AUDIT_SIGNAL_INFO:
  888. len = 0;
  889. if (audit_sig_sid) {
  890. err = security_secid_to_secctx(audit_sig_sid, &ctx, &len);
  891. if (err)
  892. return err;
  893. }
  894. sig_data = kmalloc(sizeof(*sig_data) + len, GFP_KERNEL);
  895. if (!sig_data) {
  896. if (audit_sig_sid)
  897. security_release_secctx(ctx, len);
  898. return -ENOMEM;
  899. }
  900. sig_data->uid = from_kuid(&init_user_ns, audit_sig_uid);
  901. sig_data->pid = audit_sig_pid;
  902. if (audit_sig_sid) {
  903. memcpy(sig_data->ctx, ctx, len);
  904. security_release_secctx(ctx, len);
  905. }
  906. audit_send_reply(skb, seq, AUDIT_SIGNAL_INFO, 0, 0,
  907. sig_data, sizeof(*sig_data) + len);
  908. kfree(sig_data);
  909. break;
  910. case AUDIT_TTY_GET: {
  911. struct audit_tty_status s;
  912. struct task_struct *tsk = current;
  913. spin_lock(&tsk->sighand->siglock);
  914. s.enabled = tsk->signal->audit_tty;
  915. s.log_passwd = tsk->signal->audit_tty_log_passwd;
  916. spin_unlock(&tsk->sighand->siglock);
  917. audit_send_reply(skb, seq, AUDIT_TTY_GET, 0, 0, &s, sizeof(s));
  918. break;
  919. }
  920. case AUDIT_TTY_SET: {
  921. struct audit_tty_status s, old;
  922. struct task_struct *tsk = current;
  923. struct audit_buffer *ab;
  924. memset(&s, 0, sizeof(s));
  925. /* guard against past and future API changes */
  926. memcpy(&s, data, min_t(size_t, sizeof(s), nlmsg_len(nlh)));
  927. /* check if new data is valid */
  928. if ((s.enabled != 0 && s.enabled != 1) ||
  929. (s.log_passwd != 0 && s.log_passwd != 1))
  930. err = -EINVAL;
  931. spin_lock(&tsk->sighand->siglock);
  932. old.enabled = tsk->signal->audit_tty;
  933. old.log_passwd = tsk->signal->audit_tty_log_passwd;
  934. if (!err) {
  935. tsk->signal->audit_tty = s.enabled;
  936. tsk->signal->audit_tty_log_passwd = s.log_passwd;
  937. }
  938. spin_unlock(&tsk->sighand->siglock);
  939. audit_log_common_recv_msg(&ab, AUDIT_CONFIG_CHANGE);
  940. audit_log_format(ab, " op=tty_set old-enabled=%d new-enabled=%d"
  941. " old-log_passwd=%d new-log_passwd=%d res=%d",
  942. old.enabled, s.enabled, old.log_passwd,
  943. s.log_passwd, !err);
  944. audit_log_end(ab);
  945. break;
  946. }
  947. default:
  948. err = -EINVAL;
  949. break;
  950. }
  951. return err < 0 ? err : 0;
  952. }
  953. /*
  954. * Get message from skb. Each message is processed by audit_receive_msg.
  955. * Malformed skbs with wrong length are discarded silently.
  956. */
  957. static void audit_receive_skb(struct sk_buff *skb)
  958. {
  959. struct nlmsghdr *nlh;
  960. /*
  961. * len MUST be signed for nlmsg_next to be able to dec it below 0
  962. * if the nlmsg_len was not aligned
  963. */
  964. int len;
  965. int err;
  966. nlh = nlmsg_hdr(skb);
  967. len = skb->len;
  968. while (nlmsg_ok(nlh, len)) {
  969. err = audit_receive_msg(skb, nlh);
  970. /* if err or if this message says it wants a response */
  971. if (err || (nlh->nlmsg_flags & NLM_F_ACK))
  972. netlink_ack(skb, nlh, err);
  973. nlh = nlmsg_next(nlh, &len);
  974. }
  975. }
  976. /* Receive messages from netlink socket. */
  977. static void audit_receive(struct sk_buff *skb)
  978. {
  979. mutex_lock(&audit_cmd_mutex);
  980. audit_receive_skb(skb);
  981. mutex_unlock(&audit_cmd_mutex);
  982. }
  983. /* Run custom bind function on netlink socket group connect or bind requests. */
  984. static int audit_bind(int group)
  985. {
  986. if (!capable(CAP_AUDIT_READ))
  987. return -EPERM;
  988. return 0;
  989. }
  990. static int __net_init audit_net_init(struct net *net)
  991. {
  992. struct netlink_kernel_cfg cfg = {
  993. .input = audit_receive,
  994. .bind = audit_bind,
  995. .flags = NL_CFG_F_NONROOT_RECV,
  996. .groups = AUDIT_NLGRP_MAX,
  997. };
  998. struct audit_net *aunet = net_generic(net, audit_net_id);
  999. aunet->nlsk = netlink_kernel_create(net, NETLINK_AUDIT, &cfg);
  1000. if (aunet->nlsk == NULL) {
  1001. audit_panic("cannot initialize netlink socket in namespace");
  1002. return -ENOMEM;
  1003. }
  1004. aunet->nlsk->sk_sndtimeo = MAX_SCHEDULE_TIMEOUT;
  1005. return 0;
  1006. }
  1007. static void __net_exit audit_net_exit(struct net *net)
  1008. {
  1009. struct audit_net *aunet = net_generic(net, audit_net_id);
  1010. struct sock *sock = aunet->nlsk;
  1011. if (sock == audit_sock) {
  1012. audit_pid = 0;
  1013. audit_sock = NULL;
  1014. }
  1015. RCU_INIT_POINTER(aunet->nlsk, NULL);
  1016. synchronize_net();
  1017. netlink_kernel_release(sock);
  1018. }
  1019. static struct pernet_operations audit_net_ops __net_initdata = {
  1020. .init = audit_net_init,
  1021. .exit = audit_net_exit,
  1022. .id = &audit_net_id,
  1023. .size = sizeof(struct audit_net),
  1024. };
  1025. /* Initialize audit support at boot time. */
  1026. static int __init audit_init(void)
  1027. {
  1028. int i;
  1029. if (audit_initialized == AUDIT_DISABLED)
  1030. return 0;
  1031. pr_info("initializing netlink subsys (%s)\n",
  1032. audit_default ? "enabled" : "disabled");
  1033. register_pernet_subsys(&audit_net_ops);
  1034. skb_queue_head_init(&audit_skb_queue);
  1035. skb_queue_head_init(&audit_skb_hold_queue);
  1036. audit_initialized = AUDIT_INITIALIZED;
  1037. audit_enabled = audit_default;
  1038. audit_ever_enabled |= !!audit_default;
  1039. audit_log(NULL, GFP_KERNEL, AUDIT_KERNEL, "initialized");
  1040. for (i = 0; i < AUDIT_INODE_BUCKETS; i++)
  1041. INIT_LIST_HEAD(&audit_inode_hash[i]);
  1042. return 0;
  1043. }
  1044. __initcall(audit_init);
  1045. /* Process kernel command-line parameter at boot time. audit=0 or audit=1. */
  1046. static int __init audit_enable(char *str)
  1047. {
  1048. audit_default = !!simple_strtol(str, NULL, 0);
  1049. if (!audit_default)
  1050. audit_initialized = AUDIT_DISABLED;
  1051. pr_info("%s\n", audit_default ?
  1052. "enabled (after initialization)" : "disabled (until reboot)");
  1053. return 1;
  1054. }
  1055. __setup("audit=", audit_enable);
  1056. /* Process kernel command-line parameter at boot time.
  1057. * audit_backlog_limit=<n> */
  1058. static int __init audit_backlog_limit_set(char *str)
  1059. {
  1060. u32 audit_backlog_limit_arg;
  1061. pr_info("audit_backlog_limit: ");
  1062. if (kstrtouint(str, 0, &audit_backlog_limit_arg)) {
  1063. pr_cont("using default of %u, unable to parse %s\n",
  1064. audit_backlog_limit, str);
  1065. return 1;
  1066. }
  1067. audit_backlog_limit = audit_backlog_limit_arg;
  1068. pr_cont("%d\n", audit_backlog_limit);
  1069. return 1;
  1070. }
  1071. __setup("audit_backlog_limit=", audit_backlog_limit_set);
  1072. static void audit_buffer_free(struct audit_buffer *ab)
  1073. {
  1074. unsigned long flags;
  1075. if (!ab)
  1076. return;
  1077. if (ab->skb)
  1078. kfree_skb(ab->skb);
  1079. spin_lock_irqsave(&audit_freelist_lock, flags);
  1080. if (audit_freelist_count > AUDIT_MAXFREE)
  1081. kfree(ab);
  1082. else {
  1083. audit_freelist_count++;
  1084. list_add(&ab->list, &audit_freelist);
  1085. }
  1086. spin_unlock_irqrestore(&audit_freelist_lock, flags);
  1087. }
  1088. static struct audit_buffer * audit_buffer_alloc(struct audit_context *ctx,
  1089. gfp_t gfp_mask, int type)
  1090. {
  1091. unsigned long flags;
  1092. struct audit_buffer *ab = NULL;
  1093. struct nlmsghdr *nlh;
  1094. spin_lock_irqsave(&audit_freelist_lock, flags);
  1095. if (!list_empty(&audit_freelist)) {
  1096. ab = list_entry(audit_freelist.next,
  1097. struct audit_buffer, list);
  1098. list_del(&ab->list);
  1099. --audit_freelist_count;
  1100. }
  1101. spin_unlock_irqrestore(&audit_freelist_lock, flags);
  1102. if (!ab) {
  1103. ab = kmalloc(sizeof(*ab), gfp_mask);
  1104. if (!ab)
  1105. goto err;
  1106. }
  1107. ab->ctx = ctx;
  1108. ab->gfp_mask = gfp_mask;
  1109. ab->skb = nlmsg_new(AUDIT_BUFSIZ, gfp_mask);
  1110. if (!ab->skb)
  1111. goto err;
  1112. nlh = nlmsg_put(ab->skb, 0, 0, type, 0, 0);
  1113. if (!nlh)
  1114. goto out_kfree_skb;
  1115. return ab;
  1116. out_kfree_skb:
  1117. kfree_skb(ab->skb);
  1118. ab->skb = NULL;
  1119. err:
  1120. audit_buffer_free(ab);
  1121. return NULL;
  1122. }
  1123. /**
  1124. * audit_serial - compute a serial number for the audit record
  1125. *
  1126. * Compute a serial number for the audit record. Audit records are
  1127. * written to user-space as soon as they are generated, so a complete
  1128. * audit record may be written in several pieces. The timestamp of the
  1129. * record and this serial number are used by the user-space tools to
  1130. * determine which pieces belong to the same audit record. The
  1131. * (timestamp,serial) tuple is unique for each syscall and is live from
  1132. * syscall entry to syscall exit.
  1133. *
  1134. * NOTE: Another possibility is to store the formatted records off the
  1135. * audit context (for those records that have a context), and emit them
  1136. * all at syscall exit. However, this could delay the reporting of
  1137. * significant errors until syscall exit (or never, if the system
  1138. * halts).
  1139. */
  1140. unsigned int audit_serial(void)
  1141. {
  1142. static atomic_t serial = ATOMIC_INIT(0);
  1143. return atomic_add_return(1, &serial);
  1144. }
  1145. static inline void audit_get_stamp(struct audit_context *ctx,
  1146. struct timespec *t, unsigned int *serial)
  1147. {
  1148. if (!ctx || !auditsc_get_stamp(ctx, t, serial)) {
  1149. *t = CURRENT_TIME;
  1150. *serial = audit_serial();
  1151. }
  1152. }
  1153. /*
  1154. * Wait for auditd to drain the queue a little
  1155. */
  1156. static long wait_for_auditd(long sleep_time)
  1157. {
  1158. DECLARE_WAITQUEUE(wait, current);
  1159. set_current_state(TASK_UNINTERRUPTIBLE);
  1160. add_wait_queue_exclusive(&audit_backlog_wait, &wait);
  1161. if (audit_backlog_limit &&
  1162. skb_queue_len(&audit_skb_queue) > audit_backlog_limit)
  1163. sleep_time = schedule_timeout(sleep_time);
  1164. __set_current_state(TASK_RUNNING);
  1165. remove_wait_queue(&audit_backlog_wait, &wait);
  1166. return sleep_time;
  1167. }
  1168. /**
  1169. * audit_log_start - obtain an audit buffer
  1170. * @ctx: audit_context (may be NULL)
  1171. * @gfp_mask: type of allocation
  1172. * @type: audit message type
  1173. *
  1174. * Returns audit_buffer pointer on success or NULL on error.
  1175. *
  1176. * Obtain an audit buffer. This routine does locking to obtain the
  1177. * audit buffer, but then no locking is required for calls to
  1178. * audit_log_*format. If the task (ctx) is a task that is currently in a
  1179. * syscall, then the syscall is marked as auditable and an audit record
  1180. * will be written at syscall exit. If there is no associated task, then
  1181. * task context (ctx) should be NULL.
  1182. */
  1183. struct audit_buffer *audit_log_start(struct audit_context *ctx, gfp_t gfp_mask,
  1184. int type)
  1185. {
  1186. struct audit_buffer *ab = NULL;
  1187. struct timespec t;
  1188. unsigned int uninitialized_var(serial);
  1189. int reserve = 5; /* Allow atomic callers to go up to five
  1190. entries over the normal backlog limit */
  1191. unsigned long timeout_start = jiffies;
  1192. if (audit_initialized != AUDIT_INITIALIZED)
  1193. return NULL;
  1194. if (unlikely(audit_filter_type(type)))
  1195. return NULL;
  1196. if (gfp_mask & __GFP_WAIT) {
  1197. if (audit_pid && audit_pid == current->pid)
  1198. gfp_mask &= ~__GFP_WAIT;
  1199. else
  1200. reserve = 0;
  1201. }
  1202. while (audit_backlog_limit
  1203. && skb_queue_len(&audit_skb_queue) > audit_backlog_limit + reserve) {
  1204. if (gfp_mask & __GFP_WAIT && audit_backlog_wait_time) {
  1205. long sleep_time;
  1206. sleep_time = timeout_start + audit_backlog_wait_time - jiffies;
  1207. if (sleep_time > 0) {
  1208. sleep_time = wait_for_auditd(sleep_time);
  1209. if (sleep_time > 0)
  1210. continue;
  1211. }
  1212. }
  1213. if (audit_rate_check() && printk_ratelimit())
  1214. pr_warn("audit_backlog=%d > audit_backlog_limit=%d\n",
  1215. skb_queue_len(&audit_skb_queue),
  1216. audit_backlog_limit);
  1217. audit_log_lost("backlog limit exceeded");
  1218. audit_backlog_wait_time = audit_backlog_wait_overflow;
  1219. wake_up(&audit_backlog_wait);
  1220. return NULL;
  1221. }
  1222. audit_backlog_wait_time = AUDIT_BACKLOG_WAIT_TIME;
  1223. ab = audit_buffer_alloc(ctx, gfp_mask, type);
  1224. if (!ab) {
  1225. audit_log_lost("out of memory in audit_log_start");
  1226. return NULL;
  1227. }
  1228. audit_get_stamp(ab->ctx, &t, &serial);
  1229. audit_log_format(ab, "audit(%lu.%03lu:%u): ",
  1230. t.tv_sec, t.tv_nsec/1000000, serial);
  1231. return ab;
  1232. }
  1233. /**
  1234. * audit_expand - expand skb in the audit buffer
  1235. * @ab: audit_buffer
  1236. * @extra: space to add at tail of the skb
  1237. *
  1238. * Returns 0 (no space) on failed expansion, or available space if
  1239. * successful.
  1240. */
  1241. static inline int audit_expand(struct audit_buffer *ab, int extra)
  1242. {
  1243. struct sk_buff *skb = ab->skb;
  1244. int oldtail = skb_tailroom(skb);
  1245. int ret = pskb_expand_head(skb, 0, extra, ab->gfp_mask);
  1246. int newtail = skb_tailroom(skb);
  1247. if (ret < 0) {
  1248. audit_log_lost("out of memory in audit_expand");
  1249. return 0;
  1250. }
  1251. skb->truesize += newtail - oldtail;
  1252. return newtail;
  1253. }
  1254. /*
  1255. * Format an audit message into the audit buffer. If there isn't enough
  1256. * room in the audit buffer, more room will be allocated and vsnprint
  1257. * will be called a second time. Currently, we assume that a printk
  1258. * can't format message larger than 1024 bytes, so we don't either.
  1259. */
  1260. static void audit_log_vformat(struct audit_buffer *ab, const char *fmt,
  1261. va_list args)
  1262. {
  1263. int len, avail;
  1264. struct sk_buff *skb;
  1265. va_list args2;
  1266. if (!ab)
  1267. return;
  1268. BUG_ON(!ab->skb);
  1269. skb = ab->skb;
  1270. avail = skb_tailroom(skb);
  1271. if (avail == 0) {
  1272. avail = audit_expand(ab, AUDIT_BUFSIZ);
  1273. if (!avail)
  1274. goto out;
  1275. }
  1276. va_copy(args2, args);
  1277. len = vsnprintf(skb_tail_pointer(skb), avail, fmt, args);
  1278. if (len >= avail) {
  1279. /* The printk buffer is 1024 bytes long, so if we get
  1280. * here and AUDIT_BUFSIZ is at least 1024, then we can
  1281. * log everything that printk could have logged. */
  1282. avail = audit_expand(ab,
  1283. max_t(unsigned, AUDIT_BUFSIZ, 1+len-avail));
  1284. if (!avail)
  1285. goto out_va_end;
  1286. len = vsnprintf(skb_tail_pointer(skb), avail, fmt, args2);
  1287. }
  1288. if (len > 0)
  1289. skb_put(skb, len);
  1290. out_va_end:
  1291. va_end(args2);
  1292. out:
  1293. return;
  1294. }
  1295. /**
  1296. * audit_log_format - format a message into the audit buffer.
  1297. * @ab: audit_buffer
  1298. * @fmt: format string
  1299. * @...: optional parameters matching @fmt string
  1300. *
  1301. * All the work is done in audit_log_vformat.
  1302. */
  1303. void audit_log_format(struct audit_buffer *ab, const char *fmt, ...)
  1304. {
  1305. va_list args;
  1306. if (!ab)
  1307. return;
  1308. va_start(args, fmt);
  1309. audit_log_vformat(ab, fmt, args);
  1310. va_end(args);
  1311. }
  1312. /**
  1313. * audit_log_hex - convert a buffer to hex and append it to the audit skb
  1314. * @ab: the audit_buffer
  1315. * @buf: buffer to convert to hex
  1316. * @len: length of @buf to be converted
  1317. *
  1318. * No return value; failure to expand is silently ignored.
  1319. *
  1320. * This function will take the passed buf and convert it into a string of
  1321. * ascii hex digits. The new string is placed onto the skb.
  1322. */
  1323. void audit_log_n_hex(struct audit_buffer *ab, const unsigned char *buf,
  1324. size_t len)
  1325. {
  1326. int i, avail, new_len;
  1327. unsigned char *ptr;
  1328. struct sk_buff *skb;
  1329. if (!ab)
  1330. return;
  1331. BUG_ON(!ab->skb);
  1332. skb = ab->skb;
  1333. avail = skb_tailroom(skb);
  1334. new_len = len<<1;
  1335. if (new_len >= avail) {
  1336. /* Round the buffer request up to the next multiple */
  1337. new_len = AUDIT_BUFSIZ*(((new_len-avail)/AUDIT_BUFSIZ) + 1);
  1338. avail = audit_expand(ab, new_len);
  1339. if (!avail)
  1340. return;
  1341. }
  1342. ptr = skb_tail_pointer(skb);
  1343. for (i = 0; i < len; i++)
  1344. ptr = hex_byte_pack_upper(ptr, buf[i]);
  1345. *ptr = 0;
  1346. skb_put(skb, len << 1); /* new string is twice the old string */
  1347. }
  1348. /*
  1349. * Format a string of no more than slen characters into the audit buffer,
  1350. * enclosed in quote marks.
  1351. */
  1352. void audit_log_n_string(struct audit_buffer *ab, const char *string,
  1353. size_t slen)
  1354. {
  1355. int avail, new_len;
  1356. unsigned char *ptr;
  1357. struct sk_buff *skb;
  1358. if (!ab)
  1359. return;
  1360. BUG_ON(!ab->skb);
  1361. skb = ab->skb;
  1362. avail = skb_tailroom(skb);
  1363. new_len = slen + 3; /* enclosing quotes + null terminator */
  1364. if (new_len > avail) {
  1365. avail = audit_expand(ab, new_len);
  1366. if (!avail)
  1367. return;
  1368. }
  1369. ptr = skb_tail_pointer(skb);
  1370. *ptr++ = '"';
  1371. memcpy(ptr, string, slen);
  1372. ptr += slen;
  1373. *ptr++ = '"';
  1374. *ptr = 0;
  1375. skb_put(skb, slen + 2); /* don't include null terminator */
  1376. }
  1377. /**
  1378. * audit_string_contains_control - does a string need to be logged in hex
  1379. * @string: string to be checked
  1380. * @len: max length of the string to check
  1381. */
  1382. int audit_string_contains_control(const char *string, size_t len)
  1383. {
  1384. const unsigned char *p;
  1385. for (p = string; p < (const unsigned char *)string + len; p++) {
  1386. if (*p == '"' || *p < 0x21 || *p > 0x7e)
  1387. return 1;
  1388. }
  1389. return 0;
  1390. }
  1391. /**
  1392. * audit_log_n_untrustedstring - log a string that may contain random characters
  1393. * @ab: audit_buffer
  1394. * @len: length of string (not including trailing null)
  1395. * @string: string to be logged
  1396. *
  1397. * This code will escape a string that is passed to it if the string
  1398. * contains a control character, unprintable character, double quote mark,
  1399. * or a space. Unescaped strings will start and end with a double quote mark.
  1400. * Strings that are escaped are printed in hex (2 digits per char).
  1401. *
  1402. * The caller specifies the number of characters in the string to log, which may
  1403. * or may not be the entire string.
  1404. */
  1405. void audit_log_n_untrustedstring(struct audit_buffer *ab, const char *string,
  1406. size_t len)
  1407. {
  1408. if (audit_string_contains_control(string, len))
  1409. audit_log_n_hex(ab, string, len);
  1410. else
  1411. audit_log_n_string(ab, string, len);
  1412. }
  1413. /**
  1414. * audit_log_untrustedstring - log a string that may contain random characters
  1415. * @ab: audit_buffer
  1416. * @string: string to be logged
  1417. *
  1418. * Same as audit_log_n_untrustedstring(), except that strlen is used to
  1419. * determine string length.
  1420. */
  1421. void audit_log_untrustedstring(struct audit_buffer *ab, const char *string)
  1422. {
  1423. audit_log_n_untrustedstring(ab, string, strlen(string));
  1424. }
  1425. /* This is a helper-function to print the escaped d_path */
  1426. void audit_log_d_path(struct audit_buffer *ab, const char *prefix,
  1427. const struct path *path)
  1428. {
  1429. char *p, *pathname;
  1430. if (prefix)
  1431. audit_log_format(ab, "%s", prefix);
  1432. /* We will allow 11 spaces for ' (deleted)' to be appended */
  1433. pathname = kmalloc(PATH_MAX+11, ab->gfp_mask);
  1434. if (!pathname) {
  1435. audit_log_string(ab, "<no_memory>");
  1436. return;
  1437. }
  1438. p = d_path(path, pathname, PATH_MAX+11);
  1439. if (IS_ERR(p)) { /* Should never happen since we send PATH_MAX */
  1440. /* FIXME: can we save some information here? */
  1441. audit_log_string(ab, "<too_long>");
  1442. } else
  1443. audit_log_untrustedstring(ab, p);
  1444. kfree(pathname);
  1445. }
  1446. void audit_log_session_info(struct audit_buffer *ab)
  1447. {
  1448. unsigned int sessionid = audit_get_sessionid(current);
  1449. uid_t auid = from_kuid(&init_user_ns, audit_get_loginuid(current));
  1450. audit_log_format(ab, " auid=%u ses=%u", auid, sessionid);
  1451. }
  1452. void audit_log_key(struct audit_buffer *ab, char *key)
  1453. {
  1454. audit_log_format(ab, " key=");
  1455. if (key)
  1456. audit_log_untrustedstring(ab, key);
  1457. else
  1458. audit_log_format(ab, "(null)");
  1459. }
  1460. void audit_log_cap(struct audit_buffer *ab, char *prefix, kernel_cap_t *cap)
  1461. {
  1462. int i;
  1463. audit_log_format(ab, " %s=", prefix);
  1464. CAP_FOR_EACH_U32(i) {
  1465. audit_log_format(ab, "%08x",
  1466. cap->cap[CAP_LAST_U32 - i]);
  1467. }
  1468. }
  1469. static void audit_log_fcaps(struct audit_buffer *ab, struct audit_names *name)
  1470. {
  1471. kernel_cap_t *perm = &name->fcap.permitted;
  1472. kernel_cap_t *inh = &name->fcap.inheritable;
  1473. int log = 0;
  1474. if (!cap_isclear(*perm)) {
  1475. audit_log_cap(ab, "cap_fp", perm);
  1476. log = 1;
  1477. }
  1478. if (!cap_isclear(*inh)) {
  1479. audit_log_cap(ab, "cap_fi", inh);
  1480. log = 1;
  1481. }
  1482. if (log)
  1483. audit_log_format(ab, " cap_fe=%d cap_fver=%x",
  1484. name->fcap.fE, name->fcap_ver);
  1485. }
  1486. static inline int audit_copy_fcaps(struct audit_names *name,
  1487. const struct dentry *dentry)
  1488. {
  1489. struct cpu_vfs_cap_data caps;
  1490. int rc;
  1491. if (!dentry)
  1492. return 0;
  1493. rc = get_vfs_caps_from_disk(dentry, &caps);
  1494. if (rc)
  1495. return rc;
  1496. name->fcap.permitted = caps.permitted;
  1497. name->fcap.inheritable = caps.inheritable;
  1498. name->fcap.fE = !!(caps.magic_etc & VFS_CAP_FLAGS_EFFECTIVE);
  1499. name->fcap_ver = (caps.magic_etc & VFS_CAP_REVISION_MASK) >>
  1500. VFS_CAP_REVISION_SHIFT;
  1501. return 0;
  1502. }
  1503. /* Copy inode data into an audit_names. */
  1504. void audit_copy_inode(struct audit_names *name, const struct dentry *dentry,
  1505. const struct inode *inode)
  1506. {
  1507. name->ino = inode->i_ino;
  1508. name->dev = inode->i_sb->s_dev;
  1509. name->mode = inode->i_mode;
  1510. name->uid = inode->i_uid;
  1511. name->gid = inode->i_gid;
  1512. name->rdev = inode->i_rdev;
  1513. security_inode_getsecid(inode, &name->osid);
  1514. audit_copy_fcaps(name, dentry);
  1515. }
  1516. /**
  1517. * audit_log_name - produce AUDIT_PATH record from struct audit_names
  1518. * @context: audit_context for the task
  1519. * @n: audit_names structure with reportable details
  1520. * @path: optional path to report instead of audit_names->name
  1521. * @record_num: record number to report when handling a list of names
  1522. * @call_panic: optional pointer to int that will be updated if secid fails
  1523. */
  1524. void audit_log_name(struct audit_context *context, struct audit_names *n,
  1525. struct path *path, int record_num, int *call_panic)
  1526. {
  1527. struct audit_buffer *ab;
  1528. ab = audit_log_start(context, GFP_KERNEL, AUDIT_PATH);
  1529. if (!ab)
  1530. return;
  1531. audit_log_format(ab, "item=%d", record_num);
  1532. if (path)
  1533. audit_log_d_path(ab, " name=", path);
  1534. else if (n->name) {
  1535. switch (n->name_len) {
  1536. case AUDIT_NAME_FULL:
  1537. /* log the full path */
  1538. audit_log_format(ab, " name=");
  1539. audit_log_untrustedstring(ab, n->name->name);
  1540. break;
  1541. case 0:
  1542. /* name was specified as a relative path and the
  1543. * directory component is the cwd */
  1544. audit_log_d_path(ab, " name=", &context->pwd);
  1545. break;
  1546. default:
  1547. /* log the name's directory component */
  1548. audit_log_format(ab, " name=");
  1549. audit_log_n_untrustedstring(ab, n->name->name,
  1550. n->name_len);
  1551. }
  1552. } else
  1553. audit_log_format(ab, " name=(null)");
  1554. if (n->ino != (unsigned long)-1) {
  1555. audit_log_format(ab, " inode=%lu"
  1556. " dev=%02x:%02x mode=%#ho"
  1557. " ouid=%u ogid=%u rdev=%02x:%02x",
  1558. n->ino,
  1559. MAJOR(n->dev),
  1560. MINOR(n->dev),
  1561. n->mode,
  1562. from_kuid(&init_user_ns, n->uid),
  1563. from_kgid(&init_user_ns, n->gid),
  1564. MAJOR(n->rdev),
  1565. MINOR(n->rdev));
  1566. }
  1567. if (n->osid != 0) {
  1568. char *ctx = NULL;
  1569. u32 len;
  1570. if (security_secid_to_secctx(
  1571. n->osid, &ctx, &len)) {
  1572. audit_log_format(ab, " osid=%u", n->osid);
  1573. if (call_panic)
  1574. *call_panic = 2;
  1575. } else {
  1576. audit_log_format(ab, " obj=%s", ctx);
  1577. security_release_secctx(ctx, len);
  1578. }
  1579. }
  1580. /* log the audit_names record type */
  1581. audit_log_format(ab, " nametype=");
  1582. switch(n->type) {
  1583. case AUDIT_TYPE_NORMAL:
  1584. audit_log_format(ab, "NORMAL");
  1585. break;
  1586. case AUDIT_TYPE_PARENT:
  1587. audit_log_format(ab, "PARENT");
  1588. break;
  1589. case AUDIT_TYPE_CHILD_DELETE:
  1590. audit_log_format(ab, "DELETE");
  1591. break;
  1592. case AUDIT_TYPE_CHILD_CREATE:
  1593. audit_log_format(ab, "CREATE");
  1594. break;
  1595. default:
  1596. audit_log_format(ab, "UNKNOWN");
  1597. break;
  1598. }
  1599. audit_log_fcaps(ab, n);
  1600. audit_log_end(ab);
  1601. }
  1602. int audit_log_task_context(struct audit_buffer *ab)
  1603. {
  1604. char *ctx = NULL;
  1605. unsigned len;
  1606. int error;
  1607. u32 sid;
  1608. security_task_getsecid(current, &sid);
  1609. if (!sid)
  1610. return 0;
  1611. error = security_secid_to_secctx(sid, &ctx, &len);
  1612. if (error) {
  1613. if (error != -EINVAL)
  1614. goto error_path;
  1615. return 0;
  1616. }
  1617. audit_log_format(ab, " subj=%s", ctx);
  1618. security_release_secctx(ctx, len);
  1619. return 0;
  1620. error_path:
  1621. audit_panic("error in audit_log_task_context");
  1622. return error;
  1623. }
  1624. EXPORT_SYMBOL(audit_log_task_context);
  1625. void audit_log_task_info(struct audit_buffer *ab, struct task_struct *tsk)
  1626. {
  1627. const struct cred *cred;
  1628. char comm[sizeof(tsk->comm)];
  1629. struct mm_struct *mm = tsk->mm;
  1630. char *tty;
  1631. if (!ab)
  1632. return;
  1633. /* tsk == current */
  1634. cred = current_cred();
  1635. spin_lock_irq(&tsk->sighand->siglock);
  1636. if (tsk->signal && tsk->signal->tty && tsk->signal->tty->name)
  1637. tty = tsk->signal->tty->name;
  1638. else
  1639. tty = "(none)";
  1640. spin_unlock_irq(&tsk->sighand->siglock);
  1641. audit_log_format(ab,
  1642. " ppid=%d pid=%d auid=%u uid=%u gid=%u"
  1643. " euid=%u suid=%u fsuid=%u"
  1644. " egid=%u sgid=%u fsgid=%u tty=%s ses=%u",
  1645. task_ppid_nr(tsk),
  1646. task_pid_nr(tsk),
  1647. from_kuid(&init_user_ns, audit_get_loginuid(tsk)),
  1648. from_kuid(&init_user_ns, cred->uid),
  1649. from_kgid(&init_user_ns, cred->gid),
  1650. from_kuid(&init_user_ns, cred->euid),
  1651. from_kuid(&init_user_ns, cred->suid),
  1652. from_kuid(&init_user_ns, cred->fsuid),
  1653. from_kgid(&init_user_ns, cred->egid),
  1654. from_kgid(&init_user_ns, cred->sgid),
  1655. from_kgid(&init_user_ns, cred->fsgid),
  1656. tty, audit_get_sessionid(tsk));
  1657. audit_log_format(ab, " comm=");
  1658. audit_log_untrustedstring(ab, get_task_comm(comm, tsk));
  1659. if (mm) {
  1660. down_read(&mm->mmap_sem);
  1661. if (mm->exe_file)
  1662. audit_log_d_path(ab, " exe=", &mm->exe_file->f_path);
  1663. up_read(&mm->mmap_sem);
  1664. } else
  1665. audit_log_format(ab, " exe=(null)");
  1666. audit_log_task_context(ab);
  1667. }
  1668. EXPORT_SYMBOL(audit_log_task_info);
  1669. /**
  1670. * audit_log_link_denied - report a link restriction denial
  1671. * @operation: specific link opreation
  1672. * @link: the path that triggered the restriction
  1673. */
  1674. void audit_log_link_denied(const char *operation, struct path *link)
  1675. {
  1676. struct audit_buffer *ab;
  1677. struct audit_names *name;
  1678. name = kzalloc(sizeof(*name), GFP_NOFS);
  1679. if (!name)
  1680. return;
  1681. /* Generate AUDIT_ANOM_LINK with subject, operation, outcome. */
  1682. ab = audit_log_start(current->audit_context, GFP_KERNEL,
  1683. AUDIT_ANOM_LINK);
  1684. if (!ab)
  1685. goto out;
  1686. audit_log_format(ab, "op=%s", operation);
  1687. audit_log_task_info(ab, current);
  1688. audit_log_format(ab, " res=0");
  1689. audit_log_end(ab);
  1690. /* Generate AUDIT_PATH record with object. */
  1691. name->type = AUDIT_TYPE_NORMAL;
  1692. audit_copy_inode(name, link->dentry, link->dentry->d_inode);
  1693. audit_log_name(current->audit_context, name, link, 0, NULL);
  1694. out:
  1695. kfree(name);
  1696. }
  1697. /**
  1698. * audit_log_end - end one audit record
  1699. * @ab: the audit_buffer
  1700. *
  1701. * netlink_unicast() cannot be called inside an irq context because it blocks
  1702. * (last arg, flags, is not set to MSG_DONTWAIT), so the audit buffer is placed
  1703. * on a queue and a tasklet is scheduled to remove them from the queue outside
  1704. * the irq context. May be called in any context.
  1705. */
  1706. void audit_log_end(struct audit_buffer *ab)
  1707. {
  1708. if (!ab)
  1709. return;
  1710. if (!audit_rate_check()) {
  1711. audit_log_lost("rate limit exceeded");
  1712. } else {
  1713. struct nlmsghdr *nlh = nlmsg_hdr(ab->skb);
  1714. nlh->nlmsg_len = ab->skb->len;
  1715. kauditd_send_multicast_skb(ab->skb, ab->gfp_mask);
  1716. /*
  1717. * The original kaudit unicast socket sends up messages with
  1718. * nlmsg_len set to the payload length rather than the entire
  1719. * message length. This breaks the standard set by netlink.
  1720. * The existing auditd daemon assumes this breakage. Fixing
  1721. * this would require co-ordinating a change in the established
  1722. * protocol between the kaudit kernel subsystem and the auditd
  1723. * userspace code.
  1724. */
  1725. nlh->nlmsg_len -= NLMSG_HDRLEN;
  1726. if (audit_pid) {
  1727. skb_queue_tail(&audit_skb_queue, ab->skb);
  1728. wake_up_interruptible(&kauditd_wait);
  1729. } else {
  1730. audit_printk_skb(ab->skb);
  1731. }
  1732. ab->skb = NULL;
  1733. }
  1734. audit_buffer_free(ab);
  1735. }
  1736. /**
  1737. * audit_log - Log an audit record
  1738. * @ctx: audit context
  1739. * @gfp_mask: type of allocation
  1740. * @type: audit message type
  1741. * @fmt: format string to use
  1742. * @...: variable parameters matching the format string
  1743. *
  1744. * This is a convenience function that calls audit_log_start,
  1745. * audit_log_vformat, and audit_log_end. It may be called
  1746. * in any context.
  1747. */
  1748. void audit_log(struct audit_context *ctx, gfp_t gfp_mask, int type,
  1749. const char *fmt, ...)
  1750. {
  1751. struct audit_buffer *ab;
  1752. va_list args;
  1753. ab = audit_log_start(ctx, gfp_mask, type);
  1754. if (ab) {
  1755. va_start(args, fmt);
  1756. audit_log_vformat(ab, fmt, args);
  1757. va_end(args);
  1758. audit_log_end(ab);
  1759. }
  1760. }
  1761. #ifdef CONFIG_SECURITY
  1762. /**
  1763. * audit_log_secctx - Converts and logs SELinux context
  1764. * @ab: audit_buffer
  1765. * @secid: security number
  1766. *
  1767. * This is a helper function that calls security_secid_to_secctx to convert
  1768. * secid to secctx and then adds the (converted) SELinux context to the audit
  1769. * log by calling audit_log_format, thus also preventing leak of internal secid
  1770. * to userspace. If secid cannot be converted audit_panic is called.
  1771. */
  1772. void audit_log_secctx(struct audit_buffer *ab, u32 secid)
  1773. {
  1774. u32 len;
  1775. char *secctx;
  1776. if (security_secid_to_secctx(secid, &secctx, &len)) {
  1777. audit_panic("Cannot convert secid to context");
  1778. } else {
  1779. audit_log_format(ab, " obj=%s", secctx);
  1780. security_release_secctx(secctx, len);
  1781. }
  1782. }
  1783. EXPORT_SYMBOL(audit_log_secctx);
  1784. #endif
  1785. EXPORT_SYMBOL(audit_log_start);
  1786. EXPORT_SYMBOL(audit_log_end);
  1787. EXPORT_SYMBOL(audit_log_format);
  1788. EXPORT_SYMBOL(audit_log);