Lines Matching defs:key_node_t
71 struct key_node_t {
76 struct key_node_t *next; /* ptr to next char of this key */
77 struct key_node_t *sibling; /* ptr to another key with same prefix*/
80 private int node_trav(EditLine *, key_node_t *, char *,
82 private int node__try(EditLine *, key_node_t *, const char *,
84 private key_node_t *node__get(int);
85 private void node__free(key_node_t *);
86 private void node__put(EditLine *, key_node_t *);
87 private int node__delete(EditLine *, key_node_t **, const char *);
88 private int node_lookup(EditLine *, const char *, key_node_t *,
90 private int node_enum(EditLine *, key_node_t *, size_t);
272 node_trav(EditLine *el, key_node_t *ptr, char *ch, key_value_t *val)
309 node__try(EditLine *el, key_node_t *ptr, const char *str, key_value_t *val, int ntype)
313 key_node_t *xm;
371 node__delete(EditLine *el, key_node_t **inptr, const char *str)
373 key_node_t *ptr;
374 key_node_t *prev_ptr = NULL;
379 key_node_t *xm;
419 node__put(EditLine *el, key_node_t *ptr)
448 * Returns pointer to a key_node_t for ch.
450 private key_node_t *
453 key_node_t *ptr;
455 ptr = (key_node_t *) el_malloc((size_t) sizeof(key_node_t));
467 node__free(key_node_t *k)
481 node_lookup(EditLine *el, const char *str, key_node_t *ptr, size_t cnt)
531 node_enum(EditLine *el, key_node_t *ptr, size_t cnt)