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

1 files changed, 482 insertions, 482 deletions

diff --git a/contrib/libs/re2/.yandex_meta/licenses.list.txt b/contrib/libs/re2/.yandex_meta/licenses.list.txt
index adf6caa071..454d3663c9 100644
--- a/contrib/libs/re2/.yandex_meta/licenses.list.txt
+++ b/contrib/libs/re2/.yandex_meta/licenses.list.txt
@@ -1,482 +1,482 @@
-====================BSD-3-Clause==================== 
-// 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 Google Inc. 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. 
- 
-====================BSD-3-Clause==================== 
-// Use of this source code is governed by a BSD-style 
-// license that can be found in the LICENSE file. 
- 
- 
-====================BSD-3-Clause==================== 
-under the BSD-style license found in the LICENSE file. 
- 
- 
-====================COPYRIGHT==================== 
- * The authors of this software are Rob Pike and Ken Thompson. 
- *              Copyright (c) 2002 by Lucent Technologies. 
- * Permission to use, copy, modify, and distribute this software for any 
- * purpose without fee is hereby granted, provided that this entire notice 
- * is included in all copies of any software which is or includes a copy 
- * or modification of this software and in all copies of the supporting 
- 
- 
-====================COPYRIGHT==================== 
-// Copyright (c) 2009 The RE2 Authors. All rights reserved. 
- 
- 
-====================COPYRIGHT==================== 
-// Copyright 1999-2005 The RE2 Authors.  All Rights Reserved. 
- 
- 
-====================COPYRIGHT==================== 
-// Copyright 2001-2010 The RE2 Authors.  All Rights Reserved. 
- 
- 
-====================COPYRIGHT==================== 
-// Copyright 2003-2009 Google Inc.  All rights reserved. 
- 
- 
-====================COPYRIGHT==================== 
-// Copyright 2003-2009 The RE2 Authors.  All Rights Reserved. 
- 
- 
-====================COPYRIGHT==================== 
-// Copyright 2003-2010 Google Inc.  All Rights Reserved. 
- 
- 
-====================COPYRIGHT==================== 
-// Copyright 2004 The RE2 Authors.  All Rights Reserved. 
- 
- 
-====================COPYRIGHT==================== 
-// Copyright 2006 The RE2 Authors.  All Rights Reserved. 
- 
- 
-====================COPYRIGHT==================== 
-// Copyright 2006-2007 The RE2 Authors.  All Rights Reserved. 
- 
- 
-====================COPYRIGHT==================== 
-// Copyright 2007 The RE2 Authors.  All Rights Reserved. 
- 
- 
-====================COPYRIGHT==================== 
-// Copyright 2008 The RE2 Authors.  All Rights Reserved. 
- 
- 
-====================COPYRIGHT==================== 
-// Copyright 2009 The RE2 Authors.  All Rights Reserved. 
- 
- 
-====================COPYRIGHT==================== 
-// Copyright 2010 The RE2 Authors.  All Rights Reserved. 
- 
- 
-====================COPYRIGHT==================== 
-// Copyright 2016 The RE2 Authors.  All Rights Reserved. 
- 
- 
-====================COPYRIGHT==================== 
-// Copyright 2018 The RE2 Authors.  All Rights Reserved. 
- 
- 
-====================File: AUTHORS==================== 
-# This is the official list of RE2 authors for copyright purposes. 
-# This file is distinct from the CONTRIBUTORS files. 
-# See the latter for an explanation. 
- 
-# Names should be added to this file as 
-#	Name or Organization <email address> 
-# The email address is not required for organizations. 
- 
-# Please keep the list sorted. 
- 
-Google Inc. 
-Samsung Electronics 
-Stefano Rivera <stefano.rivera@gmail.com> 
- 
- 
-====================File: CONTRIBUTORS==================== 
-# This is the official list of people who can contribute 
-# (and typically have contributed) code to the RE2 repository. 
-# The AUTHORS file lists the copyright holders; this file 
-# lists people.  For example, Google employees are listed here 
-# but not in AUTHORS, because Google holds the copyright. 
-# 
-# The submission process automatically checks to make sure 
-# that people submitting code are listed in this file (by email address). 
-# 
-# Names should be added to this file only after verifying that 
-# the individual or the individual's organization has agreed to 
-# the appropriate Contributor License Agreement, found here: 
-# 
-#     http://code.google.com/legal/individual-cla-v1.0.html 
-#     http://code.google.com/legal/corporate-cla-v1.0.html 
-# 
-# The agreement for individuals can be filled out on the web. 
-# 
-# When adding J Random Contributor's name to this file, 
-# either J's name or J's organization's name should be 
-# added to the AUTHORS file, depending on whether the 
-# individual or corporate CLA was used. 
- 
-# Names should be added to this file like so: 
-#     Name <email address> 
- 
-# Please keep the list sorted. 
- 
-Dominic Battré <battre@chromium.org> 
-Doug Kwan <dougkwan@google.com> 
-Dmitriy Vyukov <dvyukov@google.com> 
-John Millikin <jmillikin@gmail.com> 
-Mike Nazarewicz <mpn@google.com> 
-Nico Weber <thakis@chromium.org> 
-Pawel Hajdan <phajdan.jr@gmail.com> 
-Rob Pike <r@google.com> 
-Russ Cox <rsc@swtch.com> 
-Sanjay Ghemawat <sanjay@google.com> 
-Stefano Rivera <stefano.rivera@gmail.com> 
-Srinivasan Venkatachary <vsri@google.com> 
-Viatcheslav Ostapenko <sl.ostapenko@samsung.com> 
- 
- 
-====================File: LICENSE==================== 
-// Copyright (c) 2009 The RE2 Authors. All rights reserved. 
-// 
-// 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 Google Inc. 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: util/rune.cc==================== 
-/* 
- * The authors of this software are Rob Pike and Ken Thompson. 
- *              Copyright (c) 2002 by Lucent Technologies. 
- * Permission to use, copy, modify, and distribute this software for any 
- * purpose without fee is hereby granted, provided that this entire notice 
- * is included in all copies of any software which is or includes a copy 
- * or modification of this software and in all copies of the supporting 
- * documentation for such software. 
- * THIS SOFTWARE IS BEING PROVIDED "AS IS", WITHOUT ANY EXPRESS OR IMPLIED 
- * WARRANTY.  IN PARTICULAR, NEITHER THE AUTHORS NOR LUCENT TECHNOLOGIES MAKE ANY 
- * REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY 
- * OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE. 
- */ 
- 
-#include <stdarg.h> 
-#include <string.h> 
- 
-#include "util/utf.h" 
- 
-namespace re2 { 
- 
-enum 
-{ 
-	Bit1	= 7, 
-	Bitx	= 6, 
-	Bit2	= 5, 
-	Bit3	= 4, 
-	Bit4	= 3, 
-	Bit5	= 2,  
- 
-	T1	= ((1<<(Bit1+1))-1) ^ 0xFF,	/* 0000 0000 */ 
-	Tx	= ((1<<(Bitx+1))-1) ^ 0xFF,	/* 1000 0000 */ 
-	T2	= ((1<<(Bit2+1))-1) ^ 0xFF,	/* 1100 0000 */ 
-	T3	= ((1<<(Bit3+1))-1) ^ 0xFF,	/* 1110 0000 */ 
-	T4	= ((1<<(Bit4+1))-1) ^ 0xFF,	/* 1111 0000 */ 
-	T5	= ((1<<(Bit5+1))-1) ^ 0xFF,	/* 1111 1000 */ 
- 
-	Rune1	= (1<<(Bit1+0*Bitx))-1,		/* 0000 0000 0111 1111 */ 
-	Rune2	= (1<<(Bit2+1*Bitx))-1,		/* 0000 0111 1111 1111 */ 
-	Rune3	= (1<<(Bit3+2*Bitx))-1,		/* 1111 1111 1111 1111 */ 
-	Rune4	= (1<<(Bit4+3*Bitx))-1, 
-                                        /* 0001 1111 1111 1111 1111 1111 */ 
- 
-	Maskx	= (1<<Bitx)-1,			/* 0011 1111 */ 
-	Testx	= Maskx ^ 0xFF,			/* 1100 0000 */ 
- 
-	Bad	= Runeerror, 
-}; 
- 
-int 
-chartorune(Rune *rune, const char *str) 
-{ 
-	int c, c1, c2, c3; 
-	long l; 
- 
-	/* 
-	 * one character sequence 
-	 *	00000-0007F => T1 
-	 */ 
-	c = *(unsigned char*)str; 
-	if(c < Tx) { 
-		*rune = c; 
-		return 1; 
-	} 
- 
-	/* 
-	 * two character sequence 
-	 *	0080-07FF => T2 Tx 
-	 */ 
-	c1 = *(unsigned char*)(str+1) ^ Tx; 
-	if(c1 & Testx) 
-		goto bad; 
-	if(c < T3) { 
-		if(c < T2) 
-			goto bad; 
-		l = ((c << Bitx) | c1) & Rune2; 
-		if(l <= Rune1) 
-			goto bad; 
-		*rune = l; 
-		return 2; 
-	} 
- 
-	/* 
-	 * three character sequence 
-	 *	0800-FFFF => T3 Tx Tx 
-	 */ 
-	c2 = *(unsigned char*)(str+2) ^ Tx; 
-	if(c2 & Testx) 
-		goto bad; 
-	if(c < T4) { 
-		l = ((((c << Bitx) | c1) << Bitx) | c2) & Rune3; 
-		if(l <= Rune2) 
-			goto bad; 
-		*rune = l; 
-		return 3; 
-	} 
- 
-	/* 
-	 * four character sequence (21-bit value) 
-	 *	10000-1FFFFF => T4 Tx Tx Tx 
-	 */ 
-	c3 = *(unsigned char*)(str+3) ^ Tx; 
-	if (c3 & Testx) 
-		goto bad; 
-	if (c < T5) { 
-		l = ((((((c << Bitx) | c1) << Bitx) | c2) << Bitx) | c3) & Rune4; 
-		if (l <= Rune3) 
-			goto bad; 
-		*rune = l; 
-		return 4; 
-	} 
- 
-	/* 
-	 * Support for 5-byte or longer UTF-8 would go here, but 
-	 * since we don't have that, we'll just fall through to bad. 
-	 */ 
- 
-	/* 
-	 * bad decoding 
-	 */ 
-bad: 
-	*rune = Bad; 
-	return 1; 
-} 
- 
-int 
-runetochar(char *str, const Rune *rune) 
-{ 
-	/* Runes are signed, so convert to unsigned for range check. */ 
-	unsigned long c; 
- 
-	/* 
-	 * one character sequence 
-	 *	00000-0007F => 00-7F 
-	 */ 
-	c = *rune; 
-	if(c <= Rune1) { 
-		str[0] = static_cast<char>(c); 
-		return 1; 
-	} 
- 
-	/* 
-	 * two character sequence 
-	 *	0080-07FF => T2 Tx 
-	 */ 
-	if(c <= Rune2) { 
-		str[0] = T2 | static_cast<char>(c >> 1*Bitx); 
-		str[1] = Tx | (c & Maskx); 
-		return 2; 
-	} 
- 
-	/* 
-	 * If the Rune is out of range, convert it to the error rune. 
-	 * Do this test here because the error rune encodes to three bytes. 
-	 * Doing it earlier would duplicate work, since an out of range 
-	 * Rune wouldn't have fit in one or two bytes. 
-	 */ 
-	if (c > Runemax) 
-		c = Runeerror; 
- 
-	/* 
-	 * three character sequence 
-	 *	0800-FFFF => T3 Tx Tx 
-	 */ 
-	if (c <= Rune3) { 
-		str[0] = T3 | static_cast<char>(c >> 2*Bitx); 
-		str[1] = Tx | ((c >> 1*Bitx) & Maskx); 
-		str[2] = Tx | (c & Maskx); 
-		return 3; 
-	} 
- 
-	/* 
-	 * four character sequence (21-bit value) 
-	 *     10000-1FFFFF => T4 Tx Tx Tx 
-	 */ 
-	str[0] = T4 | static_cast<char>(c >> 3*Bitx); 
-	str[1] = Tx | ((c >> 2*Bitx) & Maskx); 
-	str[2] = Tx | ((c >> 1*Bitx) & Maskx); 
-	str[3] = Tx | (c & Maskx); 
-	return 4; 
-} 
- 
-int 
-runelen(Rune rune) 
-{ 
-	char str[10]; 
- 
-	return runetochar(str, &rune); 
-} 
- 
-int 
-fullrune(const char *str, int n) 
-{ 
-	if (n > 0) { 
-		int c = *(unsigned char*)str; 
-		if (c < Tx) 
-			return 1; 
-		if (n > 1) { 
-			if (c < T3) 
-				return 1; 
-			if (n > 2) { 
-				if (c < T4 || n > 3) 
-					return 1; 
-			} 
-		} 
-	} 
-	return 0; 
-} 
- 
- 
-int 
-utflen(const char *s) 
-{ 
-	int c; 
-	long n; 
-	Rune rune; 
- 
-	n = 0; 
-	for(;;) { 
-		c = *(unsigned char*)s; 
-		if(c < Runeself) { 
-			if(c == 0) 
-				return n; 
-			s++; 
-		} else 
-			s += chartorune(&rune, s); 
-		n++; 
-	} 
-	return 0; 
-} 
- 
-char* 
-utfrune(const char *s, Rune c) 
-{ 
-	long c1; 
-	Rune r; 
-	int n; 
- 
-	if(c < Runesync)		/* not part of utf sequence */ 
-		return strchr((char*)s, c); 
- 
-	for(;;) { 
-		c1 = *(unsigned char*)s; 
-		if(c1 < Runeself) {	/* one byte rune */ 
-			if(c1 == 0) 
-				return 0; 
-			if(c1 == c) 
-				return (char*)s; 
-			s++; 
-			continue; 
-		} 
-		n = chartorune(&r, s); 
-		if(r == c) 
-			return (char*)s; 
-		s += n; 
-	} 
-	return 0; 
-} 
- 
-}  // namespace re2 
- 
- 
-====================X11-Lucent==================== 
- * Permission to use, copy, modify, and distribute this software for any 
- * purpose without fee is hereby granted, provided that this entire notice 
- * is included in all copies of any software which is or includes a copy 
- * or modification of this software and in all copies of the supporting 
- * documentation for such software. 
- * THIS SOFTWARE IS BEING PROVIDED "AS IS", WITHOUT ANY EXPRESS OR IMPLIED 
- * WARRANTY.  IN PARTICULAR, NEITHER THE AUTHORS NOR LUCENT TECHNOLOGIES MAKE ANY 
- * REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY 
- * OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE. 
- 
- 
-====================X11-Lucent==================== 
- * Permission to use, copy, modify, and distribute this software for any 
- * purpose without fee is hereby granted, provided that this entire notice 
- * is included in all copies of any software which is or includes a copy 
- * or modification of this software and in all copies of the supporting 
- * documentation for such software. 
- * THIS SOFTWARE IS BEING PROVIDED "AS IS", WITHOUT ANY EXPRESS OR IMPLIED 
- * WARRANTY.  IN PARTICULAR, NEITHER THE AUTHORS NOR LUCENT TECHNOLOGIES MAKE ANY 
- * REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY 
- * OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE. 
- * 
- * This file and rune.cc have been converted to compile as C++ code 
+====================BSD-3-Clause====================
+// 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 Google Inc. 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.
+
+====================BSD-3-Clause====================
+// Use of this source code is governed by a BSD-style
+// license that can be found in the LICENSE file.
+
+
+====================BSD-3-Clause====================
+under the BSD-style license found in the LICENSE file.
+
+
+====================COPYRIGHT====================
+ * The authors of this software are Rob Pike and Ken Thompson.
+ *              Copyright (c) 2002 by Lucent Technologies.
+ * Permission to use, copy, modify, and distribute this software for any
+ * purpose without fee is hereby granted, provided that this entire notice
+ * is included in all copies of any software which is or includes a copy
+ * or modification of this software and in all copies of the supporting
+
+
+====================COPYRIGHT====================
+// Copyright (c) 2009 The RE2 Authors. All rights reserved.
+
+
+====================COPYRIGHT====================
+// Copyright 1999-2005 The RE2 Authors.  All Rights Reserved.
+
+
+====================COPYRIGHT====================
+// Copyright 2001-2010 The RE2 Authors.  All Rights Reserved.
+
+
+====================COPYRIGHT====================
+// Copyright 2003-2009 Google Inc.  All rights reserved.
+
+
+====================COPYRIGHT====================
+// Copyright 2003-2009 The RE2 Authors.  All Rights Reserved.
+
+
+====================COPYRIGHT====================
+// Copyright 2003-2010 Google Inc.  All Rights Reserved.
+
+
+====================COPYRIGHT====================
+// Copyright 2004 The RE2 Authors.  All Rights Reserved.
+
+
+====================COPYRIGHT====================
+// Copyright 2006 The RE2 Authors.  All Rights Reserved.
+
+
+====================COPYRIGHT====================
+// Copyright 2006-2007 The RE2 Authors.  All Rights Reserved.
+
+
+====================COPYRIGHT====================
+// Copyright 2007 The RE2 Authors.  All Rights Reserved.
+
+
+====================COPYRIGHT====================
+// Copyright 2008 The RE2 Authors.  All Rights Reserved.
+
+
+====================COPYRIGHT====================
+// Copyright 2009 The RE2 Authors.  All Rights Reserved.
+
+
+====================COPYRIGHT====================
+// Copyright 2010 The RE2 Authors.  All Rights Reserved.
+
+
+====================COPYRIGHT====================
+// Copyright 2016 The RE2 Authors.  All Rights Reserved.
+
+
+====================COPYRIGHT====================
+// Copyright 2018 The RE2 Authors.  All Rights Reserved.
+
+
+====================File: AUTHORS====================
+# This is the official list of RE2 authors for copyright purposes.
+# This file is distinct from the CONTRIBUTORS files.
+# See the latter for an explanation.
+
+# Names should be added to this file as
+#	Name or Organization <email address>
+# The email address is not required for organizations.
+
+# Please keep the list sorted.
+
+Google Inc.
+Samsung Electronics
+Stefano Rivera <stefano.rivera@gmail.com>
+
+
+====================File: CONTRIBUTORS====================
+# This is the official list of people who can contribute
+# (and typically have contributed) code to the RE2 repository.
+# The AUTHORS file lists the copyright holders; this file
+# lists people.  For example, Google employees are listed here
+# but not in AUTHORS, because Google holds the copyright.
+#
+# The submission process automatically checks to make sure
+# that people submitting code are listed in this file (by email address).
+#
+# Names should be added to this file only after verifying that
+# the individual or the individual's organization has agreed to
+# the appropriate Contributor License Agreement, found here:
+#
+#     http://code.google.com/legal/individual-cla-v1.0.html
+#     http://code.google.com/legal/corporate-cla-v1.0.html
+#
+# The agreement for individuals can be filled out on the web.
+#
+# When adding J Random Contributor's name to this file,
+# either J's name or J's organization's name should be
+# added to the AUTHORS file, depending on whether the
+# individual or corporate CLA was used.
+
+# Names should be added to this file like so:
+#     Name <email address>
+
+# Please keep the list sorted.
+
+Dominic Battré <battre@chromium.org>
+Doug Kwan <dougkwan@google.com>
+Dmitriy Vyukov <dvyukov@google.com>
+John Millikin <jmillikin@gmail.com>
+Mike Nazarewicz <mpn@google.com>
+Nico Weber <thakis@chromium.org>
+Pawel Hajdan <phajdan.jr@gmail.com>
+Rob Pike <r@google.com>
+Russ Cox <rsc@swtch.com>
+Sanjay Ghemawat <sanjay@google.com>
+Stefano Rivera <stefano.rivera@gmail.com>
+Srinivasan Venkatachary <vsri@google.com>
+Viatcheslav Ostapenko <sl.ostapenko@samsung.com>
+
+
+====================File: LICENSE====================
+// Copyright (c) 2009 The RE2 Authors. All rights reserved.
+//
+// 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 Google Inc. 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: util/rune.cc====================
+/*
+ * The authors of this software are Rob Pike and Ken Thompson.
+ *              Copyright (c) 2002 by Lucent Technologies.
+ * Permission to use, copy, modify, and distribute this software for any
+ * purpose without fee is hereby granted, provided that this entire notice
+ * is included in all copies of any software which is or includes a copy
+ * or modification of this software and in all copies of the supporting
+ * documentation for such software.
+ * THIS SOFTWARE IS BEING PROVIDED "AS IS", WITHOUT ANY EXPRESS OR IMPLIED
+ * WARRANTY.  IN PARTICULAR, NEITHER THE AUTHORS NOR LUCENT TECHNOLOGIES MAKE ANY
+ * REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY
+ * OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE.
+ */
+
+#include <stdarg.h>
+#include <string.h>
+
+#include "util/utf.h"
+
+namespace re2 {
+
+enum
+{
+	Bit1	= 7,
+	Bitx	= 6,
+	Bit2	= 5,
+	Bit3	= 4,
+	Bit4	= 3,
+	Bit5	= 2, 
+
+	T1	= ((1<<(Bit1+1))-1) ^ 0xFF,	/* 0000 0000 */
+	Tx	= ((1<<(Bitx+1))-1) ^ 0xFF,	/* 1000 0000 */
+	T2	= ((1<<(Bit2+1))-1) ^ 0xFF,	/* 1100 0000 */
+	T3	= ((1<<(Bit3+1))-1) ^ 0xFF,	/* 1110 0000 */
+	T4	= ((1<<(Bit4+1))-1) ^ 0xFF,	/* 1111 0000 */
+	T5	= ((1<<(Bit5+1))-1) ^ 0xFF,	/* 1111 1000 */
+
+	Rune1	= (1<<(Bit1+0*Bitx))-1,		/* 0000 0000 0111 1111 */
+	Rune2	= (1<<(Bit2+1*Bitx))-1,		/* 0000 0111 1111 1111 */
+	Rune3	= (1<<(Bit3+2*Bitx))-1,		/* 1111 1111 1111 1111 */
+	Rune4	= (1<<(Bit4+3*Bitx))-1,
+                                        /* 0001 1111 1111 1111 1111 1111 */
+
+	Maskx	= (1<<Bitx)-1,			/* 0011 1111 */
+	Testx	= Maskx ^ 0xFF,			/* 1100 0000 */
+
+	Bad	= Runeerror,
+};
+
+int
+chartorune(Rune *rune, const char *str)
+{
+	int c, c1, c2, c3;
+	long l;
+
+	/*
+	 * one character sequence
+	 *	00000-0007F => T1
+	 */
+	c = *(unsigned char*)str;
+	if(c < Tx) {
+		*rune = c;
+		return 1;
+	}
+
+	/*
+	 * two character sequence
+	 *	0080-07FF => T2 Tx
+	 */
+	c1 = *(unsigned char*)(str+1) ^ Tx;
+	if(c1 & Testx)
+		goto bad;
+	if(c < T3) {
+		if(c < T2)
+			goto bad;
+		l = ((c << Bitx) | c1) & Rune2;
+		if(l <= Rune1)
+			goto bad;
+		*rune = l;
+		return 2;
+	}
+
+	/*
+	 * three character sequence
+	 *	0800-FFFF => T3 Tx Tx
+	 */
+	c2 = *(unsigned char*)(str+2) ^ Tx;
+	if(c2 & Testx)
+		goto bad;
+	if(c < T4) {
+		l = ((((c << Bitx) | c1) << Bitx) | c2) & Rune3;
+		if(l <= Rune2)
+			goto bad;
+		*rune = l;
+		return 3;
+	}
+
+	/*
+	 * four character sequence (21-bit value)
+	 *	10000-1FFFFF => T4 Tx Tx Tx
+	 */
+	c3 = *(unsigned char*)(str+3) ^ Tx;
+	if (c3 & Testx)
+		goto bad;
+	if (c < T5) {
+		l = ((((((c << Bitx) | c1) << Bitx) | c2) << Bitx) | c3) & Rune4;
+		if (l <= Rune3)
+			goto bad;
+		*rune = l;
+		return 4;
+	}
+
+	/*
+	 * Support for 5-byte or longer UTF-8 would go here, but
+	 * since we don't have that, we'll just fall through to bad.
+	 */
+
+	/*
+	 * bad decoding
+	 */
+bad:
+	*rune = Bad;
+	return 1;
+}
+
+int
+runetochar(char *str, const Rune *rune)
+{
+	/* Runes are signed, so convert to unsigned for range check. */
+	unsigned long c;
+
+	/*
+	 * one character sequence
+	 *	00000-0007F => 00-7F
+	 */
+	c = *rune;
+	if(c <= Rune1) {
+		str[0] = static_cast<char>(c);
+		return 1;
+	}
+
+	/*
+	 * two character sequence
+	 *	0080-07FF => T2 Tx
+	 */
+	if(c <= Rune2) {
+		str[0] = T2 | static_cast<char>(c >> 1*Bitx);
+		str[1] = Tx | (c & Maskx);
+		return 2;
+	}
+
+	/*
+	 * If the Rune is out of range, convert it to the error rune.
+	 * Do this test here because the error rune encodes to three bytes.
+	 * Doing it earlier would duplicate work, since an out of range
+	 * Rune wouldn't have fit in one or two bytes.
+	 */
+	if (c > Runemax)
+		c = Runeerror;
+
+	/*
+	 * three character sequence
+	 *	0800-FFFF => T3 Tx Tx
+	 */
+	if (c <= Rune3) {
+		str[0] = T3 | static_cast<char>(c >> 2*Bitx);
+		str[1] = Tx | ((c >> 1*Bitx) & Maskx);
+		str[2] = Tx | (c & Maskx);
+		return 3;
+	}
+
+	/*
+	 * four character sequence (21-bit value)
+	 *     10000-1FFFFF => T4 Tx Tx Tx
+	 */
+	str[0] = T4 | static_cast<char>(c >> 3*Bitx);
+	str[1] = Tx | ((c >> 2*Bitx) & Maskx);
+	str[2] = Tx | ((c >> 1*Bitx) & Maskx);
+	str[3] = Tx | (c & Maskx);
+	return 4;
+}
+
+int
+runelen(Rune rune)
+{
+	char str[10];
+
+	return runetochar(str, &rune);
+}
+
+int
+fullrune(const char *str, int n)
+{
+	if (n > 0) {
+		int c = *(unsigned char*)str;
+		if (c < Tx)
+			return 1;
+		if (n > 1) {
+			if (c < T3)
+				return 1;
+			if (n > 2) {
+				if (c < T4 || n > 3)
+					return 1;
+			}
+		}
+	}
+	return 0;
+}
+
+
+int
+utflen(const char *s)
+{
+	int c;
+	long n;
+	Rune rune;
+
+	n = 0;
+	for(;;) {
+		c = *(unsigned char*)s;
+		if(c < Runeself) {
+			if(c == 0)
+				return n;
+			s++;
+		} else
+			s += chartorune(&rune, s);
+		n++;
+	}
+	return 0;
+}
+
+char*
+utfrune(const char *s, Rune c)
+{
+	long c1;
+	Rune r;
+	int n;
+
+	if(c < Runesync)		/* not part of utf sequence */
+		return strchr((char*)s, c);
+
+	for(;;) {
+		c1 = *(unsigned char*)s;
+		if(c1 < Runeself) {	/* one byte rune */
+			if(c1 == 0)
+				return 0;
+			if(c1 == c)
+				return (char*)s;
+			s++;
+			continue;
+		}
+		n = chartorune(&r, s);
+		if(r == c)
+			return (char*)s;
+		s += n;
+	}
+	return 0;
+}
+
+}  // namespace re2
+
+
+====================X11-Lucent====================
+ * Permission to use, copy, modify, and distribute this software for any
+ * purpose without fee is hereby granted, provided that this entire notice
+ * is included in all copies of any software which is or includes a copy
+ * or modification of this software and in all copies of the supporting
+ * documentation for such software.
+ * THIS SOFTWARE IS BEING PROVIDED "AS IS", WITHOUT ANY EXPRESS OR IMPLIED
+ * WARRANTY.  IN PARTICULAR, NEITHER THE AUTHORS NOR LUCENT TECHNOLOGIES MAKE ANY
+ * REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY
+ * OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE.
+
+
+====================X11-Lucent====================
+ * Permission to use, copy, modify, and distribute this software for any
+ * purpose without fee is hereby granted, provided that this entire notice
+ * is included in all copies of any software which is or includes a copy
+ * or modification of this software and in all copies of the supporting
+ * documentation for such software.
+ * THIS SOFTWARE IS BEING PROVIDED "AS IS", WITHOUT ANY EXPRESS OR IMPLIED
+ * WARRANTY.  IN PARTICULAR, NEITHER THE AUTHORS NOR LUCENT TECHNOLOGIES MAKE ANY
+ * REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY
+ * OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE.
+ *
+ * This file and rune.cc have been converted to compile as C++ code