blob: 9645e85b04a73172d69ce23a5d3e97b06bcff618 (
plain)
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
|
/* asminclist.c */
/*****************************************************************************/
/* AS-Portierung */
/* */
/* Verwaltung der Include-Verschachtelungsliste */
/* */
/* Historie: 16. 5.1996 Grundsteinlegung */
/* */
/*****************************************************************************/
#include "stdinc.h"
#include <string.h>
#include "strutil.h"
#include "chunks.h"
#include "nls.h"
#include "nlmessages.h"
#include "as.rsc"
#include "asmfnums.h"
#include "asmdef.h"
#include "asmsub.h"
#include "asminclist.h"
typedef void **PFileArray;
typedef struct _TFileNode
{
Integer Name;
Integer Len;
struct _TFileNode *Parent;
PFileArray Subs;
} TFileNode,*PFileNode;
static PFileNode Root,Curr;
void PushInclude(char *S)
BEGIN
PFileNode Neu;
Neu=(PFileNode) malloc(sizeof(TFileNode));
Neu->Name=GetFileNum(S);
Neu->Len=0; Neu->Subs=Nil;
Neu->Parent=Curr;
if (Root==Nil) Root=Neu;
if (Curr==Nil) Curr=Neu;
else
BEGIN
if (Curr->Len==0)
Curr->Subs=(PFileArray) malloc(sizeof(void *));
else
Curr->Subs=(PFileArray) realloc(Curr->Subs,sizeof(void *)*(Curr->Len+1));
Curr->Subs[Curr->Len++]=(void *)Neu;
Curr=Neu;
END
END
void PopInclude(void)
BEGIN
if (Curr!=Nil) Curr=Curr->Parent;
END
static void PrintIncludeList_PrintNode(PFileNode Node, int Indent)
BEGIN
int z;
String h;
ChkStack();
if (Node!=Nil)
BEGIN
strmaxcpy(h,Blanks(Indent),255);
strmaxcat(h,GetFileName(Node->Name),255);
WrLstLine(h);
for (z=0; z<Node->Len; z++) PrintIncludeList_PrintNode(Node->Subs[z],Indent+5);
END
END
void PrintIncludeList(void)
BEGIN
NewPage(ChapDepth,True);
WrLstLine(getmessage(Num_ListIncludeListHead1));
WrLstLine(getmessage(Num_ListIncludeListHead2));
WrLstLine("");
PrintIncludeList_PrintNode(Root,0);
END
static void ClearIncludeList_ClearNode(PFileNode Node)
BEGIN
int z;
ChkStack();
if (Node!=Nil)
BEGIN
for (z=0; z<Node->Len; ClearIncludeList_ClearNode(Node->Subs[z++]));
if (Node->Len>0) free(Node->Subs);
free(Node);
END
END
void ClearIncludeList(void)
BEGIN
ClearIncludeList_ClearNode(Root);
Curr=Nil; Root=Nil;
END
void asminclist_init(void)
BEGIN
Root=Nil; Curr=Nil;
END
|
