Restoring authorship annotation for <bnagaev@yandex-team.ru>. Commit 1 of 2.

1 files changed, 86 insertions, 86 deletions

diff --git a/contrib/libs/hyperscan/src/nfa/castle_internal.h b/contrib/libs/hyperscan/src/nfa/castle_internal.h
index 429c232ff8..2b7b84b69a 100644
--- a/contrib/libs/hyperscan/src/nfa/castle_internal.h
+++ b/contrib/libs/hyperscan/src/nfa/castle_internal.h
@@ -1,79 +1,79 @@
-/*
+/* 
  * Copyright (c) 2015-2016, 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 Castle: multi-tenant repeat engine, data structures.
- */
-
-#ifndef NFA_CASTLE_INTERNAL_H
-#define NFA_CASTLE_INTERNAL_H
-
-#include "ue2common.h"
-#include "repeat_internal.h"
-
-struct SubCastle {
-    ReportID report;        //!< report to raise on match
-    u32 fullStateOffset;    //!< offset within full state (scratch)
-    u32 streamStateOffset;  //!< offset within stream state
-    u32 repeatInfoOffset;   //!< offset of RepeatInfo structure
-                            //   relative to the start of SubCastle
+ * 
+ * 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 Castle: multi-tenant repeat engine, data structures. 
+ */ 
+ 
+#ifndef NFA_CASTLE_INTERNAL_H 
+#define NFA_CASTLE_INTERNAL_H 
+ 
+#include "ue2common.h" 
+#include "repeat_internal.h" 
+ 
+struct SubCastle { 
+    ReportID report;        //!< report to raise on match 
+    u32 fullStateOffset;    //!< offset within full state (scratch) 
+    u32 streamStateOffset;  //!< offset within stream state 
+    u32 repeatInfoOffset;   //!< offset of RepeatInfo structure 
+                            //   relative to the start of SubCastle 
     u32 exclusiveId;        //!< exclusive group id of this SubCastle,
                             //   set to the number of SubCastles in Castle
                             //   if it is not exclusive
-};
-
-#define CASTLE_DOT 0
-#define CASTLE_VERM 1
-#define CASTLE_NVERM 2
-#define CASTLE_SHUFTI 3
-#define CASTLE_TRUFFLE 4
-
+}; 
+ 
+#define CASTLE_DOT 0 
+#define CASTLE_VERM 1 
+#define CASTLE_NVERM 2 
+#define CASTLE_SHUFTI 3 
+#define CASTLE_TRUFFLE 4 
+ 
 enum ExclusiveType {
     NOT_EXCLUSIVE,     //!< no subcastles are exclusive
     EXCLUSIVE,         //!< a subset of subcastles are exclusive
     PURE_EXCLUSIVE     //!< all subcastles are exclusive
 };
 
-/**
- * \brief Castle engine structure.
- *
- * A Castle is a collection of repeats that all share the same character
- * reachability.
- *
- * The whole engine is laid out in memory as:
- *
- * - struct NFA
- * - struct Castle
- * - struct SubCastle[numRepeats]
- * - tables for sparse model repeats
+/** 
+ * \brief Castle engine structure. 
+ * 
+ * A Castle is a collection of repeats that all share the same character 
+ * reachability. 
+ * 
+ * The whole engine is laid out in memory as: 
+ * 
+ * - struct NFA 
+ * - struct Castle 
+ * - struct SubCastle[numRepeats] 
+ * - tables for sparse model repeats 
  * - sparse iterator for subcastles that may be stale
- *
- * Castle stores an "active repeats" multibit in stream state, followed by the
+ * 
+ * Castle stores an "active repeats" multibit in stream state, followed by the 
  * packed repeat state for each SubCastle. If there are both exclusive and
  * non-exclusive SubCastle groups, we use an active id for each exclusive group
  * and a multibit for the non-exclusive group. We also store an "active
@@ -106,12 +106,12 @@ enum ExclusiveType {
  * * ...
  * * |   |
  * * |---|
- *
- * In full state (stored in scratch space) it stores a temporary multibit over
- * the repeats (used by \ref castleMatchLoop), followed by the repeat control
+ * 
+ * In full state (stored in scratch space) it stores a temporary multibit over 
+ * the repeats (used by \ref castleMatchLoop), followed by the repeat control 
  * blocks for each SubCastle.
- */
-struct ALIGN_AVX_DIRECTIVE Castle {
+ */ 
+struct ALIGN_AVX_DIRECTIVE Castle { 
     u32 numRepeats;         //!< number of repeats in Castle
     u32 numGroups;          //!< number of exclusive groups
     u8 type;                //!< tells us which scanning mechanism (below) to use
@@ -125,19 +125,19 @@ struct ALIGN_AVX_DIRECTIVE Castle {
     u32 groupIterOffset;    //!< offset to a iterator to check the aliveness of
                             // exclusive groups
 
-    union {
-        struct {
-            char c;
-        } verm;
-        struct {
-            m128 mask_lo;
-            m128 mask_hi;
-        } shuf;
-        struct {
-            m128 mask1;
-            m128 mask2;
-        } truffle;
-    } u;
-};
-
-#endif // NFA_CASTLE_INTERNAL_H
+    union { 
+        struct { 
+            char c; 
+        } verm; 
+        struct { 
+            m128 mask_lo; 
+            m128 mask_hi; 
+        } shuf; 
+        struct { 
+            m128 mask1; 
+            m128 mask2; 
+        } truffle; 
+    } u; 
+}; 
+ 
+#endif // NFA_CASTLE_INTERNAL_H