Comparison function slotdef_cmp in  Objects/typeobject.c is based on the assumption that qsort may be stabilised by taking memory addresses of compared objects into consideration. This assumption is not guaranteed by the C standard and may not always be true, like for example in the case of qsort implemented as a typical quicksort.
Sometimes it may be even more harmful, as some implementations may be unhappy about comparison function changing its value just because an element was moved to another memory location (I discovered this problem while porting Python to HelenOS, where this comparison function caused qsort to enter infinite recursion).

The actual function:

/* Comparison function for qsort() to compare slotdefs by their offset, and
   for equal offset by their address (to force a stable sort). */
static int
slotdef_cmp(const void *aa, const void *bb)
{
    const slotdef *a = (const slotdef *)aa, *b = (const slotdef *)bb;
    int c = a->offset - b->offset;
    if (c != 0)
        return c;
    else
        /* Cannot use a-b, as this gives off_t,
           which may lose precision when converted to int. */
        return (a > b) ? 1 : (a < b) ? -1 : 0;
}

New changeset 9431a092b708 by Benjamin Peterson in branch '3.3':
list slotdefs in offset order rather than sorting them (closes #17610)
http://hg.python.org/cpython/rev/9431a092b708

New changeset 96c0efe93774 by Benjamin Peterson in branch 'default':
merge 3.3 (#17610)
http://hg.python.org/cpython/rev/96c0efe93774

Thanks for the report. I fixed the 3.3 and 3.4 branches. If you felt motivated to do the associated shuffling around in 2.7, I would accept a patch.

Thank you for the fix, attaching a patch for 2.7.

New changeset eaff15532b3c by Benjamin Peterson in branch '2.7':
list slotdefs in offset order rather than sorting them (closes #17610)
http://hg.python.org/cpython/rev/eaff15532b3c