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