Lines Matching refs:partition
19 * @brief Functions for generating partition tables on demand.
24 /** @brief The number of 64-bit words needed to represent a canonical partition bit pattern. */
28 * @brief Generate a canonical representation of a partition pattern.
31 * the remapped texel index. Remapping ensures that we only match on the partition pattern,
32 * independent of the partition order generated by the hash.
35 * @param partition_of_texel The partition assignments, in hash order.
50 // that the lowest texel index in partition N is smaller than the lowest texel index in
51 // partition N + 1.
108 * @brief Hash function used for procedural partition assignment.
133 * @param seed The seed - the partition index from the block.
137 * @param partition_count The total partition count of this encoding.
140 * @return The assigned partition index for this texel.
244 uint8_t partition;
247 partition = 0;
251 partition = 1;
255 partition = 2;
259 partition = 3;
262 return partition;
266 * @brief Generate a single partition info structure.
269 * @param partition_count The partition count of this partitioning.
270 * @param partition_index The partition index / seed of this partitioning.
271 * @param partition_remap_index The remapped partition index of this partitioning.
272 * @param[out] pi The partition info structure to populate.
274 * @return True if this is a useful partition index, False if we can skip it.
315 // Populate the actual procedural partition count
337 // Populate the partition index
365 // Populate the partition coverage bitmap
394 // Skip tables larger than config max partition count if we can omit modes