Lines Matching defs:end

47 			char *end;
333 p->end = p->start;
337 p->end = p->start;
379 return p->end - p->start;
398 path_len = p->end - p->start;
422 p->end = p->buf + p->buf_len - 1;
423 p->start = p->end - path_len;
427 p->end = p->start + path_len;
438 new_len = p->end - p->start + name_len;
439 if (p->start != p->end)
446 if (p->start != p->end)
451 if (p->start != p->end)
452 *p->end++ = '/';
453 *prepared = p->end;
454 p->end += name_len;
455 *p->end = 0;
481 ret = fs_path_prepare_for_add(p, p2->end - p2->start, &prepared);
484 memcpy(prepared, p2->start, p2->end - p2->start);
529 len = p->end - p->start;
531 p->end = p->start + len;
650 p->end - p->start); \
1024 * Start with a small buffer (1 page). If later we end up needing more
1411 * receiving end.
2097 * Removes the entry from the list and adds it back to the end. This marks the
2212 dest->start, dest->end - dest->start);
2778 ref->name_len = ref->full_path->end - ref->name;
3722 * because we can end up with a circular dependency
5178 static int send_hole(struct send_ctx *sctx, u64 end)
5198 end = min_t(u64, end, sctx->cur_inode_size);
5201 return send_update_extent(sctx, offset, end - offset);
5209 while (offset < end) {
5210 u64 len = min(end - offset, read_size);
5588 u64 end;
5591 end = min_t(u64, btrfs_file_extent_end(path), sctx->cur_inode_size);
5592 if (offset >= end)
5595 if (clone_root && IS_ALIGNED(end, bs)) {
5605 offset, end - offset);
5607 ret = send_extent_data(sctx, offset, end - offset);
5609 sctx->cur_inode_next_write_offset = end;
5789 * We're now behind the left extent (treat as unchanged) or at the end
5835 const u64 end)
5856 while (search_start < end) {
5877 key.offset >= end)