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
|
#include <stdio.h>
#include <stdlib.h>
#include "util.h"
#include <math.h>
#include "strings.h"
double allocs = 0;
int forced_length = 15;
double binomial(int n, int k){
if(n==k)
return 1.0;
double v = 1.0;
for(int i = 1; i<=k; i++){
v=v*((float)(n+1-i)/i);
}
return v;
}
void mmalloc(){
allocs++;
}
void ffree(){
allocs--;
}
int log_level = 0;
int __signal = 0;
void pexit(int s){
__signal = s;
exit(s);
}
void sig_handle(void){
#ifdef stfu
return;
#endif
if(log_level<=-1) return;
#ifndef skip_memory_trace
if(allocs>0){
char ssa[45];
sprintf(ssa,"%s | (found %i)","uneven allocations, memory leak(s)",(int)nearbyint(allocs));
warn(ssa);
}
if(allocs==0)
info("even allocations, no internal leaks");
#endif
if(__signal==0){
printf("\x1b[90mexited with \x1b[32m\x1b[1msignal [ %i ] \x1b[0m\x1b[90mgraceful exit\x1b[0m (meow)",__signal);
} else if(__signal>0){
printf("\x1b[90mexited with \x1b[31m\x1b[1msignal [ %i ] \x1b[0m\x1b[90mgraceful exit\x1b[0m",__signal);
//extra cleanup if needed
} else {
printf("\x1b[90mexited with \x1b[31m\x1b[1msignal [ %i ] \x1b[0m\x1b[90mnon-graceful exit\x1b[0m",__signal);
}
}
unsigned int_len(const unsigned n) {
if (n < 10) return 1;
return 1 + int_len(n / 10);
}//https://stackoverflow.com/a/3068415
char* force_ca_length(char*inp,int len){
char* nya = malloc(sizeof(*nya)*(len+1));
int skip = 0;
for(int i = 0;; i++){
if((inp[i]=='\0'||skip)&&i>=len)
break;
if(inp[i]=='\0')
skip=1;
if(i>=len){
for(int y = 1; y<=len; y++)
nya[y-1] = nya[y];
nya[len-1] = inp[i];
continue;
}
if(skip)
nya[i] = ' ';
else
nya[i] = inp[i];
}
if(!skip){
nya[2] = '.';
nya[1] = '.';
nya[0] = '.';
}
nya[len+1]='\0';
return nya;
}
void err_m(char*ca,void (*cb)(int),char*f,int l){
if(log_level>-1){
int len = ca_size(f) + int_len(l);
char nn[len];
sprintf(nn,"%s:%i",f,l);
char* aa = force_ca_length(nn,forced_length);
printf("\x1b[90m%s \x1b[31m[ !err ]\x1b[0m %s\n",aa,ca);
free(aa);
}
cb(1);
}
void warn_m(char*ca,char*f,int l,...){
if(log_level==-1)
return;
int len = ca_size(f) + int_len(l);
char nn[len];
sprintf(nn,"%s:%i",f,l);
char* aa = force_ca_length(nn,forced_length);
printf("\x1b[90m%s \x1b[33m[ warn ]\x1b[0m %s\n",aa,ca);
free(aa);
}
void info_m(char*ca,char*f,int l,...){
if(log_level<1)
return;
int len = ca_size(f) + int_len(l);
char nn[len];
sprintf(nn,"%s:%i",f,l);
char* aa = force_ca_length(nn,forced_length);
printf("\x1b[90m%s [ info ] %s\x1b[0m\n",aa,ca);
free(aa);
}
void log_m(char*ca,char*f,int l,...){
if(log_level<2)
return;
int len = ca_size(f) + int_len(l);
char nn[len];
sprintf(nn,"%s:%i",f,l);
char* aa = force_ca_length(nn,forced_length);
printf("\x1b[35m%s [ log ] \x1b[90m%s\x1b[0m\n",aa,ca);
free(aa);
}
void flag_handle(int argc,char* argv[]){
for(int i = 0; i<argc;i++){
if(argv[i][0]=='-'){
//partial
for(int y = 1;;y++){
if(argv[i][y]=='\0')
break;
switch(argv[i][y]){
case 'q':
log_level-=1;
break;
case 'd':case 'v':
log_level+=1;
break;
}
}
}
}
}
|
