Lines Matching full:i

73 	int i;  in end_rubin()  local
75 for (i = 0; i < RUBIN_REG_SIZE; i++) { in end_rubin()
163 int i, ret; in out_byte() local
167 for (i=0;i<8;i++) { in out_byte()
168 ret = encode(rs, rs->bit_divider-rs->bits[i],rs->bits[i],byte&1); in out_byte()
181 int i, result = 0, bit_divider = rs->bit_divider; in in_byte() local
183 for (i = 0; i < 8; i++) in in_byte()
184 result |= decode(rs, bit_divider - rs->bits[i], rs->bits[i]) << i; in in_byte()
238 int i; in jffs2_dynrubin_compress() local
249 for (i=0; i<mysrclen; i++) { in jffs2_dynrubin_compress()
250 histo[data_in[i]]++; in jffs2_dynrubin_compress()
253 for (i=0; i<256; i++) { in jffs2_dynrubin_compress()
254 if (i&128) in jffs2_dynrubin_compress()
255 bits[7] += histo[i]; in jffs2_dynrubin_compress()
256 if (i&64) in jffs2_dynrubin_compress()
257 bits[6] += histo[i]; in jffs2_dynrubin_compress()
258 if (i&32) in jffs2_dynrubin_compress()
259 bits[5] += histo[i]; in jffs2_dynrubin_compress()
260 if (i&16) in jffs2_dynrubin_compress()
261 bits[4] += histo[i]; in jffs2_dynrubin_compress()
262 if (i&8) in jffs2_dynrubin_compress()
263 bits[3] += histo[i]; in jffs2_dynrubin_compress()
264 if (i&4) in jffs2_dynrubin_compress()
265 bits[2] += histo[i]; in jffs2_dynrubin_compress()
266 if (i&2) in jffs2_dynrubin_compress()
267 bits[1] += histo[i]; in jffs2_dynrubin_compress()
268 if (i&1) in jffs2_dynrubin_compress()
269 bits[0] += histo[i]; in jffs2_dynrubin_compress()
272 for (i=0; i<8; i++) { in jffs2_dynrubin_compress()
273 bits[i] = (bits[i] * 256) / mysrclen; in jffs2_dynrubin_compress()
274 if (!bits[i]) bits[i] = 1; in jffs2_dynrubin_compress()
275 if (bits[i] > 255) bits[i] = 255; in jffs2_dynrubin_compress()
276 cpage_out[i] = bits[i]; in jffs2_dynrubin_compress()