All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.apache.hadoop.hbase.regionserver.compactions.CompactionRequest Maven / Gradle / Ivy

The newest version!
/**
 *
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you under the Apache License, Version 2.0 (the
 * "License"); you may not use this file except in compliance
 * with the License.  You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package org.apache.hadoop.hbase.regionserver.compactions;

import com.google.common.base.Function;
import com.google.common.base.Joiner;
import com.google.common.base.Preconditions;
import com.google.common.base.Predicate;
import com.google.common.collect.Collections2;

import java.util.ArrayList;
import java.util.Collection;

import org.apache.hadoop.hbase.classification.InterfaceAudience;
import org.apache.hadoop.hbase.classification.InterfaceStability;
import org.apache.hadoop.hbase.regionserver.Store;
import org.apache.hadoop.hbase.regionserver.StoreFile;
import org.apache.hadoop.hbase.regionserver.StoreFile.Reader;
import org.apache.hadoop.hbase.util.EnvironmentEdgeManager;
import org.apache.hadoop.util.StringUtils;

/**
 * This class holds all logical details necessary to run a compaction.
 */
@InterfaceAudience.LimitedPrivate({ "coprocessor" })
@InterfaceStability.Evolving
public class CompactionRequest implements Comparable {

  // was this compaction promoted to an off-peak
  private boolean isOffPeak = false;
  private enum DisplayCompactionType { MINOR, ALL_FILES, MAJOR }
  private DisplayCompactionType isMajor = DisplayCompactionType.MINOR;
  private int priority = Store.NO_PRIORITY;
  private Collection filesToCompact;

  // CompactRequest object creation time.
  private long selectionTime;
  // System time used to compare objects in FIFO order. TODO: maybe use selectionTime?
  private Long timeInNanos;
  private String regionName = "";
  private String storeName = "";
  private long totalSize = -1L;

  /**
   * This ctor should be used by coprocessors that want to subclass CompactionRequest.
   */
  public CompactionRequest() {
    this.selectionTime = EnvironmentEdgeManager.currentTime();
    this.timeInNanos = System.nanoTime();
  }

  public CompactionRequest(Collection files) {
    this();
    Preconditions.checkNotNull(files);
    this.filesToCompact = files;
    recalculateSize();
  }

  public void updateFiles(Collection files) {
    this.filesToCompact = files;
  }

  /**
   * Called before compaction is executed by CompactSplitThread; for use by coproc subclasses.
   */
  public void beforeExecute() {}

  /**
   * Called after compaction is executed by CompactSplitThread; for use by coproc subclasses.
   */
  public void afterExecute() {}

  /**
   * Combines the request with other request. Coprocessors subclassing CR may override
   * this if they want to do clever things based on CompactionPolicy selection that
   * is passed to this method via "other". The default implementation just does a copy.
   * @param other Request to combine with.
   * @return The result (may be "this" or "other").
   */
  public CompactionRequest combineWith(CompactionRequest other) {
    this.filesToCompact = new ArrayList(other.getFiles());
    this.isOffPeak = other.isOffPeak;
    this.isMajor = other.isMajor;
    this.priority = other.priority;
    this.selectionTime = other.selectionTime;
    this.timeInNanos = other.timeInNanos;
    this.regionName = other.regionName;
    this.storeName = other.storeName;
    this.totalSize = other.totalSize;
    recalculateSize();
    return this;
  }

