mirror of
https://github.com/VectorCamp/vectorscan.git
synced 2025-07-14 14:34:44 +03:00
This commit replaces the ue2::unordered_{set,map} types with their STL versions, with some new hashing utilities in util/hash.h. The new types ue2_unordered_set<T> and ue2_unordered_map<Key, T> default to using the ue2_hasher. The header util/ue2_containers.h has been removed, and the flat_set/map containers moved to util/flat_containers.h.
74 lines
2.6 KiB
C++
74 lines
2.6 KiB
C++
/*
|
|
* Copyright (c) 2015-2017, 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.
|
|
*/
|
|
|
|
/** \file
|
|
* \brief Shufti acceleration: compile code.
|
|
*/
|
|
|
|
#ifndef SHUFTI_COMPILE_H
|
|
#define SHUFTI_COMPILE_H
|
|
|
|
#include "ue2common.h"
|
|
#include "util/charreach.h"
|
|
#include "util/flat_containers.h"
|
|
|
|
#include <utility>
|
|
|
|
namespace ue2 {
|
|
|
|
/** \brief Single-byte variant.
|
|
*
|
|
* Returns -1 if unable to construct masks, otherwise returns number of bits
|
|
* used in the mask.
|
|
*
|
|
* Note: always able to construct masks for 8 or fewer characters.
|
|
*/
|
|
int shuftiBuildMasks(const CharReach &chars, u8 *lo, u8 *hi);
|
|
|
|
/** \brief Double-byte variant
|
|
*
|
|
* Returns false if we are unable to build the masks (too many buckets required)
|
|
*/
|
|
bool shuftiBuildDoubleMasks(const CharReach &onechar,
|
|
const flat_set<std::pair<u8, u8>> &twochar,
|
|
u8 *lo1, u8 *hi1, u8 *lo2, u8 *hi2);
|
|
|
|
#ifdef DUMP_SUPPORT
|
|
|
|
/**
|
|
* \brief Dump code: returns a CharReach with the reach that would match this
|
|
* shufti.
|
|
*/
|
|
CharReach shufti2cr(const u8 *lo, const u8 *hi);
|
|
|
|
#endif // DUMP_SUPPORT
|
|
|
|
} // namespace ue2
|
|
|
|
#endif // SHUFTI_COMPILE_H
|