HomeSort by relevance Sort by last modified time
    Searched refs:ix_end (Results 1 - 8 of 8) sorted by null

  /external/brotli/c/enc/
hash_to_binary_tree_inc.h 280 const size_t ix_end) {
283 if (ix_start + 63 <= ix_end) {
284 i = ix_end - 63;
291 for (; i < ix_end; ++i) {
hash_composite_inc.h 97 const size_t ix_end) {
99 FN_A(StoreRange)(self->ha, data, mask, ix_start, ix_end);
100 FN_B(StoreRange)(self->hb, data, mask, ix_start, ix_end);
hash_longest_match_quickly_inc.h 93 const size_t ix_end) {
95 for (i = ix_start; i < ix_end; ++i) {
hash_rolling_inc.h 115 const size_t ix_end) {
120 BROTLI_UNUSED(ix_end);
hash_forgetful_chain_inc.h 119 const size_t ix_end) {
121 for (i = ix_start; i < ix_end; ++i) {
hash_longest_match64_inc.h 123 const size_t ix_end) {
125 for (i = ix_start; i < ix_end; ++i) {
hash_longest_match_inc.h 116 const size_t ix_end) {
118 for (i = ix_start; i < ix_end; ++i) {
  /external/webp/src/enc/
predictor_enc.c 752 const int ix_end = ix + all_x_max - tile_x_offset; local
753 for (; ix < ix_end; ++ix) {

Completed in 161 milliseconds