mirror of https://github.com/octoleo/plantuml.git
98 lines
2.9 KiB
Java
98 lines
2.9 KiB
Java
/* ========================================================================
|
|
* PlantUML : a free UML diagram generator
|
|
* ========================================================================
|
|
*
|
|
* (C) Copyright 2009-2017, Arnaud Roques
|
|
*
|
|
* Project Info: http://plantuml.com
|
|
*
|
|
* If you like this project or if you find it useful, you can support us at:
|
|
*
|
|
* http://plantuml.com/patreon (only 1$ per month!)
|
|
* http://plantuml.com/paypal
|
|
*
|
|
* This file is part of PlantUML.
|
|
*
|
|
* PlantUML is free software; you can redistribute it and/or modify it
|
|
* under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* PlantUML distributed in the hope that it will be useful, but
|
|
* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
|
|
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
|
|
* License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public
|
|
* License along with this library; if not, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
|
|
* USA.
|
|
*
|
|
*
|
|
* Original Author: Arnaud Roques
|
|
*
|
|
*
|
|
*/
|
|
package net.sourceforge.plantuml.preproc;
|
|
|
|
import java.io.IOException;
|
|
import java.util.concurrent.ConcurrentHashMap;
|
|
import java.util.concurrent.ConcurrentMap;
|
|
import java.util.concurrent.atomic.AtomicLong;
|
|
|
|
import net.sourceforge.plantuml.CharSequence2;
|
|
import net.sourceforge.plantuml.Log;
|
|
|
|
public abstract class ReadLineInstrumented implements ReadLine {
|
|
|
|
private static final boolean TRACE = false;
|
|
|
|
private static ConcurrentMap<Class, AtomicLong> durations = new ConcurrentHashMap<Class, AtomicLong>();
|
|
private static ConcurrentMap<Class, AtomicLong> maxes = new ConcurrentHashMap<Class, AtomicLong>();
|
|
|
|
private long current = 0;
|
|
|
|
private AtomicLong get(ConcurrentMap<Class, AtomicLong> source) {
|
|
AtomicLong result = source.get(getClass());
|
|
if (result == null) {
|
|
result = new AtomicLong();
|
|
source.put(getClass(), result);
|
|
}
|
|
return result;
|
|
}
|
|
|
|
public final CharSequence2 readLine() throws IOException {
|
|
if (TRACE == false) {
|
|
return readLineInst();
|
|
}
|
|
final long now = System.currentTimeMillis();
|
|
try {
|
|
return readLineInst();
|
|
} finally {
|
|
final long time = System.currentTimeMillis() - now;
|
|
current += time;
|
|
get(durations).addAndGet(time);
|
|
}
|
|
}
|
|
|
|
@Override
|
|
public String toString() {
|
|
return super.toString() + " current=" + current;
|
|
}
|
|
|
|
abstract CharSequence2 readLineInst() throws IOException;
|
|
|
|
public final void close() throws IOException {
|
|
if (TRACE) {
|
|
if (current > get(maxes).get()) {
|
|
get(maxes).set(current);
|
|
}
|
|
Log.info("DURATION::" + getClass() + " duration= " + get(durations).get() + " current=" + current + " max="
|
|
+ get(maxes).get());
|
|
}
|
|
closeInst();
|
|
}
|
|
|
|
abstract void closeInst() throws IOException;
|
|
|
|
} |