2000-07-24 22:59:04 +02:00
|
|
|
|
/* search-list.c
|
|
|
|
|
|
2007-07-06 12:40:34 +02:00
|
|
|
|
Copyright 2000, 2001, 2002, 2004, 2007 Free Software Foundation, Inc.
|
2000-07-24 22:59:04 +02:00
|
|
|
|
|
|
|
|
|
This file is part of GNU Binutils.
|
|
|
|
|
|
|
|
|
|
This program is free software; you can redistribute it and/or modify
|
|
|
|
|
it under the terms of the GNU General Public License as published by
|
2007-07-06 12:40:34 +02:00
|
|
|
|
the Free Software Foundation; either version 3 of the License, or
|
2000-07-24 22:59:04 +02:00
|
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
|
|
This program 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 a copy of the GNU General Public License
|
|
|
|
|
along with this program; if not, write to the Free Software
|
2005-05-09 08:55:25 +02:00
|
|
|
|
Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA
|
|
|
|
|
02110-1301, USA. */
|
2000-07-24 22:59:04 +02:00
|
|
|
|
|
1999-05-03 09:29:11 +02:00
|
|
|
|
#include "gprof.h"
|
2008-06-19 18:30:29 +02:00
|
|
|
|
#include "libiberty.h"
|
1999-05-03 09:29:11 +02:00
|
|
|
|
#include "search_list.h"
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
void
|
* alpha.c, basic_blocks.c, basic_blocks.h, bb_exit_func.c,
call_graph.c, call_graph.h, cg_arcs.c, cg_arcs.h, cg_dfn.c,
cg_dfn.h, cg_print.c, cg_print.h, corefile.c, corefile.h,
gmon_io.c, gmon_io.h, gprof.c, gprof.h, hertz.h, hist.c, hist.h,
i386.c, mips.c, search_list.c, search_list.h, source.c, source.h,
sparc.c, sym_ids.c, sym_ids.h, symtab.c, symtab.h, tahoe.c,
utils.c, utils.h, vax.c, gen-c-prog.awk: Convert K&R C to ANSI C.
2004-05-26 06:55:55 +02:00
|
|
|
|
search_list_append (Search_List *list, const char *paths)
|
1999-05-03 09:29:11 +02:00
|
|
|
|
{
|
|
|
|
|
Search_List_Elem *new_el;
|
|
|
|
|
const char *beg, *colon;
|
2002-02-01 09:24:16 +01:00
|
|
|
|
unsigned int len;
|
1999-05-03 09:29:11 +02:00
|
|
|
|
|
|
|
|
|
colon = paths - 1;
|
|
|
|
|
do
|
|
|
|
|
{
|
|
|
|
|
beg = colon + 1;
|
2000-05-26 15:11:57 +02:00
|
|
|
|
colon = strchr (beg, PATH_SEP_CHAR);
|
2001-03-14 04:14:56 +01:00
|
|
|
|
|
1999-05-03 09:29:11 +02:00
|
|
|
|
if (colon)
|
2000-07-24 22:59:04 +02:00
|
|
|
|
len = colon - beg;
|
1999-05-03 09:29:11 +02:00
|
|
|
|
else
|
2000-07-24 22:59:04 +02:00
|
|
|
|
len = strlen (beg);
|
|
|
|
|
|
1999-05-03 09:29:11 +02:00
|
|
|
|
new_el = (Search_List_Elem *) xmalloc (sizeof (*new_el) + len);
|
|
|
|
|
memcpy (new_el->path, beg, len);
|
|
|
|
|
new_el->path[len] = '\0';
|
|
|
|
|
|
2000-07-24 22:59:04 +02:00
|
|
|
|
/* Append new path at end of list. */
|
1999-05-03 09:29:11 +02:00
|
|
|
|
new_el->next = 0;
|
2001-03-14 04:14:56 +01:00
|
|
|
|
|
1999-05-03 09:29:11 +02:00
|
|
|
|
if (list->tail)
|
2000-07-24 22:59:04 +02:00
|
|
|
|
list->tail->next = new_el;
|
1999-05-03 09:29:11 +02:00
|
|
|
|
else
|
2000-07-24 22:59:04 +02:00
|
|
|
|
list->head = new_el;
|
|
|
|
|
|
1999-05-03 09:29:11 +02:00
|
|
|
|
list->tail = new_el;
|
|
|
|
|
}
|
|
|
|
|
while (colon);
|
|
|
|
|
}
|