Lines Matching defs:NULL

44 /* Emacs uses `NULL' as a predicate.  */
45 #undef NULL
151 #ifndef NULL
152 #define NULL 0
214 /* True if `size1' is non-NULL and PTR is pointing anywhere inside
215 `string1' or just past its end. This works if PTR is NULL, which is
525 if (start == NULL)
761 if (where == NULL)
822 { NULL, /* REG_NOERROR */
952 if (bufp->buffer == NULL) \
1134 if (compile_stack.stack == NULL)
1589 if (compile_stack.stack == NULL) return REG_ESPACE;
1886 beg_interval = NULL;
1894 beg_interval = NULL;
2160 const char *next_next = p + 1 < pend ? p + 1 : NULL;
2289 if (fail_stack.stack == NULL) \
2312 (fail_stack).stack == NULL \
2484 /* If the saved string location is NULL, it came from an \
2486 saved NULL, thus retaining our current position in the string. */ \
2488 if (string_temp != NULL) \
2564 assert (fastmap != NULL && p != NULL);
2858 return re_search_2 (bufp, NULL, 0, string, size, startpos, range,
3109 #define FREE_VAR(var) if (var) free (var); var = NULL
3152 return re_match_2 (bufp, NULL, 0, string, size, pos, regs, size);
3261 initialize this to NULL so that when we backtrack the first time
3263 const char *match_end = NULL;
3305 /* We must initialize all our variables to NULL, so that
3308 = best_regend = reg_dummy = NULL;
3309 reg_info = reg_info_dummy = (register_info_type *) NULL;
3336 if (size2 == 0 && string1 != NULL)
3458 if (regs->start == NULL || regs->end == NULL)
3471 if (regs->start == NULL || regs->end == NULL)
3907 pushes NULL as the value for the string on the stack. Then
3928 PUSH_FAILURE_POINT (p + mcnt, NULL, -2);
4678 if (re_comp_buf.buffer == NULL)
4683 if (re_comp_buf.fastmap == NULL)
4687 /* Since `re_exec' always passes NULL for the `regs' argument, we
4775 if (preg->translate == NULL)
4783 preg->translate = NULL;
4853 if (regs.start == NULL || regs.end == NULL)
4937 if (preg->buffer != NULL)
4939 preg->buffer = NULL;
4944 if (preg->fastmap != NULL)
4946 preg->fastmap = NULL;
4949 if (preg->translate != NULL)
4951 preg->translate = NULL;