Home
last modified time | relevance | path

Searched refs:iterator (Results 1 – 25 of 69) sorted by relevance

123

/linux/drivers/gpu/drm/
H A Ddrm_print.c81 struct drm_print_iterator *iterator = p->arg; in __drm_puts_coredump() local
84 if (!iterator->remain) in __drm_puts_coredump()
87 if (iterator->offset < iterator->start) { in __drm_puts_coredump()
92 if (iterator->offset + len <= iterator->start) { in __drm_puts_coredump()
93 iterator->offset += len; in __drm_puts_coredump()
97 copy = len - (iterator->start - iterator->offset); in __drm_puts_coredump()
99 if (copy > iterator->remain) in __drm_puts_coredump()
100 copy = iterator->remain; in __drm_puts_coredump()
103 if (iterator->data) in __drm_puts_coredump()
104 memcpy(iterator->data, in __drm_puts_coredump()
[all …]
/linux/scripts/coccinelle/iterators/
H A Duse_after_iter.cocci2 /// If list_for_each_entry, etc complete a traversal of the list, the iterator
5 /// the end of the iterator.
6 //#False positives arise when there is a goto in the iterator and the
24 iterator name list_for_each_entry;
25 iterator name list_for_each_entry_reverse;
26 iterator name list_for_each_entry_continue;
27 iterator name list_for_each_entry_continue_reverse;
28 iterator name list_for_each_entry_from;
29 iterator name list_for_each_entry_safe;
30 iterator name list_for_each_entry_safe_continue;
[all …]
H A Dfor_each_child.cocci2 // Adds missing of_node_put() before return/break/goto statement within a for_each iterator for chi…
19 iterator name for_each_node_by_name, for_each_node_by_type,
23 iterator i;
53 iterator r.i,i1;
82 iterator r.i,i1,i2;
114 iterator r.i,i1,i2;
151 iterator r.i, i1;
174 iterator r.i;
189 iterator r.i, i1, i2;
220 iterator r.i, i2;
[all …]
H A Ditnull.cocci23 iterator I;
66 iterator I;
86 cocci.print_main("iterator-bound variable",p1)
94 msg = "ERROR: iterator variable bound on line %s cannot be NULL" % (p1[0].line)
H A Dlist_entry_update.cocci20 iterator name list_for_each_entry;
54 cocci.print_main("iterator",p1)
62 msg = "iterator with update on line %s" % (p2[0].line)
H A Ddevice_node_continue.cocci22 iterator name for_each_node_by_name, for_each_node_by_type,
26 iterator i;
62 iterator i;
/linux/drivers/net/wireless/realtek/rtw88/
H A Dutil.h10 #define rtw_iterate_vifs_atomic(rtwdev, iterator, data) \ argument
12 IEEE80211_IFACE_ITER_NORMAL, iterator, data)
13 #define rtw_iterate_stas_atomic(rtwdev, iterator, data) \ argument
14 ieee80211_iterate_stations_atomic(rtwdev->hw, iterator, data)
15 #define rtw_iterate_keys(rtwdev, vif, iterator, data) \ argument
16 ieee80211_iter_keys(rtwdev->hw, vif, iterator, data)
17 #define rtw_iterate_keys_rcu(rtwdev, vif, iterator, data) \ argument
18 ieee80211_iter_keys_rcu((rtwdev)->hw, vif, iterator, data)
21 void (*iterator)(void *data, struct ieee80211_vif *vif),
24 void (*iterator)(void *data,
H A Dutil.c133 void (*iterator)(void *data, in rtw_iterate_stas()
154 iterator(data, sta_entry->sta); in rtw_iterate_stas()
183 void (*iterator)(void *data, struct ieee80211_vif *vif), in rtw_iterate_vifs()
204 iterator(data, vif_entry->vif); in rtw_iterate_vifs()
/linux/Documentation/bpf/
H A Dbpf_iterators.rst26 The BPF iterator solves the above problem by providing flexibility on what data
34 A BPF iterator is a type of BPF program that allows users to iterate over
40 For example, users can define a BPF iterator that iterates over every task on
42 them. Another BPF task iterator may instead dump the cgroup information for each
53 triggered in the main kernel. For BPF iterator programs, a ``bpf_link`` to the
66 a BPF iterator program. To begin, we’ll look at `bpf_iter.c
71 Loading a BPF iterator in the kernel from user space typically involves the
79 * Next, obtain a BPF iterator file descriptor (``bpf_iter_fd``) by calling the
83 * Close the iterator fd using ``close(bpf_iter_fd)``.
86 The following are a few examples of selftest BPF iterator programs:
[all …]
/linux/tools/bpf/bpftool/Documentation/
H A Dbpftool-iter.rst35 A bpf iterator combines a kernel iterating of particular kernel data (e.g.,
37 (e.g., one task, one bpf_map, etc.). User space can *read* kernel iterator
40 The *pin* command creates a bpf iterator from *OBJ*, and pin it to *PATH*.
44 Map element bpf iterator requires an additional parameter *MAP* so bpf
49 User can then *cat PATH* to see the bpf iterator output.
64 Create a file-based bpf iterator from bpf_iter_netlink.o and pin it
71 Create a file-based bpf iterator from bpf_iter_hashmap.o and map with
/linux/drivers/soc/fsl/qbman/
H A Dqman_test_stash.c170 struct hp_handler *iterator; member
454 hp_cpu->iterator = list_first_entry( in init_phase2()
458 hp_cpu->iterator = list_entry( in init_phase2()
459 hp_cpu->iterator->node.next, in init_phase2()
462 hp_cpu->iterator->fqid_rx = fqid; in init_phase2()
469 hp_cpu->iterator->fqid_tx = fqid; in init_phase2()
471 hp_cpu->iterator->rx_mixer = lfsr; in init_phase2()
474 hp_cpu->iterator->tx_mixer = lfsr; in init_phase2()
497 hp_cpu->iterator = list_first_entry( in init_phase3()
501 hp_cpu->iterator = list_entry( in init_phase3()
[all …]
/linux/Documentation/networking/
H A Dradiotap-headers.rst108 struct ieee80211_radiotap_iterator iterator;
109 int ret = ieee80211_radiotap_iterator_init(&iterator, buf, buflen);
113 ret = ieee80211_radiotap_iterator_next(&iterator);
120 switch (iterator.this_arg_index) {
122 * You must take care when dereferencing iterator.this_arg
124 * get_unaligned((type *)iterator.this_arg) to dereference
125 * iterator.this_arg for type "type" safely on all arches.
131 pkt_rate_100kHz = (*iterator.this_arg) * 5;
136 antenna = *iterator.this_arg);
140 pwr = *iterator.this_arg;
[all …]
/linux/Documentation/filesystems/
H A Dseq_file.rst37 * An iterator interface which lets a virtual file implementation
73 The iterator interface
77 iterator object that allows stepping through the data of interest
78 during a "session" (roughly one read() system call). If the iterator
81 in whatever way is convenient - the iterator need only exist
82 transiently during a session. If the iterator cannot easily find a
84 iterator can be stored in the private data area and continue from one
88 table, for example, could provide a simple iterator that interprets
99 The /proc/sequence iterator just uses the count of the next number it
102 Four functions must be implemented to make the iterator work. The
[all …]
/linux/Documentation/translations/zh_CN/core-api/
H A Dassoc_array.rst234 bool (*iterator)(void *object, void *iterator_data),
237 这是对一个关联数组中的对象进行迭代，并将每个对象传递给 ``iterator()`` 。如果 ``iterator()`` 返回
238 true，该对象被保留。如果它返回 ``false`` ，该对象将被释放。如果 ``iterator()`` 函数返回 ``true`` ，它必须
243 ``iterator_data`` 被直接传递给 ``iterator()`` ，否则会被函数忽略。
259 int (*iterator)(const void *object,
/linux/arch/x86/kvm/mmu/
H A Dmmu.c1364 static void rmap_walk_init_level(struct slot_rmap_walk_iterator *iterator, in rmap_walk_init_level() argument
1367 iterator->level = level; in rmap_walk_init_level()
1368 iterator->gfn = iterator->start_gfn; in rmap_walk_init_level()
1369 iterator->rmap = gfn_to_rmap(iterator->gfn, level, iterator->slot); in rmap_walk_init_level()
1370 iterator->end_rmap = gfn_to_rmap(iterator->end_gfn, level, iterator->slot); in rmap_walk_init_level()
1373 static void slot_rmap_walk_init(struct slot_rmap_walk_iterator *iterator, in slot_rmap_walk_init() argument
1378 iterator->slot = slot; in slot_rmap_walk_init()
1379 iterator->start_level = start_level; in slot_rmap_walk_init()
1380 iterator->end_level = end_level; in slot_rmap_walk_init()
1381 iterator->start_gfn = start_gfn; in slot_rmap_walk_init()
[all …]
/linux/Documentation/core-api/
H A Dfolio_queue.rst54 and to use the iterator::
174 A list of segments may be iterated over using the I/O iterator facility using
175 an ``iov_iter`` iterator of ``ITER_FOLIOQ`` type. The iterator may be
184 queue. The iov iterator functions will follow the next pointers when advancing
193 to take locks. The ITER_FOLIOQ iterator inserts appropriate barriers to aid
199 with a slot number equal to the capacity of that segment. The iterator will
202 the consumer before the iterator was advanced.
H A Dassoc_array.rst38 RCU readlock is being held by the iterator. Note, however, under these
40 problem, the iterator should lock against modification. Objects will not
257 bool (*iterator)(void *object, void *iterator_data),
261 ``iterator()``. If ``iterator()`` returns ``true``, the object is kept. If it
262 returns ``false``, the object will be freed. If the ``iterator()`` function
269 The ``iterator_data`` is passed directly to ``iterator()`` and is otherwise
288 int (*iterator)(const void *object,
292 This passes each object in the array to the iterator callback function.
302 return the result of the last iterator function called. Iteration stops
H A Didr.rst51 iterator-style idr_for_each_entry(). You may need to use
53 also use idr_get_next() if the iterator doesn't fit your needs.
/linux/include/linux/
H A Dassoc_array.h61 int (*iterator)(const void *object,
84 bool (*iterator)(void *object, void *iterator_data),
H A Dtracepoint-defs.h44 void *iterator; member
/linux/tools/testing/radix-tree/
H A Diteration_check_2.c13 static void *iterator(void *arg) in iterator() function
67 if (pthread_create(&threads[0], NULL, iterator, &array)) { in iteration_test2()
/linux/drivers/net/wireless/realtek/rtw89/
H A Dutil.h11 #define rtw89_iterate_vifs_bh(rtwdev, iterator, data) \ argument
13 IEEE80211_IFACE_ITER_NORMAL, iterator, data)
/linux/scripts/coccinelle/null/
H A Dderef_null.cocci58 iterator iter;
119 iterator iter;
179 iterator iter;
252 iterator iter;
/linux/drivers/scsi/megaraid/
H A Dmegaraid_mm.c240 int iterator; in mraid_mm_get_adapter() local
256 iterator = 0; in mraid_mm_get_adapter()
260 if (iterator++ == adapno) { in mraid_mm_get_adapter()
730 int iterator; in ioctl_done() local
752 iterator = 0; in ioctl_done()
761 if (iterator++ == adapno) { in ioctl_done()
/linux/fs/netfs/
H A DMakefile8 iterator.o \

123