/* * WarmRoast * Copyright (C) 2013 Albert Pham * * This program 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. * * This program is 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 program. If not, see . */ package com.sk89q.warmroast; import com.google.gson.JsonArray; import com.google.gson.JsonObject; import java.lang.management.ManagementFactory; import java.lang.management.ThreadInfo; import java.lang.management.ThreadMXBean; import java.util.ArrayList; import java.util.Collections; import java.util.HashMap; import java.util.IdentityHashMap; import java.util.List; import java.util.Map; import java.util.Set; import java.util.Timer; import java.util.TimerTask; import java.util.concurrent.CompletableFuture; import java.util.concurrent.ExecutorService; /** * Main sampler class. */ public class Sampler extends TimerTask { /** The thread management interface for the current JVM */ private final ThreadMXBean threadBean = ManagementFactory.getThreadMXBean(); /** A map of root stack nodes for each thread with sampling data */ private final Map threadData = new HashMap<>(); /** A set of recorded thread info that's yet to be inserted into the node structure */ private final Set pendingThreadData = Collections.synchronizedSet(Collections.newSetFromMap(new IdentityHashMap<>())); /** The worker pool for inserting stack nodes */ private ExecutorService workerPool; /** The lock object */ private final Object[] lock = new Object[0]; /** A future to encapsulation the completion of this sampler instance */ private final CompletableFuture future = new CompletableFuture<>(); /** The interval to wait between sampling, in milliseconds */ private final int interval; /** The instance used to generate thread information for use in sampling */ private final ThreadDumper threadDumper; /** The time when sampling first began */ private long startTime = -1; /** The unix timestamp (in millis) when this sampler should automatically complete.*/ private final long endTime; // -1 for nothing public Sampler(int interval, ThreadDumper threadDumper, long endTime) { this.interval = interval; this.threadDumper = threadDumper; this.endTime = endTime; } /** * Starts the sampler. * * @param samplingThread the timer to schedule the sampling on * @param workerPool the worker pool */ public void start(Timer samplingThread, ExecutorService workerPool) { this.workerPool = workerPool; samplingThread.scheduleAtFixedRate(this, 0, this.interval); this.startTime = System.currentTimeMillis(); } private void insertData(QueuedThreadInfo data) { synchronized (this.lock) { try { StackNode node = this.threadData.computeIfAbsent(data.threadName, StackNode::new); node.log(data.stack, Sampler.this.interval); this.pendingThreadData.remove(data); } catch (Exception e) { e.printStackTrace(); // we need to remove the pending data even if the insert failed this.pendingThreadData.remove(data); } } } /** * Gets the sampling data recorded by this instance. * * @return the data */ public Map getData() { if (this.pendingThreadData.isEmpty()) { return this.threadData; } // wait for all pending data to be inserted while (true) { synchronized (this.lock) { if (this.pendingThreadData.isEmpty()) { return this.threadData; } } } } public long getStartTime() { if (this.startTime == -1) { throw new IllegalStateException("Not yet started"); } return this.startTime; } public long getEndTime() { return this.endTime; } public CompletableFuture getFuture() { return this.future; } @Override public void run() { try { if (this.endTime != -1 && this.endTime <= System.currentTimeMillis()) { this.future.complete(this); cancel(); return; } ThreadInfo[] threadDumps = this.threadDumper.dumpThreads(this.threadBean); for (ThreadInfo threadInfo : threadDumps) { String threadName = threadInfo.getThreadName(); StackTraceElement[] stack = threadInfo.getStackTrace(); if (threadName == null || stack == null) { continue; } QueuedThreadInfo queuedData = new QueuedThreadInfo(threadName, stack); this.pendingThreadData.add(queuedData); this.workerPool.execute(queuedData); } } catch (Throwable t) { this.future.completeExceptionally(t); cancel(); } } public JsonObject formOutput() { JsonObject out = new JsonObject(); JsonArray threads = new JsonArray(); List> data = new ArrayList<>(getData().entrySet()); data.sort(Map.Entry.comparingByKey()); for (Map.Entry entry : data) { JsonObject o = new JsonObject(); o.addProperty("threadName", entry.getKey()); o.addProperty("totalTime", entry.getValue().getTotalTime()); o.add("rootNode", entry.getValue().serialize()); threads.add(o); } out.add("threads", threads); return out; } private final class QueuedThreadInfo implements Runnable { private final String threadName; private final StackTraceElement[] stack; private QueuedThreadInfo(String threadName, StackTraceElement[] stack) { this.threadName = threadName; this.stack = stack; } @Override public void run() { insertData(this); } } }