51 	while ((d.len + xlen) > newsize)  in data_grow_for()
59 struct data data_copy_mem(const char *mem, int len)  in data_copy_mem()  argument
63 	d = data_grow_for(empty_data, len);  in data_copy_mem()
65 	d.len = len;  in data_copy_mem()
66 	memcpy(d.val, mem, len);  in data_copy_mem()
105 struct data data_copy_escape_string(const char *s, int len)  in data_copy_escape_string()  argument
114 	while (i < len) {  in data_copy_escape_string()
118 			q[d.len++] = c;  in data_copy_escape_string()
126 			q[d.len++] = '\a';  in data_copy_escape_string()
129 			q[d.len++] = '\b';  in data_copy_escape_string()
132 			q[d.len++] = '\t';  in data_copy_escape_string()
135 			q[d.len++] = '\n';  in data_copy_escape_string()
138 			q[d.len++] = '\v';  in data_copy_escape_string()
141 			q[d.len++] = '\f';  in data_copy_escape_string()
144 			q[d.len++] = '\r';  in data_copy_escape_string()
156 			q[d.len++] = get_oct_char(s, &i);  in data_copy_escape_string()
159 			q[d.len++] = get_hex_char(s, &i);  in data_copy_escape_string()
162 			q[d.len++] = c;  in data_copy_escape_string()
166 	q[d.len++] = '\0';  in data_copy_escape_string()
174 	while (!feof(f) && (d.len < maxlen)) {  in data_copy_file()
180 			chunksize = maxlen - d.len;  in data_copy_file()
183 		ret = fread(d.val + d.len, 1, chunksize, f);  in data_copy_file()
188 		if (d.len + ret < d.len)  in data_copy_file()
191 		d.len += ret;  in data_copy_file()
197 struct data data_append_data(struct data d, const void *p, int len)  in data_append_data()  argument
199 	d = data_grow_for(d, len);  in data_append_data()
200 	memcpy(d.val + d.len, p, len);  in data_append_data()
201 	d.len += len;  in data_append_data()
206 				  const void *p, int len)  in data_insert_at_marker()  argument
208 	d = data_grow_for(d, len);  in data_insert_at_marker()
209 	memmove(d.val + m->offset + len, d.val + m->offset, d.len - m->offset);  in data_insert_at_marker()
210 	memcpy(d.val + m->offset, p, len);  in data_insert_at_marker()
211 	d.len += len;  in data_insert_at_marker()
216 		m->offset += len;  in data_insert_at_marker()
236 	d = data_append_markers(data_append_data(d1, d2.val, d2.len), m2);  in data_merge()
240 		m2->offset += d1.len;  in data_merge()
277 struct data data_append_zeroes(struct data d, int len)  in data_append_zeroes()  argument
279 	d = data_grow_for(d, len);  in data_append_zeroes()
281 	memset(d.val + d.len, 0, len);  in data_append_zeroes()
282 	d.len += len;  in data_append_zeroes()
288 	int newlen = ALIGN(d.len, align);  in data_append_align()
289 	return data_append_zeroes(d, newlen - d.len);  in data_append_align()
297 	m->offset = d.len;  in data_add_marker()
308 	int len = d.len;  in data_is_one_string()  local
310 	if (len == 0)  in data_is_one_string()
313 	for (i = 0; i < len-1; i++)  in data_is_one_string()
317 	if (d.val[len-1] != '\0')  in data_is_one_string()