Searched refs:node (Results 1 - 12 of 12) sorted by relevance

/httpd/modules/ldap/
H A Dutil_ldap_cache.c36 util_url_node_t *node = n; local
37 return util_ald_hash_string(1, node->url);
51 util_url_node_t *node = util_ald_alloc(cache, sizeof *node); local
53 if (node) {
54 if (!(node->url = util_ald_strdup(cache, n->url))) {
55 util_ald_free(cache, node);
58 node->search_cache = n->search_cache;
59 node->compare_cache = n->compare_cache;
60 node
70 util_url_node_t *node = n; local
81 util_url_node_t *node = n; local
135 util_search_node_t *node = n; local
149 util_search_node_t *node = c; local
201 util_search_node_t *node = n; local
220 util_search_node_t *node = n; local
240 util_compare_node_t *node = n; local
257 util_compare_node_t *node = util_ald_alloc(cache, sizeof *node); local
279 util_compare_node_t *node = n; local
290 util_compare_node_t *node = n; local
345 util_dn_compare_node_t *node = n; local
360 util_dn_compare_node_t *node = util_ald_alloc(cache, sizeof *node); local
377 util_dn_compare_node_t *node = n; local
385 util_dn_compare_node_t *node = n; local
[all...]
H A Dutil_ldap_cache_mgr.c454 util_cache_node_t *node; local
472 node = (util_cache_node_t *)util_ald_alloc(cache,
474 if (node == NULL) {
491 node = (util_cache_node_t *)util_ald_alloc(cache,
493 if (node == NULL) {
523 util_ald_free(cache, node);
532 node->add_time = apr_time_now();
533 node->payload = payload;
534 node->next = cache->nodes[hashval];
535 cache->nodes[hashval] = node;
[all...]
H A Dutil_ldap.c901 util_dn_compare_node_t *node; local
940 node = util_ald_cache_fetch(curl->dn_compare_cache, &newnode);
941 if (node != NULL) {
1016 node = util_ald_cache_fetch(curl->dn_compare_cache, &newnode);
1017 if ( (node == NULL)
1018 || (strcmp(reqdn, node->reqdn) != 0)
1019 || (strcmp(dn, node->dn) != 0))
1037 * different cache node: require group includes the DN; require user does not
1164 /* If the node doesn't exist then insert it, otherwise just update
1352 * and (require user compares). Each compare has a different cache node
[all...]
/httpd/server/
H A Dutil_filter.c60 /* Each trie node has an array of pointers to its children.
73 /* Link a trie node to its parent
108 /* Allocate a new node for a trie.
109 * If parent is non-NULL, link the new node under the parent node with
110 * key 'c' (or, if an existing child node matches, return that one)
130 else { /* No parent node */
159 const filter_trie_node *node; local
161 node = filter_set;
165 end = node
212 filter_trie_node *node; local
371 const filter_trie_node *node; local
[all...]
H A Dutil_expr_eval.c91 const ap_expr_t *node)
96 switch (node->node_op) {
99 result = node->node_arg1;
102 result = ap_expr_eval_var(ctx, (ap_expr_var_func_t *)node->node_arg1,
103 node->node_arg2);
106 if (((ap_expr_t *)node->node_arg2)->node_op != op_Concat &&
107 ((ap_expr_t *)node->node_arg1)->node_op != op_Concat) {
108 const char *s1 = ap_expr_eval_word(ctx, node->node_arg1);
109 const char *s2 = ap_expr_eval_word(ctx, node->node_arg2);
117 else if (((ap_expr_t *)node
90 ap_expr_eval_word(ap_expr_eval_ctx_t *ctx, const ap_expr_t *node) argument
252 ap_expr_eval_comp(ap_expr_eval_ctx_t *ctx, const ap_expr_t *node) argument
364 ssl_expr_eval_comp(ap_expr_eval_ctx_t *ctx, const ap_expr_t *node) argument
469 ap_expr_t *node = apr_palloc(ctx->pool, sizeof(ap_expr_t)); local
564 ap_expr_t *node = ap_expr_info_make(AP_EXPR_FUNC_VAR, name, ctx, NULL); local
772 ap_expr_eval(ap_expr_eval_ctx_t *ctx, const ap_expr_t *node) argument
[all...]
H A Dutil.c2763 struct apr_memnode_t *node; member in struct:ap_varbuf_info
2770 info->node->next = NULL;
2771 apr_allocator_free(info->allocator, info->node);
2855 new_info->node = new_node;
/httpd/docs/manual/style/scripts/
H A Dprettify.js513 * where #1 is a reference to the {@code "print "} text node above, and so
524 * @param {Node} node an HTML DOM subtree containing source-code.
529 function extractSourceSpans(node, isPreformatted) {
537 function walk(node) {
538 switch (node.nodeType) {
540 if (nocode.test(node.className)) { return; }
541 for (var child = node.firstChild; child; child = child.nextSibling) {
544 var nodeName = node.nodeName.toLowerCase();
548 spans[(k++ << 1) | 1] = node;
552 var text = node
[all...]
H A Dprettify.min.js40 function extractSourceSpans(node,isPreformatted){var nocode=/(?:^|\s)nocode(?:\s|$)/;var chunks=[];var length=0;var spans=[];var k=0;function walk(node){switch(node.nodeType){case 1:if(nocode.test(node.className)){return;}
41 for(var child=node.firstChild;child;child=child.nextSibling){walk(child);}
42 var nodeName=node.nodeName.toLowerCase();if('br'===nodeName||'li'===nodeName){chunks[k]='\n';spans[k<<1]=length++;spans[(k++<<1)|1]=node;}
43 break;case 3:case 4:var text=node.nodeValue;if(text.length){if(!isPreformatted){text=text.replace(/[ \t\r\n]+/g,' ');}else{text=text.replace(/\r\n?/g,'\n');text=text.replace(/^(\r?\n\s*)+/g,'');text=text.replace(/^\s*/g,'');text=text.replace(/(\r?\n\s*)+$/g,'');}
44 chunks[k]=text;spans[k<<1]=length;length+=text.length;spans[(k++<<1)|1]=node;}
46 walk(node);retur
[all...]
/httpd/modules/cluster/
H A Dmod_heartmonitor.c265 /* Read the file and update the line corresponding to the node */
303 hm_server_t node; local
309 node.busy = atoi(apr_table_get(hbt, "busy"));
311 node.busy = 0;
315 node.ready = atoi(apr_table_get(hbt, "ready"));
317 node.ready = 0;
321 node.seen = atoi(apr_table_get(hbt, "lastseen"));
323 node.seen = SEEN_TIMEOUT;
325 seen = fage + node.seen;
328 node
[all...]
/httpd/modules/filters/
H A Dmod_include.c250 #define DUMP__CHILD(ctx, is, node, child) if (1) { \
251 parse_node_t *d__c = node->child; \
254 if (d__c->parent != node) { \
257 debug_printf(ctx, "Parent of " #child " child node is " \
261 debug_printf(ctx, "Parent of " #child " child node " \
262 "points to another node (of type %s)!\n", \
267 node = d__c; \
372 #define DEBUG_DUMP_EVAL(ctx, node) do { \
374 switch ((node)->token.type) { \
376 debug_printf((ctx), " Evaluate: %s (%s) -> %c\n", (node)
[all...]
H A Dmod_filter.c444 ap_expr_info_t *node; local
470 node = ap_expr_parse_cmd(cmd, expr, 0, &err, NULL);
476 provider->expr = node;
/httpd/modules/generators/
H A Dmod_info.c239 static void mod_info_show_parents(request_rec * r, ap_directive_t * node, argument
243 mod_info_show_parents(r, node->parent, from, to - 1);
244 mod_info_show_open(r, node, to);
248 ap_directive_t * node, int from, int level)
254 for (dir = node; dir; dir = dir->next) {
247 mod_info_module_cmds(request_rec * r, const command_rec * cmds, ap_directive_t * node, int from, int level) argument

Completed in 195 milliseconds