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
|
/* Align section.
Copyright (C) 2002, 2005 Red Hat, Inc.
Written by Ulrich Drepper <drepper@redhat.com>, 2002.
This program is Open Source software; you can redistribute it and/or
modify it under the terms of the Open Software License version 1.0 as
published by the Open Source Initiative.
You should have received a copy of the Open Software License along
with this program; if not, you may obtain a copy of the Open Software
License version 1.0 from http://www.opensource.org/licenses/osl.php or
by writing the Open Source Initiative c/o Lawrence Rosen, Esq.,
3001 King Ranch Road, Ukiah, CA 95482. */
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
#include <inttypes.h>
#include <stdlib.h>
#include <sys/param.h>
#include <libasmP.h>
#include <system.h>
int
asm_align (asmscn, value)
AsmScn_t *asmscn;
GElf_Word value;
{
if (asmscn == NULL)
/* An earlier error. */
return -1;
/* The alignment value must be a power of two. */
if (unlikely (! powerof2 (value)))
{
__libasm_seterrno (ASM_E_INVALID);
return -1;
}
if (unlikely (asmscn->ctx->textp))
{
fprintf (asmscn->ctx->out.file, "\t.align %" PRId32 ", ",
(int32_t) value);
if (asmscn->pattern->len == 1)
fprintf (asmscn->ctx->out.file, "%02hhx\n", asmscn->pattern->bytes[0]);
else
{
fputc_unlocked ('"', asmscn->ctx->out.file);
for (size_t cnt = 0; cnt < asmscn->pattern->len; ++cnt)
fprintf (asmscn->ctx->out.file, "\\x%02hhx",
asmscn->pattern->bytes[cnt]);
fputs_unlocked ("\"\n", asmscn->ctx->out.file);
}
return 0;
}
rwlock_wrlock (asmscn->ctx->lock);
int result = 0;
/* Fillbytes necessary? */
if ((asmscn->offset & (value - 1)) != 0)
{
/* Add fillbytes. */
size_t cnt = value - (asmscn->offset & (value - 1));
/* Ensure there is enough room to add the fill bytes. */
result = __libasm_ensure_section_space (asmscn, cnt);
if (result != 0)
goto out;
/* Fill in the bytes. We align the pattern according to the
current offset. */
size_t byteptr = asmscn->offset % asmscn->pattern->len;
/* Update the total size. */
asmscn->offset += cnt;
do
{
asmscn->content->data[asmscn->content->len++]
= asmscn->pattern->bytes[byteptr++];
if (byteptr == asmscn->pattern->len)
byteptr = 0;
}
while (--cnt > 0);
}
/* Remember the maximum alignment for this subsection. */
if (asmscn->max_align < value)
{
asmscn->max_align = value;
/* Update the parent as well (if it exists). */
if (asmscn->subsection_id != 0)
{
rwlock_wrlock (asmscn->data.up->ctx->lock);
if (asmscn->data.up->max_align < value)
asmscn->data.up->max_align = value;
rwlock_unlock (asmscn->data.up->ctx->lock);
}
}
out:
rwlock_unlock (asmscn->ctx->lock);
return result;
}
/* Ensure there are at least LEN bytes available in the output buffer
for ASMSCN. */
int
__libasm_ensure_section_space (asmscn, len)
AsmScn_t *asmscn;
size_t len;
{
/* The blocks with the section content are kept in a circular
single-linked list. */
size_t size;
if (asmscn->content == NULL)
{
/* This is the first block. */
size = MAX (2 * len, 960);
asmscn->content = (struct AsmData *) malloc (sizeof (struct AsmData)
+ size);
if (asmscn->content == NULL)
return -1;
asmscn->content->next = asmscn->content;
}
else
{
struct AsmData *newp;
if (asmscn->content->maxlen - asmscn->content->len >= len)
/* Nothing to do, there is enough space. */
return 0;
size = MAX (2 *len, MIN (32768, 2 * asmscn->offset));
newp = (struct AsmData *) malloc (sizeof (struct AsmData) + size);
if (newp == NULL)
return -1;
newp->next = asmscn->content->next;
asmscn->content = asmscn->content->next = newp;
}
asmscn->content->len = 0;
asmscn->content->maxlen = size;
return 0;
}
|
