Check whether a pair in the queue should be updated as head or not.

initialize the job struct with some TODOs

initialize the job struct with some tasks to perform

Insert an interval in the list contained in the manager by starting at interval_in as a hint. The intervals are sorted by start_ value.

Helper to check if each channel in 'src' and 'dst' is at most off by 'max_allowed_diff'.

Pop an interval in the manager.

Convert 8 packed ARGB to r[], g[], b[]

Convert 8 packed ARGB to r[], g[], b[]

Stores code in table[0], table[step], table[2*step], ..., table[end]. Assumes that end is an integer multiple of step.

Stores code in table[0], table[step], table[2*step], ..., table[end]. Assumes that end is an integer multiple of step.

Returns size of the chunk including chunk header and padding byte (if any).

Helper function

Updates values of 2 pixels at MB edge during complex filtering. Update operations: q = q - delta and p = p + delta; where delta = [(a_hi >> 7), (a_lo

Given the distance_cost for pixel 'index', update the cost at pixel 'i' if it is smaller than the previously computed value.

Update the cost at index i by going over all the stored intervals that overlap with i. If 'do_clean_intervals' is set to something different than 0, i

on three inner edges

simplified version of VP8GetBit() for prob=0x80 (note shift is always 1 here)

Convert four packed four-channel buffers like argbargbargbargb... into the split channels aaaaa ... rrrr ... gggg .... bbbbb ......

Sum of each component, mod 256.