Searched full:eligible (Results 1 – 25 of 137) sorted by relevance
123456
| /linux-6.12.1/Documentation/devicetree/bindings/dma/ |
| D | arm-pl08x.yaml | 57 description: if AHB master 1 is eligible for fetching LLIs
61 description: if AHB master 2 is eligible for fetching LLIs
65 description: if AHB master 1 is eligible for fetching memory contents
69 description: if AHB master 2 is eligible for fetching memory contents
|
| D | stericsson,dma40.yaml | 151 engine are eligible for memcpy transfers
|
| /linux-6.12.1/net/sched/ |
| D | sch_hfsc.c | 127 struct rb_node el_node; /* qdisc's eligible tree member */
138 u64 cl_e; /* eligible time */
158 struct runtime_sc cl_eligible; /* eligible curve */
172 struct rb_root eligible; /* eligible tree */ member
180 * eligible tree holds backlogged classes being sorted by their eligible times.
181 * there is one eligible tree per hfsc instance.
187 struct rb_node **p = &cl->sched->eligible.rb_node; in eltree_insert()
200 rb_insert_color(&cl->el_node, &cl->sched->eligible); in eltree_insert()
206 rb_erase(&cl->el_node, &cl->sched->eligible); in eltree_remove()
216 /* find the class with the minimum deadline among the eligible classes */
[all …]
|
| D | sch_qfq.c | 751 /* if S > V we are not eligible */ in qfq_calc_state()
815 mask = ~0UL; /* make all groups eligible */ in qfq_make_eligible()
835 * happens that the aggregate becomes backlogged and eligible, or just
836 * eligible, while an aggregate with a higher approximated finish time
1339 /* update V: to be in service, agg must be eligible */ in qfq_activate_agg()
|
| D | sch_cake.c | 1186 /* only TCP packets with matching 5-tuple are eligible, and only in cake_ack_filter()
1215 /* If the ECE/CWR flags changed from the previous eligible in cake_ack_filter()
1250 /* At this point we have found an eligible pure ACK to drop; if in cake_ack_filter()
1252 * searching unless this is the second eligible ACK we in cake_ack_filter()
1256 * save the first eligible ACK we find, even if we need to loop in cake_ack_filter()
1270 /* We made it through the queue without finding two eligible ACKs . If in cake_ack_filter()
1271 * we found a single eligible ACK we can drop it in aggressive mode if in cake_ack_filter()
1274 * packet is consecutive with the eligible ACK, and their flags match. in cake_ack_filter()
|
| /linux-6.12.1/block/ |
| D | bfq-wf2q.c | 88 * sd->next_in_service, is eligible and has a lower virtual in bfq_update_next_in_service()
478 * the eligible node with the lowest finish time in logarithmic time.
1261 * if needed, to have at least one entity eligible.
1285 * bfq_first_active_entity - find the eligible entity with
1292 * a subtree with at least one eligible (start <= vtime) entity. The path on
1293 * the right is followed only if a) the left subtree contains no eligible
1294 * entities and b) no eligible entity has been found yet.
1325 * __bfq_lookup_next_entity - return the first eligible entity in @st.
1345 * 2) is not eligible any more, or
1359 * least one entity is eligible. in __bfq_lookup_next_entity()
[all …]
|
| /linux-6.12.1/Documentation/devicetree/bindings/sound/ |
| D | fsl,audmix.yaml | 33 in TDM frame to be eligible for mixing.
|
| /linux-6.12.1/Documentation/scheduler/ |
| D | sched-eevdf.rst | 5 The "Earliest Eligible Virtual Deadline First" (EEVDF) was first introduced
|
| D | sched-design-CFS.rst | 197 This function chooses the most appropriate task eligible to run next.
|
| /linux-6.12.1/kernel/sched/ |
| D | features.h | 43 * By delaying the dequeue for non-eligible tasks, they remain in the
|
| D | cpupri.c | 17 * are not eligible for routing. The system maintains this state with
|
| /linux-6.12.1/Documentation/translations/sp_SP/scheduler/ |
| D | sched-eevdf.rst | 11 El gestor de tareas EEVDF, del inglés: "Earliest Eligible Virtual Deadline
|
| /linux-6.12.1/include/uapi/linux/ |
| D | auto_dev-ioctl.h | 150 /* Check for eligible expire candidates */
|
| /linux-6.12.1/arch/powerpc/include/asm/ |
| D | topology.h | 15 * all zones on all nodes will be eligible for zone_reclaim().
|
| /linux-6.12.1/include/linux/pds/ |
| D | pds_intr.h | 58 * the interrupt resource is again eligible to
|
| /linux-6.12.1/include/soc/fsl/ |
| D | dpaa2-global.h | 50 /* FQ force eligible */
|
| /linux-6.12.1/drivers/s390/crypto/ |
| D | zcrypt_ep11misc.h | 138 * reply to each apqn eligible.
|
| D | zcrypt_api.c | 694 /* check if device is usable and eligible */ in zcrypt_rsa_modexpo()
798 /* check if device is usable and eligible */ in zcrypt_rsa_crt()
917 /* check for device usable and eligible */ in _zcrypt_send_cprb()
1113 /* check if device is usable and eligible */ in _zcrypt_send_ep11_cprb()
1233 /* check if device is usable and eligible */ in zcrypt_rng()
|
| /linux-6.12.1/fs/autofs/ |
| D | expire.c | 412 * Find an eligible tree to time-out
413 * A tree is eligible if :-
|
| /linux-6.12.1/mm/ |
| D | workingset.c | 179 * On cache misses for which there are shadow entries, an eligible
678 * node for every eligible shadow entry, so compromise on a in count_shadow_nodes()
679 * worst-case density of 1/8th. Below that, not all eligible in count_shadow_nodes()
|
| /linux-6.12.1/scripts/gcc-plugins/ |
| D | structleak_plugin.c | 6 * NOT 'eligible' as defined by gcc's library exception to the GPL v3,
|
| /linux-6.12.1/drivers/net/ethernet/freescale/dpaa2/ |
| D | dpsw.h | 291 * @dei: Drop Eligible Indicator (DEI): a 1-bit field. May be used
293 * eligible to be dropped in the presence of congestion
|
| /linux-6.12.1/Documentation/block/ |
| D | blk-mq.rst | 95 eligible to be sent to the hardware. One of the possible schedulers to be
|
| /linux-6.12.1/drivers/cpuidle/ |
| D | cpuidle-powernv.c | 266 /* TODO: Count only states which are eligible for cpuidle */ in powernv_add_idle_states()
|
| /linux-6.12.1/tools/perf/pmu-events/arch/powerpc/power10/ |
| D | marked.json | 185 …"BriefDescription": "The marked instruction was dependent on a load. It is eligible for issue kill…
|
123456