  /**
   * This function will define where in the priority queue the request will
   * end up.  Those with the highest priorities will be first.  When the
   * priorities are the same it will first compare priority then date
   * to maintain a FIFO functionality.
   *
   * 

Note: The enqueue timestamp is accurate to the nanosecond. if two * requests have same timestamp then this function will break the tie * arbitrarily with hashCode() comparing. */ @Override public int compareTo(CompactionRequest request) { //NOTE: The head of the priority queue is the least element if (this.equals(request)) { return 0; //they are the same request } int compareVal; compareVal = priority - request.priority; //compare priority if (compareVal != 0) { return compareVal; } compareVal = timeInNanos.compareTo(request.timeInNanos); if (compareVal != 0) { return compareVal; } // break the tie based on hash code return this.hashCode() - request.hashCode(); } @Override public int hashCode() { final int prime = 31; int result = 1; result = prime * result + ((filesToCompact == null) ? 0 : filesToCompact.hashCode()); result = prime * result + ((isMajor == null) ? 0 : isMajor.hashCode()); result = prime * result + (isOffPeak ? 1231 : 1237); result = prime * result + priority; result = prime * result + ((regionName == null) ? 0 : regionName.hashCode()); result = prime * result + (int) (selectionTime ^ (selectionTime >>> 32)); result = prime * result + ((storeName == null) ? 0 : storeName.hashCode()); result = prime * result + ((timeInNanos == null) ? 0 : timeInNanos.hashCode()); result = prime * result + (int) (totalSize ^ (totalSize >>> 32)); return result; } @Override public boolean equals(Object obj) { if (this == obj) { return true; } if (obj == null) { return false; } if (getClass() != obj.getClass()) { return false; } CompactionRequest other = (CompactionRequest) obj; if (filesToCompact == null) { if (other.filesToCompact != null) { return false; } } else if (!filesToCompact.equals(other.filesToCompact)) { return false; } if (isMajor != other.isMajor) { return false; } if (isOffPeak != other.isOffPeak) { return false; } if (priority != other.priority) { return false; } if (regionName == null) { if (other.regionName != null) { return false; } } else if (!regionName.equals(other.regionName)) { return false; } if (selectionTime != other.selectionTime) { return false; } if (storeName == null) { if (other.storeName != null) { return false; } } else if (!storeName.equals(other.storeName)) { return false; } if (timeInNanos == null) { if (other.timeInNanos != null) { return false; } } else if (!timeInNanos.equals(other.timeInNanos)) { return false; } if (totalSize != other.totalSize) { return false; } return true; } public Collection getFiles() { return this.filesToCompact; } /** * Sets the region/store name, for logging. */ public void setDescription(String regionName, String storeName) { this.regionName = regionName; this.storeName = storeName; } /** Gets the total size of all StoreFiles in compaction */ public long getSize() { return totalSize; } public boolean isAllFiles() { return this.isMajor == DisplayCompactionType.MAJOR || this.isMajor == DisplayCompactionType.ALL_FILES; } public boolean isMajor() { return this.isMajor == DisplayCompactionType.MAJOR; } /** Gets the priority for the request */ public int getPriority() { return priority; } /** Sets the priority for the request */ public void setPriority(int p) { this.priority = p; } public boolean isOffPeak() { return this.isOffPeak; } public void setOffPeak(boolean value) { this.isOffPeak = value; } public long getSelectionTime() { return this.selectionTime; } /** * Specify if this compaction should be a major compaction based on the state of the store * @param isMajor true if the system determines that this compaction should be a major * compaction */ public void setIsMajor(boolean isMajor, boolean isAllFiles) { assert isAllFiles || !isMajor; this.isMajor = !isAllFiles ? DisplayCompactionType.MINOR : (isMajor ? DisplayCompactionType.MAJOR : DisplayCompactionType.ALL_FILES); } @Override public String toString() { String fsList = Joiner.on(", ").join( Collections2.transform(Collections2.filter( this.getFiles(), new Predicate() { @Override public boolean apply(StoreFile sf) { return sf.getReader() != null; } }), new Function() { @Override public String apply(StoreFile sf) { return StringUtils.humanReadableInt( (sf.getReader() == null) ? 0 : sf.getReader().length()); } })); return "regionName=" + regionName + ", storeName=" + storeName + ", fileCount=" + this.getFiles().size() + ", fileSize=" + StringUtils.humanReadableInt(totalSize) + ((fsList.isEmpty()) ? "" : " (" + fsList + ")") + ", priority=" + priority + ", time=" + timeInNanos; } /** * Recalculate the size of the compaction based on current files. * @param files files that should be included in the compaction */ private void recalculateSize() { long sz = 0; for (StoreFile sf : this.filesToCompact) { Reader r = sf.getReader(); sz += r == null ? 0 : r.length(); } this.totalSize = sz; } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy