Lines Matching defs:code
16 * Redistributions of source code must retain the above copyright notice,
48 /* NOTE ABOUT PERFORMANCE: A user of this function sent some code that improved
54 search up the state list. (Grep for "duplicate" below to find the code.) For
57 bottleneck. The suggested code used an indexing scheme to remember which states
62 I wrote some thread-safe, not-limited code to try something similar at the time
72 in others, so I abandoned this code. */
93 * Code parameters and static tables *
227 /* These 2 tables allow for compact code for testing for \D, \d, \S, \s, \W,
304 this_start_code the opening bracket of this subexpression's code
369 /* And now, here is the code */
503 /* This is the code for a "normal" subpattern (not a backward assertion). The
608 const uschar *code;
658 code = start_code + state_offset;
659 codevalue = *code;
682 if (utf8) { GETCHARLEN(d, (code + coptable[codevalue]), dlen); } else
684 d = code[coptable[codevalue]];
736 if (code != end_code)
741 ADD_ACTIVE(state_offset - GET(code, 1), 0);
780 do { code += GET(code, 1); } while (*code == OP_ALT);
781 ADD_ACTIVE((int)(code - start_code), 0);
789 ADD_ACTIVE((int)(code - start_code + 1 + LINK_SIZE), 0);
790 code += GET(code, 1);
792 while (*code == OP_ALT);
798 ADD_ACTIVE((int)(code - start_code + 3 + LINK_SIZE), 0);
799 code += GET(code, 1);
800 while (*code == OP_ALT)
802 ADD_ACTIVE((int)(code - start_code + 1 + LINK_SIZE), 0);
803 code += GET(code, 1);
811 code += 1 + GET(code, 2);
812 while (*code == OP_ALT) code += GET(code, 1);
813 ADD_ACTIVE((int)(code - start_code + 1 + LINK_SIZE), 0);
818 code += 1 + GET(code, 2);
819 while (*code == OP_ALT) code += GET(code, 1);
820 ADD_ACTIVE((int)(code - start_code + 1 + LINK_SIZE), 0);
844 ims = code[1];
984 switch(code[1])
996 OK = _pcre_ucp_gentype[prop->chartype] == code[2];
1000 OK = prop->chartype == code[2];
1004 OK = prop->script == code[2];
1128 if (++count >= GET2(code, 1))
1154 if (++count >= GET2(code, 1))
1165 argument. It keeps the code above fast for the other cases. The argument
1178 switch(code[2])
1190 OK = _pcre_ucp_gentype[prop->chartype] == code[3];
1194 OK = prop->chartype == code[3];
1198 OK = prop->script == code[3];
1425 switch(code[2])
1437 OK = _pcre_ucp_gentype[prop->chartype] == code[3];
1441 OK = prop->chartype == code[3];
1445 OK = prop->script == code[3];
1697 switch(code[4])
1709 OK = _pcre_ucp_gentype[prop->chartype] == code[5];
1713 OK = prop->chartype == code[5];
1717 OK = prop->script == code[5];
1758 if (++count >= GET2(code, 1))
1792 if (++count >= GET2(code, 1))
1832 if (++count >= GET2(code, 1))
1878 if (++count >= GET2(code, 1))
1933 if (++count >= GET2(code, 1))
2284 if (++count >= GET2(code, 1))
2324 if (++count >= GET2(code, 1))
2349 ecode = code + 33;
2353 ((code[1 + c/8] & (1 << (c&7))) != 0);
2363 ecode = code + GET(code, 1);
2364 if (clen > 0) isinclass = _pcre_xclass(c, code + 1 + LINK_SIZE);
2434 const uschar *endasscode = code + GET(code, 1);
2440 code, /* this subexpression's code */
2463 int codelink = GET(code, 1);
2470 if (code[LINK_SIZE+1] == OP_CALLOUT)
2477 cb.callout_number = code[LINK_SIZE+2];
2483 cb.pattern_position = GET(code, LINK_SIZE + 3);
2484 cb.next_item_length = GET(code, 3 + 2*LINK_SIZE);
2491 code += _pcre_OP_lengths[OP_CALLOUT]; /* Skip callout data */
2494 condcode = code[LINK_SIZE+1];
2512 int value = GET2(code, LINK_SIZE+2);
2524 const uschar *asscode = code + LINK_SIZE + 1;
2531 asscode, /* this subexpression's code */
2564 start_code + GET(code, 1), /* this subexpression's code */
2616 code, /* this subexpression's code */
2629 const uschar *end_subpattern = code;
2705 cb.callout_number = code[1];
2711 cb.pattern_position = GET(code, 2);
2712 cb.next_item_length = GET(code, 2 + LINK_SIZE);
3038 the newline, later code breaks this loop. */
3142 code is not obeyed when restarting after a partial match). */
3161 code for cased/caseless versions makes it go faster, as does using an
3215 md->start_code, /* this subexpression's code */
