Initial commit of Hyperscan

src/util/charreach_util.h

@@ -0,0 +1,89 @@
+/*
+ * 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 CHARREACH_UTIL_H
+#define CHARREACH_UTIL_H
+
+#include <map>
+#include <set>
+
+#include "charreach.h"
+
+namespace ue2 {
+
+template<typename T>
+std::map<CharReach, std::set<T> >
+make_disjoint(const std::map<CharReach, std::set<T> > &in) {
+    using namespace std;
+
+    map<u8, set<T> > by_char;
+    for (typename map<CharReach, set<T> >::const_iterator it = in.begin();
+         it != in.end(); ++it) {
+        const CharReach &cr = it->first;
+        for (size_t j = cr.find_first(); j != CharReach::npos;
+             j = cr.find_next(j)) {
+            by_char[j].insert(it->second.begin(), it->second.end());
+        }
+    }
+
+    map<set<T>, CharReach> rev;
+    for (typename map<u8, set<T> >::const_iterator it = by_char.begin();
+         it != by_char.end(); ++it) {
+        rev[it->second].set(it->first);
+    }
+
+    map<CharReach, set<T> > out;
+    for (typename map<set<T>, CharReach>::const_iterator it = rev.begin();
+         it != rev.end(); ++it) {
+        assert(out.find(it->second) == out.end());
+        out[it->second] = it->first;
+    }
+
+    return out;
+}
+
+void make_caseless(CharReach *cr);
+
+/**
+ * \brief Fill a bitvector with the contents of the given CharReach.
+ *
+ * \a bits should point at an array of 32 bytes.
+ */
+void fill_bitvector(const CharReach &cr, u8 *bits);
+
+/**
+ * \brief Generate and and compare masks for checking the char reach.
+ *
+ * Any character c in cr will be result in (c & and_mask) == cmp_mask being true.
+ * Note: characters not in cr may also pass the and/cmp checks.
+ */
+void make_and_cmp_mask(const CharReach &cr, u8 *and_mask, u8 *cmp_mask);
+
+} // namespace ue2
+
+#endif