/
kern_ktrace.c
1468 lines (1246 loc) · 31.9 KB
/
kern_ktrace.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
/* $NetBSD: kern_ktrace.c,v 1.182 2022/07/01 01:07:56 riastradh Exp $ */
/*-
* Copyright (c) 2006, 2007, 2008, 2020 The NetBSD Foundation, Inc.
* All rights reserved.
*
* This code is derived from software contributed to The NetBSD Foundation
* by Andrew Doran.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
/*
* Copyright (c) 1989, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* @(#)kern_ktrace.c 8.5 (Berkeley) 5/14/95
*/
#include <sys/cdefs.h>
__KERNEL_RCSID(0, "$NetBSD: kern_ktrace.c,v 1.182 2022/07/01 01:07:56 riastradh Exp $");
#include <sys/param.h>
#include <sys/systm.h>
#include <sys/proc.h>
#include <sys/file.h>
#include <sys/kernel.h>
#include <sys/kthread.h>
#include <sys/ktrace.h>
#include <sys/kmem.h>
#include <sys/syslog.h>
#include <sys/filedesc.h>
#include <sys/ioctl.h>
#include <sys/callout.h>
#include <sys/kauth.h>
#include <sys/cpu.h>
#include <sys/mount.h>
#include <sys/syscallargs.h>
/*
* TODO:
* - need better error reporting?
* - userland utility to sort ktrace.out by timestamp.
* - keep minimum information in ktrace_entry when rest of alloc failed.
* - per trace control of configurable parameters.
*/
struct ktrace_entry {
TAILQ_ENTRY(ktrace_entry) kte_list;
struct ktr_header kte_kth;
void *kte_buf;
size_t kte_bufsz;
#define KTE_SPACE 32
uint8_t kte_space[KTE_SPACE] __aligned(sizeof(register_t));
};
struct ktr_desc {
TAILQ_ENTRY(ktr_desc) ktd_list;
int ktd_flags;
#define KTDF_WAIT 0x0001
#define KTDF_DONE 0x0002
#define KTDF_BLOCKING 0x0004
#define KTDF_INTERACTIVE 0x0008
int ktd_error;
#define KTDE_ENOMEM 0x0001
#define KTDE_ENOSPC 0x0002
int ktd_errcnt;
int ktd_ref; /* # of reference */
int ktd_qcount; /* # of entry in the queue */
/*
* Params to control behaviour.
*/
int ktd_delayqcnt; /* # of entry allowed to delay */
int ktd_wakedelay; /* delay of wakeup in *tick* */
int ktd_intrwakdl; /* ditto, but when interactive */
file_t *ktd_fp; /* trace output file */
lwp_t *ktd_lwp; /* our kernel thread */
TAILQ_HEAD(, ktrace_entry) ktd_queue;
callout_t ktd_wakch; /* delayed wakeup */
kcondvar_t ktd_sync_cv;
kcondvar_t ktd_cv;
};
static void ktrwrite(struct ktr_desc *, struct ktrace_entry *);
static int ktrops(lwp_t *, struct proc *, int, int,
struct ktr_desc *);
static int ktrsetchildren(lwp_t *, struct proc *, int, int,
struct ktr_desc *);
static int ktrcanset(lwp_t *, struct proc *);
static int ktrsamefile(file_t *, file_t *);
static void ktr_kmem(lwp_t *, int, const void *, size_t);
static void ktr_io(lwp_t *, int, enum uio_rw, struct iovec *, size_t);
static struct ktr_desc *
ktd_lookup(file_t *);
static void ktdrel(struct ktr_desc *);
static void ktdref(struct ktr_desc *);
static void ktefree(struct ktrace_entry *);
static void ktd_logerrl(struct ktr_desc *, int);
static void ktrace_thread(void *);
static int ktrderefall(struct ktr_desc *, int);
/*
* Default values.
*/
#define KTD_MAXENTRY 1000 /* XXX: tune */
#define KTD_TIMEOUT 5 /* XXX: tune */
#define KTD_DELAYQCNT 100 /* XXX: tune */
#define KTD_WAKEDELAY 5000 /* XXX: tune */
#define KTD_INTRWAKDL 100 /* XXX: tune */
/*
* Patchable variables.
*/
int ktd_maxentry = KTD_MAXENTRY; /* max # of entry in the queue */
int ktd_timeout = KTD_TIMEOUT; /* timeout in seconds */
int ktd_delayqcnt = KTD_DELAYQCNT; /* # of entry allowed to delay */
int ktd_wakedelay = KTD_WAKEDELAY; /* delay of wakeup in *ms* */
int ktd_intrwakdl = KTD_INTRWAKDL; /* ditto, but when interactive */
kmutex_t ktrace_lock;
int ktrace_on;
static TAILQ_HEAD(, ktr_desc) ktdq = TAILQ_HEAD_INITIALIZER(ktdq);
static pool_cache_t kte_cache;
static kauth_listener_t ktrace_listener;
static void
ktd_wakeup(struct ktr_desc *ktd)
{
callout_stop(&ktd->ktd_wakch);
cv_signal(&ktd->ktd_cv);
}
static void
ktd_callout(void *arg)
{
mutex_enter(&ktrace_lock);
ktd_wakeup(arg);
mutex_exit(&ktrace_lock);
}
static void
ktd_logerrl(struct ktr_desc *ktd, int error)
{
ktd->ktd_error |= error;
ktd->ktd_errcnt++;
}
#if 0
static void
ktd_logerr(struct proc *p, int error)
{
struct ktr_desc *ktd;
KASSERT(mutex_owned(&ktrace_lock));
ktd = p->p_tracep;
if (ktd == NULL)
return;
ktd_logerrl(ktd, error);
}
#endif
static int
ktrace_listener_cb(kauth_cred_t cred, kauth_action_t action, void *cookie,
void *arg0, void *arg1, void *arg2, void *arg3)
{
struct proc *p;
int result;
enum kauth_process_req req;
result = KAUTH_RESULT_DEFER;
p = arg0;
if (action != KAUTH_PROCESS_KTRACE)
return result;
req = (enum kauth_process_req)(uintptr_t)arg1;
/* Privileged; secmodel should handle these. */
if (req == KAUTH_REQ_PROCESS_KTRACE_PERSISTENT)
return result;
if ((p->p_traceflag & KTRFAC_PERSISTENT) ||
(p->p_flag & PK_SUGID))
return result;
if (kauth_cred_geteuid(cred) == kauth_cred_getuid(p->p_cred) &&
kauth_cred_getuid(cred) == kauth_cred_getsvuid(p->p_cred) &&
kauth_cred_getgid(cred) == kauth_cred_getgid(p->p_cred) &&
kauth_cred_getgid(cred) == kauth_cred_getsvgid(p->p_cred))
result = KAUTH_RESULT_ALLOW;
return result;
}
/*
* Initialise the ktrace system.
*/
void
ktrinit(void)
{
mutex_init(&ktrace_lock, MUTEX_DEFAULT, IPL_NONE);
kte_cache = pool_cache_init(sizeof(struct ktrace_entry), 0, 0, 0,
"ktrace", &pool_allocator_nointr, IPL_NONE, NULL, NULL, NULL);
ktrace_listener = kauth_listen_scope(KAUTH_SCOPE_PROCESS,
ktrace_listener_cb, NULL);
}
/*
* Release a reference. Called with ktrace_lock held.
*/
static void
ktdrel(struct ktr_desc *ktd)
{
KASSERT(mutex_owned(&ktrace_lock));
KDASSERT(ktd->ktd_ref != 0);
KASSERT(ktd->ktd_ref > 0);
KASSERT(ktrace_on > 0);
ktrace_on--;
if (--ktd->ktd_ref <= 0) {
ktd->ktd_flags |= KTDF_DONE;
cv_signal(&ktd->ktd_cv);
}
}
static void
ktdref(struct ktr_desc *ktd)
{
KASSERT(mutex_owned(&ktrace_lock));
ktd->ktd_ref++;
ktrace_on++;
}
static struct ktr_desc *
ktd_lookup(file_t *fp)
{
struct ktr_desc *ktd;
KASSERT(mutex_owned(&ktrace_lock));
for (ktd = TAILQ_FIRST(&ktdq); ktd != NULL;
ktd = TAILQ_NEXT(ktd, ktd_list)) {
if (ktrsamefile(ktd->ktd_fp, fp)) {
ktdref(ktd);
break;
}
}
return (ktd);
}
void
ktraddentry(lwp_t *l, struct ktrace_entry *kte, int flags)
{
struct proc *p = l->l_proc;
struct ktr_desc *ktd;
#ifdef DEBUG
struct timeval t1, t2;
#endif
mutex_enter(&ktrace_lock);
if (p->p_traceflag & KTRFAC_TRC_EMUL) {
/* Add emulation trace before first entry for this process */
p->p_traceflag &= ~KTRFAC_TRC_EMUL;
mutex_exit(&ktrace_lock);
ktrexit(l);
ktremul();
(void)ktrenter(l);
mutex_enter(&ktrace_lock);
}
/* Tracing may have been cancelled. */
ktd = p->p_tracep;
if (ktd == NULL)
goto freekte;
/*
* Bump reference count so that the object will remain while
* we are here. Note that the trace is controlled by other
* process.
*/
ktdref(ktd);
if (ktd->ktd_flags & KTDF_DONE)
goto relktd;
if (ktd->ktd_qcount > ktd_maxentry) {
ktd_logerrl(ktd, KTDE_ENOSPC);
goto relktd;
}
TAILQ_INSERT_TAIL(&ktd->ktd_queue, kte, kte_list);
ktd->ktd_qcount++;
if (ktd->ktd_flags & KTDF_BLOCKING)
goto skip_sync;
if (flags & KTA_WAITOK &&
(/* flags & KTA_LARGE */0 || ktd->ktd_flags & KTDF_WAIT ||
ktd->ktd_qcount > ktd_maxentry >> 1))
/*
* Sync with writer thread since we're requesting rather
* big one or many requests are pending.
*/
do {
ktd->ktd_flags |= KTDF_WAIT;
ktd_wakeup(ktd);
#ifdef DEBUG
getmicrouptime(&t1);
#endif
if (cv_timedwait(&ktd->ktd_sync_cv, &ktrace_lock,
ktd_timeout * hz) != 0) {
ktd->ktd_flags |= KTDF_BLOCKING;
/*
* Maybe the writer thread is blocking
* completely for some reason, but
* don't stop target process forever.
*/
log(LOG_NOTICE, "ktrace timeout\n");
break;
}
#ifdef DEBUG
getmicrouptime(&t2);
timersub(&t2, &t1, &t2);
if (t2.tv_sec > 0)
log(LOG_NOTICE,
"ktrace long wait: %lld.%06ld\n",
(long long)t2.tv_sec, (long)t2.tv_usec);
#endif
} while (p->p_tracep == ktd &&
(ktd->ktd_flags & (KTDF_WAIT | KTDF_DONE)) == KTDF_WAIT);
else {
/* Schedule delayed wakeup */
if (ktd->ktd_qcount > ktd->ktd_delayqcnt)
ktd_wakeup(ktd); /* Wakeup now */
else if (!callout_pending(&ktd->ktd_wakch))
callout_reset(&ktd->ktd_wakch,
ktd->ktd_flags & KTDF_INTERACTIVE ?
ktd->ktd_intrwakdl : ktd->ktd_wakedelay,
ktd_callout, ktd);
}
skip_sync:
ktdrel(ktd);
mutex_exit(&ktrace_lock);
ktrexit(l);
return;
relktd:
ktdrel(ktd);
freekte:
mutex_exit(&ktrace_lock);
ktefree(kte);
ktrexit(l);
}
static void
ktefree(struct ktrace_entry *kte)
{
if (kte->kte_buf != kte->kte_space)
kmem_free(kte->kte_buf, kte->kte_bufsz);
pool_cache_put(kte_cache, kte);
}
/*
* "deep" compare of two files for the purposes of clearing a trace.
* Returns true if they're the same open file, or if they point at the
* same underlying vnode/socket.
*/
static int
ktrsamefile(file_t *f1, file_t *f2)
{
return ((f1 == f2) ||
((f1 != NULL) && (f2 != NULL) &&
(f1->f_type == f2->f_type) &&
(f1->f_data == f2->f_data)));
}
void
ktrderef(struct proc *p)
{
struct ktr_desc *ktd = p->p_tracep;
KASSERT(mutex_owned(&ktrace_lock));
p->p_traceflag = 0;
if (ktd == NULL)
return;
p->p_tracep = NULL;
cv_broadcast(&ktd->ktd_sync_cv);
ktdrel(ktd);
}
void
ktradref(struct proc *p)
{
struct ktr_desc *ktd = p->p_tracep;
KASSERT(mutex_owned(&ktrace_lock));
ktdref(ktd);
}
static int
ktrderefall(struct ktr_desc *ktd, int auth)
{
lwp_t *curl = curlwp;
struct proc *p;
int error = 0;
mutex_enter(&proc_lock);
PROCLIST_FOREACH(p, &allproc) {
if (p->p_tracep != ktd)
continue;
mutex_enter(p->p_lock);
mutex_enter(&ktrace_lock);
if (p->p_tracep == ktd) {
if (!auth || ktrcanset(curl, p))
ktrderef(p);
else
error = EPERM;
}
mutex_exit(&ktrace_lock);
mutex_exit(p->p_lock);
}
mutex_exit(&proc_lock);
return error;
}
int
ktealloc(struct ktrace_entry **ktep, void **bufp, lwp_t *l, int type,
size_t sz)
{
struct proc *p = l->l_proc;
struct ktrace_entry *kte;
struct ktr_header *kth;
void *buf;
if (ktrenter(l))
return EAGAIN;
kte = pool_cache_get(kte_cache, PR_WAITOK);
if (sz > sizeof(kte->kte_space)) {
buf = kmem_alloc(sz, KM_SLEEP);
} else
buf = kte->kte_space;
kte->kte_bufsz = sz;
kte->kte_buf = buf;
kth = &kte->kte_kth;
(void)memset(kth, 0, sizeof(*kth));
kth->ktr_len = sz;
kth->ktr_type = type;
kth->ktr_pid = p->p_pid;
memcpy(kth->ktr_comm, p->p_comm, MAXCOMLEN);
kth->ktr_version = KTRFAC_VERSION(p->p_traceflag);
kth->ktr_lid = l->l_lid;
nanotime(&kth->ktr_ts);
*ktep = kte;
*bufp = buf;
return 0;
}
void
ktesethdrlen(struct ktrace_entry *kte, size_t l)
{
kte->kte_kth.ktr_len = l;
}
void
ktr_syscall(register_t code, const register_t args[], int narg)
{
lwp_t *l = curlwp;
struct proc *p = l->l_proc;
struct ktrace_entry *kte;
struct ktr_syscall *ktp;
register_t *argp;
size_t len;
u_int i;
if (!KTRPOINT(p, KTR_SYSCALL))
return;
len = sizeof(struct ktr_syscall) + narg * sizeof argp[0];
if (ktealloc(&kte, (void *)&ktp, l, KTR_SYSCALL, len))
return;
ktp->ktr_code = code;
ktp->ktr_argsize = narg * sizeof argp[0];
argp = (register_t *)(ktp + 1);
for (i = 0; i < narg; i++)
*argp++ = args[i];
ktraddentry(l, kte, KTA_WAITOK);
}
void
ktr_sysret(register_t code, int error, register_t *retval)
{
lwp_t *l = curlwp;
struct ktrace_entry *kte;
struct ktr_sysret *ktp;
if (!KTRPOINT(l->l_proc, KTR_SYSRET))
return;
if (ktealloc(&kte, (void *)&ktp, l, KTR_SYSRET,
sizeof(struct ktr_sysret)))
return;
ktp->ktr_code = code;
ktp->ktr_eosys = 0; /* XXX unused */
ktp->ktr_error = error;
ktp->ktr_retval = retval && error == 0 ? retval[0] : 0;
ktp->ktr_retval_1 = retval && error == 0 ? retval[1] : 0;
ktraddentry(l, kte, KTA_WAITOK);
}
void
ktr_namei(const char *path, size_t pathlen)
{
lwp_t *l = curlwp;
if (!KTRPOINT(l->l_proc, KTR_NAMEI))
return;
ktr_kmem(l, KTR_NAMEI, path, pathlen);
}
void
ktr_namei2(const char *eroot, size_t erootlen,
const char *path, size_t pathlen)
{
lwp_t *l = curlwp;
struct ktrace_entry *kte;
void *buf;
if (!KTRPOINT(l->l_proc, KTR_NAMEI))
return;
if (ktealloc(&kte, &buf, l, KTR_NAMEI, erootlen + pathlen))
return;
memcpy(buf, eroot, erootlen);
buf = (char *)buf + erootlen;
memcpy(buf, path, pathlen);
ktraddentry(l, kte, KTA_WAITOK);
}
void
ktr_emul(void)
{
lwp_t *l = curlwp;
const char *emul = l->l_proc->p_emul->e_name;
if (!KTRPOINT(l->l_proc, KTR_EMUL))
return;
ktr_kmem(l, KTR_EMUL, emul, strlen(emul));
}
void
ktr_execarg(const void *bf, size_t len)
{
lwp_t *l = curlwp;
if (!KTRPOINT(l->l_proc, KTR_EXEC_ARG))
return;
ktr_kmem(l, KTR_EXEC_ARG, bf, len);
}
void
ktr_execenv(const void *bf, size_t len)
{
lwp_t *l = curlwp;
if (!KTRPOINT(l->l_proc, KTR_EXEC_ENV))
return;
ktr_kmem(l, KTR_EXEC_ENV, bf, len);
}
void
ktr_execfd(int fd, u_int dtype)
{
struct ktrace_entry *kte;
struct ktr_execfd* ktp;
lwp_t *l = curlwp;
if (!KTRPOINT(l->l_proc, KTR_EXEC_FD))
return;
if (ktealloc(&kte, (void *)&ktp, l, KTR_EXEC_FD, sizeof(*ktp)))
return;
ktp->ktr_fd = fd;
ktp->ktr_dtype = dtype;
ktraddentry(l, kte, KTA_WAITOK);
}
static void
ktr_kmem(lwp_t *l, int type, const void *bf, size_t len)
{
struct ktrace_entry *kte;
void *buf;
if (ktealloc(&kte, &buf, l, type, len))
return;
memcpy(buf, bf, len);
ktraddentry(l, kte, KTA_WAITOK);
}
static void
ktr_io(lwp_t *l, int fd, enum uio_rw rw, struct iovec *iov, size_t len)
{
struct ktrace_entry *kte;
struct ktr_genio *ktp;
size_t resid = len, cnt, buflen;
char *cp;
next:
buflen = uimin(PAGE_SIZE, resid + sizeof(struct ktr_genio));
if (ktealloc(&kte, (void *)&ktp, l, KTR_GENIO, buflen))
return;
ktp->ktr_fd = fd;
ktp->ktr_rw = rw;
cp = (void *)(ktp + 1);
buflen -= sizeof(struct ktr_genio);
kte->kte_kth.ktr_len = sizeof(struct ktr_genio);
while (buflen > 0) {
cnt = uimin(iov->iov_len, buflen);
if (copyin(iov->iov_base, cp, cnt) != 0)
goto out;
kte->kte_kth.ktr_len += cnt;
cp += cnt;
buflen -= cnt;
resid -= cnt;
iov->iov_len -= cnt;
if (iov->iov_len == 0)
iov++;
else
iov->iov_base = (char *)iov->iov_base + cnt;
}
/*
* Don't push so many entry at once. It will cause kmem map
* shortage.
*/
ktraddentry(l, kte, KTA_WAITOK | KTA_LARGE);
if (resid > 0) {
if (preempt_needed()) {
(void)ktrenter(l);
preempt();
ktrexit(l);
}
goto next;
}
return;
out:
ktefree(kte);
ktrexit(l);
}
void
ktr_genio(int fd, enum uio_rw rw, const void *addr, size_t len, int error)
{
lwp_t *l = curlwp;
struct iovec iov;
if (!KTRPOINT(l->l_proc, KTR_GENIO) || error != 0)
return;
iov.iov_base = __UNCONST(addr);
iov.iov_len = len;
ktr_io(l, fd, rw, &iov, len);
}
void
ktr_geniov(int fd, enum uio_rw rw, struct iovec *iov, size_t len, int error)
{
lwp_t *l = curlwp;
if (!KTRPOINT(l->l_proc, KTR_GENIO) || error != 0)
return;
ktr_io(l, fd, rw, iov, len);
}
void
ktr_mibio(int fd, enum uio_rw rw, const void *addr, size_t len, int error)
{
lwp_t *l = curlwp;
struct iovec iov;
if (!KTRPOINT(l->l_proc, KTR_MIB) || error != 0)
return;
iov.iov_base = __UNCONST(addr);
iov.iov_len = len;
ktr_io(l, fd, rw, &iov, len);
}
void
ktr_psig(int sig, sig_t action, const sigset_t *mask,
const ksiginfo_t *ksi)
{
struct ktrace_entry *kte;
lwp_t *l = curlwp;
struct {
struct ktr_psig kp;
siginfo_t si;
} *kbuf;
if (!KTRPOINT(l->l_proc, KTR_PSIG))
return;
if (ktealloc(&kte, (void *)&kbuf, l, KTR_PSIG, sizeof(*kbuf)))
return;
memset(&kbuf->kp, 0, sizeof(kbuf->kp));
kbuf->kp.signo = (char)sig;
kbuf->kp.action = action;
kbuf->kp.mask = *mask;
if (ksi) {
kbuf->kp.code = KSI_TRAPCODE(ksi);
(void)memset(&kbuf->si, 0, sizeof(kbuf->si));
kbuf->si._info = ksi->ksi_info;
kte->kte_kth.ktr_len = sizeof(*kbuf);
} else {
kbuf->kp.code = 0;
kte->kte_kth.ktr_len = sizeof(struct ktr_psig);
}
ktraddentry(l, kte, KTA_WAITOK);
}
void
ktr_csw(int out, int user, const struct syncobj *syncobj)
{
lwp_t *l = curlwp;
struct proc *p = l->l_proc;
struct ktrace_entry *kte;
struct ktr_csw *kc;
if (!KTRPOINT(p, KTR_CSW))
return;
/*
* Don't record context switches resulting from blocking on
* locks; the results are not useful, and the mutex may be in a
* softint, which would lead us to ktealloc in softint context,
* which is forbidden.
*/
if (syncobj == &mutex_syncobj || syncobj == &rw_syncobj)
return;
KASSERT(!cpu_intr_p());
KASSERT(!cpu_softintr_p());
/*
* We can't sleep if we're already going to sleep (if original
* condition is met during sleep, we hang up).
*
* XXX This is not ideal: it would be better to maintain a pool
* of ktes and actually push this to the kthread when context
* switch happens, however given the points where we are called
* from that is difficult to do.
*/
if (out) {
if (ktrenter(l))
return;
nanotime(&l->l_ktrcsw);
l->l_pflag |= LP_KTRCSW;
if (user)
l->l_pflag |= LP_KTRCSWUSER;
else
l->l_pflag &= ~LP_KTRCSWUSER;
ktrexit(l);
return;
}
/*
* On the way back in, we need to record twice: once for entry, and
* once for exit.
*/
if ((l->l_pflag & LP_KTRCSW) != 0) {
struct timespec *ts;
l->l_pflag &= ~LP_KTRCSW;
if (ktealloc(&kte, (void *)&kc, l, KTR_CSW, sizeof(*kc)))
return;
kc->out = 1;
kc->user = ((l->l_pflag & LP_KTRCSWUSER) != 0);
ts = &l->l_ktrcsw;
switch (KTRFAC_VERSION(p->p_traceflag)) {
case 0:
kte->kte_kth.ktr_otv.tv_sec = ts->tv_sec;
kte->kte_kth.ktr_otv.tv_usec = ts->tv_nsec / 1000;
break;
case 1:
kte->kte_kth.ktr_ots.tv_sec = ts->tv_sec;
kte->kte_kth.ktr_ots.tv_nsec = ts->tv_nsec;
break;
case 2:
kte->kte_kth.ktr_ts.tv_sec = ts->tv_sec;
kte->kte_kth.ktr_ts.tv_nsec = ts->tv_nsec;
break;
default:
break;
}
ktraddentry(l, kte, KTA_WAITOK);
}
if (ktealloc(&kte, (void *)&kc, l, KTR_CSW, sizeof(*kc)))
return;
kc->out = 0;
kc->user = user;
ktraddentry(l, kte, KTA_WAITOK);
}
bool
ktr_point(int fac_bit)
{
return curlwp->l_proc->p_traceflag & fac_bit;
}
int
ktruser(const char *id, void *addr, size_t len, int ustr)
{
struct ktrace_entry *kte;
struct ktr_user *ktp;
lwp_t *l = curlwp;
void *user_dta;
int error;
if (!KTRPOINT(l->l_proc, KTR_USER))
return 0;
if (len > KTR_USER_MAXLEN)
return ENOSPC;
error = ktealloc(&kte, (void *)&ktp, l, KTR_USER, sizeof(*ktp) + len);
if (error != 0)
return error;
if (ustr) {
if (copyinstr(id, ktp->ktr_id, KTR_USER_MAXIDLEN, NULL) != 0)
ktp->ktr_id[0] = '\0';
} else
strncpy(ktp->ktr_id, id, KTR_USER_MAXIDLEN);
ktp->ktr_id[KTR_USER_MAXIDLEN-1] = '\0';
user_dta = (void *)(ktp + 1);
if ((error = copyin(addr, user_dta, len)) != 0)
kte->kte_kth.ktr_len = 0;
ktraddentry(l, kte, KTA_WAITOK);
return error;
}
void
ktr_kuser(const char *id, const void *addr, size_t len)
{
struct ktrace_entry *kte;
struct ktr_user *ktp;
lwp_t *l = curlwp;
int error;
if (!KTRPOINT(l->l_proc, KTR_USER))
return;
if (len > KTR_USER_MAXLEN)
return;
error = ktealloc(&kte, (void *)&ktp, l, KTR_USER, sizeof(*ktp) + len);
if (error != 0)
return;
strncpy(ktp->ktr_id, id, KTR_USER_MAXIDLEN - 1);
ktp->ktr_id[KTR_USER_MAXIDLEN - 1] = '\0';
memcpy(ktp + 1, addr, len);
ktraddentry(l, kte, KTA_WAITOK);
}
void
ktr_mib(const int *name, u_int namelen)
{
struct ktrace_entry *kte;
int *namep;
size_t size;
lwp_t *l = curlwp;
if (!KTRPOINT(l->l_proc, KTR_MIB))
return;
size = namelen * sizeof(*name);
if (ktealloc(&kte, (void *)&namep, l, KTR_MIB, size))
return;
(void)memcpy(namep, name, namelen * sizeof(*name));
ktraddentry(l, kte, KTA_WAITOK);
}
/* Interface and common routines */
int
ktrace_common(lwp_t *curl, int ops, int facs, int pid, file_t **fpp)
{
struct proc *p;
struct pgrp *pg;
struct ktr_desc *ktd = NULL, *nktd;
file_t *fp = *fpp;
int ret = 0;
int error = 0;
int descend;