tag | line | file | source code |
isize | 242 | drivers/net/slhc.c | slhc_compress(struct slcompress *comp, unsigned char *icp, int isize, |
isize | 266 | drivers/net/slhc.c | return isize; |
isize | 280 | drivers/net/slhc.c | return isize; |
isize | 467 | drivers/net/slhc.c | memcpy(cp+deltaS,icp+hlen,isize-hlen); |
isize | 470 | drivers/net/slhc.c | return isize - hlen + deltaS + (cp - ocp); |
isize | 485 | drivers/net/slhc.c | memcpy(ocp, icp, isize); |
isize | 489 | drivers/net/slhc.c | return isize; |
isize | 494 | drivers/net/slhc.c | slhc_uncompress(struct slcompress *comp, unsigned char *icp, int isize) |
isize | 506 | drivers/net/slhc.c | if(isize < 3){ |
isize | 606 | drivers/net/slhc.c | len = isize - (cp - icp); |
isize | 642 | drivers/net/slhc.c | slhc_remember(struct slcompress *comp, unsigned char *icp, int isize) |
isize | 649 | drivers/net/slhc.c | if(isize < 20) { |
isize | 688 | 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 | 307 | fs/buffer.c | int isize = BUFSIZE_INDEX(bh->b_size); |
isize | 311 | fs/buffer.c | if(!free_list[isize]) |
isize | 313 | fs/buffer.c | nr_free[isize]--; |
isize | 315 | fs/buffer.c | free_list[isize] = NULL; |
isize | 319 | fs/buffer.c | if (free_list[isize] == bh) |
isize | 320 | fs/buffer.c | free_list[isize] = bh->b_next_free; |
isize | 363 | fs/buffer.c | int isize; |
isize | 367 | fs/buffer.c | isize = BUFSIZE_INDEX(bh->b_size); |
isize | 371 | fs/buffer.c | if(!free_list[isize]) { |
isize | 372 | fs/buffer.c | free_list[isize] = bh; |
isize | 376 | fs/buffer.c | nr_free[isize]++; |
isize | 377 | fs/buffer.c | bh->b_next_free = free_list[isize]; |
isize | 378 | fs/buffer.c | bh->b_prev_free = free_list[isize]->b_prev_free; |
isize | 379 | fs/buffer.c | free_list[isize]->b_prev_free->b_next_free = bh; |
isize | 380 | fs/buffer.c | free_list[isize]->b_prev_free = bh; |
isize | 504 | fs/buffer.c | int isize = BUFSIZE_INDEX(size); |
isize | 513 | fs/buffer.c | if (nr_free[isize] > 100) |
isize | 693 | fs/buffer.c | int isize = BUFSIZE_INDEX(size); |
isize | 696 | fs/buffer.c | buffer_usage[isize]++; |
isize | 710 | fs/buffer.c | while(!free_list[isize]) refill_freelist(size); |
isize | 715 | fs/buffer.c | bh = free_list[isize]; |
isize | 1058 | fs/buffer.c | int isize = BUFSIZE_INDEX(size); |
isize | 1089 | fs/buffer.c | nr_buffers_size[isize]++; |
isize | 1212 | fs/buffer.c | int isize; |
isize | 1219 | fs/buffer.c | isize = BUFSIZE_INDEX(size); |
isize | 1229 | fs/buffer.c | insert_point = free_list[isize]; |
isize | 1233 | fs/buffer.c | nr_free[isize]++; |
isize | 1250 | fs/buffer.c | free_list[isize] = bh; |
isize | 1269 | fs/buffer.c | int isize = BUFSIZE_INDEX(bh->b_size); |
isize | 1287 | fs/buffer.c | nr_buffers_size[isize]--; |
isize | 1319 | fs/buffer.c | int isize; |
isize | 1339 | fs/buffer.c | isize = (size ? BUFSIZE_INDEX(size) : -1); |
isize | 1344 | fs/buffer.c | if(nlist == isize) continue; |
isize | 1382 | fs/buffer.c | int i, isize, isize1; |
isize | 1391 | fs/buffer.c | for(isize = 0; isize<NR_SIZES; isize++){ |
isize | 1392 | fs/buffer.c | if(isize1 != -1 && isize1 != isize) continue; |
isize | 1393 | fs/buffer.c | bh = free_list[isize]; |
isize | 1395 | fs/buffer.c | for (i=0 ; !i || bh != free_list[isize]; bh = bh->b_next_free, i++) { |
isize | 1447 | fs/buffer.c | int nlist, isize; |
isize | 1472 | fs/buffer.c | for(isize = 0; isize<NR_SIZES; isize++){ |
isize | 1473 | fs/buffer.c | printk("%5d [%5d]: %7d ", bufferindex_size[isize], |
isize | 1474 | fs/buffer.c | buffers_lav[isize], nr_free[isize]); |
isize | 1476 | fs/buffer.c | printk("%7d ", nr_buffers_st[isize][nlist]); |
isize | 1545 | fs/buffer.c | int isize = BUFSIZE_INDEX(size); |
isize | 1552 | fs/buffer.c | while(nr_free[isize] < 32) refill_freelist(size); |
isize | 1554 | fs/buffer.c | bh = free_list[isize]; |
isize | 1556 | fs/buffer.c | for (i=0 ; !i || bh != free_list[isize] ; bh = bh->b_next_free, i++) { |
isize | 1571 | fs/buffer.c | int isize = BUFSIZE_INDEX(size); |
isize | 1603 | fs/buffer.c | nr_buffers_size[isize]++; |
isize | 1664 | fs/buffer.c | int isize = BUFSIZE_INDEX(BLOCK_SIZE); |
isize | 1689 | fs/buffer.c | if (!free_list[isize]) |
isize | 1732 | fs/buffer.c | int i, isize; |
isize | 1791 | fs/buffer.c | for(isize = 0; isize<NR_SIZES; isize++){ |
isize | 1792 | fs/buffer.c | CALC_LOAD(buffers_lav[isize], bdf_prm.b_un.lav_const, buffer_usage[isize]); |
isize | 1793 | fs/buffer.c | buffer_usage[isize] = 0; |