tag | line | file | source code |
isize | 208 | drivers/net/bsd_comp.c | unsigned char *obuf, int isize, int osize); |
isize | 211 | drivers/net/bsd_comp.c | static int bsd_decompress (void *state, unsigned char *ibuf, int isize, |
isize | 599 | drivers/net/bsd_comp.c | int isize, int osize) |
isize | 668 | drivers/net/bsd_comp.c | if (osize > isize) |
isize | 670 | drivers/net/bsd_comp.c | osize = isize; |
isize | 686 | drivers/net/bsd_comp.c | isize -= PPP_HDRLEN; |
isize | 687 | drivers/net/bsd_comp.c | ilen = ++isize; /* This is off by one, but that is what is in draft! */ |
isize | 777 | drivers/net/bsd_comp.c | db->uncomp_bytes += isize; |
isize | 778 | drivers/net/bsd_comp.c | db->in_count += isize; |
isize | 820 | drivers/net/bsd_comp.c | db->incomp_bytes += isize; |
isize | 862 | drivers/net/bsd_comp.c | static int bsd_decompress (void *state, unsigned char *ibuf, int isize, |
isize | 903 | drivers/net/bsd_comp.c | ilen = isize - (PPP_HDRLEN + 2); |
isize | 1149 | drivers/net/bsd_comp.c | db->comp_bytes += isize - BSD_OVHD - PPP_HDRLEN; |
isize | 240 | drivers/net/slhc.c | slhc_compress(struct slcompress *comp, unsigned char *icp, int isize, |
isize | 264 | drivers/net/slhc.c | return isize; |
isize | 278 | drivers/net/slhc.c | return isize; |
isize | 465 | drivers/net/slhc.c | memcpy(cp+deltaS,icp+hlen,isize-hlen); |
isize | 468 | drivers/net/slhc.c | return isize - hlen + deltaS + (cp - ocp); |
isize | 483 | drivers/net/slhc.c | memcpy(ocp, icp, isize); |
isize | 487 | drivers/net/slhc.c | return isize; |
isize | 492 | drivers/net/slhc.c | slhc_uncompress(struct slcompress *comp, unsigned char *icp, int isize) |
isize | 504 | drivers/net/slhc.c | if(isize < 3){ |
isize | 604 | drivers/net/slhc.c | len = isize - (cp - icp); |
isize | 644 | drivers/net/slhc.c | slhc_remember(struct slcompress *comp, unsigned char *icp, int isize) |
isize | 651 | drivers/net/slhc.c | if(isize < 20) { |
isize | 690 | drivers/net/slhc.c | return isize; |
isize | 176 | drivers/net/slhc.h | int isize, unsigned char *ocp, unsigned char **cpp, |
isize | 179 | drivers/net/slhc.h | int isize)); |
isize | 181 | drivers/net/slhc.h | int isize)); |
isize | 351 | fs/buffer.c | int isize = BUFSIZE_INDEX(bh->b_size); |
isize | 356 | fs/buffer.c | if(!free_list[isize]) |
isize | 358 | fs/buffer.c | nr_free[isize]--; |
isize | 360 | fs/buffer.c | free_list[isize] = NULL; |
isize | 364 | fs/buffer.c | if (free_list[isize] == bh) |
isize | 365 | fs/buffer.c | free_list[isize] = bh->b_next_free; |
isize | 413 | fs/buffer.c | int isize; |
isize | 417 | fs/buffer.c | isize = BUFSIZE_INDEX(bh->b_size); |
isize | 420 | fs/buffer.c | if(!free_list[isize]) { |
isize | 421 | fs/buffer.c | free_list[isize] = bh; |
isize | 425 | fs/buffer.c | nr_free[isize]++; |
isize | 426 | fs/buffer.c | bh->b_next_free = free_list[isize]; |
isize | 427 | fs/buffer.c | bh->b_prev_free = free_list[isize]->b_prev_free; |
isize | 428 | fs/buffer.c | free_list[isize]->b_prev_free->b_next_free = bh; |
isize | 429 | fs/buffer.c | free_list[isize]->b_prev_free = bh; |
isize | 559 | fs/buffer.c | int isize = BUFSIZE_INDEX(size); |
isize | 568 | fs/buffer.c | if (nr_free[isize] > 100) |
isize | 751 | fs/buffer.c | int isize = BUFSIZE_INDEX(size); |
isize | 754 | fs/buffer.c | buffer_usage[isize]++; |
isize | 771 | fs/buffer.c | while(!free_list[isize]) refill_freelist(size); |
isize | 776 | fs/buffer.c | bh = free_list[isize]; |
isize | 1283 | fs/buffer.c | int isize; |
isize | 1290 | fs/buffer.c | isize = BUFSIZE_INDEX(size); |
isize | 1300 | fs/buffer.c | insert_point = free_list[isize]; |
isize | 1304 | fs/buffer.c | nr_free[isize]++; |
isize | 1321 | fs/buffer.c | free_list[isize] = bh; |
isize | 1340 | fs/buffer.c | int isize = BUFSIZE_INDEX(bh->b_size); |
isize | 1361 | fs/buffer.c | nr_buffers_size[isize]--; |
isize | 1422 | fs/buffer.c | int isize; |
isize | 1442 | fs/buffer.c | isize = (size ? BUFSIZE_INDEX(size) : -1); |
isize | 1447 | fs/buffer.c | if(nlist == isize) continue; |
isize | 1473 | fs/buffer.c | int i, isize, isize1; |
isize | 1482 | fs/buffer.c | for(isize = 0; isize<NR_SIZES; isize++){ |
isize | 1483 | fs/buffer.c | if(isize1 != -1 && isize1 != isize) continue; |
isize | 1484 | fs/buffer.c | bh = free_list[isize]; |
isize | 1486 | fs/buffer.c | for (i=0 ; !i || bh != free_list[isize]; bh = bh->b_next_free, i++) { |
isize | 1556 | fs/buffer.c | int nlist, isize; |
isize | 1584 | fs/buffer.c | for(isize = 0; isize<NR_SIZES; isize++){ |
isize | 1585 | fs/buffer.c | printk("%5d [%5d]: %7d ", bufferindex_size[isize], |
isize | 1586 | fs/buffer.c | buffers_lav[isize], nr_free[isize]); |
isize | 1588 | fs/buffer.c | printk("%7d ", nr_buffers_st[isize][nlist]); |
isize | 1658 | fs/buffer.c | int isize = BUFSIZE_INDEX(size); |
isize | 1665 | fs/buffer.c | while(nr_free[isize] < 32) refill_freelist(size); |
isize | 1667 | fs/buffer.c | bh = free_list[isize]; |
isize | 1669 | fs/buffer.c | for (i=0 ; !i || bh != free_list[isize] ; bh = bh->b_next_free, i++) { |
isize | 1684 | fs/buffer.c | int isize = BUFSIZE_INDEX(size); |
isize | 1713 | fs/buffer.c | nr_buffers_size[isize]++; |
isize | 1774 | fs/buffer.c | int isize = BUFSIZE_INDEX(BLOCK_SIZE); |
isize | 1799 | fs/buffer.c | if (!free_list[isize]) |
isize | 1831 | fs/buffer.c | int i, isize; |
isize | 1890 | fs/buffer.c | for(isize = 0; isize<NR_SIZES; isize++){ |
isize | 1891 | fs/buffer.c | CALC_LOAD(buffers_lav[isize], bdf_prm.b_un.lav_const, buffer_usage[isize]); |
isize | 1892 | fs/buffer.c | buffer_usage[isize] = 0; |
isize | 739 | fs/dquot.c | static u_long isize_to_blocks(size_t isize, size_t blksize) |
isize | 746 | fs/dquot.c | blocks = (isize / blksize) + ((isize % blksize) ? 1 : 0); |
isize | 81 | include/linux/ppp-comp.h | unsigned char *obuf, int isize, int osize); |
isize | 101 | include/linux/ppp-comp.h | int (*decompress) (void *state, unsigned char *ibuf, int isize, |