Searched full:iteration (Results 1 – 25 of 39) sorted by relevance
12
| /Documentation/core-api/ |
| D | assoc_array.rst | 266 The internal tree will be packed down if possible as part of the iteration
297 it is possible for the iteration function to see some objects twice. If
299 iteration algorithm should not, however, miss any objects.
302 return the result of the last iterator function called. Iteration stops
303 immediately if any call to the iteration function results in a non-zero
491 Non-Recursive Iteration
495 slot in that parent that points to it. None-recursive iteration uses these to
499 The backpointers, however, make simultaneous alteration and iteration tricky.
502 Simultaneous Alteration And Iteration
518 the iteration as we won't have reached the pointer to it yet and the
[all …]
|
| D | folio_queue.rst | 16 * Folio queue iteration
171 Folio queue iteration
|
| D | idr.rst | 52 idr_for_each_entry_continue() to continue an iteration. You can
|
| D | xarray.rst | 434 the iteration. The xas_pause() function exists for this purpose.
436 is in an appropriate state to continue the iteration after the entry
438 then it is good manners to pause the iteration and reenable interrupts
|
| /Documentation/gpu/ |
| D | drm-vm-bind-locking.rst | 172 // The following list iteration needs the Gem object's
246 one of the :ref:`gpu_vm list spinlocks <Spinlock iteration>`. Once
250 iteration scheme needs to be used.
321 .. _Spinlock iteration:
365 might want to avoid also this iteration scheme. Particularly, if the
367 anticipated number of list items is small, where list iteration doesn't
369 associated with each iteration, the atomic operation overhead
370 associated with this type of iteration is, most likely, negligible. Note that
372 iteration is protected by an outer level lock or semaphore, since list
377 concurrently with list iteration.
[all …]
|
| /Documentation/networking/ |
| D | net_dim.rst | 24 iteration of the algorithm, it analyses a given sample of the data, compares it
39 Each iteration of the Net DIM algorithm follows these steps:
48 supplied to the previous iteration. The comparison step checks the difference
120 the proper state in order to move to the next iteration.
142 /* Signal net DIM work is done and it should move to next iteration */
|
| /Documentation/devicetree/bindings/net/ |
| D | aspeed,ast2600-mdio.yaml | 13 The ASPEED AST2600 MDIO controller is the third iteration of ASPEED's MDIO
|
| /Documentation/ABI/testing/ |
| D | sysfs-module | 68 Description: Read and write number of grant entries to attempt to free per iteration.
|
| /Documentation/block/ |
| D | biovecs.rst | 141 bio_vec' will contain a single-page IO vector during the iteration::
147 bio_vec' will contain a multi-page IO vector during the iteration::
|
| /Documentation/crypto/ |
| D | descore-readme.rst | 125 des iteration; above, Quick (64k) takes 21 and Small (2k) takes 37.
126 he claims to use 280k of tables but the iteration calculation seems
146 also very modified for crypt. his iteration code uses 16k
362 a specific sbox during a specific iteration.
|
| /Documentation/driver-api/cxl/ |
| D | access-coordinates.rst | 22 iterated in the same iteration loop. The assumption is made that subtle
|
| /Documentation/mm/ |
| D | multigen_lru.rst | 122 to scan PTEs, and after each iteration, it increments ``max_seq``. For
179 have been sleeping since the last iteration.
|
| /Documentation/filesystems/iomap/ |
| D | porting.rst | 60 iteration is correct from userspace.
|
| D | design.rst | 31 The iteration can involve mappings of file's logical offset ranges to
|
| /Documentation/bpf/ |
| D | map_lpm_trie.rst | 105 from leftmost leaf first. This means that iteration will return more
|
| D | bpf_iterators.rst | 81 * Trigger the iteration by calling ``read(bpf_iter_fd)`` until no data is
257 from iteration by allowing user space to configure the iterator program when it
|
| /Documentation/timers/ |
| D | no_hz.rst | 118 computationally intensive short-iteration workloads: If any CPU is
119 delayed during a given iteration, all the other CPUs will be forced to
|
| /Documentation/pcmcia/ |
| D | driver-changes.rst | 139 * device list iteration upon module removal (as of 2.6.10)
|
| /Documentation/locking/ |
| D | seqlock.rst | 222 the next iteration marker), the lockless read is transformed to a
|
| /Documentation/devicetree/bindings/mfd/ |
| D | st,stmpe.yaml | 55 Sample time per iteration
|
| /Documentation/staging/ |
| D | crc32.rst | 171 immediately, without waiting for the previous loop iteration.
|
| /Documentation/process/ |
| D | botching-up-ioctls.rst | 58 will have a second iteration or at least an extension for any given interface.
|
| /Documentation/driver-api/mtd/ |
| D | nand_ecc.rst | 580 iteration. In the last 3 statements is added to par and, if needed,
584 contains the running parity for this iteration. So instead of having:
595 (using time to measure the performance). After this iteration I was back
|
| /Documentation/userspace-api/media/v4l/ |
| D | dev-subdev.rst | 178 Formats returned by the driver during a negotiation iteration are
333 last negotiation iteration. This guarantees that the active format will
|
| /Documentation/driver-api/media/drivers/ |
| D | vidtv.rst | 218 iteration.
|
12