|
|
@ -1779,10 +1779,6 @@ mdb_page_dirty(MDB_txn *txn, MDB_page *mp) |
|
|
|
static int |
|
|
|
static int |
|
|
|
mdb_page_alloc(MDB_cursor *mc, int num, MDB_page **mp) |
|
|
|
mdb_page_alloc(MDB_cursor *mc, int num, MDB_page **mp) |
|
|
|
{ |
|
|
|
{ |
|
|
|
/* use PARANOID for now, default infinite search slows down too much
|
|
|
|
|
|
|
|
* when the freelist is large |
|
|
|
|
|
|
|
*/ |
|
|
|
|
|
|
|
#define MDB_PARANOID |
|
|
|
|
|
|
|
#ifdef MDB_PARANOID /* Seems like we can ignore this now */ |
|
|
|
#ifdef MDB_PARANOID /* Seems like we can ignore this now */ |
|
|
|
/* Get at most <Max_retries> more freeDB records once me_pghead
|
|
|
|
/* Get at most <Max_retries> more freeDB records once me_pghead
|
|
|
|
* has enough pages. If not enough, use new pages from the map. |
|
|
|
* has enough pages. If not enough, use new pages from the map. |
|
|
@ -1827,7 +1823,7 @@ mdb_page_alloc(MDB_cursor *mc, int num, MDB_page **mp) |
|
|
|
if (mop[i-n2] == pgno+n2) |
|
|
|
if (mop[i-n2] == pgno+n2) |
|
|
|
goto search_done; |
|
|
|
goto search_done; |
|
|
|
} while (--i > n2); |
|
|
|
} while (--i > n2); |
|
|
|
if (Max_retries < INT_MAX && --retry < 0) |
|
|
|
if (--retry < 0) |
|
|
|
break; |
|
|
|
break; |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|