rm vendor

Dockerfile

-FROM golang:alpine as builder
+FROM golang:1-alpine as builder
 
-ADD . /go/src/github.com/ginuerzh/gost/
+RUN apk add --no-cache musl-dev git gcc
 
-RUN go install github.com/ginuerzh/gost/cmd/gost
+ADD . /src
+
+WORKDIR /src
+
+ENV GO111MODULE=on
+
+RUN cd cmd/gost && go build
 
 FROM alpine:latest
 
 WORKDIR /bin/
 
-COPY --from=builder /go/bin/gost .
+COPY --from=builder /src/cmd/gost/gost .
 
-ENTRYPOINT ["/bin/gost"]
\ No newline at end of file
+ENTRYPOINT ["/bin/gost"]

Dockerfile.mod

-FROM golang:1-alpine as builder
-
-RUN apk add --no-cache musl-dev git gcc
-
-ADD . /data
-
-WORKDIR /data
-
-ENV GO111MODULE=on
-
-RUN cd cmd/gost && go build
-
-FROM alpine:latest
-
-WORKDIR /bin/
-
-COPY --from=builder /data/cmd/gost/gost .
-
-RUN /bin/gost -V
-
-ENTRYPOINT ["/bin/gost"]
\ No newline at end of file

snapcraft.yaml

 name: gost
 type: app
-version: '2.8.2'
+version: '2.9.0'
 title: GO Simple Tunnel
 summary: A simple security tunnel written in golang
 description: |

vendor/git.torproject.org/pluggable-transports/goptlib.git/.gitignore

-/examples/dummy-client/dummy-client
-/examples/dummy-server/dummy-server

vendor/git.torproject.org/pluggable-transports/goptlib.git/COPYING

