gdb: add target_ops::supports_displaced_step
[deliverable/binutils-gdb.git] / gas / subsegs.c
CommitLineData
252b5132 1/* subsegs.c - subsegments -
b3adc24a 2 Copyright (C) 1987-2020 Free Software Foundation, Inc.
252b5132
RH
3
4 This file is part of GAS, the GNU Assembler.
5
6 GAS is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
ec2655a6 8 the Free Software Foundation; either version 3, or (at your option)
252b5132
RH
9 any later version.
10
11 GAS is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
15
16 You should have received a copy of the GNU General Public License
17 along with GAS; see the file COPYING. If not, write to the Free
4b4da160
NC
18 Software Foundation, 51 Franklin Street - Fifth Floor, Boston, MA
19 02110-1301, USA. */
252b5132 20
ef99799a 21/* Segments & sub-segments. */
252b5132
RH
22
23#include "as.h"
24
25#include "subsegs.h"
26#include "obstack.h"
27
c9049d30 28frchainS *frchain_now;
252b5132
RH
29
30static struct obstack frchains;
31
252b5132
RH
32static fragS dummy_frag;
33
252b5132
RH
34\f
35void
24361518 36subsegs_begin (void)
252b5132 37{
252b5132
RH
38 obstack_begin (&frchains, chunksize);
39#if __GNUC__ >= 2
40 obstack_alignment_mask (&frchains) = __alignof__ (frchainS) - 1;
41#endif
42
f0e652b4 43 frchain_now = NULL; /* Warn new_subseg() that we are booting. */
252b5132 44 frag_now = &dummy_frag;
252b5132
RH
45}
46\f
47/*
48 * subseg_change()
49 *
50 * Change the subsegment we are in, BUT DO NOT MAKE A NEW FRAG for the
51 * subsegment. If we are already in the correct subsegment, change nothing.
52 * This is used eg as a worker for subseg_set [which does make a new frag_now]
53 * and for changing segments after we have read the source. We construct eg
54 * fixSs even after the source file is read, so we do have to keep the
55 * segment context correct.
56 */
57void
ed9e98c2 58subseg_change (segT seg, int subseg)
252b5132 59{
c9049d30 60 segment_info_type *seginfo = seg_info (seg);
252b5132
RH
61 now_seg = seg;
62 now_subseg = subseg;
63
7be1c489 64 if (! seginfo)
252b5132 65 {
add39d23 66 seginfo = XCNEW (segment_info_type);
7be1c489 67 seginfo->bfd_section = seg;
fd361982 68 bfd_set_section_userdata (seg, seginfo);
252b5132 69 }
252b5132
RH
70}
71\f
72static void
24361518 73subseg_set_rest (segT seg, subsegT subseg)
252b5132 74{
c9049d30
AM
75 frchainS *frcP; /* crawl frchain chain */
76 frchainS **lastPP; /* address of last pointer */
252b5132 77 frchainS *newP; /* address of new frchain */
c9049d30 78 segment_info_type *seginfo;
252b5132
RH
79
80 mri_common_symbol = NULL;
81
82 if (frag_now && frchain_now)
83 frchain_now->frch_frag_now = frag_now;
84
9c2799c2 85 gas_assert (frchain_now == 0
252b5132
RH
86 || frchain_now->frch_last == frag_now);
87
88 subseg_change (seg, (int) subseg);
89
c9049d30 90 seginfo = seg_info (seg);
252b5132 91
c9049d30
AM
92 /* Attempt to find or make a frchain for that subsection.
93 We keep the list sorted by subsection number. */
94 for (frcP = *(lastPP = &seginfo->frchainP);
95 frcP != NULL;
252b5132 96 frcP = *(lastPP = &frcP->frch_next))
c9049d30
AM
97 if (frcP->frch_subseg >= subseg)
98 break;
99
100 if (frcP == NULL || frcP->frch_subseg != subseg)
252b5132 101 {
c9049d30 102 /* This should be the only code that creates a frchainS. */
7be1c489 103
1e9cc1c2 104 newP = (frchainS *) obstack_alloc (&frchains, sizeof (frchainS));
252b5132 105 newP->frch_subseg = subseg;
252b5132
RH
106 newP->fix_root = NULL;
107 newP->fix_tail = NULL;
252b5132
RH
108 obstack_begin (&newP->frch_obstack, chunksize);
109#if __GNUC__ >= 2
110 obstack_alignment_mask (&newP->frch_obstack) = __alignof__ (fragS) - 1;
111#endif
112 newP->frch_frag_now = frag_alloc (&newP->frch_obstack);
113 newP->frch_frag_now->fr_type = rs_fill;
5fd396ba 114 newP->frch_cfi_data = NULL;
252b5132
RH
115
116 newP->frch_root = newP->frch_last = newP->frch_frag_now;
117
118 *lastPP = newP;
c9049d30 119 newP->frch_next = frcP;
252b5132
RH
120 frcP = newP;
121 }
c9049d30 122
252b5132
RH
123 frchain_now = frcP;
124 frag_now = frcP->frch_frag_now;
125
9c2799c2 126 gas_assert (frchain_now->frch_last == frag_now);
252b5132
RH
127}
128
129/*
130 * subseg_set(segT, subsegT)
131 *
132 * If you attempt to change to the current subsegment, nothing happens.
133 *
134 * In: segT, subsegT code for new subsegment.
135 * frag_now -> incomplete frag for current subsegment.
136 * If frag_now==NULL, then there is no old, incomplete frag, so
137 * the old frag is not closed off.
138 *
139 * Out: now_subseg, now_seg updated.
140 * Frchain_now points to the (possibly new) struct frchain for this
141 * sub-segment.
252b5132
RH
142 */
143
252b5132 144segT
24361518 145subseg_get (const char *segname, int force_new)
252b5132
RH
146{
147 segT secptr;
148 segment_info_type *seginfo;
fd361982 149 const char *now_seg_name = now_seg ? bfd_section_name (now_seg) : 0;
252b5132
RH
150
151 if (!force_new
152 && now_seg_name
153 && (now_seg_name == segname
154 || !strcmp (now_seg_name, segname)))
155 return now_seg;
156
157 if (!force_new)
158 secptr = bfd_make_section_old_way (stdoutput, segname);
159 else
160 secptr = bfd_make_section_anyway (stdoutput, segname);
161
162 seginfo = seg_info (secptr);
163 if (! seginfo)
164 {
c9049d30 165 secptr->output_section = secptr;
add39d23 166 seginfo = XCNEW (segment_info_type);
252b5132 167 seginfo->bfd_section = secptr;
fd361982 168 bfd_set_section_userdata (secptr, seginfo);
252b5132
RH
169 }
170 return secptr;
171}
172
173segT
24361518 174subseg_new (const char *segname, subsegT subseg)
252b5132
RH
175{
176 segT secptr;
252b5132
RH
177
178 secptr = subseg_get (segname, 0);
179 subseg_set_rest (secptr, subseg);
252b5132
RH
180 return secptr;
181}
182
183/* Like subseg_new, except a new section is always created, even if
184 a section with that name already exists. */
185segT
24361518 186subseg_force_new (const char *segname, subsegT subseg)
252b5132
RH
187{
188 segT secptr;
252b5132
RH
189
190 secptr = subseg_get (segname, 1);
191 subseg_set_rest (secptr, subseg);
252b5132
RH
192 return secptr;
193}
194
195void
24361518 196subseg_set (segT secptr, subsegT subseg)
252b5132
RH
197{
198 if (! (secptr == now_seg && subseg == now_subseg))
199 subseg_set_rest (secptr, subseg);
200 mri_common_symbol = NULL;
201}
202
203#ifndef obj_sec_sym_ok_for_reloc
204#define obj_sec_sym_ok_for_reloc(SEC) 0
205#endif
206
252b5132 207symbolS *
24361518 208section_symbol (segT sec)
252b5132
RH
209{
210 segment_info_type *seginfo = seg_info (sec);
211 symbolS *s;
212
213 if (seginfo == 0)
214 abort ();
215 if (seginfo->sym)
216 return seginfo->sym;
217
218#ifndef EMIT_SECTION_SYMBOLS
219#define EMIT_SECTION_SYMBOLS 1
220#endif
221
a161fe53 222 if (! EMIT_SECTION_SYMBOLS || symbol_table_frozen)
252b5132
RH
223 {
224 /* Here we know it won't be going into the symbol table. */
546c73f9 225 s = symbol_create (sec->symbol->name, sec, 0, &zero_address_frag);
252b5132
RH
226 }
227 else
228 {
90c1602c 229 segT seg;
91c4c449 230 s = symbol_find (sec->symbol->name);
22fe14ad
NC
231 /* We have to make sure it is the right symbol when we
232 have multiple sections with the same section name. */
90c1602c
L
233 if (s == NULL
234 || ((seg = S_GET_SEGMENT (s)) != sec
235 && seg != undefined_section))
546c73f9 236 s = symbol_new (sec->symbol->name, sec, 0, &zero_address_frag);
90c1602c 237 else if (seg == undefined_section)
252b5132 238 {
90c1602c
L
239 S_SET_SEGMENT (s, sec);
240 symbol_set_frag (s, &zero_address_frag);
252b5132
RH
241 }
242 }
243
244 S_CLEAR_EXTERNAL (s);
245
246 /* Use the BFD section symbol, if possible. */
247 if (obj_sec_sym_ok_for_reloc (sec))
49309057 248 symbol_set_bfdsym (s, sec->symbol);
a161fe53
AM
249 else
250 symbol_get_bfdsym (s)->flags |= BSF_SECTION_SYM;
252b5132
RH
251
252 seginfo->sym = s;
253 return s;
254}
255
b9e57a38
ILT
256/* Return whether the specified segment is thought to hold text. */
257
258int
24361518 259subseg_text_p (segT sec)
b9e57a38 260{
fd361982 261 return (bfd_section_flags (sec) & SEC_CODE) != 0;
b9e57a38
ILT
262}
263
c6cb92c5
NS
264/* Return non zero if SEC has at least one byte of data. It is
265 possible that we'll return zero even on a non-empty section because
266 we don't know all the fragment types, and it is possible that an
267 fr_fix == 0 one still contributes data. Think of this as
268 seg_definitely_not_empty_p. */
269
4ee4d249 270int
f17c130b 271seg_not_empty_p (segT sec ATTRIBUTE_UNUSED)
c6cb92c5
NS
272{
273 segment_info_type *seginfo = seg_info (sec);
274 frchainS *chain;
275 fragS *frag;
276
277 if (!seginfo)
278 return 0;
34bca508 279
c6cb92c5
NS
280 for (chain = seginfo->frchainP; chain; chain = chain->frch_next)
281 {
282 for (frag = chain->frch_root; frag; frag = frag->fr_next)
283 if (frag->fr_fix)
284 return 1;
285 if (obstack_next_free (&chain->frch_obstack)
286 != chain->frch_last->fr_literal)
287 return 1;
288 }
289 return 0;
290}
291
252b5132 292void
24361518 293subsegs_print_statistics (FILE *file)
252b5132
RH
294{
295 frchainS *frchp;
c9049d30
AM
296 asection *s;
297
4cbd8408
NC
298 /* PR 20897 - check to see if the output bfd was actually created. */
299 if (stdoutput == NULL)
300 return;
301
252b5132 302 fprintf (file, "frag chains:\n");
c9049d30 303 for (s = stdoutput->sections; s; s = s->next)
252b5132 304 {
c9049d30 305 segment_info_type *seginfo;
252b5132 306
c9049d30
AM
307 /* Skip gas-internal sections. */
308 if (segment_name (s)[0] == '*')
252b5132
RH
309 continue;
310
c9049d30
AM
311 seginfo = seg_info (s);
312 if (!seginfo)
252b5132
RH
313 continue;
314
c9049d30 315 for (frchp = seginfo->frchainP; frchp; frchp = frchp->frch_next)
252b5132 316 {
c9049d30
AM
317 int count = 0;
318 fragS *fragp;
319
320 for (fragp = frchp->frch_root; fragp; fragp = fragp->fr_next)
321 count++;
322
323 fprintf (file, "\n");
324 fprintf (file, "\t%p %-10s\t%10d frags\n", (void *) frchp,
325 segment_name (s), count);
252b5132 326 }
252b5132
RH
327 }
328}
329
330/* end of subsegs.c */
This page took 0.918627 seconds and 4 git commands to generate.