-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy pathfenris.c
8268 lines (6461 loc) · 245 KB
/
fenris.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
/*
fenris - program execution path analysis tool
---------------------------------------------
Copyright (C) 2001, 2002 by Bindview Corporation Portions copyright (C)
2001, 2002 by their respective contributors Developed and maintained by
Michal Zalewski <[email protected]>
This program is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the Free
Software Foundation; either version 2 of the License, or (at your option)
any later version.
This program 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 General Public License for
more details.
You should have received a copy of the GNU General Public License along with
this program; if not, write to the Free Software Foundation, Inc., 675 Mass
Ave, Cambridge, MA 02139, USA.
"Almost anything derogatory you could say about today's software design
would be accurate." -- K.E. Iverson
I am not really very enthusiastic about putting all code in one file. But
GCC is just a simple compiler, and it would not be able to perform proper
inlining of functions that are in separate .c or .o files - and since this
code consists of many small, frequently called functions, PUSH, CALL, POP
and RET overhead might be noticeable.
And remember: Soylent Green is people!
Some code taken out by Marcin Gozdalik.
*/
#define _GNU_SOURCE
/* Hackish hack to import kernel stat struct without much collateral damage */
#define stat __kernel_stat
/* #define stat64 __kernel_stat64 */
/* #define old_stat __old_kernel_stat */
/* #define new_stat __kernel_stat */
#include <asm/stat.h>
#undef stat
/* #undef stat64 */
/* #undef old_stat */
/* #undef new_stat */
/* End of nasty hack. */
#include <sys/ptrace.h>
#include <sys/user.h>
#include <stdio.h>
#include <unistd.h>
#include <stdlib.h>
#include <assert.h>
#include <time.h>
#include <getopt.h>
#include <signal.h>
#include <sys/stat.h>
#include <ctype.h>
#include <sched.h>
#include <sys/types.h>
#include <sys/wait.h>
#include <errno.h>
#include <string.h>
// removed initially, possibly restore later
// #include "asmstring.h"
#include <fcntl.h>
#include <dlfcn.h>
#include <asm/unistd.h>
#include <sys/mman.h>
#include <malloc.h>
#include <asm/types.h>
#include <utime.h>
#include <sys/resource.h>
#include <linux/types.h>
#include <dirent.h>
#include <sys/vfs.h>
#include <sys/socket.h>
#include <netdb.h>
#include <grp.h>
#include <pwd.h>
#include <bfd.h>
// #include <libiberty.h>
#include "config.h"
#include "fenris.h"
#include "ioctls.h"
#include "libdisasm/libdis.h"
#include "fdebug.h"
#include "hooks.h"
// including allocs.h will automagically turn every malloc, realloc, free
// and strdup into my_malloc,my_realloc,my_free and my_strdup respectively
// you can override this by uncommenting the following line:
// #define USE_ORIGINAL_ALLOCS (but you don't want to do it for Fenris,
// otherwise, it'll break into tiny pieces and cut you badly).
#include "allocs.h"
#include "libfnprints.h"
#ifndef RTLD_NODELETE
// Damn damn damn. Bury me deep.
#define RTLD_NODELETE 0
#define DO_NOT_DLCLOSE 1
#endif /* not RTLD_NODELETE */
#define CURPCNT(x) current->pstack[current->nest][(int)current->pst_top[current->nest]+x]
char verybigbuf[200000]; // output buffer
extern int break_stopped; // The process is stopped.
extern int break_continuing;
struct signed_user_regs_struct r; // Current process: registers
unsigned char op[8]; // Current process: rip[0..8]
int pid; // Current process: pid
int in_libc; // Current process: rip in LIBCSEG?
unsigned int caddr; // Current process: CALL dest addr
unsigned int start_rip, stop_rip;
char fnm_buf[MAXDESCR]; // Local function name
struct fenris_process ps[MAXCHILDREN]; // Traced process table
struct fenris_process *current; // Currently traced process
char T_forks, T_execs, T_nocnd, T_nosym, // Execution options
T_noindent, T_nodesc, T_nomem, T_nosig, T_goaway,
T_noskip, T_addip, T_atret = 2, T_wnow, T_alwaysret, *T_dostep, T_nolast;
unsigned char be_silent;
#ifdef DEBUG
unsigned int oldip;
unsigned char oldop[8];
#endif /* DEBUG */
char nonstd;
char is_static;
char already_main;
extern int blocking_syscall;
char *running_under_ncaegir;
int runasuid, runasgid;
char *runasuser;
FILE *ostream; // Output stream
int innest = PRETTYSMALL;
unsigned int STACKSEG, CODESEG;
// FIXME:NIX hardcoded?!? more than 300+ for i386
const char *scnames[256] = {
0,
#include "syscallnames.h"
0
};
#define MPS (MAXFNAME*2)
char pdescr[MAXPDESC + 1];
struct hacking_table {
unsigned int ip;
unsigned int ad;
unsigned char va;
};
struct hacking_table reptable[MAXREP];
unsigned int reptop = 0;
void nappend(char *dst, const char *src, int max)
{
int i;
i = max - strlen(dst) + 2;
if (i <= 0)
return;
strncat(dst, src, i);
}
#define check_doret() if (current->doret) { debug("\n"); current->doret=0; }
char fatal_there;
extern int sd;
extern char break_shutup;
/************************************************************
* This is our fatal error handling routine. We have three *
* kinds of call scenarios, self-explanatory. *
************************************************************/
extern char test_leaks;
void fatal(const char *x, const int err)
{
int i;
if (T_dostep) {
signal(SIGPIPE, SIG_IGN);
break_shutup = 1;
break_sendentity();
}
switch (err) {
case -2:
case -1:
debug(">> Exit condition: %s\n", x);
break;
case 0:
debug(">> Error condition: %s\n", x);
break;
default:
debug(">> OS error : %s [%d]\n" ">> Error condition: %s\n", strerror(err), err, x);
}
if (T_dostep && !fatal_there) {
fatal_there = 1;
break_sendentity_force();
}
if (pid > 0) {
if (current && current->syscall) {
debug(">> This condition occurred during syscall %s (%d) in pid %d (rip %llx).\n",
// FIXME:NIX hardcoded?!? more than 300+ for i386
scnames[current->syscall & 0xff], current->syscall, pid, r.rip);
} else {
debug(">> This condition occurred while tracing pid %d (rip %llx).\n", pid, r.rip);
}
}
if (current && (current->cycles))
debug(">> Traced %u user CPU cycles (%d libcalls, %d fncalls, %d "
"syscalls).\n", current->cycles, current->libcalls, current->fncalls, current->syscalls);
if (err > -1)
debug("\n**************************************************\n"
"* If you believe this is because of programming *\n"
"* error, please report above message, along with *\n"
"* information about your working environment and *\n"
"* traced application, to the author of this *\n"
"* utility (e-mail: [email protected]). Thanks! *\n"
"**************************************************\n\n");
fflush(0);
fclose(ostream);
// If you go down in flames, aim for something expensive.
for (i = 0; i < MAXCHILDREN; i++)
if (ps[i].pid > 0)
kill(ps[i].pid, 9);
if (sd > 0) {
shutdown(sd, 2);
close(sd);
}
// for (i=3;i<128;i++) close(i);
if (running_under_ncaegir) {
char buf[100];
printf("\033[0;37m\n\033[1;41mFenris has terminated, press RETURN to close...\033[0;37m\n");
read(0, buf, sizeof(buf));
}
#ifdef DEBUG
if (err > -1)
abort();
#endif /* DEBUG */
exit(1);
}
/***********************************************
* Produce nice graphical indentation and such *
***********************************************/
void indent(const int corr)
{
char intbuf[MAXINDENT + 2];
int tib;
if (T_noindent)
return;
intbuf[0] = 0;
if (current->nest >= 0) {
tib = (corr + current->nest) > MAXINDENT ? MAXINDENT : (corr + current->nest);
if (tib > 0) {
memset(intbuf, ' ', tib);
intbuf[tib] = 0;
}
}
if (T_addip)
debug("[%08llx] ", r.rip);
if ((current->nest + corr) < 0)
debug("%d:-- %s", pid, intbuf);
else
debug("%d:%02d %s", pid, corr + current->nest, intbuf);
}
/********************************************************
* Here we simply execute what we have to execute after *
* fork() and syncing with our parent process. *
********************************************************/
extern int sd; // Debugger socket.
int start_child(const char **argv)
{
int ret, n = 1;
ret = fork();
if (ret < 0)
fatal("cannot fork", errno);
if (ret) {
pid = ret;
return ret;
}
if (runasuser) {
if (initgroups(runasuser, runasgid))
fatal("initgroups failed", errno);
if (setgid(runasgid))
fatal("setgid failed", errno);
if (setuid(runasuid))
fatal("setuid failed", errno);
debug("+++ [%s] Executing '%s", runasuser, argv[1]);
} else
debug("+++ Executing '%s", argv[1]);
while (argv[++n])
debug(" %s", argv[n]);
debug("' (pid %d, %s) +++\n", getpid(), is_static ? "static" : "dynamic");
fflush(0);
{
int i;
// Close our own mess.
for (i = 3; i < 64; i++)
if (i != sd)
close(i);
}
if (ptrace(PTRACE_TRACEME, 0, 0, 0))
fatal("PTRACE_TRACEME failed", errno);
execvp(argv[1], (void *)&argv[1]);
perror(">> OS error ");
kill(getppid(), SIGUSR1);
fatal("cannot execute requested binary", -1);
return 0; // sanity.
}
/*************************
* Remove signal handler *
*************************/
unsigned int get_handler(int i)
{
if (i < 0 || i >= MAXSIG)
return 0;
return current->sh[i];
}
/*******************************************
* Temporarily remove int3 traps from code *
*******************************************/
void remove_traps(void)
{
int i;
for (i = 0; i < MAXSIG; i++) {
unsigned int addr = get_handler(i);
if (!addr)
return;
if ((addr >> 24) == CODESEG || INLIBC(addr)) {
unsigned int chg;
chg = ptrace(PTRACE_PEEKDATA, pid, addr - 1, 0);
if (current->shret[i])
chg = (chg & 0xffffff00) + 0xc3; /* c3: ret */
else
chg = (chg & 0xffffff00) + 0x90; /* 90: nop */
ptrace(PTRACE_POKEDATA, pid, addr - 1, chg);
}
}
}
/************************
* Reinstall int3 traps *
************************/
void install_traps(void)
{
int i;
for (i = 0; i < MAXSIG; i++) {
unsigned int addr = get_handler(i);
if (!addr)
return;
if ((addr >> 28) == CODESEG || INLIBC(addr)) {
unsigned int chg;
chg = ptrace(PTRACE_PEEKDATA, pid, addr - 1, 0);
chg = (chg & 0xffffff00) + 0xcc; /* cc: int3 */
ptrace(PTRACE_POKEDATA, pid, addr - 1, chg);
}
}
}
#define remove_handler(i) add_handler(i,0)
/**********************
* Add signal handler *
**********************/
void add_handler(int i, unsigned int a)
{
if (i < 0 || i >= MAXSIG)
return;
current->sh[i] = a;
}
void set_withret(int i, char val)
{
if (i < 0 || i >= MAXSIG)
return;
current->shret[i] = val;
}
/*************************
* Lookup memory address *
*************************/
struct fenris_mem *lookup_mem(const unsigned int addr)
{
unsigned int i;
for (i = 0; i < current->memtop; i++) {
if (!(*current->mem)[i].descr)
continue;
if ((*current->mem)[i].addr <= addr)
if (((*current->mem)[i].addr + (*current->mem)[i].len) > addr) {
return &(*current->mem)[i];
}
}
return 0;
}
/****************************************
* Lookup any buffer inside given range *
****************************************/
struct fenris_mem *lookup_inrange(const unsigned int addr, const unsigned int len)
{
unsigned int end = addr + len;
unsigned int i;
for (i = 0; i < current->memtop; i++) {
if (!(*current->mem)[i].descr)
continue;
if ((*current->mem)[i].addr >= addr)
if ((*current->mem)[i].addr < end)
if ((*current->mem)[i].addr + (*current->mem)[i].len >= addr)
if ((*current->mem)[i].addr + (*current->mem)[i].len < end)
return &(*current->mem)[i];
}
return 0;
}
/*************************************
* Find or assign unique function id *
*************************************/
int find_id(unsigned int c, unsigned int addnew)
{
unsigned int i;
if (!current->fnaddr) {
if (!addnew)
return 0;
current->fnaddr = malloc(TABINC * 4 + 4);
}
for (i = 0; i < current->idtop; i++)
if ((*current->fnaddr)[i] == c)
return i + 1;
if (!addnew)
return 0;
current->idtop++;
if (!((current->idtop) % TABINC))
current->fnaddr = realloc(current->fnaddr, (current->idtop + 1 + TABINC) * 4);
(*current->fnaddr)[current->idtop - 1] = c;
return current->idtop;
}
/************************
* Lookup function name *
************************/
char *lookup_fnct(unsigned int c, unsigned int add, char prec)
{
unsigned int i;
int mindif = 100000000, best = -1;
int addplus = 0;
if (add == 123456) {
add = 0;
addplus = 1;
}
if (add) {
find_id(c, 1);
}
if (!current->b) {
int size;
bfd *b;
if (current->symfail || T_nosym) {
// Do not retry.
if (!find_id(c, 0))
return 0;
sprintf(fnm_buf, "fnct_%d", find_id(c, 0));
return fnm_buf;
}
sprintf(fnm_buf, "/proc/%d/exe", pid);
b = bfd_openr(fnm_buf, 0);
if (!b) {
current->symfail = 1;
if (!find_id(c, 0))
return 0;
sprintf(fnm_buf, "fnct_%d", find_id(c, 0));
return fnm_buf;
}
if (bfd_check_format(b, bfd_archive)) {
current->symfail = 1;
if (!find_id(c, 0))
return 0;
sprintf(fnm_buf, "fnct_%d", find_id(c, 0));
bfd_close(b);
return fnm_buf;
}
bfd_check_format_matches(b, bfd_object, 0);
if ((bfd_get_file_flags(b) & HAS_SYMS) == 0) {
current->symfail = 1;
if (!find_id(c, 0))
return 0;
sprintf(fnm_buf, "fnct_%d", find_id(c, 0));
bfd_close(b);
return fnm_buf;
}
size = bfd_get_symtab_upper_bound(b);
if (size <= 0) {
current->symfail = 1;
if (!find_id(c, 0))
return 0;
sprintf(fnm_buf, "fnct_%d", find_id(c, 0));
bfd_close(b);
return fnm_buf;
}
current->syms = (asymbol **) malloc(size);
if (!current->syms) {
current->symfail = 1;
if (!find_id(c, 0))
return 0;
sprintf(fnm_buf, "fnct_%d", find_id(c, 0));
bfd_close(b);
return fnm_buf;
}
// FIXME:NIX can't fail, unsigned values
/*
* if ((current->symcnt=bfd_canonicalize_symtab(b,current->syms))<0)
* fatal("bfd_canonicalize_symtab failed",0);
*/
current->b = b;
}
for (i = 0; i < current->symcnt; i++)
if (current->syms[i] && (current->syms[i]->flags != 1)) {
if (prec) {
if (bfd_asymbol_value(current->syms[i]) != c)
continue;
if (!bfd_asymbol_name(current->syms[i]) || !strlen(bfd_asymbol_name(current->syms[i])))
continue;
} else {
int dif;
dif = c - (bfd_asymbol_value(current->syms[i]));
if (dif < 0)
continue;
if (!bfd_asymbol_name(current->syms[i]) || !strlen(bfd_asymbol_name(current->syms[i])))
continue;
if (dif <= mindif) {
mindif = dif;
best = i;
}
if (dif)
continue;
}
strcpy(fnm_buf, bfd_asymbol_name(current->syms[i]));
if (fnm_buf[0])
return fnm_buf;
}
if ((!prec) && (best > 0)) {
strcpy(fnm_buf, bfd_asymbol_name(current->syms[best]));
if (addplus)
sprintf(&fnm_buf[strlen(fnm_buf)], "+%d", mindif);
return fnm_buf;
}
if (!find_id(c, 0))
return 0;
sprintf(fnm_buf, "fnct_%d", find_id(c, 0));
return fnm_buf;
}
/***************************
* Try to find symbol name *
***************************/
Dl_info di;
char fn_buf[64];
char *find_name(const unsigned int addr)
{
unsigned int i;
for (i = 0; i < current->mtop + 1; i++) {
if (!(*current->map)[i].name)
continue;
if ((*current->map)[i].addr <= addr) {
if (((*current->map)[i].addr + (*current->map)[i].len) > addr) {
void *x;
unsigned int off;
unsigned long int b;
int f;
off = addr - (*current->map)[i].addr;
// Offset 0x10 should be equal to 0x03. Otherwise, we do not
// want to dlopen() this "thing".
f = open((*current->map)[i].name, O_RDONLY);
if (f < 0) {
sprintf(fn_buf, "P:lib_%x", addr);
return fn_buf;
}
lseek(f, 0x10, SEEK_SET);
read(f, fn_buf, 1);
close(f);
if (fn_buf[0] != 0x03) {
sprintf(fn_buf, "S:lib_%x", addr);
return fn_buf;
}
if (T_nosym)
x = 0;
else
x = dlopen((*current->map)[i].name, RTLD_LAZY | RTLD_GLOBAL | RTLD_NODELETE);
if (!x) {
sprintf(fn_buf, "L:lib_%x", addr);
return fn_buf;
}
b = *((int *)x) + off;
if (!dladdr((void *)b, &di)) {
dlclose(x);
sprintf(fn_buf, "A:lib_%x", current->lentry);
return fn_buf;
}
if (!di.dli_sname) {
#ifndef DO_NOT_DLCLOSE
dlclose(x);
#endif
sprintf(fn_buf, "<unnamed:%lx>%+ld", (unsigned long int)di.dli_saddr,
b - (unsigned long int)di.dli_saddr);
return fn_buf;
}
if (di.dli_saddr != (void *)b) {
#ifndef DO_NOT_DLCLOSE
dlclose(x);
#endif
snprintf(fn_buf, sizeof(fn_buf), "%s%+ld", di.dli_sname, b - (unsigned long int)di.dli_saddr);
return fn_buf;
}
#ifndef DO_NOT_DLCLOSE
dlclose(x);
#endif
return (char *)di.dli_sname;
}
}
}
sprintf(fn_buf, "F:lib_%x", addr);
return fn_buf;
}
char *find_name_ex(unsigned int c, char prec, char non)
{
char *ret = find_name(c);
if (non)
if (strchr(ret, ':'))
return 0;
if (prec == 1) {
if (strchr(ret, '+'))
return 0;
if (strchr(ret, '-'))
return 0;
} else if (prec == 2) {
char *q;
if ((q = strchr(ret, '+')))
*q = 0;
if ((q = strchr(ret, '-')))
*q = 0;
}
return ret;
}
/*******************************************
* Add or update memory region information *
*******************************************/
void add_mem(unsigned int start, int len, unsigned int newaddr, const char *who, char auth)
{
unsigned int i;
char *doingmerge = 0;
unsigned int owner = 0;
char U = 0;
char buf[MAXDESCR], b2[MAXDESCR];
struct fenris_mem *f;
if (current->nest < 0)
return; // No, sorry.
if (len <= 0)
return; // Sorry even more.
if (start + len < start)
fatal("start + len < start in add_mem", 0);
if (!start || (start > 0xffffff00))
return;
if (newaddr == 2) {
newaddr = 0;
U = 1;
}
if (newaddr) {
// We have some authoritative buffer size readjustment.
// Expect finding buffer with matching address. In
// emergency, you might have to create new buffer description.
f = lookup_mem(start);
if (!f) {
// Oh man.
if (!U) {
indent(0);
debug("- remap: non-existing buffer %x -> %x:%d\n", start, newaddr, len);
} else {
sprintf(b2, "- remap: non-existing buffer %x -> %x:%d\n", start, newaddr, len);
nappend(pdescr, b2, MAXDESCR);
}
if (!current->memtop) {
current->memtop = TABINC;
current->mem = malloc(sizeof(struct fenris_mem) * TABINC);
}
for (i = 0; i < current->memtop; i++)
if (!(*current->mem)[i].descr)
break;
if (i == current->memtop) {
current->memtop += TABINC;
current->mem = realloc(current->mem, sizeof(struct fenris_mem) * (current->memtop + 1));
}
snprintf(buf, MAXDESCR, "from hell, resized in %s", who);
(*current->mem)[i].descr = strdup(buf);
(*current->mem)[i].addr = newaddr;
(*current->mem)[i].len = len;
(*current->mem)[i].owner = current->fntop;
return;
}
if ((f->addr != start)) {
if (!U) {
indent(0);
debug("- remap: %x -> %x:%d, but nearest is: %x:%d (%s)\n", start, newaddr, len, f->addr, f->len,
f->descr);
} else {
sprintf(b2, "- remap: %x -> %x:%d, but nearest is: %x:%d (%s)\n", start, newaddr, len, f->addr, f->len,
f->descr);
nappend(pdescr, b2, MAXDESCR);
}
return;
}
if (!U) {
indent(0);
debug("\\ remap: %x:%d -> %x:%d\n", f->addr, f->len, newaddr, len);
} else {
sprintf(b2, "\\ remap: %x:%d -> %x:%d\n", f->addr, f->len, newaddr, len);
nappend(pdescr, b2, MAXDESCR);
}
snprintf(buf, MAXDESCR, "resized from %d in %s", f->len, who);
free(f->descr);
f->descr = strdup(buf);
f->len = len;
f->addr = newaddr;
f->auth = auth;
} else {
mergeloop:
f = lookup_inrange(start, len);
if (f) {
if (!T_nodesc) {
if (f->auth) {
if (!U) {
indent(0);
debug("\\ UNEXPECTED is-within: %x:%d in %x:%d (%s)\n", f->addr, f->len, start, len, f->descr);
} else {
sprintf(b2, "\\ UNEXPECTED is-within: %x:%d in %x:%d (%s)\n", f->addr, f->len, start, len,
f->descr);
nappend(pdescr, b2, MAXDESCR);
}
}
if (!U) {
indent(0);
debug("\\ discard: mem %x:%d (%s) [is within %x:%d]\n", f->addr, f->len, f->descr, start, len);
} else {
sprintf(b2, "\\ discard: mem %x:%d (%s) [is within %x:%d]\n", f->addr, f->len, f->descr, start,
len);
nappend(pdescr, b2, MAXDESCR);
}
}
f->addr = 0;
free(f->descr);
if (f->lasti)
free(f->lasti);
f->lasti = 0;
f->descr = 0;
f->len = 0;
f = 0;
goto mergeloop;
}
if (!auth)
f = lookup_mem(start + len + 1);
else
f = 0;
if (!f)
f = lookup_mem(start + len);
if (f) {
if (f->addr <= start) {
// So, we have a buffer that starts before ours and ends
// past our buffer. It looks like there is no need to do
// anything,
// unless this is an authoritative attempt.
if (auth && (!T_nodesc)) {
if (!U) {
indent(0);
debug("\\ UNEXPECTED already-have: %x:%d in %x:%d (%s)\n", start, len, f->addr, f->len,
f->descr);
} else {
sprintf(b2, "\\ UNEXPECTED already-have: %x:%d in %x:%d (%s)\n", start, len, f->addr, f->len,
f->descr);
nappend(pdescr, b2, MAXDESCR);
}
}
if (doingmerge)
free(doingmerge);
return;
} else {
// We have something that starts in our buffer and ends past
// our buffer. Adjust current length and discard the old one.
if (auth)
if (start + len + 1 == f->addr)
goto nojoin;
if (!T_nodesc) {
if (!U) {
if (!(auth | f->auth) && !be_silent) {
indent(0);
debug("\\ %smerge [EA]: %x:%d %x:%d (%s) -> ", (auth | f->auth) ? "UNEXPECTED " : "", start,
len, f->addr, f->len, f->descr);
}
} else {
sprintf(b2, "\\ %smerge [EA]: %x:%d %x:%d (%s) -> ", (auth | f->auth) ? "UNEXPECTED " : "",
start, len, f->addr, f->len, f->descr);
nappend(pdescr, b2, MAXDESCR);
}
}
len = f->len;
len += (f->addr - start);
if (f->auth)
auth = 1;
if (doingmerge)
free(doingmerge);
doingmerge = f->descr;
owner = f->owner;
f->addr = f->len = 0;
f->descr = 0;
f->auth = 0;
if (!T_nodesc) {
if (!U) {
if (!(auth | f->auth) && !be_silent)
debug("%x:%d\n", start, len);
} else {
sprintf(b2, "%x:%d\n", start, len);
nappend(pdescr, b2, MAXDESCR);
}
}
// Retry, we might have more things like that.