Lines Matching defs:numPats
192 int numPats; /* Number of patterns in sequence (usually
213 Pattern pats[1]; /* Array of "numPats" patterns. Only one
215 * enough space will be allocated for "numPats"
1555 patCount = psPtr->numPats;
1731 if ((virtMatchPtr->numPats != 1)
1759 if (matchPtr->numPats != bestPtr->numPats) {
1760 if (bestPtr->numPats > matchPtr->numPats) {
1767 i < matchPtr->numPats; i++, patPtr++, patPtr2++) {
3336 int numPats, virtualFound;
3361 for (numPats = 0; numPats < EVENT_BUFFER_SIZE; numPats++, patPtr--) {
3387 if ((count > 1) && (numPats < EVENT_BUFFER_SIZE-1)) {
3391 numPats++;
3392 if ((count == 3) && (numPats < EVENT_BUFFER_SIZE-1)) {
3395 numPats++;
3407 if (numPats == 0) {
3411 if ((numPats > 1) && (virtualFound != 0)) {
3416 patPtr = &pats[EVENT_BUFFER_SIZE-numPats];
3422 sequenceSize = numPats*sizeof(Pattern);
3426 if ((numPats == psPtr->numPats)
3443 + (numPats-1)*sizeof(Pattern)));
3444 psPtr->numPats = numPats;
3753 for (patsLeft = psPtr->numPats, patPtr = &psPtr->pats[psPtr->numPats - 1];