Lines Matching defs:p
431 #define ARG1u(p) ARG_VALUE(ARG1u_LOC(p))
432 #define ARG1i(p) ARG_VALUE(ARG1i_LOC(p))
433 #define ARG1a(p) ARG_VALUE(ARG1a_LOC(p))
434 #define ARG1b(p) ARG_VALUE(ARG1b_LOC(p))
436 #define ARG2u(p) ARG_VALUE(ARG2u_LOC(p))
437 #define ARG2i(p) ARG_VALUE(ARG2i_LOC(p))
438 #define ARG2a(p) ARG_VALUE(ARG2a_LOC(p))
439 #define ARG2b(p) ARG_VALUE(ARG2b_LOC(p))
441 #define ARG3u(p) ARG_VALUE(ARG3u_LOC(p))
442 #define ARG3i(p) ARG_VALUE(ARG3i_LOC(p))
443 #define ARG3a(p) ARG_VALUE(ARG3a_LOC(p))
444 #define ARG3b(p) ARG_VALUE(ARG3b_LOC(p))
446 #define ARGp(p) ARGp_VALUE_inline(p)
448 #define ARG1u_SET(p, val) ARG__SET(ARG1u_LOC(p), (val))
449 #define ARG1i_SET(p, val) ARG__SET(ARG1i_LOC(p), (val))
450 #define ARG1a_SET(p, val) ARG__SET(ARG1a_LOC(p), (val))
451 #define ARG1b_SET(p, val) ARG__SET(ARG1b_LOC(p), (val))
453 #define ARG2u_SET(p, val) ARG__SET(ARG2u_LOC(p), (val))
454 #define ARG2i_SET(p, val) ARG__SET(ARG2i_LOC(p), (val))
455 #define ARG2a_SET(p, val) ARG__SET(ARG2a_LOC(p), (val))
456 #define ARG2b_SET(p, val) ARG__SET(ARG2b_LOC(p), (val))
458 #define ARG3u_SET(p, val) ARG__SET(ARG3u_LOC(p), (val))
459 #define ARG3i_SET(p, val) ARG__SET(ARG3i_LOC(p), (val))
460 #define ARG3a_SET(p, val) ARG__SET(ARG3a_LOC(p), (val))
461 #define ARG3b_SET(p, val) ARG__SET(ARG3b_LOC(p), (val))
463 #define ARGp_SET(p, val) ARGp_SET_inline((p),(val))
484 #define NEXT_OFF(p) ((p)->head.data.next_off)
485 #define OP(p) ((p)->head.data.type)
486 #define STR_LEN_U8(p) ((p)->head.data.u_8.str_len_u8)
487 #define FIRST_BYTE(p) ((p)->head.data.u_8.first_byte)
488 #define FLAGS(p) ((p)->head.data.u_8.flags) /* Caution: Doesn't apply to all \
491 #define STR_LENs(p) (__ASSERT_(OP(p) != LEXACT && OP(p) != LEXACT_REQ8) \
492 STR_LEN_U8((struct regnode_string *)p))
493 #define STRINGs(p) (__ASSERT_(OP(p) != LEXACT && OP(p) != LEXACT_REQ8) \
494 ((struct regnode_string *)p)->string)
495 #define OPERANDs(p) STRINGs(p)
497 #define PARNO(p) ARG1u(p) /* APPLIES for OPEN and CLOSE only */
513 #define STR_LENl(p) (__ASSERT_(OP(p) == LEXACT || OP(p) == LEXACT_REQ8) \
514 (((struct regnode_lstring *)p)->str_len_u32))
515 #define STRINGl(p) (__ASSERT_(OP(p) == LEXACT || OP(p) == LEXACT_REQ8) \
516 (((struct regnode_lstring *)p)->string))
517 #define OPERANDl(p) STRINGl(p)
519 #define STR_LEN(p) ((OP(p) == LEXACT || OP(p) == LEXACT_REQ8) \
520 ? STR_LENl(p) : STR_LENs(p))
521 #define STRING(p) ((OP(p) == LEXACT || OP(p) == LEXACT_REQ8) \
522 ? STRINGl(p) : STRINGs(p))
523 #define OPERAND(p) STRING(p)
529 #define setSTR_LEN(p,v) \
531 if (OP(p) == LEXACT || OP(p) == LEXACT_REQ8) \
532 ((struct regnode_lstring *)(p))->str_len_u32 = (v); \
534 STR_LEN_U8((struct regnode_string *)(p)) = (v); \
538 #define ANYOFRbase(p) (ARG1u(p) & nBIT_MASK(ANYOFR_BASE_BITS))
539 #define ANYOFRdelta(p) (ARG1u(p) >> ANYOFR_BASE_BITS)
545 #define ARGp_BYTES_LOC(p) (((struct regnode_p *)p)->arg1_sv_ptr_bytes)
546 #define ARG1u_LOC(p) (((struct regnode_1 *)p)->arg1.u32)
547 #define ARG1i_LOC(p) (((struct regnode_1 *)p)->arg1.i32)
548 #define ARG1a_LOC(p) (((struct regnode_1 *)p)->arg1.hi_lo.u16a)
549 #define ARG1b_LOC(p) (((struct regnode_1 *)p)->arg1.hi_lo.u16b)
550 #define ARG2u_LOC(p) (((struct regnode_2 *)p)->arg2.u32)
551 #define ARG2i_LOC(p) (((struct regnode_2 *)p)->arg2.i32)
552 #define ARG2a_LOC(p) (((struct regnode_2 *)p)->arg2.hi_lo.u16a)
553 #define ARG2b_LOC(p) (((struct regnode_2 *)p)->arg2.hi_lo.u16b)
554 #define ARG3u_LOC(p) (((struct regnode_3 *)p)->arg3.u32)
555 #define ARG3i_LOC(p) (((struct regnode_3 *)p)->arg3.i32)
556 #define ARG3a_LOC(p) (((struct regnode_3 *)p)->arg3.hi_lo.u16a)
557 #define ARG3b_LOC(p) (((struct regnode_3 *)p)->arg3.hi_lo.u16b)
630 #define REGNODE_AFTER_PLUS(p,extra) ((p) + NODE_STEP_REGNODE + (extra))
637 #define REGNODE_AFTER_PLUS_DEBUG(p,extra) \
638 (assert_(check_regnode_after(p,extra)) REGNODE_AFTER_PLUS((p),(extra)))
640 /* find the regnode after this p by using the opcode we previously extracted
641 * with OP(p) */
642 #define REGNODE_AFTER_opcode(p,op) REGNODE_AFTER_PLUS_DEBUG((p),REGNODE_ARG_LEN(op))
644 /* find the regnode after this p by using the size of the struct associated with
645 * the opcode for p. use this when you *know* that p is pointer to a given type*/
646 #define REGNODE_AFTER_type(p,t) REGNODE_AFTER_PLUS_DEBUG((p),EXTRA_SIZE(t))
648 /* find the regnode after this p by using OP(p) to find the regnode type of p */
649 #define REGNODE_AFTER_varies(p) regnode_after(p,TRUE)
651 /* find the regnode after this p by using OP(p) to find the regnode type of p */
652 #define REGNODE_AFTER(p) regnode_after(p,FALSE)
656 * All the places that use it assume that p will be one struct regnode large.
661 #define REGNODE_BEFORE_BASE(p) ((p) - NODE_STEP_REGNODE)
662 #define REGNODE_BEFORE_BASE_DEBUG(p) \
663 (assert_(check_regnode_after(REGNODE_BEFORE_BASE(p),0)) REGNODE_BEFORE_BASE(p))
664 #define REGNODE_BEFORE(p) REGNODE_BEFORE_BASE_DEBUG(p)
807 * 4) A user-defined \p{} property may not have been defined by the time the
911 * (These uses are mutually exclusive because the warning requires a \p{}, and
912 * \p{} implies /u which deselects /d). An SSC node only has this bit set if
991 property: \p{} or \P{} */
1004 #define BITMAP_BYTE(p, c) (( (U8*) (p)) [ ( ( (UV) (c)) >> 3) ] )
1006 #define BITMAP_TEST(p, c) (BITMAP_BYTE(p, c) & BITMAP_BIT((U8)(c)))
1008 #define ANYOF_FLAGS(p) (FLAGS(p))
1012 #define ANYOF_POSIXL_BITMAP(p) (((regnode_charclass_posixl*) (p))->classflags)
1015 #define ANYOF_POSIXL_SET(p, c) POSIXL_SET(ANYOF_POSIXL_BITMAP(p), (c))
1018 #define ANYOF_POSIXL_CLEAR(p, c) POSIXL_CLEAR(ANYOF_POSIXL_BITMAP(p), (c))
1021 #define ANYOF_POSIXL_TEST(p, c) POSIXL_TEST(ANYOF_POSIXL_BITMAP(p), (c))
1026 #define ANYOF_POSIXL_SET_TO_BITMAP(p, bits) \
1027 STMT_START { ANYOF_POSIXL_BITMAP(p) = (bits); } STMT_END
1036 #define ANYOF_POSIXL_TEST_ANY_SET(p) \
1037 ((ANYOF_FLAGS(p) & ANYOF_MATCHES_POSIXL) && ANYOF_POSIXL_BITMAP(p))
1038 #define ANYOF_CLASS_TEST_ANY_SET(p) ANYOF_POSIXL_TEST_ANY_SET(p)
1042 #define ANYOF_POSIXL_SSC_TEST_ANY_SET(p) \
1043 cBOOL(((regnode_ssc*)(p))->classflags)
1044 #define ANYOF_POSIXL_SSC_TEST_ALL_SET(p) /* Are all bits set? */ \
1045 (((regnode_ssc*) (p))->classflags \
1048 #define ANYOF_POSIXL_TEST_ALL_SET(p) \
1049 ((ANYOF_FLAGS(p) & ANYOF_MATCHES_POSIXL) \
1050 && ANYOF_POSIXL_BITMAP(p) == nBIT_MASK(ANYOF_POSIXL_MAX))
1058 #define ANYOF_BITMAP(p) ((regnode_charclass*)(p))->bitmap
1059 #define ANYOF_BITMAP_BYTE(p, c) BITMAP_BYTE(ANYOF_BITMAP(p), c)
1060 #define ANYOF_BITMAP_SET(p, c) (ANYOF_BITMAP_BYTE(p, c) |= ANYOF_BIT(c))
1061 #define ANYOF_BITMAP_CLEAR(p,c) (ANYOF_BITMAP_BYTE(p, c) &= ~ANYOF_BIT(c))
1062 #define ANYOF_BITMAP_TEST(p, c) cBOOL(ANYOF_BITMAP_BYTE(p, c) & ANYOF_BIT(c))
1064 #define ANYOF_BITMAP_SETALL(p) \
1065 memset (ANYOF_BITMAP(p), 255, ANYOF_BITMAP_SIZE)
1066 #define ANYOF_BITMAP_CLEARALL(p) \
1067 Zero (ANYOF_BITMAP(p), ANYOF_BITMAP_SIZE)
1073 # define UCHARAT(p) ((int)*(const U8*)(p))
1075 # define UCHARAT(p) ((int)*(p)&CHARMASK)
1293 #define TRIE_BITMAP(p) (((reg_trie_data *)(p))->bitmap)
1294 #define TRIE_BITMAP_BYTE(p, c) BITMAP_BYTE(TRIE_BITMAP(p), c)
1295 #define TRIE_BITMAP_SET(p, c) (TRIE_BITMAP_BYTE(p, c) |= ANYOF_BIT((U8)c))
1296 #define TRIE_BITMAP_CLEAR(p,c) (TRIE_BITMAP_BYTE(p, c) &= ~ANYOF_BIT((U8)c))
1297 #define TRIE_BITMAP_TEST(p, c) (TRIE_BITMAP_BYTE(p, c) & ANYOF_BIT((U8)c))