2 Copyright (C) 2002, 2005 Red Hat, Inc.
3 This file is part of Red Hat elfutils.
4 Written by Ulrich Drepper <drepper@redhat.com>, 2002.
6 Red Hat elfutils is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by the
8 Free Software Foundation; version 2 of the License.
10 Red Hat elfutils is distributed in the hope that it will be useful, but
11 WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 General Public License for more details.
15 You should have received a copy of the GNU General Public License along
16 with Red Hat elfutils; if not, write to the Free Software Foundation,
17 Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301 USA.
19 Red Hat elfutils is an included package of the Open Invention Network.
20 An included package of the Open Invention Network is a package for which
21 Open Invention Network licensees cross-license their patents. No patent
22 license is granted, either expressly or impliedly, by designation as an
23 included package. Should you wish to participate in the Open Invention
24 Network licensing program, please visit www.openinventionnetwork.com
25 <http://www.openinventionnetwork.com>. */
33 #include <sys/param.h>
40 asm_align (asmscn, value)
45 /* An earlier error. */
48 /* The alignment value must be a power of two. */
49 if (unlikely (! powerof2 (value)))
51 __libasm_seterrno (ASM_E_INVALID);
55 if (unlikely (asmscn->ctx->textp))
57 fprintf (asmscn->ctx->out.file, "\t.align %" PRId32 ", ",
59 if (asmscn->pattern->len == 1)
60 fprintf (asmscn->ctx->out.file, "%02hhx\n", asmscn->pattern->bytes[0]);
63 fputc_unlocked ('"', asmscn->ctx->out.file);
65 for (size_t cnt = 0; cnt < asmscn->pattern->len; ++cnt)
66 fprintf (asmscn->ctx->out.file, "\\x%02hhx",
67 asmscn->pattern->bytes[cnt]);
69 fputs_unlocked ("\"\n", asmscn->ctx->out.file);
74 rwlock_wrlock (asmscn->ctx->lock);
78 /* Fillbytes necessary? */
79 if ((asmscn->offset & (value - 1)) != 0)
82 size_t cnt = value - (asmscn->offset & (value - 1));
84 /* Ensure there is enough room to add the fill bytes. */
85 result = __libasm_ensure_section_space (asmscn, cnt);
89 /* Fill in the bytes. We align the pattern according to the
91 size_t byteptr = asmscn->offset % asmscn->pattern->len;
93 /* Update the total size. */
94 asmscn->offset += cnt;
98 asmscn->content->data[asmscn->content->len++]
99 = asmscn->pattern->bytes[byteptr++];
101 if (byteptr == asmscn->pattern->len)
107 /* Remember the maximum alignment for this subsection. */
108 if (asmscn->max_align < value)
110 asmscn->max_align = value;
112 /* Update the parent as well (if it exists). */
113 if (asmscn->subsection_id != 0)
115 rwlock_wrlock (asmscn->data.up->ctx->lock);
117 if (asmscn->data.up->max_align < value)
118 asmscn->data.up->max_align = value;
120 rwlock_unlock (asmscn->data.up->ctx->lock);
125 rwlock_unlock (asmscn->ctx->lock);
131 /* Ensure there are at least LEN bytes available in the output buffer
134 __libasm_ensure_section_space (asmscn, len)
138 /* The blocks with the section content are kept in a circular
139 single-linked list. */
142 if (asmscn->content == NULL)
144 /* This is the first block. */
145 size = MAX (2 * len, 960);
147 asmscn->content = (struct AsmData *) malloc (sizeof (struct AsmData)
149 if (asmscn->content == NULL)
152 asmscn->content->next = asmscn->content;
156 struct AsmData *newp;
158 if (asmscn->content->maxlen - asmscn->content->len >= len)
159 /* Nothing to do, there is enough space. */
162 size = MAX (2 *len, MIN (32768, 2 * asmscn->offset));
164 newp = (struct AsmData *) malloc (sizeof (struct AsmData) + size);
168 newp->next = asmscn->content->next;
169 asmscn->content = asmscn->content->next = newp;
172 asmscn->content->len = 0;
173 asmscn->content->maxlen = size;