diff options
author | Nick Clifton <nickc@redhat.com> | 2000-07-24 20:59:04 +0000 |
---|---|---|
committer | Nick Clifton <nickc@redhat.com> | 2000-07-24 20:59:04 +0000 |
commit | ef368dac31c8b58698e1f32b9d1f2dff3d099f7b (patch) | |
tree | fac7c1c056b39b99a10d1a512f69329e18da7153 /gprof/search_list.c | |
parent | 53116e27b6d56500499d94c66002ad7258e4b1ef (diff) | |
download | fsf-binutils-gdb-ef368dac31c8b58698e1f32b9d1f2dff3d099f7b.zip fsf-binutils-gdb-ef368dac31c8b58698e1f32b9d1f2dff3d099f7b.tar.gz fsf-binutils-gdb-ef368dac31c8b58698e1f32b9d1f2dff3d099f7b.tar.bz2 |
Add GPL copyright notices to uncopyrighted files.
Add copy of GPL.
Diffstat (limited to 'gprof/search_list.c')
-rw-r--r-- | gprof/search_list.c | 43 |
1 files changed, 30 insertions, 13 deletions
diff --git a/gprof/search_list.c b/gprof/search_list.c index ca29289..8a496a6 100644 --- a/gprof/search_list.c +++ b/gprof/search_list.c @@ -1,3 +1,24 @@ +/* search-list.c + + Copyright (C) 2000 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" @@ -16,28 +37,24 @@ DEFUN (search_list_append, (list, paths), { beg = colon + 1; colon = strchr (beg, PATH_SEP_CHAR); + if (colon) - { - len = colon - beg; - } + len = colon - beg; else - { - len = strlen (beg); - } + 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: */ + /* Append new path at end of list. */ new_el->next = 0; + if (list->tail) - { - list->tail->next = new_el; - } + list->tail->next = new_el; else - { - list->head = new_el; - } + list->head = new_el; + list->tail = new_el; } while (colon); |