Searched refs:pile (Results 1 - 3 of 3) sorted by relevance

/linux-master/drivers/md/dm-vdo/indexer/
H A Dradix-sort.c59 sort_key_t *pile[256]; member in struct:radix_sorter
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
172 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) argument
239 sort_key_t **pile = sorter->pile; local
[all...]
/linux-master/drivers/net/ethernet/intel/i40e/
H A Di40e_virtchnl_pf.c2709 struct i40e_lump_tracking *pile; local
2720 pile = pf->qp_pile;
2728 i < pile->num_entries; i++) {
2729 if (pile->list[i] & I40E_PILE_VALID_BIT)
2739 for (i = 0; i < pile->num_entries; i++) {
2740 if (pile->list[i] & I40E_PILE_VALID_BIT) {
H A Di40e_main.c216 * @pile: the pile of resource to search
222 static int i40e_get_lump(struct i40e_pf *pf, struct i40e_lump_tracking *pile, argument
228 if (!pile || needed == 0 || id >= I40E_PILE_VALID_BIT) {
230 "param err: pile=%s needed=%d id=0x%04x\n",
231 pile ? "<valid>" : "<null>", needed, id);
235 /* Allocate last queue in the pile for FDIR VSI queue
238 if (pile == pf->qp_pile && pf->vsi[id]->type == I40E_VSI_FDIR) {
239 if (pile->list[pile
286 i40e_put_lump(struct i40e_lump_tracking *pile, u16 index, u16 id) argument
[all...]

Completed in 218 milliseconds