30 	lws_dsh_obj_t	*best;  member
115 	    (!s->best || obj->asize < s->best->asize)) {  in search_best_free()
116 		s->best = obj;  in search_best_free()
166 	s.best = NULL;  in _lws_dsh_alloc_tail()
173 	if (!s.best) {  in _lws_dsh_alloc_tail()
180 	assert(!(((unsigned long)s.best) & (sizeof(int *) - 1)));  in _lws_dsh_alloc_tail()
182 	if (s.best->asize < asize + (2 * sizeof(*s.best))) {  in _lws_dsh_alloc_tail()
190 		lws_dll2_remove(&s.best->list);  in _lws_dsh_alloc_tail()
191 		s.best->dsh = s.dsh;  in _lws_dsh_alloc_tail()
192 		s.best->kind = kind;  in _lws_dsh_alloc_tail()
193 		s.best->size = size1 + size2;  in _lws_dsh_alloc_tail()
194 		memcpy(&s.best[1], src1, size1);  in _lws_dsh_alloc_tail()
196 			memcpy((uint8_t *)&s.best[1] + size1, src2, size2);  in _lws_dsh_alloc_tail()
199 			s.best->list.prev = replace->prev;  in _lws_dsh_alloc_tail()
200 			s.best->list.next = replace->next;  in _lws_dsh_alloc_tail()
201 			s.best->list.owner = replace->owner;  in _lws_dsh_alloc_tail()
203 				replace->prev->next = &s.best->list;  in _lws_dsh_alloc_tail()
205 				replace->next->prev = &s.best->list;  in _lws_dsh_alloc_tail()
208 				assert(!(((unsigned long)(intptr_t)(s.best)) & (sizeof(int *) - 1)));  in _lws_dsh_alloc_tail()
209 				lws_dll2_add_tail(&s.best->list, &dsh->oha[kind].owner);  in _lws_dsh_alloc_tail()
212 		assert(s.dsh->locally_free >= s.best->asize);  in _lws_dsh_alloc_tail()
213 		s.dsh->locally_free -= s.best->asize;  in _lws_dsh_alloc_tail()
214 		s.dsh->locally_in_use += s.best->asize;  in _lws_dsh_alloc_tail()
215 		dsh->oha[kind].total_size += s.best->asize;  in _lws_dsh_alloc_tail()
228 				__func__, s.best->asize, s.best->asize - asize);  in _lws_dsh_alloc_tail()
230 		s.best->asize -= asize;  in _lws_dsh_alloc_tail()
234 		obj = (lws_dsh_obj_t *)(((uint8_t *)s.best) + lws_dsh_align(s.best->asize));  in _lws_dsh_alloc_tail()
247 			s.best->list.prev = replace->prev;  in _lws_dsh_alloc_tail()
248 			s.best->list.next = replace->next;  in _lws_dsh_alloc_tail()
249 			s.best->list.owner = replace->owner;  in _lws_dsh_alloc_tail()
251 				replace->prev->next = &s.best->list;  in _lws_dsh_alloc_tail()
253 				replace->next->prev = &s.best->list;  in _lws_dsh_alloc_tail()