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
|
/* Create new section group.
Copyright (C) 2002 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 <assert.h>
#include <stdlib.h>
#include <string.h>
#include "libasmP.h"
#include <system.h>
AsmScnGrp_t *
asm_newscngrp (ctx, grpname, signature, flags)
AsmCtx_t *ctx;
const char *grpname;
AsmSym_t *signature;
Elf32_Word flags;
{
AsmScnGrp_t *result;
size_t grpname_len = strlen (grpname) + 1;
if (ctx == NULL)
return NULL;
if ((flags & ~GRP_COMDAT) != 0)
{
/* This is not a supported flag. */
__libasm_seterrno (ASM_E_INVALID);
return NULL;
}
result = (AsmScnGrp_t *) malloc (sizeof (AsmScnGrp_t) + grpname_len);
if (result == NULL)
return NULL;
result->signature = signature;
result->members = NULL;
result->nmembers = 0;
result->flags = flags;
memcpy (result->name, grpname, grpname_len);
result->strent = ebl_strtabadd (ctx->section_strtab, result->name,
grpname_len);
if (unlikely (ctx->textp))
// XXX TBI. What is the format?
abort ();
else
{
result->scn = elf_newscn (ctx->out.elf);
if (result->scn == NULL)
{
/* Couldn't allocate a new section. */
__libasm_seterrno (ASM_E_LIBELF);
free (result);
return NULL;
}
}
/* Enqueue is the context data structure. */
if (ctx->ngroups == 0)
{
assert (ctx->groups == NULL);
ctx->groups = result->next = result;
}
else
{
result->next = ctx->groups->next;
ctx->groups = ctx->groups->next = result;
}
++ctx->ngroups;
return result;
}
|
