Cross Reference: /xsrc/external/mit/xf86-video-qxl/dist/src/mspace.c

Lines Matching refs:user_data
36 #define ABORT(user_data) abort_func(user_data)
48 void __attribute__ ((__noreturn__)) default_abort_func(void *user_data)
53 void default_print_func(void *user_data, const char *format, ...)
117 #define assert(user_data, x) if(!(x)) ABORT(user_data)
122 #define assert(user_data, x)
701   void      *user_data;
846 #define CORRUPTION_ERROR_ACTION(m) ABORT(m->user_data)
850 #define USAGE_ERROR_ACTION(m,p) ABORT(m->user_data)
1194   assert(m->user_data, (is_aligned(chunk2mem(p))) || (p->head == FENCEPOST_HEAD));
1195   assert(m->user_data, ok_address(m, p));
1202   assert(m->user_data, sp != 0);
1203   assert(m->user_data, (is_aligned(chunk2mem(p))) || (p->head == FENCEPOST_HEAD));
1204   assert(m->user_data, ok_address(m, p));
1205   assert(m->user_data, sz == m->topsize);
1206   assert(m->user_data, sz > 0);
1207   assert(m->user_data, sz == ((sp->base + sp->size) - (char*)p) - TOP_FOOT_SIZE);
1208   assert(m->user_data, pinuse(p));
1209   assert(m->user_data, !next_pinuse(p));
1215   assert(m->user_data, cinuse(p));
1216   assert(m->user_data, next_pinuse(p));
1218   assert(m->user_data, pinuse(p) || next_chunk(prev_chunk(p)) == p);
1226   assert(m->user_data, !cinuse(p));
1227   assert(m->user_data, !next_pinuse(p));
1230       assert(m->user_data, (sz & CHUNK_ALIGN_MASK) == 0);
1231       assert(m->user_data, is_aligned(chunk2mem(p)));
1232       assert(m->user_data, next->prev_foot == sz);
1233       assert(m->user_data, pinuse(p));
1234       assert(m->user_data, next == m->top || cinuse(next));
1235       assert(m->user_data, p->fd->bk == p);
1236       assert(m->user_data, p->bk->fd == p);
1239       assert(m->user_data, sz == SIZE_T_SIZE);
1249     assert(m->user_data, (sz & CHUNK_ALIGN_MASK) == 0);
1250     assert(m->user_data, sz >= MIN_CHUNK_SIZE);
1251     assert(m->user_data, sz >= s);
1253     assert(m->user_data, sz < (s + MIN_CHUNK_SIZE));
1265   assert(m->user_data, tindex == idx);
1266   assert(m->user_data, tsize >= MIN_LARGE_SIZE);
1267   assert(m->user_data, tsize >= minsize_for_tree_index(idx));
1268   assert(m->user_data, (idx == NTREEBINS-1) || (tsize < minsize_for_tree_index((idx+1))));
1272     assert(m->user_data, u->index == tindex);
1273     assert(m->user_data, chunksize(u) == tsize);
1274     assert(m->user_data, !cinuse(u));
1275     assert(m->user_data, !next_pinuse(u));
1276     assert(m->user_data, u->fd->bk == u);
1277     assert(m->user_data, u->bk->fd == u);
1279       assert(m->user_data, u->child[0] == 0);
1280       assert(m->user_data, u->child[1] == 0);
1283       assert(m->user_data, head == 0); /* only one node on chain has parent */
1285       assert(m->user_data, u->parent != u);
1286       assert(m->user_data, u->parent->child[0] == u ||
1290         assert(m->user_data, u->child[0]->parent == u);
1291         assert(m->user_data, u->child[0] != u);
1295         assert(m->user_data, u->child[1]->parent == u);
1296         assert(m->user_data, u->child[1] != u);
1300         assert(m->user_data, chunksize(u->child[0]) < chunksize(u->child[1]));
1305   assert(m->user_data, head != 0);
1314     assert(m->user_data, empty);
1325     assert(m->user_data, empty);
1333       assert(m->user_data, small_index(size) == i);
1334       assert(m->user_data, p->bk == b || chunksize(p->bk) == chunksize(p));
1388       assert(m->user_data, pinuse(q));
1393           assert(m->user_data, !bin_find(m, q));
1397           assert(m->user_data, q == m->dv || bin_find(m, q));
1398           assert(m->user_data, lastq == 0 || cinuse(lastq)); /* Not 2 consecutive free */
1422     assert(m->user_data, m->dvsize == chunksize(m->dv));
1423     assert(m->user_data, m->dvsize >= MIN_CHUNK_SIZE);
1424     assert(m->user_data, bin_find(m, m->dv) == 0);
1429     assert(m->user_data, m->topsize == chunksize(m->top));
1430     assert(m->user_data, m->topsize > 0);
1431     assert(m->user_data, bin_find(m, m->top) == 0);
1435   assert(m->user_data, total <= m->footprint);
1436   assert(m->user_data, m->footprint <= m->max_footprint);
1518         PRINT((m->user_data, "max system bytes = %10lu\n", (unsigned long)(maxfp)));
1519         PRINT((m->user_data, "system bytes     = %10lu\n", (unsigned long)(fp)));
1520         PRINT((m->user_data, "in use bytes     = %10lu\n", (unsigned long)(used)));
1541   assert((M)->user_data, S >= MIN_CHUNK_SIZE);\
1560   assert((M)->user_data, P != B);\
1561   assert((M)->user_data, P != F);\
1562   assert((M)->user_data, chunksize(P) == small_index2size(I));\
1578   assert((M)->user_data, P != B);\
1579   assert((M)->user_data, P != F);\
1580   assert((M)->user_data, chunksize(P) == small_index2size(I));\
1598     assert((M)->user_data, is_small(DVS));\
1821   assert(m->user_data, (char*)oldfirst > (char*)q);
1822   assert(m->user_data, pinuse(oldfirst));
1823   assert(m->user_data, qsize >= MIN_CHUNK_SIZE);
1919       assert(m->user_data, chunksize(v) == rsize + nb);
1958     assert(m->user_data, chunksize(v) == rsize + nb);
2100       assert(m->user_data, chunksize(p) >= nb);
2101       assert(m->user_data, (((size_t)(chunk2mem(p))) % alignment) == 0);
2118 static mstate init_user_mstate(char* tbase, size_t tsize, void *user_data) {
2130   m->user_data = user_data;
2138 mspace create_mspace_with_base(void* base, size_t capacity, int locked, void *user_data) {
2145     m = init_user_mstate((char*)base, capacity, user_data);
2178         assert(ms->user_data, chunksize(p) == small_index2size(idx));
2196           assert(ms->user_data, chunksize(p) == small_index2size(i));