mirror of
https://github.com/VectorCamp/vectorscan.git
synced 2025-06-28 16:41:01 +03:00
57 lines
2.2 KiB
C++
57 lines
2.2 KiB
C++
/*
|
|
* Copyright (c) 2015, Intel Corporation
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* * Redistributions of source code must retain the above copyright notice,
|
|
* this list of conditions and the following disclaimer.
|
|
* * Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* * Neither the name of Intel Corporation nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#ifndef ROSE_IN_UTIL_H
|
|
#define ROSE_IN_UTIL_H
|
|
|
|
#include "rose_in_graph.h"
|
|
#include "nfa/nfa_kind.h"
|
|
|
|
#include <vector>
|
|
|
|
namespace ue2 {
|
|
|
|
/* Returns a topological ordering of the vertices in g. That is the starts are
|
|
* at the front and all the predecessors of a vertex occur earlier in the list
|
|
* than the vertex. */
|
|
std::vector<RoseInVertex> topo_order(const RoseInGraph &g);
|
|
|
|
std::unique_ptr<RoseInGraph> cloneRoseGraph(const RoseInGraph &ig);
|
|
void calcVertexOffsets(RoseInGraph &ig);
|
|
enum nfa_kind whatRoseIsThis(const RoseInGraph &in, const RoseInEdge &e);
|
|
void pruneUseless(RoseInGraph &g);
|
|
|
|
inline
|
|
bool is_any_accept(RoseInVertex v, const RoseInGraph &g) {
|
|
return g[v].type == RIV_ACCEPT || g[v].type == RIV_ACCEPT_EOD;
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|