forked from urbit/vere
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtrace.c
1122 lines (988 loc) · 26.7 KB
/
trace.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
/// @file
#include "trace.h"
#include <errno.h>
#include <pthread.h>
#include <sys/stat.h>
#include <time.h>
#include "allocate.h"
#include "imprison.h"
#include "jets/k.h"
#include "log.h"
#include "manage.h"
#include "options.h"
#include "retrieve.h"
#include "vortex.h"
u3t_trace u3t_Trace;
static c3_o _ct_lop_o;
/// Nock PID.
static pid_t _nock_pid_i = 0;
/// JSON trace file.
static FILE* _file_u = NULL;
/// Trace counter. Tracks the number of entries written to the JSON trace file.
static c3_w _trace_cnt_w = 0;
/// File counter. Tracks the number of times u3t_trace_close() has been called.
static c3_w _file_cnt_w = 0;
/* u3t_push(): push on trace stack.
*/
void
u3t_push(u3_noun mon)
{
u3R->bug.tax = u3nc(mon, u3R->bug.tax);
}
/* u3t_mean(): push `[%mean roc]` on trace stack.
*/
void
u3t_mean(u3_noun roc)
{
u3R->bug.tax = u3nc(u3nc(c3__mean, roc), u3R->bug.tax);
}
/* u3t_drop(): drop from meaning stack.
*/
void
u3t_drop(void)
{
u3_assert(_(u3du(u3R->bug.tax)));
{
u3_noun tax = u3R->bug.tax;
u3R->bug.tax = u3k(u3t(tax));
u3z(tax);
}
}
/* u3t_slog(): print directly.
*/
void
u3t_slog(u3_noun hod)
{
if ( 0 != u3C.slog_f ) {
u3C.slog_f(hod);
}
else {
u3z(hod);
}
}
/* u3t_heck(): profile point.
*/
void
u3t_heck(u3_atom cog)
{
#if 0
u3R->pro.cel_d++;
#else
c3_w len_w = u3r_met(3, cog);
c3_c* str_c = alloca(1 + len_w);
u3r_bytes(0, len_w, (c3_y *)str_c, cog);
str_c[len_w] = 0;
// Profile sampling, because it allocates on the home road,
// only works on when we're not at home.
//
if ( &(u3H->rod_u) != u3R ) {
u3a_road* rod_u;
rod_u = u3R;
u3R = &(u3H->rod_u);
{
if ( 0 == u3R->pro.day ) {
u3R->pro.day = u3do("doss", 0);
}
u3R->pro.day = u3dc("pi-heck", u3i_string(str_c), u3R->pro.day);
}
u3R = rod_u;
}
#endif
}
#if 0
static void
_ct_sane(u3_noun lab)
{
if ( u3_nul != lab ) {
u3_assert(c3y == u3du(lab));
u3_assert(c3y == u3ud(u3h(lab)));
_ct_sane(u3t(lab));
}
}
#endif
#if 1
/* _t_samp_process(): process raw sample data from live road.
*/
static u3_noun
_t_samp_process(u3_road* rod_u)
{
u3_noun pef = u3_nul; // (list (pair path (map path ,@ud)))
u3_noun muf = u3_nul; // (map path ,@ud)
c3_w len_w = 0;
// Accumulate a label/map stack which collapses recursive segments.
//
while ( rod_u ) {
u3_noun don = rod_u->pro.don;
while ( u3_nul != don ) {
// Get surface allocated label
//
// u3_noun lab = u3nc(u3i_string("foobar"), 0);
u3_noun laj = u3h(don),
lab = u3a_take(laj);
u3a_wash(laj);
// Add the label to the traced label stack, trimming recursion.
//
{
u3_noun old;
if ( u3_none == (old = u3kdb_get(u3k(muf), u3k(lab))) ) {
muf = u3kdb_put(muf, u3k(lab), len_w);
pef = u3nc(u3nc(lab, u3k(muf)), pef);
len_w += 1;
}
else {
if ( !_(u3a_is_cat(old)) ) {
u3m_bail(c3__fail);
}
u3z(muf);
while ( len_w > (old + 1) ) {
u3_noun t_pef = u3k(u3t(pef));
len_w -= 1;
u3z(pef);
pef = t_pef;
}
muf = u3k(u3t(u3h(pef)));
u3z(lab);
}
}
don = u3t(don);
}
rod_u = u3tn(u3_road, rod_u->par_p);
}
u3z(muf);
// Lose the maps and save a pure label stack in original order.
//
{
u3_noun pal = u3_nul;
while ( u3_nul != pef ) {
u3_noun h_pef = u3h(pef);
u3_noun t_pef = u3k(u3t(pef));
pal = u3nc(u3k(u3h(h_pef)), pal);
u3z(pef);
pef = t_pef;
}
// u3l_log("sample: stack length %d", u3kb_lent(u3k(pal)));
return pal;
}
}
#endif
/* u3t_samp(): sample.
*/
void
u3t_samp(void)
{
if ( c3y == _ct_lop_o ) {
// _ct_lop_o here is a mutex for modifying pro.don. we
// do not want to sample in the middle of doing that, as
// it can cause memory errors.
return;
}
c3_w old_wag = u3C.wag_w;
u3C.wag_w &= ~u3o_debug_cpu;
u3C.wag_w &= ~u3o_trace;
// Profile sampling, because it allocates on the home road,
// only works on when we're not at home.
//
if ( &(u3H->rod_u) != u3R ) {
c3_l mot_l;
u3a_road* rod_u;
if ( _(u3T.mal_o) ) {
mot_l = c3_s3('m','a','l');
}
else if ( _(u3T.coy_o) ) {
mot_l = c3_s3('c','o','y');
}
else if ( _(u3T.euq_o) ) {
mot_l = c3_s3('e','u','q');
}
else if ( _(u3T.far_o) ) {
mot_l = c3_s3('f','a','r');
}
else if ( _(u3T.noc_o) ) {
u3_assert(!_(u3T.glu_o));
mot_l = c3_s3('n','o','c');
}
else if ( _(u3T.glu_o) ) {
mot_l = c3_s3('g','l','u');
}
else {
mot_l = c3_s3('f','u','n');
}
rod_u = u3R;
u3R = &(u3H->rod_u);
{
u3_noun lab = _t_samp_process(rod_u);
u3_assert(u3R == &u3H->rod_u);
if ( 0 == u3R->pro.day ) {
/* bunt a +doss
*/
u3R->pro.day = u3nt(u3nq(0, 0, 0, u3nq(0, 0, 0, 0)), 0, 0);
}
u3R->pro.day = u3dt("pi-noon", mot_l, lab, u3R->pro.day);
}
u3R = rod_u;
}
u3C.wag_w = old_wag;
}
/* u3t_come(): push on profile stack; return yes if active push. RETAIN.
*/
c3_o
u3t_come(u3_noun lab)
{
if ( (u3_nul == u3R->pro.don) || !_(u3r_sing(lab, u3h(u3R->pro.don))) ) {
u3a_gain(lab);
_ct_lop_o = c3y;
u3R->pro.don = u3nc(lab, u3R->pro.don);
_ct_lop_o = c3n;
return c3y;
}
else return c3n;
}
/* u3t_flee(): pop off profile stack.
*/
void
u3t_flee(void)
{
_ct_lop_o = c3y;
u3_noun don = u3R->pro.don;
u3R->pro.don = u3k(u3t(don));
_ct_lop_o = c3n;
u3z(don);
}
/* u3t_trace_open(): opens a trace file and writes the preamble.
*/
void
u3t_trace_open(const c3_c* dir_c)
{
c3_c fil_c[2048];
if ( !dir_c ) {
return;
}
snprintf(fil_c, 2048, "%s/.urb/put/trace", dir_c);
struct stat st;
if ( (-1 == stat(fil_c, &st))
&& (-1 == c3_mkdir(fil_c, 0700)) )
{
fprintf(stderr, "mkdir: %s failed: %s\r\n", fil_c, strerror(errno));
return;
}
c3_c lif_c[2056];
snprintf(lif_c, 2056, "%s/%d.json", fil_c, _file_cnt_w);
_file_u = c3_fopen(lif_c, "w");
_nock_pid_i = (int)getpid();
if ( !_file_u ) {
fprintf(stderr, "trace open: %s\r\n", strerror(errno));
return;
}
fprintf(_file_u, "[ ");
// We have two "threads", the event processing and the nock stuff.
// tid 1 = event processing
// tid 2 = nock processing
fprintf(_file_u,
"{\"name\": \"process_name\", \"ph\": \"M\", \"pid\": %d, \"args\": "
"{\"name\": \"urbit\"}},\n",
_nock_pid_i);
fprintf(_file_u,
"{\"name\": \"thread_name\", \"ph\": \"M\", \"pid\": %d, \"tid\": 1, "
"\"args\": {\"name\": \"Event Processing\"}},\n",
_nock_pid_i);
fprintf(_file_u,
"{\"name\": \"thread_sort_index\", \"ph\": \"M\", \"pid\": %d, "
"\"tid\": 1, \"args\": {\"sort_index\": 1}},\n",
_nock_pid_i);
fprintf(_file_u,
"{\"name\": \"thread_name\", \"ph\": \"M\", \"pid\": %d, \"tid\": 2, "
"\"args\": {\"name\": \"Nock\"}},\n",
_nock_pid_i);
fprintf(_file_u,
"{\"name\": \"thread_sort_index\", \"ph\": \"M\", \"pid\": %d, "
"\"tid\": 2, \"args\": {\"sort_index\": 2}},\n",
_nock_pid_i);
_trace_cnt_w = 5;
}
/* u3t_trace_close(): closes a trace file. optional.
*/
void
u3t_trace_close(void)
{
if ( !_file_u )
return;
// We don't terminate the JSON because of the file format.
fclose(_file_u);
_trace_cnt_w = 0;
_file_cnt_w++;
}
/* u3t_trace_time(): microsecond clock
*/
c3_d u3t_trace_time(void)
{
struct timeval tim_tv;
gettimeofday(&tim_tv, 0);
return 1000000ULL * tim_tv.tv_sec + tim_tv.tv_usec;
}
/* u3t_nock_trace_push(): push a trace onto the trace stack; returns yes if pushed.
*
* The trace stack is a stack of [path time-entered].
*/
c3_o
u3t_nock_trace_push(u3_noun lab)
{
if ( !_file_u )
return c3n;
if ( (u3_nul == u3R->pro.trace) ||
!_(u3r_sing(lab, u3h(u3h(u3R->pro.trace)))) ) {
u3a_gain(lab);
c3_d time = u3t_trace_time();
u3R->pro.trace = u3nc(u3nc(lab, u3i_chubs(1, &time)), u3R->pro.trace);
return c3y;
}
else {
return c3n;
}
}
/* u3t_nock_trace_pop(): pops a trace from the trace stack.
*
* When we remove the trace from the stack, we check to see if the sample is
* large enough to process, as we'll otherwise keep track of individual +add
* calls. If it is, we write it out to the tracefile.
*/
void
u3t_nock_trace_pop(void)
{
if ( !_file_u )
return;
u3_noun trace = u3R->pro.trace;
u3R->pro.trace = u3k(u3t(trace));
u3_noun item = u3h(trace);
u3_noun lab = u3h(item);
c3_d start_time = u3r_chub(0, u3t(item));
// 33microseconds (a 30th of a millisecond).
c3_d duration = u3t_trace_time() - start_time;
if (duration > 33) {
c3_c* name = u3m_pretty_path(lab);
fprintf(_file_u,
"{\"cat\": \"nock\", \"name\": \"%s\", \"ph\":\"%c\", \"pid\": %d, "
"\"tid\": 2, \"ts\": %" PRIu64 ", \"dur\": %" PRIu64 "}, \n",
name,
'X',
_nock_pid_i,
start_time,
duration);
c3_free(name);
_trace_cnt_w++;
}
u3z(trace);
}
/* u3t_event_trace(): dumps a simple event from outside nock.
*/
void
u3t_event_trace(const c3_c* name, c3_c type)
{
if ( !_file_u )
return;
fprintf(_file_u,
"{\"cat\": \"event\", \"name\": \"%s\", \"ph\":\"%c\", \"pid\": %d, "
"\"tid\": 1, \"ts\": %" PRIu64 ", \"id\": \"0x100\"}, \n",
name,
type,
_nock_pid_i,
u3t_trace_time());
_trace_cnt_w++;
}
/* u3t_print_steps: print step counter.
*/
void
u3t_print_steps(FILE* fil_u, c3_c* cap_c, c3_d sep_d)
{
u3_assert( 0 != fil_u );
c3_w gib_w = (sep_d / 1000000000ULL);
c3_w mib_w = (sep_d % 1000000000ULL) / 1000000ULL;
c3_w kib_w = (sep_d % 1000000ULL) / 1000ULL;
c3_w bib_w = (sep_d % 1000ULL);
// XX prints to stderr since it's called on shutdown, daemon may be gone
//
if ( sep_d ) {
if ( gib_w ) {
fprintf(fil_u, "%s: G/%d.%03d.%03d.%03d\r\n",
cap_c, gib_w, mib_w, kib_w, bib_w);
}
else if ( mib_w ) {
fprintf(fil_u, "%s: M/%d.%03d.%03d\r\n", cap_c, mib_w, kib_w, bib_w);
}
else if ( kib_w ) {
fprintf(fil_u, "%s: K/%d.%03d\r\n", cap_c, kib_w, bib_w);
}
else if ( bib_w ) {
fprintf(fil_u, "%s: %d\r\n", cap_c, bib_w);
}
}
}
/* u3t_damp(): print and clear profile data.
*/
void
u3t_damp(FILE* fil_u)
{
u3_assert( 0 != fil_u );
if ( 0 != u3R->pro.day ) {
u3_noun wol = u3do("pi-tell", u3R->pro.day);
// XX prints to stderr since it's called on shutdown, daemon may be gone
//
{
u3_noun low = wol;
while ( u3_nul != low ) {
c3_c* str_c = (c3_c*)u3r_tape(u3h(low));
fputs(str_c, fil_u);
fputs("\r\n", fil_u);
c3_free(str_c);
low = u3t(low);
}
u3z(wol);
}
/* bunt a +doss
*/
u3R->pro.day = u3nt(u3nq(0, 0, 0, u3nq(0, 0, 0, 0)), 0, 0);
}
u3t_print_steps(fil_u, "nocks", u3R->pro.nox_d);
u3t_print_steps(fil_u, "cells", u3R->pro.cel_d);
u3R->pro.nox_d = 0;
u3R->pro.cel_d = 0;
}
/* _ct_sigaction(): profile sigaction callback.
*/
void _ct_sigaction(c3_i x_i)
{
u3t_samp();
}
/* u3t_init(): initialize tracing layer.
*/
void
u3t_init(void)
{
u3T.noc_o = c3n;
u3T.glu_o = c3n;
u3T.mal_o = c3n;
u3T.far_o = c3n;
u3T.coy_o = c3n;
u3T.euq_o = c3n;
}
c3_w
u3t_trace_cnt(void)
{
return _trace_cnt_w;
}
c3_w
u3t_file_cnt(void)
{
return _file_cnt_w;
}
/* u3t_boot(): turn sampling on.
*/
void
u3t_boot(void)
{
if ( u3C.wag_w & u3o_debug_cpu ) {
_ct_lop_o = c3n;
#if defined(U3_OS_PROF)
// skip profiling if we don't yet have an arvo kernel
//
if ( 0 == u3A->roc ) {
return;
}
// Register _ct_sigaction to be called on `SIGPROF`.
{
struct sigaction sig_s = {{0}};
sig_s.sa_handler = _ct_sigaction;
sigemptyset(&(sig_s.sa_mask));
sigaction(SIGPROF, &sig_s, 0);
}
// Unblock `SIGPROF` for this thread (we will block it again when `u3t_boff` is called).
{
sigset_t set;
sigemptyset(&set);
sigaddset(&set, SIGPROF);
if ( 0 != pthread_sigmask(SIG_UNBLOCK, &set, NULL) ) {
u3l_log("trace: thread mask SIGPROF: %s", strerror(errno));
}
}
// Ask for SIGPROF to be sent every 10ms.
{
struct itimerval itm_v = {{0}};
itm_v.it_interval.tv_usec = 10000;
itm_v.it_value = itm_v.it_interval;
setitimer(ITIMER_PROF, &itm_v, 0);
}
#endif
}
}
/* u3t_boff(): turn profile sampling off.
*/
void
u3t_boff(void)
{
if ( u3C.wag_w & u3o_debug_cpu ) {
#if defined(U3_OS_PROF)
// Mask SIGPROF signals in this thread (and this is the only
// thread that unblocked them).
{
sigset_t set;
sigemptyset(&set);
sigaddset(&set, SIGPROF);
if ( 0 != pthread_sigmask(SIG_BLOCK, &set, NULL) ) {
u3l_log("trace: thread mask SIGPROF: %s", strerror(errno));
}
}
// Disable the SIGPROF timer.
{
struct itimerval itm_v = {{0}};
setitimer(ITIMER_PROF, &itm_v, 0);
}
// Ignore SIGPROF signals.
{
struct sigaction sig_s = {{0}};
sigemptyset(&(sig_s.sa_mask));
sig_s.sa_handler = SIG_IGN;
sigaction(SIGPROF, &sig_s, 0);
}
#endif
}
}
/* u3t_slog_cap(): slog a tank with a caption with
** a given priority c3_l (assumed 0-3).
*/
void
u3t_slog_cap(c3_l pri_l, u3_noun cap, u3_noun tan)
{
u3t_slog(
u3nc(
pri_l,
u3nt(
c3__rose,
u3nt(u3nt(':', ' ', u3_nul), u3_nul, u3_nul),
u3nt(cap, tan, u3_nul)
)
)
);
}
/* u3t_slog_trace(): given a c3_l priority pri and a raw stack tax
** flop the order into start-to-end, render, and slog each item
** until done.
*/
void
u3t_slog_trace(c3_l pri_l, u3_noun tax)
{
// render the stack
// Note: ton is a reference to a data struct
// we have just allocated
// lit is used as a moving cursor pointer through
// that allocated struct
// once we finish lit will be null, but ton will still
// point to the whole valid allocated data structure
// and thus we can free it safely at the end of the func
// to clean up after ourselves.
// Note: flop reverses the stack trace list 'tax'
u3_noun ton = u3dc("mook", 2, u3kb_flop(tax));
u3_noun lit = u3t(ton);
// print the stack one stack item at a time
while ( u3_nul != lit ) {
u3t_slog(u3nc(pri_l, u3k(u3h(lit)) ));
lit = u3t(lit);
}
u3z(ton);
}
/* u3t_slog_nara(): slog only the deepest road's trace with
** c3_l priority pri
*/
void
u3t_slog_nara(c3_l pri_l)
{
u3_noun tax = u3k(u3R->bug.tax);
u3t_slog_trace(pri_l, tax);
}
/* u3t_slog_hela(): join all roads' traces together into one tax
** and pass it to slog_trace along with the given c3_l priority pri_l
*/
void
u3t_slog_hela(c3_l pri_l)
{
// rod_u protects us from mutating the global state
u3_road* rod_u = u3R;
// inits to the the current road's trace
u3_noun tax = u3k(rod_u->bug.tax);
// while there is a parent road ref ...
while ( &(u3H->rod_u) != rod_u ) {
// ... point at the next road and append its stack to tax
rod_u = u3tn(u3_road, rod_u->par_p);
tax = u3kb_weld(tax, u3k(rod_u->bug.tax));
}
u3t_slog_trace(pri_l, tax);
}
/* _ct_roundf(): truncate a float to precision equivalent to %.2f */
static float
_ct_roundf(float per_f)
{
// scale the percentage so that all siginificant digits
// would be retained when truncted to an int, then add 0.5
// to account for rounding without using round or roundf
float big_f = (per_f*10000)+0.5;
// truncate to int
c3_w big_w = (c3_w) big_f;
// convert to float and scale down such that
// our last two digits are right of the decimal
float tuc_f = (float) big_w/100.0;
return tuc_f;
}
/* _ct_meme_percent(): convert two ints into a percentage */
static float
_ct_meme_percent(c3_w lit_w, c3_w big_w)
{
// get the percentage of our inputs as a float
float raw_f = (float) lit_w/big_w;
return _ct_roundf(raw_f);
}
/* _ct_all_heap_size(): return the size in bytes of ALL space on the Loom
** over all roads, currently in use as heap.
*/
static c3_w
_ct_all_heap_size(u3_road* r) {
if (r == &(u3H->rod_u)) {
return u3a_heap(r)*4;
} else {
// recurse
return (u3a_heap(r)*4) + _ct_all_heap_size(u3tn(u3_road, r->par_p));
}
}
/* These two structs, bar_item and bar_info, store the mutable data
** to normalize measured Loom usage values into ints that will fit
** into a fixed width ascii bar chart.
*/
struct
bar_item {
// index
c3_w dex_w;
// lower bound
c3_w low_w;
// original value
float ori_f;
// difference
float dif_f;
};
struct
bar_info {
struct bar_item s[6];
};
/* _ct_boost_small(): we want zero to be zero,
** anything between zero and one to be one,
** and all else to be whatever it is.
*/
static float
_ct_boost_small(float num_f)
{
return
0.0 >= num_f ? 0.0:
1.0 > num_f ? 1.0:
num_f;
}
/* _ct_global_difference(): each low_w represents the normalized integer value
* of its loom item, and ideally the sum of all loom low_w
* values should be 100. This function reports how far from
* the ideal bar_u is.
*/
static c3_ws
_ct_global_difference(struct bar_info bar_u)
{
c3_w low_w = 0;
for (c3_w i=0; i < 6; i++) {
low_w += bar_u.s[i].low_w;
}
return 100 - low_w;
}
/* _ct_compute_roundoff_error(): for each loom item in bar_u
** compute the current difference between the int
** size and the original float size.
*/
static struct bar_info
_ct_compute_roundoff_error(struct bar_info bar_u)
{
for (c3_w i=0; i < 6; i++) {
bar_u.s[i].dif_f = bar_u.s[i].ori_f - bar_u.s[i].low_w;
}
return bar_u;
}
/* _ct_sort_by_roundoff_error(): sort loom items from most mis-sized to least */
static struct bar_info
_ct_sort_by_roundoff_error(struct bar_info bar_u)
{
struct bar_item tem_u;
for (c3_w i=1; i < 6; i++) {
for (c3_w j=0; j < 6-i; j++) {
if (bar_u.s[j+1].dif_f > bar_u.s[j].dif_f) {
tem_u = bar_u.s[j];
bar_u.s[j] = bar_u.s[j+1];
bar_u.s[j+1] = tem_u;
}
}
}
return bar_u;
}
/* _ct_sort_by_index(): sort loom items into loom order */
static struct bar_info
_ct_sort_by_index(struct bar_info bar_u)
{
struct bar_item tem_u;
for (c3_w i=1; i < 6; i++) {
for (c3_w j=0; j < 6-i; j++) {
if (bar_u.s[j+1].dex_w < bar_u.s[j].dex_w) {
tem_u = bar_u.s[j];
bar_u.s[j] = bar_u.s[j+1];
bar_u.s[j+1] = tem_u;
}
}
}
return bar_u;
}
/* _ct_reduce_error(): reduce error by one int step
* making oversized things a bit smaller
* and undersized things a bit bigger
*/
static struct bar_info
_ct_reduce_error(struct bar_info bar_u, c3_ws dif_s)
{
for (c3_w i=0; i < 6; i++) {
if (bar_u.s[i].low_w == 0) continue;
if (bar_u.s[i].low_w == 1) continue;
if (dif_s > 0) {
bar_u.s[i].low_w++;
dif_s--;
}
if (dif_s < 0) {
bar_u.s[i].low_w--;
dif_s++;
}
}
return bar_u;
}
/* _ct_report_bargraph(): render all six raw loom elements into a fixed-size ascii bargraph */
static void
_ct_report_bargraph(
c3_c bar_c[105], float hip_f, float hep_f, float fre_f, float pen_f, float tak_f, float tik_f
)
{
float in[6];
in[0] = _ct_boost_small(hip_f);
in[1] = _ct_boost_small(hep_f);
in[2] = _ct_boost_small(fre_f);
in[3] = _ct_boost_small(pen_f);
in[4] = _ct_boost_small(tak_f);
in[5] = _ct_boost_small(tik_f);
// init the list of structs
struct bar_info bar_u;
for (c3_w i=0; i < 6; i++) {
bar_u.s[i].dex_w = i;
bar_u.s[i].ori_f = in[i];
bar_u.s[i].low_w = (c3_w) bar_u.s[i].ori_f;
}
// repeatedly adjust for roundoff error
// until it is elemenated or we go 100 cycles
c3_ws dif_s = 0;
for (c3_w x=0; x<100; x++) {
bar_u = _ct_compute_roundoff_error(bar_u);
dif_s = _ct_global_difference(bar_u);
if (dif_s == 0) break;
bar_u = _ct_sort_by_roundoff_error(bar_u);
bar_u = _ct_reduce_error(bar_u, dif_s);
}
bar_u = _ct_sort_by_index(bar_u);
for (c3_w x=1; x<104; x++) {
bar_c[x] = ' ';
}
bar_c[0] = '[';
// create our bar chart
const c3_c sym_c[6] = "=-%#+~";
c3_w x = 0, y = 0;
for (c3_w i=0; i < 6; i++) {
x++;
for (c3_w j=0; j < bar_u.s[i].low_w; j++) {
bar_c[x+j] = sym_c[i];
y = x+j;
}
if (y > 0) x = y;
}
bar_c[101] = ']';
bar_c[102] = 0;
}
/* _ct_size_prefix(): return the correct metric scalar prifix for a given int */
static c3_c
_ct_size_prefix(c3_d num_d)
{
return
(num_d / 1000000000) ? 'G':
(num_d % 1000000000) / 1000000 ? 'M':
(num_d % 1000000) / 1000 ? 'K':
(num_d % 1000) ? ' ':
'X';
}
/* _ct_report_string(): convert a int into a string, adding a metric scale prefix letter*/
static void
_ct_report_string(c3_c rep_c[32], c3_d num_d)
{
memset(rep_c, ' ', 31);
// add the G/M/K prefix
rep_c[24] = _ct_size_prefix(num_d);
// consume wor_w into a string one base-10 digit at a time
// including dot formatting
c3_w i = 0, j = 0;
while (num_d > 0) {
if (j == 3) {
rep_c[22-i] = '.';
i++;
j = 0;
} else {
rep_c[22-i] = (num_d%10)+'0';
num_d /= 10;
i++;
j++;
}
}
}
/* _ct_etch_road_depth(): return a the current road depth as a fixed size string */
static void
_ct_etch_road_depth(c3_c rep_c[32], u3_road* r, c3_w num_w) {
if (r == &(u3H->rod_u)) {
_ct_report_string(rep_c, num_w);
// this will be incorrectly indented, so we fix that here
c3_w i = 14;
while (i > 0) {
rep_c[i] = rep_c[i+16];
rep_c[i+16] = ' ';
i--;
}
} else {
_ct_etch_road_depth(rep_c, u3tn(u3_road, r->par_p), ++num_w);
}
}
/* _ct_etch_memory(): create a single line report of a given captioned item
* with a percentage of space used and the bytes used
* scaled by a metric scaling postfix (ie MB, GB, etc)
*/
static void
_ct_etch_memory(c3_c rep_c[32], float per_f, c3_w num_w)
{
// create the basic report string
_ct_report_string(rep_c, num_w);
// add the Bytes postfix to the size report
rep_c[25] = 'B';
// add the space-percentage into the report
rep_c[2] = '0', rep_c[3] = '.', rep_c[4] = '0', rep_c[5] = '0';
c3_w per_i = (c3_w) (per_f*100);
c3_w i = 0;
while (per_i > 0 && i < 6) {
if (i != 2) {
rep_c[5-i] = (per_i%10)+'0';
per_i /= 10;