Lines Matching full:palette
26 // mod_val is chosen from a palette of values based on the index of the
27 // given pixel. The palette is chosen by the value stored in mod.
57 // Pack the base codeword, palette, and multiplier into the 64 bits necessary
59 static uint64_t pack_r11eac_block(uint16_t base_cw, uint16_t palette, uint16_t multiplier,
61 SkASSERT(palette < 16);
67 const uint64_t p = static_cast<uint64_t>(palette) << 48;
82 // 3. Iterate through each palette and choose the one with the most accurate
111 // Finally, choose the proper palette and indices
116 const int *palette = kR11EACModifierPalettes[paletteIdx];
118 // Iterate through each pixel to find the best palette index
120 // for this palette to be compared against the best error...
126 // Iterate through each palette value to find the best index
127 // for this particular pixel for this particular palette.
129 abs_diff(pixel, compute_r11eac_pixel(center, palette[0], multiplier));
132 const uint16_t p = compute_r11eac_pixel(center, palette[i], multiplier);
151 // Is this palette better?
167 // palette and multiplier that has the tightest fit to the 0-255 range. This is encoded
232 // mod: 0, palette: {-3, -6, -9, -15, 2, 5, 8, 14}
250 // mod: 15, palette: {-3, -5, -7, -9, 2, 4, 6, 8}
576 const int* palette = kR11EACModifierPalettes[palette_idx];
581 const int val = base_cw*8 + 4 + palette[idx]*mod*8;
