audit.c 54 KB

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