summaryrefslogtreecommitdiff
path: root/src/net/sourceforge/plantuml/preproc/ReadLineInstrumented.java
blob: b3c8d472b6cdee3d7193ed47f0c575b27fa97b3a (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
/* ========================================================================
 * 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;

}