File Manager

X7ROOT File Manager

Current Path: /lib64/perl5/CORE

ðŸ“ ..
ðŸ“„ EXTERN.h(1.67 KB)
ðŸ“„ INTERN.h(1.24 KB)
ðŸ“„ XSUB.h(23.87 KB)
ðŸ“„ av.h(3.24 KB)
ðŸ“„ bitcount.h(850 B)
ðŸ“„ charclass_invlists.h(949.68 KB)
ðŸ“„ config.h(163.48 KB)
ðŸ“„ cop.h(38.61 KB)
ðŸ“„ cv.h(11.76 KB)
ðŸ“„ dosish.h(5.37 KB)
ðŸ“„ dquote_inline.h(1.8 KB)
ðŸ“„ ebcdic_tables.h(29.16 KB)
ðŸ“„ embed.h(95.07 KB)
ðŸ“„ embedvar.h(18.47 KB)
ðŸ“„ fakesdio.h(3.14 KB)
ðŸ“„ feature.h(4.8 KB)
ðŸ“„ form.h(1.43 KB)
ðŸ“„ git_version.h(357 B)
ðŸ“„ gv.h(10.46 KB)
ðŸ“„ handy.h(120.46 KB)
ðŸ“„ hv.h(24.97 KB)
ðŸ“„ hv_func.h(13.1 KB)
ðŸ“„ inline.h(45.39 KB)
ðŸ“„ intrpvar.h(28.79 KB)
ðŸ“„ invlist_inline.h(2.69 KB)
ðŸ“„ iperlsys.h(47.66 KB)
ðŸ“„ keywords.h(6.43 KB)
ðŸ“„ l1_char_class_tab.h(123.94 KB)
ðŸ“„ libperl.so(2.08 MB)
ðŸ“„ malloc_ctl.h(1.48 KB)
ðŸ“„ metaconfig.h(674 B)
ðŸ“„ mg.h(2.94 KB)
ðŸ“„ mg_data.h(4.81 KB)
ðŸ“„ mg_raw.h(4.16 KB)
ðŸ“„ mg_vtable.h(9.12 KB)
ðŸ“„ mydtrace.h(1.65 KB)
ðŸ“„ nostdio.h(3.31 KB)
ðŸ“„ op.h(35.57 KB)
ðŸ“„ op_reg_common.h(5.77 KB)
ðŸ“„ opcode.h(89.73 KB)
ðŸ“„ opnames.h(8.63 KB)
ðŸ“„ overload.h(3.2 KB)
ðŸ“„ pad.h(16.84 KB)
ðŸ“„ parser.h(6.75 KB)
ðŸ“„ patchlevel.h(9.67 KB)
ðŸ“„ perl.h(237.54 KB)
ðŸ“„ perlapi.h(5.73 KB)
ðŸ“„ perldtrace.h(3.22 KB)
ðŸ“„ perlio.h(9.24 KB)
ðŸ“„ perliol.h(13.44 KB)
ðŸ“„ perlsdio.h(527 B)
ðŸ“„ perlvars.h(9.46 KB)
ðŸ“„ perly.h(4.27 KB)
ðŸ“„ pp.h(26.93 KB)
ðŸ“„ pp_proto.h(11.8 KB)
ðŸ“„ proto.h(240.98 KB)
ðŸ“„ reentr.h(76.44 KB)
ðŸ“„ regcharclass.h(141.19 KB)
ðŸ“„ regcomp.h(46.68 KB)
ðŸ“„ regexp.h(33.57 KB)
ðŸ“„ regnodes.h(34.99 KB)
ðŸ“„ scope.h(11.63 KB)
ðŸ“„ sv.h(82.28 KB)
ðŸ“„ thread.h(11.73 KB)
ðŸ“„ time64.h(1.54 KB)
ðŸ“„ time64_config.h(1.98 KB)
ðŸ“„ uconfig.h(163.21 KB)
ðŸ“„ unicode_constants.h(7.8 KB)
ðŸ“„ unixish.h(4.99 KB)
ðŸ“„ utf8.h(57.73 KB)
ðŸ“„ utfebcdic.h(65.72 KB)
ðŸ“„ util.h(9.38 KB)
ðŸ“„ uudmap.h(904 B)
ðŸ“„ vutil.h(7.29 KB)
ðŸ“„ warnings.h(7.63 KB)

