1/*
2 * Copyright (c) 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#include "rose_build_engine_blob.h"
30
31#include "rose_build_lookaround.h"
32#include "util/charreach_util.h"
33
34using namespace std;
35
36namespace ue2 {
37
38u32 lookaround_info::get_offset_of(const vector<vector<CharReach>> &reaches,
39 RoseEngineBlob &blob) {
40 assert(reaches.size() != 1);
41
42 // Check the cache.
43 auto it = multi_cache.find(reaches);
44 if (it != multi_cache.end()) {
45 DEBUG_PRINTF("reusing reach at idx %u\n", it->second);
46 return it->second;
47 }
48
49 vector<u8> raw_reach(reaches.size() * MULTI_REACH_BITVECTOR_LEN);
50 size_t off = 0;
51 for (const auto &m : reaches) {
52 u8 u = 0;
53 assert(m.size() == MAX_LOOKAROUND_PATHS);
54 for (size_t i = 0; i < m.size(); i++) {
55 if (m[i].none()) {
56 u |= (u8)1U << i;
57 }
58 }
59 fill_n(raw_reach.data() + off, MULTI_REACH_BITVECTOR_LEN, u);
60
61 for (size_t i = 0; i < m.size(); i++) {
62 const CharReach &cr = m[i];
63 if (cr.none()) {
64 continue;
65 }
66
67 for (size_t c = cr.find_first(); c != cr.npos;
68 c = cr.find_next(c)) {
69 raw_reach[c + off] |= (u8)1U << i;
70 }
71 }
72
73 off += MULTI_REACH_BITVECTOR_LEN;
74 }
75
76 u32 reach_idx = blob.add_range(raw_reach);
77 DEBUG_PRINTF("adding reach at idx %u\n", reach_idx);
78 multi_cache.emplace(reaches, reach_idx);
79
80 return reach_idx;
81}
82
83u32 lookaround_info::get_offset_of(const vector<CharReach> &reach,
84 RoseEngineBlob &blob) {
85 if (contains(rcache, reach)) {
86 u32 offset = rcache[reach];
87 DEBUG_PRINTF("reusing reach at idx %u\n", offset);
88 return offset;
89 }
90
91 vector<u8> raw_reach(reach.size() * REACH_BITVECTOR_LEN);
92 size_t off = 0;
93 for (const auto &cr : reach) {
94 assert(cr.any()); // Should be at least one character!
95 fill_bitvector(cr, raw_reach.data() + off);
96 off += REACH_BITVECTOR_LEN;
97 }
98
99 u32 offset = blob.add_range(raw_reach);
100 rcache.emplace(reach, offset);
101 return offset;
102}
103
104u32 lookaround_info::get_offset_of(const vector<s8> &look,
105 RoseEngineBlob &blob) {
106 if (contains(lcache, look)) {
107 u32 offset = lcache[look];
108 DEBUG_PRINTF("reusing look at idx %u\n", offset);
109 return offset;
110 }
111
112 u32 offset = blob.add_range(look);
113 lcache.emplace(look, offset);
114 return offset;
115}
116
117} // namespace ue2
118