Lines Matching refs:i
41 for (int i = 0; i < size; ++i) { \
42 printf(" %d", (arr)[i]); \
109 int i, sum; in tinf_build_bits_base() local
112 for (i = 0; i < delta; ++i) bits[i] = 0; in tinf_build_bits_base()
113 for (i = 0; i < 30 - delta; ++i) bits[i + delta] = i / delta; in tinf_build_bits_base()
116 for (sum = first, i = 0; i < 30; ++i) in tinf_build_bits_base()
118 base[i] = sum; in tinf_build_bits_base()
119 sum += 1 << bits[i]; in tinf_build_bits_base()
127 int i; in tinf_build_fixed_trees() local
130 for (i = 0; i < 7; ++i) lt->table[i] = 0; in tinf_build_fixed_trees()
136 for (i = 0; i < 24; ++i) lt->trans[i] = 256 + i; in tinf_build_fixed_trees()
137 for (i = 0; i < 144; ++i) lt->trans[24 + i] = i; in tinf_build_fixed_trees()
138 for (i = 0; i < 8; ++i) lt->trans[24 + 144 + i] = 280 + i; in tinf_build_fixed_trees()
139 for (i = 0; i < 112; ++i) lt->trans[24 + 144 + 8 + i] = 144 + i; in tinf_build_fixed_trees()
142 for (i = 0; i < 5; ++i) dt->table[i] = 0; in tinf_build_fixed_trees()
146 for (i = 0; i < 32; ++i) dt->trans[i] = i; in tinf_build_fixed_trees()
153 unsigned int i, sum; in tinf_build_tree() local
156 for (i = 0; i < 16; ++i) t->table[i] = 0; in tinf_build_tree()
159 for (i = 0; i < num; ++i) t->table[lengths[i]]++; in tinf_build_tree()
171 for (sum = 0, i = 0; i < 16; ++i) in tinf_build_tree()
173 offs[i] = sum; in tinf_build_tree()
174 sum += t->table[i]; in tinf_build_tree()
182 for (i = 0; i < num; ++i) in tinf_build_tree()
184 if (lengths[i]) t->trans[offs[lengths[i]]++] = i; in tinf_build_tree()
221 int i; in tinf_get_le_uint32() local
222 for (i = 4; i--;) { in tinf_get_le_uint32()
231 int i; in tinf_get_be_uint32() local
232 for (i = 4; i--;) { in tinf_get_be_uint32()
311 unsigned int i, num, length; in tinf_decode_trees() local
322 for (i = 0; i < 19; ++i) lengths[i] = 0; in tinf_decode_trees()
325 for (i = 0; i < hclen; ++i) in tinf_decode_trees()
330 lengths[clcidx[i]] = clen; in tinf_decode_trees()