Revonzy Mini Shell

a

X�Zg��	@s@
dZd
Z
ee
�
Zee
�
Ze
dZiZddlZe��r<e�Z	nddhZ	dd�Z
d	d
�Zddd
�
Zddd�
Z
z ddlZe
ZeZe�ej�
ZWney�


�Yn0zddlmZ
Wney�


�Yn0zddlmZ
Wney�


�Yn0e
D]@Zzee�
e�e<Wq�e�
y,


ddlZe�de�
Yq�0q�[
[[[[
[dS)a3hashlib module - A common interface to many hash functions.

new(name, data=b'', **kwargs) - returns a new hash object implementing the
                                given hash function; initializing the hash
                                using the given binary data.

Named constructor functions are also available, these are faster
than using new(name):

md5(), sha1(), sha224(), sha256(), sha384(), sha512(), blake2b(), blake2s(),
sha3_224, sha3_256, sha3_384, sha3_512, shake_128, and shake_256.

More algorithms may be available on your platform but the above are guaranteed
to exist.  See the algorithms_guaranteed and algorithms_available attributes
to find out what algorithm names can be passed to new().

NOTE: If you want the adler32 or crc32 hash functions they are available in
the zlib module.

Choose your hash function wisely.  Some have known collision weaknesses.
sha384 and sha512 will be slow on 32 bit platforms.

Hash objects have these methods:
 - update(data): Update the hash object with the bytes in data. Repeated calls
                 are equivalent to a single call with the concatenation of all
                 the arguments.
 - digest():     Return the digest of the bytes passed to the update() method
                 so far as a bytes object.
 - hexdigest():  Like digest() except the digest is returned as a string
                 of double length, containing only hexadecimal digits.
 - copy():       Return a copy (clone) of the hash object. This can be used to
                 efficiently compute the digests of datas that share a common
                 initial substring.

For example, to obtain the digest of the byte string 'Nobody inspects the
spammish repetition':

    >>> import hashlib
    >>> m = hashlib.md5()
    >>> m.update(b"Nobody inspects")
    >>> m.update(b" the spammish repetition")
    >>> m.digest()
    b'\xbbd\x9c\x83\xdd\x1e\xa5\xc9\xd9\xde\xc9\xa1\x8d\xf0\xff\xe9'

More condensed:

    >>> hashlib.sha224(b"Nobody inspects the spammish repetition").hexdigest()
    'a4337bc45a8fc544c03f52dc550cd6e1e87021bc896588bd79e901e2'

)�md5�sha1�sha224�sha256�sha384�sha512�blake2b�blake2s�sha3_224�sha3_256�sha3_384�sha3_512�	shake_128�	shake_256)�new�algorithms_guaranteed�algorithms_available�pbkdf2_hmac�Nrrc
	Cs�
t�
�rtd
|d�
�
t}
|
�|�
}|du
r2|S�
zD|dvr\ddl}|j|
d<|
d<�
n|dvr�ddl}|j|
d<|
d	<n�|d
vr�ddl	}|j
|
d<|
d<|j|
d
<|
d<n�|dvr�ddl}|j
|
d<|
d<|j|
d<|
d<n�|dv�
rddl}|j|
d<|j|
d<nb|dv�
rPddl}|j|
d<|j|
d<|j|
d<|j|
d<n&|dv�
rvddl}|j|
d<|j|
d<Wnt�
y�


Yn0|
�|�
}|du
�
r�|Std
|�
�
dS)Nzunsupported hash type z(in FIPS mode)>�SHA1rrrr>�MD5r
rr
>rr�SHA256�SHA224rrrr>r�SHA384r�SHA512rrrr>rrrr>rrr
r	r	r
rr>rr
r
r)�_hashlib�
get_fips_mode�
ValueError�__builtin_constructor_cache�get�_sha1r�_md5r
�_sha256rr�_sha512rr�_blake2rr�_sha3r	r
rrr
r�ImportError)	�name�cache�constructorrr r!r"r#r$�r)�/usr/lib64/python3.9/hashlib.py�__get_builtin_constructorTsR

















































r+c
	CsR|tvrt
|�
Szttd
|�}
|
dd�

|
WSttfyL


t
|�
YS0dS)NZopenssl_F)
�usedforsecurity)�__block_openssl_constructorr+�getattrr�AttributeErrorr)r&�
fr)r)r*�__get_openssl_constructor�s




r1�cKst|�
|
f
i|�
�
S)
z�new(name, data=b'', **kwargs) - Return a new hashing object using the
    named algorithm; optionally initialized with data (which must be
    a bytes-like object).
    )
r+�r&�data�kwargsr)r)r*�__py_new�sr6cKsV|tvrt
|�
|
f
i|�
�
Sztj||
fi|�
�
WStyP


t
|�
|
�
YS0d
S)z�new(name, data=b'') - Return a new hashing object using the named algorithm;
    optionally initialized with data (which must be a bytes-like object).
    N)r-r+rrrr3r)r)r*�
__hash_new�s


r7)
r)
�scryptzcode for hash %s was not found.)
r2)
r2)�__doc__Z__always_supported�setrr�__all__rrrr-r+r1r6r7rZ
__get_hash�union�openssl_md_meth_namesr%rr8Z__func_name�globalsr�logging�	exceptionr)r)r)r*�<module>sL5


.






