Lines Matching refs:subject
64 pattern for certain subject strings, but on other strings and on many of the
189 the subject is reached. ***NOTE*** If the start of this table is modified, the
328 /* This internal function applies a compiled pattern to a subject string,
336 current_subject where we currently are in the subject string
337 start_offset start offset in the subject string
573 /* Loop for scanning the subject */
599 printf("%.*sNext character: rest of subject = \"", rlevel*2-2, SP);
614 /* Load the current character from the subject outside the loop, as many
629 clen = 0; /* This indicates the end of the subject */
695 subject, remember the fact for use when testing for a partial match. */
701 tempting to test for the presence of a subject character here, but that
702 is wrong, because sometimes zero repetitions of the subject are
768 start of the subject, save the match data, shifting up all previous
897 /* These opcodes inspect the next subject character, and sometimes
900 at the end of the subject. */
1158 /* These opcodes likewise inspect the subject character, but have an
2112 to the current subject character; it is loaded into d. We still get
2113 here even if there is no subject character, because in some cases zero
2709 cb.subject = (PCRE_SPTR)start_subject;
2711 cb.subject = (PCRE_SPTR16)start_subject;
2713 cb.subject = (PCRE_SPTR32)start_subject;
2802 /* Check for repeating a recursion without advancing the subject
2936 are no new states yet set up, then skip over the subject string
3008 are no new states yet set up, then skip over the subject string
3063 cb.subject = (PCRE_SPTR)start_subject;
3065 cb.subject = (PCRE_SPTR16)start_subject;
3067 cb.subject = (PCRE_SPTR32)start_subject;
3094 /* We have finished the processing at the current subject character. If no
3105 for the fact that the end of the subject was reached. */
3121 ptr >= end_subject && /* End of subject and */
3134 ptr += clen; /* Advance to next subject character */
3135 } /* Loop to move along the subject string */
3153 /* This external function applies a compiled re to a subject string using a DFA
3160 subject points to the subject string
3161 length length of subject string (may contain binary zeros)
3162 start_offset where to start in the subject string
3178 const char *subject, int length, int start_offset, int options, int *offsets,
3183 PCRE_SPTR16 subject, int length, int start_offset, int options, int *offsets,
3188 PCRE_SPTR32 subject, int length, int start_offset, int options, int *offsets,
3212 if (re == NULL || subject == NULL || workspace == NULL ||
3260 current_subject = (const pcre_uchar *)subject + start_offset;
3261 end_subject = (const pcre_uchar *)subject + length;
3278 md->start_subject = (const pcre_uchar *)subject;
3343 int errorcode = PRIV(valid_utf)((pcre_uchar *)subject, length, &erroroffset);
3363 NOT_FIRSTCHAR(((PCRE_PUCHAR)subject)[start_offset]))
3548 /* If the pattern was studied, a minimum subject length may be set. This
3559 subject for the match to succeed. If the first pcre_uchar is set,
3560 req_char must be later in the subject; otherwise the test starts at the
3566 HOWEVER: when the subject string is very, very long, searching to its end
3620 start_offset, /* start offset in subject */
3634 offsets[0] = (int)(md->start_used_ptr - (PCRE_PUCHAR)subject);
3635 offsets[1] = (int)(end_subject - (PCRE_PUCHAR)subject);
3637 offsets[2] = (int)(current_subject - (PCRE_PUCHAR)subject);
3642 /* Advance to the next subject character unless we are at the end of a line
