@@ -461,7 +461,7 @@ static PyDictValues empty_values_struct = { 0, { NULL }};
461
461
#endif
462
462
463
463
static inline int
464
- get_index_from_order (PyDictObject * mp , int i )
464
+ get_index_from_order (PyDictObject * mp , Py_ssize_t i )
465
465
{
466
466
assert (mp -> ma_used <= 16 );
467
467
int shift = (int )(mp -> ma_used - 1 - i )* 4 ;
@@ -497,14 +497,13 @@ _PyDict_CheckConsistency(PyObject *op, int check_content)
497
497
498
498
if (check_content ) {
499
499
PyDictKeyEntry * entries = DK_ENTRIES (keys );
500
- Py_ssize_t i ;
501
500
502
- for (i = 0 ; i < DK_SIZE (keys ); i ++ ) {
501
+ for (Py_ssize_t i = 0 ; i < DK_SIZE (keys ); i ++ ) {
503
502
Py_ssize_t ix = dictkeys_get_index (keys , i );
504
503
CHECK (DKIX_DUMMY <= ix && ix <= usable );
505
504
}
506
505
507
- for (i = 0 ; i < usable ; i ++ ) {
506
+ for (Py_ssize_t i = 0 ; i < usable ; i ++ ) {
508
507
PyDictKeyEntry * entry = & entries [i ];
509
508
PyObject * key = entry -> me_key ;
510
509
@@ -532,7 +531,7 @@ _PyDict_CheckConsistency(PyObject *op, int check_content)
532
531
CHECK (mp -> ma_used <= SHARED_KEYS_MAX_SIZE );
533
532
/* splitted table */
534
533
int duplicate_check = 0 ;
535
- for (i = 0 ; i < mp -> ma_used ; i ++ ) {
534
+ for (Py_ssize_t i = 0 ; i < mp -> ma_used ; i ++ ) {
536
535
int index = get_index_from_order (mp , i );
537
536
CHECK ((duplicate_check & (1 <<index )) == 0 );
538
537
duplicate_check |= (1 <<index );
0 commit comments