Editing: invlist_inline.h

/*    invlist_inline.h
 *
 *    Copyright (C) 2012 by Larry Wall and others
 *
 *    You may distribute under the terms of either the GNU General Public
 *    License or the Artistic License, as specified in the README file.
 */

#if defined(PERL_IN_UTF8_C) || defined(PERL_IN_REGCOMP_C) || defined(PERL_IN_REGEXEC_C)

/* An element is in an inversion list iff its index is even numbered: 0, 2, 4,
 * etc */
#define ELEMENT_RANGE_MATCHES_INVLIST(i) (! ((i) & 1))
#define PREV_RANGE_MATCHES_INVLIST(i) (! ELEMENT_RANGE_MATCHES_INVLIST(i))

/* This converts to/from our UVs to what the SV code is expecting: bytes. */
#define TO_INTERNAL_SIZE(x) ((x) * sizeof(UV))
#define FROM_INTERNAL_SIZE(x) ((x)/ sizeof(UV))

PERL_STATIC_INLINE bool*
S_get_invlist_offset_addr(SV* invlist)
{
    /* Return the address of the field that says whether the inversion list is
     * offset (it contains 1) or not (contains 0) */
    PERL_ARGS_ASSERT_GET_INVLIST_OFFSET_ADDR;

assert(SvTYPE(invlist) == SVt_INVLIST);

return &(((XINVLIST*) SvANY(invlist))->is_offset);
}

PERL_STATIC_INLINE UV
S__invlist_len(SV* const invlist)
{
    /* Returns the current number of elements stored in the inversion list's
     * array */

PERL_ARGS_ASSERT__INVLIST_LEN;

assert(SvTYPE(invlist) == SVt_INVLIST);

return (SvCUR(invlist) == 0)
           ? 0
           : FROM_INTERNAL_SIZE(SvCUR(invlist)) - *get_invlist_offset_addr(invlist);
}

PERL_STATIC_INLINE bool
S__invlist_contains_cp(SV* const invlist, const UV cp)
{
    /* Does <invlist> contain code point <cp> as part of the set? */

IV index = _invlist_search(invlist, cp);

PERL_ARGS_ASSERT__INVLIST_CONTAINS_CP;

return index >= 0 && ELEMENT_RANGE_MATCHES_INVLIST(index);
}

PERL_STATIC_INLINE UV*
S_invlist_array(SV* const invlist)
{
    /* Returns the pointer to the inversion list's array.  Every time the
     * length changes, this needs to be called in case malloc or realloc moved
     * it */

PERL_ARGS_ASSERT_INVLIST_ARRAY;

/* Must not be empty.  If these fail, you probably didn't check for <len>
     * being non-zero before trying to get the array */
    assert(_invlist_len(invlist));

/* The very first element always contains zero, The array begins either
     * there, or if the inversion list is offset, at the element after it.
     * The offset header field determines which; it contains 0 or 1 to indicate
     * how much additionally to add */
    assert(0 == *(SvPVX(invlist)));
    return ((UV *) SvPVX(invlist) + *get_invlist_offset_addr(invlist));
}

#   if defined(PERL_IN_UTF8_C) || defined(PERL_IN_REGEXEC_C)

/* These symbols are only needed later in regcomp.c */
#       undef TO_INTERNAL_SIZE
#       undef FROM_INTERNAL_SIZE
#   endif

#endif

X7ROOT File Manager

Editing: invlist_inline.h

Upload File

Create Folder