Searched refs:GET2 (Results 1 - 8 of 8) sorted by relevance

/forgerock/web-agents-v4/pcre/
H A Dpcre_printint.c397 fprintf(f, "%s %d", priv_OP_names[*code], GET2(code, 1+LINK_SIZE));
424 fprintf(f, " %s %d", priv_OP_names[*code], GET2(code, 1));
428 fprintf(f, "%3d %s", GET2(code,1), priv_OP_names[*code]);
433 pcre_uchar *entry = (pcre_uchar *)re + offset + (GET2(code, 1) * size) +
437 fprintf(f, ">%d", GET2(code, 1 + IMM2_SIZE));
442 c = GET2(code, 1);
451 pcre_uchar *entry = (pcre_uchar *)re + offset + (GET2(code, 1) * size) +
455 fprintf(f, ">%d", GET2(code, 1 + IMM2_SIZE));
520 fprintf(f, "%d}", GET2(code,1));
537 fprintf(f, "%d}", GET2(cod
[all...]
H A Dpcre_study.c247 branchlength += GET2(cc,1);
255 branchlength += GET2(cc,1);
361 branchlength += GET2(cc,1);
387 int count = GET2(cc, 1+IMM2_SIZE);
389 re->name_table_offset + GET2(cc, 1) * re->name_entry_size;
393 ce = cs = (pcre_uchar *)PRIV(find_bracket)(startcode, utf, GET2(slot, 0));
418 ce = cs = (pcre_uchar *)PRIV(find_bracket)(startcode, utf, GET2(cc, 1));
459 min = GET2(cc, 1);
1365 if (GET2(tcode, 1) == 0) tcode += 1 + 2 * IMM2_SIZE;
H A Dpcre_get.c122 if (c == 0) return GET2(entry, 0);
297 int n = GET2(entry, 0);
300 return GET2(entry, 0);
H A Dpcre_exec.c958 number = GET2(ecode, 1+LINK_SIZE);
1129 number = GET2(ecode, 1+LINK_SIZE);
1351 unsigned int recno = GET2(ecode, 1); /* Recursion group number*/
1359 int count = GET2(ecode, 1 + IMM2_SIZE);
1360 pcre_uchar *slot = md->name_table + GET2(ecode, 1) * md->name_entry_size;
1363 unsigned int recno = GET2(slot, 0);
1372 offset = GET2(ecode, 1) << 1; /* Doubled ref number */
1378 int count = GET2(ecode, 1 + IMM2_SIZE);
1379 pcre_uchar *slot = md->name_table + GET2(ecode, 1) * md->name_entry_size;
1382 offset = GET2(slo
[all...]
H A Dpcre_dfa_exec.c1272 if (++count >= (int)GET2(code, 1))
1306 if (++count >= (int)GET2(code, 1))
1944 if (++count >= (int)GET2(code, 1))
1983 if (++count >= (int)GET2(code, 1))
2025 if (++count >= (int)GET2(code, 1))
2065 if (++count >= (int)GET2(code, 1))
2102 if (++count >= (int)GET2(code, 1))
2472 if (++count >= (int)GET2(code, 1))
2521 if (++count >= (int)GET2(code, 1))
2623 if (count >= (int)GET2(ecod
[all...]
H A Dpcre_internal.h543 /* For reasons that I do not understand, the expression in this GET2 macro is
547 #define GET2(a,n) \ macro
557 #define GET2(a,n) \ macro
567 #define GET2(a,n) \ macro
H A Dpcre_jit_compile.c801 common->optimized_cbracket[GET2(cc, 1)] = 0;
817 common->optimized_cbracket[GET2(cc, 1 + LINK_SIZE)] = 0;
831 common->optimized_cbracket[GET2(cc, 1)] = 0;
838 count = GET2(cc, 1 + IMM2_SIZE);
839 slot = common->name_table + GET2(cc, 1) * common->name_entry_size;
842 common->optimized_cbracket[GET2(slot, 0)] = 0;
928 if (GET2(cc, 1) == GET2(cc, 1 + IMM2_SIZE))
1514 offset = (GET2(cc, 1 + LINK_SIZE)) << 1;
1570 if (common->optimized_cbracket[GET2(c
[all...]
H A Dpcre_compile.c1854 branchlength += (int)GET2(cc,1);
1862 branchlength += GET2(cc,1);
1929 if (GET2(cc,1) != GET2(cc,1+IMM2_SIZE)) return -1;
1930 branchlength += (int)GET2(cc,1);
2081 int n = (int)GET2(code, 1+LINK_SIZE);
2531 if (GET2(ccode, 1) > 0) return FALSE; /* Minimum > 0 */
3042 list[1] = (GET2(end, 1) == 0);
6763 recno = GET2(slot, 0); /* Number from first found */
7146 recno = GET2(slo
[all...]

Completed in 103 milliseconds