/* search-list.c
|
/* search-list.c
|
|
|
Copyright 2000, 2001, 2002, 2004, 2007 Free Software Foundation, Inc.
|
Copyright 2000, 2001, 2002, 2004, 2007 Free Software Foundation, Inc.
|
|
|
This file is part of GNU Binutils.
|
This file is part of GNU Binutils.
|
|
|
This program is free software; you can redistribute it and/or modify
|
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
|
it under the terms of the GNU General Public License as published by
|
the Free Software Foundation; either version 3 of the License, or
|
the Free Software Foundation; either version 3 of the License, or
|
(at your option) any later version.
|
(at your option) any later version.
|
|
|
This program is distributed in the hope that it will be useful,
|
This program is distributed in the hope that it will be useful,
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
GNU General Public License for more details.
|
GNU General Public License for more details.
|
|
|
You should have received a copy of the GNU General Public License
|
You should have received a copy of the GNU General Public License
|
along with this program; if not, write to the Free Software
|
along with this program; if not, write to the Free Software
|
Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA
|
Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston, MA
|
02110-1301, USA. */
|
02110-1301, USA. */
|
|
|
#include "gprof.h"
|
#include "gprof.h"
|
#include "libiberty.h"
|
#include "libiberty.h"
|
#include "search_list.h"
|
#include "search_list.h"
|
|
|
|
|
void
|
void
|
search_list_append (Search_List *list, const char *paths)
|
search_list_append (Search_List *list, const char *paths)
|
{
|
{
|
Search_List_Elem *new_el;
|
Search_List_Elem *new_el;
|
const char *beg, *colon;
|
const char *beg, *colon;
|
unsigned int len;
|
unsigned int len;
|
|
|
colon = paths - 1;
|
colon = paths - 1;
|
do
|
do
|
{
|
{
|
beg = colon + 1;
|
beg = colon + 1;
|
colon = strchr (beg, PATH_SEP_CHAR);
|
colon = strchr (beg, PATH_SEP_CHAR);
|
|
|
if (colon)
|
if (colon)
|
len = colon - beg;
|
len = colon - beg;
|
else
|
else
|
len = strlen (beg);
|
len = strlen (beg);
|
|
|
new_el = (Search_List_Elem *) xmalloc (sizeof (*new_el) + len);
|
new_el = (Search_List_Elem *) xmalloc (sizeof (*new_el) + len);
|
memcpy (new_el->path, beg, len);
|
memcpy (new_el->path, beg, len);
|
new_el->path[len] = '\0';
|
new_el->path[len] = '\0';
|
|
|
/* Append new path at end of list. */
|
/* Append new path at end of list. */
|
new_el->next = 0;
|
new_el->next = 0;
|
|
|
if (list->tail)
|
if (list->tail)
|
list->tail->next = new_el;
|
list->tail->next = new_el;
|
else
|
else
|
list->head = new_el;
|
list->head = new_el;
|
|
|
list->tail = new_el;
|
list->tail = new_el;
|
}
|
}
|
while (colon);
|
while (colon);
|
}
|
}
|
|
|
