| 1 | /* |
| 2 | * Copyright (c) 2015-2017, 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 Rose Build: functions for reducing the number of engines in a Rose |
| 31 | * graph through merging or deduplicating engines. |
| 32 | */ |
| 33 | |
| 34 | #ifndef ROSE_BUILD_MERGE_H |
| 35 | #define ROSE_BUILD_MERGE_H |
| 36 | |
| 37 | #include "rose_graph.h" |
| 38 | |
| 39 | #include <deque> |
| 40 | #include <set> |
| 41 | |
| 42 | namespace ue2 { |
| 43 | |
| 44 | class NGHolder; |
| 45 | class RoseBuildImpl; |
| 46 | |
| 47 | bool dedupeLeftfixes(RoseBuildImpl &tbi); |
| 48 | void mergeLeftfixesVariableLag(RoseBuildImpl &tbi); |
| 49 | void dedupeLeftfixesVariableLag(RoseBuildImpl &tbi); |
| 50 | void dedupeSuffixes(RoseBuildImpl &tbi); |
| 51 | |
| 52 | void mergeAcyclicSuffixes(RoseBuildImpl &tbi); |
| 53 | void mergeSmallSuffixes(RoseBuildImpl &tbi); |
| 54 | void mergeSmallLeftfixes(RoseBuildImpl &tbi); |
| 55 | void mergeCastleLeftfixes(RoseBuildImpl &tbi); |
| 56 | void mergeOutfixes(RoseBuildImpl &tbi); |
| 57 | void mergePuffixes(RoseBuildImpl &tbi); |
| 58 | void mergeCastleSuffixes(RoseBuildImpl &tbi); |
| 59 | |
| 60 | bool mergeableRoseVertices(const RoseBuildImpl &tbi, RoseVertex u, |
| 61 | RoseVertex v); |
| 62 | bool mergeableRoseVertices(const RoseBuildImpl &tbi, |
| 63 | const std::set<RoseVertex> &v1, |
| 64 | const std::set<RoseVertex> &v2); |
| 65 | bool setDistinctRoseTops(RoseGraph &g, NGHolder &h1, const NGHolder &h2, |
| 66 | const std::deque<RoseVertex> &verts1); |
| 67 | |
| 68 | } // namespace ue2 |
| 69 | |
| 70 | #endif // ROSE_BUILD_MERGE_H |
| 71 | |