< prev index next >

src/share/tools/IdealGraphVisualizer/Data/src/com/sun/hotspot/igv/data/InputBlock.java

Print this page

        

*** 1,7 **** /* ! * Copyright (c) 2008, 2015, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. --- 1,7 ---- /* ! * Copyright (c) 2008, 2016, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation.
*** 88,98 **** } public void addNode(int id) { InputNode node = graph.getNode(id); assert node != null; ! assert !nodes.contains(node) : "duplicate : " + node; graph.setBlock(node, this); nodes.add(node); } public Set<InputBlock> getSuccessors() { --- 88,100 ---- } public void addNode(int id) { InputNode node = graph.getNode(id); assert node != null; ! // nodes.contains(node) is too expensive for large graphs so ! // just make sure the Graph doesn't know it yet. ! assert graph.getBlock(id) == null : "duplicate : " + node; graph.setBlock(node, this); nodes.add(node); } public Set<InputBlock> getSuccessors() {
< prev index next >