| 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 | 239 | drivers/net/slhc.c | slhc_compress(struct slcompress *comp, unsigned char *icp, int isize, |
| isize | 263 | drivers/net/slhc.c | return isize; |
| isize | 277 | drivers/net/slhc.c | return isize; |
| isize | 464 | drivers/net/slhc.c | memcpy(cp+deltaS,icp+hlen,isize-hlen); |
| isize | 467 | drivers/net/slhc.c | return isize - hlen + deltaS + (cp - ocp); |
| isize | 482 | drivers/net/slhc.c | memcpy(ocp, icp, isize); |
| isize | 486 | drivers/net/slhc.c | return isize; |
| isize | 491 | drivers/net/slhc.c | slhc_uncompress(struct slcompress *comp, unsigned char *icp, int isize) |
| isize | 503 | drivers/net/slhc.c | if(isize < 3){ |
| isize | 603 | drivers/net/slhc.c | len = isize - (cp - icp); |
| isize | 643 | drivers/net/slhc.c | slhc_remember(struct slcompress *comp, unsigned char *icp, int isize) |
| isize | 650 | drivers/net/slhc.c | if(isize < 20) { |
| isize | 689 | 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 | 328 | fs/buffer.c | int isize = BUFSIZE_INDEX(bh->b_size); |
| isize | 333 | fs/buffer.c | if(!free_list[isize]) |
| isize | 335 | fs/buffer.c | nr_free[isize]--; |
| isize | 337 | fs/buffer.c | free_list[isize] = NULL; |
| isize | 341 | fs/buffer.c | if (free_list[isize] == bh) |
| isize | 342 | fs/buffer.c | free_list[isize] = bh->b_next_free; |
| isize | 390 | fs/buffer.c | int isize; |
| isize | 394 | fs/buffer.c | isize = BUFSIZE_INDEX(bh->b_size); |
| isize | 397 | fs/buffer.c | if(!free_list[isize]) { |
| isize | 398 | fs/buffer.c | free_list[isize] = bh; |
| isize | 402 | fs/buffer.c | nr_free[isize]++; |
| isize | 403 | fs/buffer.c | bh->b_next_free = free_list[isize]; |
| isize | 404 | fs/buffer.c | bh->b_prev_free = free_list[isize]->b_prev_free; |
| isize | 405 | fs/buffer.c | free_list[isize]->b_prev_free->b_next_free = bh; |
| isize | 406 | fs/buffer.c | free_list[isize]->b_prev_free = bh; |
| isize | 533 | fs/buffer.c | int isize = BUFSIZE_INDEX(size); |
| isize | 542 | fs/buffer.c | if (nr_free[isize] > 100) |
| isize | 725 | fs/buffer.c | int isize = BUFSIZE_INDEX(size); |
| isize | 728 | fs/buffer.c | buffer_usage[isize]++; |
| isize | 745 | fs/buffer.c | while(!free_list[isize]) refill_freelist(size); |
| isize | 750 | fs/buffer.c | bh = free_list[isize]; |
| isize | 1143 | fs/buffer.c | int isize; |
| isize | 1150 | fs/buffer.c | isize = BUFSIZE_INDEX(size); |
| isize | 1160 | fs/buffer.c | insert_point = free_list[isize]; |
| isize | 1164 | fs/buffer.c | nr_free[isize]++; |
| isize | 1181 | fs/buffer.c | free_list[isize] = bh; |
| isize | 1201 | fs/buffer.c | int isize = BUFSIZE_INDEX(bh->b_size); |
| isize | 1222 | fs/buffer.c | nr_buffers_size[isize]--; |
| isize | 1283 | fs/buffer.c | int isize; |
| isize | 1303 | fs/buffer.c | isize = (size ? BUFSIZE_INDEX(size) : -1); |
| isize | 1308 | fs/buffer.c | if(nlist == isize) continue; |
| isize | 1347 | fs/buffer.c | int i, isize, isize1; |
| isize | 1356 | fs/buffer.c | for(isize = 0; isize<NR_SIZES; isize++){ |
| isize | 1357 | fs/buffer.c | if(isize1 != -1 && isize1 != isize) continue; |
| isize | 1358 | fs/buffer.c | bh = free_list[isize]; |
| isize | 1360 | fs/buffer.c | for (i=0 ; !i || bh != free_list[isize]; bh = bh->b_next_free, i++) { |
| isize | 1430 | fs/buffer.c | int nlist, isize; |
| isize | 1458 | fs/buffer.c | for(isize = 0; isize<NR_SIZES; isize++){ |
| isize | 1459 | fs/buffer.c | printk("%5d [%5d]: %7d ", bufferindex_size[isize], |
| isize | 1460 | fs/buffer.c | buffers_lav[isize], nr_free[isize]); |
| isize | 1462 | fs/buffer.c | printk("%7d ", nr_buffers_st[isize][nlist]); |
| isize | 1532 | fs/buffer.c | int isize = BUFSIZE_INDEX(size); |
| isize | 1539 | fs/buffer.c | while(nr_free[isize] < 32) refill_freelist(size); |
| isize | 1541 | fs/buffer.c | bh = free_list[isize]; |
| isize | 1543 | fs/buffer.c | for (i=0 ; !i || bh != free_list[isize] ; bh = bh->b_next_free, i++) { |
| isize | 1558 | fs/buffer.c | int isize = BUFSIZE_INDEX(size); |
| isize | 1587 | fs/buffer.c | nr_buffers_size[isize]++; |
| isize | 1648 | fs/buffer.c | int isize = BUFSIZE_INDEX(BLOCK_SIZE); |
| isize | 1673 | fs/buffer.c | if (!free_list[isize]) |
| isize | 1705 | fs/buffer.c | int i, isize; |
| isize | 1764 | fs/buffer.c | for(isize = 0; isize<NR_SIZES; isize++){ |
| isize | 1765 | fs/buffer.c | CALC_LOAD(buffers_lav[isize], bdf_prm.b_un.lav_const, buffer_usage[isize]); |
| isize | 1766 | fs/buffer.c | buffer_usage[isize] = 0; |
| isize | 721 | fs/dquot.c | static u_long isize_to_blocks(size_t isize, size_t blksize) |
| isize | 728 | 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, |