Lines Matching defs:used
35 * 3. The name of the author may not be used to endorse or promote products
161 /** 1: this area is used; 0: this area is unused */
162 u8_t used;
189 /** pointer to the lowest free block, this is used for faster search */
239 LWIP_ASSERT("plug_holes: mem->used == 0", mem->used == 0);
246 if (mem != nmem && nmem->used == 0 && (u8_t *) nmem != (u8_t *) ram_end) {
257 if (pmem != mem && pmem->used == 0) {
290 mem->used = 0;
293 ram_end->used = 1;
348 /* ... which has to be in a used state ... */
349 LWIP_ASSERT("mem_free: mem->used", mem->used);
351 mem->used = 0;
358 MEM_STATS_DEC_USED(used, mem->next - ((u8_t *) mem - ram));
434 MEM_STATS_DEC_USED(used, (size - newsize));
437 if (mem2->used == 0) {
449 mem2->used = 0;
464 /* Next struct is used but there's room for another struct mem with
476 mem2->used = 0;
483 /* the original mem->next is used, so no need to plug holes! */
486 next struct mem is used but size between mem and mem2 is not big enough
561 if ((!mem->used) && (mem->next - (ptr + SIZEOF_STRUCT_MEM)) >= size) {
562 /* mem is not used and at least perfect fit is possible:
580 mem2->used = 0;
585 mem->used = 1;
590 MEM_STATS_INC_USED(used, (size + SIZEOF_STRUCT_MEM));
593 * be used at this point: if not we have 2 unused structs in a row, plug_holes should have
597 * will always be used at this point!
599 mem->used = 1;
600 MEM_STATS_INC_USED(used, mem->next - ((u8_t *) mem - ram));
605 while (lfree->used && lfree != ram_end) {
611 LWIP_ASSERT("mem_malloc: !lfree->used",
612 ((lfree == ram_end) || (!lfree->used)));