Lines Matching refs:INDEX
16 Use a macro to compute the history index
49 has size 1 << (len - root), to index the remaining bits in that set of
135 We build the array with length max-1 lists for the len index, with syms-3
137 varying in length as a function of sym. See the calculation of index in
138 count() for the index, and the calculation of size in main() for the size
155 states. mem and rem are used to calculate a single index in a triangular
175 /* Index function for num[] and done[] */
176 #define INDEX(i,j,k) (((size_t)((i-1)>>1)*((i-2)>>1)+(j>>1)-1)*(max-1)+k-1)
207 size_t index; /* index of this case in *num */
217 index = INDEX(syms, left, len);
218 got = num[index];
247 num[index] = sum;
257 size_t index; /* index for this state's bit vector */
264 index = INDEX(syms, left, len);
271 length = done[index].len;
272 if (offset < length && (done[index].vec[offset] & bit) != 0)
284 vector = realloc(done[index].vec, length);
286 memset(vector + done[index].len, 0, length - done[index].len);
305 done[index].len = length;
306 done[index].vec = vector;
310 done[index].vec[offset] |= bit;
404 size_t index; /* index of this case in *num */
418 index = INDEX(n, left, root + 1);
419 if (root + 1 < max && num[index]) /* reachable node */
424 if (num[index - 1] && n <= left << 1)
