text: /*
   * Copyright (c) 2015-2017, Intel Corporation
   * Copyright (c) 2021, Arm Limited
   *
   * 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 Large Bounded Repeat (LBR) engine build code for SVE.
   */
  
  static
  bytecode_ptr<NFA> buildLbrVerm16(const CharReach &cr, const depth &repeatMin,
                                   const depth &repeatMax, u32 minPeriod,
                                   bool is_reset, ReportID report) {
      const CharReach escapes(~cr);
  
      if (escapes.count() > 16) {
          return nullptr;
      }
  
      enum RepeatType rtype = chooseRepeatType(repeatMin, repeatMax, minPeriod,
                                               is_reset);
      auto nfa = makeLbrNfa<lbr_verm16>(LBR_NFA_VERM16, rtype, repeatMax);
      struct lbr_verm16 *lv = (struct lbr_verm16 *)getMutableImplNfa(nfa.get());
      vermicelli16Build(escapes, (u8 *)&lv->mask);
  
      fillNfa<lbr_verm16>(nfa.get(), &lv->common, report, repeatMin, repeatMax,
                          minPeriod, rtype);
  
      DEBUG_PRINTF("built verm16 lbr\n");
      return nfa;
  }
  
  static
  bytecode_ptr<NFA> buildLbrNVerm16(const CharReach &cr, const depth &repeatMin,
                                    const depth &repeatMax, u32 minPeriod,
                                    bool is_reset, ReportID report) {
      const CharReach escapes(cr);
  
      if (escapes.count() > 16) {
          return nullptr;
      }
  
      enum RepeatType rtype = chooseRepeatType(repeatMin, repeatMax, minPeriod,
                                               is_reset);
      auto nfa = makeLbrNfa<lbr_verm16>(LBR_NFA_NVERM16, rtype, repeatMax);
      struct lbr_verm16 *lv = (struct lbr_verm16 *)getMutableImplNfa(nfa.get());
      vermicelli16Build(escapes, (u8 *)&lv->mask);
  
      fillNfa<lbr_verm16>(nfa.get(), &lv->common, report, repeatMin, repeatMax,
                          minPeriod, rtype);
  
      DEBUG_PRINTF("built negated verm16 lbr\n");
      return nfa;
  }