Home
last modified time | relevance | path

Searched refs:pile (Results 1 – 9 of 9) sorted by relevance

/linux/drivers/md/dm-vdo/indexer/
H A Dradix-sort.c59 sort_key_t *pile[256]; member
152 * Convert the bin sizes to pointers to where each pile goes.
154 * pile[0] = first_key + bin->size[0],
155 * pile[1] = pile[0] + bin->size[1], etc.
157 * After the keys are moved to the appropriate pile, we'll need to sort each of the piles by the
158 * next radix position. A new task is put on the stack for each pile containing lots of keys, or a
159 * new task is put on the list for each pile containing few keys.
164 * @pile: array for pointers to the end of each pile
173 push_bins(struct task ** stack,struct task * end_of_stack,struct task ** list,sort_key_t * pile[],struct histogram * bins,sort_key_t * first_key,u16 offset,u16 length) push_bins() argument
239 sort_key_t **pile = sorter->pile; uds_radix_sort() local
[all...]
/linux/Documentation/trace/
H A Dintel_th.rst96 # .. wait for traces to pile up ..
/linux/drivers/net/ethernet/intel/i40e/
H A Di40e_main.c218 * @pile: the pile of resource to search
224 static int i40e_get_lump(struct i40e_pf *pf, struct i40e_lump_tracking *pile, in i40e_get_lump() argument
230 if (!pile || needed == 0 || id >= I40E_PILE_VALID_BIT) { in i40e_get_lump()
232 "param err: pile=%s needed=%d id=0x%04x\n", in i40e_get_lump()
233 pile ? "<valid>" : "<null>", needed, id); in i40e_get_lump()
237 /* Allocate last queue in the pile for FDIR VSI queue in i40e_get_lump()
240 if (pile == pf->qp_pile && pf->vsi[id]->type == I40E_VSI_FDIR) { in i40e_get_lump()
241 if (pile->list[pile in i40e_get_lump()
288 i40e_put_lump(struct i40e_lump_tracking * pile,u16 index,u16 id) i40e_put_lump() argument
[all...]
H A Di40e_virtchnl_pf.c2708 struct i40e_lump_tracking *pile; in i40e_check_enough_queue() local
2719 pile = pf->qp_pile; in i40e_check_enough_queue()
2727 i < pile->num_entries; i++) { in i40e_check_enough_queue()
2728 if (pile->list[i] & I40E_PILE_VALID_BIT) in i40e_check_enough_queue()
2738 for (i = 0; i < pile->num_entries; i++) { in i40e_check_enough_queue()
2739 if (pile->list[i] & I40E_PILE_VALID_BIT) { in i40e_check_enough_queue()
/linux/Documentation/gpu/
H A Ddrm-kms-helpers.rst25 * There's a big pile of helpers for handling outputs. First the generic bridge
H A Dtodo.rst109 now, but there's still a pile of existing drivers that easily could be
/linux/Documentation/doc-guide/
H A Dcontributing.rst260 managed to turn a big pile into a group of smaller piles. The work of
/linux/Documentation/devicetree/bindings/gpio/
H A Dgpio.txt273 Each offset runs from 0 to N. It is perfectly fine to pile any number of
/linux/Documentation/process/
H A D2.Process.rst101 worse; the pile of changes waiting for the next merge window will grow