Lines Matching +defs:child +defs:name
57 filter_trie_node *child;
76 filter_trie_node *child, int c)
100 parent->children[j].child = parent->children[j - 1].child;
103 parent->children[i].child = child;
110 * key 'c' (or, if an existing child node matches, return that one)
120 return parent->children[i].child;
154 static ap_filter_rec_t *get_filter_handle(const char *name,
162 for (n = name; *n; n++) {
170 node = node->children[middle].child;
193 AP_DECLARE(ap_filter_rec_t *)ap_get_output_filter_handle(const char *name)
195 return get_filter_handle(name, registered_output_filters);
198 AP_DECLARE(ap_filter_rec_t *)ap_get_input_filter_handle(const char *name)
200 return get_filter_handle(name, registered_input_filters);
203 static ap_filter_rec_t *register_filter(const char *name,
218 normalized_name = apr_pstrdup(FILTER_POOL, name);
223 filter_trie_node *child = trie_node_alloc(FILTER_POOL, node, *n);
225 trie_node_link(FILTER_POOL, node, child, apr_toupper(*n));
227 node = child;
235 frec->name = normalized_name;
246 AP_DECLARE(ap_filter_rec_t *) ap_register_input_filter(const char *name,
253 return register_filter(name, f, filter_init, ftype,
257 AP_DECLARE(ap_filter_rec_t *) ap_register_output_filter(const char *name,
262 return ap_register_output_filter_protocol(name, filter_func,
267 const char *name,
276 ret = register_filter(name, f, filter_init, ftype,
298 "a content filter was added without a request: %s", frec->name);
308 "a protocol filter was added without a request: %s", frec->name);
362 static ap_filter_t *add_any_filter(const char *name, void *ctx,
374 for (n = name; *n; n++) {
382 node = node->children[middle].child;
405 "an unknown filter was not added: %s", name);
409 AP_DECLARE(ap_filter_t *) ap_add_input_filter(const char *name, void *ctx,
412 return add_any_filter(name, ctx, r, c, registered_input_filters,
427 AP_DECLARE(ap_filter_t *) ap_add_output_filter(const char *name, void *ctx,
430 return add_any_filter(name, ctx, r, c, registered_output_filters,