/
libaudit.c
1214 lines (1088 loc) · 27.4 KB
/
libaudit.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/* libaudit.c --
* Copyright 2004-2009 Red Hat Inc., Durham, North Carolina.
* All Rights Reserved.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* Authors:
* Steve Grubb <sgrubb@redhat.com>
* Rickard E. (Rik) Faith <faith@redhat.com>
*/
#include "config.h"
#include <stdio.h>
#include <stdarg.h>
#include <string.h>
#include <stdlib.h>
#include <unistd.h>
#include <ctype.h>
#include <time.h>
#include <pwd.h>
#include <grp.h>
#include <errno.h>
#include <sys/poll.h>
#include <sys/utsname.h>
#include <sys/stat.h>
#include <fcntl.h> /* O_NOFOLLOW needs gnu defined */
#include <limits.h> /* for PATH_MAX */
#include "libaudit.h"
#include "private.h"
#include "errormsg.h"
/* #defines for the audit failure query */
#define CONFIG_FILE "/etc/libaudit.conf"
/* Local prototypes */
struct nv_pair
{
const char *name;
const char *value;
};
struct kw_pair
{
const char *name;
int (*parser)(const char *, int);
};
struct nv_list
{
const char *name;
int option;
};
struct libaudit_conf
{
auditfail_t failure_action;
};
static const struct nv_list failure_actions[] =
{
{"ignore", FAIL_IGNORE },
{"log", FAIL_LOG },
{"terminate", FAIL_TERMINATE },
{ NULL, 0 }
};
int audit_permadded hidden = 0;
int audit_archadded hidden = 0;
int audit_syscalladded hidden = 0;
unsigned int audit_elf hidden = 0U;
static struct libaudit_conf config;
static int audit_failure_parser(const char *val, int line);
static int audit_name_to_uid(const char *name, uid_t *uid);
static int audit_name_to_gid(const char *name, gid_t *gid);
static const struct kw_pair keywords[] =
{
{"failure_action", audit_failure_parser },
{ NULL, NULL }
};
static int audit_priority(int xerrno)
{
/* If they've compiled their own kernel and did not include
* the audit susbsystem, they will get ECONNREFUSED. We'll
* demote the message to debug so its not lost entirely. */
if (xerrno == ECONNREFUSED)
return LOG_DEBUG;
else
return LOG_WARNING;
}
int audit_request_status(int fd)
{
int rc = audit_send(fd, AUDIT_GET, NULL, 0);
if (rc < 0)
audit_msg(audit_priority(errno),
"Error sending status request (%s)", strerror(-rc));
return rc;
}
hidden_def(audit_request_status)
/*
* Set everything to its default value
*/
static void clear_config(void)
{
config.failure_action = FAIL_IGNORE;
}
/* Get 1 line from file */
static char *get_line(FILE *f, char *buf, size_t len)
{
if (fgets(buf, len, f)) {
/* remove newline */
char *ptr = strchr(buf, 0x0a);
if (ptr)
*ptr = 0;
return buf;
}
return NULL;
}
static int nv_split(char *buf, struct nv_pair *nv)
{
/* Get the name part */
char *ptr, *saved=NULL;
nv->name = NULL;
nv->value = NULL;
ptr = strtok_r(buf, " ", &saved);
if (ptr == NULL)
return 0; /* If there's nothing, go to next line */
if (ptr[0] == '#')
return 0; /* If there's a comment, go to next line */
nv->name = ptr;
/* Check for a '=' */
ptr = strtok_r(NULL, " ", &saved);
if (ptr == NULL)
return 1;
if (strcmp(ptr, "=") != 0)
return 2;
/* get the value */
ptr = strtok_r(NULL, " ", &saved);
if (ptr == NULL)
return 1;
nv->value = ptr;
/* Make sure there's nothing else */
ptr = strtok_r(NULL, " ", &saved);
if (ptr)
return 1;
/* Everything is OK */
return 0;
}
static const struct kw_pair *kw_lookup(const char *val)
{
int i = 0;
while (keywords[i].name != NULL) {
if (strcasecmp(keywords[i].name, val) == 0)
break;
i++;
}
return &keywords[i];
}
static int audit_failure_parser(const char *val, int line)
{
int i;
audit_msg(LOG_DEBUG, "audit_failure_parser called with: %s", val);
for (i=0; failure_actions[i].name != NULL; i++) {
if (strcasecmp(val, failure_actions[i].name) == 0) {
config.failure_action = failure_actions[i].option;
return 0;
}
}
audit_msg(LOG_ERR, "Option %s not found - line %d", val, line);
return 1;
}
/*
* Read the /etc/libaudit.conf file and all tunables.
*/
static int load_libaudit_config(const char *path)
{
int fd, rc, lineno = 1;
struct stat st;
FILE *f;
char buf[128];
/* open the file */
rc = open(path, O_NOFOLLOW|O_RDONLY);
if (rc < 0) {
if (errno != ENOENT) {
audit_msg(LOG_ERR, "Error opening %s (%s)",
path, strerror(errno));
return 1;
}
audit_msg(LOG_WARNING,
"Config file %s doesn't exist, skipping", path);
return 0;
}
fd = rc;
/* check the file's permissions: owned by root, not world writable,
* not symlink.
*/
audit_msg(LOG_DEBUG, "Config file %s opened for parsing", path);
if (fstat(fd, &st) < 0) {
audit_msg(LOG_ERR, "Error fstat'ing %s (%s)",
path, strerror(errno));
return 1;
}
if (st.st_uid != 0) {
audit_msg(LOG_ERR, "Error - %s isn't owned by root", path);
return 1;
}
if ((st.st_mode & S_IWOTH) == S_IWOTH) {
audit_msg(LOG_ERR, "Error - %s is world writable", path);
return 1;
}
if (!S_ISREG(st.st_mode)) {
audit_msg(LOG_ERR, "Error - %s is not a regular file", path);
return 1;
}
/* it's ok, read line by line */
f = fdopen(fd, "rm");
if (f == NULL) {
audit_msg(LOG_ERR, "Error - fdopen failed (%s)",
strerror(errno));
return 1;
}
while (get_line(f, buf, sizeof(buf))) {
// convert line into name-value pair
const struct kw_pair *kw;
struct nv_pair nv;
rc = nv_split(buf, &nv);
switch (rc) {
case 0: // fine
break;
case 1: // not the right number of tokens.
audit_msg(LOG_ERR,
"Wrong number of arguments for line %d in %s",
lineno, path);
break;
case 2: // no '=' sign
audit_msg(LOG_ERR,
"Missing equal sign for line %d in %s",
lineno, path);
break;
default: // something else went wrong...
audit_msg(LOG_ERR,
"Unknown error for line %d in %s",
lineno, path);
break;
}
if (nv.name == NULL) {
lineno++;
continue;
}
if (nv.value == NULL) {
fclose(f);
return 1;
}
/* identify keyword or error */
kw = kw_lookup(nv.name);
if (kw->name == NULL) {
audit_msg(LOG_ERR,
"Unknown keyword \"%s\" in line %d of %s",
nv.name, lineno, path);
fclose(f);
return 1;
}
/* dispatch to keyword's local parser */
rc = kw->parser(nv.value, lineno);
if (rc != 0) {
fclose(f);
return 1; // local parser puts message out
}
lineno++;
}
fclose(f);
return 0;
}
/*
* This function is called to get the value of the failure_action
* tunable stored in /etc/libaudit.conf. The function returns 1 if
* the tunable is not found or there is an error. If the tunable is found,
* 0 is returned the the tunable value is saved in the failmode parameter.
*/
int get_auditfail_action(auditfail_t *failmode)
{
clear_config();
if (load_libaudit_config(CONFIG_FILE)) {
*failmode = config.failure_action;
return 1;
}
*failmode = config.failure_action;
return 0;
}
int audit_set_enabled(int fd, uint32_t enabled)
{
int rc;
struct audit_status s;
memset(&s, 0, sizeof(s));
s.mask = AUDIT_STATUS_ENABLED;
s.enabled = enabled;
rc = audit_send(fd, AUDIT_SET, &s, sizeof(s));
if (rc < 0)
audit_msg(audit_priority(errno),
"Error sending enable request (%s)", strerror(-rc));
return rc;
}
/*
* This function will return 0 if auditing is NOT enabled and
* 1 if enabled, and -1 on error.
*/
int audit_is_enabled(int fd)
{
int rc;
if (fd < 0)
return 0;
if ((rc = audit_request_status(fd)) > 0) {
struct audit_reply rep;
int i;
int timeout = 40; /* tenths of seconds */
struct pollfd pfd[1];
pfd[0].fd = fd;
pfd[0].events = POLLIN;
for (i = 0; i < timeout; i++) {
do {
rc = poll(pfd, 1, 100);
} while (rc < 0 && errno == EINTR);
rc = audit_get_reply(fd, &rep, GET_REPLY_NONBLOCKING,0);
if (rc > 0) {
/* If we get done or error, break out */
if (rep.type == NLMSG_DONE ||
rep.type == NLMSG_ERROR)
break;
/* If its not status, keep looping */
if (rep.type != AUDIT_GET)
continue;
/* Found it... */
return rep.status->enabled;
}
}
}
if (rc == -ECONNREFUSED) {
/* This is here to let people that build their own kernel
and disable the audit system get in. ECONNREFUSED is
issued by the kernel when there is "no on listening". */
return 0;
} else if (rc == -EPERM && getuid() != 0) {
/* If we get this, then the kernel supports auditing
* but we don't have enough privilege to write to the
* socket. Therefore, we have already been authenticated
* and we are a common user. Just act as though auditing
* is not enabled. Any other error we take seriously.
* This is here basically to satisfy Xscreensaver. */
return 0;
}
return -1;
}
int audit_set_failure(int fd, uint32_t failure)
{
int rc;
struct audit_status s;
memset(&s, 0, sizeof(s));
s.mask = AUDIT_STATUS_FAILURE;
s.failure = failure;
rc = audit_send(fd, AUDIT_SET, &s, sizeof(s));
if (rc < 0)
audit_msg(audit_priority(errno),
"Error sending failure mode request (%s)",
strerror(-rc));
return rc;
}
/*
* This function returns -1 on error and 1 on success.
*/
int audit_set_pid(int fd, uint32_t pid, rep_wait_t wmode)
{
struct audit_status s;
struct audit_reply rep;
struct pollfd pfd[1];
int rc;
memset(&s, 0, sizeof(s));
s.mask = AUDIT_STATUS_PID;
s.pid = pid;
rc = audit_send(fd, AUDIT_SET, &s, sizeof(s));
if (rc < 0) {
audit_msg(audit_priority(errno),
"Error setting audit daemon pid (%s)",
strerror(-rc));
return rc;
}
if (wmode == WAIT_NO)
return 1;
/* Now we'll see if there's any reply message. This only
happens on error. It is not fatal if there is no message.
As a matter of fact, we don't do anything with the message
besides gobble it. */
pfd[0].fd = fd;
pfd[0].events = POLLIN;
do {
rc = poll(pfd, 1, 100); /* .1 second */
} while (rc < 0 && errno == EINTR);
(void)audit_get_reply(fd, &rep, GET_REPLY_NONBLOCKING, 0);
return 1;
}
int audit_set_rate_limit(int fd, uint32_t limit)
{
int rc;
struct audit_status s;
memset(&s, 0, sizeof(s));
s.mask = AUDIT_STATUS_RATE_LIMIT;
s.rate_limit = limit;
rc = audit_send(fd, AUDIT_SET, &s, sizeof(s));
if (rc < 0)
audit_msg(audit_priority(errno),
"Error sending rate limit request (%s)",
strerror(-rc));
return rc;
}
int audit_set_backlog_limit(int fd, uint32_t limit)
{
int rc;
struct audit_status s;
memset(&s, 0, sizeof(s));
s.mask = AUDIT_STATUS_BACKLOG_LIMIT;
s.backlog_limit = limit;
rc = audit_send(fd, AUDIT_SET, &s, sizeof(s));
if (rc < 0)
audit_msg(audit_priority(errno),
"Error sending backlog limit request (%s)",
strerror(-rc));
return rc;
}
int audit_request_rules_list_data(int fd)
{
int rc = audit_send(fd, AUDIT_LIST_RULES, NULL, 0);
if (rc < 0 && rc != -EINVAL)
audit_msg(audit_priority(errno),
"Error sending rule list data request (%s)",
strerror(-rc));
return rc;
}
int audit_request_signal_info(int fd)
{
int rc = audit_send(fd, AUDIT_SIGNAL_INFO, NULL, 0);
if (rc < 0)
audit_msg(LOG_WARNING,
"Error sending signal_info request (%s)",
strerror(-rc));
return rc;
}
int audit_update_watch_perms(struct audit_rule_data *rule, int perms)
{
int i, done=0;
if (rule->field_count < 1)
return -1;
// First see if we have an entry we are updating
for (i=0; i< rule->field_count; i++) {
if (rule->fields[i] == AUDIT_PERM) {
rule->values[i] = perms;
done = 1;
}
}
if (!done) {
// If not check to see if we have room to add a field
if (rule->field_count >= (AUDIT_MAX_FIELDS - 1))
return -2;
// Add the perm
rule->fields[rule->field_count] = AUDIT_PERM;
rule->fieldflags[rule->field_count] = AUDIT_EQUAL;
rule->values[rule->field_count] = perms;
rule->field_count++;
}
return 0;
}
int audit_add_watch(struct audit_rule_data **rulep, const char *path)
{
return audit_add_watch_dir(AUDIT_WATCH, rulep, path);
}
int audit_add_dir(struct audit_rule_data **rulep, const char *path)
{
return audit_add_watch_dir(AUDIT_DIR, rulep, path);
}
int audit_add_watch_dir(int type, struct audit_rule_data **rulep,
const char *path)
{
size_t len = strlen(path);
struct audit_rule_data *rule = *rulep;
if (rule && rule->field_count) {
audit_msg(LOG_ERR, "Rule is not empty\n");
return -1;
}
if (type != AUDIT_WATCH && type != AUDIT_DIR) {
audit_msg(LOG_ERR, "Invalid type used\n");
return -1;
}
*rulep = realloc(rule, len + sizeof(*rule));
if (*rulep == NULL) {
free(rule);
audit_msg(LOG_ERR, "Cannot realloc memory!\n");
return -1;
}
rule = *rulep;
memset(rule, 0, len + sizeof(*rule));
rule->flags = AUDIT_FILTER_EXIT;
rule->action = AUDIT_ALWAYS;
audit_rule_syscallbyname_data(rule, "all");
rule->field_count = 2;
rule->fields[0] = type;
rule->values[0] = len;
rule->fieldflags[0] = AUDIT_EQUAL;
rule->buflen = len;
memcpy(&rule->buf[0], path, len);
// Default to all permissions
rule->fields[1] = AUDIT_PERM;
rule->fieldflags[1] = AUDIT_EQUAL;
rule->values[1] = AUDIT_PERM_READ | AUDIT_PERM_WRITE |
AUDIT_PERM_EXEC | AUDIT_PERM_ATTR;
audit_permadded = 1;
return 0;
}
hidden_def(audit_add_watch_dir)
int audit_add_rule_data(int fd, struct audit_rule_data *rule,
int flags, int action)
{
int rc;
if (flags == AUDIT_FILTER_ENTRY) {
audit_msg(LOG_WARNING, "Use of entry filter is deprecated");
return -2;
}
rule->flags = flags;
rule->action = action;
rc = audit_send(fd, AUDIT_ADD_RULE, rule,
sizeof(struct audit_rule_data) + rule->buflen);
if (rc < 0)
audit_msg(audit_priority(errno),
"Error sending add rule data request (%s)",
errno == EEXIST ?
"Rule exists" : strerror(-rc));
return rc;
}
int audit_delete_rule_data(int fd, struct audit_rule_data *rule,
int flags, int action)
{
int rc;
if (flags == AUDIT_FILTER_ENTRY) {
audit_msg(LOG_WARNING, "Use of entry filter is deprecated");
return -2;
}
rule->flags = flags;
rule->action = action;
rc = audit_send(fd, AUDIT_DEL_RULE, rule,
sizeof(struct audit_rule_data) + rule->buflen);
if (rc < 0) {
if (rc == -ENOENT)
audit_msg(LOG_WARNING,
"Error sending delete rule request (No rule matches)");
else
audit_msg(audit_priority(errno),
"Error sending delete rule data request (%s)",
strerror(-rc));
}
return rc;
}
/*
* This function is part of the directory auditing code
*/
int audit_trim_subtrees(int fd)
{
int rc = audit_send(fd, AUDIT_TRIM, NULL, 0);
if (rc < 0)
audit_msg(audit_priority(errno),
"Error sending trim subtrees command (%s)",
strerror(-rc));
return rc;
}
/*
* This function is part of the directory auditing code
*/
int audit_make_equivalent(int fd, const char *mount_point,
const char *subtree)
{
int rc;
size_t len1 = strlen(mount_point);
size_t len2 = strlen(subtree);
struct {
uint32_t sizes[2];
unsigned char buf[];
} *cmd = malloc(sizeof(*cmd) + len1 + len2);
memset(cmd, 0, sizeof(*cmd) + len1 + len2);
cmd->sizes[0] = len1;
cmd->sizes[1] = len2;
memcpy(&cmd->buf[0], mount_point, len1);
memcpy(&cmd->buf[len1], subtree, len2);
rc = audit_send(fd, AUDIT_MAKE_EQUIV, cmd, sizeof(*cmd) + len1 + len2);
if (rc < 0)
audit_msg(audit_priority(errno),
"Error sending make_equivalent command (%s)",
strerror(-rc));
free(cmd);
return rc;
}
/*
* This function will retreive the loginuid or -1 if there
* is an error.
*/
uid_t audit_getloginuid(void)
{
uid_t uid;
int len, in;
char buf[16];
errno = 0;
in = open("/proc/self/loginuid", O_NOFOLLOW|O_RDONLY);
if (in < 0)
return -1;
do {
len = read(in, buf, sizeof(buf));
} while (len < 0 && errno == EINTR);
close(in);
if (len < 0 || len >= sizeof(buf))
return -1;
buf[len] = 0;
errno = 0;
uid = strtol(buf, 0, 10);
if (errno)
return -1;
else
return uid;
}
/*
* This function returns 0 on success and 1 on failure
*/
int audit_setloginuid(uid_t uid)
{
char loginuid[16];
int o, count, rc = 0;
errno = 0;
count = snprintf(loginuid, sizeof(loginuid), "%u", uid);
o = open("/proc/self/loginuid", O_NOFOLLOW|O_WRONLY|O_TRUNC);
if (o >= 0) {
int block, offset = 0;
while (count > 0) {
block = write(o, &loginuid[offset], (unsigned)count);
if (block < 0) {
if (errno == EINTR)
continue;
audit_msg(LOG_ERR, "Error writing loginuid");
close(o);
return 1;
}
offset += block;
count -= block;
}
close(o);
} else {
audit_msg(LOG_ERR, "Error opening /proc/self/loginuid");
rc = 1;
}
return rc;
}
int audit_rule_syscall_data(struct audit_rule_data *rule, int scall)
{
int word = AUDIT_WORD(scall);
int bit = AUDIT_BIT(scall);
if (word >= (AUDIT_BITMASK_SIZE-1))
return -1;
rule->mask[word] |= bit;
return 0;
}
hidden_def(audit_rule_syscall_data)
int audit_rule_syscallbyname_data(struct audit_rule_data *rule,
const char *scall)
{
int nr, i;
int machine;
if (!strcmp(scall, "all")) {
for (i = 0; i < (AUDIT_BITMASK_SIZE-1); i++)
rule->mask[i] = ~0;
return 0;
}
if (!audit_elf)
machine = audit_detect_machine();
else
machine = audit_elf_to_machine(audit_elf);
if (machine < 0)
return -2;
nr = audit_name_to_syscall(scall, machine);
if (nr < 0) {
if (isdigit(scall[0]))
nr = strtol(scall, NULL, 0);
}
if (nr >= 0)
return audit_rule_syscall_data(rule, nr);
return -1;
}
hidden_def(audit_rule_syscallbyname_data)
int audit_rule_fieldpair_data(struct audit_rule_data **rulep, const char *pair,
int flags)
{
const char *f = pair;
char *v;
int op;
int field;
int vlen;
int offset;
struct audit_rule_data *rule = *rulep;
if (f == NULL)
return -1;
/* look for 2-char operators first
then look for 1-char operators afterwards
when found, null out the bytes under the operators to split
and set value pointer just past operator bytes
*/
if ( (v = strstr(pair, "!=")) ) {
*v++ = '\0';
*v++ = '\0';
op = AUDIT_NOT_EQUAL;
} else if ( (v = strstr(pair, ">=")) ) {
*v++ = '\0';
*v++ = '\0';
op = AUDIT_GREATER_THAN_OR_EQUAL;
} else if ( (v = strstr(pair, "<=")) ) {
*v++ = '\0';
*v++ = '\0';
op = AUDIT_LESS_THAN_OR_EQUAL;
} else if ( (v = strstr(pair, "&=")) ) {
*v++ = '\0';
*v++ = '\0';
op = AUDIT_BIT_TEST;
} else if ( (v = strstr(pair, "=")) ) {
*v++ = '\0';
op = AUDIT_EQUAL;
} else if ( (v = strstr(pair, ">")) ) {
*v++ = '\0';
op = AUDIT_GREATER_THAN;
} else if ( (v = strstr(pair, "<")) ) {
*v++ = '\0';
op = AUDIT_LESS_THAN;
} else if ( (v = strstr(pair, "&")) ) {
*v++ = '\0';
op = AUDIT_BIT_MASK;
}
if (v == NULL)
return -1;
if (*f == 0)
return -22;
if (*v == 0)
return -20;
if ((field = audit_name_to_field(f)) < 0)
return -2;
/* Exclude filter can be used only with MSGTYPE field */
if (flags == AUDIT_FILTER_EXCLUDE && field != AUDIT_MSGTYPE)
return -12;
rule->fields[rule->field_count] = field;
rule->fieldflags[rule->field_count] = op;
switch (field)
{
case AUDIT_UID:
case AUDIT_EUID:
case AUDIT_SUID:
case AUDIT_FSUID:
case AUDIT_LOGINUID:
// Do positive & negative separate for 32 bit systems
vlen = strlen(v);
if (isdigit((char)*(v)))
rule->values[rule->field_count] =
strtoul(v, NULL, 0);
else if (vlen >= 2 && *(v)=='-' &&
(isdigit((char)*(v+1))))
rule->values[rule->field_count] =
strtol(v, NULL, 0);
else {
if (audit_name_to_uid(v,
&rule->values[rule->field_count])) {
audit_msg(LOG_ERR, "Unknown user: %s",
v);
return -2;
}
}
break;
case AUDIT_GID:
case AUDIT_EGID:
case AUDIT_SGID:
case AUDIT_FSGID:
if (isdigit((char)*(v)))
rule->values[rule->field_count] =
strtol(v, NULL, 0);
else {
if (audit_name_to_gid(v,
&rule->values[rule->field_count])) {
audit_msg(LOG_ERR, "Unknown group: %s",
v);
return -2;
}
}
break;
case AUDIT_EXIT:
if (flags != AUDIT_FILTER_EXIT)
return -7;
vlen = strlen(v);
if (isdigit((char)*(v)))
rule->values[rule->field_count] =
strtol(v, NULL, 0);
else if (vlen >= 2 && *(v)=='-' &&
(isdigit((char)*(v+1))))
rule->values[rule->field_count] =
strtol(v, NULL, 0);
else {
rule->values[rule->field_count] =
audit_name_to_errno(v);
if (rule->values[rule->field_count] == 0)
return -15;
}
break;
case AUDIT_MSGTYPE:
if (flags != AUDIT_FILTER_EXCLUDE)
return -9;
if (isdigit((char)*(v)))
rule->values[rule->field_count] =
strtol(v, NULL, 0);
else
if (audit_name_to_msg_type(v) > 0)
rule->values[rule->field_count] =
audit_name_to_msg_type(v);
else
return -8;
break;
/* These next few are strings */
case AUDIT_OBJ_USER:
case AUDIT_OBJ_ROLE:
case AUDIT_OBJ_TYPE:
case AUDIT_OBJ_LEV_LOW:
case AUDIT_OBJ_LEV_HIGH:
case AUDIT_WATCH:
case AUDIT_DIR:
/* Watch & object filtering is invalid on anything
* but exit */
if (flags != AUDIT_FILTER_EXIT)
return -7;
if (field == AUDIT_WATCH || field == AUDIT_DIR)
audit_permadded = 1;
/* fallthrough */
case AUDIT_SUBJ_USER:
case AUDIT_SUBJ_ROLE:
case AUDIT_SUBJ_TYPE:
case AUDIT_SUBJ_SEN:
case AUDIT_SUBJ_CLR:
case AUDIT_FILTERKEY:
if (field == AUDIT_FILTERKEY && !(audit_syscalladded || audit_permadded))
return -19;
vlen = strlen(v);
if (field == AUDIT_FILTERKEY &&
vlen > AUDIT_MAX_KEY_LEN)
return -11;
else if (vlen > PATH_MAX)
return -11;
rule->values[rule->field_count] = vlen;
offset = rule->buflen;
rule->buflen += vlen;
*rulep = realloc(rule, sizeof(*rule) + rule->buflen);
if (*rulep == NULL) {
free(rule);
audit_msg(LOG_ERR, "Cannot realloc memory!\n");
return -3;
} else {
rule = *rulep;
}
strncpy(&rule->buf[offset], v, vlen);
break;
case AUDIT_ARCH:
if (audit_syscalladded)
return -3;
if (!(op == AUDIT_NOT_EQUAL || op == AUDIT_EQUAL))
return -13;
if (isdigit((char)*(v))) {
int machine;
errno = 0;
audit_elf = strtoul(v, NULL, 0);
if (errno)
return -5;
// Make sure we have a valid mapping
machine = audit_elf_to_machine(audit_elf);
if (machine < 0)
return -5;
}
else {
// what do we want? i686, x86_64, ia64
// or b64, b32
int machine;
unsigned int bits=0, elf;
const char *arch=v;
if (strcasecmp("b64", arch) == 0) {
bits = __AUDIT_ARCH_64BIT;
machine = audit_detect_machine();
} else if (strcasecmp("b32", arch) == 0) {
bits = ~__AUDIT_ARCH_64BIT;
machine = audit_detect_machine();
}