Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/*
* 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.mapreduce.counters;
import java.io.DataInput;
import java.io.DataOutput;
import java.io.IOException;
import java.util.Iterator;
import java.util.concurrent.ConcurrentMap;
import java.util.concurrent.ConcurrentSkipListMap;
import org.apache.hadoop.classification.InterfaceAudience;
import org.apache.hadoop.io.Text;
import org.apache.hadoop.io.WritableUtils;
import org.apache.hadoop.mapreduce.Counter;
import org.apache.hadoop.mapreduce.util.ResourceBundles;
import org.apache.hadoop.util.StringInterner;
import com.google.common.collect.Iterators;
/**
* An abstract class to provide common implementation of the
* generic counter group in both mapred and mapreduce package.
*
* @param type of the counter for the group
*/
@InterfaceAudience.Private
public abstract class AbstractCounterGroup
implements CounterGroupBase {
private final String name;
private String displayName;
private final ConcurrentMap counters =
new ConcurrentSkipListMap();
private final Limits limits;
public AbstractCounterGroup(String name, String displayName,
Limits limits) {
this.name = name;
this.displayName = displayName;
this.limits = limits;
}
@Override
public String getName() {
return name;
}
@Override
public synchronized String getDisplayName() {
return displayName;
}
@Override
public synchronized void setDisplayName(String displayName) {
this.displayName = displayName;
}
@Override
public synchronized void addCounter(T counter) {
counters.put(counter.getName(), counter);
limits.incrCounters();
}
@Override
public synchronized T addCounter(String counterName, String displayName,
long value) {
String saveName = Limits.filterCounterName(counterName);
T counter = findCounterImpl(saveName, false);
if (counter == null) {
return addCounterImpl(saveName, displayName, value);
}
counter.setValue(value);
return counter;
}
private T addCounterImpl(String name, String displayName, long value) {
T counter = newCounter(name, displayName, value);
addCounter(counter);
return counter;
}
@Override
public synchronized T findCounter(String counterName, String displayName) {
// Take lock to avoid two threads not finding a counter and trying to add
// the same counter.
String saveName = Limits.filterCounterName(counterName);
T counter = findCounterImpl(saveName, false);
if (counter == null) {
return addCounterImpl(saveName, displayName, 0);
}
return counter;
}
@Override
public T findCounter(String counterName, boolean create) {
return findCounterImpl(Limits.filterCounterName(counterName), create);
}
// Lock the object. Cannot simply use concurrent constructs on the counters
// data-structure (like putIfAbsent) because of localization, limits etc.
private synchronized T findCounterImpl(String counterName, boolean create) {
T counter = counters.get(counterName);
if (counter == null && create) {
String localized =
ResourceBundles.getCounterName(getName(), counterName, counterName);
return addCounterImpl(counterName, localized, 0);
}
return counter;
}
@Override
public T findCounter(String counterName) {
return findCounter(counterName, true);
}
/**
* Abstract factory method to create a new counter of type T
* @param counterName of the counter
* @param displayName of the counter
* @param value of the counter
* @return a new counter
*/
protected abstract T newCounter(String counterName, String displayName,
long value);
/**
* Abstract factory method to create a new counter of type T
* @return a new counter object
*/
protected abstract T newCounter();
@Override
public Iterator iterator() {
return counters.values().iterator();
}
/**
* GenericGroup ::= displayName #counter counter*
*/
@Override
public synchronized void write(DataOutput out) throws IOException {
Text.writeString(out, displayName);
WritableUtils.writeVInt(out, counters.size());
for(Counter counter: counters.values()) {
counter.write(out);
}
}
@Override
public synchronized void readFields(DataInput in) throws IOException {
displayName = StringInterner.weakIntern(Text.readString(in));
counters.clear();
int size = WritableUtils.readVInt(in);
for (int i = 0; i < size; i++) {
T counter = newCounter();
counter.readFields(in);
counters.put(counter.getName(), counter);
limits.incrCounters();
}
}
@Override
public synchronized int size() {
return counters.size();
}
@Override
public synchronized boolean equals(Object genericRight) {
if (genericRight instanceof CounterGroupBase>) {
@SuppressWarnings("unchecked")
CounterGroupBase right = (CounterGroupBase) genericRight;
return Iterators.elementsEqual(iterator(), right.iterator());
}
return false;
}
@Override
public synchronized int hashCode() {
return counters.hashCode();
}
@Override
public void incrAllCounters(CounterGroupBase rightGroup) {
try {
for (Counter right : rightGroup) {
Counter left = findCounter(right.getName(), right.getDisplayName());
left.increment(right.getValue());
}
} catch (LimitExceededException e) {
counters.clear();
throw e;
}
}
}