Searched defs:iter (Results 1 - 6 of 6) sorted by path

/mm/
H A Dfilemap.c1167 struct radix_tree_iter iter; local
1174 radix_tree_for_each_slot(slot, &mapping->page_tree, &iter, start) {
1199 indices[ret] = iter.index;
1227 struct radix_tree_iter iter; local
1236 radix_tree_for_each_slot(slot, &mapping->page_tree, &iter, start) {
1250 WARN_ON(iter.index);
1294 struct radix_tree_iter iter; local
1303 radix_tree_for_each_contig(slot, &mapping->page_tree, &iter, index) {
1342 if (page->mapping == NULL || page->index != iter.index) {
1370 struct radix_tree_iter iter; local
1467 do_generic_file_read(struct file *filp, loff_t *ppos, struct iov_iter *iter, ssize_t written) argument
1695 generic_file_read_iter(struct kiocb *iocb, struct iov_iter *iter) argument
1993 struct radix_tree_iter iter; local
[all...]
H A Dinternal.h297 static inline struct page *mem_map_next(struct page *iter, argument
306 return iter + 1;
H A Dmemcontrol.c1130 mem_cgroup_iter_load(struct mem_cgroup_reclaim_iter *iter, argument
1144 if (iter->last_dead_count == *sequence) {
1146 position = iter->last_visited;
1161 static void mem_cgroup_iter_update(struct mem_cgroup_reclaim_iter *iter, argument
1176 iter->last_visited = new_position;
1178 iter->last_dead_count = sequence;
1222 struct mem_cgroup_reclaim_iter *uninitialized_var(iter);
1229 iter = &mz->reclaim_iter[reclaim->priority];
1230 if (prev && reclaim->generation != iter->generation) {
1231 iter
1630 struct mem_cgroup *iter; local
1688 struct mem_cgroup *iter; local
1726 struct mem_cgroup *iter; local
1998 struct mem_cgroup *iter, *failed = NULL; local
2037 struct mem_cgroup *iter; local
2048 struct mem_cgroup *iter; local
2056 struct mem_cgroup *iter; local
2487 struct mem_cgroup *iter; local
4007 struct mem_cgroup *iter; local
4362 struct mem_cgroup *iter; local
4588 struct mem_cgroup *iter; local
5512 struct cgroup_subsys_state *iter; local
[all...]
H A Dpage_alloc.c6166 unsigned long pfn, iter, found; local
6180 for (found = 0, iter = 0; iter < pageblock_nr_pages; iter++) {
6181 unsigned long check = pfn + iter;
6194 iter = round_up(iter + 1, 1<<compound_order(page)) - 1;
6206 iter += (1 << page_order(page)) - 1;
H A Dprocess_vm_access.c29 * @iter: where to copy to/from locally
36 struct iov_iter *iter,
40 while (len && iov_iter_count(iter)) {
49 copied = copy_page_from_iter(page, offset, copy, iter);
52 copied = copy_page_to_iter(page, offset, copy, iter);
55 if (copied < copy && iov_iter_count(iter))
69 * @iter: where to copy to/from locally
79 struct iov_iter *iter,
97 while (!rc && nr_pages && iov_iter_count(iter)) {
115 start_offset, bytes, iter,
33 process_vm_rw_pages(struct page **pages, unsigned offset, size_t len, struct iov_iter *iter, int vm_write) argument
77 process_vm_rw_single_vec(unsigned long addr, unsigned long len, struct iov_iter *iter, struct page **process_pages, struct mm_struct *mm, struct task_struct *task, int vm_write) argument
144 process_vm_rw_core(pid_t pid, struct iov_iter *iter, const struct iovec *rvec, unsigned long riovcnt, unsigned long flags, int vm_write) argument
261 struct iov_iter iter; local
324 struct iov_iter iter; local
[all...]
H A Dshmem.c1840 struct radix_tree_iter iter; local
1850 radix_tree_for_each_slot(slot, &mapping->page_tree, &iter, start) {
1857 radix_tree_tag_set(&mapping->page_tree, iter.index,
1864 start = iter.index + 1;
1882 struct radix_tree_iter iter; local
1903 radix_tree_for_each_tagged(slot, &mapping->page_tree, &iter,
1929 iter.index, SHMEM_TAG_PINNED);
1934 start = iter.index + 1;

Completed in 312 milliseconds