/* Create new section group. Copyright (C) 2002, 2016 Red Hat, Inc. This file is part of elfutils. Written by Ulrich Drepper , 2002. This file is free software; you can redistribute it and/or modify it under the terms of either * the GNU Lesser General Public License as published by the Free Software Foundation; either version 3 of the License, or (at your option) any later version or * the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version or both in parallel, as here. elfutils 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 copies of the GNU General Public License and the GNU Lesser General Public License along with this program. If not, see . */ #ifdef HAVE_CONFIG_H # include #endif #include #include #include #include "libasmP.h" #include AsmScnGrp_t * asm_newscngrp (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 = dwelf_strtab_add_len (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; }