libarchive/libarchive/archive_read_support_format_mtree.c

273 	ssize_t len;
275 	len = 0;
276 	while (len < avail) {
283 			if (avail-len > 1 && b[1] == '\n') {
286 				return (len+2);
292 			return (len+1);
295 			len++;
308 	ssize_t len;
314 		len = 0;
316 		len = get_line_size(*b, *avail, nl);
320 	while (*nl == 0 && len == *avail && !quit) {
341 		tested = len;/* Skip some bytes we already determinated. */
342 		len = get_line_size(*b, *avail, nl);
343 		if (len >= 0)
344 			len += tested;
346 	return (len);
355 bid_keycmp(const char *p, const char *key, ssize_t len)
359 	while (len > 0 && *p && *key) {
361 			--len;
386 bid_keyword(const char *p,  ssize_t len)
440 		int l = bid_keycmp(p, keys[i], len);
455 bid_keyword_list(const char *p,  ssize_t len, int unset, int last_is_path)
460 	while (len > 0 && *p) {
464 		while (len >0 && (*p == ' ' || *p == '\t')) {
466 			--len;
475 		if (last_is_path && len == 0)
479 			l = bid_keycmp(p, "all", len);
484 		l = bid_keyword(p, len);
488 		len -= l;
495 			--len;
496 			while (len > 0 && *p != ' ' && *p != '\t') {
498 				--len;
511 bid_entry(const char *p, ssize_t len, ssize_t nl, int *last_is_path)
540 	const char * const pp_end = pp + len;
561 		const char *pb = p + len - nl;
588 		ll = len - nl - name_len;
625 	ssize_t detected_bytes = 0, len, nl;
637 		len = next_line(a, &p, &avail, &ravail, &nl);
640 		if (len <= 0 || nl == 0)
645 			while (len > 0 && (*p == ' ' || *p == '\t')) {
648 				--len;
652 				p += len;
653 				avail -= len;
659 			if (bid_keyword_list(p, len, 0, 0) <= 0)
662 				detected_bytes += len;
663 			if (p[len-nl-1] != '\\') {
669 			p += len;
670 			avail -= len;
676 			keywords = bid_entry(p, len, nl, &last_is_path);
678 				detected_bytes += len;
692 				if (!last_is_path && p[len-nl-1] == '\\')
705 			if (bid_keyword_list(p+4, len-4, 0, 0) <= 0)
708 			if (p[len-nl-1] == '\\')
711 			if (bid_keyword_list(p+6, len-6, 1, 0) <= 0)
714 			if (p[len-nl-1] == '\\')
720 		p += len;
721 		avail -= len;
723 	if (entry_cnt >= MAX_BID_ENTRY || (entry_cnt > 0 && len == 0)) {
747     const char *value, size_t len)
755 	if ((opt->value = malloc(len + 1)) == NULL) {
760 	memcpy(opt->value, value, len);
761 	opt->value[len] = '\0';
768 remove_option(struct mtree_option **global, const char *value, size_t len)
774 		if (strncmp(iter->value, value, len) == 0 &&
775 		    (iter->value[len] == '\0' ||
776 		     iter->value[len] == '='))
795 	size_t len;
807 			len = next - line;
809 			len = eq - line;
811 		remove_option(global, line, len);
824 	size_t len;
838 		len = strcspn(line, " \t\r\n");
840 		if (len == 3 && strncmp(line, "all", 3) == 0) {
844 			remove_option(global, line, len);
847 		line += len;
859 	size_t name_len, len;
941 			len = next - line;
943 			len = eq - line;
945 		remove_option(&entry->options, line, len);
956 	ssize_t len;
972 		len = readline(a, mtree, &p, 65536);
973 		if (len == 0) {
978 		if (len < 0) {
980 			return ((int)len);
985 			--len;
993 			r = process_add_entry(a, mtree, &global, p, len,