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#ifndef ROSE_IN_UTIL_H
30#define ROSE_IN_UTIL_H
31
32#include "rose_in_graph.h"
33#include "nfa/nfa_kind.h"
34
35#include <vector>
36
37namespace ue2 {
38
39/* Returns a topological ordering of the vertices in g. That is the starts are
40 * at the front and all the predecessors of a vertex occur earlier in the list
41 * than the vertex. */
42std::vector<RoseInVertex> topo_order(const RoseInGraph &g);
43
44std::unique_ptr<RoseInGraph> cloneRoseGraph(const RoseInGraph &ig);
45void calcVertexOffsets(RoseInGraph &ig);
46enum nfa_kind whatRoseIsThis(const RoseInGraph &in, const RoseInEdge &e);
47void pruneUseless(RoseInGraph &g);
48
49inline
50bool is_any_accept(RoseInVertex v, const RoseInGraph &g) {
51 return g[v].type == RIV_ACCEPT || g[v].type == RIV_ACCEPT_EOD;
52}
53
54}
55
56#endif
57