projects
/
deliverable
/
binutils-gdb.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
gas: sparc: fix collision of registers and pseudo-ops.
[deliverable/binutils-gdb.git]
/
gprof
/
search_list.c
diff --git
a/gprof/search_list.c
b/gprof/search_list.c
index 8a496a66fa09d337f0d93ed49ef5b8534f0e194c..ffaad958c9e80cfd643e500bb6c8ca6705ec5856 100644
(file)
--- a/
gprof/search_list.c
+++ b/
gprof/search_list.c
@@
-1,12
+1,12
@@
/* search-list.c
/* search-list.c
- Copyright (C) 2000
Free Software Foundation, Inc.
+ Copyright (C) 2000
-2016
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
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
+ the Free Software Foundation; either version
3
of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
(at your option) any later version.
This program is distributed in the hope that it will be useful,
@@
-16,28
+16,27
@@
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
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., 5
9 Temple Place - Suite 330
, Boston, MA
- 0211
1-1307
, USA. */
+ Foundation, Inc., 5
1 Franklin Street - Fifth Floor
, Boston, MA
+ 0211
0-1301
, USA. */
\f
\f
-#include "libiberty.h"
#include "gprof.h"
#include "gprof.h"
+#include "libiberty.h"
#include "search_list.h"
void
#include "search_list.h"
void
-DEFUN (search_list_append, (list, paths),
- Search_List * list AND const char *paths)
+search_list_append (Search_List *list, const char *paths)
{
Search_List_Elem *new_el;
const char *beg, *colon;
{
Search_List_Elem *new_el;
const char *beg, *colon;
- int len;
+
unsigned
int len;
colon = paths - 1;
do
{
beg = colon + 1;
colon = strchr (beg, PATH_SEP_CHAR);
colon = paths - 1;
do
{
beg = colon + 1;
colon = strchr (beg, PATH_SEP_CHAR);
-
+
if (colon)
len = colon - beg;
else
if (colon)
len = colon - beg;
else
@@
-49,7
+48,7
@@
DEFUN (search_list_append, (list, paths),
/* Append new path at end of list. */
new_el->next = 0;
/* Append new path at end of list. */
new_el->next = 0;
-
+
if (list->tail)
list->tail->next = new_el;
else
if (list->tail)
list->tail->next = new_el;
else
This page took
0.025083 seconds
and
4
git commands to generate.