mirror of
https://github.com/darlinghq/darling-gdb.git
synced 2024-11-27 14:00:30 +00:00
3e8f6abf1e
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.
61 lines
1.5 KiB
C
61 lines
1.5 KiB
C
/* search-list.c
|
||
|
||
Copyright 2000, 2001, 2002 Free Software Foundation, Inc.
|
||
|
||
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
|
||
the Free Software Foundation; either version 2 of the License, or
|
||
(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
|
||
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
|
||
02111-1307, USA. */
|
||
|
||
#include "libiberty.h"
|
||
#include "gprof.h"
|
||
#include "search_list.h"
|
||
|
||
|
||
void
|
||
search_list_append (Search_List *list, const char *paths)
|
||
{
|
||
Search_List_Elem *new_el;
|
||
const char *beg, *colon;
|
||
unsigned int len;
|
||
|
||
colon = paths - 1;
|
||
do
|
||
{
|
||
beg = colon + 1;
|
||
colon = strchr (beg, PATH_SEP_CHAR);
|
||
|
||
if (colon)
|
||
len = colon - beg;
|
||
else
|
||
len = strlen (beg);
|
||
|
||
new_el = (Search_List_Elem *) xmalloc (sizeof (*new_el) + len);
|
||
memcpy (new_el->path, beg, len);
|
||
new_el->path[len] = '\0';
|
||
|
||
/* Append new path at end of list. */
|
||
new_el->next = 0;
|
||
|
||
if (list->tail)
|
||
list->tail->next = new_el;
|
||
else
|
||
list->head = new_el;
|
||
|
||
list->tail = new_el;
|
||
}
|
||
while (colon);
|
||
}
|