private void collectStackId(Entry entry, Map<Integer, List<Entry>> stackId2Proc, MutableInt maxStackId) { if (LOG.isDebugEnabled()) { LOG.debug("Procedure {} stack ids={}", entry, entry.proc.getStackIdList()); } for (int i = 0, n = entry.proc.getStackIdCount(); i < n; i++) { int stackId = entry.proc.getStackId(i); if (stackId > maxStackId.intValue()) { maxStackId.setValue(stackId); } stackId2Proc.computeIfAbsent(stackId, k -> new ArrayList<>()).add(entry); } entry.subProcs.forEach(e -> collectStackId(e, stackId2Proc, maxStackId)); }
hash = (53 * hash) + state_; if (getStackIdCount() > 0) { hash = (37 * hash) + STACK_ID_FIELD_NUMBER; hash = (53 * hash) + getStackIdList().hashCode();
private void collectStackId(Entry entry, Map<Integer, List<Entry>> stackId2Proc, MutableInt maxStackId) { if (LOG.isDebugEnabled()) { LOG.debug("Procedure {} stack ids={}", entry, entry.proc.getStackIdList()); } for (int i = 0, n = entry.proc.getStackIdCount(); i < n; i++) { int stackId = entry.proc.getStackId(i); if (stackId > maxStackId.intValue()) { maxStackId.setValue(stackId); } stackId2Proc.computeIfAbsent(stackId, k -> new ArrayList<>()).add(entry); } entry.subProcs.forEach(e -> collectStackId(e, stackId2Proc, maxStackId)); }
hash = (53 * hash) + state_; if (getStackIdCount() > 0) { hash = (37 * hash) + STACK_ID_FIELD_NUMBER; hash = (53 * hash) + getStackIdList().hashCode();
if (proto.getStackIdCount() > 0) { proc.setStackIndexes(proto.getStackIdList());
for (int i = 0; i < rootEntry.proto.getStackIdCount(); ++i) { int stackId = 1 + rootEntry.proto.getStackId(i); maxStackId = Math.max(maxStackId, stackId); for (int i = 0; i < p.proto.getStackIdCount(); ++i) { int stackId = 1 + p.proto.getStackId(i); maxStackId = Math.max(maxStackId, stackId);
if (proto.getStackIdCount() > 0) { proc.setStackIndexes(proto.getStackIdList());
if (proto.getStackIdCount() > 0) { proc.setStackIndexes(proto.getStackIdList());