Home
last modified time | relevance | path

Searched full:eligible (Results 1 – 25 of 124) sorted by relevance

12345

/Linux-v6.6/Documentation/devicetree/bindings/dma/
Darm-pl08x.yaml57 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
Dstericsson,dma40.yaml151 engine are eligible for memcpy transfers
/Linux-v6.6/net/sched/
Dsch_hfsc.c127 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 …]
Dsch_qfq.c751 /* 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()
Dsch_cake.c1200 /* only TCP packets with matching 5-tuple are eligible, and only in cake_ack_filter()
1229 /* If the ECE/CWR flags changed from the previous eligible in cake_ack_filter()
1264 /* At this point we have found an eligible pure ACK to drop; if in cake_ack_filter()
1266 * searching unless this is the second eligible ACK we in cake_ack_filter()
1270 * save the first eligible ACK we find, even if we need to loop in cake_ack_filter()
1284 /* We made it through the queue without finding two eligible ACKs . If in cake_ack_filter()
1285 * we found a single eligible ACK we can drop it in aggressive mode if in cake_ack_filter()
1288 * packet is consecutive with the eligible ACK, and their flags match. in cake_ack_filter()
/Linux-v6.6/block/
Dbfq-wf2q.c88 * 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-v6.6/arch/ia64/include/asm/
Dtopology.h20 * Nodes within this distance are eligible for reclaim by zone_reclaim() when
/Linux-v6.6/Documentation/devicetree/bindings/sound/
Dfsl,audmix.txt22 in TDM frame to be eligible for mixing.
/Linux-v6.6/arch/powerpc/include/asm/
Dtopology.h15 * all zones on all nodes will be eligible for zone_reclaim().
/Linux-v6.6/include/uapi/linux/
Dauto_dev-ioctl.h150 /* Check for eligible expire candidates */
/Linux-v6.6/include/soc/fsl/
Ddpaa2-global.h50 /* FQ force eligible */
/Linux-v6.6/include/linux/pds/
Dpds_intr.h58 * the interrupt resource is again eligible to
/Linux-v6.6/drivers/s390/crypto/
Dzcrypt_ep11misc.h138 * reply to each apqn eligible.
Dzcrypt_api.c694 /* check if device is usable and eligible */ in zcrypt_rsa_modexpo()
799 /* check if device is usable and eligible */ in zcrypt_rsa_crt()
917 /* check for device usable and eligible */ in _zcrypt_send_cprb()
1088 /* check if device is usable and eligible */ in _zcrypt_send_ep11_cprb()
1187 /* check if device is usable and eligible */ in zcrypt_rng()
/Linux-v6.6/fs/autofs/
Dexpire.c415 * Find an eligible tree to time-out
416 * A tree is eligible if :-
/Linux-v6.6/mm/
Dworkingset.c178 * On cache misses for which there are shadow entries, an eligible
652 * node for every eligible shadow entry, so compromise on a in count_shadow_nodes()
653 * worst-case density of 1/8th. Below that, not all eligible in count_shadow_nodes()
/Linux-v6.6/scripts/gcc-plugins/
Dstructleak_plugin.c6 * NOT 'eligible' as defined by gcc's library exception to the GPL v3,
/Linux-v6.6/drivers/net/ethernet/freescale/dpaa2/
Ddpsw.h291 * @dei: Drop Eligible Indicator (DEI): a 1-bit field. May be used
293 * eligible to be dropped in the presence of congestion
/Linux-v6.6/Documentation/block/
Dblk-mq.rst95 eligible to be sent to the hardware. One of the possible schedulers to be
/Linux-v6.6/drivers/cpuidle/
Dcpuidle-powernv.c266 /* TODO: Count only states which are eligible for cpuidle */ in powernv_add_idle_states()
/Linux-v6.6/kernel/sched/
Dcpupri.c17 * are not eligible for routing. The system maintains this state with
/Linux-v6.6/Documentation/scheduler/
Dsched-design-CFS.rst190 This function chooses the most appropriate task eligible to run next.
/Linux-v6.6/tools/perf/pmu-events/arch/powerpc/power10/
Dmarked.json185 …"BriefDescription": "The marked instruction was dependent on a load. It is eligible for issue kill…
/Linux-v6.6/kernel/locking/
Drwsem.c114 * be the first one in the wait_list to be eligible for setting the handoff
493 * reader phase (first waiter is a reader), all readers are eligible in rwsem_mark_wake()
588 * be eligible to acquire or spin on the lock. in rwsem_del_wake_waiter()
/Linux-v6.6/Documentation/networking/
Dudplite.rst216 larger checksum coverage lengths, each eligible fragment needs to be

12345