Lines Matching defs:node
34 struct discover_class_node *node = discover_class_cache;
36 for (; node != NULL && strcmp(s,node->name) != 0; node = node->next);
38 return node;
43 struct discover_class_node *node = discover_class_cache;
45 for (; node != NULL && c != node->value; node = node->next);
47 return node;
59 struct discover_class_node *node;
69 /* allocate a node */
70 node = malloc(sizeof(struct discover_class_node));
71 if (node == NULL)
75 node->perms = calloc(MAXVECTORS,sizeof(char*));
76 if (node->perms == NULL)
80 node->name = strdup(s);
81 if (node->name == NULL)
99 if (sscanf(buf, "%hu", &node->value) != 1)
147 node->perms[value-1] = strdup(dentry->d_name);
148 if (node->perms[value-1] == NULL)
155 node->next = discover_class_cache;
156 discover_class_cache = node;
158 return node;
163 free(node->perms[i]);
165 free(node->name);
167 free(node->perms);
169 free(node);
198 struct discover_class_node *node;
200 node = get_class_cache_entry_name(s);
201 if (node == NULL) {
202 node = discover_class(s);
204 if (node == NULL) {
210 return map_class(node->value);
236 struct discover_class_node *node;
239 node = get_class_cache_entry_value(kclass);
240 if (node != NULL) {
242 for (i = 0; i < MAXVECTORS && node->perms[i] != NULL; i++)
243 if (strcmp(node->perms[i],s) == 0)
253 struct discover_class_node *node;
257 node = get_class_cache_entry_value(tclass);
258 if (node == NULL)
261 return node->name;
267 struct discover_class_node *node;
273 node = get_class_cache_entry_value(tclass);
274 if (av && node)
277 return node->perms[i];