Linux Kernel  3.7.1
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
strlist.c
Go to the documentation of this file.
1 /*
2  * (c) 2009 Arnaldo Carvalho de Melo <[email protected]>
3  *
4  * Licensed under the GPLv2.
5  */
6 
7 #include "strlist.h"
8 #include <errno.h>
9 #include <stdio.h>
10 #include <stdlib.h>
11 #include <string.h>
12 
13 static
14 struct rb_node *strlist__node_new(struct rblist *rblist, const void *entry)
15 {
16  const char *s = entry;
17  struct rb_node *rc = NULL;
18  struct strlist *strlist = container_of(rblist, struct strlist, rblist);
19  struct str_node *snode = malloc(sizeof(*snode));
20 
21  if (snode != NULL) {
22  if (strlist->dupstr) {
23  s = strdup(s);
24  if (s == NULL)
25  goto out_delete;
26  }
27  snode->s = s;
28  rc = &snode->rb_node;
29  }
30 
31  return rc;
32 
33 out_delete:
34  free(snode);
35  return NULL;
36 }
37 
38 static void str_node__delete(struct str_node *self, bool dupstr)
39 {
40  if (dupstr)
41  free((void *)self->s);
42  free(self);
43 }
44 
45 static
46 void strlist__node_delete(struct rblist *rblist, struct rb_node *rb_node)
47 {
48  struct strlist *slist = container_of(rblist, struct strlist, rblist);
49  struct str_node *snode = container_of(rb_node, struct str_node, rb_node);
50 
51  str_node__delete(snode, slist->dupstr);
52 }
53 
54 static int strlist__node_cmp(struct rb_node *rb_node, const void *entry)
55 {
56  const char *str = entry;
57  struct str_node *snode = container_of(rb_node, struct str_node, rb_node);
58 
59  return strcmp(snode->s, str);
60 }
61 
62 int strlist__add(struct strlist *self, const char *new_entry)
63 {
64  return rblist__add_node(&self->rblist, new_entry);
65 }
66 
67 int strlist__load(struct strlist *self, const char *filename)
68 {
69  char entry[1024];
70  int err;
71  FILE *fp = fopen(filename, "r");
72 
73  if (fp == NULL)
74  return errno;
75 
76  while (fgets(entry, sizeof(entry), fp) != NULL) {
77  const size_t len = strlen(entry);
78 
79  if (len == 0)
80  continue;
81  entry[len - 1] = '\0';
82 
83  err = strlist__add(self, entry);
84  if (err != 0)
85  goto out;
86  }
87 
88  err = 0;
89 out:
90  fclose(fp);
91  return err;
92 }
93 
94 void strlist__remove(struct strlist *slist, struct str_node *snode)
95 {
96  rblist__remove_node(&slist->rblist, &snode->rb_node);
97 }
98 
99 struct str_node *strlist__find(struct strlist *slist, const char *entry)
100 {
101  struct str_node *snode = NULL;
102  struct rb_node *rb_node = rblist__find(&slist->rblist, entry);
103 
104  if (rb_node)
105  snode = container_of(rb_node, struct str_node, rb_node);
106 
107  return snode;
108 }
109 
110 static int strlist__parse_list_entry(struct strlist *self, const char *s)
111 {
112  if (strncmp(s, "file://", 7) == 0)
113  return strlist__load(self, s + 7);
114 
115  return strlist__add(self, s);
116 }
117 
118 int strlist__parse_list(struct strlist *self, const char *s)
119 {
120  char *sep;
121  int err;
122 
123  while ((sep = strchr(s, ',')) != NULL) {
124  *sep = '\0';
125  err = strlist__parse_list_entry(self, s);
126  *sep = ',';
127  if (err != 0)
128  return err;
129  s = sep + 1;
130  }
131 
132  return *s ? strlist__parse_list_entry(self, s) : 0;
133 }
134 
135 struct strlist *strlist__new(bool dupstr, const char *slist)
136 {
137  struct strlist *self = malloc(sizeof(*self));
138 
139  if (self != NULL) {
140  rblist__init(&self->rblist);
141  self->rblist.node_cmp = strlist__node_cmp;
142  self->rblist.node_new = strlist__node_new;
143  self->rblist.node_delete = strlist__node_delete;
144 
145  self->dupstr = dupstr;
146  if (slist && strlist__parse_list(self, slist) != 0)
147  goto out_error;
148  }
149 
150  return self;
151 out_error:
152  free(self);
153  return NULL;
154 }
155 
156 void strlist__delete(struct strlist *self)
157 {
158  if (self != NULL)
159  rblist__delete(&self->rblist);
160 }
161 
162 struct str_node *strlist__entry(const struct strlist *slist, unsigned int idx)
163 {
164  struct str_node *snode = NULL;
165  struct rb_node *rb_node;
166 
167  rb_node = rblist__entry(&slist->rblist, idx);
168  if (rb_node)
169  snode = container_of(rb_node, struct str_node, rb_node);
170 
171  return snode;
172 }