Lines Matching refs: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;
190 /** pointer to the lowest free block, this is used for faster search */
243   LWIP_ASSERT("plug_holes: mem->used == 0", mem->used == 0);
249   if (mem != nmem && nmem->used == 0 && (u8_t *)nmem != (u8_t *)ram_end) {
260   if (pmem != mem && pmem->used == 0) {
287   mem->used = 0;
290   ram_end->used = 1;
338   /* ... which has to be in a used state ... */
339   LWIP_ASSERT("mem_free: mem->used", mem->used);
341   mem->used = 0;
348   MEM_STATS_DEC_USED(used, mem->next - (mem_size_t)(((u8_t *)mem - ram)));
422   if(mem2->used == 0) {
433     mem2->used = 0;
446     MEM_STATS_DEC_USED(used, (size - newsize));
449     /* Next struct is used but there's room for another struct mem with
461     mem2->used = 0;
468     MEM_STATS_DEC_USED(used, (size - newsize));
469     /* the original mem->next is used, so no need to plug holes! */
472     next struct mem is used but size between mem and mem2 is not big enough
548       if ((!mem->used) &&
550         /* mem is not used and at least perfect fit is possible:
567           mem2->used = 0;
572           mem->used = 1;
577           MEM_STATS_INC_USED(used, (size + SIZEOF_STRUCT_MEM));
580            * be used at this point: if not we have 2 unused structs in a row, plug_holes should have
584            * will always be used at this point!
586           mem->used = 1;
587           MEM_STATS_INC_USED(used, mem->next - (mem_size_t)((u8_t *)mem - ram));
595           while (cur->used && cur != ram_end) {
610           LWIP_ASSERT("mem_malloc: !lfree->used", ((lfree == ram_end) || (!lfree->used)));