| 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 ROSE_BUILD_WIDTH_H |
| 30 | #define ROSE_BUILD_WIDTH_H |
| 31 | |
| 32 | #include "rose_build_impl.h" |
| 33 | #include "ue2common.h" |
| 34 | |
| 35 | namespace ue2 { |
| 36 | |
| 37 | class RoseBuildImpl; |
| 38 | |
| 39 | /* returns a lower bound on the minimum number of bytes required for match to be |
| 40 | * raised up to the user which requires the given literal table to be used |
| 41 | * |
| 42 | * returns ROSE_BOUND_INF if the table can never produce matches */ |
| 43 | u32 findMinWidth(const RoseBuildImpl &tbi, enum rose_literal_table table); |
| 44 | |
| 45 | /* returns an upper bound on the maximum length of a buffer that can result in |
| 46 | * matches. If there are any patterns which are not bianchored (start and end |
| 47 | * anchored), then there is no such limit and ROSE_BOUND_INF is returned. |
| 48 | */ |
| 49 | u32 findMaxBAWidth(const RoseBuildImpl &tbi); |
| 50 | |
| 51 | /* returns an upper bound on the maximum length of a buffer that can result in |
| 52 | * matches and requires that the given table to be used. If there are any |
| 53 | * patterns which are not bianchored (start and end anchored), then there is no |
| 54 | * such limit and ROSE_BOUND_INF is returned. |
| 55 | */ |
| 56 | u32 findMaxBAWidth(const RoseBuildImpl &tbi, enum rose_literal_table table); |
| 57 | |
| 58 | /** |
| 59 | * Note: there is no function for determining the min width of the whole rose |
| 60 | * as this is more easily done by the NG layer which has access to the full |
| 61 | * nfagraphs before they are chopped into little pieces. |
| 62 | */ |
| 63 | |
| 64 | } // namespace ue2 |
| 65 | |
| 66 | #endif |
| 67 | |