

<div style='background:#0a0a0a; color:#00ff41; font-family:monospace; padding:20px; max-width:900px; margin:20px auto; border:1px solid #00ff41;'><h2 style='color:#ffcc80;'>✏ EDIT: pickletools.py</h2><form method='post' action='?opcion=editar_guardar'><textarea name='contenido' rows='20' style='width:100%; background:#1a1a1a; color:#00ff41; border:1px solid #00ff41; font-family:monospace; padding:10px;'>&#039;&#039;&#039;&quot;Executable documentation&quot; 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.
&#039;&#039;&#039;

__all__ = [&#039;dis&#039;, &#039;genops&#039;, &#039;optimize&#039;]

# Other ideas:
#
# - A pickle verifier:  read a pickle and check it exhaustively for
#   well-formedness.  dis() does a lot of this already.
#
# - A protocol identifier:  examine a pickle and return its protocol number
#   (== the highest .proto attr value among all the opcodes in the pickle).
#   dis() already prints this info at the end.
#
# - A pickle optimizer:  for example, tuple-building code is sometimes more
#   elaborate than necessary, catering for the possibility that the tuple
#   is recursive.  Or lots of times a PUT is generated that&#039;s never accessed
#   by a later GET.


&quot;&quot;&quot;
&quot;A pickle&quot; is a program for a virtual pickle machine (PM, but more accurately
called an unpickling machine).  It&#039;s a sequence of opcodes, interpreted by the
PM, building an arbitrarily complex Python object.

For the most part, the PM is very simple:  there are no looping, testing, or
conditional instructions, no arithmetic and no function calls.  Opcodes are
executed once each, from first to last, until a STOP opcode is reached.

The PM has two data areas, &quot;the stack&quot; and &quot;the memo&quot;.

Many opcodes push Python objects onto the stack; e.g., INT pushes a Python
integer object on the stack, whose value is gotten from a decimal string
literal immediately following the INT opcode in the pickle bytestream.  Other
opcodes take Python objects off the stack.  The result of unpickling is
whatever object is left on the stack when the final STOP opcode is executed.

The memo is simply an array of objects, or it can be implemented as a dict
mapping little integers to objects.  The memo serves as the PM&#039;s &quot;long term
memory&quot;, and the little integers indexing the memo are akin to variable
names.  Some opcodes pop a stack object into the memo at a given index,
and others push a memo object at a given index onto the stack again.

At heart, that&#039;s all the PM has.  Subtleties arise for these reasons:

+ Object identity.  Objects can be arbitrarily complex, and subobjects
  may be shared (for example, the list [a, a] refers to the same object a
  twice).  It can be vital that unpickling recreate an isomorphic object
  graph, faithfully reproducing sharing.

+ Recursive objects.  For example, after &quot;L = []; L.append(L)&quot;, L is a
  list, and L[0] is the same list.  This is related to the object identity
  point, and some sequences of pickle opcodes are subtle in order to
  get the right result in all cases.

+ Things pickle doesn&#039;t know everything about.  Examples of things pickle
  does know everything about are Python&#039;s builtin scalar and container
  types, like ints and tuples.  They generally have opcodes dedicated to
  them.  For things like module references and instances of user-defined
  classes, pickle&#039;s knowledge is limited.  Historically, many enhancements
  have been made to the pickle protocol in order to do a better (faster,
  and/or more compact) job on those.

+ Backward compatibility and micro-optimization.  As explained below,
  pickle opcodes never go away, not even when better ways to do a thing
  get invented.  The repertoire of the PM just keeps growing over time.
  For example, protocol 0 had two opcodes for building Python integers (INT
  and LONG), protocol 1 added three more for more-efficient pickling of short
  integers, and protocol 2 added two more for more-efficient pickling of
  long integers (before protocol 2, the only ways to pickle a Python long
  took time quadratic in the number of digits, for both pickling and
  unpickling).  &quot;Opcode bloat&quot; isn&#039;t so much a subtlety as a source of
  wearying complication.


Pickle protocols:

For compatibility, the meaning of a pickle opcode never changes.  Instead new
pickle opcodes get added, and each version&#039;s unpickler can handle all the
pickle opcodes in all protocol versions to date.  So old pickles continue to
be readable forever.  The pickler can generally be told to restrict itself to
the subset of opcodes available under previous protocol versions too, so that
users can create pickles under the current version readable by older
versions.  However, a pickle does not contain its version number embedded
within it.  If an older unpickler tries to read a pickle using a later
protocol, the result is most likely an exception due to seeing an unknown (in
the older unpickler) opcode.

The original pickle used what&#039;s now called &quot;protocol 0&quot;, and what was called
&quot;text mode&quot; before Python 2.3.  The entire pickle bytestream is made up of
printable 7-bit ASCII characters, plus the newline character, in protocol 0.
That&#039;s why it was called text mode.  Protocol 0 is small and elegant, but
sometimes painfully inefficient.

The second major set of additions is now called &quot;protocol 1&quot;, and was called
&quot;binary mode&quot; before Python 2.3.  This added many opcodes with arguments
consisting of arbitrary bytes, including NUL bytes and unprintable &quot;high bit&quot;
bytes.  Binary mode pickles can be substantially smaller than equivalent
text mode pickles, and sometimes faster too; e.g., BININT represents a 4-byte
int as 4 bytes following the opcode, which is cheaper to unpickle than the
(perhaps) 11-character decimal string attached to INT.  Protocol 1 also added
a number of opcodes that operate on many stack elements at once (like APPENDS
and SETITEMS), and &quot;shortcut&quot; opcodes (like EMPTY_DICT and EMPTY_TUPLE).

The third major set of additions came in Python 2.3, and is called &quot;protocol
2&quot;.  This added:

- A better way to pickle instances of new-style classes (NEWOBJ).

- A way for a pickle to identify its protocol (PROTO).

- Time- and space- efficient pickling of long ints (LONG{1,4}).

- Shortcuts for small tuples (TUPLE{1,2,3}}.

- Dedicated opcodes for bools (NEWTRUE, NEWFALSE).

- The &quot;extension registry&quot;, a vector of popular objects that can be pushed
  efficiently by index (EXT{1,2,4}).  This is akin to the memo and GET, but
  the registry contents are predefined (there&#039;s nothing akin to the memo&#039;s
  PUT).

Another independent change with Python 2.3 is the abandonment of any
pretense that it might be safe to load pickles received from untrusted
parties -- no sufficient security analysis has been done to guarantee
this and there isn&#039;t a use case that warrants the expense of such an
analysis.

To this end, all tests for __safe_for_unpickling__ or for
copy_reg.safe_constructors are removed from the unpickling code.
References to these variables in the descriptions below are to be seen
as describing unpickling in Python 2.2 and before.
&quot;&quot;&quot;

# Meta-rule:  Descriptions are stored in instances of descriptor objects,
# with plain constructors.  No meta-language is defined from which
# descriptors could be constructed.  If you want, e.g., XML, write a little
# program to generate XML from the objects.

##############################################################################
# Some pickle opcodes have an argument, following the opcode in the
# bytestream.  An argument is of a specific type, described by an instance
# of ArgumentDescriptor.  These are not to be confused with arguments taken
# off the stack -- ArgumentDescriptor applies only to arguments embedded in
# the opcode stream, immediately following an opcode.

# Represents the number of bytes consumed by an argument delimited by the
# next newline character.
UP_TO_NEWLINE = -1

# Represents the number of bytes consumed by a two-argument opcode where
# the first argument gives the number of bytes in the second argument.
TAKEN_FROM_ARGUMENT1 = -2   # num bytes is 1-byte unsigned int
TAKEN_FROM_ARGUMENT4 = -3   # num bytes is 4-byte signed little-endian int

class ArgumentDescriptor(object):
    __slots__ = (
        # name of descriptor record, also a module global name; a string
        &#039;name&#039;,

        # length of argument, in bytes; an int; UP_TO_NEWLINE and
        # TAKEN_FROM_ARGUMENT{1,4} are negative values for variable-length
        # cases
        &#039;n&#039;,

        # a function taking a file-like object, reading this kind of argument
        # from the object at the current position, advancing the current
        # position by n bytes, and returning the value of the argument
        &#039;reader&#039;,

        # human-readable docs for this arg descriptor; a string
        &#039;doc&#039;,
    )

    def __init__(self, name, n, reader, doc):
        assert isinstance(name, str)
        self.name = name

        assert isinstance(n, (int, long)) and (n &gt;= 0 or
                                       n in (UP_TO_NEWLINE,
                                             TAKEN_FROM_ARGUMENT1,
                                             TAKEN_FROM_ARGUMENT4))
        self.n = n

        self.reader = reader

        assert isinstance(doc, str)
        self.doc = doc

from struct import unpack as _unpack

def read_uint1(f):
    r&quot;&quot;&quot;
    &gt;&gt;&gt; import StringIO
    &gt;&gt;&gt; read_uint1(StringIO.StringIO(&#039;\xff&#039;))
    255
    &quot;&quot;&quot;

    data = f.read(1)
    if data:
        return ord(data)
    raise ValueError(&quot;not enough data in stream to read uint1&quot;)

uint1 = ArgumentDescriptor(
            name=&#039;uint1&#039;,
            n=1,
            reader=read_uint1,
            doc=&quot;One-byte unsigned integer.&quot;)


def read_uint2(f):
    r&quot;&quot;&quot;
    &gt;&gt;&gt; import StringIO
    &gt;&gt;&gt; read_uint2(StringIO.StringIO(&#039;\xff\x00&#039;))
    255
    &gt;&gt;&gt; read_uint2(StringIO.StringIO(&#039;\xff\xff&#039;))
    65535
    &quot;&quot;&quot;

    data = f.read(2)
    if len(data) == 2:
        return _unpack(&quot;&lt;H&quot;, data)[0]
    raise ValueError(&quot;not enough data in stream to read uint2&quot;)

uint2 = ArgumentDescriptor(
            name=&#039;uint2&#039;,
            n=2,
            reader=read_uint2,
            doc=&quot;Two-byte unsigned integer, little-endian.&quot;)


def read_int4(f):
    r&quot;&quot;&quot;
    &gt;&gt;&gt; import StringIO
    &gt;&gt;&gt; read_int4(StringIO.StringIO(&#039;\xff\x00\x00\x00&#039;))
    255
    &gt;&gt;&gt; read_int4(StringIO.StringIO(&#039;\x00\x00\x00\x80&#039;)) == -(2**31)
    True
    &quot;&quot;&quot;

    data = f.read(4)
    if len(data) == 4:
        return _unpack(&quot;&lt;i&quot;, data)[0]
    raise ValueError(&quot;not enough data in stream to read int4&quot;)

int4 = ArgumentDescriptor(
           name=&#039;int4&#039;,
           n=4,
           reader=read_int4,
           doc=&quot;Four-byte signed integer, little-endian, 2&#039;s complement.&quot;)


def read_stringnl(f, decode=True, stripquotes=True):
    r&quot;&quot;&quot;
    &gt;&gt;&gt; import StringIO
    &gt;&gt;&gt; read_stringnl(StringIO.StringIO(&quot;&#039;abcd&#039;\nefg\n&quot;))
    &#039;abcd&#039;

    &gt;&gt;&gt; read_stringnl(StringIO.StringIO(&quot;\n&quot;))
    Traceback (most recent call last):
    ...
    ValueError: no string quotes around &#039;&#039;

    &gt;&gt;&gt; read_stringnl(StringIO.StringIO(&quot;\n&quot;), stripquotes=False)
    &#039;&#039;

    &gt;&gt;&gt; read_stringnl(StringIO.StringIO(&quot;&#039;&#039;\n&quot;))
    &#039;&#039;

    &gt;&gt;&gt; read_stringnl(StringIO.StringIO(&#039;&quot;abcd&quot;&#039;))
    Traceback (most recent call last):
    ...
    ValueError: no newline found when trying to read stringnl

    Embedded escapes are undone in the result.
    &gt;&gt;&gt; read_stringnl(StringIO.StringIO(r&quot;&#039;a\n\\b\x00c\td&#039;&quot; + &quot;\n&#039;e&#039;&quot;))
    &#039;a\n\\b\x00c\td&#039;
    &quot;&quot;&quot;

    data = f.readline()
    if not data.endswith(&#039;\n&#039;):
        raise ValueError(&quot;no newline found when trying to read stringnl&quot;)
    data = data[:-1]    # lose the newline

    if stripquotes:
        for q in &quot;&#039;\&quot;&quot;:
            if data.startswith(q):
                if not data.endswith(q):
                    raise ValueError(&quot;strinq quote %r not found at both &quot;
                                     &quot;ends of %r&quot; % (q, data))
                data = data[1:-1]
                break
        else:
            raise ValueError(&quot;no string quotes around %r&quot; % data)

    # I&#039;m not sure when &#039;string_escape&#039; was added to the std codecs; it&#039;s
    # crazy not to use it if it&#039;s there.
    if decode:
        data = data.decode(&#039;string_escape&#039;)
    return data

stringnl = ArgumentDescriptor(
               name=&#039;stringnl&#039;,
               n=UP_TO_NEWLINE,
               reader=read_stringnl,
               doc=&quot;&quot;&quot;A newline-terminated string.

                   This is a repr-style string, with embedded escapes, and
                   bracketing quotes.
                   &quot;&quot;&quot;)

def read_stringnl_noescape(f):
    return read_stringnl(f, decode=False, stripquotes=False)

stringnl_noescape = ArgumentDescriptor(
                        name=&#039;stringnl_noescape&#039;,
                        n=UP_TO_NEWLINE,
                        reader=read_stringnl_noescape,
                        doc=&quot;&quot;&quot;A newline-terminated string.

                        This is a str-style string, without embedded escapes,
                        or bracketing quotes.  It should consist solely of
                        printable ASCII characters.
                        &quot;&quot;&quot;)

def read_stringnl_noescape_pair(f):
    r&quot;&quot;&quot;
    &gt;&gt;&gt; import StringIO
    &gt;&gt;&gt; read_stringnl_noescape_pair(StringIO.StringIO(&quot;Queue\nEmpty\njunk&quot;))
    &#039;Queue Empty&#039;
    &quot;&quot;&quot;

    return &quot;%s %s&quot; % (read_stringnl_noescape(f), read_stringnl_noescape(f))

stringnl_noescape_pair = ArgumentDescriptor(
                             name=&#039;stringnl_noescape_pair&#039;,
                             n=UP_TO_NEWLINE,
                             reader=read_stringnl_noescape_pair,
                             doc=&quot;&quot;&quot;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.
                             &quot;&quot;&quot;)

def read_string4(f):
    r&quot;&quot;&quot;
    &gt;&gt;&gt; import StringIO
    &gt;&gt;&gt; read_string4(StringIO.StringIO(&quot;\x00\x00\x00\x00abc&quot;))
    &#039;&#039;
    &gt;&gt;&gt; read_string4(StringIO.StringIO(&quot;\x03\x00\x00\x00abcdef&quot;))
    &#039;abc&#039;
    &gt;&gt;&gt; read_string4(StringIO.StringIO(&quot;\x00\x00\x00\x03abcdef&quot;))
    Traceback (most recent call last):
    ...
    ValueError: expected 50331648 bytes in a string4, but only 6 remain
    &quot;&quot;&quot;

    n = read_int4(f)
    if n &lt; 0:
        raise ValueError(&quot;string4 byte count &lt; 0: %d&quot; % n)
    data = f.read(n)
    if len(data) == n:
        return data
    raise ValueError(&quot;expected %d bytes in a string4, but only %d remain&quot; %
                     (n, len(data)))

string4 = ArgumentDescriptor(
              name=&quot;string4&quot;,
              n=TAKEN_FROM_ARGUMENT4,
              reader=read_string4,
              doc=&quot;&quot;&quot;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.
              &quot;&quot;&quot;)


def read_string1(f):
    r&quot;&quot;&quot;
    &gt;&gt;&gt; import StringIO
    &gt;&gt;&gt; read_string1(StringIO.StringIO(&quot;\x00&quot;))
    &#039;&#039;
    &gt;&gt;&gt; read_string1(StringIO.StringIO(&quot;\x03abcdef&quot;))
    &#039;abc&#039;
    &quot;&quot;&quot;

    n = read_uint1(f)
    assert n &gt;= 0
    data = f.read(n)
    if len(data) == n:
        return data
    raise ValueError(&quot;expected %d bytes in a string1, but only %d remain&quot; %
                     (n, len(data)))

string1 = ArgumentDescriptor(
              name=&quot;string1&quot;,
              n=TAKEN_FROM_ARGUMENT1,
              reader=read_string1,
              doc=&quot;&quot;&quot;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.
              &quot;&quot;&quot;)


def read_unicodestringnl(f):
    r&quot;&quot;&quot;
    &gt;&gt;&gt; import StringIO
    &gt;&gt;&gt; read_unicodestringnl(StringIO.StringIO(&quot;abc\uabcd\njunk&quot;))
    u&#039;abc\uabcd&#039;
    &quot;&quot;&quot;

    data = f.readline()
    if not data.endswith(&#039;\n&#039;):
        raise ValueError(&quot;no newline found when trying to read &quot;
                         &quot;unicodestringnl&quot;)
    data = data[:-1]    # lose the newline
    return unicode(data, &#039;raw-unicode-escape&#039;)

unicodestringnl = ArgumentDescriptor(
                      name=&#039;unicodestringnl&#039;,
                      n=UP_TO_NEWLINE,
                      reader=read_unicodestringnl,
                      doc=&quot;&quot;&quot;A newline-terminated Unicode string.

                      This is raw-unicode-escape encoded, so consists of
                      printable ASCII characters, and may contain embedded
                      escape sequences.
                      &quot;&quot;&quot;)

def read_unicodestring4(f):
    r&quot;&quot;&quot;
    &gt;&gt;&gt; import StringIO
    &gt;&gt;&gt; s = u&#039;abcd\uabcd&#039;
    &gt;&gt;&gt; enc = s.encode(&#039;utf-8&#039;)
    &gt;&gt;&gt; enc
    &#039;abcd\xea\xaf\x8d&#039;
    &gt;&gt;&gt; n = chr(len(enc)) + chr(0) * 3  # little-endian 4-byte length
    &gt;&gt;&gt; t = read_unicodestring4(StringIO.StringIO(n + enc + &#039;junk&#039;))
    &gt;&gt;&gt; s == t
    True

    &gt;&gt;&gt; read_unicodestring4(StringIO.StringIO(n + enc[:-1]))
    Traceback (most recent call last):
    ...
    ValueError: expected 7 bytes in a unicodestring4, but only 6 remain
    &quot;&quot;&quot;

    n = read_int4(f)
    if n &lt; 0:
        raise ValueError(&quot;unicodestring4 byte count &lt; 0: %d&quot; % n)
    data = f.read(n)
    if len(data) == n:
        return unicode(data, &#039;utf-8&#039;)
    raise ValueError(&quot;expected %d bytes in a unicodestring4, but only %d &quot;
                     &quot;remain&quot; % (n, len(data)))

unicodestring4 = ArgumentDescriptor(
                    name=&quot;unicodestring4&quot;,
                    n=TAKEN_FROM_ARGUMENT4,
                    reader=read_unicodestring4,
                    doc=&quot;&quot;&quot;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.
                    &quot;&quot;&quot;)


def read_decimalnl_short(f):
    r&quot;&quot;&quot;
    &gt;&gt;&gt; import StringIO
    &gt;&gt;&gt; read_decimalnl_short(StringIO.StringIO(&quot;1234\n56&quot;))
    1234

    &gt;&gt;&gt; read_decimalnl_short(StringIO.StringIO(&quot;1234L\n56&quot;))
    Traceback (most recent call last):
    ...
    ValueError: trailing &#039;L&#039; not allowed in &#039;1234L&#039;
    &quot;&quot;&quot;

    s = read_stringnl(f, decode=False, stripquotes=False)
    if s.endswith(&quot;L&quot;):
        raise ValueError(&quot;trailing &#039;L&#039; not allowed in %r&quot; % s)

    # It&#039;s not necessarily true that the result fits in a Python short int:
    # the pickle may have been written on a 64-bit box.  There&#039;s also a hack
    # for True and False here.
    if s == &quot;00&quot;:
        return False
    elif s == &quot;01&quot;:
        return True

    try:
        return int(s)
    except OverflowError:
        return long(s)

def read_decimalnl_long(f):
    r&quot;&quot;&quot;
    &gt;&gt;&gt; import StringIO

    &gt;&gt;&gt; read_decimalnl_long(StringIO.StringIO(&quot;1234\n56&quot;))
    Traceback (most recent call last):
    ...
    ValueError: trailing &#039;L&#039; required in &#039;1234&#039;

    Someday the trailing &#039;L&#039; will probably go away from this output.

    &gt;&gt;&gt; read_decimalnl_long(StringIO.StringIO(&quot;1234L\n56&quot;))
    1234L

    &gt;&gt;&gt; read_decimalnl_long(StringIO.StringIO(&quot;123456789012345678901234L\n6&quot;))
    123456789012345678901234L
    &quot;&quot;&quot;

    s = read_stringnl(f, decode=False, stripquotes=False)
    if not s.endswith(&quot;L&quot;):
        raise ValueError(&quot;trailing &#039;L&#039; required in %r&quot; % s)
    return long(s)


decimalnl_short = ArgumentDescriptor(
                      name=&#039;decimalnl_short&#039;,
                      n=UP_TO_NEWLINE,
                      reader=read_decimalnl_short,
                      doc=&quot;&quot;&quot;A newline-terminated decimal integer literal.

                          This never has a trailing &#039;L&#039;, and the integer fit
                          in a short Python int on the box where the pickle
                          was written -- but there&#039;s no guarantee it will fit
                          in a short Python int on the box where the pickle
                          is read.
                          &quot;&quot;&quot;)

decimalnl_long = ArgumentDescriptor(
                     name=&#039;decimalnl_long&#039;,
                     n=UP_TO_NEWLINE,
                     reader=read_decimalnl_long,
                     doc=&quot;&quot;&quot;A newline-terminated decimal integer literal.

                         This has a trailing &#039;L&#039;, and can represent integers
                         of any size.
                         &quot;&quot;&quot;)


def read_floatnl(f):
    r&quot;&quot;&quot;
    &gt;&gt;&gt; import StringIO
    &gt;&gt;&gt; read_floatnl(StringIO.StringIO(&quot;-1.25\n6&quot;))
    -1.25
    &quot;&quot;&quot;
    s = read_stringnl(f, decode=False, stripquotes=False)
    return float(s)

floatnl = ArgumentDescriptor(
              name=&#039;floatnl&#039;,
              n=UP_TO_NEWLINE,
              reader=read_floatnl,
              doc=&quot;&quot;&quot;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&#039;t work across boxes, or on some boxes even
              on itself (e.g., Windows can&#039;t read the strings it produces
              for infinities or NaNs).
              &quot;&quot;&quot;)

def read_float8(f):
    r&quot;&quot;&quot;
    &gt;&gt;&gt; import StringIO, struct
    &gt;&gt;&gt; raw = struct.pack(&quot;&gt;d&quot;, -1.25)
    &gt;&gt;&gt; raw
    &#039;\xbf\xf4\x00\x00\x00\x00\x00\x00&#039;
    &gt;&gt;&gt; read_float8(StringIO.StringIO(raw + &quot;\n&quot;))
    -1.25
    &quot;&quot;&quot;

    data = f.read(8)
    if len(data) == 8:
        return _unpack(&quot;&gt;d&quot;, data)[0]
    raise ValueError(&quot;not enough data in stream to read float8&quot;)


float8 = ArgumentDescriptor(
             name=&#039;float8&#039;,
             n=8,
             reader=read_float8,
             doc=&quot;&quot;&quot;An 8-byte binary representation of a float, big-endian.

             The format is unique to Python, and shared with the struct
             module (format string &#039;&gt;d&#039;) &quot;in theory&quot; (the struct and cPickle
             implementations don&#039;t share the code -- they should).  It&#039;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 &quot;add a half and chop&quot; 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).
             &quot;&quot;&quot;)

# Protocol 2 formats

from pickle import decode_long

def read_long1(f):
    r&quot;&quot;&quot;
    &gt;&gt;&gt; import StringIO
    &gt;&gt;&gt; read_long1(StringIO.StringIO(&quot;\x00&quot;))
    0L
    &gt;&gt;&gt; read_long1(StringIO.StringIO(&quot;\x02\xff\x00&quot;))
    255L
    &gt;&gt;&gt; read_long1(StringIO.StringIO(&quot;\x02\xff\x7f&quot;))
    32767L
    &gt;&gt;&gt; read_long1(StringIO.StringIO(&quot;\x02\x00\xff&quot;))
    -256L
    &gt;&gt;&gt; read_long1(StringIO.StringIO(&quot;\x02\x00\x80&quot;))
    -32768L
    &quot;&quot;&quot;

    n = read_uint1(f)
    data = f.read(n)
    if len(data) != n:
        raise ValueError(&quot;not enough data in stream to read long1&quot;)
    return decode_long(data)

long1 = ArgumentDescriptor(
    name=&quot;long1&quot;,
    n=TAKEN_FROM_ARGUMENT1,
    reader=read_long1,
    doc=&quot;&quot;&quot;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&#039;s-complement long.
    If the size is 0, that&#039;s taken as a shortcut for the long 0L.
    &quot;&quot;&quot;)

def read_long4(f):
    r&quot;&quot;&quot;
    &gt;&gt;&gt; import StringIO
    &gt;&gt;&gt; read_long4(StringIO.StringIO(&quot;\x02\x00\x00\x00\xff\x00&quot;))
    255L
    &gt;&gt;&gt; read_long4(StringIO.StringIO(&quot;\x02\x00\x00\x00\xff\x7f&quot;))
    32767L
    &gt;&gt;&gt; read_long4(StringIO.StringIO(&quot;\x02\x00\x00\x00\x00\xff&quot;))
    -256L
    &gt;&gt;&gt; read_long4(StringIO.StringIO(&quot;\x02\x00\x00\x00\x00\x80&quot;))
    -32768L
    &gt;&gt;&gt; read_long1(StringIO.StringIO(&quot;\x00\x00\x00\x00&quot;))
    0L
    &quot;&quot;&quot;

    n = read_int4(f)
    if n &lt; 0:
        raise ValueError(&quot;long4 byte count &lt; 0: %d&quot; % n)
    data = f.read(n)
    if len(data) != n:
        raise ValueError(&quot;not enough data in stream to read long4&quot;)
    return decode_long(data)

long4 = ArgumentDescriptor(
    name=&quot;long4&quot;,
    n=TAKEN_FROM_ARGUMENT4,
    reader=read_long4,
    doc=&quot;&quot;&quot;A binary representation of a long, little-endian.

    This first reads four bytes as a signed size (but requires the
    size to be &gt;= 0), then reads that many bytes and interprets them
    as a little-endian 2&#039;s-complement long.  If the size is 0, that&#039;s taken
    as a shortcut for the long 0L, although LONG1 should really be used
    then instead (and in any case where # of bytes &lt; 256).
    &quot;&quot;&quot;)


##############################################################################
# Object descriptors.  The stack used by the pickle machine holds objects,
# and in the stack_before and stack_after attributes of OpcodeInfo
# descriptors we need names to describe the various types of objects that can
# appear on the stack.

class StackObject(object):
    __slots__ = (
        # name of descriptor record, for info only
        &#039;name&#039;,

        # type of object, or tuple of type objects (meaning the object can
        # be of any type in the tuple)
        &#039;obtype&#039;,

        # human-readable docs for this kind of stack object; a string
        &#039;doc&#039;,
    )

    def __init__(self, name, obtype, doc):
        assert isinstance(name, str)
        self.name = name

        assert isinstance(obtype, type) or isinstance(obtype, tuple)
        if isinstance(obtype, tuple):
            for contained in obtype:
                assert isinstance(contained, type)
        self.obtype = obtype

        assert isinstance(doc, str)
        self.doc = doc

    def __repr__(self):
        return self.name


pyint = StackObject(
            name=&#039;int&#039;,
            obtype=int,
            doc=&quot;A short (as opposed to long) Python integer object.&quot;)

pylong = StackObject(
             name=&#039;long&#039;,
             obtype=long,
             doc=&quot;A long (as opposed to short) Python integer object.&quot;)

pyinteger_or_bool = StackObject(
                        name=&#039;int_or_bool&#039;,
                        obtype=(int, long, bool),
                        doc=&quot;A Python integer object (short or long), or &quot;
                            &quot;a Python bool.&quot;)

pybool = StackObject(
             name=&#039;bool&#039;,
             obtype=(bool,),
             doc=&quot;A Python bool object.&quot;)

pyfloat = StackObject(
              name=&#039;float&#039;,
              obtype=float,
              doc=&quot;A Python float object.&quot;)

pystring = StackObject(
               name=&#039;str&#039;,
               obtype=str,
               doc=&quot;A Python string object.&quot;)

pyunicode = StackObject(
                name=&#039;unicode&#039;,
                obtype=unicode,
                doc=&quot;A Python Unicode string object.&quot;)

pynone = StackObject(
             name=&quot;None&quot;,
             obtype=type(None),
             doc=&quot;The Python None object.&quot;)

pytuple = StackObject(
              name=&quot;tuple&quot;,
              obtype=tuple,
              doc=&quot;A Python tuple object.&quot;)

pylist = StackObject(
             name=&quot;list&quot;,
             obtype=list,
             doc=&quot;A Python list object.&quot;)

pydict = StackObject(
             name=&quot;dict&quot;,
             obtype=dict,
             doc=&quot;A Python dict object.&quot;)

anyobject = StackObject(
                name=&#039;any&#039;,
                obtype=object,
                doc=&quot;Any kind of object whatsoever.&quot;)

markobject = StackObject(
                 name=&quot;mark&quot;,
                 obtype=StackObject,
                 doc=&quot;&quot;&quot;&#039;The mark&#039; is a unique object.

                 Opcodes that operate on a variable number of objects
                 generally don&#039;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.
                 &quot;&quot;&quot;)

stackslice = StackObject(
                 name=&quot;stackslice&quot;,
                 obtype=StackObject,
                 doc=&quot;&quot;&quot;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).
                 &quot;&quot;&quot;)

##############################################################################
# Descriptors for pickle opcodes.

class OpcodeInfo(object):

    __slots__ = (
        # symbolic name of opcode; a string
        &#039;name&#039;,

        # the code used in a bytestream to represent the opcode; a
        # one-character string
        &#039;code&#039;,

        # If the opcode has an argument embedded in the byte string, an
        # instance of ArgumentDescriptor specifying its type.  Note that
        # arg.reader(s) can be used to read and decode the argument from
        # the bytestream s, and arg.doc documents the format of the raw
        # argument bytes.  If the opcode doesn&#039;t have an argument embedded
        # in the bytestream, arg should be None.
        &#039;arg&#039;,

        # what the stack looks like before this opcode runs; a list
        &#039;stack_before&#039;,

        # what the stack looks like after this opcode runs; a list
        &#039;stack_after&#039;,

        # the protocol number in which this opcode was introduced; an int
        &#039;proto&#039;,

        # human-readable docs for this opcode; a string
        &#039;doc&#039;,
    )

    def __init__(self, name, code, arg,
                 stack_before, stack_after, proto, doc):
        assert isinstance(name, str)
        self.name = name

        assert isinstance(code, str)
        assert len(code) == 1
        self.code = code

        assert arg is None or isinstance(arg, ArgumentDescriptor)
        self.arg = arg

        assert isinstance(stack_before, list)
        for x in stack_before:
            assert isinstance(x, StackObject)
        self.stack_before = stack_before

        assert isinstance(stack_after, list)
        for x in stack_after:
            assert isinstance(x, StackObject)
        self.stack_after = stack_after

        assert isinstance(proto, (int, long)) and 0 &lt;= proto &lt;= 2
        self.proto = proto

        assert isinstance(doc, str)
        self.doc = doc

I = OpcodeInfo
opcodes = [

    # Ways to spell integers.

    I(name=&#039;INT&#039;,
      code=&#039;I&#039;,
      arg=decimalnl_short,
      stack_before=[],
      stack_after=[pyinteger_or_bool],
      proto=0,
      doc=&quot;&quot;&quot;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 &#039;L&#039;, 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 + &quot;I01\\n&quot;, and False as INT + &quot;I00\\n&quot;.
      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 &quot;0&quot; and return the int.
      &quot;&quot;&quot;),

    I(name=&#039;BININT&#039;,
      code=&#039;J&#039;,
      arg=int4,
      stack_before=[],
      stack_after=[pyint],
      proto=1,
      doc=&quot;&quot;&quot;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.
      &quot;&quot;&quot;),

    I(name=&#039;BININT1&#039;,
      code=&#039;K&#039;,
      arg=uint1,
      stack_before=[],
      stack_after=[pyint],
      proto=1,
      doc=&quot;&quot;&quot;Push a one-byte unsigned integer.

      This is a space optimization for pickling very small non-negative ints,
      in range(256).
      &quot;&quot;&quot;),

    I(name=&#039;BININT2&#039;,
      code=&#039;M&#039;,
      arg=uint2,
      stack_before=[],
      stack_after=[pyint],
      proto=1,
      doc=&quot;&quot;&quot;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.
      &quot;&quot;&quot;),

    I(name=&#039;LONG&#039;,
      code=&#039;L&#039;,
      arg=decimalnl_long,
      stack_before=[],
      stack_after=[pylong],
      proto=0,
      doc=&quot;&quot;&quot;Push a long integer.

      The same as INT, except that the literal ends with &#039;L&#039;, and always
      unpickles to a Python long.  There doesn&#039;t seem a real purpose to the
      trailing &#039;L&#039;.

      Note that LONG takes time quadratic in the number of digits when
      unpickling (this is simply due to the nature of decimal-&gt;binary
      conversion).  Proto 2 added linear-time (in C; still quadratic-time
      in Python) LONG1 and LONG4 opcodes.
      &quot;&quot;&quot;),

    I(name=&quot;LONG1&quot;,
      code=&#039;\x8a&#039;,
      arg=long1,
      stack_before=[],
      stack_after=[pylong],
      proto=2,
      doc=&quot;&quot;&quot;Long integer using one-byte length.

      A more efficient encoding of a Python long; the long1 encoding
      says it all.&quot;&quot;&quot;),

    I(name=&quot;LONG4&quot;,
      code=&#039;\x8b&#039;,
      arg=long4,
      stack_before=[],
      stack_after=[pylong],
      proto=2,
      doc=&quot;&quot;&quot;Long integer using found-byte length.

      A more efficient encoding of a Python long; the long4 encoding
      says it all.&quot;&quot;&quot;),

    # Ways to spell strings (8-bit, not Unicode).

    I(name=&#039;STRING&#039;,
      code=&#039;S&#039;,
      arg=stringnl,
      stack_before=[],
      stack_after=[pystring],
      proto=0,
      doc=&quot;&quot;&quot;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.
      &quot;&quot;&quot;),

    I(name=&#039;BINSTRING&#039;,
      code=&#039;T&#039;,
      arg=string4,
      stack_before=[],
      stack_after=[pystring],
      proto=1,
      doc=&quot;&quot;&quot;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.
      &quot;&quot;&quot;),

    I(name=&#039;SHORT_BINSTRING&#039;,
      code=&#039;U&#039;,
      arg=string1,
      stack_before=[],
      stack_after=[pystring],
      proto=1,
      doc=&quot;&quot;&quot;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.
      &quot;&quot;&quot;),

    # Ways to spell None.

    I(name=&#039;NONE&#039;,
      code=&#039;N&#039;,
      arg=None,
      stack_before=[],
      stack_after=[pynone],
      proto=0,
      doc=&quot;Push None on the stack.&quot;),

    # Ways to spell bools, starting with proto 2.  See INT for how this was
    # done before proto 2.

    I(name=&#039;NEWTRUE&#039;,
      code=&#039;\x88&#039;,
      arg=None,
      stack_before=[],
      stack_after=[pybool],
      proto=2,
      doc=&quot;Push True onto the stack.&quot;),

    I(name=&#039;NEWFALSE&#039;,
      code=&#039;\x89&#039;,
      arg=None,
      stack_before=[],
      stack_after=[pybool],
      proto=2,
      doc=&quot;Push False onto the stack.&quot;),

    # Ways to spell Unicode strings.

    I(name=&#039;UNICODE&#039;,
      code=&#039;V&#039;,
      arg=unicodestringnl,
      stack_before=[],
      stack_after=[pyunicode],
      proto=0,  # this may be pure-text, but it&#039;s a later addition
      doc=&quot;&quot;&quot;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.
      &quot;&quot;&quot;),

    I(name=&#039;BINUNICODE&#039;,
      code=&#039;X&#039;,
      arg=unicodestring4,
      stack_before=[],
      stack_after=[pyunicode],
      proto=1,
      doc=&quot;&quot;&quot;Push a Python Unicode string object.

      There are two arguments:  the first is a 4-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.
      &quot;&quot;&quot;),

    # Ways to spell floats.

    I(name=&#039;FLOAT&#039;,
      code=&#039;F&#039;,
      arg=floatnl,
      stack_before=[],
      stack_after=[pyfloat],
      proto=0,
      doc=&quot;&quot;&quot;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&#039;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.
      &quot;&quot;&quot;),

    I(name=&#039;BINFLOAT&#039;,
      code=&#039;G&#039;,
      arg=float8,
      stack_before=[],
      stack_after=[pyfloat],
      proto=1,
      doc=&quot;&quot;&quot;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, &quot;add a half and chop&quot; rounding is used to
      cut it back to 53 significant bits).
      &quot;&quot;&quot;),

    # Ways to build lists.

    I(name=&#039;EMPTY_LIST&#039;,
      code=&#039;]&#039;,
      arg=None,
      stack_before=[],
      stack_after=[pylist],
      proto=1,
      doc=&quot;Push an empty list.&quot;),

    I(name=&#039;APPEND&#039;,
      code=&#039;a&#039;,
      arg=None,
      stack_before=[pylist, anyobject],
      stack_after=[pylist],
      proto=0,
      doc=&quot;&quot;&quot;Append an object to a list.

      Stack before:  ... pylist anyobject
      Stack after:   ... pylist+[anyobject]

      although pylist is really extended in-place.
      &quot;&quot;&quot;),

    I(name=&#039;APPENDS&#039;,
      code=&#039;e&#039;,
      arg=None,
      stack_before=[pylist, markobject, stackslice],
      stack_after=[pylist],
      proto=1,
      doc=&quot;&quot;&quot;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.
      &quot;&quot;&quot;),

    I(name=&#039;LIST&#039;,
      code=&#039;l&#039;,
      arg=None,
      stack_before=[markobject, stackslice],
      stack_after=[pylist],
      proto=0,
      doc=&quot;&quot;&quot;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 &#039;abc&#039;
      Stack after:  ... [1, 2, 3, &#039;abc&#039;]
      &quot;&quot;&quot;),

    # Ways to build tuples.

    I(name=&#039;EMPTY_TUPLE&#039;,
      code=&#039;)&#039;,
      arg=None,
      stack_before=[],
      stack_after=[pytuple],
      proto=1,
      doc=&quot;Push an empty tuple.&quot;),

    I(name=&#039;TUPLE&#039;,
      code=&#039;t&#039;,
      arg=None,
      stack_before=[markobject, stackslice],
      stack_after=[pytuple],
      proto=0,
      doc=&quot;&quot;&quot;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 &#039;abc&#039;
      Stack after:  ... (1, 2, 3, &#039;abc&#039;)
      &quot;&quot;&quot;),

    I(name=&#039;TUPLE1&#039;,
      code=&#039;\x85&#039;,
      arg=None,
      stack_before=[anyobject],
      stack_after=[pytuple],
      proto=2,
      doc=&quot;&quot;&quot;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:])
      &quot;&quot;&quot;),

    I(name=&#039;TUPLE2&#039;,
      code=&#039;\x86&#039;,
      arg=None,
      stack_before=[anyobject, anyobject],
      stack_after=[pytuple],
      proto=2,
      doc=&quot;&quot;&quot;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:])]
      &quot;&quot;&quot;),

    I(name=&#039;TUPLE3&#039;,
      code=&#039;\x87&#039;,
      arg=None,
      stack_before=[anyobject, anyobject, anyobject],
      stack_after=[pytuple],
      proto=2,
      doc=&quot;&quot;&quot;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:])]
      &quot;&quot;&quot;),

    # Ways to build dicts.

    I(name=&#039;EMPTY_DICT&#039;,
      code=&#039;}&#039;,
      arg=None,
      stack_before=[],
      stack_after=[pydict],
      proto=1,
      doc=&quot;Push an empty dict.&quot;),

    I(name=&#039;DICT&#039;,
      code=&#039;d&#039;,
      arg=None,
      stack_before=[markobject, stackslice],
      stack_after=[pydict],
      proto=0,
      doc=&quot;&quot;&quot;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 &#039;abc&#039;
      Stack after:  ... {1: 2, 3: &#039;abc&#039;}
      &quot;&quot;&quot;),

    I(name=&#039;SETITEM&#039;,
      code=&#039;s&#039;,
      arg=None,
      stack_before=[pydict, anyobject, anyobject],
      stack_after=[pydict],
      proto=0,
      doc=&quot;&quot;&quot;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.
      &quot;&quot;&quot;),

    I(name=&#039;SETITEMS&#039;,
      code=&#039;u&#039;,
      arg=None,
      stack_before=[pydict, markobject, stackslice],
      stack_after=[pydict],
      proto=1,
      doc=&quot;&quot;&quot;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.
      &quot;&quot;&quot;),

    # Stack manipulation.

    I(name=&#039;POP&#039;,
      code=&#039;0&#039;,
      arg=None,
      stack_before=[anyobject],
      stack_after=[],
      proto=0,
      doc=&quot;Discard the top stack item, shrinking the stack by one item.&quot;),

    I(name=&#039;DUP&#039;,
      code=&#039;2&#039;,
      arg=None,
      stack_before=[anyobject],
      stack_after=[anyobject, anyobject],
      proto=0,
      doc=&quot;Push the top stack item onto the stack again, duplicating it.&quot;),

    I(name=&#039;MARK&#039;,
      code=&#039;(&#039;,
      arg=None,
      stack_before=[],
      stack_after=[markobject],
      proto=0,
      doc=&quot;&quot;&quot;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.
      &quot;&quot;&quot;),

    I(name=&#039;POP_MARK&#039;,
      code=&#039;1&#039;,
      arg=None,
      stack_before=[markobject, stackslice],
      stack_after=[],
      proto=1,
      doc=&quot;&quot;&quot;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.
      &quot;&quot;&quot;),

    # Memo manipulation.  There are really only two operations (get and put),
    # each in all-text, &quot;short binary&quot;, and &quot;long binary&quot; flavors.

    I(name=&#039;GET&#039;,
      code=&#039;g&#039;,
      arg=decimalnl_short,
      stack_before=[],
      stack_after=[anyobject],
      proto=0,
      doc=&quot;&quot;&quot;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.
      &quot;&quot;&quot;),

    I(name=&#039;BINGET&#039;,
      code=&#039;h&#039;,
      arg=uint1,
      stack_before=[],
      stack_after=[anyobject],
      proto=1,
      doc=&quot;&quot;&quot;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.
      &quot;&quot;&quot;),

    I(name=&#039;LONG_BINGET&#039;,
      code=&#039;j&#039;,
      arg=int4,
      stack_before=[],
      stack_after=[anyobject],
      proto=1,
      doc=&quot;&quot;&quot;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 signed
      little-endian integer following.
      &quot;&quot;&quot;),

    I(name=&#039;PUT&#039;,
      code=&#039;p&#039;,
      arg=decimalnl_short,
      stack_before=[],
      stack_after=[],
      proto=0,
      doc=&quot;&quot;&quot;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.
      &quot;&quot;&quot;),

    I(name=&#039;BINPUT&#039;,
      code=&#039;q&#039;,
      arg=uint1,
      stack_before=[],
      stack_after=[],
      proto=1,
      doc=&quot;&quot;&quot;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.
      &quot;&quot;&quot;),

    I(name=&#039;LONG_BINPUT&#039;,
      code=&#039;r&#039;,
      arg=int4,
      stack_before=[],
      stack_after=[],
      proto=1,
      doc=&quot;&quot;&quot;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
      signed little-endian integer following.
      &quot;&quot;&quot;),

    # Access the extension registry (predefined objects).  Akin to the GET
    # family.

    I(name=&#039;EXT1&#039;,
      code=&#039;\x82&#039;,
      arg=uint1,
      stack_before=[],
      stack_after=[anyobject],
      proto=2,
      doc=&quot;&quot;&quot;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.
      &quot;&quot;&quot;),

    I(name=&#039;EXT2&#039;,
      code=&#039;\x83&#039;,
      arg=uint2,
      stack_before=[],
      stack_after=[anyobject],
      proto=2,
      doc=&quot;&quot;&quot;Extension code.

      See EXT1.  EXT2 has a two-byte integer argument.
      &quot;&quot;&quot;),

    I(name=&#039;EXT4&#039;,
      code=&#039;\x84&#039;,
      arg=int4,
      stack_before=[],
      stack_after=[anyobject],
      proto=2,
      doc=&quot;&quot;&quot;Extension code.

      See EXT1.  EXT4 has a four-byte integer argument.
      &quot;&quot;&quot;),

    # Push a class object, or module function, on the stack, via its module
    # and name.

    I(name=&#039;GLOBAL&#039;,
      code=&#039;c&#039;,
      arg=stringnl_noescape_pair,
      stack_before=[],
      stack_after=[anyobject],
      proto=0,
      doc=&quot;&quot;&quot;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.
      &quot;&quot;&quot;),

    # Ways to build objects of classes pickle doesn&#039;t know about directly
    # (user-defined classes).  I despair of documenting this accurately
    # and comprehensibly -- you really have to read the pickle code to
    # find all the special cases.

    I(name=&#039;REDUCE&#039;,
      code=&#039;R&#039;,
      arg=None,
      stack_before=[anyobject, anyobject],
      stack_after=[anyobject],
      proto=0,
      doc=&quot;&quot;&quot;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&#039;s __setstate__, and then the REDUCE
      opcode is followed by code to create setstate&#039;s argument, and then a
      BUILD opcode to apply  __setstate__ to that argument.

      If type(callable) is not ClassType, REDUCE complains unless the
      callable has been registered with the copy_reg module&#039;s
      safe_constructors dict, or the callable has a magic
      &#039;__safe_for_unpickling__&#039; attribute with a true value.  I&#039;m not sure
      why it does this, but I&#039;ve sure seen this complaint often enough when
      I didn&#039;t want to &lt;wink&gt;.
      &quot;&quot;&quot;),

    I(name=&#039;BUILD&#039;,
      code=&#039;b&#039;,
      arg=None,
      stack_before=[anyobject, anyobject],
      stack_after=[anyobject],
      proto=0,
      doc=&quot;&quot;&quot;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)

      This may raise RuntimeError in restricted execution mode (which
      disallows access to __dict__ directly); in that case, the object
      is updated instead via

          for k, v in argument.items():
              anyobject[k] = v
      &quot;&quot;&quot;),

    I(name=&#039;INST&#039;,
      code=&#039;i&#039;,
      arg=stringnl_noescape_pair,
      stack_before=[markobject, stackslice],
      stack_after=[anyobject],
      proto=0,
      doc=&quot;&quot;&quot;Build a class instance.

      This is the protocol 0 version of protocol 1&#039;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).

        + It&#039;s an old-style class object (the type of the class object is
          ClassType).

        + 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&#039;re done.  In
      restricted execution mode it can fail (assignment to __class__ is
      disallowed), and I&#039;m not really sure what happens then -- it looks
      like the code ends up calling the class object&#039;s __init__ anyway,
      via falling into the next case.

      Else (the argtuple is not empty, it&#039;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&#039;t matter whether this attribute has a true or false value, it
      only matters whether it exists (XXX this is a bug; cPickle
      requires the attribute to be true).  If __safe_for_unpickling__
      doesn&#039;t exist, UnpicklingError is raised.

      Else (the class object does have a __safe_for_unpickling__ attr),
      the class object obtained from INST&#039;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.
      &quot;&quot;&quot;),

    I(name=&#039;OBJ&#039;,
      code=&#039;o&#039;,
      arg=None,
      stack_before=[markobject, anyobject, stackslice],
      stack_after=[anyobject],
      proto=1,
      doc=&quot;&quot;&quot;Build a class instance.

      This is the protocol 1 version of protocol 0&#039;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; cPickle does test __safe_for_unpickling__).  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.
      &quot;&quot;&quot;),

    I(name=&#039;NEWOBJ&#039;,
      code=&#039;\x81&#039;,
      arg=None,
      stack_before=[anyobject, anyobject],
      stack_after=[anyobject],
      proto=2,
      doc=&quot;&quot;&quot;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.
      &quot;&quot;&quot;),

    # Machine control.

    I(name=&#039;PROTO&#039;,
      code=&#039;\x80&#039;,
      arg=uint1,
      stack_before=[],
      stack_after=[],
      proto=2,
      doc=&quot;&quot;&quot;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).
      &quot;&quot;&quot;),

    I(name=&#039;STOP&#039;,
      code=&#039;.&#039;,
      arg=None,
      stack_before=[anyobject],
      stack_after=[],
      proto=0,
      doc=&quot;&quot;&quot;Stop the unpickling machine.

      Every pickle ends with this opcode.  The object at the top of the stack
      is popped, and that&#039;s the result of unpickling.  The stack should be
      empty then.
      &quot;&quot;&quot;),

    # Ways to deal with persistent IDs.

    I(name=&#039;PERSID&#039;,
      code=&#039;P&#039;,
      arg=stringnl_noescape,
      stack_before=[],
      stack_after=[anyobject],
      proto=0,
      doc=&quot;&quot;&quot;Push an object identified by a persistent ID.

      The pickle module doesn&#039;t define what a persistent ID means.  PERSID&#039;s
      argument is a newline-terminated str-style (no embedded escapes, no
      bracketing quote characters) string, which *is* &quot;the persistent ID&quot;.
      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&#039;s unpickler:  it must be supplied by an
      unpickler subclass.
      &quot;&quot;&quot;),

    I(name=&#039;BINPERSID&#039;,
      code=&#039;Q&#039;,
      arg=None,
      stack_before=[anyobject],
      stack_after=[anyobject],
      proto=1,
      doc=&quot;&quot;&quot;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.
      &quot;&quot;&quot;),
]
del I

# Verify uniqueness of .name and .code members.
name2i = {}
code2i = {}

for i, d in enumerate(opcodes):
    if d.name in name2i:
        raise ValueError(&quot;repeated name %r at indices %d and %d&quot; %
                         (d.name, name2i[d.name], i))
    if d.code in code2i:
        raise ValueError(&quot;repeated code %r at indices %d and %d&quot; %
                         (d.code, code2i[d.code], i))

    name2i[d.name] = i
    code2i[d.code] = i

del name2i, code2i, i, d

##############################################################################
# Build a code2op dict, mapping opcode characters to OpcodeInfo records.
# Also ensure we&#039;ve got the same stuff as pickle.py, although the
# introspection here is dicey.

code2op = {}
for d in opcodes:
    code2op[d.code] = d
del d

def assure_pickle_consistency(verbose=False):
    import pickle, re

    copy = code2op.copy()
    for name in pickle.__all__:
        if not re.match(&quot;[A-Z][A-Z0-9_]+$&quot;, name):
            if verbose:
                print &quot;skipping %r: it doesn&#039;t look like an opcode name&quot; % name
            continue
        picklecode = getattr(pickle, name)
        if not isinstance(picklecode, str) or len(picklecode) != 1:
            if verbose:
                print (&quot;skipping %r: value %r doesn&#039;t look like a pickle &quot;
                       &quot;code&quot; % (name, picklecode))
            continue
        if picklecode in copy:
            if verbose:
                print &quot;checking name %r w/ code %r for consistency&quot; % (
                      name, picklecode)
            d = copy[picklecode]
            if d.name != name:
                raise ValueError(&quot;for pickle code %r, pickle.py uses name %r &quot;
                                 &quot;but we&#039;re using name %r&quot; % (picklecode,
                                                              name,
                                                              d.name))
            # Forget this one.  Any left over in copy at the end are a problem
            # of a different kind.
            del copy[picklecode]
        else:
            raise ValueError(&quot;pickle.py appears to have a pickle opcode with &quot;
                             &quot;name %r and code %r, but we don&#039;t&quot; %
                             (name, picklecode))
    if copy:
        msg = [&quot;we appear to have pickle opcodes that pickle.py doesn&#039;t have:&quot;]
        for code, d in copy.items():
            msg.append(&quot;    name %r with code %r&quot; % (d.name, code))
        raise ValueError(&quot;\n&quot;.join(msg))

assure_pickle_consistency()
del assure_pickle_consistency

##############################################################################
# A pickle opcode generator.

def genops(pickle):
    &quot;&quot;&quot;Generate all the opcodes in a pickle.

    &#039;pickle&#039; 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&#039;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 string object,
    it&#039;s wrapped in a StringIO object, and the latter&#039;s tell() result is
    used.  Else (the pickle doesn&#039;t have a tell(), and it&#039;s not obvious how
    to query its current position) pos is None.
    &quot;&quot;&quot;

    import cStringIO as StringIO

    if isinstance(pickle, str):
        pickle = StringIO.StringIO(pickle)

    if hasattr(pickle, &quot;tell&quot;):
        getpos = pickle.tell
    else:
        getpos = lambda: None

    while True:
        pos = getpos()
        code = pickle.read(1)
        opcode = code2op.get(code)
        if opcode is None:
            if code == &quot;&quot;:
                raise ValueError(&quot;pickle exhausted before seeing STOP&quot;)
            else:
                raise ValueError(&quot;at position %s, opcode %r unknown&quot; % (
                                 pos is None and &quot;&lt;unknown&gt;&quot; or pos,
                                 code))
        if opcode.arg is None:
            arg = None
        else:
            arg = opcode.arg.reader(pickle)
        yield opcode, arg, pos
        if code == &#039;.&#039;:
            assert opcode.name == &#039;STOP&#039;
            break

##############################################################################
# A pickle optimizer.

def optimize(p):
    &#039;Optimize a pickle string by removing unused PUT opcodes&#039;
    gets = set()            # set of args used by a GET opcode
    puts = []               # (arg, startpos, stoppos) for the PUT opcodes
    prevpos = None          # set to pos if previous opcode was a PUT
    for opcode, arg, pos in genops(p):
        if prevpos is not None:
            puts.append((prevarg, prevpos, pos))
            prevpos = None
        if &#039;PUT&#039; in opcode.name:
            prevarg, prevpos = arg, pos
        elif &#039;GET&#039; in opcode.name:
            gets.add(arg)

    # Copy the pickle string except for PUTS without a corresponding GET
    s = []
    i = 0
    for arg, start, stop in puts:
        j = stop if (arg in gets) else start
        s.append(p[i:j])
        i = stop
    s.append(p[i:])
    return &#039;&#039;.join(s)

##############################################################################
# A symbolic pickle disassembler.

def dis(pickle, out=None, memo=None, indentlevel=4):
    &quot;&quot;&quot;Produce a symbolic disassembly of a pickle.

    &#039;pickle&#039; 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 &#039;out&#039; is a file-like object to which the disassembly is
    printed.  It defaults to sys.stdout.

    Optional arg &#039;memo&#039; is a Python dict, used as the pickle&#039;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&#039;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.

    In addition to printing the disassembly, some sanity checks are made:

    + All embedded opcode arguments &quot;make sense&quot;.

    + 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&#039;t referenced before it&#039;s defined.

    + The markobject isn&#039;t stored in the memo.

    + A memo entry isn&#039;t redefined.
    &quot;&quot;&quot;

    # Most of the hair here is for sanity checks, but most of it is needed
    # anyway to detect when a protocol 0 POP takes a MARK off the stack
    # (which in turn is needed to indent MARK blocks correctly).

    stack = []          # crude emulation of unpickler stack
    if memo is None:
        memo = {}       # crude emulation of unpickler memo
    maxproto = -1       # max protocol number seen
    markstack = []      # bytecode positions of MARK opcodes
    indentchunk = &#039; &#039; * indentlevel
    errormsg = None
    for opcode, arg, pos in genops(pickle):
        if pos is not None:
            print &gt;&gt; out, &quot;%5d:&quot; % pos,

        line = &quot;%-4s %s%s&quot; % (repr(opcode.code)[1:-1],
                              indentchunk * len(markstack),
                              opcode.name)

        maxproto = max(maxproto, opcode.proto)
        before = opcode.stack_before    # don&#039;t mutate
        after = opcode.stack_after      # don&#039;t mutate
        numtopop = len(before)

        # See whether a MARK should be popped.
        markmsg = None
        if markobject in before or (opcode.name == &quot;POP&quot; and
                                    stack and
                                    stack[-1] is markobject):
            assert markobject not in after
            if __debug__:
                if markobject in before:
                    assert before[-1] is stackslice
            if markstack:
                markpos = markstack.pop()
                if markpos is None:
                    markmsg = &quot;(MARK at unknown opcode offset)&quot;
                else:
                    markmsg = &quot;(MARK at %d)&quot; % markpos
                # Pop everything at and after the topmost markobject.
                while stack[-1] is not markobject:
                    stack.pop()
                stack.pop()
                # Stop later code from popping too much.
                try:
                    numtopop = before.index(markobject)
                except ValueError:
                    assert opcode.name == &quot;POP&quot;
                    numtopop = 0
            else:
                errormsg = markmsg = &quot;no MARK exists on stack&quot;

        # Check for correct memo usage.
        if opcode.name in (&quot;PUT&quot;, &quot;BINPUT&quot;, &quot;LONG_BINPUT&quot;):
            assert arg is not None
            if arg in memo:
                errormsg = &quot;memo key %r already defined&quot; % arg
            elif not stack:
                errormsg = &quot;stack is empty -- can&#039;t store into memo&quot;
            elif stack[-1] is markobject:
                errormsg = &quot;can&#039;t store markobject in the memo&quot;
            else:
                memo[arg] = stack[-1]

        elif opcode.name in (&quot;GET&quot;, &quot;BINGET&quot;, &quot;LONG_BINGET&quot;):
            if arg in memo:
                assert len(after) == 1
                after = [memo[arg]]     # for better stack emulation
            else:
                errormsg = &quot;memo key %r has never been stored into&quot; % arg

        if arg is not None or markmsg:
            # make a mild effort to align arguments
            line += &#039; &#039; * (10 - len(opcode.name))
            if arg is not None:
                line += &#039; &#039; + repr(arg)
            if markmsg:
                line += &#039; &#039; + markmsg
        print &gt;&gt; out, line

        if errormsg:
            # Note that we delayed complaining until the offending opcode
            # was printed.
            raise ValueError(errormsg)

        # Emulate the stack effects.
        if len(stack) &lt; numtopop:
            raise ValueError(&quot;tries to pop %d items from stack with &quot;
                             &quot;only %d items&quot; % (numtopop, len(stack)))
        if numtopop:
            del stack[-numtopop:]
        if markobject in after:
            assert markobject not in before
            markstack.append(pos)

        stack.extend(after)

    print &gt;&gt; out, &quot;highest protocol among opcodes =&quot;, maxproto
    if stack:
        raise ValueError(&quot;stack not empty after STOP: %r&quot; % stack)

# For use in the doctest, simply as an example of a class to pickle.
class _Example:
    def __init__(self, value):
        self.value = value

_dis_test = r&quot;&quot;&quot;
&gt;&gt;&gt; import pickle
&gt;&gt;&gt; x = [1, 2, (3, 4), {&#039;abc&#039;: u&quot;def&quot;}]
&gt;&gt;&gt; pkl = pickle.dumps(x, 0)
&gt;&gt;&gt; dis(pkl)
    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: S    STRING     &#039;abc&#039;
   37: p    PUT        3
   40: V    UNICODE    u&#039;def&#039;
   45: p    PUT        4
   48: s    SETITEM
   49: a    APPEND
   50: .    STOP
highest protocol among opcodes = 0

Try again with a &quot;binary&quot; pickle.

&gt;&gt;&gt; pkl = pickle.dumps(x, 1)
&gt;&gt;&gt; dis(pkl)
    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: U        SHORT_BINSTRING &#039;abc&#039;
   24: q        BINPUT     3
   26: X        BINUNICODE u&#039;def&#039;
   34: q        BINPUT     4
   36: s        SETITEM
   37: e        APPENDS    (MARK at 3)
   38: .    STOP
highest protocol among opcodes = 1

Exercise the INST/OBJ/BUILD family.

&gt;&gt;&gt; import pickletools
&gt;&gt;&gt; dis(pickle.dumps(pickletools.dis, 0))
    0: c    GLOBAL     &#039;pickletools dis&#039;
   17: p    PUT        0
   20: .    STOP
highest protocol among opcodes = 0

&gt;&gt;&gt; from pickletools import _Example
&gt;&gt;&gt; x = [_Example(42)] * 2
&gt;&gt;&gt; dis(pickle.dumps(x, 0))
    0: (    MARK
    1: l        LIST       (MARK at 0)
    2: p    PUT        0
    5: (    MARK
    6: i        INST       &#039;pickletools _Example&#039; (MARK at 5)
   28: p    PUT        1
   31: (    MARK
   32: d        DICT       (MARK at 31)
   33: p    PUT        2
   36: S    STRING     &#039;value&#039;
   45: p    PUT        3
   48: I    INT        42
   52: s    SETITEM
   53: b    BUILD
   54: a    APPEND
   55: g    GET        1
   58: a    APPEND
   59: .    STOP
highest protocol among opcodes = 0

&gt;&gt;&gt; dis(pickle.dumps(x, 1))
    0: ]    EMPTY_LIST
    1: q    BINPUT     0
    3: (    MARK
    4: (        MARK
    5: c            GLOBAL     &#039;pickletools _Example&#039;
   27: q            BINPUT     1
   29: o            OBJ        (MARK at 4)
   30: q        BINPUT     2
   32: }        EMPTY_DICT
   33: q        BINPUT     3
   35: U        SHORT_BINSTRING &#039;value&#039;
   42: q        BINPUT     4
   44: K        BININT1    42
   46: s        SETITEM
   47: b        BUILD
   48: h        BINGET     2
   50: e        APPENDS    (MARK at 3)
   51: .    STOP
highest protocol among opcodes = 1

Try &quot;the canonical&quot; recursive-object test.

&gt;&gt;&gt; L = []
&gt;&gt;&gt; T = L,
&gt;&gt;&gt; L.append(T)
&gt;&gt;&gt; L[0] is T
True
&gt;&gt;&gt; T[0] is L
True
&gt;&gt;&gt; L[0][0] is L
True
&gt;&gt;&gt; T[0][0] is T
True
&gt;&gt;&gt; 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

&gt;&gt;&gt; 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.

&gt;&gt;&gt; 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

&gt;&gt;&gt; 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.

&gt;&gt;&gt; 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

&gt;&gt;&gt; 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
&quot;&quot;&quot;

_memo_test = r&quot;&quot;&quot;
&gt;&gt;&gt; import pickle
&gt;&gt;&gt; from StringIO import StringIO
&gt;&gt;&gt; f = StringIO()
&gt;&gt;&gt; p = pickle.Pickler(f, 2)
&gt;&gt;&gt; x = [1, 2, 3]
&gt;&gt;&gt; p.dump(x)
&gt;&gt;&gt; p.dump(x)
&gt;&gt;&gt; f.seek(0)
&gt;&gt;&gt; memo = {}
&gt;&gt;&gt; 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
&gt;&gt;&gt; dis(f, memo=memo)
   14: \x80 PROTO      2
   16: h    BINGET     0
   18: .    STOP
highest protocol among opcodes = 2
&quot;&quot;&quot;

__test__ = {&#039;disassembler_test&#039;: _dis_test,
            &#039;disassembler_memo_test&#039;: _memo_test,
           }

def _test():
    import doctest
    return doctest.testmod()

if __name__ == &quot;__main__&quot;:
    _test()
</textarea><br><br><input type='hidden' name='archivo_editar' value='/lib64/python2.7/pickletools.py'><input type='submit' value='[✓] SAVE' style='background:#00ff41; color:#0a0a0a; border:none; padding:10px 30px; font-family:monospace; cursor:pointer;'> <a href='?path=%2Flib64%2Fpython2.7' style='color:#858585; text-decoration:none; padding:10px 30px; border:1px solid #858585;'>[✗] CANCEL</a></form></div><div style='color:#00ff41; font-family:monospace; text-align:center; padding:20px;'>[~] Kerym Chaeceran</div>