HBase源码分析之BlockCache二：BucketCache

前面一篇 HBase源码分析之BlockCache一：综述及LruBlockCache的实现,分析了各种BlockCache及其特点，本篇将分析BucketCache的实现，以及将LruBlockCache和BucketCache组合在一起的CombinedBlockCache。

BucketCache

先来看看BucketCache中的一些重要的属性

  // BucketCache.java
  // Store/read block data
  // IOEngine具体实现各类数据存储，即最终的Block会缓存的地方。
  final IOEngine ioEngine;

  // Store the block in this map before writing it to cache
  // 临时存储block，后续会写入到缓存
  final ConcurrentMap<BlockCacheKey, RAMQueueEntry> ramCache;
  // In this map, store the block's meta data like offset, length
  // 记录block的元数据信息
  ConcurrentMap<BlockCacheKey, BucketEntry> backingMap;

  // 多个writerThread来负责将block写入cache中，每个writerThread有一个BlockingQueue.
  final ArrayList<BlockingQueue<RAMQueueEntry>> writerQueues =
      new ArrayList<BlockingQueue<RAMQueueEntry>>();
  @VisibleForTesting
  final WriterThread[] writerThreads;

在实例话BucketCache时，会将这些属性都初始化，writerThread会启动对应个数的后台线程。同时也会启动一个统计线程，每5分钟会在日志中打印cache的统计信息，我们可以通过这个来了解和分析cache的一些情况。

先看看cacheBlock的过程

public void cacheBlockWithWait(BlockCacheKey cacheKey, Cacheable cachedItem, boolean inMemory,
      boolean wait) {
    if (!cacheEnabled) {
      return;
    }

    if (backingMap.containsKey(cacheKey)) {
      return;
    }

    /*
     * Stuff the entry into the RAM cache so it can get drained to the persistent store
     */
    RAMQueueEntry re =
        new RAMQueueEntry(cacheKey, cachedItem, accessCount.incrementAndGet(), inMemory);
    if (ramCache.putIfAbsent(cacheKey, re) != null) {
      return;
    }
    int queueNum = (cacheKey.hashCode() & 0x7FFFFFFF) % writerQueues.size();
    BlockingQueue<RAMQueueEntry> bq = writerQueues.get(queueNum);
    boolean successfulAddition = false;
    if (wait) {
      try {
        successfulAddition = bq.offer(re, DEFAULT_CACHE_WAIT_TIME, TimeUnit.MILLISECONDS);
      }