Searched refs:MIN_DELTA (Results 1 - 2 of 2) sorted by relevance

/external/chromium_org/third_party/libwebp/enc/
H A Dquant.c532 // we test all alternate possibilities between [Q-MIN_DELTA, Q+MAX_DELTA]
534 #define MIN_DELTA 0 // how much lower level to try macro
536 #define NUM_NODES (MIN_DELTA + 1 + MAX_DELTA)
537 #define NODE(n, l) (nodes[(n)][(l) + MIN_DELTA])
538 #define SCORE_STATE(n, l) (score_states[n][(l) + MIN_DELTA])
560 ScoreState* ss_cur = &SCORE_STATE(0, MIN_DELTA);
561 ScoreState* ss_prev = &SCORE_STATE(1, MIN_DELTA);
590 for (m = -MIN_DELTA; m <= MAX_DELTA; ++m) {
617 for (m = -MIN_DELTA; m <= MAX_DELTA; ++m) {
650 for (p = -MIN_DELTA;
[all...]
/external/webp/src/enc/
H A Dquant.c532 // we test all alternate possibilities between [Q-MIN_DELTA, Q+MAX_DELTA]
534 #define MIN_DELTA 0 // how much lower level to try macro
536 #define NUM_NODES (MIN_DELTA + 1 + MAX_DELTA)
537 #define NODE(n, l) (nodes[(n)][(l) + MIN_DELTA])
538 #define SCORE_STATE(n, l) (score_states[n][(l) + MIN_DELTA])
560 ScoreState* ss_cur = &SCORE_STATE(0, MIN_DELTA);
561 ScoreState* ss_prev = &SCORE_STATE(1, MIN_DELTA);
590 for (m = -MIN_DELTA; m <= MAX_DELTA; ++m) {
617 for (m = -MIN_DELTA; m <= MAX_DELTA; ++m) {
650 for (p = -MIN_DELTA;
[all...]

Completed in 55 milliseconds