libarchive/libarchive/archive_read.c

562 	ssize_t avail;
585 			__archive_read_filter_ahead(a->filter, 1, &avail);
586 			if (avail < 0) {
1300  *  * If 'avail' pointer is provided, that returns number of bytes available
1302  *  * If end-of-file, *avail gets set to zero.
1303  *  * If error, *avail gets error code.
1308  * to *avail, which will have the actual amount available.  If you
1316 __archive_read_ahead(struct archive_read *a, size_t min, ssize_t *avail)
1318 	return (__archive_read_filter_ahead(a->filter, min, avail));
1323     size_t min, ssize_t *avail)
1329 		if (avail)
1330 			*avail = ARCHIVE_FATAL;
1345 		if (filter->avail >= min && filter->avail > 0) {
1346 			if (avail != NULL)
1347 				*avail = filter->avail;
1355 		if (filter->client_total >= filter->client_avail + filter->avail
1356 		    && filter->client_avail + filter->avail >= min) {
1358 			filter->client_avail += filter->avail;
1359 			filter->client_next -= filter->avail;
1361 			filter->avail = 0;
1364 			if (avail != NULL)
1365 				*avail = filter->client_avail;
1372 			if (filter->avail > 0)
1374 				    filter->avail);
1381 				if (avail != NULL)
1382 					*avail = 0;
1392 				if (avail != NULL)
1393 					*avail = ARCHIVE_FATAL;
1411 				if (avail != NULL)
1412 					*avail = filter->avail;
1444 						if (avail != NULL)
1445 							*avail = ARCHIVE_FATAL;
1458 					if (avail != NULL)
1459 						*avail = ARCHIVE_FATAL;
1463 				if (filter->avail > 0)
1464 					memmove(p, filter->next, filter->avail);
1473 			    - (filter->next + filter->avail);
1475 			if (tocopy + filter->avail > min)
1476 				tocopy = min - filter->avail;
1481 			memcpy(filter->next + filter->avail,
1487 			filter->avail += tocopy;
1542 	if (filter->avail > 0) {
1543 		min = (size_t)minimum(request, (int64_t)filter->avail);
1545 		filter->avail -= min;
1746 		filter->avail = filter->client_avail = 0;