1/*
2 * Copyright (c) 2016, 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
30#include "rdfa_graph.h"
31
32#include "rdfa.h"
33#include "util/container.h"
34
35#include <vector>
36
37using namespace std;
38
39namespace ue2 {
40
41RdfaGraph::RdfaGraph(const raw_dfa &rdfa) {
42 RdfaGraph &g = *this;
43
44 vector<RdfaGraph::vertex_descriptor> verts;
45 verts.reserve(rdfa.states.size());
46 for (dstate_id_t i = 0; i < rdfa.states.size(); i++) {
47 verts.push_back(add_vertex(g));
48 assert(g[verts.back()].index == i);
49 }
50
51 symbol_t symbol_end = rdfa.alpha_size - 1;
52
53 flat_set<dstate_id_t> local_succs;
54 for (dstate_id_t i = 0; i < rdfa.states.size(); i++) {
55 local_succs.clear();
56 for (symbol_t s = 0; s < symbol_end; s++) {
57 dstate_id_t next = rdfa.states[i].next[s];
58 if (contains(local_succs, next)) {
59 continue;
60 }
61 DEBUG_PRINTF("%hu->%hu\n", i, next);
62 add_edge(verts[i], verts[next], g);
63 local_succs.insert(next);
64 }
65 }
66}
67
68}
69