Lines Matching defs:INDEX
16 Use a macro to compute the history index
52 has size 1 << (len - root), to index the remaining bits in that set of
138 We build the array with length max-1 lists for the len index, with syms-3
140 varying in length as a function of sym. See the calculation of index in
141 count() for the index, and the calculation of size in main() for the size
158 states. mem and rem are used to calculate a single index in a triangular
178 /* Index function for num[] and done[] */
179 #define INDEX(i,j,k) (((size_t)((i-1)>>1)*((i-2)>>1)+(j>>1)-1)*(max-1)+k-1)
210 size_t index; /* index of this case in *num */
220 index = INDEX(syms, left, len);
221 got = num[index];
250 num[index] = sum;
260 size_t index; /* index for this state's bit vector */
267 index = INDEX(syms, left, len);
274 length = done[index].len;
275 if (offset < length && (done[index].vec[offset] & bit) != 0)
287 vector = realloc(done[index].vec, length);
289 memset(vector + done[index].len, 0, length - done[index].len);
308 done[index].len = length;
309 done[index].vec = vector;
313 done[index].vec[offset] |= bit;
407 size_t index; /* index of this case in *num */
421 index = INDEX(n, left, root + 1);
422 if (root + 1 < max && num[index]) /* reachable node */
427 if (num[index - 1] && n <= left << 1)
