001/* 002 * Copyright (c) 2013, Oracle and/or its affiliates. All rights reserved. 003 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 004 * 005 * This code is free software; you can redistribute it and/or modify it 006 * under the terms of the GNU General Public License version 2 only, as 007 * published by the Free Software Foundation. 008 * 009 * This code is distributed in the hope that it will be useful, but WITHOUT 010 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 011 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 012 * version 2 for more details (a copy is included in the LICENSE file that 013 * accompanied this code). 014 * 015 * You should have received a copy of the GNU General Public License version 016 * 2 along with this work; if not, write to the Free Software Foundation, 017 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 018 * 019 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 020 * or visit www.oracle.com if you need additional information or have any 021 * questions. 022 */ 023package com.oracle.graal.phases.common.util; 024 025import java.util.*; 026 027import com.oracle.graal.graph.Graph.NodeEvent; 028import com.oracle.graal.graph.Graph.NodeEventListener; 029import com.oracle.graal.graph.*; 030 031/** 032 * A simple {@link NodeEventListener} implementation that accumulates event nodes in a 033 * {@link HashSet}. 034 */ 035public class HashSetNodeEventListener implements NodeEventListener { 036 037 private final Set<Node> nodes; 038 private final Set<NodeEvent> filter; 039 040 /** 041 * Creates a {@link NodeEventListener} that collects nodes from all events. 042 */ 043 public HashSetNodeEventListener() { 044 this.nodes = Node.newSet(); 045 this.filter = EnumSet.allOf(NodeEvent.class); 046 } 047 048 /** 049 * Creates a {@link NodeEventListener} that collects nodes from all events that match a given 050 * filter. 051 */ 052 public HashSetNodeEventListener(Set<NodeEvent> filter) { 053 this.nodes = Node.newSet(); 054 this.filter = filter; 055 } 056 057 /** 058 * Excludes a given event from those for which nodes are collected. 059 */ 060 public HashSetNodeEventListener exclude(NodeEvent e) { 061 filter.remove(e); 062 return this; 063 } 064 065 public void event(NodeEvent e, Node node) { 066 if (filter.contains(e)) { 067 nodes.add(node); 068 } 069 } 070 071 /** 072 * Gets the set being used to accumulate the nodes communicated to this listener. 073 */ 074 public Set<Node> getNodes() { 075 return nodes; 076 } 077}