-Creative Commons Legal Code
-
-CC0 1.0 Universal
-
-    CREATIVE COMMONS CORPORATION IS NOT A LAW FIRM AND DOES NOT PROVIDE
-    LEGAL SERVICES. DISTRIBUTION OF THIS DOCUMENT DOES NOT CREATE AN
-    ATTORNEY-CLIENT RELATIONSHIP. CREATIVE COMMONS PROVIDES THIS
-    INFORMATION ON AN "AS-IS" BASIS. CREATIVE COMMONS MAKES NO WARRANTIES
-    REGARDING THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS
-    PROVIDED HEREUNDER, AND DISCLAIMS LIABILITY FOR DAMAGES RESULTING FROM
-    THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS PROVIDED
-    HEREUNDER.
-
-Statement of Purpose
-
-The laws of most jurisdictions throughout the world automatically confer
-exclusive Copyright and Related Rights (defined below) upon the creator
-and subsequent owner(s) (each and all, an "owner") of an original work of
-authorship and/or a database (each, a "Work").
-
-Certain owners wish to permanently relinquish those rights to a Work for
-the purpose of contributing to a commons of creative, cultural and
-scientific works ("Commons") that the public can reliably and without fear
-of later claims of infringement build upon, modify, incorporate in other
-works, reuse and redistribute as freely as possible in any form whatsoever
-and for any purposes, including without limitation commercial purposes.
-These owners may contribute to the Commons to promote the ideal of a free
-culture and the further production of creative, cultural and scientific
-works, or to gain reputation or greater distribution for their Work in
-part through the use and efforts of others.
-
-For these and/or other purposes and motivations, and without any
-expectation of additional consideration or compensation, the person
-associating CC0 with a Work (the "Affirmer"), to the extent that he or she
-is an owner of Copyright and Related Rights in the Work, voluntarily
-elects to apply CC0 to the Work and publicly distribute the Work under its
-terms, with knowledge of his or her Copyright and Related Rights in the
-Work and the meaning and intended legal effect of CC0 on those rights.
-
-1. Copyright and Related Rights. A Work made available under CC0 may be
-protected by copyright and related or neighboring rights ("Copyright and
-Related Rights"). Copyright and Related Rights include, but are not
-limited to, the following:
-
-  i. the right to reproduce, adapt, distribute, perform, display,
-     communicate, and translate a Work;
- ii. moral rights retained by the original author(s) and/or performer(s);
-iii. publicity and privacy rights pertaining to a person's image or
-     likeness depicted in a Work;
- iv. rights protecting against unfair competition in regards to a Work,
-     subject to the limitations in paragraph 4(a), below;
-  v. rights protecting the extraction, dissemination, use and reuse of data
-     in a Work;
- vi. database rights (such as those arising under Directive 96/9/EC of the
-     European Parliament and of the Council of 11 March 1996 on the legal
-     protection of databases, and under any national implementation
-     thereof, including any amended or successor version of such
-     directive); and
-vii. other similar, equivalent or corresponding rights throughout the
-     world based on applicable law or treaty, and any national
-     implementations thereof.
-
-2. Waiver. To the greatest extent permitted by, but not in contravention
-of, applicable law, Affirmer hereby overtly, fully, permanently,
-irrevocably and unconditionally waives, abandons, and surrenders all of
-Affirmer's Copyright and Related Rights and associated claims and causes
-of action, whether now known or unknown (including existing as well as
-future claims and causes of action), in the Work (i) in all territories
-worldwide, (ii) for the maximum duration provided by applicable law or
-treaty (including future time extensions), (iii) in any current or future
-medium and for any number of copies, and (iv) for any purpose whatsoever,
-including without limitation commercial, advertising or promotional
-purposes (the "Waiver"). Affirmer makes the Waiver for the benefit of each
-member of the public at large and to the detriment of Affirmer's heirs and
-successors, fully intending that such Waiver shall not be subject to
-revocation, rescission, cancellation, termination, or any other legal or
-equitable action to disrupt the quiet enjoyment of the Work by the public
-as contemplated by Affirmer's express Statement of Purpose.
-
-3. Public License Fallback. Should any part of the Waiver for any reason
-be judged legally invalid or ineffective under applicable law, then the
-Waiver shall be preserved to the maximum extent permitted taking into
-account Affirmer's express Statement of Purpose. In addition, to the
-extent the Waiver is so judged Affirmer hereby grants to each affected
-person a royalty-free, non transferable, non sublicensable, non exclusive,
-irrevocable and unconditional license to exercise Affirmer's Copyright and
-Related Rights in the Work (i) in all territories worldwide, (ii) for the
-maximum duration provided by applicable law or treaty (including future
-time extensions), (iii) in any current or future medium and for any number
-of copies, and (iv) for any purpose whatsoever, including without
-limitation commercial, advertising or promotional purposes (the
-"License"). The License shall be deemed effective as of the date CC0 was
-applied by Affirmer to the Work. Should any part of the License for any
-reason be judged legally invalid or ineffective under applicable law, such
-partial invalidity or ineffectiveness shall not invalidate the remainder
-of the License, and in such case Affirmer hereby affirms that he or she
-will not (i) exercise any of his or her remaining Copyright and Related
-Rights in the Work or (ii) assert any associated claims and causes of
-action with respect to the Work, in either case contrary to Affirmer's
-express Statement of Purpose.
-
-4. Limitations and Disclaimers.
-
- a. No trademark or patent rights held by Affirmer are waived, abandoned,
-    surrendered, licensed or otherwise affected by this document.
- b. Affirmer offers the Work as-is and makes no representations or
-    warranties of any kind concerning the Work, express, implied,
-    statutory or otherwise, including without limitation warranties of
-    title, merchantability, fitness for a particular purpose, non
-    infringement, or the absence of latent or other defects, accuracy, or
-    the present or absence of errors, whether or not discoverable, all to
-    the greatest extent permissible under applicable law.
- c. Affirmer disclaims responsibility for clearing rights of other persons
-    that may apply to the Work or any use thereof, including without
-    limitation any person's Copyright and Related Rights in the Work.
-    Further, Affirmer disclaims responsibility for obtaining any necessary
-    consents, permissions or other rights required for any use of the
-    Work.
- d. Affirmer understands and acknowledges that Creative Commons is not a
-    party to this document and has no duty or obligation with respect to
-    this CC0 or use of the Work.

vendor/git.torproject.org/pluggable-transports/goptlib.git/README

-goptlib is a library for writing Tor pluggable transports in Go.
-
-https://spec.torproject.org/pt-spec
-https://gitweb.torproject.org/torspec.git/tree/proposals/196-transport-control-ports.txt
-https://gitweb.torproject.org/torspec.git/tree/proposals/217-ext-orport-auth.txt
-https://gitweb.torproject.org/torspec.git/tree/proposals/232-pluggable-transports-through-proxy.txt
-
-To download a copy of the library into $GOPATH:
-	go get git.torproject.org/pluggable-transports/goptlib.git
-
-See the included example programs for examples of how to use the
-library. To build them, enter their directory and run "go build".
-	examples/dummy-client/dummy-client.go
-	examples/dummy-server/dummy-server.go
-The recommended way to start writing a new transport plugin is to copy
-dummy-client or dummy-server and make changes to it.
-
-There is browseable documentation here:
-https://godoc.org/git.torproject.org/pluggable-transports/goptlib.git
-
-Report bugs to the tor-dev@lists.torproject.org mailing list or to the
-bug tracker at https://trac.torproject.org/projects/tor.
-
-To the extent possible under law, the authors have dedicated all
-copyright and related and neighboring rights to this software to the
-public domain worldwide. This software is distributed without any
-warranty. See COPYING.

vendor/git.torproject.org/pluggable-transports/goptlib.git/args.go

-package pt
-
-import (
-	"bytes"
-	"fmt"
-	"sort"
-	"strings"
-)
-
-// Key–value mappings for the representation of client and server options.
-
-// Args maps a string key to a list of values. It is similar to url.Values.
-type Args map[string][]string
-
-// Get the first value associated with the given key. If there are any values
-// associated with the key, the value return has the value and ok is set to
-// true. If there are no values for the given key, value is "" and ok is false.
-// If you need access to multiple values, use the map directly.
-func (args Args) Get(key string) (value string, ok bool) {
-	if args == nil {
-		return "", false
-	}
-	vals, ok := args[key]
-	if !ok || len(vals) == 0 {
-		return "", false
-	}
-	return vals[0], true
-}
-
-// Append value to the list of values for key.
-func (args Args) Add(key, value string) {
-	args[key] = append(args[key], value)
-}
-
-// Return the index of the next unescaped byte in s that is in the term set, or
-// else the length of the string if no terminators appear. Additionally return
-// the unescaped string up to the returned index.
-func indexUnescaped(s string, term []byte) (int, string, error) {
-	var i int
-	unesc := make([]byte, 0)
-	for i = 0; i < len(s); i++ {
-		b := s[i]
-		// A terminator byte?
-		if bytes.IndexByte(term, b) != -1 {
-			break
-		}
-		if b == '\\' {
-			i++
-			if i >= len(s) {
-				return 0, "", fmt.Errorf("nothing following final escape in %q", s)
-			}
-			b = s[i]
-		}
-		unesc = append(unesc, b)
-	}
-	return i, string(unesc), nil
-}
-
-// Parse a name–value mapping as from an encoded SOCKS username/password.
-//
-// "First the '<Key>=<Value>' formatted arguments MUST be escaped, such that all
-// backslash, equal sign, and semicolon characters are escaped with a
-// backslash."
-func parseClientParameters(s string) (args Args, err error) {
-	args = make(Args)
-	if len(s) == 0 {
-		return
-	}
-	i := 0
-	for {
-		var key, value string
-		var offset, begin int
-
-		begin = i
-		// Read the key.
-		offset, key, err = indexUnescaped(s[i:], []byte{'=', ';'})
-		if err != nil {
-			return
-		}
-		i += offset
-		// End of string or no equals sign?
-		if i >= len(s) || s[i] != '=' {
-			err = fmt.Errorf("no equals sign in %q", s[begin:i])
-			return
-		}
-		// Skip the equals sign.
-		i++
-		// Read the value.
-		offset, value, err = indexUnescaped(s[i:], []byte{';'})
-		if err != nil {
-			return
-		}
-		i += offset
-		if len(key) == 0 {
-			err = fmt.Errorf("empty key in %q", s[begin:i])
-			return
-		}
-		args.Add(key, value)
-		if i >= len(s) {
-			break
-		}
-		// Skip the semicolon.
-		i++
-	}
-	return args, nil
-}
-
-// Parse a transport–name–value mapping as from TOR_PT_SERVER_TRANSPORT_OPTIONS.
-//
-// "...a semicolon-separated list of <key>:<value> pairs, where <key> is a PT
-// name and <value> is a k=v string value with options that are to be passed to
-// the transport. Colons, semicolons, equal signs and backslashes must be
-// escaped with a backslash."
-// Example: scramblesuit:key=banana;automata:rule=110;automata:depth=3
-func parseServerTransportOptions(s string) (opts map[string]Args, err error) {
-	opts = make(map[string]Args)
-	if len(s) == 0 {
-		return
-	}
-	i := 0
-	for {
-		var methodName, key, value string
-		var offset, begin int
-
-		begin = i
-		// Read the method name.
-		offset, methodName, err = indexUnescaped(s[i:], []byte{':', '=', ';'})
-		if err != nil {
-			return
-		}
-		i += offset
-		// End of string or no colon?
-		if i >= len(s) || s[i] != ':' {
-			err = fmt.Errorf("no colon in %q", s[begin:i])
-			return
-		}
-		// Skip the colon.
-		i++
-		// Read the key.
-		offset, key, err = indexUnescaped(s[i:], []byte{'=', ';'})
-		if err != nil {
-			return
-		}
-		i += offset
-		// End of string or no equals sign?
-		if i >= len(s) || s[i] != '=' {
-			err = fmt.Errorf("no equals sign in %q", s[begin:i])
-			return
-		}
-		// Skip the equals sign.
-		i++
-		// Read the value.
-		offset, value, err = indexUnescaped(s[i:], []byte{';'})
-		if err != nil {
-			return
-		}
-		i += offset
-		if len(methodName) == 0 {
-			err = fmt.Errorf("empty method name in %q", s[begin:i])
-			return
-		}
-		if len(key) == 0 {
-			err = fmt.Errorf("empty key in %q", s[begin:i])
-			return
-		}
-		if opts[methodName] == nil {
-			opts[methodName] = make(Args)
-		}
-		opts[methodName].Add(key, value)
-		if i >= len(s) {
-			break
-		}
-		// Skip the semicolon.
-		i++
-	}
-	return opts, nil
-}
-
-// Escape backslashes and all the bytes that are in set.
-func backslashEscape(s string, set []byte) string {
-	var buf bytes.Buffer
-	for _, b := range []byte(s) {
-		if b == '\\' || bytes.IndexByte(set, b) != -1 {
-			buf.WriteByte('\\')
-		}
-		buf.WriteByte(b)
-	}
-	return buf.String()
-}
-
-// Encode a name–value mapping so that it is suitable to go in the ARGS option
-// of an SMETHOD line. The output is sorted by key. The "ARGS:" prefix is not
-// added.
-//
-// "Equal signs and commas [and backslashes] MUST be escaped with a backslash."
-func encodeSmethodArgs(args Args) string {
-	if args == nil {
-		return ""
-	}
-
-	keys := make([]string, 0, len(args))
-	for key := range args {
-		keys = append(keys, key)
-	}
-	sort.Strings(keys)
-
-	escape := func(s string) string {
-		return backslashEscape(s, []byte{'=', ','})
-	}
-
-	var pairs []string
-	for _, key := range keys {
-		for _, value := range args[key] {
-			pairs = append(pairs, escape(key)+"="+escape(value))
-		}
-	}
-
-	return strings.Join(pairs, ",")
-}

vendor/git.torproject.org/pluggable-transports/obfs4.git/LICENSE

-Copyright (c) 2014, Yawning Angel <yawning at torproject dot org>
-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.
-
-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 HOLDER 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.
-
-==============================================================================
-
-Copyright (c) 2012 The Go 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.
-

vendor/git.torproject.org/pluggable-transports/obfs4.git/common/csrand/csrand.go

-/*
- * Copyright (c) 2014, Yawning Angel <yawning at torproject dot org>
- * 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.
- *
- * 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 HOLDER 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.
- */
-
-// Package csrand implements the math/rand interface over crypto/rand, along
-// with some utility functions for common random number/byte related tasks.
-//
-// Not all of the convinience routines are replicated, only those that are
-// immediately useful.  The Rand variable provides access to the full math/rand
-// API.
-package csrand
-
-import (
-	cryptRand "crypto/rand"
-	"encoding/binary"
-	"fmt"
-	"io"
-	"math/rand"
-)
-
-var (
-	csRandSourceInstance csRandSource
-
-	// Rand is a math/rand instance backed by crypto/rand CSPRNG.
-	Rand = rand.New(csRandSourceInstance)
-)
-
-type csRandSource struct {
-	// This does not keep any state as it is backed by crypto/rand.
-}
-
-func (r csRandSource) Int63() int64 {
-	var src [8]byte
-	if err := Bytes(src[:]); err != nil {
-		panic(err)
-	}
-	val := binary.BigEndian.Uint64(src[:])
-	val &= (1<<63 - 1)
-
-	return int64(val)
-}
-
-func (r csRandSource) Seed(seed int64) {
-	// No-op.
-}
-
-// Intn returns, as a int, a pseudo random number in [0, n).
-func Intn(n int) int {
-	return Rand.Intn(n)
-}
-
-// Float64 returns, as a float64, a pesudo random number in [0.0,1.0).
-func Float64() float64 {
-	return Rand.Float64()
-}
-
-// IntRange returns a uniformly distributed int [min, max].
-func IntRange(min, max int) int {
-	if max < min {
-		panic(fmt.Sprintf("IntRange: min > max (%d, %d)", min, max))
-	}
-
-	r := (max + 1) - min
-	ret := Rand.Intn(r)
-	return ret + min
-}
-
-// Bytes fills the slice with random data.
-func Bytes(buf []byte) error {
-	if _, err := io.ReadFull(cryptRand.Reader, buf); err != nil {
-		return err
-	}
-
-	return nil
-}
-
-// Reader is a alias of rand.Reader.
-var Reader = cryptRand.Reader

vendor/git.torproject.org/pluggable-transports/obfs4.git/common/drbg/hash_drbg.go

-/*
- * Copyright (c) 2014, Yawning Angel <yawning at torproject dot org>
- * 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.
- *
- * 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 HOLDER 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.
- */
-
-// Package drbg implements a minimalistic DRBG based off SipHash-2-4 in OFB
-// mode.
-package drbg
-
-import (
-	"encoding/binary"
-	"encoding/hex"
-	"fmt"
-	"hash"
-
-	"github.com/dchest/siphash"
-
-	"git.torproject.org/pluggable-transports/obfs4.git/common/csrand"
-)
-
-// Size is the length of the HashDrbg output.
-const Size = siphash.Size
-
-// SeedLength is the length of the HashDrbg seed.
-const SeedLength = 16 + Size
-
-// Seed is the initial state for a HashDrbg.  It consists of a SipHash-2-4
-// key, and 8 bytes of initial data.
-type Seed [SeedLength]byte
-
-// Bytes returns a pointer to the raw HashDrbg seed.
-func (seed *Seed) Bytes() *[SeedLength]byte {
-	return (*[SeedLength]byte)(seed)
-}
-
-// Hex returns the hexdecimal representation of the seed.
-func (seed *Seed) Hex() string {
-	return hex.EncodeToString(seed.Bytes()[:])
-}
-
-// NewSeed returns a Seed initialized with the runtime CSPRNG.
-func NewSeed() (seed *Seed, err error) {
-	seed = new(Seed)
-	if err = csrand.Bytes(seed.Bytes()[:]); err != nil {
-		return nil, err
-	}
-
-	return
-}
-
-// SeedFromBytes creates a Seed from the raw bytes, truncating to SeedLength as
-// appropriate.
-func SeedFromBytes(src []byte) (seed *Seed, err error) {
-	if len(src) < SeedLength {
-		return nil, InvalidSeedLengthError(len(src))
-	}
-
-	seed = new(Seed)
-	copy(seed.Bytes()[:], src)
-
-	return
-}
-
-// SeedFromHex creates a Seed from the hexdecimal representation, truncating to
-// SeedLength as appropriate.
-func SeedFromHex(encoded string) (seed *Seed, err error) {
-	var raw []byte
-	if raw, err = hex.DecodeString(encoded); err != nil {
-		return nil, err
-	}
-
-	return SeedFromBytes(raw)
-}
-
-// InvalidSeedLengthError is the error returned when the seed provided to the
-// DRBG is an invalid length.
-type InvalidSeedLengthError int
-
-func (e InvalidSeedLengthError) Error() string {
-	return fmt.Sprintf("invalid seed length: %d", int(e))
-}
-
-// HashDrbg is a CSDRBG based off of SipHash-2-4 in OFB mode.
-type HashDrbg struct {
-	sip hash.Hash64
-	ofb [Size]byte
-}
-
-// NewHashDrbg makes a HashDrbg instance based off an optional seed.  The seed
-// is truncated to SeedLength.
-func NewHashDrbg(seed *Seed) (*HashDrbg, error) {
-	drbg := new(HashDrbg)
-	if seed == nil {
-		var err error
-		if seed, err = NewSeed(); err != nil {
-			return nil, err
-		}
-	}
-	drbg.sip = siphash.New(seed.Bytes()[:16])
-	copy(drbg.ofb[:], seed.Bytes()[16:])
-
-	return drbg, nil
-}
-
-// Int63 returns a uniformly distributed random integer [0, 1 << 63).
-func (drbg *HashDrbg) Int63() int64 {
-	block := drbg.NextBlock()
-	ret := binary.BigEndian.Uint64(block)
-	ret &= (1<<63 - 1)
-
-	return int64(ret)
-}
-
-// Seed does nothing, call NewHashDrbg if you want to reseed.
-func (drbg *HashDrbg) Seed(seed int64) {
-	// No-op.
-}
-
-// NextBlock returns the next 8 byte DRBG block.
-func (drbg *HashDrbg) NextBlock() []byte {
-	drbg.sip.Write(drbg.ofb[:])
-	copy(drbg.ofb[:], drbg.sip.Sum(nil))
-
-	ret := make([]byte, Size)
-	copy(ret, drbg.ofb[:])
-	return ret
-}

vendor/git.torproject.org/pluggable-transports/obfs4.git/common/probdist/weighted_dist.go

-/*
- * Copyright (c) 2014, Yawning Angel <yawning at torproject dot org>
- * 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.
- *
- * 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 HOLDER 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.
- */
-
-// Package probdist implements a weighted probability distribution suitable for
-// protocol parameterization.  To allow for easy reproduction of a given
-// distribution, the drbg package is used as the random number source.
-package probdist
-
-import (
-	"bytes"
-	"container/list"
-	"fmt"
-	"math/rand"
-	"sync"
-
-	"git.torproject.org/pluggable-transports/obfs4.git/common/csrand"
-	"git.torproject.org/pluggable-transports/obfs4.git/common/drbg"
-)
-
-const (
-	minValues = 1
-	maxValues = 100
-)
-
-// WeightedDist is a weighted distribution.
-type WeightedDist struct {
-	sync.Mutex
-
-	minValue int
-	maxValue int
-	biased   bool
-	values   []int
-	weights  []float64
-
-	alias []int
-	prob  []float64
-}
-
-// New creates a weighted distribution of values ranging from min to max
-// based on a HashDrbg initialized with seed.  Optionally, bias the weight
-// generation to match the ScrambleSuit non-uniform distribution from
-// obfsproxy.
-func New(seed *drbg.Seed, min, max int, biased bool) (w *WeightedDist) {
-	w = &WeightedDist{minValue: min, maxValue: max, biased: biased}
-
-	if max <= min {
-		panic(fmt.Sprintf("wDist.Reset(): min >= max (%d, %d)", min, max))
-	}
-
-	w.Reset(seed)
-
-	return
-}
-
-// genValues creates a slice containing a random number of random values
-// that when scaled by adding minValue will fall into [min, max].
-func (w *WeightedDist) genValues(rng *rand.Rand) {
-	nValues := (w.maxValue + 1) - w.minValue
-	values := rng.Perm(nValues)
-	if nValues < minValues {
-		nValues = minValues
-	}
-	if nValues > maxValues {
-		nValues = maxValues
-	}
-	nValues = rng.Intn(nValues) + 1
-	w.values = values[:nValues]
-}
-
-// genBiasedWeights generates a non-uniform weight list, similar to the
-// ScrambleSuit prob_dist module.
-func (w *WeightedDist) genBiasedWeights(rng *rand.Rand) {
-	w.weights = make([]float64, len(w.values))
-
-	culmProb := 0.0
-	for i := range w.weights {
-		p := (1.0 - culmProb) * rng.Float64()
-		w.weights[i] = p
-		culmProb += p
-	}
-}
-
-// genUniformWeights generates a uniform weight list.
-func (w *WeightedDist) genUniformWeights(rng *rand.Rand) {
-	w.weights = make([]float64, len(w.values))
-	for i := range w.weights {
-		w.weights[i] = rng.Float64()
-	}
-}
-
-// genTables calculates the alias and prob tables used for Vose's Alias method.
-// Algorithm taken from http://www.keithschwarz.com/darts-dice-coins/
-func (w *WeightedDist) genTables() {
-	n := len(w.weights)
-	var sum float64
-	for _, weight := range w.weights {
-		sum += weight
-	}
-
-	// Create arrays $Alias$ and $Prob$, each of size $n$.
-	alias := make([]int, n)
-	prob := make([]float64, n)
-
-	// Create two worklists, $Small$ and $Large$.
-	small := list.New()
-	large := list.New()
-
-	scaled := make([]float64, n)
-	for i, weight := range w.weights {
-		// Multiply each probability by $n$.
-		p_i := weight * float64(n) / sum
-		scaled[i] = p_i
-
-		// For each scaled probability $p_i$:
-		if scaled[i] < 1.0 {
-			// If $p_i < 1$, add $i$ to $Small$.
-			small.PushBack(i)
-		} else {
-			// Otherwise ($p_i \ge 1$), add $i$ to $Large$.
-			large.PushBack(i)
-		}
-	}
-
-	// While $Small$ and $Large$ are not empty: ($Large$ might be emptied first)
-	for small.Len() > 0 && large.Len() > 0 {
-		// Remove the first element from $Small$; call it $l$.
-		l := small.Remove(small.Front()).(int)
-		// Remove the first element from $Large$; call it $g$.
-		g := large.Remove(large.Front()).(int)
-
-		// Set $Prob[l] = p_l$.
-		prob[l] = scaled[l]
-		// Set $Alias[l] = g$.
-		alias[l] = g
-
-		// Set $p_g := (p_g + p_l) - 1$. (This is a more numerically stable option.)
-		scaled[g] = (scaled[g] + scaled[l]) - 1.0
-
-		if scaled[g] < 1.0 {
-			// If $p_g < 1$, add $g$ to $Small$.
-			small.PushBack(g)
-		} else {
-			// Otherwise ($p_g \ge 1$), add $g$ to $Large$.
-			large.PushBack(g)
-		}
-	}
-
-	// While $Large$ is not empty:
-	for large.Len() > 0 {
-		// Remove the first element from $Large$; call it $g$.
-		g := large.Remove(large.Front()).(int)
-		// Set $Prob[g] = 1$.
-		prob[g] = 1.0
-	}
-
-	// While $Small$ is not empty: This is only possible due to numerical instability.
-	for small.Len() > 0 {
-		// Remove the first element from $Small$; call it $l$.
-		l := small.Remove(small.Front()).(int)
-		// Set $Prob[l] = 1$.
-		prob[l] = 1.0
-	}
-
-	w.prob = prob
-	w.alias = alias
-}
-
-// Reset generates a new distribution with the same min/max based on a new
-// seed.
-func (w *WeightedDist) Reset(seed *drbg.Seed) {
-	// Initialize the deterministic random number generator.
-	drbg, _ := drbg.NewHashDrbg(seed)
-	rng := rand.New(drbg)
-
-	w.Lock()
-	defer w.Unlock()
-
-	w.genValues(rng)
-	if w.biased {
-		w.genBiasedWeights(rng)
-	} else {
-		w.genUniformWeights(rng)
-	}
-	w.genTables()
-}
-
-// Sample generates a random value according to the distribution.
-func (w *WeightedDist) Sample() int {
-	var idx int
-
-	w.Lock()
-	defer w.Unlock()
-
-	// Generate a fair die roll from an $n$-sided die; call the side $i$.
-	i := csrand.Intn(len(w.values))
-	// Flip a biased coin that comes up heads with probability $Prob[i]$.
-	if csrand.Float64() <= w.prob[i] {
-		// If the coin comes up "heads," return $i$.
-		idx = i
-	} else {
-		// Otherwise, return $Alias[i]$.
-		idx = w.alias[i]
-	}
-
-	return w.minValue + w.values[idx]
-}
-
-// String returns a dump of the distribution table.
-func (w *WeightedDist) String() string {
-	var buf bytes.Buffer
-
-	buf.WriteString("[ ")
-	for i, v := range w.values {
-		p := w.weights[i]
-		if p > 0.01 { // Squelch tiny probabilities.
-			buf.WriteString(fmt.Sprintf("%d: %f ", v, p))
-		}
-	}
-	buf.WriteString("]")
-	return buf.String()
-}

vendor/git.torproject.org/pluggable-transports/obfs4.git/common/replayfilter/replay_filter.go

-/*
- * Copyright (c) 2014, Yawning Angel <yawning at torproject dot org>
- * 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.
- *
- * 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 HOLDER 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.
- */
-
-// Package replayfilter implements a generic replay detection filter with a
-// caller specifiable time-to-live.  It only detects if a given byte sequence
-// has been seen before based on the SipHash-2-4 digest of the sequence.
-// Collisions are treated as positive matches, though the probability of this
-// happening is negligible.
-package replayfilter
-
-import (
-	"container/list"
-	"encoding/binary"
-	"sync"
-	"time"
-
-	"github.com/dchest/siphash"
-
-	"git.torproject.org/pluggable-transports/obfs4.git/common/csrand"
-)
-
-// maxFilterSize is the maximum capacity of a replay filter.  This value is
-// more as a safeguard to prevent runaway filter growth, and is sized to be
-// serveral orders of magnitude greater than the number of connections a busy
-// bridge sees in one day, so in practice should never be reached.
-const maxFilterSize = 100 * 1024
-
-type entry struct {
-	digest    uint64
-	firstSeen time.Time
-	element   *list.Element
-}
-
-// ReplayFilter is a simple filter designed only to detect if a given byte
-// sequence has been seen before.
-type ReplayFilter struct {
-	sync.Mutex
-
-	filter map[uint64]*entry
-	fifo   *list.List
-
-	key [2]uint64
-	ttl time.Duration
-}
-
-// New creates a new ReplayFilter instance.
-func New(ttl time.Duration) (filter *ReplayFilter, err error) {
-	// Initialize the SipHash-2-4 instance with a random key.
-	var key [16]byte
-	if err = csrand.Bytes(key[:]); err != nil {
-		return
-	}
-
-	filter = new(ReplayFilter)
-	filter.filter = make(map[uint64]*entry)
-	filter.fifo = list.New()
-	filter.key[0] = binary.BigEndian.Uint64(key[0:8])
-	filter.key[1] = binary.BigEndian.Uint64(key[8:16])
-	filter.ttl = ttl
-
-	return
-}
-
-// TestAndSet queries the filter for a given byte sequence, inserts the
-// sequence, and returns if it was present before the insertion operation.
-func (f *ReplayFilter) TestAndSet(now time.Time, buf []byte) bool {
-	digest := siphash.Hash(f.key[0], f.key[1], buf)
-
-	f.Lock()
-	defer f.Unlock()
-
-	f.compactFilter(now)
-
-	if e := f.filter[digest]; e != nil {
-		// Hit.  Just return.
-		return true
-	}
-
-	// Miss.  Add a new entry.
-	e := new(entry)
-	e.digest = digest
-	e.firstSeen = now
-	e.element = f.fifo.PushBack(e)
-	f.filter[digest] = e
-
-	return false
-}
-
-func (f *ReplayFilter) compactFilter(now time.Time) {
-	e := f.fifo.Front()
-	for e != nil {
-		ent, _ := e.Value.(*entry)
-
-		// If the filter is not full, only purge entries that exceed the TTL,
-		// otherwise purge at least one entry, then revert to TTL based
-		// compaction.
-		if f.fifo.Len() < maxFilterSize && f.ttl > 0 {
-			deltaT := now.Sub(ent.firstSeen)
-			if deltaT < 0 {
-				// Aeeeeeee, the system time jumped backwards, potentially by
-				// a lot.  This will eventually self-correct, but "eventually"
-				// could be a long time.  As much as this sucks, jettison the
-				// entire filter.
-				f.reset()
-				return
-			} else if deltaT < f.ttl {
-				return
-			}
-		}
-
-		// Remove the eldest entry.
-		eNext := e.Next()
-		delete(f.filter, ent.digest)
-		f.fifo.Remove(ent.element)
-		ent.element = nil
-		e = eNext
-	}
-}
-
-func (f *ReplayFilter) reset() {
-	f.filter = make(map[uint64]*entry)
-	f.fifo = list.New()
-}

vendor/git.torproject.org/pluggable-transports/obfs4.git/transports/base/base.go

-/*
- * Copyright (c) 2014, Yawning Angel <yawning at torproject dot org>
- * 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.
- *
- * 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 HOLDER 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.
- */
-
-// Package base provides the common interface that each supported transport
-// protocol must implement.
-package base
-
-import (
-	"net"
-
-	"git.torproject.org/pluggable-transports/goptlib.git"
-)
-
-type DialFunc func(string, string) (net.Conn, error)
-
-// ClientFactory is the interface that defines the factory for creating
-// pluggable transport protocol client instances.
-type ClientFactory interface {
-	// Transport returns the Transport instance that this ClientFactory belongs
-	// to.
-	Transport() Transport
-
-	// ParseArgs parses the supplied arguments into an internal representation
-	// for use with WrapConn.  This routine is called before the outgoing
-	// TCP/IP connection is created to allow doing things (like keypair
-	// generation) to be hidden from third parties.
-	ParseArgs(args *pt.Args) (interface{}, error)
-
-	// Dial creates an outbound net.Conn, and does whatever is required
-	// (eg: handshaking) to get the connection to the point where it is
-	// ready to relay data.
-	Dial(network, address string, dialFn DialFunc, args interface{}) (net.Conn, error)
-}
-
-// ServerFactory is the interface that defines the factory for creating
-// plugable transport protocol server instances.  As the arguments are the
-// property of the factory, validation is done at factory creation time.
-type ServerFactory interface {
-	// Transport returns the Transport instance that this ServerFactory belongs
-	// to.
-	Transport() Transport
-
-	// Args returns the Args required on the client side to handshake with
-	// server connections created by this factory.
-	Args() *pt.Args
-
-	// WrapConn wraps the provided net.Conn with a transport protocol
-	// implementation, and does whatever is required (eg: handshaking) to get
-	// the connection to a point where it is ready to relay data.
-	WrapConn(conn net.Conn) (net.Conn, error)
-}
-
-// Transport is an interface that defines a pluggable transport protocol.
-type Transport interface {
-	// Name returns the name of the transport protocol.  It MUST be a valid C
-	// identifier.
-	Name() string
-
-	// ClientFactory returns a ClientFactory instance for this transport
-	// protocol.
-	ClientFactory(stateDir string) (ClientFactory, error)
-
-	// ServerFactory returns a ServerFactory instance for this transport
-	// protocol.  This can fail if the provided arguments are invalid.
-	ServerFactory(stateDir string, args *pt.Args) (ServerFactory, error)
-}

vendor/git.torproject.org/pluggable-transports/obfs4.git/transports/obfs4/packet.go

-/*
- * Copyright (c) 2014, Yawning Angel <yawning at torproject dot org>
- * 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.
- *
- * 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 HOLDER 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.
- */
-
-package obfs4
-
-import (
-	"crypto/sha256"
-	"encoding/binary"
-	"fmt"
-	"io"
-
-	"git.torproject.org/pluggable-transports/obfs4.git/common/drbg"
-	"git.torproject.org/pluggable-transports/obfs4.git/transports/obfs4/framing"
-)
-
-const (
-	packetOverhead          = 2 + 1
-	maxPacketPayloadLength  = framing.MaximumFramePayloadLength - packetOverhead
-	maxPacketPaddingLength  = maxPacketPayloadLength
-	seedPacketPayloadLength = seedLength
-
-	consumeReadSize = framing.MaximumSegmentLength * 16
-)
-
-const (
-	packetTypePayload = iota
-	packetTypePrngSeed
-)
-
-// InvalidPacketLengthError is the error returned when decodePacket detects a
-// invalid packet length/
-type InvalidPacketLengthError int
-
-func (e InvalidPacketLengthError) Error() string {
-	return fmt.Sprintf("packet: Invalid packet length: %d", int(e))
-}
-
-// InvalidPayloadLengthError is the error returned when decodePacket rejects the
-// payload length.
-type InvalidPayloadLengthError int
-
-func (e InvalidPayloadLengthError) Error() string {
-	return fmt.Sprintf("packet: Invalid payload length: %d", int(e))
-}
-
-var zeroPadBytes [maxPacketPaddingLength]byte
-
-func (conn *obfs4Conn) makePacket(w io.Writer, pktType uint8, data []byte, padLen uint16) error {
-	var pkt [framing.MaximumFramePayloadLength]byte
-
-	if len(data)+int(padLen) > maxPacketPayloadLength {
-		panic(fmt.Sprintf("BUG: makePacket() len(data) + padLen > maxPacketPayloadLength: %d + %d > %d",
-			len(data), padLen, maxPacketPayloadLength))
-	}
-
-	// Packets are:
-	//   uint8_t type      packetTypePayload (0x00)
-	//   uint16_t length   Length of the payload (Big Endian).
-	//   uint8_t[] payload Data payload.
-	//   uint8_t[] padding Padding.
-	pkt[0] = pktType
-	binary.BigEndian.PutUint16(pkt[1:], uint16(len(data)))
-	if len(data) > 0 {
-		copy(pkt[3:], data[:])
-	}
-	copy(pkt[3+len(data):], zeroPadBytes[:padLen])
-
-	pktLen := packetOverhead + len(data) + int(padLen)
-
-	// Encode the packet in an AEAD frame.
-	var frame [framing.MaximumSegmentLength]byte
-	frameLen, err := conn.encoder.Encode(frame[:], pkt[:pktLen])
-	if err != nil {
-		// All encoder errors are fatal.
-		return err
-	}
-	wrLen, err := w.Write(frame[:frameLen])
-	if err != nil {
-		return err
-	} else if wrLen < frameLen {
-		return io.ErrShortWrite
-	}
-
-	return nil
-}
-
-func (conn *obfs4Conn) readPackets() (err error) {
-	// Attempt to read off the network.
-	rdLen, rdErr := conn.Conn.Read(conn.readBuffer)
-	conn.receiveBuffer.Write(conn.readBuffer[:rdLen])
-
-	var decoded [framing.MaximumFramePayloadLength]byte
-	for conn.receiveBuffer.Len() > 0 {
-		// Decrypt an AEAD frame.
-		decLen := 0
-		decLen, err = conn.decoder.Decode(decoded[:], conn.receiveBuffer)
-		if err == framing.ErrAgain {
-			break
-		} else if err != nil {
-			break
-		} else if decLen < packetOverhead {
-			err = InvalidPacketLengthError(decLen)
-			break
-		}
-
-		// Decode the packet.
-		pkt := decoded[0:decLen]
-		pktType := pkt[0]
-		payloadLen := binary.BigEndian.Uint16(pkt[1:])
-		if int(payloadLen) > len(pkt)-packetOverhead {
-			err = InvalidPayloadLengthError(int(payloadLen))
-			break
-		}
-		payload := pkt[3 : 3+payloadLen]
-
-		switch pktType {
-		case packetTypePayload:
-			if payloadLen > 0 {
-				conn.receiveDecodedBuffer.Write(payload)
-			}
-		case packetTypePrngSeed:
-			// Only regenerate the distribution if we are the client.
-			if len(payload) == seedPacketPayloadLength && !conn.isServer {
-				var seed *drbg.Seed
-				seed, err = drbg.SeedFromBytes(payload)
-				if err != nil {
-					break
-				}
-				conn.lenDist.Reset(seed)
-				if conn.iatDist != nil {
-					iatSeedSrc := sha256.Sum256(seed.Bytes()[:])
-					iatSeed, err := drbg.SeedFromBytes(iatSeedSrc[:])
-					if err != nil {
-						break
-					}
-					conn.iatDist.Reset(iatSeed)
-				}
-			}
-		default:
-			// Ignore unknown packet types.
-		}
-	}
-
-	// Read errors (all fatal) take priority over various frame processing
-	// errors.
-	if rdErr != nil {
-		return rdErr
-	}
-
-	return
-}

vendor/git.torproject.org/pluggable-transports/obfs4.git/transports/obfs4/statefile.go

-/*
- * Copyright (c) 2014, Yawning Angel <yawning at torproject dot org>
- * 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.
- *
- * 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 HOLDER 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.
- */
-
-package obfs4
-
-import (
-	"encoding/base64"
-	"encoding/json"
-	"fmt"
-	"io/ioutil"
-	"os"
-	"path"
-	"strconv"
-	"strings"
-
-	"git.torproject.org/pluggable-transports/goptlib.git"
-	"git.torproject.org/pluggable-transports/obfs4.git/common/csrand"
-	"git.torproject.org/pluggable-transports/obfs4.git/common/drbg"
-	"git.torproject.org/pluggable-transports/obfs4.git/common/ntor"
-)
-
-const (
-	stateFile  = "obfs4_state.json"
-	bridgeFile = "obfs4_bridgeline.txt"
-
-	certSuffix = "=="
-	certLength = ntor.NodeIDLength + ntor.PublicKeyLength
-)
-
-type jsonServerState struct {
-	NodeID     string `json:"node-id"`
-	PrivateKey string `json:"private-key"`
-	PublicKey  string `json:"public-key"`
-	DrbgSeed   string `json:"drbg-seed"`
-	IATMode    int    `json:"iat-mode"`
-}
-
-type obfs4ServerCert struct {
-	raw []byte
-}
-
-func (cert *obfs4ServerCert) String() string {
-	return strings.TrimSuffix(base64.StdEncoding.EncodeToString(cert.raw), certSuffix)
-}
-
-func (cert *obfs4ServerCert) unpack() (*ntor.NodeID, *ntor.PublicKey) {
-	if len(cert.raw) != certLength {
-		panic(fmt.Sprintf("cert length %d is invalid", len(cert.raw)))
-	}
-
-	nodeID, _ := ntor.NewNodeID(cert.raw[:ntor.NodeIDLength])
-	pubKey, _ := ntor.NewPublicKey(cert.raw[ntor.NodeIDLength:])
-
-	return nodeID, pubKey
-}
-
-func serverCertFromString(encoded string) (*obfs4ServerCert, error) {
-	decoded, err := base64.StdEncoding.DecodeString(encoded + certSuffix)
-	if err != nil {
-		return nil, fmt.Errorf("failed to decode cert: %s", err)
-	}
-
-	if len(decoded) != certLength {
-		return nil, fmt.Errorf("cert length %d is invalid", len(decoded))
-	}
-
-	return &obfs4ServerCert{raw: decoded}, nil
-}
-
-func serverCertFromState(st *obfs4ServerState) *obfs4ServerCert {
-	cert := new(obfs4ServerCert)
-	cert.raw = append(st.nodeID.Bytes()[:], st.identityKey.Public().Bytes()[:]...)
-	return cert
-}
-
-type obfs4ServerState struct {
-	nodeID      *ntor.NodeID
-	identityKey *ntor.Keypair
-	drbgSeed    *drbg.Seed
-	iatMode     int
-
-	cert *obfs4ServerCert
-}
-
-func (st *obfs4ServerState) clientString() string {
-	return fmt.Sprintf("%s=%s %s=%d", certArg, st.cert, iatArg, st.iatMode)
-}
-
-func serverStateFromArgs(stateDir string, args *pt.Args) (*obfs4ServerState, error) {
-	var js jsonServerState
-	var nodeIDOk, privKeyOk, seedOk bool
-
-	js.NodeID, nodeIDOk = args.Get(nodeIDArg)
-	js.PrivateKey, privKeyOk = args.Get(privateKeyArg)
-	js.DrbgSeed, seedOk = args.Get(seedArg)
-	iatStr, iatOk := args.Get(iatArg)
-
-	// Either a private key, node id, and seed are ALL specified, or
-	// they should be loaded from the state file.
-	if !privKeyOk && !nodeIDOk && !seedOk {
-		if err := jsonServerStateFromFile(stateDir, &js); err != nil {
-			return nil, err
-		}
-	} else if !privKeyOk {
-		return nil, fmt.Errorf("missing argument '%s'", privateKeyArg)
-	} else if !nodeIDOk {
-		return nil, fmt.Errorf("missing argument '%s'", nodeIDArg)
-	} else if !seedOk {
-		return nil, fmt.Errorf("missing argument '%s'", seedArg)
-	}
-
-	// The IAT mode should be independently configurable.
-	if iatOk {
-		// If the IAT mode is specified, attempt to parse and apply it
-		// as an override.
-		iatMode, err := strconv.Atoi(iatStr)
-		if err != nil {
-			return nil, fmt.Errorf("malformed iat-mode '%s'", iatStr)
-		}
-		js.IATMode = iatMode
-	}
-
-	return serverStateFromJSONServerState(stateDir, &js)
-}
-
-func serverStateFromJSONServerState(stateDir string, js *jsonServerState) (*obfs4ServerState, error) {
-	var err error
-
-	st := new(obfs4ServerState)
-	if st.nodeID, err = ntor.NodeIDFromHex(js.NodeID); err != nil {
-		return nil, err
-	}
-	if st.identityKey, err = ntor.KeypairFromHex(js.PrivateKey); err != nil {
-		return nil, err
-	}
-	if st.drbgSeed, err = drbg.SeedFromHex(js.DrbgSeed); err != nil {
-		return nil, err
-	}
-	if js.IATMode < iatNone || js.IATMode > iatParanoid {
-		return nil, fmt.Errorf("invalid iat-mode '%d'", js.IATMode)
-	}
-	st.iatMode = js.IATMode
-	st.cert = serverCertFromState(st)
-
-	// Generate a human readable summary of the configured endpoint.
-	if err = newBridgeFile(stateDir, st); err != nil {
-		return nil, err
-	}
-
-	// Write back the possibly updated server state.
-	return st, writeJSONServerState(stateDir, js)
-}
-
-func jsonServerStateFromFile(stateDir string, js *jsonServerState) error {
-	fPath := path.Join(stateDir, stateFile)
-	f, err := ioutil.ReadFile(fPath)
-	if err != nil {
-		if os.IsNotExist(err) {
-			if err = newJSONServerState(stateDir, js); err == nil {
-				return nil
-			}
-		}
-		return err
-	}
-
-	if err := json.Unmarshal(f, js); err != nil {
-		return fmt.Errorf("failed to load statefile '%s': %s", fPath, err)
-	}
-
-	return nil
-}
-
-func newJSONServerState(stateDir string, js *jsonServerState) (err error) {
-	// Generate everything a server needs, using the cryptographic PRNG.
-	var st obfs4ServerState
-	rawID := make([]byte, ntor.NodeIDLength)
-	if err = csrand.Bytes(rawID); err != nil {
-		return
-	}
-	if st.nodeID, err = ntor.NewNodeID(rawID); err != nil {
-		return
-	}
-	if st.identityKey, err = ntor.NewKeypair(false); err != nil {
-		return
-	}
-	if st.drbgSeed, err = drbg.NewSeed(); err != nil {
-		return
-	}
-	st.iatMode = iatNone
-
-	// Encode it into JSON format and write the state file.
-	js.NodeID = st.nodeID.Hex()
-	js.PrivateKey = st.identityKey.Private().Hex()
-	js.PublicKey = st.identityKey.Public().Hex()
-	js.DrbgSeed = st.drbgSeed.Hex()
-	js.IATMode = st.iatMode
-
-	return writeJSONServerState(stateDir, js)
-}
-
-func writeJSONServerState(stateDir string, js *jsonServerState) error {
-	var err error
-	var encoded []byte
-	if encoded, err = json.Marshal(js); err != nil {
-		return err
-	}
-	if err = ioutil.WriteFile(path.Join(stateDir, stateFile), encoded, 0600); err != nil {
-		return err
-	}
-
-	return nil
-}
-
-func newBridgeFile(stateDir string, st *obfs4ServerState) error {
-	const prefix = "# obfs4 torrc client bridge line\n" +
-		"#\n" +
-		"# This file is an automatically generated bridge line based on\n" +
-		"# the current obfs4proxy configuration.  EDITING IT WILL HAVE\n" +
-		"# NO EFFECT.\n" +
-		"#\n" +
-		"# Before distributing this Bridge, edit the placeholder fields\n" +
-		"# to contain the actual values:\n" +
-		"#  <IP ADDRESS>  - The public IP address of your obfs4 bridge.\n" +
-		"#  <PORT>        - The TCP/IP port of your obfs4 bridge.\n" +
-		"#  <FINGERPRINT> - The bridge's fingerprint.\n\n"
-
-	bridgeLine := fmt.Sprintf("Bridge obfs4 <IP ADDRESS>:<PORT> <FINGERPRINT> %s\n",
-		st.clientString())
-
-	tmp := []byte(prefix + bridgeLine)
-	if err := ioutil.WriteFile(path.Join(stateDir, bridgeFile), tmp, 0600); err != nil {
-		return err
-	}
-
-	return nil
-}

vendor/github.com/Yawning/chacha20/README.md

-### chacha20 - ChaCha20
-#### Yawning Angel (yawning at schwanenlied dot me)
-
-Yet another Go ChaCha20 implementation.  Everything else I found  was slow,
-didn't support all the variants I need to use, or relied on cgo to go fast.
-
-Features:
-
- * 20 round, 256 bit key only.  Everything else is pointless and stupid.
- * IETF 96 bit nonce variant.
- * XChaCha 24 byte nonce variant.
- * SSE2 and AVX2 support on amd64 targets.
- * Incremental encrypt/decrypt support, unlike golang.org/x/crypto/salsa20.
-

vendor/github.com/aead/chacha20/.gitignore

-# Compiled Object files, Static and Dynamic libs (Shared Objects)
-*.o
-*.a
-*.so
-
-# Folders
-_obj
-_test
-.vscode
-
-# Architecture specific extensions/prefixes
-*.[568vq]
-[568vq].out
-
-*.cgo1.go
-*.cgo2.c
-_cgo_defun.c
-_cgo_gotypes.go
-_cgo_export.*
-
-_testmain.go
-
-*.exe
-*.test
-*.prof

vendor/github.com/aead/chacha20/.travis.yml

-language: go
-
-go:
-  - "1.8.x"
-  - "1.9.x"
-  - "1.10.x"
-
-env:
-   - TRAVIS_GOARCH=amd64
-   - TRAVIS_GOARCH=386 
- 
-before_install:
-- export GOARCH=$TRAVIS_GOARCH
-
-branches:
-  only:
-  - master
-
-before_script:
-- go get -u github.com/klauspost/asmfmt/cmd/asmfmt
-
-script:
-- diff -au <(gofmt -d .) <(printf "")
-- diff -au <(asmfmt -d .) <(printf "")
-- go test -v ./...

vendor/github.com/aead/chacha20/LICENSE

-The MIT License (MIT)
-
-Copyright (c) 2016 Andreas Auernhammer
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.

vendor/github.com/cheekybits/genny/generic/doc.go

-// Package generic contains the generic marker types.
-package generic

vendor/github.com/docker/libcontainer/netlink/MAINTAINERS

-Michael Crosby <michael@crosbymichael.com> (@crosbymichael)
-Guillaume J. Charmes <guillaume@docker.com> (@creack)