Lines Matching refs:is
11 * distributed under the License is distributed on an "AS IS" BASIS,
250 #define DUMP__CHILD(ctx, is, node, child) if (1) { \
255 debug_printf(ctx, "!!! Parse tree is not consistent !!!\n"); \
257 debug_printf(ctx, "Parent of " #child " child node is " \
272 debug_printf(ctx, "%s(missing)\n", is); \
279 char *is;
288 is = " ";
294 debug_printf(ctx, "%s%s (%s)\n", is, current->token.s,
305 debug_printf(ctx, "%s%s\n", is, current->token.s);
306 is = apr_pstrcat(ctx->dpool, is, " ", NULL);
310 DUMP__CHILD(ctx, is, current, right)
313 is = apr_pstrmemdup(ctx->dpool, is, strlen(is) - 4);
321 debug_printf(ctx, "%s%s\n", is, current->token.s);
322 is = apr_pstrcat(ctx->dpool, is, " ", NULL);
326 DUMP__CHILD(ctx, is, current, left)
327 DUMP__CHILD(ctx, is, current, right)
332 is = apr_pstrmemdup(ctx->dpool, is, strlen(is) - 4);
341 /* it is possible to call this function within the parser loop, to see
342 * how the tree is built. That way, we must cleanup after us to dump
491 * 's' is overwritten with the decoded string.
492 * If 's' is syntatically incorrect, then the followed fixups will be made:
501 /* The following is a shrinking transformation, therefore safe. */
503 /* Note: this function is deprecated in favour of apr_unescape_entity() in APR */
554 /* is it numeric ? */
660 * v.s. empty strings on an empty match is deliberate.
671 " is out of range (last regex was: '%s') in %s",
741 * string from ctx->pool. The return value is always the parsed string)
753 /* sanity check, out && !length is not supported */
1040 /* if last token was ACCESS, this token is STRING */
1659 * The tag value is html decoded if dodecode is non-zero.
1660 * The tag value may be NULL if there is no tag value..
1706 /* note: it is okay to pass NULL for the "next filter" since
1736 /* note: it is okay to pass NULL for the "next filter" since
1767 * virtual url. If onerror fails, or no onerror is present, the default
1768 * error string is inserted into the stream.
1886 * Yes, this is a memory leak. */
2541 /* we need to use the 'main' request pool to set notes as that is
2737 /* This is an implementation of the BNDM search algorithm.
2773 * Returns the count of character that is the first match or hl if no
2774 * match is found.
2923 /* the whole buffer is a partial match */
2930 * We must try all combinations, since the start_seq is a random
3040 /* partial match, the buffer is too small to match fully */
3089 * find out whether the next token is (a possible) end_seq or an argument
3139 /* partial match, the buffer is too small to match fully */
3329 * The value is still the raw input string. Finally clean it up.
3370 * This is the main loop over the current bucket brigade.
3425 * EOS, which is now waiting for execution.
3455 /* enough is enough ... */
3891 /* Always unset the content-length. There is no way to know if
3893 * It is very possible for us to not find any content in the first
3964 /* These OS's don't support xbithack. This is being worked on. */
3991 * serves the file. All we have to do is add the filter.
4178 "String to be displayed if an echoed variable is undefined"),