nettybuffer内存分配

最新推荐文章于 2024-06-22 18:08:59 发布

一直学习一直爽

最新推荐文章于 2024-06-22 18:08:59 发布

阅读量323

点赞数

分类专栏： netty

本文链接：https://blog.csdn.net/qq_38393471/article/details/90205641

版权

netty 专栏收录该内容

14 篇文章 0 订阅

订阅专栏


	AdaptiveRecvByteBufAllocator.class
    static final int DEFAULT_MINIMUM = 64;
    static final int DEFAULT_INITIAL = 1024;
    static final int DEFAULT_MAXIMUM = 65536;

    private static final int INDEX_INCREMENT = 4;
    private static final int INDEX_DECREMENT = 1;
 
  private static final int[] SIZE_TABLE;  //决定下次分配缓冲区的时候要分配多少,如果下一次不够,总是上一次的2倍

static {
        List<Integer> sizeTable = new ArrayList<Integer>();
        for (int i = 16; i < 512; i += 16) {
            sizeTable.add(i);
        }

        for (int i = 512; i > 0; i <<= 1) {
            sizeTable.add(i);
        }

        SIZE_TABLE = new int[sizeTable.size()];
        for (int i = 0; i < SIZE_TABLE.length; i ++) {
            SIZE_TABLE[i] = sizeTable.get(i);
        }
    }

	DefaultMaxMessagesRecvByteBufAllocator.class
   public int guess() {
            return nextReceiveBufferSize;
        }

  @Override
        public ByteBuf allocate(ByteBufAllocator alloc) {
            return alloc.ioBuffer(guess());
        }
        
   @Override 判断返回堆内内存还是直接内存 ,通过hasUnsafe 判断当前类中是否包含了这个类
    public ByteBuf ioBuffer(int initialCapacity) {
        if (PlatformDependent.hasUnsafe()) {
            return directBuffer(initialCapacity);
        }
        return heapBuffer(initialCapacity);
    }