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
|
/* subsegs.c - subsegments -
Copyright (C) 1987, 1990, 1991, 1992 Free Software Foundation, Inc.
This file is part of GAS, the GNU Assembler.
GAS 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, or (at your option)
any later version.
GAS 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 GAS; see the file COPYING. If not, write to
the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
/*
* Segments & sub-segments.
*/
#include "as.h"
#include "subsegs.h"
#include "obstack.h"
frchainS *frchain_root, *frchain_now;
#ifndef BFD_ASSEMBLER
#ifdef MANY_SEGMENTS
segment_info_type segment_info[SEG_MAXIMUM_ORDINAL];
#else
/* Commented in "subsegs.h". */
frchainS *data0_frchainP, *bss0_frchainP;
#endif /* MANY_SEGMENTS */
char *const seg_name[] =
{
"absolute",
#ifdef MANY_SEGMENTS
"e0", "e1", "e2", "e3", "e4", "e5", "e6", "e7", "e8", "e9",
#else
"text",
"data",
"bss",
#endif /* MANY_SEGMENTS */
"unknown",
"ASSEMBLER-INTERNAL-LOGIC-ERROR!",
"expr",
"debug",
"transfert vector preload",
"transfert vector postload",
"register",
"",
}; /* Used by error reporters, dumpers etc. */
#endif /* BFD_ASSEMBLER */
static void subseg_set_rest PARAMS ((segT, subsegT));
void
subsegs_begin ()
{
/* Check table(s) seg_name[], seg_N_TYPE[] is in correct order */
#if !defined (MANY_SEGMENTS) && !defined (BFD_ASSEMBLER)
know (SEG_ABSOLUTE == 0);
know (SEG_TEXT == 1);
know (SEG_DATA == 2);
know (SEG_BSS == 3);
know (SEG_UNKNOWN == 4);
know (SEG_GOOF == 5);
know (SEG_EXPR == 6);
know (SEG_DEBUG == 7);
know (SEG_NTV == 8);
know (SEG_PTV == 9);
know (SEG_REGISTER == 10);
know (SEG_MAXIMUM_ORDINAL == SEG_REGISTER);
#endif
obstack_begin (&frags, 5000);
frchain_root = NULL;
frchain_now = NULL; /* Warn new_subseg() that we are booting. */
/* Fake up 1st frag. It won't be used=> is ok if obstack...
pads the end of it for alignment. */
frag_now = (fragS *) obstack_alloc (&frags, SIZEOF_STRUCT_FRAG);
memset (frag_now, SIZEOF_STRUCT_FRAG, 0);
#ifndef BFD_ASSEMBLER
/* This 1st frag will not be in any frchain.
We simply give subseg_new somewhere to scribble. */
now_subseg = 42; /* Lie for 1st call to subseg_new. */
#ifdef MANY_SEGMENTS
{
int i;
for (i = SEG_E0; i < SEG_UNKNOWN; i++)
{
subseg_set (i, 0);
segment_info[i].frchainP = frchain_now;
}
}
#else
subseg_set (SEG_DATA, 0); /* .data 0 */
data0_frchainP = frchain_now;
subseg_set (SEG_BSS, 0);
bss0_frchainP = frchain_now;
#endif /* ! MANY_SEGMENTS */
#endif /* ! BFD_ASSEMBLER */
}
/*
* subseg_change()
*
* Change the subsegment we are in, BUT DO NOT MAKE A NEW FRAG for the
* subsegment. If we are already in the correct subsegment, change nothing.
* This is used eg as a worker for subseg_set [which does make a new frag_now]
* and for changing segments after we have read the source. We construct eg
* fixSs even after the source file is read, so we do have to keep the
* segment context correct.
*/
void
subseg_change (seg, subseg)
register segT seg;
register int subseg;
{
now_seg = seg;
now_subseg = subseg;
#ifdef BFD_ASSEMBLER
{
segment_info_type *seginfo;
seginfo = (segment_info_type *) bfd_get_section_userdata (stdoutput, seg);
if (! seginfo)
{
seginfo = (segment_info_type *) xmalloc (sizeof (*seginfo));
if (! seginfo)
abort ();
seginfo->fix_root = 0;
seginfo->fix_tail = 0;
seginfo->bfd_section = seg;
seginfo->sym = 0;
bfd_set_section_userdata (stdoutput, seg, (char *) seginfo);
}
}
#else
#ifdef MANY_SEGMENTS
seg_fix_rootP = &segment_info[seg].fix_root;
seg_fix_tailP = &segment_info[seg].fix_tail;
#else
if (seg == SEG_DATA)
{
seg_fix_rootP = &data_fix_root;
seg_fix_tailP = &data_fix_tail;
}
else if (seg == SEG_TEXT)
{
seg_fix_rootP = &text_fix_root;
seg_fix_tailP = &text_fix_tail;
}
else
{
know (seg == SEG_BSS);
seg_fix_rootP = &bss_fix_root;
seg_fix_tailP = &bss_fix_tail;
}
#endif
#endif
}
static void
subseg_set_rest (seg, subseg)
segT seg;
subsegT subseg;
{
long tmp; /* JF for obstack alignment hacking */
register frchainS *frcP; /* crawl frchain chain */
register frchainS **lastPP; /* address of last pointer */
frchainS *newP; /* address of new frchain */
register fragS *former_last_fragP;
register fragS *new_fragP;
if (frag_now) /* If not bootstrapping. */
{
frag_now->fr_fix = (char*) obstack_next_free (&frags) - frag_now->fr_literal;
frag_wane (frag_now); /* Close off any frag in old subseg. */
}
/*
* It would be nice to keep an obstack for each subsegment, if we swap
* subsegments a lot. Hence we would have much fewer frag_wanes().
*/
{
obstack_finish (&frags);
/*
* If we don't do the above, the next object we put on obstack frags
* will appear to start at the fr_literal of the current frag.
* Also, above ensures that the next object will begin on a
* address that is aligned correctly for the engine that runs
* this program.
*/
}
subseg_change (seg, (int) subseg);
/*
* Attempt to find or make a frchain for that sub seg.
* Crawl along chain of frchainSs, begins @ frchain_root.
* If we need to make a frchainS, link it into correct
* position of chain rooted in frchain_root.
*/
for (frcP = *(lastPP = &frchain_root);
frcP && (int) (frcP->frch_seg) <= (int) seg;
frcP = *(lastPP = &frcP->frch_next))
{
if ((int) (frcP->frch_seg) == (int) seg
&& frcP->frch_subseg >= subseg)
{
break;
}
}
/*
* frcP: Address of the 1st frchainS in correct segment with
* frch_subseg >= subseg.
* We want to either use this frchainS, or we want
* to insert a new frchainS just before it.
*
* If frcP==NULL, then we are at the end of the chain
* of frchainS-s. A NULL frcP means we fell off the end
* of the chain looking for a
* frch_subseg >= subseg, so we
* must make a new frchainS.
*
* If we ever maintain a pointer to
* the last frchainS in the chain, we change that pointer
* ONLY when frcP==NULL.
*
* lastPP: Address of the pointer with value frcP;
* Never NULL.
* May point to frchain_root.
*
*/
if (!frcP
|| ((int) (frcP->frch_seg) > (int) seg
|| frcP->frch_subseg > subseg)) /* Kinky logic only works with 2 segments. */
{
/*
* This should be the only code that creates a frchainS.
*/
newP = (frchainS *) obstack_alloc (&frags, sizeof (frchainS));
memset (newP, sizeof (frchainS), 0);
/* This begines on a good boundary because a obstack_done()
preceeded it. It implies an obstack_done(), so we expect
the next object allocated to begin on a correct boundary. */
*lastPP = newP;
newP->frch_next = frcP; /* perhaps NULL */
(frcP = newP)->frch_subseg = subseg;
newP->frch_seg = seg;
newP->frch_last = NULL;
}
/*
* Here with frcP ->ing to the frchainS for subseg.
*/
frchain_now = frcP;
/*
* Make a fresh frag for the subsegment.
*/
/* We expect this to happen on a correct boundary since it was
proceeded by a obstack_done(). */
tmp = obstack_alignment_mask (&frags); /* JF disable alignment */
obstack_alignment_mask (&frags) = 0;
frag_now = (fragS *) obstack_alloc (&frags, SIZEOF_STRUCT_FRAG);
memset (frag_now, 0, SIZEOF_STRUCT_FRAG);
obstack_alignment_mask (&frags) = tmp;
/* But we want any more chars to come immediately after the
structure we just made. */
new_fragP = frag_now;
new_fragP->fr_next = NULL;
/*
* Append new frag to current frchain.
*/
former_last_fragP = frcP->frch_last;
if (former_last_fragP)
{
know (former_last_fragP->fr_next == NULL);
know (frchain_now->frch_root);
former_last_fragP->fr_next = new_fragP;
}
else
{
frcP->frch_root = new_fragP;
}
frcP->frch_last = new_fragP;
}
/*
* subseg_set(segT, subsegT)
*
* If you attempt to change to the current subsegment, nothing happens.
*
* In: segT, subsegT code for new subsegment.
* frag_now -> incomplete frag for current subsegment.
* If frag_now==NULL, then there is no old, incomplete frag, so
* the old frag is not closed off.
*
* Out: now_subseg, now_seg updated.
* Frchain_now points to the (possibly new) struct frchain for this
* sub-segment.
* Frchain_root updated if needed.
*/
#ifndef BFD_ASSEMBLER
segT
subseg_new (segname, subseg)
const char *segname;
subsegT subseg;
{
int i;
for (i = 0; i < (int) SEG_MAXIMUM_ORDINAL; i++)
{
const char *s;
s = segment_name ((segT) i);
if (strcmp (segname, s) == 0
|| (segname[0] == '.'
&& strcmp (segname + 1, s) == 0))
{
subseg_set ((segT) i, subseg);
return (segT) i;
}
#ifdef obj_segment_name
s = obj_segment_name ((segT) i);
if (strcmp (segname, s) == 0
|| (segname[0] == '.'
&& strcmp (segname + 1, s) == 0))
{
subseg_set ((segT) i, subseg);
return (segT) i;
}
#endif
}
#ifdef obj_add_segment
{
segT new_seg;
new_seg = obj_add_segment (segname);
subseg_set (new_seg, subseg);
return new_seg;
}
#else
as_bad ("Attempt to switch to nonexistent segment \"%s\"", segname);
return now_seg;
#endif
}
void
subseg_set (seg, subseg) /* begin assembly for a new sub-segment */
register segT seg; /* SEG_DATA or SEG_TEXT */
register subsegT subseg;
{
#ifndef MANY_SEGMENTS
know (seg == SEG_DATA || seg == SEG_TEXT || seg == SEG_BSS);
#endif
if (seg != now_seg || subseg != now_subseg)
{ /* we just changed sub-segments */
subseg_set_rest (seg, subseg);
}
}
#else /* BFD_ASSEMBLER */
segT
subseg_new (segname, subseg)
const char *segname;
subsegT subseg;
{
segT secptr;
segment_info_type *seginfo;
const char *now_seg_name = (now_seg
? bfd_get_section_name (stdoutput, now_seg)
: 0);
if (now_seg_name
&& (now_seg_name == segname
|| !strcmp (now_seg_name, segname))
&& subseg == now_subseg)
return now_seg;
secptr = bfd_make_section_old_way (stdoutput, segname);
seginfo = seg_info (secptr);
if (! seginfo)
{
secptr->output_section = secptr;
seginfo = (segment_info_type *) xmalloc (sizeof (*seginfo));
seginfo->fix_root = 0;
seginfo->fix_tail = 0;
seginfo->bfd_section = secptr;
bfd_set_section_userdata (stdoutput, secptr, (char *) seginfo);
subseg_set_rest (secptr, subseg);
seginfo->frchainP = frchain_now;
seginfo->lineno_list_head = seginfo->lineno_list_tail = 0;
seginfo->sym = 0;
seginfo->dot = 0;
seginfo->hadone = 0;
seginfo->user_stuff = 0;
}
else
subseg_set_rest (secptr, subseg);
return secptr;
}
void
subseg_set (secptr, subseg)
segT secptr;
subsegT subseg;
{
if (! (secptr == now_seg && subseg == now_subseg))
subseg_set_rest (secptr, subseg);
}
#endif /* BFD_ASSEMBLER */
/* end of subsegs.c */
|