org.nd4j.linalg.profiler.data.primitives.StackNode Maven / Gradle / Ivy
/*
* ******************************************************************************
* *
* *
* * This program and the accompanying materials are made available under the
* * terms of the Apache License, Version 2.0 which is available at
* * https://www.apache.org/licenses/LICENSE-2.0.
* *
* * See the NOTICE file distributed with this work for additional
* * information regarding copyright ownership.
* * 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.
* *
* * SPDX-License-Identifier: Apache-2.0
* *****************************************************************************
*/
package org.nd4j.linalg.profiler.data.primitives;
import lombok.NonNull;
import lombok.extern.slf4j.Slf4j;
import java.util.Collection;
import java.util.HashMap;
import java.util.Map;
import java.util.concurrent.atomic.AtomicLong;
@Slf4j
public class StackNode implements Comparable {
private final String nodeURI;
protected Map entries = new HashMap<>();
protected AtomicLong counter = new AtomicLong(0);
public StackNode(@NonNull String uri) {
this.nodeURI = uri;
}
public Collection getNodes() {
return entries.values();
}
public void traverse(int ownLevel, boolean displayCounts) {
StringBuilder builder = new StringBuilder();
for (int x = 0; x < ownLevel; x++) {
builder.append(" ");
}
builder.append("").append(nodeURI);
if (displayCounts)
builder.append(" ").append(counter.get()).append(" us");
System.out.println(builder.toString());
for (StackNode node : entries.values()) {
node.traverse(ownLevel + 1, displayCounts);
}
}
public void consume(@NonNull StackDescriptor descriptor, int lastLevel) {
consume(descriptor, lastLevel, 1);
}
public void consume(@NonNull StackDescriptor descriptor, int lastLevel, long delta) {
boolean gotEntry = false;
for (int e = 0; e < descriptor.size(); e++) {
String entryName = descriptor.getElementName(e);
// we look for current entry first
if (!gotEntry) {
if (entryName.equalsIgnoreCase(nodeURI) && e >= lastLevel) {
gotEntry = true;
counter.addAndGet(delta);
}
} else {
// after current entry is found, we just fill first node after it
if (!entries.containsKey(entryName))
entries.put(entryName, new StackNode(entryName));
entries.get(entryName).consume(descriptor, e);
break;
}
}
}
@Override
public int compareTo(StackNode o) {
return Long.compare(o.counter.get(), this.counter.get());
}
}