[EDIT] FILE: pickletools.cpython-312.opt-1.pyc
� �{|jdo � �� � d Z ddlZddlZddlZddlZddlZg d�Zej ZdZdZ dZ dZ dZ G d � d e � Zdd lmZ d � Z ed ded�� Zd� Z edded�� Zd� Z edded�� Zd� Z edded�� Zd � Z ed d ed �� Z�d�d d!�d"�Z ed#ee d$�� Z d%� Z ed&ee d'�� Z d(� Z ed)ee d*�� Z!d+� Z" ed,e e"d-�� Z#d.� Z$ ed/e e$d0�� Z%d1� Z& ed2e e&d3�� Z'd4� Z( ed5e e(d6�� Z)d7� Z* ed8e e*d9�� Z+d:� Z, ed;e e,d<�� Z-d=� Z. ed>ee.d?�� Z/d@� Z0 edAe e0dB�� Z1dC� Z2 edDe e2dE�� Z3dF� Z4 edGe e4dH�� Z5dI� Z6dJ� Z7 edKee6dL�� Z8 edMee7dN�� Z9dO� Z: edPee:dQ�� Z;dR� Z< edSd e<dT�� Z=ddUlm>Z> dV� Z? edWe e?dX�� Z@dY� ZA edZe eAd[�� ZB G d\� d]e � ZC eCd^eDd_�`� xZEZF eCdaeDeGfdb�`� ZH eCdceGdd�`� ZI eCdeeJdf�`� ZK eCdgeLeMfdh�`� xZNZO eCdieLdj�`� ZP eCdkeQdl�`� ZR eCdmeMdn�`� ZS eCdo eTd� dp�`� ZU eCdqeVdr�`� ZW eCdseXdt�`� ZY eCdueZdv�`� Z[ eCdwe\dx�`� Z] eCdye\dz�`� Z^ eCd{e d|�`� Z_ eCd}e d~�`� Z` eCdeCd��`� Za eCd�eCd��`� Zb G d�� d�e � ZcecZdg edd�d�e8g eHgdd���� � edd�d�eg eEgdd���� � edd�d�eg eEgdd���� � edd�d�eg eEgdd���� � edd�d�e9g eEgdd���� � edd�d�e@g eEgdd���� � edd�d�eBg eEgdd���� � edd�d�e g eNgdd���� � edd�d�e%g eNgdd���� � edd�d�e#g eNgdd���� � edd�d�e)g ePgd�d���� � edd�d�e'g ePgd�d���� � edd�d�e+g ePgdd���� � edd�d�e-g eRgd�d���� � edd�d�dg e_gd�d���� � edd�d�de_ge_gd�d���� � edd�d�dg eUgdd���� � edd�d�dg eIgdd���� � edd�d�dg eIgdd���� � edd�d�e/g eSgddì�� � edd�d�e1g eSgddƬ�� � edd�d�e3g eSgddɬ�� � edd�d�e5g eSgdd̬�� � edd�d�e;g eKgddϬ�� � edd�d�e=g eKgddҬ�� � edd�d�dg eYgddլ�� � edd�d�deYe`geYgddج�� � edd�d�deYeaebgeYgdd۬�� � edd�d�deaebgeYgddެ�� � edd�d�dg eWgddᬈ� � edd�d�deaebgeWgdd䬈� � edd�d�de`geWgdd笈� � edd�d�de`e`geWgdd� � edd�d�de`e`e`geWgdd�� � edd�d�dg e[gdd𬈫 � edd�d�deaebge[gdd � edd�d�de[e`e`ge[gdd���� � edd�d�de[eaebge[gdd���� � edd�d�dg e]gdd���� � edd�d�de]eaebge]gdd���� � ed�d �ddeaebge^gd�d��� � ed�d�dde`gg d�d��� � ed�d�dde`ge`e`gd�d��� � ed�d �d dg eagd�d ��� � ed�d �d deaebgg d�d��� � ed�d�de8g e`gd�d��� � ed�d�deg e`gd�d��� � ed�d�deg e`gd�d��� � ed�d�de8g g d�d��� � ed�d�d eg g d�d ��� � ed�d �d eg g d�d ��� � ed�d!�d"de`ge`gd�d#��� � ed�d$�d%eg e`gd�d&��� � ed�d'�d(eg e`gd�d)��� � ed�d*�d+eg e`gd�d,��� � ed�d-�d.e!g e`gd�d/��� � ed�d0�d1deSeSge`gd�d2��� � ed�d3�d4de`e`ge`gd�d5��� � ed�d6�d7de`e`ge`gd�d8��� � ed�d9�d:e!eaebge`gd�d;��� � ed�d<�d=deae`ebge`gd�d>��� � ed�d?�d@de`e`ge`gd�dA��� � ed�dB�dCde`e`e`ge`gd�dD��� � ed�dE�dFeg g d�dG��� � ed�dH�dIde`gg d�dJ��� � ed�dK�dLeg g d�dM��� � ed�dN�dOe g e`gd�dP��� � ed�dQ�dRde`ge`gd�dS��� �Ze[di Zfi Zg ehee� D ]� \ ZiZjejj� efv r& el�dTejj� efejj� eifz � �ejj� egv r& el�dUejj� egejj� eifz � �eiefejj� < eiegejj� < �� [f[g[i[ji ZneeD ] Zjejenejj� < � [j�d��dV�Zo eo� [o�d��dW�Zp�dX� Zq�dY� Zr�d��dZ�Zs G �d[� �d\� Zt�d]Zu�d^Zveuev�d_�Zw�d`� Zxey�dak( �rdddlzZz ezj� �db��c� Z|e|j� �dd�de�df��g� e|j� �dh�di�dj��k� e|j� �dl�dm�dn�do��p� e|j� �dq�drdeD�ds��t� e|j� �du�dv�dn�dw��p� e|j� �dx�dy�dz�d{��|� e|j� �d}�d~�dn�d��p� e|j� �d��dn�d���p� e|j� � Ze�j r ex� ye�j se|�j � ye�j r�d�ndZ�e�j ri ndZ�e�j �e�j Z�n e�e�j �d�� Z� e�j D ]� Z� e�e�j � dkD r@e��d�k( r�d�ne�Zke�j �j ek���� Z�e��j e��d�z � e��d�k( r. ese�j �j e�e�e�j e�� �� e�e��d�� 5 Z� ese�e�e�e�j e�� ddd� �� e�e�j ure��j# � yyy# 1 sw Y ��xY w# e�e�j ure��j# � w w xY w(� ar "Executable documentation" for the pickle module. Extensive comments about the pickle protocols and pickle-machine opcodes can be found here. Some functions meant for external use: genops(pickle) Generate all the opcodes in a pickle, as (opcode, arg, position) triples. dis(pickle, out=None, memo=None, indentlevel=4) Print a symbolic disassembly of a pickle. � N)�dis�genops�optimize���������������c � � e Zd ZdZd� Zy)�ArgumentDescriptor��name�n�reader�docc �< � || _ || _ || _ || _ y �Nr )�selfr r r r s �$/usr/lib64/python3.12/pickletools.py�__init__zArgumentDescriptor.__init__� s" � ��� � ��� �� � ��� N��__name__� __module__� __qualname__� __slots__r � r r r r � s � ��I�$r r )�unpackc �H � | j d� }|r|d S t d� �)zG >>> import io >>> read_uint1(io.BytesIO(b'\xff')) 255 � r z'not enough data in stream to read uint1)�read� ValueError��f�datas r � read_uint1r& � s) � � �6�6�!�9�D� ��A�w�� �>� ?�?r �uint1r zOne-byte unsigned integer.r c �t � | j d� }t |� dk( rt d|� d S t d� �)z� >>> import io >>> read_uint2(io.BytesIO(b'\xff\x00')) 255 >>> read_uint2(io.BytesIO(b'\xff\xff')) 65535 � z<Hr z'not enough data in stream to read uint2�r! �len�_unpackr" r# s r � read_uint2r- � �: � � �6�6�!�9�D� �4�y�A�~��t�T�"�1�%�%� �>� ?�?r �uint2r) z)Two-byte unsigned integer, little-endian.c �t � | j d� }t |� dk( rt d|� d S t d� �)z� >>> import io >>> read_int4(io.BytesIO(b'\xff\x00\x00\x00')) 255 >>> read_int4(io.BytesIO(b'\x00\x00\x00\x80')) == -(2**31) True � z<ir z¬ enough data in stream to read int4r* r# s r � read_int4r2 � s: � � �6�6�!�9�D� �4�y�A�~��t�T�"�1�%�%� �=� >�>r �int4r1 z8Four-byte signed integer, little-endian, 2's complement.c �t � | j d� }t |� dk( rt d|� d S t d� �)z� >>> import io >>> read_uint4(io.BytesIO(b'\xff\x00\x00\x00')) 255 >>> read_uint4(io.BytesIO(b'\x00\x00\x00\x80')) == 2**31 True r1 z<Ir z'not enough data in stream to read uint4r* r# s r � read_uint4r5 r. r �uint4z*Four-byte unsigned integer, little-endian.c �t � | j d� }t |� dk( rt d|� d S t d� �)z� >>> import io >>> read_uint8(io.BytesIO(b'\xff\x00\x00\x00\x00\x00\x00\x00')) 255 >>> read_uint8(io.BytesIO(b'\xff' * 8)) == 2**64-1 True � z<Qr z'not enough data in stream to read uint8r* r# s r � read_uint8r9 & r. r �uint8r8 z+Eight-byte unsigned integer, little-endian.�latin-1)�encodingc �\ � | j � }|j d� s t d� �|dd }|rOdD ]< }|j |� s�|j |� st d|�d|��� �|dd } n t d |z � �|r't j |� d j |� }|S ) au >>> import io >>> read_stringnl(io.BytesIO(b"'abcd'\nefg\n")) 'abcd' >>> read_stringnl(io.BytesIO(b"\n")) Traceback (most recent call last): ... ValueError: no string quotes around b'' >>> read_stringnl(io.BytesIO(b"\n"), stripquotes=False) '' >>> read_stringnl(io.BytesIO(b"''\n")) '' >>> read_stringnl(io.BytesIO(b'"abcd"')) Traceback (most recent call last): ... ValueError: no newline found when trying to read stringnl Embedded escapes are undone in the result. >>> read_stringnl(io.BytesIO(br"'a\n\\b\x00c\td'" + b"\n'e'")) 'a\n\\b\x00c\td' � z-no newline found when trying to read stringnlNr )� "� 'z strinq quote z not found at both ends of r zno string quotes around %rr )�readline�endswithr" � startswith�codecs� escape_decode�decode)r$ rF � stripquotesr< r% �qs r � read_stringnlrI ; s� � �6 �:�:�<�D� �=�=�� ��H�I�I� ���9�D�� �A����q�!��}�}�Q�'�$�56��&>� ?� ?��A�b�z��� � � 9�D� @�A� A� ��#�#�D�)�!�,�3�3�H�=�� �Kr �stringnlz�A newline-terminated string. This is a repr-style string, with embedded escapes, and bracketing quotes. c � � t | dd�� S )NF�utf-8)rG r< )rI �r$ s r �read_stringnl_noescaperN t s � � ���� @�@r �stringnl_noescapea A newline-terminated string. This is a str-style string, without embedded escapes, or bracketing quotes. It should consist solely of printable ASCII characters. c �4 � t | � �dt | � ��S )zp >>> import io >>> read_stringnl_noescape_pair(io.BytesIO(b"Queue\nEmpty\njunk")) 'Queue Empty' � )rN rM s r �read_stringnl_noescape_pairrR � s � � -�Q�/�1G��1J� K�Kr �stringnl_noescape_paira� A pair of newline-terminated strings. These are str-style strings, without embedded escapes, or bracketing quotes. They should consist solely of printable ASCII characters. The pair is returned as a single string, with a single blank separating the two strings. c � � t | � }| j |� }t |� |k( r|j d� S t d|t |� fz � �)z� >>> import io >>> read_string1(io.BytesIO(b"\x00")) '' >>> read_string1(io.BytesIO(b"\x03abcdef")) 'abc' r; z2expected %d bytes in a string1, but only %d remain)r& r! r+ rF r" �r$ r r% s r � read_string1rV � sT � � �1� �A� �6�6�!�9�D� �4�y�A�~��{�{�9�%�%� �I���T��^�$� %� %r �string1z�A counted string. The first argument is a 1-byte unsigned int giving the number of bytes in the string, and the second argument is that many bytes. c �� � t | � }|dk rt d|z � �| j |� }t |� |k( r|j d� S t d|t |� fz � �)aP >>> import io >>> read_string4(io.BytesIO(b"\x00\x00\x00\x00abc")) '' >>> read_string4(io.BytesIO(b"\x03\x00\x00\x00abcdef")) 'abc' >>> read_string4(io.BytesIO(b"\x00\x00\x00\x03abcdef")) Traceback (most recent call last): ... ValueError: expected 50331648 bytes in a string4, but only 6 remain r zstring4 byte count < 0: %dr; z2expected %d bytes in a string4, but only %d remain)r2 r" r! r+ rF rU s r � read_string4rY � sl � � �!� �A��1�u��5��9�:�:� �6�6�!�9�D� �4�y�A�~��{�{�9�%�%� �I���T��^�$� %� %r �string4z�A counted string. The first argument is a 4-byte little-endian signed int giving the number of bytes in the string, and the second argument is that many bytes. c � � t | � }| j |� }t |� |k( r|S t d|t |� fz � �)z� >>> import io >>> read_bytes1(io.BytesIO(b"\x00")) b'' >>> read_bytes1(io.BytesIO(b"\x03abcdef")) b'abc' z1expected %d bytes in a bytes1, but only %d remain)r& r! r+ r" rU s r � read_bytes1r\ � sJ � � �1� �A� �6�6�!�9�D� �4�y�A�~�� � �H���T��^�$� %� %r �bytes1z�A counted bytes string. The first argument is a 1-byte unsigned int giving the number of bytes, and the second argument is that many bytes. c �� � t | � }|t j kD rt d|z � �| j |� }t |� |k( r|S t d|t |� fz � �)aN >>> import io >>> read_bytes4(io.BytesIO(b"\x00\x00\x00\x00abc")) b'' >>> read_bytes4(io.BytesIO(b"\x03\x00\x00\x00abcdef")) b'abc' >>> read_bytes4(io.BytesIO(b"\x00\x00\x00\x03abcdef")) Traceback (most recent call last): ... ValueError: expected 50331648 bytes in a bytes4, but only 6 remain z#bytes4 byte count > sys.maxsize: %dz1expected %d bytes in a bytes4, but only %d remain)r5 �sys�maxsizer" r! r+ rU s r � read_bytes4ra � sf � � �1� �A��3�;�;���>��B�C�C� �6�6�!�9�D� �4�y�A�~�� � �H���T��^�$� %� %r �bytes4z�A counted bytes string. The first argument is a 4-byte little-endian unsigned int giving the number of bytes, and the second argument is that many bytes. c �� � t | � }|t j kD rt d|z � �| j |� }t |� |k( r|S t d|t |� fz � �)a� >>> import io, struct, sys >>> read_bytes8(io.BytesIO(b"\x00\x00\x00\x00\x00\x00\x00\x00abc")) b'' >>> read_bytes8(io.BytesIO(b"\x03\x00\x00\x00\x00\x00\x00\x00abcdef")) b'abc' >>> bigsize8 = struct.pack("<Q", sys.maxsize//3) >>> read_bytes8(io.BytesIO(bigsize8 + b"abcdef")) #doctest: +ELLIPSIS Traceback (most recent call last): ... ValueError: expected ... bytes in a bytes8, but only 6 remain z#bytes8 byte count > sys.maxsize: %dz1expected %d bytes in a bytes8, but only %d remain)r9 r_ r` r" r! r+ rU s r � read_bytes8rd sf � � �1� �A��3�;�;���>��B�C�C� �6�6�!�9�D� �4�y�A�~�� � �H���T��^�$� %� %r �bytes8z�A counted bytes string. The first argument is an 8-byte little-endian unsigned int giving the number of bytes, and the second argument is that many bytes. c �� � t | � }|t j kD rt d|z � �| j |� }t |� |k( r t |� S t d|t |� fz � �)a� >>> import io, struct, sys >>> read_bytearray8(io.BytesIO(b"\x00\x00\x00\x00\x00\x00\x00\x00abc")) bytearray(b'') >>> read_bytearray8(io.BytesIO(b"\x03\x00\x00\x00\x00\x00\x00\x00abcdef")) bytearray(b'abc') >>> bigsize8 = struct.pack("<Q", sys.maxsize//3) >>> read_bytearray8(io.BytesIO(bigsize8 + b"abcdef")) #doctest: +ELLIPSIS Traceback (most recent call last): ... ValueError: expected ... bytes in a bytearray8, but only 6 remain z'bytearray8 byte count > sys.maxsize: %dz5expected %d bytes in a bytearray8, but only %d remain)r9 r_ r` r" r! r+ � bytearrayrU s r �read_bytearray8rh 9 sk � � �1� �A��3�;�;���B�Q�F�G�G� �6�6�!�9�D� �4�y�A�~���� � �L���T��^�$� %� %r � bytearray8z�A counted bytearray. The first argument is an 8-byte little-endian unsigned int giving the number of bytes, and the second argument is that many bytes. c �| � | j � }|j d� s t d� �|dd }t |d� S )zm >>> import io >>> read_unicodestringnl(io.BytesIO(b"abc\\uabcd\njunk")) == 'abc\uabcd' True r> z4no newline found when trying to read unicodestringnlNr zraw-unicode-escape)rA rB r" �strr# s r �read_unicodestringnlrl [ sF � � �:�:�<�D� �=�=�� �� +� ,� ,� ���9�D� �t�)� *�*r �unicodestringnlz�A newline-terminated Unicode string. This is raw-unicode-escape encoded, so consists of printable ASCII characters, and may contain embedded escape sequences. c � � t | � }| j |� }t |� |k( r t |dd� S t d|t |� fz � �)a� >>> import io >>> s = 'abcd\uabcd' >>> enc = s.encode('utf-8') >>> enc b'abcd\xea\xaf\x8d' >>> n = bytes([len(enc)]) # little-endian 1-byte length >>> t = read_unicodestring1(io.BytesIO(n + enc + b'junk')) >>> s == t True >>> read_unicodestring1(io.BytesIO(n + enc[:-1])) Traceback (most recent call last): ... ValueError: expected 7 bytes in a unicodestring1, but only 6 remain rL � surrogatepassz9expected %d bytes in a unicodestring1, but only %d remain)r& r! r+ rk r" rU s r �read_unicodestring1rp u sV � �$ �1� �A� �6�6�!�9�D� �4�y�A�~��4��/�2�2� � �!"�C��I��/� 0� 0r �unicodestring1aA A counted Unicode string. The first argument is a 1-byte little-endian signed int giving the number of bytes in the string, and the second argument-- the UTF-8 encoding of the Unicode string -- contains that many bytes. c �� � t | � }|t j kD rt d|z � �| j |� }t |� |k( r t |dd� S t d|t |� fz � �)a� >>> import io >>> s = 'abcd\uabcd' >>> enc = s.encode('utf-8') >>> enc b'abcd\xea\xaf\x8d' >>> n = bytes([len(enc), 0, 0, 0]) # little-endian 4-byte length >>> t = read_unicodestring4(io.BytesIO(n + enc + b'junk')) >>> s == t True >>> read_unicodestring4(io.BytesIO(n + enc[:-1])) Traceback (most recent call last): ... ValueError: expected 7 bytes in a unicodestring4, but only 6 remain z+unicodestring4 byte count > sys.maxsize: %drL ro z9expected %d bytes in a unicodestring4, but only %d remain)r5 r_ r` r" r! r+ rk rU s r �read_unicodestring4rs � �r � �$ �1� �A��3�;�;���F��J�K�K� �6�6�!�9�D� �4�y�A�~��4��/�2�2� � �!"�C��I��/� 0� 0r �unicodestring4aA A counted Unicode string. The first argument is a 4-byte little-endian signed int giving the number of bytes in the string, and the second argument-- the UTF-8 encoding of the Unicode string -- contains that many bytes. c �� � t | � }|t j kD rt d|z � �| j |� }t |� |k( r t |dd� S t d|t |� fz � �)a� >>> import io >>> s = 'abcd\uabcd' >>> enc = s.encode('utf-8') >>> enc b'abcd\xea\xaf\x8d' >>> n = bytes([len(enc)]) + b'\0' * 7 # little-endian 8-byte length >>> t = read_unicodestring8(io.BytesIO(n + enc + b'junk')) >>> s == t True >>> read_unicodestring8(io.BytesIO(n + enc[:-1])) Traceback (most recent call last): ... ValueError: expected 7 bytes in a unicodestring8, but only 6 remain z+unicodestring8 byte count > sys.maxsize: %drL ro z9expected %d bytes in a unicodestring8, but only %d remain)r9 r_ r` r" r! r+ rk rU s r �read_unicodestring8rw � rt r �unicodestring8aB A counted Unicode string. The first argument is an 8-byte little-endian signed int giving the number of bytes in the string, and the second argument-- the UTF-8 encoding of the Unicode string -- contains that many bytes. c �L � t | dd�� }|dk( ry|dk( ryt |� S )z� >>> import io >>> read_decimalnl_short(io.BytesIO(b"1234\n56")) 1234 >>> read_decimalnl_short(io.BytesIO(b"1234L\n56")) Traceback (most recent call last): ... ValueError: invalid literal for int() with base 10: b'1234L' F�rF rG s 00s 01T�rI �int�r$ �ss r �read_decimalnl_shortr � s1 � � �a��5�9�A� �E�z�� �e��� �q�6�Mr c �N � t | dd�� }|dd dk( r|dd }t |� S )z� >>> import io >>> read_decimalnl_long(io.BytesIO(b"1234L\n56")) 1234 >>> read_decimalnl_long(io.BytesIO(b"123456789012345678901234L\n6")) 123456789012345678901234 Frz r N� Lr{ r} s r �read_decimalnl_longr� s3 � � �a��5�9�A����v��~� �c�r�F�� �q�6�Mr �decimalnl_shorta� A newline-terminated decimal integer literal. This never has a trailing 'L', and the integer fit in a short Python int on the box where the pickle was written -- but there's no guarantee it will fit in a short Python int on the box where the pickle is read. �decimalnl_longz�A newline-terminated decimal integer literal. This has a trailing 'L', and can represent integers of any size. c �4 � t | dd�� }t |� S )zO >>> import io >>> read_floatnl(io.BytesIO(b"-1.25\n6")) -1.25 Frz )rI �floatr} s r � read_floatnlr� - s � � �a��5�9�A� ��8�Or �floatnla� A newline-terminated decimal floating literal. In general this requires 17 significant digits for roundtrip identity, and pickling then unpickling infinities, NaNs, and minus zero doesn't work across boxes, or on some boxes even on itself (e.g., Windows can't read the strings it produces for infinities or NaNs). c �t � | j d� }t |� dk( rt d|� d S t d� �)z� >>> import io, struct >>> raw = struct.pack(">d", -1.25) >>> raw b'\xbf\xf4\x00\x00\x00\x00\x00\x00' >>> read_float8(io.BytesIO(raw + b"\n")) -1.25 r8 z>dr z(not enough data in stream to read float8r* r# s r � read_float8r� C s: � � �6�6�!�9�D� �4�y�A�~��t�T�"�1�%�%� �?� @�@r �float8a An 8-byte binary representation of a float, big-endian. The format is unique to Python, and shared with the struct module (format string '>d') "in theory" (the struct and pickle implementations don't share the code -- they should). It's strongly related to the IEEE-754 double format, and, in normal cases, is in fact identical to the big-endian 754 double format. On other boxes the dynamic range is limited to that of a 754 double, and "add a half and chop" rounding is used to reduce the precision to 53 bits. However, even on a 754 box, infinities, NaNs, and minus zero may not be handled correctly (may not survive roundtrip pickling intact). )� decode_longc � � t | � }| j |� }t |� |k7 r t d� �t |� S )a+ >>> import io >>> read_long1(io.BytesIO(b"\x00")) 0 >>> read_long1(io.BytesIO(b"\x02\xff\x00")) 255 >>> read_long1(io.BytesIO(b"\x02\xff\x7f")) 32767 >>> read_long1(io.BytesIO(b"\x02\x00\xff")) -256 >>> read_long1(io.BytesIO(b"\x02\x00\x80")) -32768 z'not enough data in stream to read long1)r& r! r+ r" r� rU s r � read_long1r� i s< � � �1� �A� �6�6�!�9�D� �4�y�A�~��B�C�C� �t� � r �long1a A binary long, little-endian, using 1-byte size. This first reads one byte as an unsigned size, then reads that many bytes and interprets them as a little-endian 2's-complement long. If the size is 0, that's taken as a shortcut for the long 0L. c � � t | � }|dk rt d|z � �| j |� }t |� |k7 r t d� �t |� S )ag >>> import io >>> read_long4(io.BytesIO(b"\x02\x00\x00\x00\xff\x00")) 255 >>> read_long4(io.BytesIO(b"\x02\x00\x00\x00\xff\x7f")) 32767 >>> read_long4(io.BytesIO(b"\x02\x00\x00\x00\x00\xff")) -256 >>> read_long4(io.BytesIO(b"\x02\x00\x00\x00\x00\x80")) -32768 >>> read_long1(io.BytesIO(b"\x00\x00\x00\x00")) 0 r zlong4 byte count < 0: %dz'not enough data in stream to read long4)r2 r" r! r+ r� rU s r � read_long4r� � sT � � �!� �A��1�u��3�a�7�8�8� �6�6�!�9�D� �4�y�A�~��B�C�C� �t� � r �long4a� A binary representation of a long, little-endian. This first reads four bytes as a signed size (but requires the size to be >= 0), then reads that many bytes and interprets them as a little-endian 2's-complement long. If the size is 0, that's taken as a shortcut for the int 0, although LONG1 should really be used then instead (and in any case where # of bytes < 256). c � � e Zd ZdZd� Zd� Zy)� StackObject�r �obtyper c �\ � || _ t |t � r|D ] }� || _ || _ y r )r � isinstance�tupler� r )r r r� r � containeds r r zStackObject.__init__� s, � ��� � �f�e� $� #� �V� �� � ��r c � � | j S r �r )r s r �__repr__zStackObject.__repr__� s � ��y�y�r N)r r r r r r� r r r r� r� � s � � �I� �r r� r| zA Python integer object.r� � int_or_boolz#A Python integer or boolean object.�boolzA Python boolean object.r� zA Python float object.� bytes_or_strz*A Python bytes or (Unicode) string object.�byteszA Python bytes object.rg zA Python bytearray object.rk z!A Python (Unicode) string object.�NonezThe Python None object.r� zA Python tuple object.�listzA Python list object.�dictzA Python dict object.�setzA Python set object.� frozensetzA Python frozenset object.�bufferz A Python buffer-like object.�anyz Any kind of object whatsoever.�markaz 'The mark' is a unique object. Opcodes that operate on a variable number of objects generally don't embed the count of objects in the opcode, or pull it off the stack. Instead the MARK opcode is used to push a special marker object on the stack, and then some other opcodes grab all the objects from the top of the stack down to (but not including) the topmost marker object. � stackslicea� An object representing a contiguous slice of the stack. This is used in conjunction with markobject, to represent all of the stack following the topmost markobject. For example, the POP_MARK opcode changes the stack from [..., markobject, stackslice] to [...] No matter how many object are on the stack after the topmost markobject, POP_MARK gets rid of all of them (including the topmost markobject too). c � � e Zd ZdZd� Zy)� OpcodeInfo�r �code�arg� stack_before� stack_after�protor c � � || _ || _ || _ |D ] }� || _ |D ] }� || _ || _ || _ y r r� ) r r r� r� r� r� r� r �xs r r zOpcodeInfo.__init__d sQ � � �� � �� � ��� �A� � (��� �A��&��� �� � ��r Nr r r r r� r� E s � ��I�:r r� �INT�Ia� Push an integer or bool. The argument is a newline-terminated decimal literal string. The intent may have been that this always fit in a short Python int, but INT can be generated in pickles written on a 64-bit box that require a Python long on a 32-bit box. The difference between this and LONG then is that INT skips a trailing 'L', and produces a short int whenever possible. Another difference is due to that, when bool was introduced as a distinct type in 2.3, builtin names True and False were also added to 2.2.2, mapping to ints 1 and 0. For compatibility in both directions, True gets pickled as INT + "I01\n", and False as INT + "I00\n". Leading zeroes are never produced for a genuine integer. The 2.3 (and later) unpicklers special-case these and return bool instead; earlier unpicklers ignore the leading "0" and return the int. r� �BININT�Ja1 Push a four-byte signed integer. This handles the full range of Python (short) integers on a 32-bit box, directly as binary bytes (1 for the opcode and 4 for the integer). If the integer is non-negative and fits in 1 or 2 bytes, pickling via BININT1 or BININT2 saves space. �BININT1�Kz�Push a one-byte unsigned integer. This is a space optimization for pickling very small non-negative ints, in range(256). �BININT2�Mz�Push a two-byte unsigned integer. This is a space optimization for pickling small positive ints, in range(256, 2**16). Integers in range(256) can also be pickled via BININT2, but BININT1 instead saves a byte. �LONG�La� Push a long integer. The same as INT, except that the literal ends with 'L', and always unpickles to a Python long. There doesn't seem a real purpose to the trailing 'L'. Note that LONG takes time quadratic in the number of digits when unpickling (this is simply due to the nature of decimal->binary conversion). Proto 2 added linear-time (in C; still quadratic-time in Python) LONG1 and LONG4 opcodes. �LONG1� z|Long integer using one-byte length. A more efficient encoding of a Python long; the long1 encoding says it all.�LONG4� z}Long integer using four-byte length. A more efficient encoding of a Python long; the long4 encoding says it all.�STRING�Sa� Push a Python string object. The argument is a repr-style string, with bracketing quote characters, and perhaps embedded escapes. The argument extends until the next newline character. These are usually decoded into a str instance using the encoding given to the Unpickler constructor. or the default, 'ASCII'. If the encoding given was 'bytes' however, they will be decoded as bytes object instead. � BINSTRING�Ta� Push a Python string object. There are two arguments: the first is a 4-byte little-endian signed int giving the number of bytes in the string, and the second is that many bytes, which are taken literally as the string content. These are usually decoded into a str instance using the encoding given to the Unpickler constructor. or the default, 'ASCII'. If the encoding given was 'bytes' however, they will be decoded as bytes object instead. �SHORT_BINSTRING�Ua� Push a Python string object. There are two arguments: the first is a 1-byte unsigned int giving the number of bytes in the string, and the second is that many bytes, which are taken literally as the string content. These are usually decoded into a str instance using the encoding given to the Unpickler constructor. or the default, 'ASCII'. If the encoding given was 'bytes' however, they will be decoded as bytes object instead. �BINBYTES�B� z�Push a Python bytes object. There are two arguments: the first is a 4-byte little-endian unsigned int giving the number of bytes, and the second is that many bytes, which are taken literally as the bytes content. �SHORT_BINBYTES�Cz�Push a Python bytes object. There are two arguments: the first is a 1-byte unsigned int giving the number of bytes, and the second is that many bytes, which are taken literally as the string content. � BINBYTES8� z�Push a Python bytes object. There are two arguments: the first is an 8-byte unsigned int giving the number of bytes in the string, and the second is that many bytes, which are taken literally as the string content. � BYTEARRAY8� � z�Push a Python bytearray object. There are two arguments: the first is an 8-byte unsigned int giving the number of bytes in the bytearray, and the second is that many bytes, which are taken literally as the bytearray content. � NEXT_BUFFER� z"Push an out-of-band buffer object.�READONLY_BUFFER� z,Make an out-of-band buffer object read-only.�NONE�NzPush None on the stack.�NEWTRUE� zPush True onto the stack.�NEWFALSE� zPush False onto the stack.�UNICODE�Vz�Push a Python Unicode string object. The argument is a raw-unicode-escape encoding of a Unicode string, and so may contain embedded escape sequences. The argument extends until the next newline character. �SHORT_BINUNICODE� a Push a Python Unicode string object. There are two arguments: the first is a 1-byte little-endian signed int giving the number of bytes in the string. The second is that many bytes, and is the UTF-8 encoding of the Unicode string. � BINUNICODE�Xa Push a Python Unicode string object. There are two arguments: the first is a 4-byte little-endian unsigned int giving the number of bytes in the string. The second is that many bytes, and is the UTF-8 encoding of the Unicode string. � BINUNICODE8� a Push a Python Unicode string object. There are two arguments: the first is an 8-byte little-endian signed int giving the number of bytes in the string. The second is that many bytes, and is the UTF-8 encoding of the Unicode string. �FLOAT�Fa� Newline-terminated decimal float literal. The argument is repr(a_float), and in general requires 17 significant digits for roundtrip conversion to be an identity (this is so for IEEE-754 double precision values, which is what Python float maps to on most boxes). In general, FLOAT cannot be used to transport infinities, NaNs, or minus zero across boxes (or even on a single box, if the platform C library can't read the strings it produces for such things -- Windows is like that), but may do less damage than BINFLOAT on boxes with greater precision or dynamic range than IEEE-754 double. �BINFLOAT�Ga� Float stored in binary form, with 8 bytes of data. This generally requires less than half the space of FLOAT encoding. In general, BINFLOAT cannot be used to transport infinities, NaNs, or minus zero, raises an exception if the exponent exceeds the range of an IEEE-754 double, and retains no more than 53 bits of precision (if there are more than that, "add a half and chop" rounding is used to cut it back to 53 significant bits). � EMPTY_LIST�]zPush an empty list.�APPEND�az�Append an object to a list. Stack before: ... pylist anyobject Stack after: ... pylist+[anyobject] although pylist is really extended in-place. �APPENDS�ez�Extend a list by a slice of stack objects. Stack before: ... pylist markobject stackslice Stack after: ... pylist+stackslice although pylist is really extended in-place. �LIST�las Build a list out of the topmost stack slice, after markobject. All the stack entries following the topmost markobject are placed into a single Python list, which single list object replaces all of the stack from the topmost markobject onward. For example, Stack before: ... markobject 1 2 3 'abc' Stack after: ... [1, 2, 3, 'abc'] � EMPTY_TUPLE�)zPush an empty tuple.�TUPLE�tav Build a tuple out of the topmost stack slice, after markobject. All the stack entries following the topmost markobject are placed into a single Python tuple, which single tuple object replaces all of the stack from the topmost markobject onward. For example, Stack before: ... markobject 1 2 3 'abc' Stack after: ... (1, 2, 3, 'abc') �TUPLE1� z�Build a one-tuple out of the topmost item on the stack. This code pops one value off the stack and pushes a tuple of length 1 whose one item is that value back onto it. In other words: stack[-1] = tuple(stack[-1:]) �TUPLE2� a Build a two-tuple out of the top two items on the stack. This code pops two values off the stack and pushes a tuple of length 2 whose items are those values back onto it. In other words: stack[-2:] = [tuple(stack[-2:])] �TUPLE3� a Build a three-tuple out of the top three items on the stack. This code pops three values off the stack and pushes a tuple of length 3 whose items are those values back onto it. In other words: stack[-3:] = [tuple(stack[-3:])] � EMPTY_DICT�}zPush an empty dict.�DICT�da� Build a dict out of the topmost stack slice, after markobject. All the stack entries following the topmost markobject are placed into a single Python dict, which single dict object replaces all of the stack from the topmost markobject onward. The stack slice alternates key, value, key, value, .... For example, Stack before: ... markobject 1 2 3 'abc' Stack after: ... {1: 2, 3: 'abc'} �SETITEMr~ z�Add a key+value pair to an existing dict. Stack before: ... pydict key value Stack after: ... pydict where pydict has been modified via pydict[key] = value. �SETITEMS�ua\ Add an arbitrary number of key+value pairs to an existing dict. The slice of the stack following the topmost markobject is taken as an alternating sequence of keys and values, added to the dict immediately under the topmost markobject. Everything at and after the topmost markobject is popped, leaving the mutated dict at the top of the stack. Stack before: ... pydict markobject key_1 value_1 ... key_n value_n Stack after: ... pydict where pydict has been modified via pydict[key_i] = value_i for i in 1, 2, ..., n, and in that order. � EMPTY_SET� zPush an empty set.�ADDITEMS� a$ Add an arbitrary number of items to an existing set. The slice of the stack following the topmost markobject is taken as a sequence of items, added to the set immediately under the topmost markobject. Everything at and after the topmost markobject is popped, leaving the mutated set at the top of the stack. Stack before: ... pyset markobject item_1 ... item_n Stack after: ... pyset where pyset has been modified via pyset.add(item_i) = item_i for i in 1, 2, ..., n, and in that order. � FROZENSET� az Build a frozenset out of the topmost slice, after markobject. All the stack entries following the topmost markobject are placed into a single Python frozenset, which single frozenset object replaces all of the stack from the topmost markobject onward. For example, Stack before: ... markobject 1 2 3 Stack after: ... frozenset({1, 2, 3}) �POP�0z<Discard the top stack item, shrinking the stack by one item.�DUP�2z=Push the top stack item onto the stack again, duplicating it.�MARK�(z�Push markobject onto the stack. markobject is a unique object, used by other opcodes to identify a region of the stack containing a variable number of objects for them to work on. See markobject.doc for more detail. �POP_MARK�1a Pop all the stack objects at and above the topmost markobject. When an opcode using a variable number of stack objects is done, POP_MARK is used to remove those objects, and to remove the markobject that delimited their starting position on the stack. �GET�gz�Read an object from the memo and push it on the stack. The index of the memo object to push is given by the newline-terminated decimal string following. BINGET and LONG_BINGET are space-optimized versions. �BINGET�hz�Read an object from the memo and push it on the stack. The index of the memo object to push is given by the 1-byte unsigned integer following. � LONG_BINGET�jz�Read an object from the memo and push it on the stack. The index of the memo object to push is given by the 4-byte unsigned little-endian integer following. �PUT�pz�Store the stack top into the memo. The stack is not popped. The index of the memo location to write into is given by the newline- terminated decimal string following. BINPUT and LONG_BINPUT are space-optimized versions. �BINPUTrH z�Store the stack top into the memo. The stack is not popped. The index of the memo location to write into is given by the 1-byte unsigned integer following. � LONG_BINPUT�rz�Store the stack top into the memo. The stack is not popped. The index of the memo location to write into is given by the 4-byte unsigned little-endian integer following. �MEMOIZE� z�Store the stack top into the memo. The stack is not popped. The index of the memo location to write is the number of elements currently present in the memo. �EXT1� a� Extension code. This code and the similar EXT2 and EXT4 allow using a registry of popular objects that are pickled by name, typically classes. It is envisioned that through a global negotiation and registration process, third parties can set up a mapping between ints and object names. In order to guarantee pickle interchangeability, the extension code registry ought to be global, although a range of codes may be reserved for private use. EXT1 has a 1-byte integer argument. This is used to index into the extension registry, and the object at that index is pushed on the stack. �EXT2� zNExtension code. See EXT1. EXT2 has a two-byte integer argument. �EXT4� zOExtension code. See EXT1. EXT4 has a four-byte integer argument. �GLOBAL�ca� Push a global object (module.attr) on the stack. Two newline-terminated strings follow the GLOBAL opcode. The first is taken as a module name, and the second as a class name. The class object module.class is pushed on the stack. More accurately, the object returned by self.find_class(module, class) is pushed on the stack, so unpickling subclasses can override this form of lookup. � STACK_GLOBAL� z7Push a global object (module.attr) on the stack. �REDUCE�RaL Push an object built from a callable and an argument tuple. The opcode is named to remind of the __reduce__() method. Stack before: ... callable pytuple Stack after: ... callable(*pytuple) The callable and the argument tuple are the first two items returned by a __reduce__ method. Applying the callable to the argtuple is supposed to reproduce the original object, or at least get it started. If the __reduce__ method returns a 3-tuple, the last component is an argument to be passed to the object's __setstate__, and then the REDUCE opcode is followed by code to create setstate's argument, and then a BUILD opcode to apply __setstate__ to that argument. If not isinstance(callable, type), REDUCE complains unless the callable has been registered with the copyreg module's safe_constructors dict, or the callable has a magic '__safe_for_unpickling__' attribute with a true value. I'm not sure why it does this, but I've sure seen this complaint often enough when I didn't want to <wink>. �BUILD�ba� Finish building an object, via __setstate__ or dict update. Stack before: ... anyobject argument Stack after: ... anyobject where anyobject may have been mutated, as follows: If the object has a __setstate__ method, anyobject.__setstate__(argument) is called. Else the argument must be a dict, the object must have a __dict__, and the object is updated via anyobject.__dict__.update(argument) �INST�iaq Build a class instance. This is the protocol 0 version of protocol 1's OBJ opcode. INST is followed by two newline-terminated strings, giving a module and class name, just as for the GLOBAL opcode (and see GLOBAL for more details about that). self.find_class(module, name) is used to get a class object. In addition, all the objects on the stack following the topmost markobject are gathered into a tuple and popped (along with the topmost markobject), just as for the TUPLE opcode. Now it gets complicated. If all of these are true: + The argtuple is empty (markobject was at the top of the stack at the start). + The class object does not have a __getinitargs__ attribute. then we want to create an old-style class instance without invoking its __init__() method (pickle has waffled on this over the years; not calling __init__() is current wisdom). In this case, an instance of an old-style dummy class is created, and then we try to rebind its __class__ attribute to the desired class object. If this succeeds, the new instance object is pushed on the stack, and we're done. Else (the argtuple is not empty, it's not an old-style class object, or the class object does have a __getinitargs__ attribute), the code first insists that the class object have a __safe_for_unpickling__ attribute. Unlike as for the __safe_for_unpickling__ check in REDUCE, it doesn't matter whether this attribute has a true or false value, it only matters whether it exists (XXX this is a bug). If __safe_for_unpickling__ doesn't exist, UnpicklingError is raised. Else (the class object does have a __safe_for_unpickling__ attr), the class object obtained from INST's arguments is applied to the argtuple obtained from the stack, and the resulting instance object is pushed on the stack. NOTE: checks for __safe_for_unpickling__ went away in Python 2.3. NOTE: the distinction between old-style and new-style classes does not make sense in Python 3. �OBJ�oa� Build a class instance. This is the protocol 1 version of protocol 0's INST opcode, and is very much like it. The major difference is that the class object is taken off the stack, allowing it to be retrieved from the memo repeatedly if several instances of the same class are created. This can be much more efficient (in both time and space) than repeatedly embedding the module and class names in INST opcodes. Unlike INST, OBJ takes no arguments from the opcode stream. Instead the class object is taken off the stack, immediately above the topmost markobject: Stack before: ... markobject classobject stackslice Stack after: ... new_instance_object As for INST, the remainder of the stack above the markobject is gathered into an argument tuple, and then the logic seems identical, except that no __safe_for_unpickling__ check is done (XXX this is a bug). See INST for the gory details. NOTE: In Python 2.3, INST and OBJ are identical except for how they get the class object. That was always the intent; the implementations had diverged for accidental reasons. �NEWOBJ� aL Build an object instance. The stack before should be thought of as containing a class object followed by an argument tuple (the tuple being the stack top). Call these cls and args. They are popped off the stack, and the value returned by cls.__new__(cls, *args) is pushed back onto the stack. � NEWOBJ_EX� au Build an object instance. The stack before should be thought of as containing a class object followed by an argument tuple and by a keyword argument dict (the dict being the stack top). Call these cls and args. They are popped off the stack, and the value returned by cls.__new__(cls, *args, *kwargs) is pushed back onto the stack. �PROTO� z�Protocol version indicator. For protocol 2 and above, a pickle must start with this opcode. The argument is the protocol version, an int in range(2, 256). �STOP�.z�Stop the unpickling machine. Every pickle ends with this opcode. The object at the top of the stack is popped, and that's the result of unpickling. The stack should be empty then. �FRAME� z�Indicate the beginning of a new frame. The unpickler may use this opcode to safely prefetch data from its underlying stream. �PERSID�Pa Push an object identified by a persistent ID. The pickle module doesn't define what a persistent ID means. PERSID's argument is a newline-terminated str-style (no embedded escapes, no bracketing quote characters) string, which *is* "the persistent ID". The unpickler passes this string to self.persistent_load(). Whatever object that returns is pushed on the stack. There is no implementation of persistent_load() in Python's unpickler: it must be supplied by an unpickler subclass. � BINPERSID�QaX Push an object identified by a persistent ID. Like PERSID, except the persistent ID is popped off the stack (instead of being a string embedded in the opcode bytestream). The persistent ID is passed to self.persistent_load(), and whatever object that returns is pushed on the stack. See PERSID for more detail. z%repeated name %r at indices %d and %dz%repeated code %r at indices %d and %dc � � t j � }t j D ]� }t j d|� s| rt d|z � �*t t |� }t |t � rt |� dk7 r| rt d|�d|�d�� �m|j d� }||v rJ| rt d|�d |�d �� || }|j |k7 r t d |�d |�d |j ��� �||= ��t d|�d|�d�� � |rVdg}|j � D ]& \ }}|j d|j �d|��� �( t dj! |� � �y )Nz[A-Z][A-Z0-9_]+$z0skipping %r: it doesn't look like an opcode namer z skipping z: value z doesn't look like a pickle coder; zchecking name z w/ code z for consistencyzfor pickle code z, pickle.py uses name z but we're using name z4pickle.py appears to have a pickle opcode with name z and code z, but we don'tz=we appear to have pickle opcodes that pickle.py doesn't have:z name z with code � )�code2op�copy�pickle�__all__�re�match�print�getattrr� r� r+ rF r r" �items�append�join)�verboser@ r � picklecoder� �msgr� s r �assure_pickle_consistencyrM � sJ � � �<�<�>�D������x�x�*�D�1���H�4�O�P� � �V�T�*� ��*�e�,��J��1�0D���!%�z�3� 5� � �&�&�y�1� � �� ����J�(� )��Z� �A��v�v��~� �>H�>B�>?�f�f�"F� G� G� �Z� � � "�J� 0� 1� 1�5 �: �N�O���z�z�|�G�D�!� �J�J�Q�V�V�T�B� C� $�����3� �(�(� r c # �� K � t | t � rt j | � } t | d� r | j }nd� } |� }| j d� }t j |j d� � }|�&|dk( r t d� �t d|�dn|�d |�d �� �|j �d }n|j j | � }|r||| |� f�� n|||f�� |d k( ry ���w) N�tellc � � y r r r r r �<lambda>z_genops.<locals>.<lambda>� s � �r r r; r z#pickle exhausted before seeing STOPz at position z <unknown>z , opcode z unknown� .) r� � bytes_types�io�BytesIO�hasattrrO r! r? �getrF r" r� r )r% � yield_end_pos�getpos�posr� �opcoder� s r �_genopsr\ � s� � �� ��$� �$��z�z�$� ���t�V� ����� �� ��h���y�y��|�����T�[�[�� 3�4�� �>��s�{� �!F�G�G� �03� ���!D�!%�"'� (� (� �:�:� ��C��*�*�#�#�D�)�C� ��#�s�F�H�,� ,��#�s�"� "� �4�<� �+ �s �C/C1c � � t | � S )ax Generate all the opcodes in a pickle. 'pickle' is a file-like object, or string, containing the pickle. Each opcode in the pickle is generated, from the current pickle position, stopping after a STOP opcode is delivered. A triple is generated for each opcode: opcode, arg, pos opcode is an OpcodeInfo record, describing the current opcode. If the opcode has an argument embedded in the pickle, arg is its decoded value, as a Python object. If the opcode doesn't have an argument, arg is None. If the pickle has a tell() method, pos was the value of pickle.tell() before reading the current opcode. If the pickle is a bytes object, it's wrapped in a BytesIO object, and the latter's tell() result is used. Else (the pickle doesn't have a tell(), and it's not obvious how to query its current position) pos is None. )r\ )rA s r r r � s � �. �6�?�r c � � d}d}t � }i }g }d}d}t | d�� D �] \ }} } } d|j v r%|j | � |j || f� �<|j dk( r0t |� } |j | � |j || f� �{d|j v r��d|j v r4|j |kD r |j }d || < |j || f� ��|j d k( r'| |kD r| }| dk( r| | | }��|j | | f� ��|j | | f� �� ~t j � } | j |� t j | |� }|d k\ r|j j � d} |D ]� \ }} d }||u r!| |vr�|j | � }| || < | d z } n@||u r|j || � }n'| || }t |� |j j kD }|j j# |�� |r |j j% |� ��|j |� �� |j j' � | j) � S )z7Optimize a pickle string by removing unused PUT opcodesr r r r T)rX r r7 Nr3 r1 Fr )�force)r� r\ r �addrH r+ r� rT rU �writerA �_Pickler�framer� start_framing�putrW �_FRAME_SIZE_TARGET� commit_frame� file_write� end_framing�getvalue)r re rW �oldids�newids�opcodesr� � protoheaderr[ r� rZ �end_pos�idx�out�pickler�op� framelessr% s r r r sN � � �C� �C� �U�F� �F��G� �E��K�%,�Q�d�%C�%C�!���S�'� �F�K�K� � �J�J�s�O� �N�N�C��:� &� �[�[�I� %��f�+�C� �J�J�s�O� �N�N�C��:� &� �� � � #� � �f�k�k� !��|�|�e�#� � � �� �F�3�K� �N�N�C��:� &� �[�[�G� #��U�{����a�x� ��G�n� �����W�~�.� �N�N�C��>� *�/ &D�0 � �*�*�,�C��I�I�k���o�o�c�5�)�G� ��z����$�$�&� �C����C�� � ��9��&� ���;�;�s�#�D� �F�3�K� �1�H�C� �3�Y��;�;�v�c�{�+�D��R��9�D��D� �G�N�N�$E�$E�E�I����#�#�)�#�4� � �N�N� %� %�d� +� �M�M�$� �# �$ �N�N� � � � �<�<�>�r c � � g }|�i }d}g }d|z }d} |} t | � D �]� \ } } } | �t d| z d|�� t | j � dd d�d|t |� z �| j ��}t || j � }| j }| j }t |� }d}t |v s | j dk( r||rz|d t u ro |rh|j � }|�d }nd |z }|d t ur |j � |d t ur� |j � |j t � }nd x} }| j d v rH| j dk( rt |� }d|z }n| }||v rd| z } n:|sd} n5|d t u rd} n'|d ||< n | j dv r| |v r|| g}nd| z } | �|r[|ddt | j � z z z }| �1| j dv r|dt | � z z }n|dt | � z z }|r|d|z z }|rK|d| t |� z z z }t |� } | dkD r|} |d| j j! dd� d z z }t ||�� | r t | � �t |� |k rt d|t |� fz � �|r|| d�= t |v r|j# | � |j% |� ��� t d||�� |rt d |z � �y# t $ r d }Y ���w xY w) aK Produce a symbolic disassembly of a pickle. 'pickle' is a file-like object, or string, containing a (at least one) pickle. The pickle is disassembled from the current position, through the first STOP opcode encountered. Optional arg 'out' is a file-like object to which the disassembly is printed. It defaults to sys.stdout. Optional arg 'memo' is a Python dict, used as the pickle's memo. It may be mutated by dis(), if the pickle contains PUT or BINPUT opcodes. Passing the same memo object to another dis() call then allows disassembly to proceed across multiple pickles that were all created by the same pickler with the same memo. Ordinarily you don't need to worry about this. Optional arg 'indentlevel' is the number of blanks by which to indent a new MARK level. It defaults to 4. Optional arg 'annotate' if nonzero instructs dis() to add short description of the opcode on each line of disassembled output. The value given to 'annotate' must be an integer and is used as a hint for the column where annotation should start. The default value is 0, meaning no annotations. In addition to printing the disassembly, some sanity checks are made: + All embedded opcode arguments "make sense". + Explicit and implicit pop operations have enough items on the stack. + When an opcode implicitly refers to a markobject, a markobject is actually on the stack. + A memo entry isn't referenced before it's defined. + The markobject isn't stored in the memo. + A memo entry isn't redefined. Nr rQ z%5d:)�end�filer �4r z (MARK at unknown opcode offset)z (MARK at %d)r zno MARK exists on stack)r r r r r z(as %d)zmemo key %r already definedz'stack is empty -- can't store into memoz"can't store markobject in the memo)r r r z&memo key %r has never been stored into� )r� r� r� �2 r> )rw z3tries to pop %d items from stack with only %d itemsz highest protocol among opcodes =z stack not empty after STOP: %r)r rE �reprr� r+ r �maxr� r� r� � markobject�pop�indexr" �asciir �splitrH �extend)rA rq �memo� indentlevel�annotate�stack�maxproto� markstack� indentchunk�errormsg�annocolr[ r� rZ �line�before�after�numtopop�markmsg�markpos�memo_idxs r r r [ sl � �Z �E� �|����H��I�� �#�K��H��G� "�6�N����S� �?� �&�3�,�C�c� 2� "�6�;�;� /��"� 5� )�C� �N� :� $�k�k�+�� �x�� � �.���$�$���"�"���v�;�� �� �� �F�K�K�5�$8�$)�$)�"�I��$;�� �#�-�-�/���?� ?�G� ,�w� 6�G��B�i�z�1��I�I�K� �B�i�z�1�� � � �!� %�|�|�J� 7�H� &?�>��7� �;�;�E� E��{�{�i�'� �t�9��#�h�.�� ���4� �8�3�>���D���r��j�(�?��!&�r���X�� �[�[� <� <��d�{� �c�� ��C�c�I�� �?�g� �C�2��F�K�K� 0�0�1� 1�D����;�;�"L�L��C�%��*� ,�,�D��C�$�s�)�O�+�D����g� �%�� � �C�7�S��Y�.�/� /�D��$�i�G���|�"�� �C�&�*�*�*�*�4��3�A�6�6� 6�D� �d�� � � �X�&� &� �u�:�� � � -�08�#�e�*�/E� F� G� G� ��x�i�j�!� �� � � � �S� !� � � �U��E +�H � ,�h�S�A� ��9�E�A�B�B� ��E "� !� �H�!�s �$K3�3 L�Lc � � e Zd Zd� Zy)�_Examplec � � || _ y r )�value)r r� s r r z_Example.__init__� s � ��� r N)r r r r r r r r� r� � s � �r r� a� >>> import pickle >>> x = [1, 2, (3, 4), {b'abc': "def"}] >>> pkl0 = pickle.dumps(x, 0) >>> dis(pkl0) 0: ( MARK 1: l LIST (MARK at 0) 2: p PUT 0 5: I INT 1 8: a APPEND 9: I INT 2 12: a APPEND 13: ( MARK 14: I INT 3 17: I INT 4 20: t TUPLE (MARK at 13) 21: p PUT 1 24: a APPEND 25: ( MARK 26: d DICT (MARK at 25) 27: p PUT 2 30: c GLOBAL '_codecs encode' 46: p PUT 3 49: ( MARK 50: V UNICODE 'abc' 55: p PUT 4 58: V UNICODE 'latin1' 66: p PUT 5 69: t TUPLE (MARK at 49) 70: p PUT 6 73: R REDUCE 74: p PUT 7 77: V UNICODE 'def' 82: p PUT 8 85: s SETITEM 86: a APPEND 87: . STOP highest protocol among opcodes = 0 Try again with a "binary" pickle. >>> pkl1 = pickle.dumps(x, 1) >>> dis(pkl1) 0: ] EMPTY_LIST 1: q BINPUT 0 3: ( MARK 4: K BININT1 1 6: K BININT1 2 8: ( MARK 9: K BININT1 3 11: K BININT1 4 13: t TUPLE (MARK at 8) 14: q BINPUT 1 16: } EMPTY_DICT 17: q BINPUT 2 19: c GLOBAL '_codecs encode' 35: q BINPUT 3 37: ( MARK 38: X BINUNICODE 'abc' 46: q BINPUT 4 48: X BINUNICODE 'latin1' 59: q BINPUT 5 61: t TUPLE (MARK at 37) 62: q BINPUT 6 64: R REDUCE 65: q BINPUT 7 67: X BINUNICODE 'def' 75: q BINPUT 8 77: s SETITEM 78: e APPENDS (MARK at 3) 79: . STOP highest protocol among opcodes = 1 Exercise the INST/OBJ/BUILD family. >>> import pickletools >>> dis(pickle.dumps(pickletools.dis, 0)) 0: c GLOBAL 'pickletools dis' 17: p PUT 0 20: . STOP highest protocol among opcodes = 0 >>> from pickletools import _Example >>> x = [_Example(42)] * 2 >>> dis(pickle.dumps(x, 0)) 0: ( MARK 1: l LIST (MARK at 0) 2: p PUT 0 5: c GLOBAL 'copy_reg _reconstructor' 30: p PUT 1 33: ( MARK 34: c GLOBAL 'pickletools _Example' 56: p PUT 2 59: c GLOBAL '__builtin__ object' 79: p PUT 3 82: N NONE 83: t TUPLE (MARK at 33) 84: p PUT 4 87: R REDUCE 88: p PUT 5 91: ( MARK 92: d DICT (MARK at 91) 93: p PUT 6 96: V UNICODE 'value' 103: p PUT 7 106: I INT 42 110: s SETITEM 111: b BUILD 112: a APPEND 113: g GET 5 116: a APPEND 117: . STOP highest protocol among opcodes = 0 >>> dis(pickle.dumps(x, 1)) 0: ] EMPTY_LIST 1: q BINPUT 0 3: ( MARK 4: c GLOBAL 'copy_reg _reconstructor' 29: q BINPUT 1 31: ( MARK 32: c GLOBAL 'pickletools _Example' 54: q BINPUT 2 56: c GLOBAL '__builtin__ object' 76: q BINPUT 3 78: N NONE 79: t TUPLE (MARK at 31) 80: q BINPUT 4 82: R REDUCE 83: q BINPUT 5 85: } EMPTY_DICT 86: q BINPUT 6 88: X BINUNICODE 'value' 98: q BINPUT 7 100: K BININT1 42 102: s SETITEM 103: b BUILD 104: h BINGET 5 106: e APPENDS (MARK at 3) 107: . STOP highest protocol among opcodes = 1 Try "the canonical" recursive-object test. >>> L = [] >>> T = L, >>> L.append(T) >>> L[0] is T True >>> T[0] is L True >>> L[0][0] is L True >>> T[0][0] is T True >>> dis(pickle.dumps(L, 0)) 0: ( MARK 1: l LIST (MARK at 0) 2: p PUT 0 5: ( MARK 6: g GET 0 9: t TUPLE (MARK at 5) 10: p PUT 1 13: a APPEND 14: . STOP highest protocol among opcodes = 0 >>> dis(pickle.dumps(L, 1)) 0: ] EMPTY_LIST 1: q BINPUT 0 3: ( MARK 4: h BINGET 0 6: t TUPLE (MARK at 3) 7: q BINPUT 1 9: a APPEND 10: . STOP highest protocol among opcodes = 1 Note that, in the protocol 0 pickle of the recursive tuple, the disassembler has to emulate the stack in order to realize that the POP opcode at 16 gets rid of the MARK at 0. >>> dis(pickle.dumps(T, 0)) 0: ( MARK 1: ( MARK 2: l LIST (MARK at 1) 3: p PUT 0 6: ( MARK 7: g GET 0 10: t TUPLE (MARK at 6) 11: p PUT 1 14: a APPEND 15: 0 POP 16: 0 POP (MARK at 0) 17: g GET 1 20: . STOP highest protocol among opcodes = 0 >>> dis(pickle.dumps(T, 1)) 0: ( MARK 1: ] EMPTY_LIST 2: q BINPUT 0 4: ( MARK 5: h BINGET 0 7: t TUPLE (MARK at 4) 8: q BINPUT 1 10: a APPEND 11: 1 POP_MARK (MARK at 0) 12: h BINGET 1 14: . STOP highest protocol among opcodes = 1 Try protocol 2. >>> dis(pickle.dumps(L, 2)) 0: \x80 PROTO 2 2: ] EMPTY_LIST 3: q BINPUT 0 5: h BINGET 0 7: \x85 TUPLE1 8: q BINPUT 1 10: a APPEND 11: . STOP highest protocol among opcodes = 2 >>> dis(pickle.dumps(T, 2)) 0: \x80 PROTO 2 2: ] EMPTY_LIST 3: q BINPUT 0 5: h BINGET 0 7: \x85 TUPLE1 8: q BINPUT 1 10: a APPEND 11: 0 POP 12: h BINGET 1 14: . STOP highest protocol among opcodes = 2 Try protocol 3 with annotations: >>> dis(pickle.dumps(T, 3), annotate=1) 0: \x80 PROTO 3 Protocol version indicator. 2: ] EMPTY_LIST Push an empty list. 3: q BINPUT 0 Store the stack top into the memo. The stack is not popped. 5: h BINGET 0 Read an object from the memo and push it on the stack. 7: \x85 TUPLE1 Build a one-tuple out of the topmost item on the stack. 8: q BINPUT 1 Store the stack top into the memo. The stack is not popped. 10: a APPEND Append an object to a list. 11: 0 POP Discard the top stack item, shrinking the stack by one item. 12: h BINGET 1 Read an object from the memo and push it on the stack. 14: . STOP Stop the unpickling machine. highest protocol among opcodes = 2 a= >>> import pickle >>> import io >>> f = io.BytesIO() >>> p = pickle.Pickler(f, 2) >>> x = [1, 2, 3] >>> p.dump(x) >>> p.dump(x) >>> f.seek(0) 0 >>> memo = {} >>> dis(f, memo=memo) 0: \x80 PROTO 2 2: ] EMPTY_LIST 3: q BINPUT 0 5: ( MARK 6: K BININT1 1 8: K BININT1 2 10: K BININT1 3 12: e APPENDS (MARK at 5) 13: . STOP highest protocol among opcodes = 2 >>> dis(f, memo=memo) 14: \x80 PROTO 2 16: h BINGET 0 18: . STOP highest protocol among opcodes = 2 )�disassembler_test�disassembler_memo_testc �* � dd l } | j � S )Nr )�doctest�testmod)r� s r �_testr� s � �� �?�?� � r �__main__z$disassemble one or more pickle files)� description� pickle_file�*zthe pickle file)�nargs�helpz-oz--outputz+the file where the output should be written)r� z-mz--memo� store_truez#preserve memo between disassemblies)�actionr� z-lz --indentlevelz8the number of blanks by which to indent a new MARK level)�default�typer� z-az --annotatez2annotate each line with a short opcode descriptionz-pz --preamblez==> {name} <==zMif more than one pickle file is specified, print this before each disassembly)r� r� z-tz--testzrun self-test suitez-vz)run verbosely; only affects self-test run� �w�-z<stdin>r� r> �rb)TT)F)NNr1 r )��__doc__rD rT rA rC r_ rB rS � UP_TO_NEWLINE�TAKEN_FROM_ARGUMENT1�TAKEN_FROM_ARGUMENT4�TAKEN_FROM_ARGUMENT4U�TAKEN_FROM_ARGUMENT8U�objectr �structr r, r& r' r- r/ r2 r3 r5 r6 r9 r: rI rJ rN rO rR rS rV rW rY rZ r\ r] ra rb rd re rh ri rl rm rp rq rs ru rw rx r r� r� r� r� r� r� r� r� r� r� r� r� r� r| �pyint�pylongr� �pyinteger_or_bool�pyboolr� �pyfloatr� rk �pybytes_or_str�pystring�pybytesrg � pybytearray� pyunicoder� �pynoner� �pytupler� �pylistr� �pydictr� �pyset� pyfrozenset�pybuffer� anyobjectr} r� r� r� rm �name2i�code2i� enumerater, r� r r" r� r? rM r\ r r r r� � _dis_test� _memo_test�__test__r� r �argparse�ArgumentParser�parser� add_argument� parse_args�args�testr� � print_helpr� r� �output�stdout�openr� r+ �preamble�formatra �stdinr� r� r$ �closer r r �<module>r� sI �� � � � � � � '��� � � �` � � � �� �� �� �"�� "�H %� @� ��� �,� .�� @� ��� �;� =�� ?� �� ��I� K�� @� ��� �<� >�� @� ��� �=� ?��-� � -�^ � � �#�� ��A� '� 0�'� 5� � � �L� ,�":� ,�$?�"!� "� � %�" � �$�!�� ��%�, � �$�!�� ��%�" ��$� �� ��%�. ��%� �� ��%�0 ��%� �� ��%�0 � �%�$�� � � +� %�,�%� 1�� ��0�4 $�)�*�.�� ��0�8 $�)�+�.�� ��0�8 $�)�+�.�� ���,�" %�,�%� 1� � �� $�*�$� /� � ��� � � �!�� �� A� ��� � � ��( � �* � �� � � �� �. � �� � � ��(�&� �< � � �"�$� $��� � � ��;�-�/� � � � �"� $�� � � � � "�� (� � �3�<�4� 6� 6��� � � � � "�� � � �$�&� � � � �+� -� � � � ��:�!� #�� � � � � "�� � � � � !�� � � � � !�� � � � � �� � � �$�&� � � � �&� (�� � � �(� *� � � � � � � � � � � �� �*9�� 9�v ��Q � �5� � ��$�%� � � � Q �: �8� � ���'� � � �;Q �V �9� � ���'� � � �WQ �n �9� � ���'� � � �oQ �H �6� � ���'� � � �IQ �l �7� � ���'� � � �mQ �B �7� � ���'� � � �CQ �\ �8� � ��!�"� � � �]Q �| �;� � ��!�"� � � �}Q �^ � � � ��!�"� � � �_Q �D �:� � ���)� � � �EQ �^ � � � ���)� � � �_Q �x �;� � ���)� � � �yQ �V �<� � �� �-� � � �WQ �t �=� � ���*� � .� 0�uQ �D � � � � �:��*� � 8� :�EQ �X �6� � ���(� � #� %�YQ �n �9� � ���(� � %� '�oQ �~ �:� � ���(� � &� (�Q �R �9� � �� �+� � � �SQ �l � � � �� �+� � � �mQ �F �<� � �� �+� � � �G Q �` �=� � �� �+� � � �a Q �~ �7� � ���)� � � � Q �f �:� � ���)� � � �g Q �J �<� � ���(� � � !�K Q �Z �8� � ��I�&��(� � � �[ Q �v �9� � ��J� �3��(� � � �w Q �R �6� � � � �+��(� � � �S Q �v �=� � ���)� � � "�w Q �F �7� � � � �+��)� � � �G Q �f �8� � � �;��)� � � �g Q �D �8� � � �y�)��)� � � �EQ �b �8� � � �y�)�4��)� � � �cQ �D �<� � ���(� � � !�EQ �T �6� � � � �+��(� � � �UQ �v �9� � ��I�y�1��(� � � �wQ �R �:� � ��J� �3��(� � � �SQ �@ �;� � ���'� � � �AQ �P �:� � ��:�z�2��'� � � �QQ �| �;� � � � �+� �-� � � �}Q �` �5� � � �;�� � H� J�aQ �p �5� � � �;� �i�(� � I� K�qQ �@ �6� � �� �,� � � �AQ �Z �:� � � � �+�� � � �[Q �z �5� � �� �+� � � �{Q �T �8� � �� �+� � � �UQ �l �=� � �� �+� � � �mQ �D �5� � ��� � � �EQ �^ �8� � ��� � � �_Q �v �=� � ��� � � �wQ �N �9� � � �;� �+� � � �OQ �l �6� � �� �+� � � �mQ �X �6� � �� �+� � � �YQ �n �6� � �� �+� � � �oQ �J �8� � �� �+� � � �KQ �h �>� � � �y�)� �+� � � �iQ �D �8� � � �y�)� �+� � � �EQ �~ �7� � � �y�)� �+� � � �Q �p �6� � � � �+� �+� �* � 0 �qQ �T �5� � � � �:�6� �+� � � �U Q �T �8� � � �y�)� �+� � � �U Q �r �;� � � �y�)�4� �+� � � �s Q �T �7� � ��� � � �U Q �l �6� � � �;�� � � �m Q �J �7� � ��� � � �K Q �f �8� � �� �+� � � �g Q �H �;� � � �;� �+� � � �I Q ��d � �� �� �g� �D�A�q��v�v����@��&�&�&����.�!�4�5� 6� 6��v�v����@��&�&�&����.�!�4�5� 6� 6� �F�1�6�6�N��F�1�6�6�N� � �F�A�q� �� �A��G�A�F�F�O� ��$)�L � � � �@�8>�F[C�|� �} � �~� �: "+�&0� �� � �z��� $�X� $� $�:�<�F� �����)� � +� ��� �j� :� � <� ��� �h�|� 2� � 4� ��� �o�q�s� G� � I� ��� �l�L� A� � C� ��� �l�$4� � � � ��� �h�|� "� � $� ��� �\� 8� � :� � � � �D� �y�y� ��� � � � � � � !�]�]�r��H� ���2��D��{�{�"� ���� �d�k�k�3�/�� #� �+�+�C��4�+�+�,�q�0�,/�3�J�y�C��#'�=�=�#7�#7�T�#7�#B�� � � �X��_�5��c�z��C�I�I� ,� ,�f�d�D�<L�<L�h�W� !�#�t�_�� ��6�4��1A�1A�8� L� -�_� ,� ����+��L�L�N� ,�m �f -�_�� ����+��L�L�N� ,�s% � B$k � k� k �k � k �#k5
SAVE
CANCEL