perf sort: Reorder HISTC_SRCLINE index
[deliverable/linux.git] / tools / perf / util / strlist.c
CommitLineData
25903407
ACM
1/*
2 * (c) 2009 Arnaldo Carvalho de Melo <acme@redhat.com>
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
ee8dd3ca
DA
13static
14struct rb_node *strlist__node_new(struct rblist *rblist, const void *entry)
25903407 15{
ee8dd3ca
DA
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));
25903407 20
ee8dd3ca
DA
21 if (snode != NULL) {
22 if (strlist->dupstr) {
25903407
ACM
23 s = strdup(s);
24 if (s == NULL)
25 goto out_delete;
26 }
ee8dd3ca
DA
27 snode->s = s;
28 rc = &snode->rb_node;
25903407
ACM
29 }
30
ee8dd3ca 31 return rc;
25903407
ACM
32
33out_delete:
ee8dd3ca 34 free(snode);
25903407
ACM
35 return NULL;
36}
37
d8639f06 38static void str_node__delete(struct str_node *snode, bool dupstr)
25903407
ACM
39{
40 if (dupstr)
d8639f06
ACM
41 free((void *)snode->s);
42 free(snode);
25903407
ACM
43}
44
ee8dd3ca
DA
45static
46void strlist__node_delete(struct rblist *rblist, struct rb_node *rb_node)
25903407 47{
ee8dd3ca
DA
48 struct strlist *slist = container_of(rblist, struct strlist, rblist);
49 struct str_node *snode = container_of(rb_node, struct str_node, rb_node);
25903407 50
ee8dd3ca
DA
51 str_node__delete(snode, slist->dupstr);
52}
25903407 53
ee8dd3ca
DA
54static 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}
25903407 61
d8639f06 62int strlist__add(struct strlist *slist, const char *new_entry)
ee8dd3ca 63{
d8639f06 64 return rblist__add_node(&slist->rblist, new_entry);
25903407
ACM
65}
66
d8639f06 67int strlist__load(struct strlist *slist, const char *filename)
25903407
ACM
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
d8639f06 83 err = strlist__add(slist, entry);
25903407
ACM
84 if (err != 0)
85 goto out;
86 }
87
88 err = 0;
89out:
90 fclose(fp);
91 return err;
92}
93
ee8dd3ca 94void strlist__remove(struct strlist *slist, struct str_node *snode)
25903407 95{
45922814 96 rblist__remove_node(&slist->rblist, &snode->rb_node);
25903407
ACM
97}
98
ee8dd3ca 99struct str_node *strlist__find(struct strlist *slist, const char *entry)
25903407 100{
ee8dd3ca
DA
101 struct str_node *snode = NULL;
102 struct rb_node *rb_node = rblist__find(&slist->rblist, entry);
25903407 103
ee8dd3ca
DA
104 if (rb_node)
105 snode = container_of(rb_node, struct str_node, rb_node);
106
107 return snode;
25903407
ACM
108}
109
d8639f06 110static int strlist__parse_list_entry(struct strlist *slist, const char *s)
25903407
ACM
111{
112 if (strncmp(s, "file://", 7) == 0)
d8639f06 113 return strlist__load(slist, s + 7);
25903407 114
d8639f06 115 return strlist__add(slist, s);
25903407
ACM
116}
117
d8639f06 118int strlist__parse_list(struct strlist *slist, const char *s)
25903407
ACM
119{
120 char *sep;
121 int err;
122
123 while ((sep = strchr(s, ',')) != NULL) {
124 *sep = '\0';
d8639f06 125 err = strlist__parse_list_entry(slist, s);
25903407
ACM
126 *sep = ',';
127 if (err != 0)
128 return err;
129 s = sep + 1;
130 }
131
d8639f06 132 return *s ? strlist__parse_list_entry(slist, s) : 0;
25903407
ACM
133}
134
d8639f06 135struct strlist *strlist__new(bool dupstr, const char *list)
25903407 136{
d8639f06 137 struct strlist *slist = malloc(sizeof(*slist));
25903407 138
d8639f06
ACM
139 if (slist != NULL) {
140 rblist__init(&slist->rblist);
141 slist->rblist.node_cmp = strlist__node_cmp;
142 slist->rblist.node_new = strlist__node_new;
143 slist->rblist.node_delete = strlist__node_delete;
ee8dd3ca 144
d8639f06 145 slist->dupstr = dupstr;
79146a69 146 if (list && strlist__parse_list(slist, list) != 0)
25903407
ACM
147 goto out_error;
148 }
149
d8639f06 150 return slist;
25903407 151out_error:
d8639f06 152 free(slist);
25903407
ACM
153 return NULL;
154}
155
d8639f06 156void strlist__delete(struct strlist *slist)
25903407 157{
d8639f06
ACM
158 if (slist != NULL)
159 rblist__delete(&slist->rblist);
25903407 160}
27d0fd41 161
ee8dd3ca 162struct str_node *strlist__entry(const struct strlist *slist, unsigned int idx)
27d0fd41 163{
ee8dd3ca
DA
164 struct str_node *snode = NULL;
165 struct rb_node *rb_node;
27d0fd41 166
ee8dd3ca
DA
167 rb_node = rblist__entry(&slist->rblist, idx);
168 if (rb_node)
169 snode = container_of(rb_node, struct str_node, rb_node);
27d0fd41 170
ee8dd3ca 171 return snode;
27d0fd41 172}
This page took 0.320014 seconds and 5 git commands to generate.