File: search_list.c

package info (click to toggle)
binutils-m68k-linux 2.9.1.0.12-1
  • links: PTS
  • area: main
  • in suites: potato, slink
  • size: 29,636 kB
  • ctags: 40,213
  • sloc: ansic: 360,171; asm: 20,244; exp: 9,325; sh: 7,087; makefile: 5,430; yacc: 4,600; lisp: 2,991; lex: 1,426; sed: 544; cpp: 206; awk: 24; perl: 16
file content (44 lines) | stat: -rw-r--r-- 768 bytes parent folder | download | duplicates (6) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
 
#include "libiberty.h"
#include "gprof.h"
#include "search_list.h"


void
DEFUN (search_list_append, (list, paths),
       Search_List * list AND const char *paths)
{
  Search_List_Elem *new_el;
  const char *beg, *colon;
  int len;

  colon = paths - 1;
  do
    {
      beg = colon + 1;
      colon = strchr (beg, ':');
      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);
}