1 | /* |
2 | * Copyright (c) 2015, Intel Corporation |
3 | * |
4 | * Redistribution and use in source and binary forms, with or without |
5 | * modification, are permitted provided that the following conditions are met: |
6 | * |
7 | * * Redistributions of source code must retain the above copyright notice, |
8 | * this list of conditions and the following disclaimer. |
9 | * * Redistributions in binary form must reproduce the above copyright |
10 | * notice, this list of conditions and the following disclaimer in the |
11 | * documentation and/or other materials provided with the distribution. |
12 | * * Neither the name of Intel Corporation nor the names of its contributors |
13 | * may be used to endorse or promote products derived from this software |
14 | * without specific prior written permission. |
15 | * |
16 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
17 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
18 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
19 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
20 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
21 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
22 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
23 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
24 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
25 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
26 | * POSSIBILITY OF SUCH DAMAGE. |
27 | */ |
28 | |
29 | /** \file |
30 | * \brief Functions for pruning unreachable vertices or reports from the graph. |
31 | */ |
32 | |
33 | #ifndef NG_PRUNE_H |
34 | #define NG_PRUNE_H |
35 | |
36 | #include "ue2common.h" |
37 | |
38 | namespace ue2 { |
39 | |
40 | class NGHolder; |
41 | class ReportManager; |
42 | |
43 | /** Remove any vertices that can't be reached by traversing the graph in |
44 | * reverse from acceptEod. */ |
45 | void pruneUnreachable(NGHolder &g); |
46 | |
47 | /** Remove any vertices which can't be reached by traversing the graph forward |
48 | * from start or in reverse from acceptEod. If \p renumber is false, no |
49 | * vertex/edge renumbering is done. */ |
50 | void pruneUseless(NGHolder &g, bool renumber = true); |
51 | |
52 | /** Remove any vertices with empty reachability. */ |
53 | void pruneEmptyVertices(NGHolder &g); |
54 | |
55 | /** Remove any edges from vertices that generate accepts (for Highlander |
56 | * graphs). */ |
57 | void pruneHighlanderAccepts(NGHolder &g, const ReportManager &rm); |
58 | |
59 | /** |
60 | * Prune highlander reports that are dominated by earlier ones in the graph. |
61 | */ |
62 | void pruneHighlanderDominated(NGHolder &g, const ReportManager &rm); |
63 | |
64 | /** Removes the given Report ID from vertices connected to accept, and then |
65 | * prunes useless vertices that have had their report sets reduced to empty. */ |
66 | void pruneReport(NGHolder &g, ReportID report); |
67 | |
68 | /** Removes all Report IDs bar the given one from vertices connected to accept, |
69 | * and then prunes useless vertices that have had their report sets reduced to |
70 | * empty. */ |
71 | void pruneAllOtherReports(NGHolder &g, ReportID report); |
72 | |
73 | } // namespace ue2 |
74 | |
75 | #endif // NG_PRUNE_H |
76 | |