Accept and ignore the R_BPF_64_NODLYD32 relocation.
[binutils-gdb.git] / gprof / search_list.c
blobd02a670475ab69610d5d33d91785035defd6cdb0
1 /* search-list.c
3 Copyright (C) 2000-2023 Free Software Foundation, Inc.
5 This file is part of GNU Binutils.
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3 of the License, or
10 (at your option) any later version.
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software
19 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA
20 02110-1301, USA. */
22 #include "gprof.h"
23 #include "libiberty.h"
24 #include "search_list.h"
27 void
28 search_list_append (Search_List *list, const char *paths)
30 Search_List_Elem *new_el;
31 const char *beg, *colon;
32 unsigned int len;
34 colon = paths - 1;
37 beg = colon + 1;
38 colon = strchr (beg, PATH_SEP_CHAR);
40 if (colon)
41 len = colon - beg;
42 else
43 len = strlen (beg);
45 new_el = (Search_List_Elem *) xmalloc (sizeof (*new_el) + len);
46 memcpy (new_el->path, beg, len);
47 new_el->path[len] = '\0';
49 /* Append new path at end of list. */
50 new_el->next = 0;
52 if (list->tail)
53 list->tail->next = new_el;
54 else
55 list->head = new_el;
57 list->tail = new_el;
59 while (colon);