Lines Matching defs:node
65 /** \brief Dict list node
68 struct s_dict_node *next; /**< \brief Pointer to next node of NULL if NIL */
102 /** \brief Searches for given key and returns pointer to the whole node
106 * \return Pointer to the found node or NULL if not
128 /** \brief Frees passed node and related mallocs and relinks list
130 * \param[in,out] p Pointer to the pointer holding node to delete
178 /** \brief Searches for given key and returns pointer to the whole node
182 * \return Pointer to the found node or NULL if not
211 t_dict_node *node = DictInternalFind(dict, key);
213 if (node)
215 if (strcmp(node->value, value))
217 free(node->value);
218 node->value = strdup(value);
223 /* Inset new node in linked list */
225 node = malloc(sizeof *node);
226 node->key = strdup(key);
227 node->value = strdup(value);
228 node->next = Dict_head;
229 Dict_head = node;
251 t_dict_node *node = DictInternalFind(dict, key);
252 return node ? node->value : NULL;