2000-10-31 Philip Blundell <philb@gnu.org>
[binutils.git] / gprof / search_list.c
blob8a496a66fa09d337f0d93ed49ef5b8534f0e194c
1 /* search-list.c
3 Copyright (C) 2000 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 2 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., 59 Temple Place - Suite 330, Boston, MA
20 02111-1307, USA. */
22 #include "libiberty.h"
23 #include "gprof.h"
24 #include "search_list.h"
27 void
28 DEFUN (search_list_append, (list, paths),
29 Search_List * list AND const char *paths)
31 Search_List_Elem *new_el;
32 const char *beg, *colon;
33 int len;
35 colon = paths - 1;
38 beg = colon + 1;
39 colon = strchr (beg, PATH_SEP_CHAR);
41 if (colon)
42 len = colon - beg;
43 else
44 len = strlen (beg);
46 new_el = (Search_List_Elem *) xmalloc (sizeof (*new_el) + len);
47 memcpy (new_el->path, beg, len);
48 new_el->path[len] = '\0';
50 /* Append new path at end of list. */
51 new_el->next = 0;
53 if (list->tail)
54 list->tail->next = new_el;
55 else
56 list->head = new_el;
58 list->tail = new_el;
60 while (colon);