...
|
...
|
@@ -269,7 +269,9 @@ void* vqm_malloc(struct vqm_block* qm, unsigned int size)
|
269
|
269
|
bucket = size2bucket( qm, &size );
|
270
|
270
|
|
271
|
271
|
if (IS_BIGBUCKET(qm, bucket)) { /* the kilo-bucket uses first-fit */
|
|
272
|
+#ifdef DBG_QM_MALLOC
|
272
|
273
|
DBG("vqm_malloc: processing a big fragment\n");
|
|
274
|
+#endif
|
273
|
275
|
for (f=qm->next_free[bucket] ; f; f=f->u.nxt_free )
|
274
|
276
|
if (f->size>=size) { /* first-fit */
|
275
|
277
|
new_chunk=f;
|
...
|
...
|
@@ -286,8 +288,13 @@ void* vqm_malloc(struct vqm_block* qm, unsigned int size)
|
286
|
288
|
if (!new_chunk) { /* no chunk can be reused; slice one from the core */
|
287
|
289
|
new_chunk=MORE_CORE( qm, bucket, size );
|
288
|
290
|
if (!new_chunk) {
|
289
|
|
- LOG(L_ERR, "vqm_malloc(%p, %d) called from %s: %s(%d)\n",
|
|
291
|
+#ifdef DBG_QM_MALLOC
|
|
292
|
+ LOG(L_DBG, "vqm_malloc(%p, %d) called from %s: %s(%d)\n",
|
290
|
293
|
qm, size, file, func, line);
|
|
294
|
+#else
|
|
295
|
+ LOG(L_DBG, "vqm_malloc(%p, %d) called from %s: %s(%d)\n",
|
|
296
|
+ qm, size);
|
|
297
|
+#endif
|
291
|
298
|
return 0;
|
292
|
299
|
}
|
293
|
300
|
}
|