| 1 | /* search-list.c
|
|---|
| 2 |
|
|---|
| 3 | Copyright 2000, 2001 Free Software Foundation, Inc.
|
|---|
| 4 |
|
|---|
| 5 | This file is part of GNU Binutils.
|
|---|
| 6 |
|
|---|
| 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.
|
|---|
| 11 |
|
|---|
| 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.
|
|---|
| 16 |
|
|---|
| 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. */
|
|---|
| 21 | |
|---|
| 22 |
|
|---|
| 23 | #include "libiberty.h"
|
|---|
| 24 | #include "gprof.h"
|
|---|
| 25 | #include "search_list.h"
|
|---|
| 26 |
|
|---|
| 27 |
|
|---|
| 28 | void
|
|---|
| 29 | DEFUN (search_list_append, (list, paths),
|
|---|
| 30 | Search_List * list AND const char *paths)
|
|---|
| 31 | {
|
|---|
| 32 | Search_List_Elem *new_el;
|
|---|
| 33 | const char *beg, *colon;
|
|---|
| 34 | int len;
|
|---|
| 35 |
|
|---|
| 36 | colon = paths - 1;
|
|---|
| 37 | do
|
|---|
| 38 | {
|
|---|
| 39 | beg = colon + 1;
|
|---|
| 40 | colon = strchr (beg, PATH_SEP_CHAR);
|
|---|
| 41 |
|
|---|
| 42 | if (colon)
|
|---|
| 43 | len = colon - beg;
|
|---|
| 44 | else
|
|---|
| 45 | len = strlen (beg);
|
|---|
| 46 |
|
|---|
| 47 | new_el = (Search_List_Elem *) xmalloc (sizeof (*new_el) + len);
|
|---|
| 48 | memcpy (new_el->path, beg, len);
|
|---|
| 49 | new_el->path[len] = '\0';
|
|---|
| 50 |
|
|---|
| 51 | /* Append new path at end of list. */
|
|---|
| 52 | new_el->next = 0;
|
|---|
| 53 |
|
|---|
| 54 | if (list->tail)
|
|---|
| 55 | list->tail->next = new_el;
|
|---|
| 56 | else
|
|---|
| 57 | list->head = new_el;
|
|---|
| 58 |
|
|---|
| 59 | list->tail = new_el;
|
|---|
| 60 | }
|
|---|
| 61 | while (colon);
|
|---|
| 62 | }
|
|---|