69 	unit_assert(r->available == r->first_size - s);  in corner_cases()
78 	unit_assert(r->available == r->first_size - s);  in corner_cases()
85 	unit_assert(r->available == r->first_size - s);  in corner_cases()
91 	unit_assert(r->available == r->first_size - s);  in corner_cases()
97 	unit_assert(r->available == r->first_size - s);  in corner_cases()
105 	unit_assert(r->available == r->first_size - s);  in corner_cases()
109 	while(r->available > 1024) {  in corner_cases()
114 		unit_assert(r->available == r->first_size - s);  in corner_cases()
125 	while(r->available > 864) {  in corner_cases()
132 	mysize = r->available; /* exactly fits */  in corner_cases()
136 	unit_assert(r->available == 0); /* implementation does not go ahead*/  in corner_cases()
141 	unit_assert(r->available == 0);  in corner_cases()
147 	unit_assert(r->available > 0);  in corner_cases()
151 	while(r->available > 1320) {  in corner_cases()
158 	mysize = r->available + 8; /* exact + 8 ; does not fit */  in corner_cases()
162 	unit_assert(r->available > 0); /* new chunk */  in corner_cases()
165 	while(r->available > 1480) {  in corner_cases()
172 	mysize = r->available - 8; /* exact - 8 ; fits. */  in corner_cases()
176 	unit_assert(r->available == 8);  in corner_cases()