1 /*****************************************************************************/
5 /* Lightweight segment management stuff */
9 /* (C) 2001 Ullrich von Bassewitz */
11 /* D-70597 Stuttgart */
12 /* EMail: uz@cc65.org */
15 /* This software is provided 'as-is', without any expressed or implied */
16 /* warranty. In no event will the authors be held liable for any damages */
17 /* arising from the use of this software. */
19 /* Permission is granted to anyone to use this software for any purpose, */
20 /* including commercial applications, and to alter it and redistribute it */
21 /* freely, subject to the following restrictions: */
23 /* 1. The origin of this software must not be misrepresented; you must not */
24 /* claim that you wrote the original software. If you use this software */
25 /* in a product, an acknowledgment in the product documentation would be */
26 /* appreciated but is not required. */
27 /* 2. Altered source versions must be plainly marked as such, and must not */
28 /* be misrepresented as being the original software. */
29 /* 3. This notice may not be removed or altered from any source */
32 /*****************************************************************************/
55 /*****************************************************************************/
57 /*****************************************************************************/
61 /* Pointer to the current segment list. Output goes here. */
64 /* Pointer to the global segment list */
67 /* Actual names for the segments */
68 static char* SegmentNames[SEG_COUNT];
70 /* We're using a collection for the stack instead of a linked list. Since
71 * functions may not be nested (at least in the current implementation), the
72 * maximum stack depth is 2, so there is not really a need for a better
75 static Collection SegmentStack = STATIC_COLLECTION_INITIALIZER;
79 /*****************************************************************************/
81 /*****************************************************************************/
85 void InitSegNames (void)
86 /* Initialize the segment names */
88 SegmentNames [SEG_BSS] = xstrdup ("BSS");
89 SegmentNames [SEG_CODE] = xstrdup ("CODE");
90 SegmentNames [SEG_DATA] = xstrdup ("DATA");
91 SegmentNames [SEG_RODATA] = xstrdup ("RODATA");
96 void NewSegName (segment_t Seg, const char* Name)
97 /* Set a new name for a segment */
99 /* Free the old name and set a new one */
100 xfree (SegmentNames [Seg]);
101 SegmentNames [Seg] = xstrdup (Name);
106 int ValidSegName (const char* Name)
107 /* Return true if the given segment name is valid, return false otherwise */
109 /* Must start with '_' or a letter */
110 if ((*Name != '_' && !IsAlpha(*Name)) || strlen(Name) > 80) {
114 /* Can have letters, digits or the underline */
116 if (*Name != '_' && !IsAlNum(*Name)) {
127 static Segments* NewSegments (SymEntry* Func)
128 /* Initialize a Segments structure (set all fields to NULL) */
130 /* Allocate memory */
131 Segments* S = xmalloc (sizeof (Segments));
133 /* Initialize the fields */
134 S->Text = NewTextSeg (Func);
135 S->Code = NewCodeSeg (SegmentNames[SEG_CODE], Func);
136 S->Data = NewDataSeg (SegmentNames[SEG_DATA], Func);
137 S->ROData = NewDataSeg (SegmentNames[SEG_RODATA], Func);
138 S->BSS = NewDataSeg (SegmentNames[SEG_BSS], Func);
139 S->CurDSeg = SEG_DATA;
141 /* Return the new struct */
147 Segments* PushSegments (SymEntry* Func)
148 /* Make the new segment list current but remember the old one */
150 /* Push the current pointer onto the stack */
151 CollAppend (&SegmentStack, CS);
153 /* Create a new Segments structure */
154 CS = NewSegments (Func);
156 /* Return the new struct */
162 void PopSegments (void)
163 /* Pop the old segment list (make it current) */
165 /* Must have something on the stack */
166 PRECONDITION (CollCount (&SegmentStack) > 0);
168 /* Pop the last segment and set it as current */
169 CS = CollPop (&SegmentStack);
174 void UseDataSeg (segment_t DSeg)
175 /* For the current segment list, use the data segment DSeg */
177 /* Check the input */
178 PRECONDITION (CS && DSeg != SEG_CODE);
180 /* Set the new segment to use */
186 struct DataSeg* GetDataSeg (void)
187 /* Return the current data segment */
189 PRECONDITION (CS != 0);
190 switch (CS->CurDSeg) {
191 case SEG_BSS: return CS->BSS;
192 case SEG_DATA: return CS->Data;
193 case SEG_RODATA: return CS->ROData;
195 FAIL ("Invalid data segment");
202 void AddTextLine (const char* Format, ...)
203 /* Add a line of code to the current text segment */
206 va_start (ap, Format);
208 TS_AddVLine (CS->Text, Format, ap);
214 void AddCodeLine (const char* Format, ...)
215 /* Add a line of code to the current code segment */
218 va_start (ap, Format);
220 CS_AddVLine (CS->Code, CurTok.LI, Format, ap);
226 void AddCode (opc_t OPC, am_t AM, const char* Arg, struct CodeLabel* JumpTo)
227 /* Add a code entry to the current code segment */
230 CS_AddEntry (CS->Code, NewCodeEntry (OPC, AM, Arg, JumpTo, CurTok.LI));
235 void AddDataLine (const char* Format, ...)
236 /* Add a line of data to the current data segment */
239 va_start (ap, Format);
241 DS_AddVLine (GetDataSeg(), Format, ap);
247 void OutputSegments (const Segments* S, FILE* F)
248 /* Output the given segments to the file */
250 /* Output the function prologue if the segments came from a function */
251 CS_OutputPrologue (S->Code, F);
253 /* Output the text segment */
254 TS_Output (S->Text, F);
256 /* Output the three data segments */
257 DS_Output (S->Data, F);
258 DS_Output (S->ROData, F);
259 DS_Output (S->BSS, F);
261 /* Output the code segment */
262 CS_Output (S->Code, F);
264 /* Output the code segment epiloque */
265 CS_OutputEpilogue (S->Code, F);