Searched refs:end_pos (Results 1 - 21 of 21) sorted by relevance

/linux-master/include/linux/
H A Dregset.h256 const int start_pos, const int end_pos)
261 if (end_pos < 0 || *pos < end_pos) {
262 unsigned int copy = (end_pos < 0 ? *count
263 : min(*count, end_pos - *pos));
283 const int end_pos)
288 if (end_pos < 0 || *pos < end_pos) {
289 unsigned int copy = (end_pos < 0 ? *count
290 : min(*count, end_pos
253 user_regset_copyin(unsigned int *pos, unsigned int *count, const void **kbuf, const void __user **ubuf, void *data, const int start_pos, const int end_pos) argument
[all...]
H A Dbpf_verifier.h588 * Once truncation starts to happen, start_pos + len_total == end_pos,
589 * except during log reset situations, in which (end_pos - start_pos)
591 * Generally, (end_pos - start_pos) gives number of useful data in
595 u64 end_pos; member in struct:bpf_verifier_log
/linux-master/kernel/bpf/
H A Dlog.c48 u64 len = log->end_pos + add_len;
81 if (log->end_pos < log->len_total) {
82 new_n = min_t(u32, log->len_total - log->end_pos, n);
86 cur_pos = log->end_pos;
87 log->end_pos += n - 1; /* don't count terminating '\0' */
96 new_end = log->end_pos + n;
103 log->end_pos = new_end - 1; /* don't count terminating '\0' */
154 if (WARN_ON_ONCE(new_pos > log->end_pos))
162 * start_pos to end up with an empty log (start_pos == end_pos)
164 log->end_pos
[all...]
H A Dverifier.c1718 elem->log_pos = env->log.end_pos;
2428 elem->log_pos = env->log.end_pos;
17833 env->prev_log_pos = env->log.end_pos;
17836 env->prev_insn_print_pos = env->log.end_pos - env->prev_log_pos;
17837 env->prev_log_pos = env->log.end_pos;
/linux-master/fs/bcachefs/
H A Dfs-io.c255 u64 end_pos; local
328 end_pos = folio_end_pos(folio);
330 end_pos = min_t(u64, inode->v.i_size, end_pos);
331 ret = s->s[folio_pos_to_s(folio, end_pos - 1)].state >= SECTOR_dirty;
592 struct bpos end_pos = POS(inode->v.i_ino, end_sector); local
602 while (!ret && bkey_lt(iter.pos, end_pos)) {
625 hole_end = bpos_min(k.k->p, end_pos).offset;
H A Dio_misc.c144 struct bpos end_pos = POS(inum.inum, end); local
169 k = bch2_btree_iter_peek_upto(iter, end_pos);
182 bch2_cut_back(end_pos, &delete);
H A Dbcachefs_ioctl.h211 struct bpos end_pos; member in struct:bch_ioctl_data
H A Dbtree_journal_iter.c81 struct bpos end_pos, size_t *idx)
93 __journal_key_cmp(btree_id, level, end_pos, idx_to_key(keys, *idx - 1)) <= 0) {
103 if (__journal_key_cmp(btree_id, level, end_pos, k) < 0)
79 bch2_journal_keys_peek_upto(struct bch_fs *c, enum btree_id btree_id, unsigned level, struct bpos pos, struct bpos end_pos, size_t *idx) argument
H A Dmove.c1065 struct bbpos end = BBPOS(op.end_btree, op.end_pos);
H A Dbtree_iter.c2075 struct bpos end_pos)
2082 end_pos,
2073 bch2_btree_journal_peek(struct btree_trans *trans, struct btree_iter *iter, struct bpos end_pos) argument
/linux-master/kernel/
H A Drelay.c1017 size_t read_subbuf, padding, end_pos; local
1024 end_pos = (read_subbuf + 1) * subbuf_size;
1026 end_pos = read_pos + count;
1027 if (end_pos >= subbuf_size * n_subbufs)
1028 end_pos = 0;
1030 return end_pos;
H A Dkcov.c233 u64 count, start_index, end_pos, max_pos; local
252 end_pos = (start_index + KCOV_WORDS_PER_CMP) * sizeof(u64);
253 if (likely(end_pos <= max_pos)) {
/linux-master/fs/iomap/
H A Dbuffered-io.c1837 * i_size, adjust end_pos and zero all data beyond i_size.
1840 u64 *end_pos)
1844 if (*end_pos > isize) {
1885 *end_pos = round_up(isize, i_blocksize(inode));
1897 u64 end_pos = pos + folio_size(folio); local
1908 if (!iomap_writepage_handle_eof(folio, inode, &end_pos)) {
1912 WARN_ON_ONCE(end_pos <= pos);
1917 iomap_set_range_dirty(folio, 0, end_pos - pos);
1939 while ((rlen = iomap_find_dirty_range(folio, &pos, end_pos))) {
1839 iomap_writepage_handle_eof(struct folio *folio, struct inode *inode, u64 *end_pos) argument
/linux-master/fs/fuse/
H A Ddax.c870 loff_t end_pos = (start_pos + FUSE_DAX_SZ - 1); local
872 ret = filemap_fdatawrite_range(inode->i_mapping, start_pos, end_pos);
874 pr_debug("fuse: filemap_fdatawrite_range() failed. err=%d start_pos=0x%llx, end_pos=0x%llx\n",
875 ret, start_pos, end_pos);
881 end_pos >> PAGE_SHIFT);
/linux-master/fs/ubifs/
H A Dfile.c533 loff_t end_pos = pos + len; local
534 int appending = !!(end_pos > inode->i_size);
572 i_size_write(inode, end_pos);
573 ui->ui_size = end_pos;
/linux-master/fs/xfs/scrub/
H A Dxfarray.c292 loff_t end_pos = *pos + array->obj_size - 1; local
313 new_pos = xfile_seek_data(array->xfile, end_pos);
318 if (new_pos == end_pos)
/linux-master/fs/nfs/
H A Dpnfs.c3149 loff_t end_pos)
3156 nfsi->layout->plh_lwb = end_pos;
3160 } else if (end_pos > nfsi->layout->plh_lwb)
3161 nfsi->layout->plh_lwb = end_pos;
3167 dprintk("%s: lseg %p end_pos %llu\n",
3200 loff_t end_pos; local
3234 end_pos = nfsi->layout->plh_lwb;
3244 if (end_pos != 0)
3245 data->args.lastbytewritten = end_pos - 1;
3256 if (end_pos > nfs
3148 pnfs_set_layoutcommit(struct inode *inode, struct pnfs_layout_segment *lseg, loff_t end_pos) argument
[all...]
/linux-master/fs/btrfs/
H A Dfile.c136 u64 end_pos = pos + write_bytes; local
182 if (end_pos > isize)
183 i_size_write(&inode->vfs_inode, end_pos);
1180 loff_t end_pos = round_up(pos + count, fs_info->sectorsize); local
1182 ret = btrfs_cont_expand(BTRFS_I(inode), oldsize, end_pos);
/linux-master/include/trace/events/
H A Df2fs.h957 TP_PROTO(struct inode *dir, loff_t start_pos, loff_t end_pos, int err),
959 TP_ARGS(dir, start_pos, end_pos, err),
973 __entry->end = end_pos;
977 TP_printk("dev = (%d,%d), ino = %lu, start_pos:%llu, end_pos:%llu, err:%d",
/linux-master/fs/f2fs/
H A Dfile.c4728 loff_t start_pos, loff_t end_pos)
4732 ret = filemap_write_and_wait_range(mapping, start_pos, end_pos);
4737 end_pos >> PAGE_SHIFT);
4727 f2fs_flush_buffered_write(struct address_space *mapping, loff_t start_pos, loff_t end_pos) argument
/linux-master/scripts/
H A Dcheckpatch.pl3520 my $end_pos = $+[2];
3533 $end_char = substr($rawline, $end_pos, 1) if ($end_pos < length($rawline));

Completed in 569 milliseconds