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 NFA_API_UTIL_H
30#define NFA_API_UTIL_H
31
32#include "nfa_api_queue.h"
33#include "ue2common.h"
34
35/* returns the byte prior to the given location, NUL if not available */
36static really_inline
37u8 queue_prev_byte(const struct mq *q, s64a loc) {
38 if (loc <= 0) {
39 if (1LL - loc > (s64a)q->hlength) {
40 return 0; /* assume NUL for start of stream write */
41 }
42 // In the history buffer.
43 assert(q->history);
44 assert(q->hlength >= (u64a)(loc * -1));
45 return q->history[q->hlength - 1 + loc];
46 } else {
47 // In the stream write buffer.
48 assert(q->buffer);
49 assert(q->length >= (u64a)loc);
50 return q->buffer[loc - 1];
51 }
52}
53
54/* this is a modified version of pushQueue where we statically know the state of
55 * the queue. Does not attempt to merge and inserts at the given queue
56 * position. */
57static really_inline
58void pushQueueAt(struct mq * restrict q, u32 pos, u32 e, s64a loc) {
59 assert(pos == q->end);
60 DEBUG_PRINTF("pushing %u@%lld -> %u\n", e, loc, q->end);
61 assert(q->end < MAX_MQE_LEN);
62 assert(e < MQE_INVALID);
63/* stop gcc getting too smart for its own good */
64/* assert(!q->end || q->items[q->end - 1].location <= loc); */
65 assert(q->end || e == MQE_START);
66
67#ifndef NDEBUG
68 // We assert that the event is different from its predecessor. If it's a
69 // dupe, you should have used the ordinary pushQueue call.
70 if (q->end) {
71 UNUSED struct mq_item *prev = &q->items[q->end - 1];
72 assert(prev->type != e || prev->location != loc);
73 }
74#endif
75
76 struct mq_item *item = &q->items[pos];
77 item->type = e;
78 item->location = loc;
79 item->som = 0;
80 q->end = pos + 1;
81}
82#endif
83