[ { "path": ".cirrus.yml", "content": "---\n\nenv:\n GOPATH: \"/var/tmp/go\"\n CIRRUS_WORKING_DIR: \"${GOPATH}/src/github.com/containers/dnsname\"\n GOSRC: \"$CIRRUS_WORKING_DIR\"\n CIRRUS_SHELL: \"/bin/bash\"\n IMAGE_PROJECT: \"libpod-218412\"\n HOME: \"/root\" # not set by default\n GOCACHE: \"${GOPATH}/cache\"\n\n # Make names more readable in github/cirrus-ci\n FEDORA_NAME: \"fedora-38\"\n DEBIAN_NAME: \"debian-12\"\n\n # VM Images are maintained in the automation_images repo.\n IMAGE_SUFFIX: \"c20230517t144652z-f38f37d12\"\n FEDORA_CACHE_IMAGE_NAME: \"fedora-${IMAGE_SUFFIX}\"\n DEBIAN_CACHE_IMAGE_NAME: \"debian-${IMAGE_SUFFIX}\"\n\n # Must be defined true when testing w/in containers\n CONTAINER: \"false\"\n\ngcp_credentials: ENCRYPTED[5ad247acfd6cfca94554b973d61a98a7882dfafbfcc1deb5faee8634cb3f8cf29720c88c243586d2975dd40885279db6]\n\n\n# Default VM to use unless set or modified by task\ngce_instance:\n image_project: \"${IMAGE_PROJECT}\"\n zone: \"us-central1-c\" # Required by Cirrus for the time being\n cpu: 2\n memory: \"4Gb\"\n disk: 200 # Required for performance reasons\n image_name: \"${FEDORA_CACHE_IMAGE_NAME}\"\n\n\n# Update metadata on VM images referenced by this repository state\nmeta_task:\n # see bors.toml\n skip: $CIRRUS_BRANCH =~ \".*\\.tmp\"\n\n container:\n image: \"quay.io/libpod/imgts:latest\"\n cpu: 1\n memory: 1\n\n env:\n CONTAINER: true\n # Space-separated list of images used by this repository state\n IMGNAMES: |-\n ${FEDORA_CACHE_IMAGE_NAME}\n ${DEBIAN_CACHE_IMAGE_NAME}\n BUILDID: \"${CIRRUS_BUILD_ID}\"\n REPOREF: \"${CIRRUS_REPO_NAME}\"\n GCPJSON: ENCRYPTED[35f6dca7928a3b676c05e0e6a6ce7f4ca3d347803e23b8d5d57ea8a22973248e2808e8726b9463b00b57e576c5ff0331]\n GCPNAME: ENCRYPTED[f3890da8c780aaa352ae8d1e3c9fedffd0a233625c1b983e6754e609a92d5c814167ee53ef967896d66c73710c90465e]\n GCPPROJECT: ENCRYPTED[e82537cfb95d6121717be1f23078a18b14de224de82ed2f72c0a8f0adc77b5c7e8ad394d10714214bccb9f010d65ac29]\n CIRRUS_CLONE_DEPTH: 1 # source not used\n\n script: /usr/local/bin/entrypoint.sh\n\n\nvalidate_task:\n\n validate_script:\n - export PATH=\"$PATH:$GOPATH/bin\"\n - make validate\n - make vendor\n - ./hack/tree_status.sh\n - make\n\n\ntest_task:\n alias: test\n\n depends_on:\n - validate\n\n matrix:\n - name: $FEDORA_NAME\n gce_instance:\n image_name: ${FEDORA_CACHE_IMAGE_NAME}\n - name: $DEBIAN_NAME\n gce_instance:\n image_name: ${DEBIAN_CACHE_IMAGE_NAME}\n\n test_script:\n - export PATH=\"$PATH:$GOPATH/bin\"\n - make\n - make test\n" }, { "path": ".github/renovate.json5", "content": "/*\n Renovate is a service similar to GitHub Dependabot, but with\n (fantastically) more configuration options. So many options\n in fact, if you're new I recommend glossing over this cheat-sheet\n prior to the official documentation:\n\n https://www.augmentedmind.de/2021/07/25/renovate-bot-cheat-sheet\n\n Configuration Update/Change Procedure:\n 1. Make changes\n 2. Manually validate changes (from repo-root):\n\n podman run -it \\\n -v ./.github/renovate.json5:/usr/src/app/renovate.json5:z \\\n docker.io/renovate/renovate:latest \\\n renovate-config-validator\n 3. Commit.\n\n Configuration Reference:\n https://docs.renovatebot.com/configuration-options/\n\n Monitoring Dashboard:\n https://app.renovatebot.com/dashboard#github/containers\n\n Note: The Renovate bot will create/manage it's business on\n branches named 'renovate/*'. Otherwise, and by\n default, the only the copy of this file that matters\n is the one on the `main` branch. No other branches\n will be monitored or touched in any way.\n*/\n\n{\n \"$schema\": \"https://docs.renovatebot.com/renovate-schema.json\",\n\n /*************************************************\n ****** Global/general configuration options *****\n *************************************************/\n\n // Re-use predefined sets of configuration options to DRY\n \"extends\": [\n // https://github.com/containers/automation/blob/main/renovate/defaults.json5\n \"github>containers/automation//renovate/defaults.json5\"\n ],\n\n // Permit automatic rebasing when base-branch changes by more than\n // one commit.\n \"rebaseWhen\": \"behind-base-branch\",\n\n /*************************************************\n *** Repository-specific configuration options ***\n *************************************************/\n\n // Don't leave dep. update. PRs \"hanging\", assign them to people.\n \"assignees\": [\"baude\"],\n}\n" }, { "path": ".gitignore", "content": "bin/*\n" }, { "path": "CODE-OF-CONDUCT.md", "content": "## The dnsname Project Community Code of Conduct\n\nThe dnsname project follows the [Containers Community Code of Conduct](https://github.com/containers/common/blob/main/CODE-OF-CONDUCT.md).\n" }, { "path": "LICENSE", "content": " Apache License\n Version 2.0, January 2004\n http://www.apache.org/licenses/\n\n TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION\n\n 1. Definitions.\n\n \"License\" shall mean the terms and conditions for use, reproduction,\n and distribution as defined by Sections 1 through 9 of this document.\n\n \"Licensor\" shall mean the copyright owner or entity authorized by\n the copyright owner that is granting the License.\n\n \"Legal Entity\" shall mean the union of the acting entity and all\n other entities that control, are controlled by, or are under common\n control with that entity. For the purposes of this definition,\n \"control\" means (i) the power, direct or indirect, to cause the\n direction or management of such entity, whether by contract or\n otherwise, or (ii) ownership of fifty percent (50%) or more of the\n outstanding shares, or (iii) beneficial ownership of such entity.\n\n \"You\" (or \"Your\") shall mean an individual or Legal Entity\n exercising permissions granted by this License.\n\n \"Source\" form shall mean the preferred form for making modifications,\n including but not limited to software source code, documentation\n source, and configuration files.\n\n \"Object\" form shall mean any form resulting from mechanical\n transformation or translation of a Source form, including but\n not limited to compiled object code, generated documentation,\n and conversions to other media types.\n\n \"Work\" shall mean the work of authorship, whether in Source or\n Object form, made available under the License, as indicated by a\n copyright notice that is included in or attached to the work\n (an example is provided in the Appendix below).\n\n \"Derivative Works\" shall mean any work, whether in Source or Object\n form, that is based on (or derived from) the Work and for which the\n editorial revisions, annotations, elaborations, or other modifications\n represent, as a whole, an original work of authorship. For the purposes\n of this License, Derivative Works shall not include works that remain\n separable from, or merely link (or bind by name) to the interfaces of,\n the Work and Derivative Works thereof.\n\n \"Contribution\" shall mean any work of authorship, including\n the original version of the Work and any modifications or additions\n to that Work or Derivative Works thereof, that is intentionally\n submitted to Licensor for inclusion in the Work by the copyright owner\n or by an individual or Legal Entity authorized to submit on behalf of\n the copyright owner. For the purposes of this definition, \"submitted\"\n means any form of electronic, verbal, or written communication sent\n to the Licensor or its representatives, including but not limited to\n communication on electronic mailing lists, source code control systems,\n and issue tracking systems that are managed by, or on behalf of, the\n Licensor for the purpose of discussing and improving the Work, but\n excluding communication that is conspicuously marked or otherwise\n designated in writing by the copyright owner as \"Not a Contribution.\"\n\n \"Contributor\" shall mean Licensor and any individual or Legal Entity\n on behalf of whom a Contribution has been received by Licensor and\n subsequently incorporated within the Work.\n\n 2. Grant of Copyright License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n copyright license to reproduce, prepare Derivative Works of,\n publicly display, publicly perform, sublicense, and distribute the\n Work and such Derivative Works in Source or Object form.\n\n 3. Grant of Patent License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n (except as stated in this section) patent license to make, have made,\n use, offer to sell, sell, import, and otherwise transfer the Work,\n where such license applies only to those patent claims licensable\n by such Contributor that are necessarily infringed by their\n Contribution(s) alone or by combination of their Contribution(s)\n with the Work to which such Contribution(s) was submitted. If You\n institute patent litigation against any entity (including a\n cross-claim or counterclaim in a lawsuit) alleging that the Work\n or a Contribution incorporated within the Work constitutes direct\n or contributory patent infringement, then any patent licenses\n granted to You under this License for that Work shall terminate\n as of the date such litigation is filed.\n\n 4. Redistribution. You may reproduce and distribute copies of the\n Work or Derivative Works thereof in any medium, with or without\n modifications, and in Source or Object form, provided that You\n meet the following conditions:\n\n (a) You must give any other recipients of the Work or\n Derivative Works a copy of this License; and\n\n (b) You must cause any modified files to carry prominent notices\n stating that You changed the files; and\n\n (c) You must retain, in the Source form of any Derivative Works\n that You distribute, all copyright, patent, trademark, and\n attribution notices from the Source form of the Work,\n excluding those notices that do not pertain to any part of\n the Derivative Works; and\n\n (d) If the Work includes a \"NOTICE\" text file as part of its\n distribution, then any Derivative Works that You distribute must\n include a readable copy of the attribution notices contained\n within such NOTICE file, excluding those notices that do not\n pertain to any part of the Derivative Works, in at least one\n of the following places: within a NOTICE text file distributed\n as part of the Derivative Works; within the Source form or\n documentation, if provided along with the Derivative Works; or,\n within a display generated by the Derivative Works, if and\n wherever such third-party notices normally appear. The contents\n of the NOTICE file are for informational purposes only and\n do not modify the License. You may add Your own attribution\n notices within Derivative Works that You distribute, alongside\n or as an addendum to the NOTICE text from the Work, provided\n that such additional attribution notices cannot be construed\n as modifying the License.\n\n You may add Your own copyright statement to Your modifications and\n may provide additional or different license terms and conditions\n for use, reproduction, or distribution of Your modifications, or\n for any such Derivative Works as a whole, provided Your use,\n reproduction, and distribution of the Work otherwise complies with\n the conditions stated in this License.\n\n 5. Submission of Contributions. Unless You explicitly state otherwise,\n any Contribution intentionally submitted for inclusion in the Work\n by You to the Licensor shall be under the terms and conditions of\n this License, without any additional terms or conditions.\n Notwithstanding the above, nothing herein shall supersede or modify\n the terms of any separate license agreement you may have executed\n with Licensor regarding such Contributions.\n\n 6. Trademarks. This License does not grant permission to use the trade\n names, trademarks, service marks, or product names of the Licensor,\n except as required for reasonable and customary use in describing the\n origin of the Work and reproducing the content of the NOTICE file.\n\n 7. Disclaimer of Warranty. Unless required by applicable law or\n agreed to in writing, Licensor provides the Work (and each\n Contributor provides its Contributions) on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\n implied, including, without limitation, any warranties or conditions\n of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A\n PARTICULAR PURPOSE. You are solely responsible for determining the\n appropriateness of using or redistributing the Work and assume any\n risks associated with Your exercise of permissions under this License.\n\n 8. Limitation of Liability. In no event and under no legal theory,\n whether in tort (including negligence), contract, or otherwise,\n unless required by applicable law (such as deliberate and grossly\n negligent acts) or agreed to in writing, shall any Contributor be\n liable to You for damages, including any direct, indirect, special,\n incidental, or consequential damages of any character arising as a\n result of this License or out of the use or inability to use the\n Work (including but not limited to damages for loss of goodwill,\n work stoppage, computer failure or malfunction, or any and all\n other commercial damages or losses), even if such Contributor\n has been advised of the possibility of such damages.\n\n 9. Accepting Warranty or Additional Liability. While redistributing\n the Work or Derivative Works thereof, You may choose to offer,\n and charge a fee for, acceptance of support, warranty, indemnity,\n or other liability obligations and/or rights consistent with this\n License. However, in accepting such obligations, You may act only\n on Your own behalf and on Your sole responsibility, not on behalf\n of any other Contributor, and only if You agree to indemnify,\n defend, and hold each Contributor harmless for any liability\n incurred by, or claims asserted against, such Contributor by reason\n of your accepting any such warranty or additional liability.\n\n END OF TERMS AND CONDITIONS\n\n APPENDIX: How to apply the Apache License to your work.\n\n To apply the Apache License to your work, attach the following\n boilerplate notice, with the fields enclosed by brackets \"{}\"\n replaced with your own identifying information. (Don't include\n the brackets!) The text should be enclosed in the appropriate\n comment syntax for the file format. We also recommend that a\n file or class name and description of purpose be included on the\n same \"printed page\" as the copyright notice for easier\n identification within third-party archives.\n\n Copyright {yyyy} {name of copyright owner}\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n" }, { "path": "Makefile", "content": "export GOPROXY=https://proxy.golang.org\n\nGO ?= go\nEPOCH_TEST_COMMIT ?= 394c06f491fe9f1c28a410e3b0b91916a5119406\nDESTDIR ?=\nLIBEXECDIR ?= ${PREFIX}/libexec/cni\nPREFIX ?= /usr/local\n\nPROJECT := github.com/containers/dnsname\nFIRST_GOPATH := $(firstword $(subst :, ,$(GOPATH)))\nGOPKGDIR := $(FIRST_GOPATH)/src/$(PROJECT)\nGOPKGBASEDIR ?= $(shell dirname \"$(GOPKGDIR)\")\n\nSELINUXOPT ?= $(shell test -x /usr/sbin/selinuxenabled && selinuxenabled && echo -Z)\n\nCOMMIT_NO ?= $(shell git rev-parse HEAD 2> /dev/null || true)\nGIT_COMMIT ?= $(if $(shell git status --porcelain --untracked-files=no),${COMMIT_NO}-dirty,${COMMIT_NO})\n\nLDFLAGS_DNSNAME ?= -X main.gitCommit=$(GIT_COMMIT)\n\nGO_BUILD=$(GO) build\n# Go module support: set `-mod=vendor` to use the vendored sources\nifeq ($(shell go help mod >/dev/null 2>&1 && echo true), true)\n\tGO_BUILD=GO111MODULE=on $(GO) build -mod=vendor\nendif\n\nGOBIN := $(shell $(GO) env GOBIN)\nifeq ($(GOBIN),)\nGOBIN := $(FIRST_GOPATH)/bin\nendif\n\nall: binaries\n\nvalidate: install.tools gofmt .gitvalidation lint\n\ngofmt:\n\tfind . -name '*.go' ! -path './vendor/*' -exec gofmt -s -w {} \\+\n\tgit diff --exit-code\n\n\nbinaries:\n\t$(GO_BUILD) -ldflags '$(LDFLAGS_DNSNAME)' -o bin/dnsname github.com/containers/dnsname/plugins/meta/dnsname\n\n.PHONY: .gitvalidation\n.gitvalidation:\n\tGIT_CHECK_EXCLUDE=\"./vendor\" $(GOBIN)/git-validation -v -run DCO,short-subject,dangling-whitespace -range $(EPOCH_TEST_COMMIT)..$(HEAD)\n\n.PHONY: install.tools\ninstall.tools: .install.gitvalidation .install.ginkgo .install.golangci-lint\n\nlint: .install.golangci-lint\n\t./bin/golangci-lint run\n\ndefine go-get\n\tenv GO111MODULE=off \\\n\t\t$(GO) get -u ${1}\nendef\n\n.install.ginkgo:\n\tif [ ! -x \"$(GOBIN)/ginkgo\" ]; then \\\n\t\t$(call go-get,github.com/onsi/ginkgo/ginkgo); \\\n\tfi\n\n.install.gitvalidation:\n\tif [ ! -x \"$(GOBIN)/git-validation\" ]; then \\\n\t\t$(call go-get,github.com/vbatts/git-validation); \\\n\tfi\n\n.install.golangci-lint:\n\tif [ ! -x \"./bin/golangci-lint\" ]; then \\\n\t\tcurl -sSfL https://raw.githubusercontent.com/golangci/golangci-lint/master/install.sh | sh -s v1.51.1 ; \\\n\tfi\n\ninstall:\n\tinstall ${SELINUXOPT} -d -m 755 $(DESTDIR)$(LIBEXECDIR)\n\tinstall ${SELINUXOPT} -m 755 bin/dnsname $(DESTDIR)$(LIBEXECDIR)/dnsname\n\nclean:\n\trm -fr bin/\n\ntest: .install.ginkgo\n\t$(GO) test -v ./...\n\nvendor:\n\texport GO111MODULE=on \\\n\t\t$(GO) mod tidy && \\\n\t\t$(GO) mod vendor && \\\n\t\t$(GO) mod verify\n\n.PHONY: vendor-in-container\nvendor-in-container:\n\tpodman run --privileged --rm --env HOME=/root -v `pwd`:/src -w /src docker.io/library/golang:1.13 make vendor\n\n.PHONY: \\\n\tbinaries \\\n\ttest \\\n\tgofmt \\\n\tlint \\\n\tvalidate \\\n\tvendor\n" }, { "path": "OWNERS", "content": "approvers:\n - mheon\n - baude\n - mrunalp\n - rhatdan\n - TomSweeneyRedHat\n - giuseppe\n - vrothberg\n - jwhonce\nreviewers:\n - mheon\n - baude\n - mrunalp\n - rhatdan\n - TomSweeneyRedHat\n - giuseppe\n - vrothberg\n - jwhonce\n" }, { "path": "README.md", "content": "# dnsname plugin\n\n## IMPORTANT\n\nAs of 2023, this repository is no longer actively maintained. Our development efforts are happening in [netavark](https://github.com/containers/netavark/) and [aardvark-dns](https://github.com/containers/aardvark-dns/) that should provide a better alternative.\n\n## Overview\n\nThis plugin sets up the use of dnsmasq on a given CNI network so that Pods can resolve each other by name. When configured,\nthe pod and its IP address are added to a network specific hosts file that dnsmasq reads in. Similarly, when a pod\nis removed from the network, it will remove the entry from the hosts file. Each CNI network will have its own dnsmasq\ninstance.\n\nThe *dnsname* plugin was specifically designed for the [Podman](https://github.com/containers/podman) container engine.\nFollow the [mini-tutorial](README_PODMAN.md) to use it with Podman.\n\n\n## Usage\nThe dnsname plugin can be enabled in the cni network configuration file.\n\n```\n{\n \"cniVersion\": \"0.4.0\",\n \"name\": \"cni-bridge-network\",\n \"plugins\": [\n {\n \"type\": \"bridge\",\n \"bridge\": \"cni0\",\n ...\n }\n },\n {\n \"type\": \"dnsname\",\n \"domainName\": \"foobar.com\",\n \"capabilities\": {\n \"aliases\": true\n }\n }\n ]\n}\n```\n\n## DNSMasq configuration files\nThe dnsmasq service and its configuration files are considered to be very fluid and are not meant to survive a system\nreboot. Therefore, files are stored in `/run/containers/cni/dnsname`, or under `$XDG_RUNTIME_DIR/containers/cni/dnsname` if\n`XDG_RUNTIME_DIR` is specified. The plugin knows to recreate the necessary files if it detects they are not present.\n\n## DNSMasq default configuration\nMuch like the implementation of DNSMasq for libvirt, this plugin will only set up dnsmasq to listen on the network\ninterfaces associated with the CNI network. The DNSMasq services are not configured or managed by systemd but rather\nonly by the plugin itself.\n\n## Network aliases\nThe dnsname plugin is capable of not only adding the container name for DNS resolution but also adding network aliases. These\naliases are also added to the DNSMasq host file.\n\n## Reporting issues\nIf you are using dnsname code compiled directly from github, then reporting bugs and problem to the dnsname github issues tracker\nis appropriate. In the case that you are using code compiled and provided by a Linux distribution, you should file the problem\nwith their appropriate bug tracker (bugzilla/trackpad).\n" }, { "path": "README_PODMAN.md", "content": "# Using the dnsname plugin with Podman\n\nThe *dnsname* plugin allows containers to resolve each other by name. The plugin adds each\ncontainer's name to an instance of a dnsmasq server. The plugin is enabled through adding it to a network's\nCNI configuration. The containers will only be able to resolve each other if they are on the same CNI network.\n\nThis tutorial assumes you already have Podman, containernetworking-plugins, and a golang development environment installed.\n\n## Install dnsmasq\n\nUsing your package manager, install the *dnsmasq* package. For Fedora, this would be:\n`sudo dnf install dnsmasq`\n\n### AppArmor\n\nIf your system uses AppArmor, it can prevent dnsmasq to open the necessary files. To fix this, add the following lines to `/etc/apparmor.d/local/usr.sbin.dnsmasq`:\n\n```\n# required by the dnsname plugin in podman\n/run/containers/cni/dnsname/*/dnsmasq.conf r,\n/run/containers/cni/dnsname/*/addnhosts r,\n/run/containers/cni/dnsname/*/pidfile rw,\n```\n\nThen reload the main dnsmasq profile:\n\n```\nsudo apparmor_parser -r /etc/apparmor.d/usr.sbin.dnsmasq\n```\n\n## Build and install\n\n1. using git, clone the *github.com/containers/dnsname* repository.\n2. make install PREFIX=/usr -- this will install the dnsname plugin into /usr/libexec/cni where\nyour CNI plugins should already exist.\n\n## Configure a CNI network for Podman\n\n1. Create a new network using `podman network create`. For example, `podman network create foobar` will suffice.\n\nThe following example [configuration file](example/foobar.conflist) shows a usable example for Podman.\n\n2. (optional)+The configuration will be automatically enabled for newly created networks via\n`podman network create`. If you want to add this feature to an exisiting network add the needed\nlines to `/etc/cni/net.d/foobar.conflist` using your favorite editor. For example:\n\n ```\n{\n \"cniVersion\": \"0.4.0\",\n \"name\": \"foobar\",\n \"plugins\": [\n ...\n {\n \"type\": \"dnsname\",\n \"domainName\": \"dns.podman\",\n \"capabilities\": {\n \"aliases\": true\n }\n }\n ]\n}\n ```\n\n## Example: container name resolution\n\nIn this test image, the nginx server will\nrespond with *podman rulez* on an http request.\n**Note**: we use the --network foobar here.\n\n```console\nsudo podman run -dt --name web --network foobar quay.io/libpod/alpine_nginx:latest\n5139d65d22135e9ecab511559d863754550894a32285befd94dab231017048c2\n\nsudo podman run -it --name client --network foobar quay.io/libpod/alpine_nginx:latest curl http://web.dns.podman/\npodman rulez\n```\n\n## Enabling name resolution on the default Podman network\nAfter making sure the *dnsplugin* is functioning properly, you can add name resolution to your default Podman\nnetwork. This can be done two different ways:\n\n1. Add the *dnsname* plugin as described in above to your default Podman network. This default network is\nusually `/etc/cni/net.d/87-podman-bridge.conflist`.\n" }, { "path": "RELEASE_NOTES.md", "content": "# Release Notes\n\n## 1.3.1\n- Fixed an issue where an incorrect use of `LDFLAGS` made `dnsname` unable to build in some packaging systems.\n\n## 1.3.0\n- Fixed a bug where errors when removing a container from `dnsname` could cause CNI to fail to clean up iptables rules for the container.\n- Fixed a bug where `dnsname` would never remove unused configuration files for networks that no longer had containers present.\n- If errors occur when running `dnsmasq`, the full error message is now displayed for debugging.\n- The version number of `dnsname` is now displayed correctly.\n\n## 1.2.0\n- DNS Search domains required to use the `dnsname` plugin are now returned in the CNI response.\n\n## 1.1.1\n- Fixed a bug where network aliases support was nonfunctional.\n\n## 1.1.0\n- Added support for network aliases - multiple names for the same container.\n\n## 1.0.0\n- Initial release" }, { "path": "SECURITY.md", "content": "## Security and Disclosure Information Policy for the dnsname Project\n\nThe dnsname Project follows the [Security and Disclosure Information Policy](https://github.com/containers/common/blob/main/SECURITY.md) for the Containers Projects.\n" }, { "path": "ci/Dockerfile", "content": "FROM registry.fedoraproject.org/fedora:latest\nRUN dnf update -y && dnf install -y golang make findutils && dnf -y clean all\n" }, { "path": "example/foobar.conflist", "content": "{\n \"cniVersion\": \"0.4.0\",\n \"name\": \"foobar\",\n \"plugins\": [\n {\n \"type\": \"bridge\",\n \"bridge\": \"cni-podman1\",\n \"isGateway\": true,\n \"ipMasq\": true,\n \"hairpinMode\": true,\n \"ipam\": {\n \"type\": \"host-local\",\n \"routes\": [\n {\n \"dst\": \"0.0.0.0/0\"\n }\n ],\n \"ranges\": [\n [\n {\n \"subnet\": \"10.89.0.0/24\"\n }\n ]\n ]\n }\n },\n {\n \"type\": \"portmap\",\n \"capabilities\": {\n \"portMappings\": true\n }\n },\n {\n \"type\": \"firewall\",\n \"backend\": \"\"\n },\n {\n \"type\": \"tuning\"\n },\n {\n \"type\": \"dnsname\",\n \"domainName\": \"dns.podman\",\n \"capabilities\": {\n \"aliases\": true\n }\n }\n ]\n}" }, { "path": "go.mod", "content": "module github.com/containers/dnsname\n\ngo 1.13\n\nrequire (\n\tgithub.com/containernetworking/cni v1.1.2\n\tgithub.com/containernetworking/plugins v0.9.1\n\tgithub.com/coreos/go-iptables v0.6.0\n\tgithub.com/onsi/ginkgo v1.16.5\n\tgithub.com/onsi/gomega v1.17.0\n\tgithub.com/pkg/errors v0.9.1\n\tgithub.com/sirupsen/logrus v1.9.2\n\tgithub.com/vishvananda/netlink v1.1.1-0.20210916161339-2c39f3491956\n\tgolang.org/x/sys v0.0.0-20220715151400-c0bba94af5f8\n)\n" }, { "path": "go.sum", "content": "github.com/Microsoft/go-winio v0.4.11/go.mod h1:VhR8bwka0BXejwEJY73c50VrPtXAaKcyvVC4A4RozmA=\ngithub.com/Microsoft/hcsshim v0.8.6/go.mod h1:Op3hHsoHPAvb6lceZHDtd9OkTew38wNoXnJs8iY7rUg=\ngithub.com/alexflint/go-filemutex v0.0.0-20171022225611-72bdc8eae2ae h1:AMzIhMUqU3jMrZiTuW0zkYeKlKDAFD+DG20IoO421/Y=\ngithub.com/alexflint/go-filemutex v0.0.0-20171022225611-72bdc8eae2ae/go.mod h1:CgnQgUtFrFz9mxFNtED3jI5tLDjKlOM+oUF/sTk6ps0=\ngithub.com/buger/jsonparser v0.0.0-20180808090653-f4dd9f5a6b44/go.mod h1:bbYlZJ7hK1yFx9hf58LP0zeX7UjIGs20ufpu3evjr+s=\ngithub.com/chzyer/logex v1.1.10/go.mod h1:+Ywpsq7O8HXn0nuIou7OrIPyXbp3wmkHB+jjWRnGsAI=\ngithub.com/chzyer/readline v0.0.0-20180603132655-2972be24d48e/go.mod h1:nSuG5e5PlCu98SY8svDHJxuZscDgtXS6KTTbou5AhLI=\ngithub.com/chzyer/test v0.0.0-20180213035817-a1ea475d72b1/go.mod h1:Q3SI9o4m/ZMnBNeIyt5eFwwo7qiLfzFZmjNmxjkiQlU=\ngithub.com/containernetworking/cni v0.8.1/go.mod h1:LGwApLUm2FpoOfxTDEeq8T9ipbpZ61X79hmU3w8FmsY=\ngithub.com/containernetworking/cni v1.1.2 h1:wtRGZVv7olUHMOqouPpn3cXJWpJgM6+EUl31EQbXALQ=\ngithub.com/containernetworking/cni v1.1.2/go.mod h1:sDpYKmGVENF3s6uvMvGgldDWeG8dMxakj/u+i9ht9vw=\ngithub.com/containernetworking/plugins v0.9.1 h1:FD1tADPls2EEi3flPc2OegIY1M9pUa9r2Quag7HMLV8=\ngithub.com/containernetworking/plugins v0.9.1/go.mod h1:xP/idU2ldlzN6m4p5LmGiwRDjeJr6FLK6vuiUwoH7P8=\ngithub.com/coreos/go-iptables v0.5.0/go.mod h1:/mVI274lEDI2ns62jHCDnCyBF9Iwsmekav8Dbxlm1MU=\ngithub.com/coreos/go-iptables v0.6.0 h1:is9qnZMPYjLd8LYqmm/qlE+wwEgJIkTYdhV3rfZo4jk=\ngithub.com/coreos/go-iptables v0.6.0/go.mod h1:Qe8Bv2Xik5FyTXwgIbLAnv2sWSBmvWdFETJConOQ//Q=\ngithub.com/coreos/go-systemd v0.0.0-20180511133405-39ca1b05acc7/go.mod h1:F5haX7vjVVG0kc13fIWeqUViNPyEJxv/OmvnBo0Yme4=\ngithub.com/d2g/dhcp4 v0.0.0-20170904100407-a1d1b6c41b1c/go.mod h1:Ct2BUK8SB0YC1SMSibvLzxjeJLnrYEVLULFNiHY9YfQ=\ngithub.com/d2g/dhcp4client v1.0.0/go.mod h1:j0hNfjhrt2SxUOw55nL0ATM/z4Yt3t2Kd1mW34z5W5s=\ngithub.com/d2g/dhcp4server v0.0.0-20181031114812-7d4a0a7f59a5/go.mod h1:Eo87+Kg/IX2hfWJfwxMzLyuSZyxSoAug2nGa1G2QAi8=\ngithub.com/d2g/hardwareaddr v0.0.0-20190221164911-e7d9fbe030e4/go.mod h1:bMl4RjIciD2oAxI7DmWRx6gbeqrkoLqv3MV0vzNad+I=\ngithub.com/davecgh/go-spew v1.1.0/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38=\ngithub.com/davecgh/go-spew v1.1.1 h1:vj9j/u1bqnvCEfJOwUhtlOARqs3+rkHYY13jYWTU97c=\ngithub.com/davecgh/go-spew v1.1.1/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38=\ngithub.com/fsnotify/fsnotify v1.4.7/go.mod h1:jwhsz4b93w/PPRr/qN1Yymfu8t87LnFCMoQvtojpjFo=\ngithub.com/fsnotify/fsnotify v1.4.9 h1:hsms1Qyu0jgnwNXIxa+/V/PDsU6CfLf6CNO8H7IWoS4=\ngithub.com/fsnotify/fsnotify v1.4.9/go.mod h1:znqG4EE+3YCdAaPaxE2ZRY/06pZUdp0tY4IgpuI1SZQ=\ngithub.com/go-task/slim-sprig v0.0.0-20210107165309-348f09dbbbc0/go.mod h1:fyg7847qk6SyHyPtNmDHnmrv/HOrqktSC+C9fM+CJOE=\ngithub.com/godbus/dbus v0.0.0-20180201030542-885f9cc04c9c/go.mod h1:/YcGZj5zSblfDWMMoOzV4fas9FZnQYTkDnsGvmh2Grw=\ngithub.com/golang/protobuf v1.2.0/go.mod h1:6lQm79b+lXiMfvg/cZm0SGofjICqVBUtrP5yJMmIC1U=\ngithub.com/golang/protobuf v1.4.0-rc.1/go.mod h1:ceaxUfeHdC40wWswd/P6IGgMaK3YpKi5j83Wpe3EHw8=\ngithub.com/golang/protobuf v1.4.0-rc.1.0.20200221234624-67d41d38c208/go.mod h1:xKAWHe0F5eneWXFV3EuXVDTCmh+JuBKY0li0aMyXATA=\ngithub.com/golang/protobuf v1.4.0-rc.2/go.mod h1:LlEzMj4AhA7rCAGe4KMBDvJI+AwstrUpVNzEA03Pprs=\ngithub.com/golang/protobuf v1.4.0-rc.4.0.20200313231945-b860323f09d0/go.mod h1:WU3c8KckQ9AFe+yFwt9sWVRKCVIyN9cPHBJSNnbL67w=\ngithub.com/golang/protobuf v1.4.0/go.mod h1:jodUvKwWbYaEsadDk5Fwe5c77LiNKVO9IDvqG2KuDX0=\ngithub.com/golang/protobuf v1.4.2/go.mod h1:oDoupMAO8OvCJWAcko0GGGIgR6R6ocIYbsSw735rRwI=\ngithub.com/golang/protobuf v1.5.0/go.mod h1:FsONVRAS9T7sI+LIUmWTfcYkHO4aIWwzhcaSAoJOfIk=\ngithub.com/golang/protobuf v1.5.2 h1:ROPKBNFfQgOUMifHyP+KYbvpjbdoFNs+aK7DXlji0Tw=\ngithub.com/golang/protobuf v1.5.2/go.mod h1:XVQd3VNwM+JqD3oG2Ue2ip4fOMUkwXdXDdiuN0vRsmY=\ngithub.com/google/go-cmp v0.3.0/go.mod h1:8QqcDgzrUqlUb/G2PQTWiueGozuR1884gddMywk6iLU=\ngithub.com/google/go-cmp v0.3.1/go.mod h1:8QqcDgzrUqlUb/G2PQTWiueGozuR1884gddMywk6iLU=\ngithub.com/google/go-cmp v0.4.0/go.mod h1:v8dTdLbMG2kIc/vJvl+f65V22dbkXbowE6jgT/gNBxE=\ngithub.com/google/go-cmp v0.5.5 h1:Khx7svrCpmxxtHBq5j2mp/xVjsi8hQMfNLvJFAlrGgU=\ngithub.com/google/go-cmp v0.5.5/go.mod h1:v8dTdLbMG2kIc/vJvl+f65V22dbkXbowE6jgT/gNBxE=\ngithub.com/google/pprof v0.0.0-20210407192527-94a9f03dee38/go.mod h1:kpwsk12EmLew5upagYY7GY0pfYCcupk39gWOCRROcvE=\ngithub.com/hpcloud/tail v1.0.0/go.mod h1:ab1qPbhIpdTxEkNHXyeSf5vhxWSCs/tWer42PpOxQnU=\ngithub.com/ianlancetaylor/demangle v0.0.0-20200824232613-28f6c0f3b639/go.mod h1:aSSvb/t6k1mPoxDqO4vJh6VOCGPwU4O0C2/Eqndh1Sc=\ngithub.com/j-keck/arping v0.0.0-20160618110441-2cf9dc699c56/go.mod h1:ymszkNOg6tORTn+6F6j+Jc8TOr5osrynvN6ivFWZ2GA=\ngithub.com/mattn/go-shellwords v1.0.3/go.mod h1:3xCvwCdWdlDJUrvuMn7Wuy9eWs4pE8vqg+NOMyg4B2o=\ngithub.com/nxadm/tail v1.4.4/go.mod h1:kenIhsEOeOJmVchQTgglprH7qJGnHDVpk1VPCcaMI8A=\ngithub.com/nxadm/tail v1.4.8 h1:nPr65rt6Y5JFSKQO7qToXr7pePgD6Gwiw05lkbyAQTE=\ngithub.com/nxadm/tail v1.4.8/go.mod h1:+ncqLTQzXmGhMZNUePPaPqPvBxHAIsmXswZKocGu+AU=\ngithub.com/onsi/ginkgo v1.6.0/go.mod h1:lLunBs/Ym6LB5Z9jYTR76FiuTmxDTDusOGeTQH+WWjE=\ngithub.com/onsi/ginkgo v1.12.1/go.mod h1:zj2OWP4+oCPe1qIXoGWkgMRwljMUYCdkwsT2108oapk=\ngithub.com/onsi/ginkgo v1.16.4/go.mod h1:dX+/inL/fNMqNlz0e9LfyB9TswhZpCVdJM/Z6Vvnwo0=\ngithub.com/onsi/ginkgo v1.16.5 h1:8xi0RTUf59SOSfEtZMvwTvXYMzG4gV23XVHOZiXNtnE=\ngithub.com/onsi/ginkgo v1.16.5/go.mod h1:+E8gABHa3K6zRBolWtd+ROzc/U5bkGt0FwiG042wbpU=\ngithub.com/onsi/ginkgo/v2 v2.1.3 h1:e/3Cwtogj0HA+25nMP1jCMDIf8RtRYbGwGGuBIFztkc=\ngithub.com/onsi/ginkgo/v2 v2.1.3/go.mod h1:vw5CSIxN1JObi/U8gcbwft7ZxR2dgaR70JSE3/PpL4c=\ngithub.com/onsi/gomega v1.7.1/go.mod h1:XdKZgCCFLUoM/7CFJVPcG8C1xQ1AJ0vpAezJrB7JYyY=\ngithub.com/onsi/gomega v1.10.1/go.mod h1:iN09h71vgCQne3DLsj+A5owkum+a2tYe+TOCB1ybHNo=\ngithub.com/onsi/gomega v1.10.3/go.mod h1:V9xEwhxec5O8UDM77eCW8vLymOMltsqPVYWrpDsH8xc=\ngithub.com/onsi/gomega v1.17.0 h1:9Luw4uT5HTjHTN8+aNcSThgH1vdXnmdJ8xIfZ4wyTRE=\ngithub.com/onsi/gomega v1.17.0/go.mod h1:HnhC7FXeEQY45zxNK3PPoIUhzk/80Xly9PcubAlGdZY=\ngithub.com/pkg/errors v0.9.1 h1:FEBLx1zS214owpjy7qsBeixbURkuhQAwrK5UwLGTwt4=\ngithub.com/pkg/errors v0.9.1/go.mod h1:bwawxfHBFNV+L2hUp1rHADufV3IMtnDRdf1r5NINEl0=\ngithub.com/pmezard/go-difflib v1.0.0 h1:4DBwDE0NGyQoBHbLQYPwSUPoCMWR5BEzIk/f1lZbAQM=\ngithub.com/pmezard/go-difflib v1.0.0/go.mod h1:iKH77koFhYxTK1pcRnkKkqfTogsbg7gZNVY4sRDYZ/4=\ngithub.com/safchain/ethtool v0.0.0-20190326074333-42ed695e3de8/go.mod h1:Z0q5wiBQGYcxhMZ6gUqHn6pYNLypFAvaL3UvgZLR0U4=\ngithub.com/sirupsen/logrus v1.0.6/go.mod h1:pMByvHTf9Beacp5x1UXfOR9xyW/9antXMhjMPG0dEzc=\ngithub.com/sirupsen/logrus v1.9.2 h1:oxx1eChJGI6Uks2ZC4W1zpLlVgqB8ner4EuQwV4Ik1Y=\ngithub.com/sirupsen/logrus v1.9.2/go.mod h1:naHLuLoDiP4jHNo9R0sCBMtWGeIprob74mVsIT4qYEQ=\ngithub.com/stretchr/objx v0.1.0/go.mod h1:HFkY916IF+rwdDfMAkV7OtwuqBVzrE8GR6GFx+wExME=\ngithub.com/stretchr/testify v1.3.0/go.mod h1:M5WIy9Dh21IEIfnGCwXGc5bZfKNJtfHm1UVUgZn+9EI=\ngithub.com/stretchr/testify v1.5.1/go.mod h1:5W2xD1RspED5o8YsWQXVCued0rvSQ+mT+I5cxcmMvtA=\ngithub.com/stretchr/testify v1.7.0 h1:nwc3DEeHmmLAfoZucVR881uASk0Mfjw8xYJ99tb5CcY=\ngithub.com/stretchr/testify v1.7.0/go.mod h1:6Fq8oRcR53rry900zMqJjRRixrwX3KX962/h/Wwjteg=\ngithub.com/vishvananda/netlink v1.1.1-0.20201029203352-d40f9887b852/go.mod h1:twkDnbuQxJYemMlGd4JFIcuhgX83tXhKS2B/PRMpOho=\ngithub.com/vishvananda/netlink v1.1.1-0.20210916161339-2c39f3491956 h1:2tjYQpM+MZB25iPeE20lI/PrUNrbN66Bd+P27TkVaxU=\ngithub.com/vishvananda/netlink v1.1.1-0.20210916161339-2c39f3491956/go.mod h1:twkDnbuQxJYemMlGd4JFIcuhgX83tXhKS2B/PRMpOho=\ngithub.com/vishvananda/netns v0.0.0-20200728191858-db3c7e526aae h1:4hwBBUfQCFe3Cym0ZtKyq7L16eZUtYKs+BaHDN6mAns=\ngithub.com/vishvananda/netns v0.0.0-20200728191858-db3c7e526aae/go.mod h1:DD4vA1DwXk04H54A1oHXtwZmA0grkVMdPxx/VGLCah0=\ngithub.com/yuin/goldmark v1.2.1/go.mod h1:3hX8gzYuyVAZsxl0MRgGTJEmQBFcNTphYh9decYSb74=\ngolang.org/x/crypto v0.0.0-20190308221718-c2843e01d9a2/go.mod h1:djNgcEr1/C05ACkg1iLfiJU5Ep61QUkGW8qpdssI0+w=\ngolang.org/x/crypto v0.0.0-20191011191535-87dc89f01550/go.mod h1:yigFU9vqHzYiE8UmvKecakEJjdnWj3jj499lnFckfCI=\ngolang.org/x/crypto v0.0.0-20200622213623-75b288015ac9/go.mod h1:LzIPMQfyMNhhGPhUkYOs5KpL4U8rLKemX1yGLhDgUto=\ngolang.org/x/mod v0.3.0/go.mod h1:s0Qsj1ACt9ePp/hMypM3fl4fZqREWJwdYDEqhRiZZUA=\ngolang.org/x/net v0.0.0-20180906233101-161cd47e91fd/go.mod h1:mL1N/T3taQHkDXs73rZJwtUhF3w3ftmwwsq0BUmARs4=\ngolang.org/x/net v0.0.0-20190404232315-eb5bcb51f2a3/go.mod h1:t9HGtf8HONx5eT2rtn7q6eTqICYqUVnKs3thJo3Qplg=\ngolang.org/x/net v0.0.0-20190620200207-3b0461eec859/go.mod h1:z5CRVTTTmAJ677TzLLGU+0bjPO0LkuOLi4/5GtJWs/s=\ngolang.org/x/net v0.0.0-20200520004742-59133d7f0dd7/go.mod h1:qpuaurCH72eLCgpAm/N6yyVIVM9cpaDIP3A8BGJEC5A=\ngolang.org/x/net v0.0.0-20201006153459-a7d1128ccaa0/go.mod h1:sp8m0HH+o8qH0wwXwYZr8TS3Oi6o0r6Gce1SSxlDquU=\ngolang.org/x/net v0.0.0-20201021035429-f5854403a974/go.mod h1:sp8m0HH+o8qH0wwXwYZr8TS3Oi6o0r6Gce1SSxlDquU=\ngolang.org/x/net v0.0.0-20210428140749-89ef3d95e781 h1:DzZ89McO9/gWPsQXS/FVKAlG02ZjaQ6AlZRBimEYOd0=\ngolang.org/x/net v0.0.0-20210428140749-89ef3d95e781/go.mod h1:OJAsFXCWl8Ukc7SiCT/9KSuxbyM7479/AVlXFRxuMCk=\ngolang.org/x/sync v0.0.0-20180314180146-1d60e4601c6f/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM=\ngolang.org/x/sync v0.0.0-20190423024810-112230192c58/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM=\ngolang.org/x/sync v0.0.0-20201020160332-67f06af15bc9/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM=\ngolang.org/x/sys v0.0.0-20180909124046-d0be0721c37e/go.mod h1:STP8DvDyc/dI5b8T5hshtkjS+E42TnysNCUPdjciGhY=\ngolang.org/x/sys v0.0.0-20190215142949-d0b11bdaac8a/go.mod h1:STP8DvDyc/dI5b8T5hshtkjS+E42TnysNCUPdjciGhY=\ngolang.org/x/sys v0.0.0-20190412213103-97732733099d/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20190904154756-749cb33beabd/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20191005200804-aed5e4c7ecf9/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20191120155948-bd437916bb0e/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20191204072324-ce4227a45e2e/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20200217220822-9197077df867/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20200323222414-85ca7c5b95cd/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20200728102440-3e129f6d46b1/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20200930185726-fdedc70b468f/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20201117170446-d9b008d0a637/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20201119102817-f84b799fce68/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20210112080510-489259a85091/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20210423082822-04245dca01da/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20220715151400-c0bba94af5f8 h1:0A+M6Uqn+Eje4kHMK80dtF3JCXC4ykBgQG4Fe06QRhQ=\ngolang.org/x/sys v0.0.0-20220715151400-c0bba94af5f8/go.mod h1:oPkhp1MJrh7nUepCBck5+mAzfO9JrbApNNgaTdGDITg=\ngolang.org/x/term v0.0.0-20201126162022-7de9c90e9dd1/go.mod h1:bj7SfCRtBDWHUb9snDiAeCFNEtKQo2Wmx5Cou7ajbmo=\ngolang.org/x/text v0.3.0/go.mod h1:NqM8EUOU14njkJ3fqMW+pc6Ldnwhi/IjpwHt7yyuwOQ=\ngolang.org/x/text v0.3.3/go.mod h1:5Zoc/QRtKVWzQhOtBMvqHzDpF6irO9z98xDceosuGiQ=\ngolang.org/x/text v0.3.6 h1:aRYxNxv6iGQlyVaZmk6ZgYEDa+Jg18DxebPSrd6bg1M=\ngolang.org/x/text v0.3.6/go.mod h1:5Zoc/QRtKVWzQhOtBMvqHzDpF6irO9z98xDceosuGiQ=\ngolang.org/x/tools v0.0.0-20180917221912-90fa682c2a6e/go.mod h1:n7NCudcB/nEzxVGmLbDWY5pfWTLqBcC2KZ6jyYvM4mQ=\ngolang.org/x/tools v0.0.0-20191119224855-298f0cb1881e/go.mod h1:b+2E5dAYhXwXZwtnZ6UAqBI28+e2cm9otk0dWdXHAEo=\ngolang.org/x/tools v0.0.0-20201224043029-2b0845dc783e/go.mod h1:emZCQorbCU4vsT4fOWvOPXz4eW1wZW4PmDk9uLelYpA=\ngolang.org/x/xerrors v0.0.0-20190717185122-a985d3407aa7/go.mod h1:I/5z698sn9Ka8TeJc9MKroUUfqBBauWjQqLJ2OPfmY0=\ngolang.org/x/xerrors v0.0.0-20191011141410-1b5146add898/go.mod h1:I/5z698sn9Ka8TeJc9MKroUUfqBBauWjQqLJ2OPfmY0=\ngolang.org/x/xerrors v0.0.0-20191204190536-9bdfabe68543/go.mod h1:I/5z698sn9Ka8TeJc9MKroUUfqBBauWjQqLJ2OPfmY0=\ngolang.org/x/xerrors v0.0.0-20200804184101-5ec99f83aff1 h1:go1bK/D/BFZV2I8cIQd1NKEZ+0owSTG1fDTci4IqFcE=\ngolang.org/x/xerrors v0.0.0-20200804184101-5ec99f83aff1/go.mod h1:I/5z698sn9Ka8TeJc9MKroUUfqBBauWjQqLJ2OPfmY0=\ngoogle.golang.org/protobuf v0.0.0-20200109180630-ec00e32a8dfd/go.mod h1:DFci5gLYBciE7Vtevhsrf46CRTquxDuWsQurQQe4oz8=\ngoogle.golang.org/protobuf v0.0.0-20200221191635-4d8936d0db64/go.mod h1:kwYJMbMJ01Woi6D6+Kah6886xMZcty6N08ah7+eCXa0=\ngoogle.golang.org/protobuf v0.0.0-20200228230310-ab0ca4ff8a60/go.mod h1:cfTl7dwQJ+fmap5saPgwCLgHXTUD7jkjRqWcaiX5VyM=\ngoogle.golang.org/protobuf v1.20.1-0.20200309200217-e05f789c0967/go.mod h1:A+miEFZTKqfCUM6K7xSMQL9OKL/b6hQv+e19PK+JZNE=\ngoogle.golang.org/protobuf v1.21.0/go.mod h1:47Nbq4nVaFHyn7ilMalzfO3qCViNmqZ2kzikPIcrTAo=\ngoogle.golang.org/protobuf v1.23.0/go.mod h1:EGpADcykh3NcUnDUJcl1+ZksZNG86OlYog2l/sGQquU=\ngoogle.golang.org/protobuf v1.26.0-rc.1/go.mod h1:jlhhOSvTdKEhbULTjvd4ARK9grFBp09yW+WbY/TyQbw=\ngoogle.golang.org/protobuf v1.26.0 h1:bxAC2xTBsZGibn2RTntX0oH50xLsqy1OxA9tTL3p/lk=\ngoogle.golang.org/protobuf v1.26.0/go.mod h1:9q0QmTI4eRPtz6boOQmLYwt+qCgq0jsYwAQnmE0givc=\ngopkg.in/airbrake/gobrake.v2 v2.0.9/go.mod h1:/h5ZAUhDkGaJfjzjKLSjv6zCL6O0LLBxU4K+aSYdM/U=\ngopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405 h1:yhCVgyC4o1eVCa2tZl7eS0r+SDo693bJlVdllGtEeKM=\ngopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=\ngopkg.in/fsnotify.v1 v1.4.7/go.mod h1:Tz8NjZHkW78fSQdbUxIjBTcgA1z1m8ZHf0WmKUhAMys=\ngopkg.in/gemnasium/logrus-airbrake-hook.v2 v2.1.2/go.mod h1:Xk6kEKp8OKb+X14hQBKWaSkCsqBpgog8nAV2xsGOxlo=\ngopkg.in/tomb.v1 v1.0.0-20141024135613-dd632973f1e7 h1:uRGJdciOHaEIrze2W8Q3AKkepLTh2hOroT7a+7czfdQ=\ngopkg.in/tomb.v1 v1.0.0-20141024135613-dd632973f1e7/go.mod h1:dt/ZhP58zS4L8KSrWDmTeBkI65Dw0HsyUHuEVlX15mw=\ngopkg.in/yaml.v2 v2.2.2/go.mod h1:hI93XBmqTisBFMUTm0b8Fm+jr3Dg1NNxqwp+5A1VGuI=\ngopkg.in/yaml.v2 v2.2.4/go.mod h1:hI93XBmqTisBFMUTm0b8Fm+jr3Dg1NNxqwp+5A1VGuI=\ngopkg.in/yaml.v2 v2.3.0/go.mod h1:hI93XBmqTisBFMUTm0b8Fm+jr3Dg1NNxqwp+5A1VGuI=\ngopkg.in/yaml.v2 v2.4.0 h1:D8xgwECY7CYvx+Y2n4sBz93Jn9JRvxdiyyo8CTfuKaY=\ngopkg.in/yaml.v2 v2.4.0/go.mod h1:RDklbk79AGWmwhnvt/jBztapEOGDOx6ZbXqjP6csGnQ=\ngopkg.in/yaml.v3 v3.0.0-20200313102051-9f266ea9e77c h1:dUUwHk2QECo/6vqA44rthZ8ie2QXMNeKRTHCNY2nXvo=\ngopkg.in/yaml.v3 v3.0.0-20200313102051-9f266ea9e77c/go.mod h1:K4uyk7z7BCEPqu6E+C64Yfv1cQ7kz7rIZviUmN+EgEM=\n" }, { "path": "hack/get_ci_vm.sh", "content": "#!/usr/bin/env bash\n\n#\n# For help and usage information, simply execute the script w/o any arguments.\n#\n# This script is intended to be run by Red Hat dnsname developers who need\n# to debug problems specifically related to Cirrus-CI automated testing.\n# It requires that you have been granted prior access to create VMs in\n# google-cloud. For non-Red Hat contributors, VMs are available as-needed,\n# with supervision upon request.\n\nset -e\n\nSCRIPT_FILEPATH=$(realpath \"${BASH_SOURCE[0]}\")\nSCRIPT_DIRPATH=$(dirname \"$SCRIPT_FILEPATH\")\nREPO_DIRPATH=$(realpath \"$SCRIPT_DIRPATH/../\")\n\n# Help detect if we were called by get_ci_vm container\nGET_CI_VM=\"${GET_CI_VM:-0}\"\nin_get_ci_vm() {\n if ((GET_CI_VM==0)); then\n echo \"Error: $1 is not intended for use in this context\"\n exit 2\n fi\n}\n\n# get_ci_vm APIv1 container entrypoint calls into this script\n# to obtain required repo. specific configuration options.\nif [[ \"$1\" == \"--config\" ]]; then\n in_get_ci_vm \"$1\"\n cat < /dev/stderr\n echo 'PATH=$PATH:$GOPATH/bin' > /etc/ci_environment\nelse\n # Create and access VM for specified Cirrus-CI task\n mkdir -p $HOME/.config/gcloud/ssh\n podman run -it --rm \\\n --tz=local \\\n -e NAME=\"$USER\" \\\n -e SRCDIR=/src \\\n -e GCLOUD_ZONE=\"$GCLOUD_ZONE\" \\\n -e DEBUG=\"${DEBUG:-0}\" \\\n -v $REPO_DIRPATH:/src:O \\\n -v $HOME/.config/gcloud:/root/.config/gcloud:z \\\n -v $HOME/.config/gcloud/ssh:/root/.ssh:z \\\n quay.io/libpod/get_ci_vm:latest \"$@\"\nfi\n" }, { "path": "hack/tree_status.sh", "content": "#!/bin/bash\nset -e\n\nSUGGESTION=\"${SUGGESTION:-sync the vendor.conf and commit all changes.}\"\n\nSTATUS=$(git status --porcelain)\nif [[ -z $STATUS ]]\nthen\n\techo \"tree is clean\"\nelse\n\techo \"tree is dirty, please $SUGGESTION\"\n\techo \"\"\n\techo \"$STATUS\"\n\texit 1\nfi\n" }, { "path": "plugins/meta/dnsname/config.go", "content": "package main\n\nimport (\n\t\"errors\"\n\t\"os\"\n\t\"path/filepath\"\n\n\t\"github.com/containernetworking/cni/pkg/types\"\n)\n\nconst (\n\t// confFileName is the name of the dns masq conf file\n\tconfFileName = \"dnsmasq.conf\"\n\t// hostsFileName is the name of the addnhosts file\n\thostsFileName = \"addnhosts\"\n\t// pidFileName is the file where the dnsmasq file is stored\n\tpidFileName = \"pidfile\"\n)\n\nconst dnsMasqTemplate = `## WARNING: THIS IS AN AUTOGENERATED FILE\n## AND SHOULD NOT BE EDITED MANUALLY AS IT\n## LIKELY TO AUTOMATICALLY BE REPLACED.\nstrict-order\nlocal=/{{.Domain}}/\ndomain={{.Domain}}\nexpand-hosts\npid-file={{.PidFile}}\nexcept-interface=lo\nbind-dynamic\nno-hosts\ninterface={{.NetworkInterface}}\naddn-hosts={{.AddOnHostsFile}}`\n\nvar (\n\t// ErrBinaryNotFound means that the dnsmasq binary was not found\n\tErrBinaryNotFound = errors.New(\"unable to locate dnsmasq in path\")\n\t// ErrNoIPAddressFound means that CNI was unable to resolve an IP address in the CNI configuration\n\tErrNoIPAddressFound = errors.New(\"no ip address was found in the network\")\n)\n\n// DNSNameConf represents the cni config with the domain name attribute\ntype DNSNameConf struct {\n\ttypes.NetConf\n\tDomainName string `json:\"domainName\"`\n\tRuntimeConfig struct { // The capability arg\n\t\tAliases map[string][]string `json:\"aliases\"`\n\t} `json:\"runtimeConfig,omitempty\"`\n}\n\n// dnsNameFile describes the plugin's attributes\ntype dnsNameFile struct {\n\tAddOnHostsFile string\n\tBinary string\n\tConfigFile string\n\tDomain string\n\tNetworkInterface string\n\tPidFile string\n}\n\n// dnsNameConfPath tells where we store the conf, pid, and hosts files\nfunc dnsNameConfPath() string {\n\txdgRuntimeDir := os.Getenv(\"XDG_RUNTIME_DIR\")\n\tif xdgRuntimeDir != \"\" {\n\t\treturn filepath.Join(xdgRuntimeDir, \"containers/cni/dnsname\")\n\t}\n\treturn \"/run/containers/cni/dnsname\"\n}\n" }, { "path": "plugins/meta/dnsname/dnsname_suite_test.go", "content": "// Copyright 2019 dnsname authors\n// Copyright 2017 CNI authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage main\n\nimport (\n\t. \"github.com/onsi/ginkgo\"\n\t. \"github.com/onsi/gomega\"\n\n\t\"testing\"\n)\n\nfunc TestTuning(t *testing.T) {\n\tRegisterFailHandler(Fail)\n\tRunSpecs(t, \"plugins/meta/dnsname\")\n}\n" }, { "path": "plugins/meta/dnsname/dnsname_test.go", "content": "package main\n\nimport (\n\t\"io/ioutil\"\n\t\"os\"\n\t\"path/filepath\"\n\t\"reflect\"\n\t\"syscall\"\n\t\"time\"\n\n\t\"github.com/containernetworking/cni/pkg/skel\"\n\tcurrent \"github.com/containernetworking/cni/pkg/types/100\"\n\t\"github.com/containernetworking/plugins/pkg/ns\"\n\t\"github.com/containernetworking/plugins/pkg/testutils\"\n\t. \"github.com/onsi/ginkgo\"\n\t. \"github.com/onsi/gomega\"\n\t\"github.com/vishvananda/netlink\"\n)\n\nfunc cleanup(d dnsNameFile) error {\n\t_ = d.stop()\n\treturn os.RemoveAll(filepath.Dir(d.PidFile))\n}\n\nvar _ = Describe(\"dnsname tests\", func() {\n\tvar originalNS, targetNS ns.NetNS\n\tconst IFNAME string = \"dummy0\"\n\n\tfullConf := []byte(`{\n \"cniVersion\": \"0.4.0\",\n \"name\": \"test\",\n \"type\": \"dnsname\",\n \"domainName\": \"foobar.io\",\n \"prevResult\": {\n \"cniVersion\": \"0.4.0\",\n \"interfaces\": [\n {\n \"name\": \"dummy0\",\n \"mac\": \"a6:a7:ca:6b:34:2e\"\n },\n {\n \"name\": \"vetha0a83b38\",\n \"mac\": \"9a:45:bd:b0:2d:dd\"\n },\n {\n \"name\": \"eth0\",\n \"mac\": \"ea:63:0e:63:3e:86\",\n \"sandbox\": \"/var/run/netns/baude\"\n }\n ],\n \"ips\": [\n {\n \"version\": \"4\",\n \"interface\": 2,\n \"address\": \"10.88.8.5/24\",\n \"gateway\": \"10.88.8.1\"\n }\n ],\n \"routes\": [\n {\n \"dst\": \"0.0.0.0/0\"\n }\n ]\n}\n\t}`)\n\n\tBeforeEach(func() {\n\t\t// Create a new NetNS so we don't modify the host\n\t\tvar err error\n\t\toriginalNS, err = testutils.NewNS()\n\t\tExpect(err).NotTo(HaveOccurred())\n\n\t\terr = originalNS.Do(func(ns.NetNS) error {\n\t\t\tdefer GinkgoRecover()\n\n\t\t\terr = netlink.LinkAdd(&netlink.Dummy{\n\t\t\t\tLinkAttrs: netlink.LinkAttrs{\n\t\t\t\t\tName: IFNAME,\n\t\t\t\t},\n\t\t\t})\n\t\t\tExpect(err).NotTo(HaveOccurred())\n\t\t\t_, err = netlink.LinkByName(IFNAME)\n\t\t\tExpect(err).NotTo(HaveOccurred())\n\t\t\treturn nil\n\t\t})\n\t\tExpect(err).NotTo(HaveOccurred())\n\n\t\ttargetNS, err = testutils.NewNS()\n\t\tExpect(err).NotTo(HaveOccurred())\n\t})\n\n\tAfterEach(func() {\n\t\tExpect(originalNS.Close()).To(Succeed())\n\t\tExpect(targetNS.Close()).To(Succeed())\n\t})\n\n\tIt(\"dnsname add\", func() {\n\t\targs := &skel.CmdArgs{\n\t\t\tContainerID: \"dummy\",\n\t\t\tNetns: targetNS.Path(),\n\t\t\tIfName: IFNAME,\n\t\t\tStdinData: fullConf,\n\t\t}\n\n\t\terr := originalNS.Do(func(ns.NetNS) error {\n\t\t\tdefer GinkgoRecover()\n\n\t\t\tr, _, err := testutils.CmdAdd(targetNS.Path(), args.ContainerID, IFNAME, fullConf, func() error {\n\t\t\t\treturn cmdAdd(args)\n\t\t\t})\n\t\t\tExpect(err).NotTo(HaveOccurred())\n\n\t\t\tresult, err := current.GetResult(r)\n\t\t\tExpect(err).NotTo(HaveOccurred())\n\n\t\t\t// check that the dns search domain is set correctly\n\t\t\tExpect(result.DNS.Search).To(Equal([]string{\"foobar.io\"}))\n\n\t\t\t// Check that all configuration files are created\n\t\t\tfiles, err := ioutil.ReadDir(\"/run/containers/cni/dnsname/test\")\n\t\t\tExpect(err).To(BeNil())\n\t\t\texpectedFileNames := []string{\"addnhosts\", \"dnsmasq.conf\", \"lock\", \"pidfile\"}\n\t\t\tvar resultingFileNames []string\n\t\t\tfor _, f := range files {\n\t\t\t\tresultingFileNames = append(resultingFileNames, f.Name())\n\t\t\t}\n\t\t\tExpect(reflect.DeepEqual(expectedFileNames, resultingFileNames)).To(BeTrue())\n\n\t\t\td, err := newDNSMasqFile(\"foobar.io\", \"dummy0\", \"test\")\n\t\t\tExpect(err).To(BeNil())\n\n\t\t\t// Check that the dns masq instance is running\n\t\t\tpid, err := d.getProcess()\n\t\t\tExpect(err).To(BeNil())\n\t\t\t// Send it a signal 0; if alive, error will be nil\n\t\t\terr = pid.Signal(syscall.Signal(0))\n\t\t\tExpect(err).To(BeNil())\n\n\t\t\t// Stop the dnsmasq instance and clean up files in the filesystem\n\t\t\tExpect(cleanup(d)).To(BeNil())\n\t\t\treturn nil\n\t\t})\n\t\tExpect(err).NotTo(HaveOccurred())\n\t})\n\n\tIt(\"dnsname del\", func() {\n\t\tvar (\n\t\t\tdnsDead bool\n\t\t\tcounter int\n\t\t)\n\t\targs := &skel.CmdArgs{\n\t\t\tContainerID: \"dummy\",\n\t\t\tNetns: targetNS.Path(),\n\t\t\tIfName: IFNAME,\n\t\t\tStdinData: fullConf,\n\t\t}\n\n\t\terr := originalNS.Do(func(ns.NetNS) error {\n\t\t\tdefer GinkgoRecover()\n\n\t\t\tr, _, err := testutils.CmdAdd(targetNS.Path(), args.ContainerID, IFNAME, fullConf, func() error {\n\t\t\t\treturn cmdAdd(args)\n\t\t\t})\n\t\t\tExpect(err).NotTo(HaveOccurred())\n\n\t\t\t_, err = current.GetResult(r)\n\t\t\tExpect(err).NotTo(HaveOccurred())\n\n\t\t\td, err := newDNSMasqFile(\"foobar.io\", \"dummy0\", \"test\")\n\t\t\tExpect(err).To(BeNil())\n\n\t\t\tpid, err := d.getProcess()\n\t\t\tExpect(err).To(BeNil())\n\t\t\terr = pid.Signal(syscall.Signal(0))\n\t\t\tExpect(err).To(BeNil())\n\n\t\t\terr = testutils.CmdDel(targetNS.Path(), args.ContainerID, IFNAME, func() error {\n\t\t\t\treturn cmdDel(args)\n\t\t\t})\n\t\t\tExpect(err).To(BeNil())\n\n\t\t\t// Ensure the dnsmasq instance has been stopped on del\n\t\t\t// It sometimes takes time for the dnsmasq pid to be killed\n\t\t\t// check every .5 second for maximum of 10 tries\n\t\t\tfor {\n\t\t\t\terr = pid.Signal(syscall.Signal(0))\n\t\t\t\tif err != nil {\n\t\t\t\t\tdnsDead = true\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t\tif counter == 10 {\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t\tcounter++\n\t\t\t\ttime.Sleep(500 * time.Millisecond)\n\t\t\t}\n\n\t\t\tExpect(dnsDead).To(BeTrue())\n\n\t\t\t// defer cleanup is case it does not work automatically\n\t\t\tdefer func() {\n\t\t\t\t_ = cleanup(d)\n\t\t\t}()\n\n\t\t\t// Check that the configuration directory is deleted\n\t\t\t_, err = ioutil.ReadDir(\"/run/containers/cni/dnsname/test\")\n\t\t\tExpect(os.IsNotExist(err)).To(BeTrue())\n\t\t\treturn nil\n\t\t})\n\t\tExpect(err).NotTo(HaveOccurred())\n\t})\n})\n" }, { "path": "plugins/meta/dnsname/files.go", "content": "package main\n\nimport (\n\t\"bufio\"\n\t\"bytes\"\n\t\"fmt\"\n\t\"io/ioutil\"\n\t\"net\"\n\t\"os\"\n\t\"strings\"\n\t\"text/template\"\n\n\t\"github.com/containernetworking/plugins/plugins/ipam/host-local/backend/disk\"\n\t\"github.com/coreos/go-iptables/iptables\"\n\t\"github.com/sirupsen/logrus\"\n)\n\n// dnsNameLock embeds the CNI disk lock so we can hang methods from it\ntype dnsNameLock struct {\n\tlock *disk.FileLock\n}\n\n// release unlocks and closes the disk lock.\nfunc (m *dnsNameLock) release() error {\n\tif err := m.lock.Unlock(); err != nil {\n\t\treturn err\n\t}\n\treturn m.lock.Close()\n}\n\n// acquire locks the disk lock.\nfunc (m *dnsNameLock) acquire() error {\n\treturn m.lock.Lock()\n}\n\n// getLock returns a dnsNameLock synchronizing the configuration directory for\n// the domain.\nfunc getLock(path string) (*dnsNameLock, error) {\n\tl, err := disk.NewFileLock(path)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn &dnsNameLock{l}, nil\n}\n\n// checkFromDNSMasqConfFile ensures that the dnsmasq conf file for\n// the network interface exists or it creates it\nfunc checkForDNSMasqConfFile(conf dnsNameFile) error {\n\tif _, err := os.Stat(conf.ConfigFile); err == nil {\n\t\t// the file already exists, we can proceed\n\t\treturn err\n\t}\n\tnewConfig, err := generateDNSMasqConfig(conf)\n\tif err != nil {\n\t\treturn err\n\t}\n\tip, err := iptables.New()\n\tif err != nil {\n\t\treturn err\n\t}\n\targs := []string{\"-i\", conf.NetworkInterface, \"-p\", \"udp\", \"-m\", \"udp\", \"--dport\", \"53\", \"-j\", \"ACCEPT\"}\n\texists, err := ip.Exists(\"filter\", \"INPUT\", args...)\n\tif err != nil {\n\t\treturn err\n\t}\n\tif !exists {\n\t\tif err := ip.Insert(\"filter\", \"INPUT\", 1, args...); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\t// Generate the template and compile it.\n\treturn ioutil.WriteFile(conf.ConfigFile, newConfig, 0700)\n}\n\n// generateDNSMasqConfig fills out the configuration file template for the dnsmasq service\nfunc generateDNSMasqConfig(config dnsNameFile) ([]byte, error) {\n\tvar buf bytes.Buffer\n\ttempl, err := template.New(\"dnsmasq-conf-file\").Parse(dnsMasqTemplate)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tif err := templ.Execute(&buf, config); err != nil {\n\t\treturn nil, err\n\t}\n\tbuf.WriteByte('\\n')\n\treturn buf.Bytes(), nil\n}\n\n// appendToFile appends a new entry to the dnsmasqs hosts file\nfunc appendToFile(path, podname string, aliases []string, ips []*net.IPNet) error {\n\tf, err := openFile(path)\n\tif err != nil {\n\t\treturn err\n\t}\n\tdefer func() {\n\t\tif err := f.Close(); err != nil {\n\t\t\tlogrus.Errorf(\"failed to close file %q: %v\", path, err)\n\t\t}\n\t}()\n\tfor _, ip := range ips {\n\t\tentry := fmt.Sprintf(\"%s\\t%s\", ip.IP.String(), podname)\n\t\tfor _, alias := range aliases {\n\t\t\tentry += fmt.Sprintf(\"\\t%s\", alias)\n\t\t}\n\t\tentry += \"\\n\"\n\t\tif _, err = f.WriteString(entry); err != nil {\n\t\t\treturn err\n\t\t}\n\t\tlogrus.Debugf(\"appended %s: %s\", path, entry)\n\t}\n\treturn nil\n}\n\n// removeLineFromFile removes a given entry from the dnsmasq host file\nfunc removeFromFile(path, podname string) (bool, error) {\n\tvar (\n\t\tkeepers []string\n\t\tfound bool\n\t)\n\tshouldHUP := false\n\tbackup := fmt.Sprintf(\"%s.old\", path)\n\tif err := os.Rename(path, backup); err != nil {\n\t\treturn shouldHUP, err\n\t}\n\tf, err := os.Open(backup)\n\tif err != nil {\n\t\t//\tif the open fails here, we need to revert things\n\t\trenameFile(backup, path)\n\t\treturn shouldHUP, err\n\t}\n\tdefer func() {\n\t\tif err := f.Close(); err != nil {\n\t\t\tlogrus.Errorf(\"unable to close %q: %v\", backup, err)\n\t\t}\n\t}()\n\n\toldFile := bufio.NewScanner(f)\n\t// Iterate the old file\n\tfor oldFile.Scan() {\n\t\tfields := strings.Fields(oldFile.Text())\n\t\t// if the IP of the entry and the given IP dont match, it should\n\t\t// go into the new file\n\t\tif len(fields) > 1 && fields[1] != podname {\n\t\t\tkeepers = append(keepers, fmt.Sprintf(\"%s\\n\", oldFile.Text()))\n\t\t\tcontinue\n\t\t}\n\t\tfound = true\n\t}\n\tif !found {\n\t\t// We never found a matching record; non-fatal\n\t\tlogrus.Debugf(\"a record for %s was never found in %s\", podname, path)\n\t}\n\tfileLength, err := writeFile(path, keepers)\n\tif err != nil {\n\t\trenameFile(backup, path)\n\t\treturn shouldHUP, err\n\t}\n\tif fileLength > 0 {\n\t\tshouldHUP = true\n\t}\n\tif err := os.Remove(backup); err != nil {\n\t\tlogrus.Errorf(\"unable to delete '%s': %q\", backup, err)\n\t}\n\treturn shouldHUP, nil\n}\n\n// renameFile renames a file to backup\nfunc renameFile(oldpath, newpath string) {\n\tif renameError := os.Rename(oldpath, newpath); renameError != nil {\n\t\tlogrus.Errorf(\"unable to restore %q to %q: %v\", oldpath, newpath, renameError)\n\t}\n}\n\n// writeFile writes a []string to the given path and returns the number\n// of lines in the file\nfunc writeFile(path string, content []string) (int, error) {\n\tvar counter int\n\tf, err := openFile(path)\n\tif err != nil {\n\t\treturn 0, err\n\t}\n\tdefer func() {\n\t\tif err := f.Close(); err != nil {\n\t\t\tlogrus.Errorf(\"unable to close %q: %v\", path, err)\n\t\t}\n\t}()\n\n\tfor _, line := range content {\n\t\tif _, err := f.WriteString(line); err != nil {\n\t\t\treturn 0, err\n\t\t}\n\t\tcounter++\n\t}\n\treturn counter, nil\n}\n\n// openFile opens a file for reading\nfunc openFile(path string) (*os.File, error) {\n\treturn os.OpenFile(path, os.O_APPEND|os.O_CREATE|os.O_WRONLY, 0644)\n}\n" }, { "path": "plugins/meta/dnsname/files_test.go", "content": "package main\n\nimport (\n\t\"reflect\"\n\t\"testing\"\n)\n\nfunc Test_generateDNSMasqConfig(t *testing.T) {\n\ttestResult := `## WARNING: THIS IS AN AUTOGENERATED FILE\n## AND SHOULD NOT BE EDITED MANUALLY AS IT\n## LIKELY TO AUTOMATICALLY BE REPLACED.\nstrict-order\nlocal=/foobar.org/\ndomain=foobar.org\nexpand-hosts\npid-file=/run/containers/cni/dnsname/cni0/pidfile\nexcept-interface=lo\nbind-dynamic\nno-hosts\ninterface=cni0\naddn-hosts=/run/containers/cni/dnsname/cni0/addnhosts\n`\n\n\ttestConfig := dnsNameFile{\n\t\tAddOnHostsFile: makePath(\"cni0\", hostsFileName),\n\t\tBinary: \"/usr/bin/foo\",\n\t\tConfigFile: makePath(\"cni0\", confFileName),\n\t\tDomain: \"foobar.org\",\n\t\tNetworkInterface: \"cni0\",\n\t\tPidFile: makePath(\"cni0\", pidFileName),\n\t}\n\ttype args struct {\n\t\tconfig dnsNameFile\n\t}\n\ttests := []struct {\n\t\tname string\n\t\targs args\n\t\twant []byte\n\t\twantErr bool\n\t}{\n\t\t{\"pass\", args{testConfig}, []byte(testResult), false},\n\t}\n\tfor _, tt := range tests {\n\t\tt.Run(tt.name, func(t *testing.T) {\n\t\t\tgot, err := generateDNSMasqConfig(tt.args.config)\n\t\t\tif (err != nil) != tt.wantErr {\n\t\t\t\tt.Errorf(\"generateDNSMasqConfig() error = %v, wantErr %v\", err, tt.wantErr)\n\t\t\t\treturn\n\t\t\t}\n\t\t\tif !reflect.DeepEqual(got, tt.want) {\n\t\t\t\tt.Errorf(\"generateDNSMasqConfig() got = '%v', want '%v'\", string(got), string(tt.want))\n\t\t\t}\n\t\t})\n\t}\n}\n" }, { "path": "plugins/meta/dnsname/main.go", "content": "// Copyright 2019 dnsname authors\n// Copyright 2017 CNI authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\n// This is a post-setup plugin that establishes port forwarding - using iptables,\n// from the host's network interface(s) to a pod's network interface.\n//\n// It is intended to be used as a chained CNI plugin, and determines the container\n// IP from the previous result. If the result includes an IPv6 address, it will\n// also be configured. (IPTables will not forward cross-family).\n//\n// This has one notable limitation: it does not perform any kind of reservation\n// of the actual host port. If there is a service on the host, it will have all\n// its traffic captured by the container. If another container also claims a given\n// port, it will capture the traffic - it is last-write-wins.\npackage main\n\nimport (\n\t\"encoding/json\"\n\t\"io/ioutil\"\n\t\"os\"\n\t\"os/exec\"\n\t\"path/filepath\"\n\n\t\"github.com/containernetworking/cni/pkg/skel\"\n\t\"github.com/containernetworking/cni/pkg/types\"\n\tcurrent \"github.com/containernetworking/cni/pkg/types/100\"\n\t\"github.com/containernetworking/cni/pkg/version\"\n\t\"github.com/pkg/errors\"\n\t\"github.com/sirupsen/logrus\"\n)\n\nfunc cmdAdd(args *skel.CmdArgs) error {\n\tif err := findDNSMasq(); err != nil {\n\t\treturn ErrBinaryNotFound\n\t}\n\tnetConf, result, podname, err := parseConfig(args.StdinData, args.Args)\n\tif err != nil {\n\t\treturn errors.Wrap(err, \"failed to parse config\")\n\t}\n\tif netConf.PrevResult == nil {\n\t\treturn errors.Errorf(\"must be called as chained plugin\")\n\t}\n\tips, err := getIPs(result)\n\tif err != nil {\n\t\treturn err\n\t}\n\tdnsNameConf, err := newDNSMasqFile(netConf.DomainName, result.Interfaces[0].Name, netConf.Name)\n\tif err != nil {\n\t\treturn err\n\t}\n\tdomainBaseDir := filepath.Dir(dnsNameConf.PidFile)\n\t// Check if the configuration file directory exists, else make it\n\tif _, err := os.Stat(domainBaseDir); os.IsNotExist(err) {\n\t\tif makeDirErr := os.MkdirAll(domainBaseDir, 0700); makeDirErr != nil {\n\t\t\treturn makeDirErr\n\t\t}\n\t}\n\t// we use the configuration directory for our locking mechanism but read/write and hup\n\tlock, err := getLock(domainBaseDir)\n\tif err != nil {\n\t\treturn err\n\t}\n\tif err := lock.acquire(); err != nil {\n\t\treturn err\n\t}\n\tdefer func() {\n\t\tif err := lock.release(); err != nil {\n\t\t\tlogrus.Errorf(\"unable to release lock for %q: %v\", dnsNameConf.AddOnHostsFile, err)\n\t\t}\n\t}()\n\tif err := checkForDNSMasqConfFile(dnsNameConf); err != nil {\n\t\treturn err\n\t}\n\taliases := netConf.RuntimeConfig.Aliases[netConf.Name]\n\tif err := appendToFile(dnsNameConf.AddOnHostsFile, podname, aliases, ips); err != nil {\n\t\treturn err\n\t}\n\t// Now we need to HUP\n\tif err := dnsNameConf.hup(); err != nil {\n\t\treturn err\n\t}\n\tnameservers, err := getInterfaceAddresses(dnsNameConf)\n\tif err != nil {\n\t\treturn err\n\t}\n\t// keep anything that was passed in already\n\tnameservers = append(nameservers, result.DNS.Nameservers...)\n\tresult.DNS.Nameservers = nameservers\n\t// add dns search domain\n\tresult.DNS.Search = append(result.DNS.Search, netConf.DomainName)\n\t// Pass through the previous result\n\treturn types.PrintResult(result, netConf.CNIVersion)\n}\n\n// Do not return an error, otherwise cni will stop\n// and not invoke the following plugins del command.\nfunc cmdDel(args *skel.CmdArgs) error {\n\tif err := findDNSMasq(); err != nil {\n\t\tlogrus.Error(ErrBinaryNotFound)\n\t\treturn nil\n\t}\n\tnetConf, result, podname, err := parseConfig(args.StdinData, args.Args)\n\tif err != nil {\n\t\tlogrus.Error(errors.Wrap(err, \"failed to parse config\"))\n\t\treturn nil\n\t} else if result == nil {\n\t\treturn nil\n\t}\n\tdnsNameConf, err := newDNSMasqFile(netConf.DomainName, result.Interfaces[0].Name, netConf.Name)\n\tif err != nil {\n\t\tlogrus.Error(err)\n\t\treturn nil\n\t}\n\tdomainBaseDir := filepath.Dir(dnsNameConf.PidFile)\n\tlock, err := getLock(domainBaseDir)\n\tif err != nil {\n\t\tlogrus.Error(err)\n\t\treturn nil\n\t}\n\tif err := lock.acquire(); err != nil {\n\t\tlogrus.Error(err)\n\t\treturn nil\n\t}\n\tdefer func() {\n\t\t// if the lock isn't given up by another process\n\t\tif err := lock.release(); err != nil {\n\t\t\tlogrus.Errorf(\"unable to release lock for %q: %v\", domainBaseDir, err)\n\t\t}\n\t}()\n\tshouldHUP, err := removeFromFile(filepath.Join(domainBaseDir, hostsFileName), podname)\n\tif err != nil {\n\t\tlogrus.Error(err)\n\t\treturn nil\n\t}\n\tif !shouldHUP {\n\t\t// if there are no hosts, we should just stop the dnsmasq instance to not take\n\t\t// system resources\n\t\terr = dnsNameConf.stop()\n\t\tif err != nil {\n\t\t\tlogrus.Error(err)\n\t\t\treturn nil\n\t\t}\n\t\t// remove the config directory\n\t\terr = os.RemoveAll(domainBaseDir)\n\t\tif err != nil {\n\t\t\tlogrus.Error(err)\n\t\t}\n\t\treturn nil\n\t}\n\t// Now we need to HUP\n\terr = dnsNameConf.hup()\n\tif err != nil {\n\t\tlogrus.Error(err)\n\t}\n\treturn nil\n}\n\nfunc main() {\n\tskel.PluginMain(cmdAdd, cmdCheck, cmdDel, version.All, getVersion())\n}\n\nfunc cmdCheck(args *skel.CmdArgs) error {\n\tvar (\n\t\tconffiles []string\n\t)\n\tif err := findDNSMasq(); err != nil {\n\t\treturn ErrBinaryNotFound\n\t}\n\tnetConf, result, _, err := parseConfig(args.StdinData, args.Args)\n\tif err != nil {\n\t\treturn errors.Wrap(err, \"failed to parse config\")\n\t}\n\n\t// Ensure we have previous result.\n\tif result == nil {\n\t\treturn errors.Errorf(\"Required prevResult missing\")\n\t}\n\tdnsNameConf, err := newDNSMasqFile(netConf.DomainName, result.Interfaces[0].Name, netConf.Name)\n\tif err != nil {\n\t\treturn err\n\t}\n\tdomainBaseDir := filepath.Dir(dnsNameConf.PidFile)\n\tlock, err := getLock(domainBaseDir)\n\tif err != nil {\n\t\treturn err\n\t}\n\tif err := lock.acquire(); err != nil {\n\t\treturn err\n\t}\n\tdefer func() {\n\t\t// if the lock isn't given up by another process\n\t\tif err := lock.release(); err != nil {\n\t\t\tlogrus.Errorf(\"unable to release lock for %q: %v\", domainBaseDir, err)\n\t\t}\n\t}()\n\n\tpid, err := dnsNameConf.getProcess()\n\tif err != nil {\n\t\treturn err\n\t}\n\n\t// Ensure the dnsmasq instance is running\n\tif !isRunning(pid) {\n\t\treturn errors.Errorf(\"dnsmasq instance not running\")\n\t}\n\t// Above will make sure the pidfile exists\n\tfiles, err := ioutil.ReadDir(dnsNameConfPath())\n\tif err != nil {\n\t\treturn err\n\t}\n\tfor _, f := range files {\n\t\tconffiles = append(conffiles, f.Name())\n\t}\n\tif !stringInSlice(\"addnhosts\", conffiles) {\n\t\treturn errors.Errorf(\"addnhost file missing from configuration\")\n\t}\n\tif !stringInSlice(\"dnsmasq.conf\", conffiles) {\n\t\treturn errors.Errorf(\"dnsmasq.conf file missing from configuration\")\n\t}\n\treturn nil\n}\n\n// stringInSlice is simple util to check for the presence of a string\n// in a string slice\nfunc stringInSlice(s string, slice []string) bool {\n\tfor _, sl := range slice {\n\t\tif s == sl {\n\t\t\treturn true\n\t\t}\n\t}\n\treturn false\n}\n\ntype podname struct {\n\ttypes.CommonArgs\n\tK8S_POD_NAME types.UnmarshallableString `json:\"podname,omitempty\"`\n}\n\n// parseConfig parses the supplied configuration (and prevResult) from stdin.\nfunc parseConfig(stdin []byte, args string) (*DNSNameConf, *current.Result, string, error) {\n\tconf := DNSNameConf{}\n\tif err := json.Unmarshal(stdin, &conf); err != nil {\n\t\treturn nil, nil, \"\", errors.Wrap(err, \"failed to parse network configuration\")\n\t}\n\n\t// Parse previous result.\n\tvar result *current.Result\n\tif conf.RawPrevResult != nil {\n\t\tvar err error\n\t\tif err = version.ParsePrevResult(&conf.NetConf); err != nil {\n\t\t\treturn nil, nil, \"\", errors.Wrap(err, \"could not parse prevResult\")\n\t\t}\n\t\tresult, err = current.NewResultFromResult(conf.PrevResult)\n\t\tif err != nil {\n\t\t\treturn nil, nil, \"\", errors.Wrap(err, \"could not convert result to current version\")\n\t\t}\n\t}\n\te := podname{}\n\tif err := types.LoadArgs(args, &e); err != nil {\n\t\treturn nil, nil, \"\", err\n\t}\n\treturn &conf, result, string(e.K8S_POD_NAME), nil\n}\n\nfunc findDNSMasq() error {\n\t_, err := exec.LookPath(\"dnsmasq\")\n\treturn err\n}\n" }, { "path": "plugins/meta/dnsname/result.go", "content": "package main\n\nimport (\n\t\"net\"\n\n\tcurrent \"github.com/containernetworking/cni/pkg/types/100\"\n\t\"github.com/pkg/errors\"\n)\n\n// getIPs iterates a result and returns all the IP addresses\n// associated with it\nfunc getIPs(r *current.Result) ([]*net.IPNet, error) {\n\tvar (\n\t\tips []*net.IPNet\n\t)\n\tif len(r.IPs) < 1 {\n\t\treturn nil, ErrNoIPAddressFound\n\t}\n\tif len(r.IPs) == 1 {\n\t\treturn append(ips, &r.IPs[0].Address), nil\n\t}\n\tfor _, ip := range r.IPs {\n\t\tif ip.Address.IP != nil && ip.Interface != nil {\n\t\t\tif isInterfaceIndexSandox(*ip.Interface, r) {\n\t\t\t\tips = append(ips, &ip.Address)\n\t\t\t} else {\n\t\t\t\treturn nil, errors.Errorf(\"unable to check if interface has a sandbox due to index being out of range\")\n\t\t\t}\n\t\t}\n\t}\n\tif len(ips) < 1 {\n\t\treturn nil, ErrNoIPAddressFound\n\t}\n\treturn ips, nil\n}\n\n// isInterfaceIndexSandox determines if the given interface index has the sandbox\n// attribute and the value is greater than 0\nfunc isInterfaceIndexSandox(idx int, r *current.Result) bool {\n\tif idx >= 0 && idx < len(r.Interfaces) {\n\t\treturn len(r.Interfaces[idx].Sandbox) > 0\n\t}\n\treturn false\n}\n\n// getInterfaceAddresses gets all globalunicast IP addresses for a given\n// interface\nfunc getInterfaceAddresses(nameConf dnsNameFile) ([]string, error) {\n\tvar nameservers []string\n\tnic, err := net.InterfaceByName(nameConf.NetworkInterface)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\taddrs, err := nic.Addrs()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tfor _, addr := range addrs {\n\t\tip, _, err := net.ParseCIDR(addr.String())\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tif ip.IsGlobalUnicast() {\n\t\t\tnameservers = append(nameservers, ip.String())\n\t\t}\n\t}\n\treturn nameservers, nil\n}\n" }, { "path": "plugins/meta/dnsname/service.go", "content": "package main\n\nimport (\n\t\"fmt\"\n\t\"io/ioutil\"\n\t\"os\"\n\t\"os/exec\"\n\t\"path/filepath\"\n\t\"strconv\"\n\t\"strings\"\n\t\"syscall\"\n\n\t\"github.com/pkg/errors\"\n\t\"golang.org/x/sys/unix\"\n)\n\n// newDNSMasqFile creates a new instance of a dnsNameFile\nfunc newDNSMasqFile(domainName, networkInterface, networkName string) (dnsNameFile, error) {\n\tdnsMasqBinary, err := exec.LookPath(\"dnsmasq\")\n\tif err != nil {\n\t\treturn dnsNameFile{}, errors.Errorf(\"the dnsmasq cni plugin requires the dnsmasq binary be in PATH\")\n\t}\n\tmasqConf := dnsNameFile{\n\t\tConfigFile: makePath(networkName, confFileName),\n\t\tDomain: domainName,\n\t\tPidFile: makePath(networkName, pidFileName),\n\t\tNetworkInterface: networkInterface,\n\t\tAddOnHostsFile: makePath(networkName, hostsFileName),\n\t\tBinary: dnsMasqBinary,\n\t}\n\treturn masqConf, nil\n}\n\n// hup sends a sighup to a running dnsmasq to reload its hosts file. if\n// there is no instance of the dnsmasq, then it simply starts it.\nfunc (d dnsNameFile) hup() error {\n\t// First check for pidfile; if it does not exist, we just\n\t// start the service\n\tif _, err := os.Stat(d.PidFile); os.IsNotExist(err) {\n\t\treturn d.start()\n\t}\n\tpid, err := d.getProcess()\n\tif err != nil {\n\t\treturn err\n\t}\n\tif !isRunning(pid) {\n\t\treturn d.start()\n\t}\n\treturn pid.Signal(unix.SIGHUP)\n}\n\n// isRunning sends a signal 0 to the pid to determine if it\n// responds or not\nfunc isRunning(pid *os.Process) bool {\n\tif err := pid.Signal(syscall.Signal(0)); err != nil {\n\t\treturn false\n\t}\n\treturn true\n}\n\n// start starts the dnsmasq instance.\nfunc (d dnsNameFile) start() error {\n\targs := []string{\n\t\t\"-u\",\n\t\t\"root\",\n\t\tfmt.Sprintf(\"--conf-file=%s\", d.ConfigFile),\n\t}\n\tcmd := exec.Command(d.Binary, args...)\n\tif b, err := cmd.CombinedOutput(); err != nil {\n\t\treturn errors.Wrapf(err, \"dnsname error: dnsmasq failed with %q\", b)\n\t}\n\treturn nil\n}\n\n// stop stops the dnsmasq instance.\nfunc (d dnsNameFile) stop() error {\n\tpid, err := d.getProcess()\n\tif err != nil {\n\t\treturn err\n\t}\n\treturn pid.Kill()\n}\n\n// getProcess reads the PID for the dnsmasq instance and returns an\n// *os.Process. Returns an error if the PID does not exist.\nfunc (d dnsNameFile) getProcess() (*os.Process, error) {\n\tpidFileContents, err := ioutil.ReadFile(d.PidFile)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tpid, err := strconv.Atoi(strings.TrimSpace(string(pidFileContents)))\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn os.FindProcess(pid)\n}\n\n// makePath formats a path name given a domain and suffix\nfunc makePath(networkName, fileName string) string {\n\t// the generic path for where conf, host, pid files are kept is:\n\t// /run/containers/cni/dnsmasq//\n\treturn filepath.Join(dnsNameConfPath(), networkName, fileName)\n}\n" }, { "path": "plugins/meta/dnsname/version.go", "content": "package main\n\nimport \"fmt\"\n\n// overwritten at build time\nvar gitCommit = \"unknown\"\n\nconst dnsnameVersion = \"1.4.0-dev\"\n\nfunc getVersion() string {\n\treturn fmt.Sprintf(`CNI dnsname plugin\nversion: %s\ncommit: %s`, dnsnameVersion, gitCommit)\n}\n" }, { "path": "vendor/github.com/alexflint/go-filemutex/LICENSE", "content": "The MIT License\r\n\r\nCopyright (c) 2010-2017 Alex Flint.\r\n\r\nPermission is hereby granted, free of charge, to any person obtaining a copy\r\nof this software and associated documentation files (the \"Software\"), to deal\r\nin the Software without restriction, including without limitation the rights\r\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r\ncopies of the Software, and to permit persons to whom the Software is\r\nfurnished to do so, subject to the following conditions:\r\n\r\nThe above copyright notice and this permission notice shall be included in\r\nall copies or substantial portions of the Software.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r\nTHE SOFTWARE.\r\n" }, { "path": "vendor/github.com/alexflint/go-filemutex/README.md", "content": "# FileMutex\n\nFileMutex is similar to `sync.RWMutex`, but also synchronizes across processes.\nOn Linux, OSX, and other POSIX systems it uses the flock system call. On windows\nit uses the LockFileEx and UnlockFileEx system calls.\n\n```go\nimport (\n\t\"log\"\n\t\"github.com/alexflint/go-filemutex\"\n)\n\nfunc main() {\n\tm, err := filemutex.New(\"/tmp/foo.lock\")\n\tif err != nil {\n\t\tlog.Fatalln(\"Directory did not exist or file could not created\")\n\t}\n\n\tm.Lock() // Will block until lock can be acquired\n\n\t// Code here is protected by the mutex\n\n\tm.Unlock()\n}\n```\n\n### Installation\n\n go get github.com/alexflint/go-filemutex\n\nForked from https://github.com/golang/build/tree/master/cmd/builder/filemutex_*.go\n" }, { "path": "vendor/github.com/alexflint/go-filemutex/filemutex_flock.go", "content": "// Copyright 2013 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// +build darwin dragonfly freebsd linux netbsd openbsd\n\npackage filemutex\n\nimport (\n\t\"syscall\"\n)\n\nconst (\n\tmkdirPerm = 0750\n)\n\n// FileMutex is similar to sync.RWMutex, but also synchronizes across processes.\n// This implementation is based on flock syscall.\ntype FileMutex struct {\n\tfd int\n}\n\nfunc New(filename string) (*FileMutex, error) {\n\tfd, err := syscall.Open(filename, syscall.O_CREAT|syscall.O_RDONLY, mkdirPerm)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn &FileMutex{fd: fd}, nil\n}\n\nfunc (m *FileMutex) Lock() error {\n\tif err := syscall.Flock(m.fd, syscall.LOCK_EX); err != nil {\n\t\treturn err\n\t}\n\treturn nil\n}\n\nfunc (m *FileMutex) Unlock() error {\n\tif err := syscall.Flock(m.fd, syscall.LOCK_UN); err != nil {\n\t\treturn err\n\t}\n\treturn nil\n}\n\nfunc (m *FileMutex) RLock() error {\n\tif err := syscall.Flock(m.fd, syscall.LOCK_SH); err != nil {\n\t\treturn err\n\t}\n\treturn nil\n}\n\nfunc (m *FileMutex) RUnlock() error {\n\tif err := syscall.Flock(m.fd, syscall.LOCK_UN); err != nil {\n\t\treturn err\n\t}\n\treturn nil\n}\n\n// Close does an Unlock() combined with closing and unlinking the associated\n// lock file. You should create a New() FileMutex for every Lock() attempt if\n// using Close().\nfunc (m *FileMutex) Close() error {\n\tif err := syscall.Flock(m.fd, syscall.LOCK_UN); err != nil {\n\t\treturn err\n\t}\n\treturn syscall.Close(m.fd)\n}\n" }, { "path": "vendor/github.com/alexflint/go-filemutex/filemutex_windows.go", "content": "// Copyright 2013 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage filemutex\n\nimport (\n\t\"syscall\"\n\t\"unsafe\"\n)\n\nvar (\n\tmodkernel32 = syscall.NewLazyDLL(\"kernel32.dll\")\n\tprocLockFileEx = modkernel32.NewProc(\"LockFileEx\")\n\tprocUnlockFileEx = modkernel32.NewProc(\"UnlockFileEx\")\n)\n\nconst (\n\tlockfileExclusiveLock = 2\n)\n\nfunc lockFileEx(h syscall.Handle, flags, reserved, locklow, lockhigh uint32, ol *syscall.Overlapped) (err error) {\n\tr1, _, e1 := syscall.Syscall6(procLockFileEx.Addr(), 6, uintptr(h), uintptr(flags), uintptr(reserved), uintptr(locklow), uintptr(lockhigh), uintptr(unsafe.Pointer(ol)))\n\tif r1 == 0 {\n\t\tif e1 != 0 {\n\t\t\terr = error(e1)\n\t\t} else {\n\t\t\terr = syscall.EINVAL\n\t\t}\n\t}\n\treturn\n}\n\nfunc unlockFileEx(h syscall.Handle, reserved, locklow, lockhigh uint32, ol *syscall.Overlapped) (err error) {\n\tr1, _, e1 := syscall.Syscall6(procUnlockFileEx.Addr(), 5, uintptr(h), uintptr(reserved), uintptr(locklow), uintptr(lockhigh), uintptr(unsafe.Pointer(ol)), 0)\n\tif r1 == 0 {\n\t\tif e1 != 0 {\n\t\t\terr = error(e1)\n\t\t} else {\n\t\t\terr = syscall.EINVAL\n\t\t}\n\t}\n\treturn\n}\n\n// FileMutex is similar to sync.RWMutex, but also synchronizes across processes.\n// This implementation is based on flock syscall.\ntype FileMutex struct {\n\tfd syscall.Handle\n}\n\nfunc New(filename string) (*FileMutex, error) {\n\tfd, err := syscall.CreateFile(&(syscall.StringToUTF16(filename)[0]), syscall.GENERIC_READ|syscall.GENERIC_WRITE,\n\t\tsyscall.FILE_SHARE_READ|syscall.FILE_SHARE_WRITE, nil, syscall.OPEN_ALWAYS, syscall.FILE_ATTRIBUTE_NORMAL, 0)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn &FileMutex{fd: fd}, nil\n}\n\nfunc (m *FileMutex) Lock() error {\n\tvar ol syscall.Overlapped\n\tif err := lockFileEx(m.fd, lockfileExclusiveLock, 0, 1, 0, &ol); err != nil {\n\t\treturn err\n\t}\n\treturn nil\n}\n\nfunc (m *FileMutex) Unlock() error {\n\tvar ol syscall.Overlapped\n\tif err := unlockFileEx(m.fd, 0, 1, 0, &ol); err != nil {\n\t\treturn err\n\t}\n\treturn nil\n}\n\nfunc (m *FileMutex) RLock() error {\n\tvar ol syscall.Overlapped\n\tif err := lockFileEx(m.fd, 0, 0, 1, 0, &ol); err != nil {\n\t\treturn err\n\t}\n\treturn nil\n}\n\nfunc (m *FileMutex) RUnlock() error {\n\tvar ol syscall.Overlapped\n\tif err := unlockFileEx(m.fd, 0, 1, 0, &ol); err != nil {\n\t\treturn err\n\t}\n\treturn nil\n}\n\n// Close does an Unlock() combined with closing and unlinking the associated\n// lock file. You should create a New() FileMutex for every Lock() attempt if\n// using Close().\nfunc (m *FileMutex) Close() error {\n\tvar ol syscall.Overlapped\n\tif err := unlockFileEx(m.fd, 0, 1, 0, &ol); err != nil {\n\t\treturn err\n\t}\n\treturn syscall.Close(m.fd)\n}\n" }, { "path": "vendor/github.com/containernetworking/cni/LICENSE", "content": " Apache License\n Version 2.0, January 2004\n http://www.apache.org/licenses/\n\n TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION\n\n 1. Definitions.\n\n \"License\" shall mean the terms and conditions for use, reproduction,\n and distribution as defined by Sections 1 through 9 of this document.\n\n \"Licensor\" shall mean the copyright owner or entity authorized by\n the copyright owner that is granting the License.\n\n \"Legal Entity\" shall mean the union of the acting entity and all\n other entities that control, are controlled by, or are under common\n control with that entity. For the purposes of this definition,\n \"control\" means (i) the power, direct or indirect, to cause the\n direction or management of such entity, whether by contract or\n otherwise, or (ii) ownership of fifty percent (50%) or more of the\n outstanding shares, or (iii) beneficial ownership of such entity.\n\n \"You\" (or \"Your\") shall mean an individual or Legal Entity\n exercising permissions granted by this License.\n\n \"Source\" form shall mean the preferred form for making modifications,\n including but not limited to software source code, documentation\n source, and configuration files.\n\n \"Object\" form shall mean any form resulting from mechanical\n transformation or translation of a Source form, including but\n not limited to compiled object code, generated documentation,\n and conversions to other media types.\n\n \"Work\" shall mean the work of authorship, whether in Source or\n Object form, made available under the License, as indicated by a\n copyright notice that is included in or attached to the work\n (an example is provided in the Appendix below).\n\n \"Derivative Works\" shall mean any work, whether in Source or Object\n form, that is based on (or derived from) the Work and for which the\n editorial revisions, annotations, elaborations, or other modifications\n represent, as a whole, an original work of authorship. For the purposes\n of this License, Derivative Works shall not include works that remain\n separable from, or merely link (or bind by name) to the interfaces of,\n the Work and Derivative Works thereof.\n\n \"Contribution\" shall mean any work of authorship, including\n the original version of the Work and any modifications or additions\n to that Work or Derivative Works thereof, that is intentionally\n submitted to Licensor for inclusion in the Work by the copyright owner\n or by an individual or Legal Entity authorized to submit on behalf of\n the copyright owner. For the purposes of this definition, \"submitted\"\n means any form of electronic, verbal, or written communication sent\n to the Licensor or its representatives, including but not limited to\n communication on electronic mailing lists, source code control systems,\n and issue tracking systems that are managed by, or on behalf of, the\n Licensor for the purpose of discussing and improving the Work, but\n excluding communication that is conspicuously marked or otherwise\n designated in writing by the copyright owner as \"Not a Contribution.\"\n\n \"Contributor\" shall mean Licensor and any individual or Legal Entity\n on behalf of whom a Contribution has been received by Licensor and\n subsequently incorporated within the Work.\n\n 2. Grant of Copyright License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n copyright license to reproduce, prepare Derivative Works of,\n publicly display, publicly perform, sublicense, and distribute the\n Work and such Derivative Works in Source or Object form.\n\n 3. Grant of Patent License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n (except as stated in this section) patent license to make, have made,\n use, offer to sell, sell, import, and otherwise transfer the Work,\n where such license applies only to those patent claims licensable\n by such Contributor that are necessarily infringed by their\n Contribution(s) alone or by combination of their Contribution(s)\n with the Work to which such Contribution(s) was submitted. If You\n institute patent litigation against any entity (including a\n cross-claim or counterclaim in a lawsuit) alleging that the Work\n or a Contribution incorporated within the Work constitutes direct\n or contributory patent infringement, then any patent licenses\n granted to You under this License for that Work shall terminate\n as of the date such litigation is filed.\n\n 4. Redistribution. You may reproduce and distribute copies of the\n Work or Derivative Works thereof in any medium, with or without\n modifications, and in Source or Object form, provided that You\n meet the following conditions:\n\n (a) You must give any other recipients of the Work or\n Derivative Works a copy of this License; and\n\n (b) You must cause any modified files to carry prominent notices\n stating that You changed the files; and\n\n (c) You must retain, in the Source form of any Derivative Works\n that You distribute, all copyright, patent, trademark, and\n attribution notices from the Source form of the Work,\n excluding those notices that do not pertain to any part of\n the Derivative Works; and\n\n (d) If the Work includes a \"NOTICE\" text file as part of its\n distribution, then any Derivative Works that You distribute must\n include a readable copy of the attribution notices contained\n within such NOTICE file, excluding those notices that do not\n pertain to any part of the Derivative Works, in at least one\n of the following places: within a NOTICE text file distributed\n as part of the Derivative Works; within the Source form or\n documentation, if provided along with the Derivative Works; or,\n within a display generated by the Derivative Works, if and\n wherever such third-party notices normally appear. The contents\n of the NOTICE file are for informational purposes only and\n do not modify the License. You may add Your own attribution\n notices within Derivative Works that You distribute, alongside\n or as an addendum to the NOTICE text from the Work, provided\n that such additional attribution notices cannot be construed\n as modifying the License.\n\n You may add Your own copyright statement to Your modifications and\n may provide additional or different license terms and conditions\n for use, reproduction, or distribution of Your modifications, or\n for any such Derivative Works as a whole, provided Your use,\n reproduction, and distribution of the Work otherwise complies with\n the conditions stated in this License.\n\n 5. Submission of Contributions. Unless You explicitly state otherwise,\n any Contribution intentionally submitted for inclusion in the Work\n by You to the Licensor shall be under the terms and conditions of\n this License, without any additional terms or conditions.\n Notwithstanding the above, nothing herein shall supersede or modify\n the terms of any separate license agreement you may have executed\n with Licensor regarding such Contributions.\n\n 6. Trademarks. This License does not grant permission to use the trade\n names, trademarks, service marks, or product names of the Licensor,\n except as required for reasonable and customary use in describing the\n origin of the Work and reproducing the content of the NOTICE file.\n\n 7. Disclaimer of Warranty. Unless required by applicable law or\n agreed to in writing, Licensor provides the Work (and each\n Contributor provides its Contributions) on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\n implied, including, without limitation, any warranties or conditions\n of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A\n PARTICULAR PURPOSE. You are solely responsible for determining the\n appropriateness of using or redistributing the Work and assume any\n risks associated with Your exercise of permissions under this License.\n\n 8. Limitation of Liability. In no event and under no legal theory,\n whether in tort (including negligence), contract, or otherwise,\n unless required by applicable law (such as deliberate and grossly\n negligent acts) or agreed to in writing, shall any Contributor be\n liable to You for damages, including any direct, indirect, special,\n incidental, or consequential damages of any character arising as a\n result of this License or out of the use or inability to use the\n Work (including but not limited to damages for loss of goodwill,\n work stoppage, computer failure or malfunction, or any and all\n other commercial damages or losses), even if such Contributor\n has been advised of the possibility of such damages.\n\n 9. Accepting Warranty or Additional Liability. While redistributing\n the Work or Derivative Works thereof, You may choose to offer,\n and charge a fee for, acceptance of support, warranty, indemnity,\n or other liability obligations and/or rights consistent with this\n License. However, in accepting such obligations, You may act only\n on Your own behalf and on Your sole responsibility, not on behalf\n of any other Contributor, and only if You agree to indemnify,\n defend, and hold each Contributor harmless for any liability\n incurred by, or claims asserted against, such Contributor by reason\n of your accepting any such warranty or additional liability.\n\n END OF TERMS AND CONDITIONS\n\n APPENDIX: How to apply the Apache License to your work.\n\n To apply the Apache License to your work, attach the following\n boilerplate notice, with the fields enclosed by brackets \"{}\"\n replaced with your own identifying information. (Don't include\n the brackets!) The text should be enclosed in the appropriate\n comment syntax for the file format. We also recommend that a\n file or class name and description of purpose be included on the\n same \"printed page\" as the copyright notice for easier\n identification within third-party archives.\n\n Copyright {yyyy} {name of copyright owner}\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n\n" }, { "path": "vendor/github.com/containernetworking/cni/pkg/skel/skel.go", "content": "// Copyright 2014-2016 CNI authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\n// Package skel provides skeleton code for a CNI plugin.\n// In particular, it implements argument parsing and validation.\npackage skel\n\nimport (\n\t\"bytes\"\n\t\"encoding/json\"\n\t\"fmt\"\n\t\"io\"\n\t\"io/ioutil\"\n\t\"log\"\n\t\"os\"\n\t\"strings\"\n\n\t\"github.com/containernetworking/cni/pkg/types\"\n\t\"github.com/containernetworking/cni/pkg/utils\"\n\t\"github.com/containernetworking/cni/pkg/version\"\n)\n\n// CmdArgs captures all the arguments passed in to the plugin\n// via both env vars and stdin\ntype CmdArgs struct {\n\tContainerID string\n\tNetns string\n\tIfName string\n\tArgs string\n\tPath string\n\tStdinData []byte\n}\n\ntype dispatcher struct {\n\tGetenv func(string) string\n\tStdin io.Reader\n\tStdout io.Writer\n\tStderr io.Writer\n\n\tConfVersionDecoder version.ConfigDecoder\n\tVersionReconciler version.Reconciler\n}\n\ntype reqForCmdEntry map[string]bool\n\nfunc (t *dispatcher) getCmdArgsFromEnv() (string, *CmdArgs, *types.Error) {\n\tvar cmd, contID, netns, ifName, args, path string\n\n\tvars := []struct {\n\t\tname string\n\t\tval *string\n\t\treqForCmd reqForCmdEntry\n\t}{\n\t\t{\n\t\t\t\"CNI_COMMAND\",\n\t\t\t&cmd,\n\t\t\treqForCmdEntry{\n\t\t\t\t\"ADD\": true,\n\t\t\t\t\"CHECK\": true,\n\t\t\t\t\"DEL\": true,\n\t\t\t},\n\t\t},\n\t\t{\n\t\t\t\"CNI_CONTAINERID\",\n\t\t\t&contID,\n\t\t\treqForCmdEntry{\n\t\t\t\t\"ADD\": true,\n\t\t\t\t\"CHECK\": true,\n\t\t\t\t\"DEL\": true,\n\t\t\t},\n\t\t},\n\t\t{\n\t\t\t\"CNI_NETNS\",\n\t\t\t&netns,\n\t\t\treqForCmdEntry{\n\t\t\t\t\"ADD\": true,\n\t\t\t\t\"CHECK\": true,\n\t\t\t\t\"DEL\": false,\n\t\t\t},\n\t\t},\n\t\t{\n\t\t\t\"CNI_IFNAME\",\n\t\t\t&ifName,\n\t\t\treqForCmdEntry{\n\t\t\t\t\"ADD\": true,\n\t\t\t\t\"CHECK\": true,\n\t\t\t\t\"DEL\": true,\n\t\t\t},\n\t\t},\n\t\t{\n\t\t\t\"CNI_ARGS\",\n\t\t\t&args,\n\t\t\treqForCmdEntry{\n\t\t\t\t\"ADD\": false,\n\t\t\t\t\"CHECK\": false,\n\t\t\t\t\"DEL\": false,\n\t\t\t},\n\t\t},\n\t\t{\n\t\t\t\"CNI_PATH\",\n\t\t\t&path,\n\t\t\treqForCmdEntry{\n\t\t\t\t\"ADD\": true,\n\t\t\t\t\"CHECK\": true,\n\t\t\t\t\"DEL\": true,\n\t\t\t},\n\t\t},\n\t}\n\n\targsMissing := make([]string, 0)\n\tfor _, v := range vars {\n\t\t*v.val = t.Getenv(v.name)\n\t\tif *v.val == \"\" {\n\t\t\tif v.reqForCmd[cmd] || v.name == \"CNI_COMMAND\" {\n\t\t\t\targsMissing = append(argsMissing, v.name)\n\t\t\t}\n\t\t}\n\t}\n\n\tif len(argsMissing) > 0 {\n\t\tjoined := strings.Join(argsMissing, \",\")\n\t\treturn \"\", nil, types.NewError(types.ErrInvalidEnvironmentVariables, fmt.Sprintf(\"required env variables [%s] missing\", joined), \"\")\n\t}\n\n\tif cmd == \"VERSION\" {\n\t\tt.Stdin = bytes.NewReader(nil)\n\t}\n\n\tstdinData, err := ioutil.ReadAll(t.Stdin)\n\tif err != nil {\n\t\treturn \"\", nil, types.NewError(types.ErrIOFailure, fmt.Sprintf(\"error reading from stdin: %v\", err), \"\")\n\t}\n\n\tcmdArgs := &CmdArgs{\n\t\tContainerID: contID,\n\t\tNetns: netns,\n\t\tIfName: ifName,\n\t\tArgs: args,\n\t\tPath: path,\n\t\tStdinData: stdinData,\n\t}\n\treturn cmd, cmdArgs, nil\n}\n\nfunc (t *dispatcher) checkVersionAndCall(cmdArgs *CmdArgs, pluginVersionInfo version.PluginInfo, toCall func(*CmdArgs) error) *types.Error {\n\tconfigVersion, err := t.ConfVersionDecoder.Decode(cmdArgs.StdinData)\n\tif err != nil {\n\t\treturn types.NewError(types.ErrDecodingFailure, err.Error(), \"\")\n\t}\n\tverErr := t.VersionReconciler.Check(configVersion, pluginVersionInfo)\n\tif verErr != nil {\n\t\treturn types.NewError(types.ErrIncompatibleCNIVersion, \"incompatible CNI versions\", verErr.Details())\n\t}\n\n\tif err = toCall(cmdArgs); err != nil {\n\t\tif e, ok := err.(*types.Error); ok {\n\t\t\t// don't wrap Error in Error\n\t\t\treturn e\n\t\t}\n\t\treturn types.NewError(types.ErrInternal, err.Error(), \"\")\n\t}\n\n\treturn nil\n}\n\nfunc validateConfig(jsonBytes []byte) *types.Error {\n\tvar conf struct {\n\t\tName string `json:\"name\"`\n\t}\n\tif err := json.Unmarshal(jsonBytes, &conf); err != nil {\n\t\treturn types.NewError(types.ErrDecodingFailure, fmt.Sprintf(\"error unmarshall network config: %v\", err), \"\")\n\t}\n\tif conf.Name == \"\" {\n\t\treturn types.NewError(types.ErrInvalidNetworkConfig, \"missing network name\", \"\")\n\t}\n\tif err := utils.ValidateNetworkName(conf.Name); err != nil {\n\t\treturn err\n\t}\n\treturn nil\n}\n\nfunc (t *dispatcher) pluginMain(cmdAdd, cmdCheck, cmdDel func(_ *CmdArgs) error, versionInfo version.PluginInfo, about string) *types.Error {\n\tcmd, cmdArgs, err := t.getCmdArgsFromEnv()\n\tif err != nil {\n\t\t// Print the about string to stderr when no command is set\n\t\tif err.Code == types.ErrInvalidEnvironmentVariables && t.Getenv(\"CNI_COMMAND\") == \"\" && about != \"\" {\n\t\t\t_, _ = fmt.Fprintln(t.Stderr, about)\n\t\t\t_, _ = fmt.Fprintf(t.Stderr, \"CNI protocol versions supported: %s\\n\", strings.Join(versionInfo.SupportedVersions(), \", \"))\n\t\t\treturn nil\n\t\t}\n\t\treturn err\n\t}\n\n\tif cmd != \"VERSION\" {\n\t\tif err = validateConfig(cmdArgs.StdinData); err != nil {\n\t\t\treturn err\n\t\t}\n\t\tif err = utils.ValidateContainerID(cmdArgs.ContainerID); err != nil {\n\t\t\treturn err\n\t\t}\n\t\tif err = utils.ValidateInterfaceName(cmdArgs.IfName); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\n\tswitch cmd {\n\tcase \"ADD\":\n\t\terr = t.checkVersionAndCall(cmdArgs, versionInfo, cmdAdd)\n\tcase \"CHECK\":\n\t\tconfigVersion, err := t.ConfVersionDecoder.Decode(cmdArgs.StdinData)\n\t\tif err != nil {\n\t\t\treturn types.NewError(types.ErrDecodingFailure, err.Error(), \"\")\n\t\t}\n\t\tif gtet, err := version.GreaterThanOrEqualTo(configVersion, \"0.4.0\"); err != nil {\n\t\t\treturn types.NewError(types.ErrDecodingFailure, err.Error(), \"\")\n\t\t} else if !gtet {\n\t\t\treturn types.NewError(types.ErrIncompatibleCNIVersion, \"config version does not allow CHECK\", \"\")\n\t\t}\n\t\tfor _, pluginVersion := range versionInfo.SupportedVersions() {\n\t\t\tgtet, err := version.GreaterThanOrEqualTo(pluginVersion, configVersion)\n\t\t\tif err != nil {\n\t\t\t\treturn types.NewError(types.ErrDecodingFailure, err.Error(), \"\")\n\t\t\t} else if gtet {\n\t\t\t\tif err := t.checkVersionAndCall(cmdArgs, versionInfo, cmdCheck); err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t\treturn nil\n\t\t\t}\n\t\t}\n\t\treturn types.NewError(types.ErrIncompatibleCNIVersion, \"plugin version does not allow CHECK\", \"\")\n\tcase \"DEL\":\n\t\terr = t.checkVersionAndCall(cmdArgs, versionInfo, cmdDel)\n\tcase \"VERSION\":\n\t\tif err := versionInfo.Encode(t.Stdout); err != nil {\n\t\t\treturn types.NewError(types.ErrIOFailure, err.Error(), \"\")\n\t\t}\n\tdefault:\n\t\treturn types.NewError(types.ErrInvalidEnvironmentVariables, fmt.Sprintf(\"unknown CNI_COMMAND: %v\", cmd), \"\")\n\t}\n\n\treturn err\n}\n\n// PluginMainWithError is the core \"main\" for a plugin. It accepts\n// callback functions for add, check, and del CNI commands and returns an error.\n//\n// The caller must also specify what CNI spec versions the plugin supports.\n//\n// It is the responsibility of the caller to check for non-nil error return.\n//\n// For a plugin to comply with the CNI spec, it must print any error to stdout\n// as JSON and then exit with nonzero status code.\n//\n// To let this package automatically handle errors and call os.Exit(1) for you,\n// use PluginMain() instead.\nfunc PluginMainWithError(cmdAdd, cmdCheck, cmdDel func(_ *CmdArgs) error, versionInfo version.PluginInfo, about string) *types.Error {\n\treturn (&dispatcher{\n\t\tGetenv: os.Getenv,\n\t\tStdin: os.Stdin,\n\t\tStdout: os.Stdout,\n\t\tStderr: os.Stderr,\n\t}).pluginMain(cmdAdd, cmdCheck, cmdDel, versionInfo, about)\n}\n\n// PluginMain is the core \"main\" for a plugin which includes automatic error handling.\n//\n// The caller must also specify what CNI spec versions the plugin supports.\n//\n// The caller can specify an \"about\" string, which is printed on stderr\n// when no CNI_COMMAND is specified. The recommended output is \"CNI plugin v\"\n//\n// When an error occurs in either cmdAdd, cmdCheck, or cmdDel, PluginMain will print the error\n// as JSON to stdout and call os.Exit(1).\n//\n// To have more control over error handling, use PluginMainWithError() instead.\nfunc PluginMain(cmdAdd, cmdCheck, cmdDel func(_ *CmdArgs) error, versionInfo version.PluginInfo, about string) {\n\tif e := PluginMainWithError(cmdAdd, cmdCheck, cmdDel, versionInfo, about); e != nil {\n\t\tif err := e.Print(); err != nil {\n\t\t\tlog.Print(\"Error writing error JSON to stdout: \", err)\n\t\t}\n\t\tos.Exit(1)\n\t}\n}\n" }, { "path": "vendor/github.com/containernetworking/cni/pkg/types/020/types.go", "content": "// Copyright 2016 CNI authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage types020\n\nimport (\n\t\"encoding/json\"\n\t\"fmt\"\n\t\"io\"\n\t\"net\"\n\t\"os\"\n\n\t\"github.com/containernetworking/cni/pkg/types\"\n\tconvert \"github.com/containernetworking/cni/pkg/types/internal\"\n)\n\nconst ImplementedSpecVersion string = \"0.2.0\"\n\nvar supportedVersions = []string{\"\", \"0.1.0\", ImplementedSpecVersion}\n\n// Register converters for all versions less than the implemented spec version\nfunc init() {\n\tconvert.RegisterConverter(\"0.1.0\", []string{ImplementedSpecVersion}, convertFrom010)\n\tconvert.RegisterConverter(ImplementedSpecVersion, []string{\"0.1.0\"}, convertTo010)\n\n\t// Creator\n\tconvert.RegisterCreator(supportedVersions, NewResult)\n}\n\n// Compatibility types for CNI version 0.1.0 and 0.2.0\n\n// NewResult creates a new Result object from JSON data. The JSON data\n// must be compatible with the CNI versions implemented by this type.\nfunc NewResult(data []byte) (types.Result, error) {\n\tresult := &Result{}\n\tif err := json.Unmarshal(data, result); err != nil {\n\t\treturn nil, err\n\t}\n\tfor _, v := range supportedVersions {\n\t\tif result.CNIVersion == v {\n\t\t\tif result.CNIVersion == \"\" {\n\t\t\t\tresult.CNIVersion = \"0.1.0\"\n\t\t\t}\n\t\t\treturn result, nil\n\t\t}\n\t}\n\treturn nil, fmt.Errorf(\"result type supports %v but unmarshalled CNIVersion is %q\",\n\t\tsupportedVersions, result.CNIVersion)\n}\n\n// GetResult converts the given Result object to the ImplementedSpecVersion\n// and returns the concrete type or an error\nfunc GetResult(r types.Result) (*Result, error) {\n\tresult020, err := convert.Convert(r, ImplementedSpecVersion)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tresult, ok := result020.(*Result)\n\tif !ok {\n\t\treturn nil, fmt.Errorf(\"failed to convert result\")\n\t}\n\treturn result, nil\n}\n\nfunc convertFrom010(from types.Result, toVersion string) (types.Result, error) {\n\tif toVersion != \"0.2.0\" {\n\t\tpanic(\"only converts to version 0.2.0\")\n\t}\n\tfromResult := from.(*Result)\n\treturn &Result{\n\t\tCNIVersion: ImplementedSpecVersion,\n\t\tIP4: fromResult.IP4.Copy(),\n\t\tIP6: fromResult.IP6.Copy(),\n\t\tDNS: *fromResult.DNS.Copy(),\n\t}, nil\n}\n\nfunc convertTo010(from types.Result, toVersion string) (types.Result, error) {\n\tif toVersion != \"0.1.0\" {\n\t\tpanic(\"only converts to version 0.1.0\")\n\t}\n\tfromResult := from.(*Result)\n\treturn &Result{\n\t\tCNIVersion: \"0.1.0\",\n\t\tIP4: fromResult.IP4.Copy(),\n\t\tIP6: fromResult.IP6.Copy(),\n\t\tDNS: *fromResult.DNS.Copy(),\n\t}, nil\n}\n\n// Result is what gets returned from the plugin (via stdout) to the caller\ntype Result struct {\n\tCNIVersion string `json:\"cniVersion,omitempty\"`\n\tIP4 *IPConfig `json:\"ip4,omitempty\"`\n\tIP6 *IPConfig `json:\"ip6,omitempty\"`\n\tDNS types.DNS `json:\"dns,omitempty\"`\n}\n\nfunc (r *Result) Version() string {\n\treturn r.CNIVersion\n}\n\nfunc (r *Result) GetAsVersion(version string) (types.Result, error) {\n\t// If the creator of the result did not set the CNIVersion, assume it\n\t// should be the highest spec version implemented by this Result\n\tif r.CNIVersion == \"\" {\n\t\tr.CNIVersion = ImplementedSpecVersion\n\t}\n\treturn convert.Convert(r, version)\n}\n\nfunc (r *Result) Print() error {\n\treturn r.PrintTo(os.Stdout)\n}\n\nfunc (r *Result) PrintTo(writer io.Writer) error {\n\tdata, err := json.MarshalIndent(r, \"\", \" \")\n\tif err != nil {\n\t\treturn err\n\t}\n\t_, err = writer.Write(data)\n\treturn err\n}\n\n// IPConfig contains values necessary to configure an interface\ntype IPConfig struct {\n\tIP net.IPNet\n\tGateway net.IP\n\tRoutes []types.Route\n}\n\nfunc (i *IPConfig) Copy() *IPConfig {\n\tif i == nil {\n\t\treturn nil\n\t}\n\n\tvar routes []types.Route\n\tfor _, fromRoute := range i.Routes {\n\t\troutes = append(routes, *fromRoute.Copy())\n\t}\n\treturn &IPConfig{\n\t\tIP: i.IP,\n\t\tGateway: i.Gateway,\n\t\tRoutes: routes,\n\t}\n}\n\n// net.IPNet is not JSON (un)marshallable so this duality is needed\n// for our custom IPNet type\n\n// JSON (un)marshallable types\ntype ipConfig struct {\n\tIP types.IPNet `json:\"ip\"`\n\tGateway net.IP `json:\"gateway,omitempty\"`\n\tRoutes []types.Route `json:\"routes,omitempty\"`\n}\n\nfunc (c *IPConfig) MarshalJSON() ([]byte, error) {\n\tipc := ipConfig{\n\t\tIP: types.IPNet(c.IP),\n\t\tGateway: c.Gateway,\n\t\tRoutes: c.Routes,\n\t}\n\n\treturn json.Marshal(ipc)\n}\n\nfunc (c *IPConfig) UnmarshalJSON(data []byte) error {\n\tipc := ipConfig{}\n\tif err := json.Unmarshal(data, &ipc); err != nil {\n\t\treturn err\n\t}\n\n\tc.IP = net.IPNet(ipc.IP)\n\tc.Gateway = ipc.Gateway\n\tc.Routes = ipc.Routes\n\treturn nil\n}\n" }, { "path": "vendor/github.com/containernetworking/cni/pkg/types/040/types.go", "content": "// Copyright 2016 CNI authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage types040\n\nimport (\n\t\"encoding/json\"\n\t\"fmt\"\n\t\"io\"\n\t\"net\"\n\t\"os\"\n\n\t\"github.com/containernetworking/cni/pkg/types\"\n\ttypes020 \"github.com/containernetworking/cni/pkg/types/020\"\n\tconvert \"github.com/containernetworking/cni/pkg/types/internal\"\n)\n\nconst ImplementedSpecVersion string = \"0.4.0\"\n\nvar supportedVersions = []string{\"0.3.0\", \"0.3.1\", ImplementedSpecVersion}\n\n// Register converters for all versions less than the implemented spec version\nfunc init() {\n\t// Up-converters\n\tconvert.RegisterConverter(\"0.1.0\", supportedVersions, convertFrom02x)\n\tconvert.RegisterConverter(\"0.2.0\", supportedVersions, convertFrom02x)\n\tconvert.RegisterConverter(\"0.3.0\", supportedVersions, convertInternal)\n\tconvert.RegisterConverter(\"0.3.1\", supportedVersions, convertInternal)\n\n\t// Down-converters\n\tconvert.RegisterConverter(\"0.4.0\", []string{\"0.3.0\", \"0.3.1\"}, convertInternal)\n\tconvert.RegisterConverter(\"0.4.0\", []string{\"0.1.0\", \"0.2.0\"}, convertTo02x)\n\tconvert.RegisterConverter(\"0.3.1\", []string{\"0.1.0\", \"0.2.0\"}, convertTo02x)\n\tconvert.RegisterConverter(\"0.3.0\", []string{\"0.1.0\", \"0.2.0\"}, convertTo02x)\n\n\t// Creator\n\tconvert.RegisterCreator(supportedVersions, NewResult)\n}\n\nfunc NewResult(data []byte) (types.Result, error) {\n\tresult := &Result{}\n\tif err := json.Unmarshal(data, result); err != nil {\n\t\treturn nil, err\n\t}\n\tfor _, v := range supportedVersions {\n\t\tif result.CNIVersion == v {\n\t\t\treturn result, nil\n\t\t}\n\t}\n\treturn nil, fmt.Errorf(\"result type supports %v but unmarshalled CNIVersion is %q\",\n\t\tsupportedVersions, result.CNIVersion)\n}\n\nfunc GetResult(r types.Result) (*Result, error) {\n\tresultCurrent, err := r.GetAsVersion(ImplementedSpecVersion)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tresult, ok := resultCurrent.(*Result)\n\tif !ok {\n\t\treturn nil, fmt.Errorf(\"failed to convert result\")\n\t}\n\treturn result, nil\n}\n\nfunc NewResultFromResult(result types.Result) (*Result, error) {\n\tnewResult, err := convert.Convert(result, ImplementedSpecVersion)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn newResult.(*Result), nil\n}\n\n// Result is what gets returned from the plugin (via stdout) to the caller\ntype Result struct {\n\tCNIVersion string `json:\"cniVersion,omitempty\"`\n\tInterfaces []*Interface `json:\"interfaces,omitempty\"`\n\tIPs []*IPConfig `json:\"ips,omitempty\"`\n\tRoutes []*types.Route `json:\"routes,omitempty\"`\n\tDNS types.DNS `json:\"dns,omitempty\"`\n}\n\nfunc convert020IPConfig(from *types020.IPConfig, ipVersion string) *IPConfig {\n\treturn &IPConfig{\n\t\tVersion: ipVersion,\n\t\tAddress: from.IP,\n\t\tGateway: from.Gateway,\n\t}\n}\n\nfunc convertFrom02x(from types.Result, toVersion string) (types.Result, error) {\n\tfromResult := from.(*types020.Result)\n\ttoResult := &Result{\n\t\tCNIVersion: toVersion,\n\t\tDNS: *fromResult.DNS.Copy(),\n\t\tRoutes: []*types.Route{},\n\t}\n\tif fromResult.IP4 != nil {\n\t\ttoResult.IPs = append(toResult.IPs, convert020IPConfig(fromResult.IP4, \"4\"))\n\t\tfor _, fromRoute := range fromResult.IP4.Routes {\n\t\t\ttoResult.Routes = append(toResult.Routes, fromRoute.Copy())\n\t\t}\n\t}\n\n\tif fromResult.IP6 != nil {\n\t\ttoResult.IPs = append(toResult.IPs, convert020IPConfig(fromResult.IP6, \"6\"))\n\t\tfor _, fromRoute := range fromResult.IP6.Routes {\n\t\t\ttoResult.Routes = append(toResult.Routes, fromRoute.Copy())\n\t\t}\n\t}\n\n\treturn toResult, nil\n}\n\nfunc convertInternal(from types.Result, toVersion string) (types.Result, error) {\n\tfromResult := from.(*Result)\n\ttoResult := &Result{\n\t\tCNIVersion: toVersion,\n\t\tDNS: *fromResult.DNS.Copy(),\n\t\tRoutes: []*types.Route{},\n\t}\n\tfor _, fromIntf := range fromResult.Interfaces {\n\t\ttoResult.Interfaces = append(toResult.Interfaces, fromIntf.Copy())\n\t}\n\tfor _, fromIPC := range fromResult.IPs {\n\t\ttoResult.IPs = append(toResult.IPs, fromIPC.Copy())\n\t}\n\tfor _, fromRoute := range fromResult.Routes {\n\t\ttoResult.Routes = append(toResult.Routes, fromRoute.Copy())\n\t}\n\treturn toResult, nil\n}\n\nfunc convertTo02x(from types.Result, toVersion string) (types.Result, error) {\n\tfromResult := from.(*Result)\n\ttoResult := &types020.Result{\n\t\tCNIVersion: toVersion,\n\t\tDNS: *fromResult.DNS.Copy(),\n\t}\n\n\tfor _, fromIP := range fromResult.IPs {\n\t\t// Only convert the first IP address of each version as 0.2.0\n\t\t// and earlier cannot handle multiple IP addresses\n\t\tif fromIP.Version == \"4\" && toResult.IP4 == nil {\n\t\t\ttoResult.IP4 = &types020.IPConfig{\n\t\t\t\tIP: fromIP.Address,\n\t\t\t\tGateway: fromIP.Gateway,\n\t\t\t}\n\t\t} else if fromIP.Version == \"6\" && toResult.IP6 == nil {\n\t\t\ttoResult.IP6 = &types020.IPConfig{\n\t\t\t\tIP: fromIP.Address,\n\t\t\t\tGateway: fromIP.Gateway,\n\t\t\t}\n\t\t}\n\t\tif toResult.IP4 != nil && toResult.IP6 != nil {\n\t\t\tbreak\n\t\t}\n\t}\n\n\tfor _, fromRoute := range fromResult.Routes {\n\t\tis4 := fromRoute.Dst.IP.To4() != nil\n\t\tif is4 && toResult.IP4 != nil {\n\t\t\ttoResult.IP4.Routes = append(toResult.IP4.Routes, types.Route{\n\t\t\t\tDst: fromRoute.Dst,\n\t\t\t\tGW: fromRoute.GW,\n\t\t\t})\n\t\t} else if !is4 && toResult.IP6 != nil {\n\t\t\ttoResult.IP6.Routes = append(toResult.IP6.Routes, types.Route{\n\t\t\t\tDst: fromRoute.Dst,\n\t\t\t\tGW: fromRoute.GW,\n\t\t\t})\n\t\t}\n\t}\n\n\t// 0.2.0 and earlier require at least one IP address in the Result\n\tif toResult.IP4 == nil && toResult.IP6 == nil {\n\t\treturn nil, fmt.Errorf(\"cannot convert: no valid IP addresses\")\n\t}\n\n\treturn toResult, nil\n}\n\nfunc (r *Result) Version() string {\n\treturn r.CNIVersion\n}\n\nfunc (r *Result) GetAsVersion(version string) (types.Result, error) {\n\t// If the creator of the result did not set the CNIVersion, assume it\n\t// should be the highest spec version implemented by this Result\n\tif r.CNIVersion == \"\" {\n\t\tr.CNIVersion = ImplementedSpecVersion\n\t}\n\treturn convert.Convert(r, version)\n}\n\nfunc (r *Result) Print() error {\n\treturn r.PrintTo(os.Stdout)\n}\n\nfunc (r *Result) PrintTo(writer io.Writer) error {\n\tdata, err := json.MarshalIndent(r, \"\", \" \")\n\tif err != nil {\n\t\treturn err\n\t}\n\t_, err = writer.Write(data)\n\treturn err\n}\n\n// Interface contains values about the created interfaces\ntype Interface struct {\n\tName string `json:\"name\"`\n\tMac string `json:\"mac,omitempty\"`\n\tSandbox string `json:\"sandbox,omitempty\"`\n}\n\nfunc (i *Interface) String() string {\n\treturn fmt.Sprintf(\"%+v\", *i)\n}\n\nfunc (i *Interface) Copy() *Interface {\n\tif i == nil {\n\t\treturn nil\n\t}\n\tnewIntf := *i\n\treturn &newIntf\n}\n\n// Int returns a pointer to the int value passed in. Used to\n// set the IPConfig.Interface field.\nfunc Int(v int) *int {\n\treturn &v\n}\n\n// IPConfig contains values necessary to configure an IP address on an interface\ntype IPConfig struct {\n\t// IP version, either \"4\" or \"6\"\n\tVersion string\n\t// Index into Result structs Interfaces list\n\tInterface *int\n\tAddress net.IPNet\n\tGateway net.IP\n}\n\nfunc (i *IPConfig) String() string {\n\treturn fmt.Sprintf(\"%+v\", *i)\n}\n\nfunc (i *IPConfig) Copy() *IPConfig {\n\tif i == nil {\n\t\treturn nil\n\t}\n\n\tipc := &IPConfig{\n\t\tVersion: i.Version,\n\t\tAddress: i.Address,\n\t\tGateway: i.Gateway,\n\t}\n\tif i.Interface != nil {\n\t\tintf := *i.Interface\n\t\tipc.Interface = &intf\n\t}\n\treturn ipc\n}\n\n// JSON (un)marshallable types\ntype ipConfig struct {\n\tVersion string `json:\"version\"`\n\tInterface *int `json:\"interface,omitempty\"`\n\tAddress types.IPNet `json:\"address\"`\n\tGateway net.IP `json:\"gateway,omitempty\"`\n}\n\nfunc (c *IPConfig) MarshalJSON() ([]byte, error) {\n\tipc := ipConfig{\n\t\tVersion: c.Version,\n\t\tInterface: c.Interface,\n\t\tAddress: types.IPNet(c.Address),\n\t\tGateway: c.Gateway,\n\t}\n\n\treturn json.Marshal(ipc)\n}\n\nfunc (c *IPConfig) UnmarshalJSON(data []byte) error {\n\tipc := ipConfig{}\n\tif err := json.Unmarshal(data, &ipc); err != nil {\n\t\treturn err\n\t}\n\n\tc.Version = ipc.Version\n\tc.Interface = ipc.Interface\n\tc.Address = net.IPNet(ipc.Address)\n\tc.Gateway = ipc.Gateway\n\treturn nil\n}\n" }, { "path": "vendor/github.com/containernetworking/cni/pkg/types/100/types.go", "content": "// Copyright 2016 CNI authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage types100\n\nimport (\n\t\"encoding/json\"\n\t\"fmt\"\n\t\"io\"\n\t\"net\"\n\t\"os\"\n\n\t\"github.com/containernetworking/cni/pkg/types\"\n\ttypes040 \"github.com/containernetworking/cni/pkg/types/040\"\n\tconvert \"github.com/containernetworking/cni/pkg/types/internal\"\n)\n\nconst ImplementedSpecVersion string = \"1.0.0\"\n\nvar supportedVersions = []string{ImplementedSpecVersion}\n\n// Register converters for all versions less than the implemented spec version\nfunc init() {\n\t// Up-converters\n\tconvert.RegisterConverter(\"0.1.0\", supportedVersions, convertFrom02x)\n\tconvert.RegisterConverter(\"0.2.0\", supportedVersions, convertFrom02x)\n\tconvert.RegisterConverter(\"0.3.0\", supportedVersions, convertFrom04x)\n\tconvert.RegisterConverter(\"0.3.1\", supportedVersions, convertFrom04x)\n\tconvert.RegisterConverter(\"0.4.0\", supportedVersions, convertFrom04x)\n\n\t// Down-converters\n\tconvert.RegisterConverter(\"1.0.0\", []string{\"0.3.0\", \"0.3.1\", \"0.4.0\"}, convertTo04x)\n\tconvert.RegisterConverter(\"1.0.0\", []string{\"0.1.0\", \"0.2.0\"}, convertTo02x)\n\n\t// Creator\n\tconvert.RegisterCreator(supportedVersions, NewResult)\n}\n\nfunc NewResult(data []byte) (types.Result, error) {\n\tresult := &Result{}\n\tif err := json.Unmarshal(data, result); err != nil {\n\t\treturn nil, err\n\t}\n\tfor _, v := range supportedVersions {\n\t\tif result.CNIVersion == v {\n\t\t\treturn result, nil\n\t\t}\n\t}\n\treturn nil, fmt.Errorf(\"result type supports %v but unmarshalled CNIVersion is %q\",\n\t\tsupportedVersions, result.CNIVersion)\n}\n\nfunc GetResult(r types.Result) (*Result, error) {\n\tresultCurrent, err := r.GetAsVersion(ImplementedSpecVersion)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tresult, ok := resultCurrent.(*Result)\n\tif !ok {\n\t\treturn nil, fmt.Errorf(\"failed to convert result\")\n\t}\n\treturn result, nil\n}\n\nfunc NewResultFromResult(result types.Result) (*Result, error) {\n\tnewResult, err := convert.Convert(result, ImplementedSpecVersion)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn newResult.(*Result), nil\n}\n\n// Result is what gets returned from the plugin (via stdout) to the caller\ntype Result struct {\n\tCNIVersion string `json:\"cniVersion,omitempty\"`\n\tInterfaces []*Interface `json:\"interfaces,omitempty\"`\n\tIPs []*IPConfig `json:\"ips,omitempty\"`\n\tRoutes []*types.Route `json:\"routes,omitempty\"`\n\tDNS types.DNS `json:\"dns,omitempty\"`\n}\n\nfunc convertFrom02x(from types.Result, toVersion string) (types.Result, error) {\n\tresult040, err := convert.Convert(from, \"0.4.0\")\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tresult100, err := convertFrom04x(result040, ImplementedSpecVersion)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn result100, nil\n}\n\nfunc convertIPConfigFrom040(from *types040.IPConfig) *IPConfig {\n\tto := &IPConfig{\n\t\tAddress: from.Address,\n\t\tGateway: from.Gateway,\n\t}\n\tif from.Interface != nil {\n\t\tintf := *from.Interface\n\t\tto.Interface = &intf\n\t}\n\treturn to\n}\n\nfunc convertInterfaceFrom040(from *types040.Interface) *Interface {\n\treturn &Interface{\n\t\tName: from.Name,\n\t\tMac: from.Mac,\n\t\tSandbox: from.Sandbox,\n\t}\n}\n\nfunc convertFrom04x(from types.Result, toVersion string) (types.Result, error) {\n\tfromResult := from.(*types040.Result)\n\ttoResult := &Result{\n\t\tCNIVersion: toVersion,\n\t\tDNS: *fromResult.DNS.Copy(),\n\t\tRoutes: []*types.Route{},\n\t}\n\tfor _, fromIntf := range fromResult.Interfaces {\n\t\ttoResult.Interfaces = append(toResult.Interfaces, convertInterfaceFrom040(fromIntf))\n\t}\n\tfor _, fromIPC := range fromResult.IPs {\n\t\ttoResult.IPs = append(toResult.IPs, convertIPConfigFrom040(fromIPC))\n\t}\n\tfor _, fromRoute := range fromResult.Routes {\n\t\ttoResult.Routes = append(toResult.Routes, fromRoute.Copy())\n\t}\n\treturn toResult, nil\n}\n\nfunc convertIPConfigTo040(from *IPConfig) *types040.IPConfig {\n\tversion := \"6\"\n\tif from.Address.IP.To4() != nil {\n\t\tversion = \"4\"\n\t}\n\tto := &types040.IPConfig{\n\t\tVersion: version,\n\t\tAddress: from.Address,\n\t\tGateway: from.Gateway,\n\t}\n\tif from.Interface != nil {\n\t\tintf := *from.Interface\n\t\tto.Interface = &intf\n\t}\n\treturn to\n}\n\nfunc convertInterfaceTo040(from *Interface) *types040.Interface {\n\treturn &types040.Interface{\n\t\tName: from.Name,\n\t\tMac: from.Mac,\n\t\tSandbox: from.Sandbox,\n\t}\n}\n\nfunc convertTo04x(from types.Result, toVersion string) (types.Result, error) {\n\tfromResult := from.(*Result)\n\ttoResult := &types040.Result{\n\t\tCNIVersion: toVersion,\n\t\tDNS: *fromResult.DNS.Copy(),\n\t\tRoutes: []*types.Route{},\n\t}\n\tfor _, fromIntf := range fromResult.Interfaces {\n\t\ttoResult.Interfaces = append(toResult.Interfaces, convertInterfaceTo040(fromIntf))\n\t}\n\tfor _, fromIPC := range fromResult.IPs {\n\t\ttoResult.IPs = append(toResult.IPs, convertIPConfigTo040(fromIPC))\n\t}\n\tfor _, fromRoute := range fromResult.Routes {\n\t\ttoResult.Routes = append(toResult.Routes, fromRoute.Copy())\n\t}\n\treturn toResult, nil\n}\n\nfunc convertTo02x(from types.Result, toVersion string) (types.Result, error) {\n\t// First convert to 0.4.0\n\tresult040, err := convertTo04x(from, \"0.4.0\")\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tresult02x, err := convert.Convert(result040, toVersion)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn result02x, nil\n}\n\nfunc (r *Result) Version() string {\n\treturn r.CNIVersion\n}\n\nfunc (r *Result) GetAsVersion(version string) (types.Result, error) {\n\t// If the creator of the result did not set the CNIVersion, assume it\n\t// should be the highest spec version implemented by this Result\n\tif r.CNIVersion == \"\" {\n\t\tr.CNIVersion = ImplementedSpecVersion\n\t}\n\treturn convert.Convert(r, version)\n}\n\nfunc (r *Result) Print() error {\n\treturn r.PrintTo(os.Stdout)\n}\n\nfunc (r *Result) PrintTo(writer io.Writer) error {\n\tdata, err := json.MarshalIndent(r, \"\", \" \")\n\tif err != nil {\n\t\treturn err\n\t}\n\t_, err = writer.Write(data)\n\treturn err\n}\n\n// Interface contains values about the created interfaces\ntype Interface struct {\n\tName string `json:\"name\"`\n\tMac string `json:\"mac,omitempty\"`\n\tSandbox string `json:\"sandbox,omitempty\"`\n}\n\nfunc (i *Interface) String() string {\n\treturn fmt.Sprintf(\"%+v\", *i)\n}\n\nfunc (i *Interface) Copy() *Interface {\n\tif i == nil {\n\t\treturn nil\n\t}\n\tnewIntf := *i\n\treturn &newIntf\n}\n\n// Int returns a pointer to the int value passed in. Used to\n// set the IPConfig.Interface field.\nfunc Int(v int) *int {\n\treturn &v\n}\n\n// IPConfig contains values necessary to configure an IP address on an interface\ntype IPConfig struct {\n\t// Index into Result structs Interfaces list\n\tInterface *int\n\tAddress net.IPNet\n\tGateway net.IP\n}\n\nfunc (i *IPConfig) String() string {\n\treturn fmt.Sprintf(\"%+v\", *i)\n}\n\nfunc (i *IPConfig) Copy() *IPConfig {\n\tif i == nil {\n\t\treturn nil\n\t}\n\n\tipc := &IPConfig{\n\t\tAddress: i.Address,\n\t\tGateway: i.Gateway,\n\t}\n\tif i.Interface != nil {\n\t\tintf := *i.Interface\n\t\tipc.Interface = &intf\n\t}\n\treturn ipc\n}\n\n// JSON (un)marshallable types\ntype ipConfig struct {\n\tInterface *int `json:\"interface,omitempty\"`\n\tAddress types.IPNet `json:\"address\"`\n\tGateway net.IP `json:\"gateway,omitempty\"`\n}\n\nfunc (c *IPConfig) MarshalJSON() ([]byte, error) {\n\tipc := ipConfig{\n\t\tInterface: c.Interface,\n\t\tAddress: types.IPNet(c.Address),\n\t\tGateway: c.Gateway,\n\t}\n\n\treturn json.Marshal(ipc)\n}\n\nfunc (c *IPConfig) UnmarshalJSON(data []byte) error {\n\tipc := ipConfig{}\n\tif err := json.Unmarshal(data, &ipc); err != nil {\n\t\treturn err\n\t}\n\n\tc.Interface = ipc.Interface\n\tc.Address = net.IPNet(ipc.Address)\n\tc.Gateway = ipc.Gateway\n\treturn nil\n}\n" }, { "path": "vendor/github.com/containernetworking/cni/pkg/types/args.go", "content": "// Copyright 2015 CNI authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage types\n\nimport (\n\t\"encoding\"\n\t\"fmt\"\n\t\"reflect\"\n\t\"strings\"\n)\n\n// UnmarshallableBool typedef for builtin bool\n// because builtin type's methods can't be declared\ntype UnmarshallableBool bool\n\n// UnmarshalText implements the encoding.TextUnmarshaler interface.\n// Returns boolean true if the string is \"1\" or \"[Tt]rue\"\n// Returns boolean false if the string is \"0\" or \"[Ff]alse\"\nfunc (b *UnmarshallableBool) UnmarshalText(data []byte) error {\n\ts := strings.ToLower(string(data))\n\tswitch s {\n\tcase \"1\", \"true\":\n\t\t*b = true\n\tcase \"0\", \"false\":\n\t\t*b = false\n\tdefault:\n\t\treturn fmt.Errorf(\"boolean unmarshal error: invalid input %s\", s)\n\t}\n\treturn nil\n}\n\n// UnmarshallableString typedef for builtin string\ntype UnmarshallableString string\n\n// UnmarshalText implements the encoding.TextUnmarshaler interface.\n// Returns the string\nfunc (s *UnmarshallableString) UnmarshalText(data []byte) error {\n\t*s = UnmarshallableString(data)\n\treturn nil\n}\n\n// CommonArgs contains the IgnoreUnknown argument\n// and must be embedded by all Arg structs\ntype CommonArgs struct {\n\tIgnoreUnknown UnmarshallableBool `json:\"ignoreunknown,omitempty\"`\n}\n\n// GetKeyField is a helper function to receive Values\n// Values that represent a pointer to a struct\nfunc GetKeyField(keyString string, v reflect.Value) reflect.Value {\n\treturn v.Elem().FieldByName(keyString)\n}\n\n// UnmarshalableArgsError is used to indicate error unmarshalling args\n// from the args-string in the form \"K=V;K2=V2;...\"\ntype UnmarshalableArgsError struct {\n\terror\n}\n\n// LoadArgs parses args from a string in the form \"K=V;K2=V2;...\"\nfunc LoadArgs(args string, container interface{}) error {\n\tif args == \"\" {\n\t\treturn nil\n\t}\n\n\tcontainerValue := reflect.ValueOf(container)\n\n\tpairs := strings.Split(args, \";\")\n\tunknownArgs := []string{}\n\tfor _, pair := range pairs {\n\t\tkv := strings.Split(pair, \"=\")\n\t\tif len(kv) != 2 {\n\t\t\treturn fmt.Errorf(\"ARGS: invalid pair %q\", pair)\n\t\t}\n\t\tkeyString := kv[0]\n\t\tvalueString := kv[1]\n\t\tkeyField := GetKeyField(keyString, containerValue)\n\t\tif !keyField.IsValid() {\n\t\t\tunknownArgs = append(unknownArgs, pair)\n\t\t\tcontinue\n\t\t}\n\n\t\tvar keyFieldInterface interface{}\n\t\tswitch {\n\t\tcase keyField.Kind() == reflect.Ptr:\n\t\t\tkeyField.Set(reflect.New(keyField.Type().Elem()))\n\t\t\tkeyFieldInterface = keyField.Interface()\n\t\tcase keyField.CanAddr() && keyField.Addr().CanInterface():\n\t\t\tkeyFieldInterface = keyField.Addr().Interface()\n\t\tdefault:\n\t\t\treturn UnmarshalableArgsError{fmt.Errorf(\"field '%s' has no valid interface\", keyString)}\n\t\t}\n\t\tu, ok := keyFieldInterface.(encoding.TextUnmarshaler)\n\t\tif !ok {\n\t\t\treturn UnmarshalableArgsError{fmt.Errorf(\n\t\t\t\t\"ARGS: cannot unmarshal into field '%s' - type '%s' does not implement encoding.TextUnmarshaler\",\n\t\t\t\tkeyString, reflect.TypeOf(keyFieldInterface))}\n\t\t}\n\t\terr := u.UnmarshalText([]byte(valueString))\n\t\tif err != nil {\n\t\t\treturn fmt.Errorf(\"ARGS: error parsing value of pair %q: %w\", pair, err)\n\t\t}\n\t}\n\n\tisIgnoreUnknown := GetKeyField(\"IgnoreUnknown\", containerValue).Bool()\n\tif len(unknownArgs) > 0 && !isIgnoreUnknown {\n\t\treturn fmt.Errorf(\"ARGS: unknown args %q\", unknownArgs)\n\t}\n\treturn nil\n}\n" }, { "path": "vendor/github.com/containernetworking/cni/pkg/types/create/create.go", "content": "// Copyright 2016 CNI authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage create\n\nimport (\n\t\"encoding/json\"\n\t\"fmt\"\n\n\t\"github.com/containernetworking/cni/pkg/types\"\n\tconvert \"github.com/containernetworking/cni/pkg/types/internal\"\n)\n\n// DecodeVersion returns the CNI version from CNI configuration or result JSON,\n// or an error if the operation could not be performed.\nfunc DecodeVersion(jsonBytes []byte) (string, error) {\n\tvar conf struct {\n\t\tCNIVersion string `json:\"cniVersion\"`\n\t}\n\terr := json.Unmarshal(jsonBytes, &conf)\n\tif err != nil {\n\t\treturn \"\", fmt.Errorf(\"decoding version from network config: %w\", err)\n\t}\n\tif conf.CNIVersion == \"\" {\n\t\treturn \"0.1.0\", nil\n\t}\n\treturn conf.CNIVersion, nil\n}\n\n// Create creates a CNI Result using the given JSON with the expected\n// version, or an error if the creation could not be performed\nfunc Create(version string, bytes []byte) (types.Result, error) {\n\treturn convert.Create(version, bytes)\n}\n\n// CreateFromBytes creates a CNI Result from the given JSON, automatically\n// detecting the CNI spec version of the result. An error is returned if the\n// operation could not be performed.\nfunc CreateFromBytes(bytes []byte) (types.Result, error) {\n\tversion, err := DecodeVersion(bytes)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn convert.Create(version, bytes)\n}\n" }, { "path": "vendor/github.com/containernetworking/cni/pkg/types/internal/convert.go", "content": "// Copyright 2016 CNI authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage convert\n\nimport (\n\t\"fmt\"\n\n\t\"github.com/containernetworking/cni/pkg/types\"\n)\n\n// ConvertFn should convert from the given arbitrary Result type into a\n// Result implementing CNI specification version passed in toVersion.\n// The function is guaranteed to be passed a Result type matching the\n// fromVersion it was registered with, and is guaranteed to be\n// passed a toVersion matching one of the toVersions it was registered with.\ntype ConvertFn func(from types.Result, toVersion string) (types.Result, error)\n\ntype converter struct {\n\t// fromVersion is the CNI Result spec version that convertFn accepts\n\tfromVersion string\n\t// toVersions is a list of versions that convertFn can convert to\n\ttoVersions []string\n\tconvertFn ConvertFn\n}\n\nvar converters []*converter\n\nfunc findConverter(fromVersion, toVersion string) *converter {\n\tfor _, c := range converters {\n\t\tif c.fromVersion == fromVersion {\n\t\t\tfor _, v := range c.toVersions {\n\t\t\t\tif v == toVersion {\n\t\t\t\t\treturn c\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn nil\n}\n\n// Convert converts a CNI Result to the requested CNI specification version,\n// or returns an error if the conversion could not be performed or failed\nfunc Convert(from types.Result, toVersion string) (types.Result, error) {\n\tif toVersion == \"\" {\n\t\ttoVersion = \"0.1.0\"\n\t}\n\n\tfromVersion := from.Version()\n\n\t// Shortcut for same version\n\tif fromVersion == toVersion {\n\t\treturn from, nil\n\t}\n\n\t// Otherwise find the right converter\n\tc := findConverter(fromVersion, toVersion)\n\tif c == nil {\n\t\treturn nil, fmt.Errorf(\"no converter for CNI result version %s to %s\",\n\t\t\tfromVersion, toVersion)\n\t}\n\treturn c.convertFn(from, toVersion)\n}\n\n// RegisterConverter registers a CNI Result converter. SHOULD NOT BE CALLED\n// EXCEPT FROM CNI ITSELF.\nfunc RegisterConverter(fromVersion string, toVersions []string, convertFn ConvertFn) {\n\t// Make sure there is no converter already registered for these\n\t// from and to versions\n\tfor _, v := range toVersions {\n\t\tif findConverter(fromVersion, v) != nil {\n\t\t\tpanic(fmt.Sprintf(\"converter already registered for %s to %s\",\n\t\t\t\tfromVersion, v))\n\t\t}\n\t}\n\tconverters = append(converters, &converter{\n\t\tfromVersion: fromVersion,\n\t\ttoVersions: toVersions,\n\t\tconvertFn: convertFn,\n\t})\n}\n" }, { "path": "vendor/github.com/containernetworking/cni/pkg/types/internal/create.go", "content": "// Copyright 2016 CNI authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage convert\n\nimport (\n\t\"fmt\"\n\n\t\"github.com/containernetworking/cni/pkg/types\"\n)\n\ntype ResultFactoryFunc func([]byte) (types.Result, error)\n\ntype creator struct {\n\t// CNI Result spec versions that createFn can create a Result for\n\tversions []string\n\tcreateFn ResultFactoryFunc\n}\n\nvar creators []*creator\n\nfunc findCreator(version string) *creator {\n\tfor _, c := range creators {\n\t\tfor _, v := range c.versions {\n\t\t\tif v == version {\n\t\t\t\treturn c\n\t\t\t}\n\t\t}\n\t}\n\treturn nil\n}\n\n// Create creates a CNI Result using the given JSON, or an error if the creation\n// could not be performed\nfunc Create(version string, bytes []byte) (types.Result, error) {\n\tif c := findCreator(version); c != nil {\n\t\treturn c.createFn(bytes)\n\t}\n\treturn nil, fmt.Errorf(\"unsupported CNI result version %q\", version)\n}\n\n// RegisterCreator registers a CNI Result creator. SHOULD NOT BE CALLED\n// EXCEPT FROM CNI ITSELF.\nfunc RegisterCreator(versions []string, createFn ResultFactoryFunc) {\n\t// Make sure there is no creator already registered for these versions\n\tfor _, v := range versions {\n\t\tif findCreator(v) != nil {\n\t\t\tpanic(fmt.Sprintf(\"creator already registered for %s\", v))\n\t\t}\n\t}\n\tcreators = append(creators, &creator{\n\t\tversions: versions,\n\t\tcreateFn: createFn,\n\t})\n}\n" }, { "path": "vendor/github.com/containernetworking/cni/pkg/types/types.go", "content": "// Copyright 2015 CNI authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage types\n\nimport (\n\t\"encoding/json\"\n\t\"fmt\"\n\t\"io\"\n\t\"net\"\n\t\"os\"\n)\n\n// like net.IPNet but adds JSON marshalling and unmarshalling\ntype IPNet net.IPNet\n\n// ParseCIDR takes a string like \"10.2.3.1/24\" and\n// return IPNet with \"10.2.3.1\" and /24 mask\nfunc ParseCIDR(s string) (*net.IPNet, error) {\n\tip, ipn, err := net.ParseCIDR(s)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tipn.IP = ip\n\treturn ipn, nil\n}\n\nfunc (n IPNet) MarshalJSON() ([]byte, error) {\n\treturn json.Marshal((*net.IPNet)(&n).String())\n}\n\nfunc (n *IPNet) UnmarshalJSON(data []byte) error {\n\tvar s string\n\tif err := json.Unmarshal(data, &s); err != nil {\n\t\treturn err\n\t}\n\n\ttmp, err := ParseCIDR(s)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\t*n = IPNet(*tmp)\n\treturn nil\n}\n\n// NetConf describes a network.\ntype NetConf struct {\n\tCNIVersion string `json:\"cniVersion,omitempty\"`\n\n\tName string `json:\"name,omitempty\"`\n\tType string `json:\"type,omitempty\"`\n\tCapabilities map[string]bool `json:\"capabilities,omitempty\"`\n\tIPAM IPAM `json:\"ipam,omitempty\"`\n\tDNS DNS `json:\"dns\"`\n\n\tRawPrevResult map[string]interface{} `json:\"prevResult,omitempty\"`\n\tPrevResult Result `json:\"-\"`\n}\n\ntype IPAM struct {\n\tType string `json:\"type,omitempty\"`\n}\n\n// NetConfList describes an ordered list of networks.\ntype NetConfList struct {\n\tCNIVersion string `json:\"cniVersion,omitempty\"`\n\n\tName string `json:\"name,omitempty\"`\n\tDisableCheck bool `json:\"disableCheck,omitempty\"`\n\tPlugins []*NetConf `json:\"plugins,omitempty\"`\n}\n\n// Result is an interface that provides the result of plugin execution\ntype Result interface {\n\t// The highest CNI specification result version the result supports\n\t// without having to convert\n\tVersion() string\n\n\t// Returns the result converted into the requested CNI specification\n\t// result version, or an error if conversion failed\n\tGetAsVersion(version string) (Result, error)\n\n\t// Prints the result in JSON format to stdout\n\tPrint() error\n\n\t// Prints the result in JSON format to provided writer\n\tPrintTo(writer io.Writer) error\n}\n\nfunc PrintResult(result Result, version string) error {\n\tnewResult, err := result.GetAsVersion(version)\n\tif err != nil {\n\t\treturn err\n\t}\n\treturn newResult.Print()\n}\n\n// DNS contains values interesting for DNS resolvers\ntype DNS struct {\n\tNameservers []string `json:\"nameservers,omitempty\"`\n\tDomain string `json:\"domain,omitempty\"`\n\tSearch []string `json:\"search,omitempty\"`\n\tOptions []string `json:\"options,omitempty\"`\n}\n\nfunc (d *DNS) Copy() *DNS {\n\tif d == nil {\n\t\treturn nil\n\t}\n\n\tto := &DNS{Domain: d.Domain}\n\tfor _, ns := range d.Nameservers {\n\t\tto.Nameservers = append(to.Nameservers, ns)\n\t}\n\tfor _, s := range d.Search {\n\t\tto.Search = append(to.Search, s)\n\t}\n\tfor _, o := range d.Options {\n\t\tto.Options = append(to.Options, o)\n\t}\n\treturn to\n}\n\ntype Route struct {\n\tDst net.IPNet\n\tGW net.IP\n}\n\nfunc (r *Route) String() string {\n\treturn fmt.Sprintf(\"%+v\", *r)\n}\n\nfunc (r *Route) Copy() *Route {\n\tif r == nil {\n\t\treturn nil\n\t}\n\n\treturn &Route{\n\t\tDst: r.Dst,\n\t\tGW: r.GW,\n\t}\n}\n\n// Well known error codes\n// see https://github.com/containernetworking/cni/blob/master/SPEC.md#well-known-error-codes\nconst (\n\tErrUnknown uint = iota // 0\n\tErrIncompatibleCNIVersion // 1\n\tErrUnsupportedField // 2\n\tErrUnknownContainer // 3\n\tErrInvalidEnvironmentVariables // 4\n\tErrIOFailure // 5\n\tErrDecodingFailure // 6\n\tErrInvalidNetworkConfig // 7\n\tErrTryAgainLater uint = 11\n\tErrInternal uint = 999\n)\n\ntype Error struct {\n\tCode uint `json:\"code\"`\n\tMsg string `json:\"msg\"`\n\tDetails string `json:\"details,omitempty\"`\n}\n\nfunc NewError(code uint, msg, details string) *Error {\n\treturn &Error{\n\t\tCode: code,\n\t\tMsg: msg,\n\t\tDetails: details,\n\t}\n}\n\nfunc (e *Error) Error() string {\n\tdetails := \"\"\n\tif e.Details != \"\" {\n\t\tdetails = fmt.Sprintf(\"; %v\", e.Details)\n\t}\n\treturn fmt.Sprintf(\"%v%v\", e.Msg, details)\n}\n\nfunc (e *Error) Print() error {\n\treturn prettyPrint(e)\n}\n\n// net.IPNet is not JSON (un)marshallable so this duality is needed\n// for our custom IPNet type\n\n// JSON (un)marshallable types\ntype route struct {\n\tDst IPNet `json:\"dst\"`\n\tGW net.IP `json:\"gw,omitempty\"`\n}\n\nfunc (r *Route) UnmarshalJSON(data []byte) error {\n\trt := route{}\n\tif err := json.Unmarshal(data, &rt); err != nil {\n\t\treturn err\n\t}\n\n\tr.Dst = net.IPNet(rt.Dst)\n\tr.GW = rt.GW\n\treturn nil\n}\n\nfunc (r Route) MarshalJSON() ([]byte, error) {\n\trt := route{\n\t\tDst: IPNet(r.Dst),\n\t\tGW: r.GW,\n\t}\n\n\treturn json.Marshal(rt)\n}\n\nfunc prettyPrint(obj interface{}) error {\n\tdata, err := json.MarshalIndent(obj, \"\", \" \")\n\tif err != nil {\n\t\treturn err\n\t}\n\t_, err = os.Stdout.Write(data)\n\treturn err\n}\n" }, { "path": "vendor/github.com/containernetworking/cni/pkg/utils/utils.go", "content": "// Copyright 2019 CNI authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage utils\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n\t\"regexp\"\n\t\"unicode\"\n\n\t\"github.com/containernetworking/cni/pkg/types\"\n)\n\nconst (\n\t// cniValidNameChars is the regexp used to validate valid characters in\n\t// containerID and networkName\n\tcniValidNameChars = `[a-zA-Z0-9][a-zA-Z0-9_.\\-]`\n\n\t// maxInterfaceNameLength is the length max of a valid interface name\n\tmaxInterfaceNameLength = 15\n)\n\nvar cniReg = regexp.MustCompile(`^` + cniValidNameChars + `*$`)\n\n// ValidateContainerID will validate that the supplied containerID is not empty does not contain invalid characters\nfunc ValidateContainerID(containerID string) *types.Error {\n\n\tif containerID == \"\" {\n\t\treturn types.NewError(types.ErrUnknownContainer, \"missing containerID\", \"\")\n\t}\n\tif !cniReg.MatchString(containerID) {\n\t\treturn types.NewError(types.ErrInvalidEnvironmentVariables, \"invalid characters in containerID\", containerID)\n\t}\n\treturn nil\n}\n\n// ValidateNetworkName will validate that the supplied networkName does not contain invalid characters\nfunc ValidateNetworkName(networkName string) *types.Error {\n\n\tif networkName == \"\" {\n\t\treturn types.NewError(types.ErrInvalidNetworkConfig, \"missing network name:\", \"\")\n\t}\n\tif !cniReg.MatchString(networkName) {\n\t\treturn types.NewError(types.ErrInvalidNetworkConfig, \"invalid characters found in network name\", networkName)\n\t}\n\treturn nil\n}\n\n// ValidateInterfaceName will validate the interface name based on the three rules below\n// 1. The name must not be empty\n// 2. The name must be less than 16 characters\n// 3. The name must not be \".\" or \"..\"\n// 3. The name must not contain / or : or any whitespace characters\n// ref to https://github.com/torvalds/linux/blob/master/net/core/dev.c#L1024\nfunc ValidateInterfaceName(ifName string) *types.Error {\n\tif len(ifName) == 0 {\n\t\treturn types.NewError(types.ErrInvalidEnvironmentVariables, \"interface name is empty\", \"\")\n\t}\n\tif len(ifName) > maxInterfaceNameLength {\n\t\treturn types.NewError(types.ErrInvalidEnvironmentVariables, \"interface name is too long\", fmt.Sprintf(\"interface name should be less than %d characters\", maxInterfaceNameLength+1))\n\t}\n\tif ifName == \".\" || ifName == \"..\" {\n\t\treturn types.NewError(types.ErrInvalidEnvironmentVariables, \"interface name is . or ..\", \"\")\n\t}\n\tfor _, r := range bytes.Runes([]byte(ifName)) {\n\t\tif r == '/' || r == ':' || unicode.IsSpace(r) {\n\t\t\treturn types.NewError(types.ErrInvalidEnvironmentVariables, \"interface name contains / or : or whitespace characters\", \"\")\n\t\t}\n\t}\n\n\treturn nil\n}\n" }, { "path": "vendor/github.com/containernetworking/cni/pkg/version/conf.go", "content": "// Copyright 2016 CNI authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage version\n\nimport (\n\t\"github.com/containernetworking/cni/pkg/types/create\"\n)\n\n// ConfigDecoder can decode the CNI version available in network config data\ntype ConfigDecoder struct{}\n\nfunc (*ConfigDecoder) Decode(jsonBytes []byte) (string, error) {\n\treturn create.DecodeVersion(jsonBytes)\n}\n" }, { "path": "vendor/github.com/containernetworking/cni/pkg/version/plugin.go", "content": "// Copyright 2016 CNI authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage version\n\nimport (\n\t\"encoding/json\"\n\t\"fmt\"\n\t\"io\"\n\t\"strconv\"\n\t\"strings\"\n)\n\n// PluginInfo reports information about CNI versioning\ntype PluginInfo interface {\n\t// SupportedVersions returns one or more CNI spec versions that the plugin\n\t// supports. If input is provided in one of these versions, then the plugin\n\t// promises to use the same CNI version in its response\n\tSupportedVersions() []string\n\n\t// Encode writes this CNI version information as JSON to the given Writer\n\tEncode(io.Writer) error\n}\n\ntype pluginInfo struct {\n\tCNIVersion_ string `json:\"cniVersion\"`\n\tSupportedVersions_ []string `json:\"supportedVersions,omitempty\"`\n}\n\n// pluginInfo implements the PluginInfo interface\nvar _ PluginInfo = &pluginInfo{}\n\nfunc (p *pluginInfo) Encode(w io.Writer) error {\n\treturn json.NewEncoder(w).Encode(p)\n}\n\nfunc (p *pluginInfo) SupportedVersions() []string {\n\treturn p.SupportedVersions_\n}\n\n// PluginSupports returns a new PluginInfo that will report the given versions\n// as supported\nfunc PluginSupports(supportedVersions ...string) PluginInfo {\n\tif len(supportedVersions) < 1 {\n\t\tpanic(\"programmer error: you must support at least one version\")\n\t}\n\treturn &pluginInfo{\n\t\tCNIVersion_: Current(),\n\t\tSupportedVersions_: supportedVersions,\n\t}\n}\n\n// PluginDecoder can decode the response returned by a plugin's VERSION command\ntype PluginDecoder struct{}\n\nfunc (*PluginDecoder) Decode(jsonBytes []byte) (PluginInfo, error) {\n\tvar info pluginInfo\n\terr := json.Unmarshal(jsonBytes, &info)\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"decoding version info: %w\", err)\n\t}\n\tif info.CNIVersion_ == \"\" {\n\t\treturn nil, fmt.Errorf(\"decoding version info: missing field cniVersion\")\n\t}\n\tif len(info.SupportedVersions_) == 0 {\n\t\tif info.CNIVersion_ == \"0.2.0\" {\n\t\t\treturn PluginSupports(\"0.1.0\", \"0.2.0\"), nil\n\t\t}\n\t\treturn nil, fmt.Errorf(\"decoding version info: missing field supportedVersions\")\n\t}\n\treturn &info, nil\n}\n\n// ParseVersion parses a version string like \"3.0.1\" or \"0.4.5\" into major,\n// minor, and micro numbers or returns an error\nfunc ParseVersion(version string) (int, int, int, error) {\n\tvar major, minor, micro int\n\tif version == \"\" { // special case: no version declared == v0.1.0\n\t\treturn 0, 1, 0, nil\n\t}\n\n\tparts := strings.Split(version, \".\")\n\tif len(parts) >= 4 {\n\t\treturn -1, -1, -1, fmt.Errorf(\"invalid version %q: too many parts\", version)\n\t}\n\n\tmajor, err := strconv.Atoi(parts[0])\n\tif err != nil {\n\t\treturn -1, -1, -1, fmt.Errorf(\"failed to convert major version part %q: %w\", parts[0], err)\n\t}\n\n\tif len(parts) >= 2 {\n\t\tminor, err = strconv.Atoi(parts[1])\n\t\tif err != nil {\n\t\t\treturn -1, -1, -1, fmt.Errorf(\"failed to convert minor version part %q: %w\", parts[1], err)\n\t\t}\n\t}\n\n\tif len(parts) >= 3 {\n\t\tmicro, err = strconv.Atoi(parts[2])\n\t\tif err != nil {\n\t\t\treturn -1, -1, -1, fmt.Errorf(\"failed to convert micro version part %q: %w\", parts[2], err)\n\t\t}\n\t}\n\n\treturn major, minor, micro, nil\n}\n\n// GreaterThanOrEqualTo takes two string versions, parses them into major/minor/micro\n// numbers, and compares them to determine whether the first version is greater\n// than or equal to the second\nfunc GreaterThanOrEqualTo(version, otherVersion string) (bool, error) {\n\tfirstMajor, firstMinor, firstMicro, err := ParseVersion(version)\n\tif err != nil {\n\t\treturn false, err\n\t}\n\n\tsecondMajor, secondMinor, secondMicro, err := ParseVersion(otherVersion)\n\tif err != nil {\n\t\treturn false, err\n\t}\n\n\tif firstMajor > secondMajor {\n\t\treturn true, nil\n\t} else if firstMajor == secondMajor {\n\t\tif firstMinor > secondMinor {\n\t\t\treturn true, nil\n\t\t} else if firstMinor == secondMinor && firstMicro >= secondMicro {\n\t\t\treturn true, nil\n\t\t}\n\t}\n\treturn false, nil\n}\n" }, { "path": "vendor/github.com/containernetworking/cni/pkg/version/reconcile.go", "content": "// Copyright 2016 CNI authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage version\n\nimport \"fmt\"\n\ntype ErrorIncompatible struct {\n\tConfig string\n\tSupported []string\n}\n\nfunc (e *ErrorIncompatible) Details() string {\n\treturn fmt.Sprintf(\"config is %q, plugin supports %q\", e.Config, e.Supported)\n}\n\nfunc (e *ErrorIncompatible) Error() string {\n\treturn fmt.Sprintf(\"incompatible CNI versions: %s\", e.Details())\n}\n\ntype Reconciler struct{}\n\nfunc (r *Reconciler) Check(configVersion string, pluginInfo PluginInfo) *ErrorIncompatible {\n\treturn r.CheckRaw(configVersion, pluginInfo.SupportedVersions())\n}\n\nfunc (*Reconciler) CheckRaw(configVersion string, supportedVersions []string) *ErrorIncompatible {\n\tfor _, supportedVersion := range supportedVersions {\n\t\tif configVersion == supportedVersion {\n\t\t\treturn nil\n\t\t}\n\t}\n\n\treturn &ErrorIncompatible{\n\t\tConfig: configVersion,\n\t\tSupported: supportedVersions,\n\t}\n}\n" }, { "path": "vendor/github.com/containernetworking/cni/pkg/version/version.go", "content": "// Copyright 2016 CNI authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage version\n\nimport (\n\t\"encoding/json\"\n\t\"fmt\"\n\n\t\"github.com/containernetworking/cni/pkg/types\"\n\ttypes100 \"github.com/containernetworking/cni/pkg/types/100\"\n\t\"github.com/containernetworking/cni/pkg/types/create\"\n)\n\n// Current reports the version of the CNI spec implemented by this library\nfunc Current() string {\n\treturn types100.ImplementedSpecVersion\n}\n\n// Legacy PluginInfo describes a plugin that is backwards compatible with the\n// CNI spec version 0.1.0. In particular, a runtime compiled against the 0.1.0\n// library ought to work correctly with a plugin that reports support for\n// Legacy versions.\n//\n// Any future CNI spec versions which meet this definition should be added to\n// this list.\nvar Legacy = PluginSupports(\"0.1.0\", \"0.2.0\")\nvar All = PluginSupports(\"0.1.0\", \"0.2.0\", \"0.3.0\", \"0.3.1\", \"0.4.0\", \"1.0.0\")\n\n// VersionsFrom returns a list of versions starting from min, inclusive\nfunc VersionsStartingFrom(min string) PluginInfo {\n\tout := []string{}\n\t// cheat, just assume ordered\n\tok := false\n\tfor _, v := range All.SupportedVersions() {\n\t\tif !ok && v == min {\n\t\t\tok = true\n\t\t}\n\t\tif ok {\n\t\t\tout = append(out, v)\n\t\t}\n\t}\n\treturn PluginSupports(out...)\n}\n\n// Finds a Result object matching the requested version (if any) and asks\n// that object to parse the plugin result, returning an error if parsing failed.\nfunc NewResult(version string, resultBytes []byte) (types.Result, error) {\n\treturn create.Create(version, resultBytes)\n}\n\n// ParsePrevResult parses a prevResult in a NetConf structure and sets\n// the NetConf's PrevResult member to the parsed Result object.\nfunc ParsePrevResult(conf *types.NetConf) error {\n\tif conf.RawPrevResult == nil {\n\t\treturn nil\n\t}\n\n\t// Prior to 1.0.0, Result types may not marshal a CNIVersion. Since the\n\t// result version must match the config version, if the Result's version\n\t// is empty, inject the config version.\n\tif ver, ok := conf.RawPrevResult[\"CNIVersion\"]; !ok || ver == \"\" {\n\t\tconf.RawPrevResult[\"CNIVersion\"] = conf.CNIVersion\n\t}\n\n\tresultBytes, err := json.Marshal(conf.RawPrevResult)\n\tif err != nil {\n\t\treturn fmt.Errorf(\"could not serialize prevResult: %w\", err)\n\t}\n\n\tconf.RawPrevResult = nil\n\tconf.PrevResult, err = create.Create(conf.CNIVersion, resultBytes)\n\tif err != nil {\n\t\treturn fmt.Errorf(\"could not parse prevResult: %w\", err)\n\t}\n\n\treturn nil\n}\n" }, { "path": "vendor/github.com/containernetworking/plugins/LICENSE", "content": " Apache License\n Version 2.0, January 2004\n http://www.apache.org/licenses/\n\n TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION\n\n 1. Definitions.\n\n \"License\" shall mean the terms and conditions for use, reproduction,\n and distribution as defined by Sections 1 through 9 of this document.\n\n \"Licensor\" shall mean the copyright owner or entity authorized by\n the copyright owner that is granting the License.\n\n \"Legal Entity\" shall mean the union of the acting entity and all\n other entities that control, are controlled by, or are under common\n control with that entity. For the purposes of this definition,\n \"control\" means (i) the power, direct or indirect, to cause the\n direction or management of such entity, whether by contract or\n otherwise, or (ii) ownership of fifty percent (50%) or more of the\n outstanding shares, or (iii) beneficial ownership of such entity.\n\n \"You\" (or \"Your\") shall mean an individual or Legal Entity\n exercising permissions granted by this License.\n\n \"Source\" form shall mean the preferred form for making modifications,\n including but not limited to software source code, documentation\n source, and configuration files.\n\n \"Object\" form shall mean any form resulting from mechanical\n transformation or translation of a Source form, including but\n not limited to compiled object code, generated documentation,\n and conversions to other media types.\n\n \"Work\" shall mean the work of authorship, whether in Source or\n Object form, made available under the License, as indicated by a\n copyright notice that is included in or attached to the work\n (an example is provided in the Appendix below).\n\n \"Derivative Works\" shall mean any work, whether in Source or Object\n form, that is based on (or derived from) the Work and for which the\n editorial revisions, annotations, elaborations, or other modifications\n represent, as a whole, an original work of authorship. For the purposes\n of this License, Derivative Works shall not include works that remain\n separable from, or merely link (or bind by name) to the interfaces of,\n the Work and Derivative Works thereof.\n\n \"Contribution\" shall mean any work of authorship, including\n the original version of the Work and any modifications or additions\n to that Work or Derivative Works thereof, that is intentionally\n submitted to Licensor for inclusion in the Work by the copyright owner\n or by an individual or Legal Entity authorized to submit on behalf of\n the copyright owner. For the purposes of this definition, \"submitted\"\n means any form of electronic, verbal, or written communication sent\n to the Licensor or its representatives, including but not limited to\n communication on electronic mailing lists, source code control systems,\n and issue tracking systems that are managed by, or on behalf of, the\n Licensor for the purpose of discussing and improving the Work, but\n excluding communication that is conspicuously marked or otherwise\n designated in writing by the copyright owner as \"Not a Contribution.\"\n\n \"Contributor\" shall mean Licensor and any individual or Legal Entity\n on behalf of whom a Contribution has been received by Licensor and\n subsequently incorporated within the Work.\n\n 2. Grant of Copyright License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n copyright license to reproduce, prepare Derivative Works of,\n publicly display, publicly perform, sublicense, and distribute the\n Work and such Derivative Works in Source or Object form.\n\n 3. Grant of Patent License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n (except as stated in this section) patent license to make, have made,\n use, offer to sell, sell, import, and otherwise transfer the Work,\n where such license applies only to those patent claims licensable\n by such Contributor that are necessarily infringed by their\n Contribution(s) alone or by combination of their Contribution(s)\n with the Work to which such Contribution(s) was submitted. If You\n institute patent litigation against any entity (including a\n cross-claim or counterclaim in a lawsuit) alleging that the Work\n or a Contribution incorporated within the Work constitutes direct\n or contributory patent infringement, then any patent licenses\n granted to You under this License for that Work shall terminate\n as of the date such litigation is filed.\n\n 4. Redistribution. You may reproduce and distribute copies of the\n Work or Derivative Works thereof in any medium, with or without\n modifications, and in Source or Object form, provided that You\n meet the following conditions:\n\n (a) You must give any other recipients of the Work or\n Derivative Works a copy of this License; and\n\n (b) You must cause any modified files to carry prominent notices\n stating that You changed the files; and\n\n (c) You must retain, in the Source form of any Derivative Works\n that You distribute, all copyright, patent, trademark, and\n attribution notices from the Source form of the Work,\n excluding those notices that do not pertain to any part of\n the Derivative Works; and\n\n (d) If the Work includes a \"NOTICE\" text file as part of its\n distribution, then any Derivative Works that You distribute must\n include a readable copy of the attribution notices contained\n within such NOTICE file, excluding those notices that do not\n pertain to any part of the Derivative Works, in at least one\n of the following places: within a NOTICE text file distributed\n as part of the Derivative Works; within the Source form or\n documentation, if provided along with the Derivative Works; or,\n within a display generated by the Derivative Works, if and\n wherever such third-party notices normally appear. The contents\n of the NOTICE file are for informational purposes only and\n do not modify the License. You may add Your own attribution\n notices within Derivative Works that You distribute, alongside\n or as an addendum to the NOTICE text from the Work, provided\n that such additional attribution notices cannot be construed\n as modifying the License.\n\n You may add Your own copyright statement to Your modifications and\n may provide additional or different license terms and conditions\n for use, reproduction, or distribution of Your modifications, or\n for any such Derivative Works as a whole, provided Your use,\n reproduction, and distribution of the Work otherwise complies with\n the conditions stated in this License.\n\n 5. Submission of Contributions. Unless You explicitly state otherwise,\n any Contribution intentionally submitted for inclusion in the Work\n by You to the Licensor shall be under the terms and conditions of\n this License, without any additional terms or conditions.\n Notwithstanding the above, nothing herein shall supersede or modify\n the terms of any separate license agreement you may have executed\n with Licensor regarding such Contributions.\n\n 6. Trademarks. This License does not grant permission to use the trade\n names, trademarks, service marks, or product names of the Licensor,\n except as required for reasonable and customary use in describing the\n origin of the Work and reproducing the content of the NOTICE file.\n\n 7. Disclaimer of Warranty. Unless required by applicable law or\n agreed to in writing, Licensor provides the Work (and each\n Contributor provides its Contributions) on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\n implied, including, without limitation, any warranties or conditions\n of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A\n PARTICULAR PURPOSE. You are solely responsible for determining the\n appropriateness of using or redistributing the Work and assume any\n risks associated with Your exercise of permissions under this License.\n\n 8. Limitation of Liability. In no event and under no legal theory,\n whether in tort (including negligence), contract, or otherwise,\n unless required by applicable law (such as deliberate and grossly\n negligent acts) or agreed to in writing, shall any Contributor be\n liable to You for damages, including any direct, indirect, special,\n incidental, or consequential damages of any character arising as a\n result of this License or out of the use or inability to use the\n Work (including but not limited to damages for loss of goodwill,\n work stoppage, computer failure or malfunction, or any and all\n other commercial damages or losses), even if such Contributor\n has been advised of the possibility of such damages.\n\n 9. Accepting Warranty or Additional Liability. While redistributing\n the Work or Derivative Works thereof, You may choose to offer,\n and charge a fee for, acceptance of support, warranty, indemnity,\n or other liability obligations and/or rights consistent with this\n License. However, in accepting such obligations, You may act only\n on Your own behalf and on Your sole responsibility, not on behalf\n of any other Contributor, and only if You agree to indemnify,\n defend, and hold each Contributor harmless for any liability\n incurred by, or claims asserted against, such Contributor by reason\n of your accepting any such warranty or additional liability.\n\n END OF TERMS AND CONDITIONS\n\n APPENDIX: How to apply the Apache License to your work.\n\n To apply the Apache License to your work, attach the following\n boilerplate notice, with the fields enclosed by brackets \"{}\"\n replaced with your own identifying information. (Don't include\n the brackets!) The text should be enclosed in the appropriate\n comment syntax for the file format. We also recommend that a\n file or class name and description of purpose be included on the\n same \"printed page\" as the copyright notice for easier\n identification within third-party archives.\n\n Copyright {yyyy} {name of copyright owner}\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n" }, { "path": "vendor/github.com/containernetworking/plugins/pkg/ns/README.md", "content": "### Namespaces, Threads, and Go\nOn Linux each OS thread can have a different network namespace. Go's thread scheduling model switches goroutines between OS threads based on OS thread load and whether the goroutine would block other goroutines. This can result in a goroutine switching network namespaces without notice and lead to errors in your code.\n\n### Namespace Switching\nSwitching namespaces with the `ns.Set()` method is not recommended without additional strategies to prevent unexpected namespace changes when your goroutines switch OS threads.\n\nGo provides the `runtime.LockOSThread()` function to ensure a specific goroutine executes on its current OS thread and prevents any other goroutine from running in that thread until the locked one exits. Careful usage of `LockOSThread()` and goroutines can provide good control over which network namespace a given goroutine executes in.\n\nFor example, you cannot rely on the `ns.Set()` namespace being the current namespace after the `Set()` call unless you do two things. First, the goroutine calling `Set()` must have previously called `LockOSThread()`. Second, you must ensure `runtime.UnlockOSThread()` is not called somewhere in-between. You also cannot rely on the initial network namespace remaining the current network namespace if any other code in your program switches namespaces, unless you have already called `LockOSThread()` in that goroutine. Note that `LockOSThread()` prevents the Go scheduler from optimally scheduling goroutines for best performance, so `LockOSThread()` should only be used in small, isolated goroutines that release the lock quickly.\n\n### Do() The Recommended Thing\nThe `ns.Do()` method provides **partial** control over network namespaces for you by implementing these strategies. All code dependent on a particular network namespace (including the root namespace) should be wrapped in the `ns.Do()` method to ensure the correct namespace is selected for the duration of your code. For example:\n\n```go\nerr = targetNs.Do(func(hostNs ns.NetNS) error {\n\tdummy := &netlink.Dummy{\n\t\tLinkAttrs: netlink.LinkAttrs{\n\t\t\tName: \"dummy0\",\n\t\t},\n\t}\n\treturn netlink.LinkAdd(dummy)\n})\n```\n\nNote this requirement to wrap every network call is very onerous - any libraries you call might call out to network services such as DNS, and all such calls need to be protected after you call `ns.Do()`. All goroutines spawned from within the `ns.Do` will not inherit the new namespace. The CNI plugins all exit very soon after calling `ns.Do()` which helps to minimize the problem.\n\nWhen a new thread is spawned in Linux, it inherits the namespace of its parent. In versions of go **prior to 1.10**, if the runtime spawns a new OS thread, it picks the parent randomly. If the chosen parent thread has been moved to a new namespace (even temporarily), the new OS thread will be permanently \"stuck in the wrong namespace\", and goroutines will non-deterministically switch namespaces as they are rescheduled.\n\nIn short, **there was no safe way to change network namespaces, even temporarily, from within a long-lived, multithreaded Go process**. If you wish to do this, you must use go 1.10 or greater. \n\n\n### Creating network namespaces\nEarlier versions of this library managed namespace creation, but as CNI does not actually utilize this feature (and it was essentially unmaintained), it was removed. If you're writing a container runtime, you should implement namespace management yourself. However, there are some gotchas when doing so, especially around handling `/var/run/netns`. A reasonably correct reference implementation, borrowed from `rkt`, can be found in `pkg/testutils/netns_linux.go` if you're in need of a source of inspiration.\n\n\n### Further Reading\n - https://github.com/golang/go/wiki/LockOSThread\n - http://morsmachine.dk/go-scheduler\n - https://github.com/containernetworking/cni/issues/262\n - https://golang.org/pkg/runtime/\n - https://www.weave.works/blog/linux-namespaces-and-go-don-t-mix\n" }, { "path": "vendor/github.com/containernetworking/plugins/pkg/ns/ns_linux.go", "content": "// Copyright 2015-2017 CNI authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage ns\n\nimport (\n\t\"fmt\"\n\t\"os\"\n\t\"runtime\"\n\t\"sync\"\n\t\"syscall\"\n\n\t\"golang.org/x/sys/unix\"\n)\n\n// Returns an object representing the current OS thread's network namespace\nfunc GetCurrentNS() (NetNS, error) {\n\t// Lock the thread in case other goroutine executes in it and changes its\n\t// network namespace after getCurrentThreadNetNSPath(), otherwise it might\n\t// return an unexpected network namespace.\n\truntime.LockOSThread()\n\tdefer runtime.UnlockOSThread()\n\treturn GetNS(getCurrentThreadNetNSPath())\n}\n\nfunc getCurrentThreadNetNSPath() string {\n\t// /proc/self/ns/net returns the namespace of the main thread, not\n\t// of whatever thread this goroutine is running on. Make sure we\n\t// use the thread's net namespace since the thread is switching around\n\treturn fmt.Sprintf(\"/proc/%d/task/%d/ns/net\", os.Getpid(), unix.Gettid())\n}\n\nfunc (ns *netNS) Close() error {\n\tif err := ns.errorIfClosed(); err != nil {\n\t\treturn err\n\t}\n\n\tif err := ns.file.Close(); err != nil {\n\t\treturn fmt.Errorf(\"Failed to close %q: %v\", ns.file.Name(), err)\n\t}\n\tns.closed = true\n\n\treturn nil\n}\n\nfunc (ns *netNS) Set() error {\n\tif err := ns.errorIfClosed(); err != nil {\n\t\treturn err\n\t}\n\n\tif err := unix.Setns(int(ns.Fd()), unix.CLONE_NEWNET); err != nil {\n\t\treturn fmt.Errorf(\"Error switching to ns %v: %v\", ns.file.Name(), err)\n\t}\n\n\treturn nil\n}\n\ntype NetNS interface {\n\t// Executes the passed closure in this object's network namespace,\n\t// attempting to restore the original namespace before returning.\n\t// However, since each OS thread can have a different network namespace,\n\t// and Go's thread scheduling is highly variable, callers cannot\n\t// guarantee any specific namespace is set unless operations that\n\t// require that namespace are wrapped with Do(). Also, no code called\n\t// from Do() should call runtime.UnlockOSThread(), or the risk\n\t// of executing code in an incorrect namespace will be greater. See\n\t// https://github.com/golang/go/wiki/LockOSThread for further details.\n\tDo(toRun func(NetNS) error) error\n\n\t// Sets the current network namespace to this object's network namespace.\n\t// Note that since Go's thread scheduling is highly variable, callers\n\t// cannot guarantee the requested namespace will be the current namespace\n\t// after this function is called; to ensure this wrap operations that\n\t// require the namespace with Do() instead.\n\tSet() error\n\n\t// Returns the filesystem path representing this object's network namespace\n\tPath() string\n\n\t// Returns a file descriptor representing this object's network namespace\n\tFd() uintptr\n\n\t// Cleans up this instance of the network namespace; if this instance\n\t// is the last user the namespace will be destroyed\n\tClose() error\n}\n\ntype netNS struct {\n\tfile *os.File\n\tclosed bool\n}\n\n// netNS implements the NetNS interface\nvar _ NetNS = &netNS{}\n\nconst (\n\t// https://github.com/torvalds/linux/blob/master/include/uapi/linux/magic.h\n\tNSFS_MAGIC = 0x6e736673\n\tPROCFS_MAGIC = 0x9fa0\n)\n\ntype NSPathNotExistErr struct{ msg string }\n\nfunc (e NSPathNotExistErr) Error() string { return e.msg }\n\ntype NSPathNotNSErr struct{ msg string }\n\nfunc (e NSPathNotNSErr) Error() string { return e.msg }\n\nfunc IsNSorErr(nspath string) error {\n\tstat := syscall.Statfs_t{}\n\tif err := syscall.Statfs(nspath, &stat); err != nil {\n\t\tif os.IsNotExist(err) {\n\t\t\terr = NSPathNotExistErr{msg: fmt.Sprintf(\"failed to Statfs %q: %v\", nspath, err)}\n\t\t} else {\n\t\t\terr = fmt.Errorf(\"failed to Statfs %q: %v\", nspath, err)\n\t\t}\n\t\treturn err\n\t}\n\n\tswitch stat.Type {\n\tcase PROCFS_MAGIC, NSFS_MAGIC:\n\t\treturn nil\n\tdefault:\n\t\treturn NSPathNotNSErr{msg: fmt.Sprintf(\"unknown FS magic on %q: %x\", nspath, stat.Type)}\n\t}\n}\n\n// Returns an object representing the namespace referred to by @path\nfunc GetNS(nspath string) (NetNS, error) {\n\terr := IsNSorErr(nspath)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tfd, err := os.Open(nspath)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\treturn &netNS{file: fd}, nil\n}\n\nfunc (ns *netNS) Path() string {\n\treturn ns.file.Name()\n}\n\nfunc (ns *netNS) Fd() uintptr {\n\treturn ns.file.Fd()\n}\n\nfunc (ns *netNS) errorIfClosed() error {\n\tif ns.closed {\n\t\treturn fmt.Errorf(\"%q has already been closed\", ns.file.Name())\n\t}\n\treturn nil\n}\n\nfunc (ns *netNS) Do(toRun func(NetNS) error) error {\n\tif err := ns.errorIfClosed(); err != nil {\n\t\treturn err\n\t}\n\n\tcontainedCall := func(hostNS NetNS) error {\n\t\tthreadNS, err := GetCurrentNS()\n\t\tif err != nil {\n\t\t\treturn fmt.Errorf(\"failed to open current netns: %v\", err)\n\t\t}\n\t\tdefer threadNS.Close()\n\n\t\t// switch to target namespace\n\t\tif err = ns.Set(); err != nil {\n\t\t\treturn fmt.Errorf(\"error switching to ns %v: %v\", ns.file.Name(), err)\n\t\t}\n\t\tdefer func() {\n\t\t\terr := threadNS.Set() // switch back\n\t\t\tif err == nil {\n\t\t\t\t// Unlock the current thread only when we successfully switched back\n\t\t\t\t// to the original namespace; otherwise leave the thread locked which\n\t\t\t\t// will force the runtime to scrap the current thread, that is maybe\n\t\t\t\t// not as optimal but at least always safe to do.\n\t\t\t\truntime.UnlockOSThread()\n\t\t\t}\n\t\t}()\n\n\t\treturn toRun(hostNS)\n\t}\n\n\t// save a handle to current network namespace\n\thostNS, err := GetCurrentNS()\n\tif err != nil {\n\t\treturn fmt.Errorf(\"Failed to open current namespace: %v\", err)\n\t}\n\tdefer hostNS.Close()\n\n\tvar wg sync.WaitGroup\n\twg.Add(1)\n\n\t// Start the callback in a new green thread so that if we later fail\n\t// to switch the namespace back to the original one, we can safely\n\t// leave the thread locked to die without a risk of the current thread\n\t// left lingering with incorrect namespace.\n\tvar innerError error\n\tgo func() {\n\t\tdefer wg.Done()\n\t\truntime.LockOSThread()\n\t\tinnerError = containedCall(hostNS)\n\t}()\n\twg.Wait()\n\n\treturn innerError\n}\n\n// WithNetNSPath executes the passed closure under the given network\n// namespace, restoring the original namespace afterwards.\nfunc WithNetNSPath(nspath string, toRun func(NetNS) error) error {\n\tns, err := GetNS(nspath)\n\tif err != nil {\n\t\treturn err\n\t}\n\tdefer ns.Close()\n\treturn ns.Do(toRun)\n}\n" }, { "path": "vendor/github.com/containernetworking/plugins/pkg/testutils/bad_reader.go", "content": "// Copyright 2016 CNI authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage testutils\n\nimport \"errors\"\n\n// BadReader is an io.Reader which always errors\ntype BadReader struct {\n\tError error\n}\n\nfunc (r *BadReader) Read(buffer []byte) (int, error) {\n\tif r.Error != nil {\n\t\treturn 0, r.Error\n\t}\n\treturn 0, errors.New(\"banana\")\n}\n\nfunc (r *BadReader) Close() error {\n\treturn nil\n}\n" }, { "path": "vendor/github.com/containernetworking/plugins/pkg/testutils/cmd.go", "content": "// Copyright 2016 CNI authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage testutils\n\nimport (\n\t\"io/ioutil\"\n\t\"os\"\n\n\t\"github.com/containernetworking/cni/pkg/skel\"\n\t\"github.com/containernetworking/cni/pkg/types\"\n\t\"github.com/containernetworking/cni/pkg/version\"\n)\n\nfunc envCleanup() {\n\tos.Unsetenv(\"CNI_COMMAND\")\n\tos.Unsetenv(\"CNI_PATH\")\n\tos.Unsetenv(\"CNI_NETNS\")\n\tos.Unsetenv(\"CNI_IFNAME\")\n\tos.Unsetenv(\"CNI_CONTAINERID\")\n}\n\nfunc CmdAdd(cniNetns, cniContainerID, cniIfname string, conf []byte, f func() error) (types.Result, []byte, error) {\n\tos.Setenv(\"CNI_COMMAND\", \"ADD\")\n\tos.Setenv(\"CNI_PATH\", os.Getenv(\"PATH\"))\n\tos.Setenv(\"CNI_NETNS\", cniNetns)\n\tos.Setenv(\"CNI_IFNAME\", cniIfname)\n\tos.Setenv(\"CNI_CONTAINERID\", cniContainerID)\n\tdefer envCleanup()\n\n\t// Redirect stdout to capture plugin result\n\toldStdout := os.Stdout\n\tr, w, err := os.Pipe()\n\tif err != nil {\n\t\treturn nil, nil, err\n\t}\n\n\tos.Stdout = w\n\terr = f()\n\tw.Close()\n\n\tvar out []byte\n\tif err == nil {\n\t\tout, err = ioutil.ReadAll(r)\n\t}\n\tos.Stdout = oldStdout\n\n\t// Return errors after restoring stdout so Ginkgo will correctly\n\t// emit verbose error information on stdout\n\tif err != nil {\n\t\treturn nil, nil, err\n\t}\n\n\t// Plugin must return result in same version as specified in netconf\n\tversionDecoder := &version.ConfigDecoder{}\n\tconfVersion, err := versionDecoder.Decode(conf)\n\tif err != nil {\n\t\treturn nil, nil, err\n\t}\n\n\tresult, err := version.NewResult(confVersion, out)\n\tif err != nil {\n\t\treturn nil, nil, err\n\t}\n\n\treturn result, out, nil\n}\n\nfunc CmdAddWithArgs(args *skel.CmdArgs, f func() error) (types.Result, []byte, error) {\n\treturn CmdAdd(args.Netns, args.ContainerID, args.IfName, args.StdinData, f)\n}\n\nfunc CmdCheck(cniNetns, cniContainerID, cniIfname string, conf []byte, f func() error) error {\n\tos.Setenv(\"CNI_COMMAND\", \"CHECK\")\n\tos.Setenv(\"CNI_PATH\", os.Getenv(\"PATH\"))\n\tos.Setenv(\"CNI_NETNS\", cniNetns)\n\tos.Setenv(\"CNI_IFNAME\", cniIfname)\n\tos.Setenv(\"CNI_CONTAINERID\", cniContainerID)\n\tdefer envCleanup()\n\n\treturn f()\n}\n\nfunc CmdCheckWithArgs(args *skel.CmdArgs, f func() error) error {\n\treturn CmdCheck(args.Netns, args.ContainerID, args.IfName, args.StdinData, f)\n}\n\nfunc CmdDel(cniNetns, cniContainerID, cniIfname string, f func() error) error {\n\tos.Setenv(\"CNI_COMMAND\", \"DEL\")\n\tos.Setenv(\"CNI_PATH\", os.Getenv(\"PATH\"))\n\tos.Setenv(\"CNI_NETNS\", cniNetns)\n\tos.Setenv(\"CNI_IFNAME\", cniIfname)\n\tos.Setenv(\"CNI_CONTAINERID\", cniContainerID)\n\tdefer envCleanup()\n\n\treturn f()\n}\n\nfunc CmdDelWithArgs(args *skel.CmdArgs, f func() error) error {\n\treturn CmdDel(args.Netns, args.ContainerID, args.IfName, f)\n}\n" }, { "path": "vendor/github.com/containernetworking/plugins/pkg/testutils/dns.go", "content": "// Copyright 2019 CNI authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage testutils\n\nimport (\n\t\"fmt\"\n\t\"io/ioutil\"\n\t\"os\"\n\t\"strings\"\n\n\t\"github.com/containernetworking/cni/pkg/types\"\n)\n\n// TmpResolvConf will create a temporary file and write the provided DNS settings to\n// it in the resolv.conf format. It returns the path of the created temporary file or\n// an error if any occurs while creating/writing the file. It is the caller's\n// responsibility to remove the file.\nfunc TmpResolvConf(dnsConf types.DNS) (string, error) {\n\tf, err := ioutil.TempFile(\"\", \"cni_test_resolv.conf\")\n\tif err != nil {\n\t\treturn \"\", fmt.Errorf(\"failed to get temp file for CNI test resolv.conf: %v\", err)\n\t}\n\tdefer f.Close()\n\n\tpath := f.Name()\n\tdefer func() {\n\t\tif err != nil {\n\t\t\tos.RemoveAll(path)\n\t\t}\n\t}()\n\n\t// see \"man 5 resolv.conf\" for the format of resolv.conf\n\tvar resolvConfLines []string\n\tfor _, nameserver := range dnsConf.Nameservers {\n\t\tresolvConfLines = append(resolvConfLines, fmt.Sprintf(\"nameserver %s\", nameserver))\n\t}\n\tresolvConfLines = append(resolvConfLines, fmt.Sprintf(\"domain %s\", dnsConf.Domain))\n\tresolvConfLines = append(resolvConfLines, fmt.Sprintf(\"search %s\", strings.Join(dnsConf.Search, \" \")))\n\tresolvConfLines = append(resolvConfLines, fmt.Sprintf(\"options %s\", strings.Join(dnsConf.Options, \" \")))\n\n\tresolvConf := strings.Join(resolvConfLines, \"\\n\")\n\t_, err = f.Write([]byte(resolvConf))\n\tif err != nil {\n\t\treturn \"\", fmt.Errorf(\"failed to write temp resolv.conf for CNI test: %v\", err)\n\t}\n\n\treturn path, err\n}\n" }, { "path": "vendor/github.com/containernetworking/plugins/pkg/testutils/netns_linux.go", "content": "// Copyright 2018 CNI authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage testutils\n\nimport (\n\t\"crypto/rand\"\n\t\"fmt\"\n\t\"os\"\n\t\"path\"\n\t\"runtime\"\n\t\"strings\"\n\t\"sync\"\n\t\"syscall\"\n\n\t\"github.com/containernetworking/plugins/pkg/ns\"\n\t\"golang.org/x/sys/unix\"\n)\n\nfunc getNsRunDir() string {\n\txdgRuntimeDir := os.Getenv(\"XDG_RUNTIME_DIR\")\n\n\t/// If XDG_RUNTIME_DIR is set, check if the current user owns /var/run. If\n\t// the owner is different, we are most likely running in a user namespace.\n\t// In that case use $XDG_RUNTIME_DIR/netns as runtime dir.\n\tif xdgRuntimeDir != \"\" {\n\t\tif s, err := os.Stat(\"/var/run\"); err == nil {\n\t\t\tst, ok := s.Sys().(*syscall.Stat_t)\n\t\t\tif ok && int(st.Uid) != os.Geteuid() {\n\t\t\t\treturn path.Join(xdgRuntimeDir, \"netns\")\n\t\t\t}\n\t\t}\n\t}\n\n\treturn \"/var/run/netns\"\n}\n\n// Creates a new persistent (bind-mounted) network namespace and returns an object\n// representing that namespace, without switching to it.\nfunc NewNS() (ns.NetNS, error) {\n\n\tnsRunDir := getNsRunDir()\n\n\tb := make([]byte, 16)\n\t_, err := rand.Reader.Read(b)\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"failed to generate random netns name: %v\", err)\n\t}\n\n\t// Create the directory for mounting network namespaces\n\t// This needs to be a shared mountpoint in case it is mounted in to\n\t// other namespaces (containers)\n\terr = os.MkdirAll(nsRunDir, 0755)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\t// Remount the namespace directory shared. This will fail if it is not\n\t// already a mountpoint, so bind-mount it on to itself to \"upgrade\" it\n\t// to a mountpoint.\n\terr = unix.Mount(\"\", nsRunDir, \"none\", unix.MS_SHARED|unix.MS_REC, \"\")\n\tif err != nil {\n\t\tif err != unix.EINVAL {\n\t\t\treturn nil, fmt.Errorf(\"mount --make-rshared %s failed: %q\", nsRunDir, err)\n\t\t}\n\n\t\t// Recursively remount /var/run/netns on itself. The recursive flag is\n\t\t// so that any existing netns bindmounts are carried over.\n\t\terr = unix.Mount(nsRunDir, nsRunDir, \"none\", unix.MS_BIND|unix.MS_REC, \"\")\n\t\tif err != nil {\n\t\t\treturn nil, fmt.Errorf(\"mount --rbind %s %s failed: %q\", nsRunDir, nsRunDir, err)\n\t\t}\n\n\t\t// Now we can make it shared\n\t\terr = unix.Mount(\"\", nsRunDir, \"none\", unix.MS_SHARED|unix.MS_REC, \"\")\n\t\tif err != nil {\n\t\t\treturn nil, fmt.Errorf(\"mount --make-rshared %s failed: %q\", nsRunDir, err)\n\t\t}\n\n\t}\n\n\tnsName := fmt.Sprintf(\"cnitest-%x-%x-%x-%x-%x\", b[0:4], b[4:6], b[6:8], b[8:10], b[10:])\n\n\t// create an empty file at the mount point\n\tnsPath := path.Join(nsRunDir, nsName)\n\tmountPointFd, err := os.Create(nsPath)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tmountPointFd.Close()\n\n\t// Ensure the mount point is cleaned up on errors; if the namespace\n\t// was successfully mounted this will have no effect because the file\n\t// is in-use\n\tdefer os.RemoveAll(nsPath)\n\n\tvar wg sync.WaitGroup\n\twg.Add(1)\n\n\t// do namespace work in a dedicated goroutine, so that we can safely\n\t// Lock/Unlock OSThread without upsetting the lock/unlock state of\n\t// the caller of this function\n\tgo (func() {\n\t\tdefer wg.Done()\n\t\truntime.LockOSThread()\n\t\t// Don't unlock. By not unlocking, golang will kill the OS thread when the\n\t\t// goroutine is done (for go1.10+)\n\n\t\tvar origNS ns.NetNS\n\t\torigNS, err = ns.GetNS(getCurrentThreadNetNSPath())\n\t\tif err != nil {\n\t\t\treturn\n\t\t}\n\t\tdefer origNS.Close()\n\n\t\t// create a new netns on the current thread\n\t\terr = unix.Unshare(unix.CLONE_NEWNET)\n\t\tif err != nil {\n\t\t\treturn\n\t\t}\n\n\t\t// Put this thread back to the orig ns, since it might get reused (pre go1.10)\n\t\tdefer origNS.Set()\n\n\t\t// bind mount the netns from the current thread (from /proc) onto the\n\t\t// mount point. This causes the namespace to persist, even when there\n\t\t// are no threads in the ns.\n\t\terr = unix.Mount(getCurrentThreadNetNSPath(), nsPath, \"none\", unix.MS_BIND, \"\")\n\t\tif err != nil {\n\t\t\terr = fmt.Errorf(\"failed to bind mount ns at %s: %v\", nsPath, err)\n\t\t}\n\t})()\n\twg.Wait()\n\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"failed to create namespace: %v\", err)\n\t}\n\n\treturn ns.GetNS(nsPath)\n}\n\n// UnmountNS unmounts the NS held by the netns object\nfunc UnmountNS(ns ns.NetNS) error {\n\tnsPath := ns.Path()\n\t// Only unmount if it's been bind-mounted (don't touch namespaces in /proc...)\n\tif strings.HasPrefix(nsPath, getNsRunDir()) {\n\t\tif err := unix.Unmount(nsPath, 0); err != nil {\n\t\t\treturn fmt.Errorf(\"failed to unmount NS: at %s: %v\", nsPath, err)\n\t\t}\n\n\t\tif err := os.Remove(nsPath); err != nil {\n\t\t\treturn fmt.Errorf(\"failed to remove ns path %s: %v\", nsPath, err)\n\t\t}\n\t}\n\n\treturn nil\n}\n\n// getCurrentThreadNetNSPath copied from pkg/ns\nfunc getCurrentThreadNetNSPath() string {\n\t// /proc/self/ns/net returns the namespace of the main thread, not\n\t// of whatever thread this goroutine is running on. Make sure we\n\t// use the thread's net namespace since the thread is switching around\n\treturn fmt.Sprintf(\"/proc/%d/task/%d/ns/net\", os.Getpid(), unix.Gettid())\n}\n" }, { "path": "vendor/github.com/containernetworking/plugins/pkg/testutils/ping.go", "content": "// Copyright 2017 CNI authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage testutils\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n\t\"os/exec\"\n\t\"strconv\"\n\t\"syscall\"\n)\n\n// Ping shells out to the `ping` command. Returns nil if successful.\nfunc Ping(saddr, daddr string, isV6 bool, timeoutSec int) error {\n\targs := []string{\n\t\t\"-c\", \"1\",\n\t\t\"-W\", strconv.Itoa(timeoutSec),\n\t\t\"-I\", saddr,\n\t\tdaddr,\n\t}\n\n\tbin := \"ping\"\n\tif isV6 {\n\t\tbin = \"ping6\"\n\t}\n\n\tcmd := exec.Command(bin, args...)\n\tvar stderr bytes.Buffer\n\tcmd.Stderr = &stderr\n\n\tif err := cmd.Run(); err != nil {\n\t\tswitch e := err.(type) {\n\t\tcase *exec.ExitError:\n\t\t\treturn fmt.Errorf(\"%v exit status %d: %s\",\n\t\t\t\targs, e.Sys().(syscall.WaitStatus).ExitStatus(),\n\t\t\t\tstderr.String())\n\t\tdefault:\n\t\t\treturn err\n\t\t}\n\t}\n\n\treturn nil\n}\n" }, { "path": "vendor/github.com/containernetworking/plugins/plugins/ipam/host-local/backend/disk/backend.go", "content": "// Copyright 2015 CNI authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage disk\n\nimport (\n\t\"io/ioutil\"\n\t\"net\"\n\t\"os\"\n\t\"path/filepath\"\n\t\"runtime\"\n\t\"strings\"\n\n\t\"github.com/containernetworking/plugins/plugins/ipam/host-local/backend\"\n)\n\nconst lastIPFilePrefix = \"last_reserved_ip.\"\nconst LineBreak = \"\\r\\n\"\n\nvar defaultDataDir = \"/var/lib/cni/networks\"\n\n// Store is a simple disk-backed store that creates one file per IP\n// address in a given directory. The contents of the file are the container ID.\ntype Store struct {\n\t*FileLock\n\tdataDir string\n}\n\n// Store implements the Store interface\nvar _ backend.Store = &Store{}\n\nfunc New(network, dataDir string) (*Store, error) {\n\tif dataDir == \"\" {\n\t\tdataDir = defaultDataDir\n\t}\n\tdir := filepath.Join(dataDir, network)\n\tif err := os.MkdirAll(dir, 0755); err != nil {\n\t\treturn nil, err\n\t}\n\n\tlk, err := NewFileLock(dir)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn &Store{lk, dir}, nil\n}\n\nfunc (s *Store) Reserve(id string, ifname string, ip net.IP, rangeID string) (bool, error) {\n\tfname := GetEscapedPath(s.dataDir, ip.String())\n\n\tf, err := os.OpenFile(fname, os.O_RDWR|os.O_EXCL|os.O_CREATE, 0644)\n\tif os.IsExist(err) {\n\t\treturn false, nil\n\t}\n\tif err != nil {\n\t\treturn false, err\n\t}\n\tif _, err := f.WriteString(strings.TrimSpace(id) + LineBreak + ifname); err != nil {\n\t\tf.Close()\n\t\tos.Remove(f.Name())\n\t\treturn false, err\n\t}\n\tif err := f.Close(); err != nil {\n\t\tos.Remove(f.Name())\n\t\treturn false, err\n\t}\n\t// store the reserved ip in lastIPFile\n\tipfile := GetEscapedPath(s.dataDir, lastIPFilePrefix+rangeID)\n\terr = ioutil.WriteFile(ipfile, []byte(ip.String()), 0644)\n\tif err != nil {\n\t\treturn false, err\n\t}\n\treturn true, nil\n}\n\n// LastReservedIP returns the last reserved IP if exists\nfunc (s *Store) LastReservedIP(rangeID string) (net.IP, error) {\n\tipfile := GetEscapedPath(s.dataDir, lastIPFilePrefix+rangeID)\n\tdata, err := ioutil.ReadFile(ipfile)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn net.ParseIP(string(data)), nil\n}\n\nfunc (s *Store) Release(ip net.IP) error {\n\treturn os.Remove(GetEscapedPath(s.dataDir, ip.String()))\n}\n\nfunc (s *Store) FindByKey(id string, ifname string, match string) (bool, error) {\n\tfound := false\n\n\terr := filepath.Walk(s.dataDir, func(path string, info os.FileInfo, err error) error {\n\t\tif err != nil || info.IsDir() {\n\t\t\treturn nil\n\t\t}\n\t\tdata, err := ioutil.ReadFile(path)\n\t\tif err != nil {\n\t\t\treturn nil\n\t\t}\n\t\tif strings.TrimSpace(string(data)) == match {\n\t\t\tfound = true\n\t\t}\n\t\treturn nil\n\t})\n\treturn found, err\n\n}\n\nfunc (s *Store) FindByID(id string, ifname string) bool {\n\ts.Lock()\n\tdefer s.Unlock()\n\n\tfound := false\n\tmatch := strings.TrimSpace(id) + LineBreak + ifname\n\tfound, err := s.FindByKey(id, ifname, match)\n\n\t// Match anything created by this id\n\tif !found && err == nil {\n\t\tmatch := strings.TrimSpace(id)\n\t\tfound, err = s.FindByKey(id, ifname, match)\n\t}\n\n\treturn found\n}\n\nfunc (s *Store) ReleaseByKey(id string, ifname string, match string) (bool, error) {\n\tfound := false\n\terr := filepath.Walk(s.dataDir, func(path string, info os.FileInfo, err error) error {\n\t\tif err != nil || info.IsDir() {\n\t\t\treturn nil\n\t\t}\n\t\tdata, err := ioutil.ReadFile(path)\n\t\tif err != nil {\n\t\t\treturn nil\n\t\t}\n\t\tif strings.TrimSpace(string(data)) == match {\n\t\t\tif err := os.Remove(path); err != nil {\n\t\t\t\treturn nil\n\t\t\t}\n\t\t\tfound = true\n\t\t}\n\t\treturn nil\n\t})\n\treturn found, err\n\n}\n\n// N.B. This function eats errors to be tolerant and\n// release as much as possible\nfunc (s *Store) ReleaseByID(id string, ifname string) error {\n\tfound := false\n\tmatch := strings.TrimSpace(id) + LineBreak + ifname\n\tfound, err := s.ReleaseByKey(id, ifname, match)\n\n\t// For backwards compatibility, look for files written by a previous version\n\tif !found && err == nil {\n\t\tmatch := strings.TrimSpace(id)\n\t\tfound, err = s.ReleaseByKey(id, ifname, match)\n\t}\n\treturn err\n}\n\n// GetByID returns the IPs which have been allocated to the specific ID\nfunc (s *Store) GetByID(id string, ifname string) []net.IP {\n\tvar ips []net.IP\n\n\tmatch := strings.TrimSpace(id) + LineBreak + ifname\n\t// matchOld for backwards compatibility\n\tmatchOld := strings.TrimSpace(id)\n\n\t// walk through all ips in this network to get the ones which belong to a specific ID\n\t_ = filepath.Walk(s.dataDir, func(path string, info os.FileInfo, err error) error {\n\t\tif err != nil || info.IsDir() {\n\t\t\treturn nil\n\t\t}\n\t\tdata, err := ioutil.ReadFile(path)\n\t\tif err != nil {\n\t\t\treturn nil\n\t\t}\n\t\tif strings.TrimSpace(string(data)) == match || strings.TrimSpace(string(data)) == matchOld {\n\t\t\t_, ipString := filepath.Split(path)\n\t\t\tif ip := net.ParseIP(ipString); ip != nil {\n\t\t\t\tips = append(ips, ip)\n\t\t\t}\n\t\t}\n\t\treturn nil\n\t})\n\n\treturn ips\n}\n\nfunc GetEscapedPath(dataDir string, fname string) string {\n\tif runtime.GOOS == \"windows\" {\n\t\tfname = strings.Replace(fname, \":\", \"_\", -1)\n\t}\n\treturn filepath.Join(dataDir, fname)\n}\n" }, { "path": "vendor/github.com/containernetworking/plugins/plugins/ipam/host-local/backend/disk/lock.go", "content": "// Copyright 2015 CNI authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage disk\n\nimport (\n\t\"github.com/alexflint/go-filemutex\"\n\t\"os\"\n\t\"path\"\n)\n\n// FileLock wraps os.File to be used as a lock using flock\ntype FileLock struct {\n\tf *filemutex.FileMutex\n}\n\n// NewFileLock opens file/dir at path and returns unlocked FileLock object\nfunc NewFileLock(lockPath string) (*FileLock, error) {\n\tfi, err := os.Stat(lockPath)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tif fi.IsDir() {\n\t\tlockPath = path.Join(lockPath, \"lock\")\n\t}\n\n\tf, err := filemutex.New(lockPath)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\treturn &FileLock{f}, nil\n}\n\nfunc (l *FileLock) Close() error {\n\treturn l.f.Close()\n}\n\n// Lock acquires an exclusive lock\nfunc (l *FileLock) Lock() error {\n\treturn l.f.Lock()\n}\n\n// Unlock releases the lock\nfunc (l *FileLock) Unlock() error {\n\treturn l.f.Unlock()\n}\n" }, { "path": "vendor/github.com/containernetworking/plugins/plugins/ipam/host-local/backend/store.go", "content": "// Copyright 2015 CNI authors\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage backend\n\nimport \"net\"\n\ntype Store interface {\n\tLock() error\n\tUnlock() error\n\tClose() error\n\tReserve(id string, ifname string, ip net.IP, rangeID string) (bool, error)\n\tLastReservedIP(rangeID string) (net.IP, error)\n\tRelease(ip net.IP) error\n\tReleaseByID(id string, ifname string) error\n\tGetByID(id string, ifname string) []net.IP\n}\n" }, { "path": "vendor/github.com/coreos/go-iptables/LICENSE", "content": "Apache License\nVersion 2.0, January 2004\nhttp://www.apache.org/licenses/\n\nTERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION\n\n1. Definitions.\n\n\"License\" shall mean the terms and conditions for use, reproduction, and\ndistribution as defined by Sections 1 through 9 of this document.\n\n\"Licensor\" shall mean the copyright owner or entity authorized by the copyright\nowner that is granting the License.\n\n\"Legal Entity\" shall mean the union of the acting entity and all other entities\nthat control, are controlled by, or are under common control with that entity.\nFor the purposes of this definition, \"control\" means (i) the power, direct or\nindirect, to cause the direction or management of such entity, whether by\ncontract or otherwise, or (ii) ownership of fifty percent (50%) or more of the\noutstanding shares, or (iii) beneficial ownership of such entity.\n\n\"You\" (or \"Your\") shall mean an individual or Legal Entity exercising\npermissions granted by this License.\n\n\"Source\" form shall mean the preferred form for making modifications, including\nbut not limited to software source code, documentation source, and configuration\nfiles.\n\n\"Object\" form shall mean any form resulting from mechanical transformation or\ntranslation of a Source form, including but not limited to compiled object code,\ngenerated documentation, and conversions to other media types.\n\n\"Work\" shall mean the work of authorship, whether in Source or Object form, made\navailable under the License, as indicated by a copyright notice that is included\nin or attached to the work (an example is provided in the Appendix below).\n\n\"Derivative Works\" shall mean any work, whether in Source or Object form, that\nis based on (or derived from) the Work and for which the editorial revisions,\nannotations, elaborations, or other modifications represent, as a whole, an\noriginal work of authorship. For the purposes of this License, Derivative Works\nshall not include works that remain separable from, or merely link (or bind by\nname) to the interfaces of, the Work and Derivative Works thereof.\n\n\"Contribution\" shall mean any work of authorship, including the original version\nof the Work and any modifications or additions to that Work or Derivative Works\nthereof, that is intentionally submitted to Licensor for inclusion in the Work\nby the copyright owner or by an individual or Legal Entity authorized to submit\non behalf of the copyright owner. For the purposes of this definition,\n\"submitted\" means any form of electronic, verbal, or written communication sent\nto the Licensor or its representatives, including but not limited to\ncommunication on electronic mailing lists, source code control systems, and\nissue tracking systems that are managed by, or on behalf of, the Licensor for\nthe purpose of discussing and improving the Work, but excluding communication\nthat is conspicuously marked or otherwise designated in writing by the copyright\nowner as \"Not a Contribution.\"\n\n\"Contributor\" shall mean Licensor and any individual or Legal Entity on behalf\nof whom a Contribution has been received by Licensor and subsequently\nincorporated within the Work.\n\n2. Grant of Copyright License.\n\nSubject to the terms and conditions of this License, each Contributor hereby\ngrants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free,\nirrevocable copyright license to reproduce, prepare Derivative Works of,\npublicly display, publicly perform, sublicense, and distribute the Work and such\nDerivative Works in Source or Object form.\n\n3. Grant of Patent License.\n\nSubject to the terms and conditions of this License, each Contributor hereby\ngrants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free,\nirrevocable (except as stated in this section) patent license to make, have\nmade, use, offer to sell, sell, import, and otherwise transfer the Work, where\nsuch license applies only to those patent claims licensable by such Contributor\nthat are necessarily infringed by their Contribution(s) alone or by combination\nof their Contribution(s) with the Work to which such Contribution(s) was\nsubmitted. If You institute patent litigation against any entity (including a\ncross-claim or counterclaim in a lawsuit) alleging that the Work or a\nContribution incorporated within the Work constitutes direct or contributory\npatent infringement, then any patent licenses granted to You under this License\nfor that Work shall terminate as of the date such litigation is filed.\n\n4. Redistribution.\n\nYou may reproduce and distribute copies of the Work or Derivative Works thereof\nin any medium, with or without modifications, and in Source or Object form,\nprovided that You meet the following conditions:\n\nYou must give any other recipients of the Work or Derivative Works a copy of\nthis License; and\nYou must cause any modified files to carry prominent notices stating that You\nchanged the files; and\nYou must retain, in the Source form of any Derivative Works that You distribute,\nall copyright, patent, trademark, and attribution notices from the Source form\nof the Work, excluding those notices that do not pertain to any part of the\nDerivative Works; and\nIf the Work includes a \"NOTICE\" text file as part of its distribution, then any\nDerivative Works that You distribute must include a readable copy of the\nattribution notices contained within such NOTICE file, excluding those notices\nthat do not pertain to any part of the Derivative Works, in at least one of the\nfollowing places: within a NOTICE text file distributed as part of the\nDerivative Works; within the Source form or documentation, if provided along\nwith the Derivative Works; or, within a display generated by the Derivative\nWorks, if and wherever such third-party notices normally appear. The contents of\nthe NOTICE file are for informational purposes only and do not modify the\nLicense. You may add Your own attribution notices within Derivative Works that\nYou distribute, alongside or as an addendum to the NOTICE text from the Work,\nprovided that such additional attribution notices cannot be construed as\nmodifying the License.\nYou may add Your own copyright statement to Your modifications and may provide\nadditional or different license terms and conditions for use, reproduction, or\ndistribution of Your modifications, or for any such Derivative Works as a whole,\nprovided Your use, reproduction, and distribution of the Work otherwise complies\nwith the conditions stated in this License.\n\n5. Submission of Contributions.\n\nUnless You explicitly state otherwise, any Contribution intentionally submitted\nfor inclusion in the Work by You to the Licensor shall be under the terms and\nconditions of this License, without any additional terms or conditions.\nNotwithstanding the above, nothing herein shall supersede or modify the terms of\nany separate license agreement you may have executed with Licensor regarding\nsuch Contributions.\n\n6. Trademarks.\n\nThis License does not grant permission to use the trade names, trademarks,\nservice marks, or product names of the Licensor, except as required for\nreasonable and customary use in describing the origin of the Work and\nreproducing the content of the NOTICE file.\n\n7. Disclaimer of Warranty.\n\nUnless required by applicable law or agreed to in writing, Licensor provides the\nWork (and each Contributor provides its Contributions) on an \"AS IS\" BASIS,\nWITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied,\nincluding, without limitation, any warranties or conditions of TITLE,\nNON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR PURPOSE. You are\nsolely responsible for determining the appropriateness of using or\nredistributing the Work and assume any risks associated with Your exercise of\npermissions under this License.\n\n8. Limitation of Liability.\n\nIn no event and under no legal theory, whether in tort (including negligence),\ncontract, or otherwise, unless required by applicable law (such as deliberate\nand grossly negligent acts) or agreed to in writing, shall any Contributor be\nliable to You for damages, including any direct, indirect, special, incidental,\nor consequential damages of any character arising as a result of this License or\nout of the use or inability to use the Work (including but not limited to\ndamages for loss of goodwill, work stoppage, computer failure or malfunction, or\nany and all other commercial damages or losses), even if such Contributor has\nbeen advised of the possibility of such damages.\n\n9. Accepting Warranty or Additional Liability.\n\nWhile redistributing the Work or Derivative Works thereof, You may choose to\noffer, and charge a fee for, acceptance of support, warranty, indemnity, or\nother liability obligations and/or rights consistent with this License. However,\nin accepting such obligations, You may act only on Your own behalf and on Your\nsole responsibility, not on behalf of any other Contributor, and only if You\nagree to indemnify, defend, and hold each Contributor harmless for any liability\nincurred by, or claims asserted against, such Contributor by reason of your\naccepting any such warranty or additional liability.\n\nEND OF TERMS AND CONDITIONS\n\nAPPENDIX: How to apply the Apache License to your work\n\nTo apply the Apache License to your work, attach the following boilerplate\nnotice, with the fields enclosed by brackets \"[]\" replaced with your own\nidentifying information. (Don't include the brackets!) The text should be\nenclosed in the appropriate comment syntax for the file format. We also\nrecommend that a file or class name and description of purpose be included on\nthe same \"printed page\" as the copyright notice for easier identification within\nthird-party archives.\n\n Copyright [yyyy] [name of copyright owner]\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n" }, { "path": "vendor/github.com/coreos/go-iptables/NOTICE", "content": "CoreOS Project\nCopyright 2018 CoreOS, Inc\n\nThis product includes software developed at CoreOS, Inc.\n(http://www.coreos.com/).\n" }, { "path": "vendor/github.com/coreos/go-iptables/iptables/iptables.go", "content": "// Copyright 2015 CoreOS, Inc.\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage iptables\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n\t\"io\"\n\t\"net\"\n\t\"os/exec\"\n\t\"regexp\"\n\t\"strconv\"\n\t\"strings\"\n\t\"syscall\"\n)\n\n// Adds the output of stderr to exec.ExitError\ntype Error struct {\n\texec.ExitError\n\tcmd exec.Cmd\n\tmsg string\n\texitStatus *int //for overriding\n}\n\nfunc (e *Error) ExitStatus() int {\n\tif e.exitStatus != nil {\n\t\treturn *e.exitStatus\n\t}\n\treturn e.Sys().(syscall.WaitStatus).ExitStatus()\n}\n\nfunc (e *Error) Error() string {\n\treturn fmt.Sprintf(\"running %v: exit status %v: %v\", e.cmd.Args, e.ExitStatus(), e.msg)\n}\n\n// IsNotExist returns true if the error is due to the chain or rule not existing\nfunc (e *Error) IsNotExist() bool {\n\tif e.ExitStatus() != 1 {\n\t\treturn false\n\t}\n\tmsgNoRuleExist := \"Bad rule (does a matching rule exist in that chain?).\\n\"\n\tmsgNoChainExist := \"No chain/target/match by that name.\\n\"\n\treturn strings.Contains(e.msg, msgNoRuleExist) || strings.Contains(e.msg, msgNoChainExist)\n}\n\n// Protocol to differentiate between IPv4 and IPv6\ntype Protocol byte\n\nconst (\n\tProtocolIPv4 Protocol = iota\n\tProtocolIPv6\n)\n\ntype IPTables struct {\n\tpath string\n\tproto Protocol\n\thasCheck bool\n\thasWait bool\n\twaitSupportSecond bool\n\thasRandomFully bool\n\tv1 int\n\tv2 int\n\tv3 int\n\tmode string // the underlying iptables operating mode, e.g. nf_tables\n\ttimeout int // time to wait for the iptables lock, default waits forever\n}\n\n// Stat represents a structured statistic entry.\ntype Stat struct {\n\tPackets uint64 `json:\"pkts\"`\n\tBytes uint64 `json:\"bytes\"`\n\tTarget string `json:\"target\"`\n\tProtocol string `json:\"prot\"`\n\tOpt string `json:\"opt\"`\n\tInput string `json:\"in\"`\n\tOutput string `json:\"out\"`\n\tSource *net.IPNet `json:\"source\"`\n\tDestination *net.IPNet `json:\"destination\"`\n\tOptions string `json:\"options\"`\n}\n\ntype option func(*IPTables)\n\nfunc IPFamily(proto Protocol) option {\n\treturn func(ipt *IPTables) {\n\t\tipt.proto = proto\n\t}\n}\n\nfunc Timeout(timeout int) option {\n\treturn func(ipt *IPTables) {\n\t\tipt.timeout = timeout\n\t}\n}\n\n// New creates a new IPTables configured with the options passed as parameter.\n// For backwards compatibility, by default always uses IPv4 and timeout 0.\n// i.e. you can create an IPv6 IPTables using a timeout of 5 seconds passing\n// the IPFamily and Timeout options as follow:\n//\tip6t := New(IPFamily(ProtocolIPv6), Timeout(5))\nfunc New(opts ...option) (*IPTables, error) {\n\n\tipt := &IPTables{\n\t\tproto: ProtocolIPv4,\n\t\ttimeout: 0,\n\t}\n\n\tfor _, opt := range opts {\n\t\topt(ipt)\n\t}\n\n\tpath, err := exec.LookPath(getIptablesCommand(ipt.proto))\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tipt.path = path\n\n\tvstring, err := getIptablesVersionString(path)\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"could not get iptables version: %v\", err)\n\t}\n\tv1, v2, v3, mode, err := extractIptablesVersion(vstring)\n\tif err != nil {\n\t\treturn nil, fmt.Errorf(\"failed to extract iptables version from [%s]: %v\", vstring, err)\n\t}\n\tipt.v1 = v1\n\tipt.v2 = v2\n\tipt.v3 = v3\n\tipt.mode = mode\n\n\tcheckPresent, waitPresent, waitSupportSecond, randomFullyPresent := getIptablesCommandSupport(v1, v2, v3)\n\tipt.hasCheck = checkPresent\n\tipt.hasWait = waitPresent\n\tipt.waitSupportSecond = waitSupportSecond\n\tipt.hasRandomFully = randomFullyPresent\n\n\treturn ipt, nil\n}\n\n// New creates a new IPTables for the given proto.\n// The proto will determine which command is used, either \"iptables\" or \"ip6tables\".\nfunc NewWithProtocol(proto Protocol) (*IPTables, error) {\n\treturn New(IPFamily(proto), Timeout(0))\n}\n\n// Proto returns the protocol used by this IPTables.\nfunc (ipt *IPTables) Proto() Protocol {\n\treturn ipt.proto\n}\n\n// Exists checks if given rulespec in specified table/chain exists\nfunc (ipt *IPTables) Exists(table, chain string, rulespec ...string) (bool, error) {\n\tif !ipt.hasCheck {\n\t\treturn ipt.existsForOldIptables(table, chain, rulespec)\n\n\t}\n\tcmd := append([]string{\"-t\", table, \"-C\", chain}, rulespec...)\n\terr := ipt.run(cmd...)\n\teerr, eok := err.(*Error)\n\tswitch {\n\tcase err == nil:\n\t\treturn true, nil\n\tcase eok && eerr.ExitStatus() == 1:\n\t\treturn false, nil\n\tdefault:\n\t\treturn false, err\n\t}\n}\n\n// Insert inserts rulespec to specified table/chain (in specified pos)\nfunc (ipt *IPTables) Insert(table, chain string, pos int, rulespec ...string) error {\n\tcmd := append([]string{\"-t\", table, \"-I\", chain, strconv.Itoa(pos)}, rulespec...)\n\treturn ipt.run(cmd...)\n}\n\n// Append appends rulespec to specified table/chain\nfunc (ipt *IPTables) Append(table, chain string, rulespec ...string) error {\n\tcmd := append([]string{\"-t\", table, \"-A\", chain}, rulespec...)\n\treturn ipt.run(cmd...)\n}\n\n// AppendUnique acts like Append except that it won't add a duplicate\nfunc (ipt *IPTables) AppendUnique(table, chain string, rulespec ...string) error {\n\texists, err := ipt.Exists(table, chain, rulespec...)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tif !exists {\n\t\treturn ipt.Append(table, chain, rulespec...)\n\t}\n\n\treturn nil\n}\n\n// Delete removes rulespec in specified table/chain\nfunc (ipt *IPTables) Delete(table, chain string, rulespec ...string) error {\n\tcmd := append([]string{\"-t\", table, \"-D\", chain}, rulespec...)\n\treturn ipt.run(cmd...)\n}\n\nfunc (ipt *IPTables) DeleteIfExists(table, chain string, rulespec ...string) error {\n\texists, err := ipt.Exists(table, chain, rulespec...)\n\tif err == nil && exists {\n\t\terr = ipt.Delete(table, chain, rulespec...)\n\t}\n\treturn err\n}\n\n// List rules in specified table/chain\nfunc (ipt *IPTables) List(table, chain string) ([]string, error) {\n\targs := []string{\"-t\", table, \"-S\", chain}\n\treturn ipt.executeList(args)\n}\n\n// List rules (with counters) in specified table/chain\nfunc (ipt *IPTables) ListWithCounters(table, chain string) ([]string, error) {\n\targs := []string{\"-t\", table, \"-v\", \"-S\", chain}\n\treturn ipt.executeList(args)\n}\n\n// ListChains returns a slice containing the name of each chain in the specified table.\nfunc (ipt *IPTables) ListChains(table string) ([]string, error) {\n\targs := []string{\"-t\", table, \"-S\"}\n\n\tresult, err := ipt.executeList(args)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\t// Iterate over rules to find all default (-P) and user-specified (-N) chains.\n\t// Chains definition always come before rules.\n\t// Format is the following:\n\t// -P OUTPUT ACCEPT\n\t// -N Custom\n\tvar chains []string\n\tfor _, val := range result {\n\t\tif strings.HasPrefix(val, \"-P\") || strings.HasPrefix(val, \"-N\") {\n\t\t\tchains = append(chains, strings.Fields(val)[1])\n\t\t} else {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn chains, nil\n}\n\n// '-S' is fine with non existing rule index as long as the chain exists\n// therefore pass index 1 to reduce overhead for large chains\nfunc (ipt *IPTables) ChainExists(table, chain string) (bool, error) {\n\terr := ipt.run(\"-t\", table, \"-S\", chain, \"1\")\n\teerr, eok := err.(*Error)\n\tswitch {\n\tcase err == nil:\n\t\treturn true, nil\n\tcase eok && eerr.ExitStatus() == 1:\n\t\treturn false, nil\n\tdefault:\n\t\treturn false, err\n\t}\n}\n\n// Stats lists rules including the byte and packet counts\nfunc (ipt *IPTables) Stats(table, chain string) ([][]string, error) {\n\targs := []string{\"-t\", table, \"-L\", chain, \"-n\", \"-v\", \"-x\"}\n\tlines, err := ipt.executeList(args)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tappendSubnet := func(addr string) string {\n\t\tif strings.IndexByte(addr, byte('/')) < 0 {\n\t\t\tif strings.IndexByte(addr, '.') < 0 {\n\t\t\t\treturn addr + \"/128\"\n\t\t\t}\n\t\t\treturn addr + \"/32\"\n\t\t}\n\t\treturn addr\n\t}\n\n\tipv6 := ipt.proto == ProtocolIPv6\n\n\trows := [][]string{}\n\tfor i, line := range lines {\n\t\t// Skip over chain name and field header\n\t\tif i < 2 {\n\t\t\tcontinue\n\t\t}\n\n\t\t// Fields:\n\t\t// 0=pkts 1=bytes 2=target 3=prot 4=opt 5=in 6=out 7=source 8=destination 9=options\n\t\tline = strings.TrimSpace(line)\n\t\tfields := strings.Fields(line)\n\n\t\t// The ip6tables verbose output cannot be naively split due to the default \"opt\"\n\t\t// field containing 2 single spaces.\n\t\tif ipv6 {\n\t\t\t// Check if field 6 is \"opt\" or \"source\" address\n\t\t\tdest := fields[6]\n\t\t\tip, _, _ := net.ParseCIDR(dest)\n\t\t\tif ip == nil {\n\t\t\t\tip = net.ParseIP(dest)\n\t\t\t}\n\n\t\t\t// If we detected a CIDR or IP, the \"opt\" field is empty.. insert it.\n\t\t\tif ip != nil {\n\t\t\t\tf := []string{}\n\t\t\t\tf = append(f, fields[:4]...)\n\t\t\t\tf = append(f, \" \") // Empty \"opt\" field for ip6tables\n\t\t\t\tf = append(f, fields[4:]...)\n\t\t\t\tfields = f\n\t\t\t}\n\t\t}\n\n\t\t// Adjust \"source\" and \"destination\" to include netmask, to match regular\n\t\t// List output\n\t\tfields[7] = appendSubnet(fields[7])\n\t\tfields[8] = appendSubnet(fields[8])\n\n\t\t// Combine \"options\" fields 9... into a single space-delimited field.\n\t\toptions := fields[9:]\n\t\tfields = fields[:9]\n\t\tfields = append(fields, strings.Join(options, \" \"))\n\t\trows = append(rows, fields)\n\t}\n\treturn rows, nil\n}\n\n// ParseStat parses a single statistic row into a Stat struct. The input should\n// be a string slice that is returned from calling the Stat method.\nfunc (ipt *IPTables) ParseStat(stat []string) (parsed Stat, err error) {\n\t// For forward-compatibility, expect at least 10 fields in the stat\n\tif len(stat) < 10 {\n\t\treturn parsed, fmt.Errorf(\"stat contained fewer fields than expected\")\n\t}\n\n\t// Convert the fields that are not plain strings\n\tparsed.Packets, err = strconv.ParseUint(stat[0], 0, 64)\n\tif err != nil {\n\t\treturn parsed, fmt.Errorf(err.Error(), \"could not parse packets\")\n\t}\n\tparsed.Bytes, err = strconv.ParseUint(stat[1], 0, 64)\n\tif err != nil {\n\t\treturn parsed, fmt.Errorf(err.Error(), \"could not parse bytes\")\n\t}\n\t_, parsed.Source, err = net.ParseCIDR(stat[7])\n\tif err != nil {\n\t\treturn parsed, fmt.Errorf(err.Error(), \"could not parse source\")\n\t}\n\t_, parsed.Destination, err = net.ParseCIDR(stat[8])\n\tif err != nil {\n\t\treturn parsed, fmt.Errorf(err.Error(), \"could not parse destination\")\n\t}\n\n\t// Put the fields that are strings\n\tparsed.Target = stat[2]\n\tparsed.Protocol = stat[3]\n\tparsed.Opt = stat[4]\n\tparsed.Input = stat[5]\n\tparsed.Output = stat[6]\n\tparsed.Options = stat[9]\n\n\treturn parsed, nil\n}\n\n// StructuredStats returns statistics as structured data which may be further\n// parsed and marshaled.\nfunc (ipt *IPTables) StructuredStats(table, chain string) ([]Stat, error) {\n\trawStats, err := ipt.Stats(table, chain)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tstructStats := []Stat{}\n\tfor _, rawStat := range rawStats {\n\t\tstat, err := ipt.ParseStat(rawStat)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tstructStats = append(structStats, stat)\n\t}\n\n\treturn structStats, nil\n}\n\nfunc (ipt *IPTables) executeList(args []string) ([]string, error) {\n\tvar stdout bytes.Buffer\n\tif err := ipt.runWithOutput(args, &stdout); err != nil {\n\t\treturn nil, err\n\t}\n\n\trules := strings.Split(stdout.String(), \"\\n\")\n\n\t// strip trailing newline\n\tif len(rules) > 0 && rules[len(rules)-1] == \"\" {\n\t\trules = rules[:len(rules)-1]\n\t}\n\n\tfor i, rule := range rules {\n\t\trules[i] = filterRuleOutput(rule)\n\t}\n\n\treturn rules, nil\n}\n\n// NewChain creates a new chain in the specified table.\n// If the chain already exists, it will result in an error.\nfunc (ipt *IPTables) NewChain(table, chain string) error {\n\treturn ipt.run(\"-t\", table, \"-N\", chain)\n}\n\nconst existsErr = 1\n\n// ClearChain flushed (deletes all rules) in the specified table/chain.\n// If the chain does not exist, a new one will be created\nfunc (ipt *IPTables) ClearChain(table, chain string) error {\n\terr := ipt.NewChain(table, chain)\n\n\teerr, eok := err.(*Error)\n\tswitch {\n\tcase err == nil:\n\t\treturn nil\n\tcase eok && eerr.ExitStatus() == existsErr:\n\t\t// chain already exists. Flush (clear) it.\n\t\treturn ipt.run(\"-t\", table, \"-F\", chain)\n\tdefault:\n\t\treturn err\n\t}\n}\n\n// RenameChain renames the old chain to the new one.\nfunc (ipt *IPTables) RenameChain(table, oldChain, newChain string) error {\n\treturn ipt.run(\"-t\", table, \"-E\", oldChain, newChain)\n}\n\n// DeleteChain deletes the chain in the specified table.\n// The chain must be empty\nfunc (ipt *IPTables) DeleteChain(table, chain string) error {\n\treturn ipt.run(\"-t\", table, \"-X\", chain)\n}\n\nfunc (ipt *IPTables) ClearAndDeleteChain(table, chain string) error {\n\texists, err := ipt.ChainExists(table, chain)\n\tif err != nil || !exists {\n\t\treturn err\n\t}\n\terr = ipt.run(\"-t\", table, \"-F\", chain)\n\tif err == nil {\n\t\terr = ipt.run(\"-t\", table, \"-X\", chain)\n\t}\n\treturn err\n}\n\nfunc (ipt *IPTables) ClearAll() error {\n\treturn ipt.run(\"-F\")\n}\n\nfunc (ipt *IPTables) DeleteAll() error {\n\treturn ipt.run(\"-X\")\n}\n\n// ChangePolicy changes policy on chain to target\nfunc (ipt *IPTables) ChangePolicy(table, chain, target string) error {\n\treturn ipt.run(\"-t\", table, \"-P\", chain, target)\n}\n\n// Check if the underlying iptables command supports the --random-fully flag\nfunc (ipt *IPTables) HasRandomFully() bool {\n\treturn ipt.hasRandomFully\n}\n\n// Return version components of the underlying iptables command\nfunc (ipt *IPTables) GetIptablesVersion() (int, int, int) {\n\treturn ipt.v1, ipt.v2, ipt.v3\n}\n\n// run runs an iptables command with the given arguments, ignoring\n// any stdout output\nfunc (ipt *IPTables) run(args ...string) error {\n\treturn ipt.runWithOutput(args, nil)\n}\n\n// runWithOutput runs an iptables command with the given arguments,\n// writing any stdout output to the given writer\nfunc (ipt *IPTables) runWithOutput(args []string, stdout io.Writer) error {\n\targs = append([]string{ipt.path}, args...)\n\tif ipt.hasWait {\n\t\targs = append(args, \"--wait\")\n\t\tif ipt.timeout != 0 && ipt.waitSupportSecond {\n\t\t\targs = append(args, strconv.Itoa(ipt.timeout))\n\t\t}\n\t} else {\n\t\tfmu, err := newXtablesFileLock()\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tul, err := fmu.tryLock()\n\t\tif err != nil {\n\t\t\tsyscall.Close(fmu.fd)\n\t\t\treturn err\n\t\t}\n\t\tdefer ul.Unlock()\n\t}\n\n\tvar stderr bytes.Buffer\n\tcmd := exec.Cmd{\n\t\tPath: ipt.path,\n\t\tArgs: args,\n\t\tStdout: stdout,\n\t\tStderr: &stderr,\n\t}\n\n\tif err := cmd.Run(); err != nil {\n\t\tswitch e := err.(type) {\n\t\tcase *exec.ExitError:\n\t\t\treturn &Error{*e, cmd, stderr.String(), nil}\n\t\tdefault:\n\t\t\treturn err\n\t\t}\n\t}\n\n\treturn nil\n}\n\n// getIptablesCommand returns the correct command for the given protocol, either \"iptables\" or \"ip6tables\".\nfunc getIptablesCommand(proto Protocol) string {\n\tif proto == ProtocolIPv6 {\n\t\treturn \"ip6tables\"\n\t} else {\n\t\treturn \"iptables\"\n\t}\n}\n\n// Checks if iptables has the \"-C\" and \"--wait\" flag\nfunc getIptablesCommandSupport(v1 int, v2 int, v3 int) (bool, bool, bool, bool) {\n\treturn iptablesHasCheckCommand(v1, v2, v3), iptablesHasWaitCommand(v1, v2, v3), iptablesWaitSupportSecond(v1, v2, v3), iptablesHasRandomFully(v1, v2, v3)\n}\n\n// getIptablesVersion returns the first three components of the iptables version\n// and the operating mode (e.g. nf_tables or legacy)\n// e.g. \"iptables v1.3.66\" would return (1, 3, 66, legacy, nil)\nfunc extractIptablesVersion(str string) (int, int, int, string, error) {\n\tversionMatcher := regexp.MustCompile(`v([0-9]+)\\.([0-9]+)\\.([0-9]+)(?:\\s+\\((\\w+))?`)\n\tresult := versionMatcher.FindStringSubmatch(str)\n\tif result == nil {\n\t\treturn 0, 0, 0, \"\", fmt.Errorf(\"no iptables version found in string: %s\", str)\n\t}\n\n\tv1, err := strconv.Atoi(result[1])\n\tif err != nil {\n\t\treturn 0, 0, 0, \"\", err\n\t}\n\n\tv2, err := strconv.Atoi(result[2])\n\tif err != nil {\n\t\treturn 0, 0, 0, \"\", err\n\t}\n\n\tv3, err := strconv.Atoi(result[3])\n\tif err != nil {\n\t\treturn 0, 0, 0, \"\", err\n\t}\n\n\tmode := \"legacy\"\n\tif result[4] != \"\" {\n\t\tmode = result[4]\n\t}\n\treturn v1, v2, v3, mode, nil\n}\n\n// Runs \"iptables --version\" to get the version string\nfunc getIptablesVersionString(path string) (string, error) {\n\tcmd := exec.Command(path, \"--version\")\n\tvar out bytes.Buffer\n\tcmd.Stdout = &out\n\terr := cmd.Run()\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\treturn out.String(), nil\n}\n\n// Checks if an iptables version is after 1.4.11, when --check was added\nfunc iptablesHasCheckCommand(v1 int, v2 int, v3 int) bool {\n\tif v1 > 1 {\n\t\treturn true\n\t}\n\tif v1 == 1 && v2 > 4 {\n\t\treturn true\n\t}\n\tif v1 == 1 && v2 == 4 && v3 >= 11 {\n\t\treturn true\n\t}\n\treturn false\n}\n\n// Checks if an iptables version is after 1.4.20, when --wait was added\nfunc iptablesHasWaitCommand(v1 int, v2 int, v3 int) bool {\n\tif v1 > 1 {\n\t\treturn true\n\t}\n\tif v1 == 1 && v2 > 4 {\n\t\treturn true\n\t}\n\tif v1 == 1 && v2 == 4 && v3 >= 20 {\n\t\treturn true\n\t}\n\treturn false\n}\n\n//Checks if an iptablse version is after 1.6.0, when --wait support second\nfunc iptablesWaitSupportSecond(v1 int, v2 int, v3 int) bool {\n\tif v1 > 1 {\n\t\treturn true\n\t}\n\tif v1 == 1 && v2 >= 6 {\n\t\treturn true\n\t}\n\treturn false\n}\n\n// Checks if an iptables version is after 1.6.2, when --random-fully was added\nfunc iptablesHasRandomFully(v1 int, v2 int, v3 int) bool {\n\tif v1 > 1 {\n\t\treturn true\n\t}\n\tif v1 == 1 && v2 > 6 {\n\t\treturn true\n\t}\n\tif v1 == 1 && v2 == 6 && v3 >= 2 {\n\t\treturn true\n\t}\n\treturn false\n}\n\n// Checks if a rule specification exists for a table\nfunc (ipt *IPTables) existsForOldIptables(table, chain string, rulespec []string) (bool, error) {\n\trs := strings.Join(append([]string{\"-A\", chain}, rulespec...), \" \")\n\targs := []string{\"-t\", table, \"-S\"}\n\tvar stdout bytes.Buffer\n\terr := ipt.runWithOutput(args, &stdout)\n\tif err != nil {\n\t\treturn false, err\n\t}\n\treturn strings.Contains(stdout.String(), rs), nil\n}\n\n// counterRegex is the regex used to detect nftables counter format\nvar counterRegex = regexp.MustCompile(`^\\[([0-9]+):([0-9]+)\\] `)\n\n// filterRuleOutput works around some inconsistencies in output.\n// For example, when iptables is in legacy vs. nftables mode, it produces\n// different results.\nfunc filterRuleOutput(rule string) string {\n\tout := rule\n\n\t// work around an output difference in nftables mode where counters\n\t// are output in iptables-save format, rather than iptables -S format\n\t// The string begins with \"[0:0]\"\n\t//\n\t// Fixes #49\n\tif groups := counterRegex.FindStringSubmatch(out); groups != nil {\n\t\t// drop the brackets\n\t\tout = out[len(groups[0]):]\n\t\tout = fmt.Sprintf(\"%s -c %s %s\", out, groups[1], groups[2])\n\t}\n\n\treturn out\n}\n" }, { "path": "vendor/github.com/coreos/go-iptables/iptables/lock.go", "content": "// Copyright 2015 CoreOS, Inc.\n//\n// Licensed under the Apache License, Version 2.0 (the \"License\");\n// you may not use this file except in compliance with the License.\n// You may obtain a copy of the License at\n//\n// http://www.apache.org/licenses/LICENSE-2.0\n//\n// Unless required by applicable law or agreed to in writing, software\n// distributed under the License is distributed on an \"AS IS\" BASIS,\n// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n// See the License for the specific language governing permissions and\n// limitations under the License.\n\npackage iptables\n\nimport (\n\t\"os\"\n\t\"sync\"\n\t\"syscall\"\n)\n\nconst (\n\t// In earlier versions of iptables, the xtables lock was implemented\n\t// via a Unix socket, but now flock is used via this lockfile:\n\t// http://git.netfilter.org/iptables/commit/?id=aa562a660d1555b13cffbac1e744033e91f82707\n\t// Note the LSB-conforming \"/run\" directory does not exist on old\n\t// distributions, so assume \"/var\" is symlinked\n\txtablesLockFilePath = \"/var/run/xtables.lock\"\n\n\tdefaultFilePerm = 0600\n)\n\ntype Unlocker interface {\n\tUnlock() error\n}\n\ntype nopUnlocker struct{}\n\nfunc (_ nopUnlocker) Unlock() error { return nil }\n\ntype fileLock struct {\n\t// mu is used to protect against concurrent invocations from within this process\n\tmu sync.Mutex\n\tfd int\n}\n\n// tryLock takes an exclusive lock on the xtables lock file without blocking.\n// This is best-effort only: if the exclusive lock would block (i.e. because\n// another process already holds it), no error is returned. Otherwise, any\n// error encountered during the locking operation is returned.\n// The returned Unlocker should be used to release the lock when the caller is\n// done invoking iptables commands.\nfunc (l *fileLock) tryLock() (Unlocker, error) {\n\tl.mu.Lock()\n\terr := syscall.Flock(l.fd, syscall.LOCK_EX|syscall.LOCK_NB)\n\tswitch err {\n\tcase syscall.EWOULDBLOCK:\n\t\tl.mu.Unlock()\n\t\treturn nopUnlocker{}, nil\n\tcase nil:\n\t\treturn l, nil\n\tdefault:\n\t\tl.mu.Unlock()\n\t\treturn nil, err\n\t}\n}\n\n// Unlock closes the underlying file, which implicitly unlocks it as well. It\n// also unlocks the associated mutex.\nfunc (l *fileLock) Unlock() error {\n\tdefer l.mu.Unlock()\n\treturn syscall.Close(l.fd)\n}\n\n// newXtablesFileLock opens a new lock on the xtables lockfile without\n// acquiring the lock\nfunc newXtablesFileLock() (*fileLock, error) {\n\tfd, err := syscall.Open(xtablesLockFilePath, os.O_CREATE, defaultFilePerm)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn &fileLock{fd: fd}, nil\n}\n" }, { "path": "vendor/github.com/fsnotify/fsnotify/.editorconfig", "content": "root = true\n\n[*.go]\nindent_style = tab\nindent_size = 4\ninsert_final_newline = true\n\n[*.{yml,yaml}]\nindent_style = space\nindent_size = 2\ninsert_final_newline = true\ntrim_trailing_whitespace = true\n" }, { "path": "vendor/github.com/fsnotify/fsnotify/.gitattributes", "content": "go.sum linguist-generated\n" }, { "path": "vendor/github.com/fsnotify/fsnotify/.gitignore", "content": "# Setup a Global .gitignore for OS and editor generated files:\n# https://help.github.com/articles/ignoring-files\n# git config --global core.excludesfile ~/.gitignore_global\n\n.vagrant\n*.sublime-project\n" }, { "path": "vendor/github.com/fsnotify/fsnotify/.travis.yml", "content": "sudo: false\nlanguage: go\n\ngo:\n - \"stable\"\n - \"1.11.x\"\n - \"1.10.x\"\n - \"1.9.x\"\n\nmatrix:\n include:\n - go: \"stable\"\n env: GOLINT=true\n allow_failures:\n - go: tip\n fast_finish: true\n\n\nbefore_install:\n - if [ ! -z \"${GOLINT}\" ]; then go get -u golang.org/x/lint/golint; fi\n\nscript:\n - go test --race ./...\n\nafter_script:\n - test -z \"$(gofmt -s -l -w . | tee /dev/stderr)\"\n - if [ ! -z \"${GOLINT}\" ]; then echo running golint; golint --set_exit_status ./...; else echo skipping golint; fi\n - go vet ./...\n\nos:\n - linux\n - osx\n - windows\n\nnotifications:\n email: false\n" }, { "path": "vendor/github.com/fsnotify/fsnotify/AUTHORS", "content": "# Names should be added to this file as\n#\tName or Organization \n# The email address is not required for organizations.\n\n# You can update this list using the following command:\n#\n# $ git shortlog -se | awk '{print $2 \" \" $3 \" \" $4}'\n\n# Please keep the list sorted.\n\nAaron L \nAdrien Bustany \nAmit Krishnan \nAnmol Sethi \nBjørn Erik Pedersen \nBruno Bigras \nCaleb Spare \nCase Nelson \nChris Howey \nChristoffer Buchholz \nDaniel Wagner-Hall \nDave Cheney \nEvan Phoenix \nFrancisco Souza \nHari haran \nJohn C Barstow\nKelvin Fo \nKen-ichirou MATSUZAWA \nMatt Layher \nNathan Youngman \nNickolai Zeldovich \nPatrick \nPaul Hammond \nPawel Knap \nPieter Droogendijk \nPursuit92 \nRiku Voipio \nRob Figueiredo \nRodrigo Chiossi \nSlawek Ligus \nSoge Zhang \nTiffany Jernigan \nTilak Sharma \nTom Payne \nTravis Cline \nTudor Golubenco \nVahe Khachikyan \nYukang \nbronze1man \ndebrando \nhenrikedwards \n铁哥 \n" }, { "path": "vendor/github.com/fsnotify/fsnotify/CHANGELOG.md", "content": "# Changelog\n\n## v1.4.7 / 2018-01-09\n\n* BSD/macOS: Fix possible deadlock on closing the watcher on kqueue (thanks @nhooyr and @glycerine)\n* Tests: Fix missing verb on format string (thanks @rchiossi)\n* Linux: Fix deadlock in Remove (thanks @aarondl)\n* Linux: Watch.Add improvements (avoid race, fix consistency, reduce garbage) (thanks @twpayne)\n* Docs: Moved FAQ into the README (thanks @vahe)\n* Linux: Properly handle inotify's IN_Q_OVERFLOW event (thanks @zeldovich)\n* Docs: replace references to OS X with macOS\n\n## v1.4.2 / 2016-10-10\n\n* Linux: use InotifyInit1 with IN_CLOEXEC to stop leaking a file descriptor to a child process when using fork/exec [#178](https://github.com/fsnotify/fsnotify/pull/178) (thanks @pattyshack)\n\n## v1.4.1 / 2016-10-04\n\n* Fix flaky inotify stress test on Linux [#177](https://github.com/fsnotify/fsnotify/pull/177) (thanks @pattyshack)\n\n## v1.4.0 / 2016-10-01\n\n* add a String() method to Event.Op [#165](https://github.com/fsnotify/fsnotify/pull/165) (thanks @oozie)\n\n## v1.3.1 / 2016-06-28\n\n* Windows: fix for double backslash when watching the root of a drive [#151](https://github.com/fsnotify/fsnotify/issues/151) (thanks @brunoqc)\n\n## v1.3.0 / 2016-04-19\n\n* Support linux/arm64 by [patching](https://go-review.googlesource.com/#/c/21971/) x/sys/unix and switching to to it from syscall (thanks @suihkulokki) [#135](https://github.com/fsnotify/fsnotify/pull/135)\n\n## v1.2.10 / 2016-03-02\n\n* Fix golint errors in windows.go [#121](https://github.com/fsnotify/fsnotify/pull/121) (thanks @tiffanyfj)\n\n## v1.2.9 / 2016-01-13\n\nkqueue: Fix logic for CREATE after REMOVE [#111](https://github.com/fsnotify/fsnotify/pull/111) (thanks @bep)\n\n## v1.2.8 / 2015-12-17\n\n* kqueue: fix race condition in Close [#105](https://github.com/fsnotify/fsnotify/pull/105) (thanks @djui for reporting the issue and @ppknap for writing a failing test)\n* inotify: fix race in test\n* enable race detection for continuous integration (Linux, Mac, Windows)\n\n## v1.2.5 / 2015-10-17\n\n* inotify: use epoll_create1 for arm64 support (requires Linux 2.6.27 or later) [#100](https://github.com/fsnotify/fsnotify/pull/100) (thanks @suihkulokki)\n* inotify: fix path leaks [#73](https://github.com/fsnotify/fsnotify/pull/73) (thanks @chamaken)\n* kqueue: watch for rename events on subdirectories [#83](https://github.com/fsnotify/fsnotify/pull/83) (thanks @guotie)\n* kqueue: avoid infinite loops from symlinks cycles [#101](https://github.com/fsnotify/fsnotify/pull/101) (thanks @illicitonion)\n\n## v1.2.1 / 2015-10-14\n\n* kqueue: don't watch named pipes [#98](https://github.com/fsnotify/fsnotify/pull/98) (thanks @evanphx)\n\n## v1.2.0 / 2015-02-08\n\n* inotify: use epoll to wake up readEvents [#66](https://github.com/fsnotify/fsnotify/pull/66) (thanks @PieterD)\n* inotify: closing watcher should now always shut down goroutine [#63](https://github.com/fsnotify/fsnotify/pull/63) (thanks @PieterD)\n* kqueue: close kqueue after removing watches, fixes [#59](https://github.com/fsnotify/fsnotify/issues/59)\n\n## v1.1.1 / 2015-02-05\n\n* inotify: Retry read on EINTR [#61](https://github.com/fsnotify/fsnotify/issues/61) (thanks @PieterD)\n\n## v1.1.0 / 2014-12-12\n\n* kqueue: rework internals [#43](https://github.com/fsnotify/fsnotify/pull/43)\n * add low-level functions\n * only need to store flags on directories\n * less mutexes [#13](https://github.com/fsnotify/fsnotify/issues/13)\n * done can be an unbuffered channel\n * remove calls to os.NewSyscallError\n* More efficient string concatenation for Event.String() [#52](https://github.com/fsnotify/fsnotify/pull/52) (thanks @mdlayher)\n* kqueue: fix regression in rework causing subdirectories to be watched [#48](https://github.com/fsnotify/fsnotify/issues/48)\n* kqueue: cleanup internal watch before sending remove event [#51](https://github.com/fsnotify/fsnotify/issues/51)\n\n## v1.0.4 / 2014-09-07\n\n* kqueue: add dragonfly to the build tags.\n* Rename source code files, rearrange code so exported APIs are at the top.\n* Add done channel to example code. [#37](https://github.com/fsnotify/fsnotify/pull/37) (thanks @chenyukang)\n\n## v1.0.3 / 2014-08-19\n\n* [Fix] Windows MOVED_TO now translates to Create like on BSD and Linux. [#36](https://github.com/fsnotify/fsnotify/issues/36)\n\n## v1.0.2 / 2014-08-17\n\n* [Fix] Missing create events on macOS. [#14](https://github.com/fsnotify/fsnotify/issues/14) (thanks @zhsso)\n* [Fix] Make ./path and path equivalent. (thanks @zhsso)\n\n## v1.0.0 / 2014-08-15\n\n* [API] Remove AddWatch on Windows, use Add.\n* Improve documentation for exported identifiers. [#30](https://github.com/fsnotify/fsnotify/issues/30)\n* Minor updates based on feedback from golint.\n\n## dev / 2014-07-09\n\n* Moved to [github.com/fsnotify/fsnotify](https://github.com/fsnotify/fsnotify).\n* Use os.NewSyscallError instead of returning errno (thanks @hariharan-uno)\n\n## dev / 2014-07-04\n\n* kqueue: fix incorrect mutex used in Close()\n* Update example to demonstrate usage of Op.\n\n## dev / 2014-06-28\n\n* [API] Don't set the Write Op for attribute notifications [#4](https://github.com/fsnotify/fsnotify/issues/4)\n* Fix for String() method on Event (thanks Alex Brainman)\n* Don't build on Plan 9 or Solaris (thanks @4ad)\n\n## dev / 2014-06-21\n\n* Events channel of type Event rather than *Event.\n* [internal] use syscall constants directly for inotify and kqueue.\n* [internal] kqueue: rename events to kevents and fileEvent to event.\n\n## dev / 2014-06-19\n\n* Go 1.3+ required on Windows (uses syscall.ERROR_MORE_DATA internally).\n* [internal] remove cookie from Event struct (unused).\n* [internal] Event struct has the same definition across every OS.\n* [internal] remove internal watch and removeWatch methods.\n\n## dev / 2014-06-12\n\n* [API] Renamed Watch() to Add() and RemoveWatch() to Remove().\n* [API] Pluralized channel names: Events and Errors.\n* [API] Renamed FileEvent struct to Event.\n* [API] Op constants replace methods like IsCreate().\n\n## dev / 2014-06-12\n\n* Fix data race on kevent buffer (thanks @tilaks) [#98](https://github.com/howeyc/fsnotify/pull/98)\n\n## dev / 2014-05-23\n\n* [API] Remove current implementation of WatchFlags.\n * current implementation doesn't take advantage of OS for efficiency\n * provides little benefit over filtering events as they are received, but has extra bookkeeping and mutexes\n * no tests for the current implementation\n * not fully implemented on Windows [#93](https://github.com/howeyc/fsnotify/issues/93#issuecomment-39285195)\n\n## v0.9.3 / 2014-12-31\n\n* kqueue: cleanup internal watch before sending remove event [#51](https://github.com/fsnotify/fsnotify/issues/51)\n\n## v0.9.2 / 2014-08-17\n\n* [Backport] Fix missing create events on macOS. [#14](https://github.com/fsnotify/fsnotify/issues/14) (thanks @zhsso)\n\n## v0.9.1 / 2014-06-12\n\n* Fix data race on kevent buffer (thanks @tilaks) [#98](https://github.com/howeyc/fsnotify/pull/98)\n\n## v0.9.0 / 2014-01-17\n\n* IsAttrib() for events that only concern a file's metadata [#79][] (thanks @abustany)\n* [Fix] kqueue: fix deadlock [#77][] (thanks @cespare)\n* [NOTICE] Development has moved to `code.google.com/p/go.exp/fsnotify` in preparation for inclusion in the Go standard library.\n\n## v0.8.12 / 2013-11-13\n\n* [API] Remove FD_SET and friends from Linux adapter\n\n## v0.8.11 / 2013-11-02\n\n* [Doc] Add Changelog [#72][] (thanks @nathany)\n* [Doc] Spotlight and double modify events on macOS [#62][] (reported by @paulhammond)\n\n## v0.8.10 / 2013-10-19\n\n* [Fix] kqueue: remove file watches when parent directory is removed [#71][] (reported by @mdwhatcott)\n* [Fix] kqueue: race between Close and readEvents [#70][] (reported by @bernerdschaefer)\n* [Doc] specify OS-specific limits in README (thanks @debrando)\n\n## v0.8.9 / 2013-09-08\n\n* [Doc] Contributing (thanks @nathany)\n* [Doc] update package path in example code [#63][] (thanks @paulhammond)\n* [Doc] GoCI badge in README (Linux only) [#60][]\n* [Doc] Cross-platform testing with Vagrant [#59][] (thanks @nathany)\n\n## v0.8.8 / 2013-06-17\n\n* [Fix] Windows: handle `ERROR_MORE_DATA` on Windows [#49][] (thanks @jbowtie)\n\n## v0.8.7 / 2013-06-03\n\n* [API] Make syscall flags internal\n* [Fix] inotify: ignore event changes\n* [Fix] race in symlink test [#45][] (reported by @srid)\n* [Fix] tests on Windows\n* lower case error messages\n\n## v0.8.6 / 2013-05-23\n\n* kqueue: Use EVT_ONLY flag on Darwin\n* [Doc] Update README with full example\n\n## v0.8.5 / 2013-05-09\n\n* [Fix] inotify: allow monitoring of \"broken\" symlinks (thanks @tsg)\n\n## v0.8.4 / 2013-04-07\n\n* [Fix] kqueue: watch all file events [#40][] (thanks @ChrisBuchholz)\n\n## v0.8.3 / 2013-03-13\n\n* [Fix] inoitfy/kqueue memory leak [#36][] (reported by @nbkolchin)\n* [Fix] kqueue: use fsnFlags for watching a directory [#33][] (reported by @nbkolchin)\n\n## v0.8.2 / 2013-02-07\n\n* [Doc] add Authors\n* [Fix] fix data races for map access [#29][] (thanks @fsouza)\n\n## v0.8.1 / 2013-01-09\n\n* [Fix] Windows path separators\n* [Doc] BSD License\n\n## v0.8.0 / 2012-11-09\n\n* kqueue: directory watching improvements (thanks @vmirage)\n* inotify: add `IN_MOVED_TO` [#25][] (requested by @cpisto)\n* [Fix] kqueue: deleting watched directory [#24][] (reported by @jakerr)\n\n## v0.7.4 / 2012-10-09\n\n* [Fix] inotify: fixes from https://codereview.appspot.com/5418045/ (ugorji)\n* [Fix] kqueue: preserve watch flags when watching for delete [#21][] (reported by @robfig)\n* [Fix] kqueue: watch the directory even if it isn't a new watch (thanks @robfig)\n* [Fix] kqueue: modify after recreation of file\n\n## v0.7.3 / 2012-09-27\n\n* [Fix] kqueue: watch with an existing folder inside the watched folder (thanks @vmirage)\n* [Fix] kqueue: no longer get duplicate CREATE events\n\n## v0.7.2 / 2012-09-01\n\n* kqueue: events for created directories\n\n## v0.7.1 / 2012-07-14\n\n* [Fix] for renaming files\n\n## v0.7.0 / 2012-07-02\n\n* [Feature] FSNotify flags\n* [Fix] inotify: Added file name back to event path\n\n## v0.6.0 / 2012-06-06\n\n* kqueue: watch files after directory created (thanks @tmc)\n\n## v0.5.1 / 2012-05-22\n\n* [Fix] inotify: remove all watches before Close()\n\n## v0.5.0 / 2012-05-03\n\n* [API] kqueue: return errors during watch instead of sending over channel\n* kqueue: match symlink behavior on Linux\n* inotify: add `DELETE_SELF` (requested by @taralx)\n* [Fix] kqueue: handle EINTR (reported by @robfig)\n* [Doc] Godoc example [#1][] (thanks @davecheney)\n\n## v0.4.0 / 2012-03-30\n\n* Go 1 released: build with go tool\n* [Feature] Windows support using winfsnotify\n* Windows does not have attribute change notifications\n* Roll attribute notifications into IsModify\n\n## v0.3.0 / 2012-02-19\n\n* kqueue: add files when watch directory\n\n## v0.2.0 / 2011-12-30\n\n* update to latest Go weekly code\n\n## v0.1.0 / 2011-10-19\n\n* kqueue: add watch on file creation to match inotify\n* kqueue: create file event\n* inotify: ignore `IN_IGNORED` events\n* event String()\n* linux: common FileEvent functions\n* initial commit\n\n[#79]: https://github.com/howeyc/fsnotify/pull/79\n[#77]: https://github.com/howeyc/fsnotify/pull/77\n[#72]: https://github.com/howeyc/fsnotify/issues/72\n[#71]: https://github.com/howeyc/fsnotify/issues/71\n[#70]: https://github.com/howeyc/fsnotify/issues/70\n[#63]: https://github.com/howeyc/fsnotify/issues/63\n[#62]: https://github.com/howeyc/fsnotify/issues/62\n[#60]: https://github.com/howeyc/fsnotify/issues/60\n[#59]: https://github.com/howeyc/fsnotify/issues/59\n[#49]: https://github.com/howeyc/fsnotify/issues/49\n[#45]: https://github.com/howeyc/fsnotify/issues/45\n[#40]: https://github.com/howeyc/fsnotify/issues/40\n[#36]: https://github.com/howeyc/fsnotify/issues/36\n[#33]: https://github.com/howeyc/fsnotify/issues/33\n[#29]: https://github.com/howeyc/fsnotify/issues/29\n[#25]: https://github.com/howeyc/fsnotify/issues/25\n[#24]: https://github.com/howeyc/fsnotify/issues/24\n[#21]: https://github.com/howeyc/fsnotify/issues/21\n" }, { "path": "vendor/github.com/fsnotify/fsnotify/CONTRIBUTING.md", "content": "# Contributing\n\n## Issues\n\n* Request features and report bugs using the [GitHub Issue Tracker](https://github.com/fsnotify/fsnotify/issues).\n* Please indicate the platform you are using fsnotify on.\n* A code example to reproduce the problem is appreciated.\n\n## Pull Requests\n\n### Contributor License Agreement\n\nfsnotify is derived from code in the [golang.org/x/exp](https://godoc.org/golang.org/x/exp) package and it may be included [in the standard library](https://github.com/fsnotify/fsnotify/issues/1) in the future. Therefore fsnotify carries the same [LICENSE](https://github.com/fsnotify/fsnotify/blob/master/LICENSE) as Go. Contributors retain their copyright, so you need to fill out a short form before we can accept your contribution: [Google Individual Contributor License Agreement](https://developers.google.com/open-source/cla/individual).\n\nPlease indicate that you have signed the CLA in your pull request.\n\n### How fsnotify is Developed\n\n* Development is done on feature branches.\n* Tests are run on BSD, Linux, macOS and Windows.\n* Pull requests are reviewed and [applied to master][am] using [hub][].\n * Maintainers may modify or squash commits rather than asking contributors to.\n* To issue a new release, the maintainers will:\n * Update the CHANGELOG\n * Tag a version, which will become available through gopkg.in.\n \n### How to Fork\n\nFor smooth sailing, always use the original import path. Installing with `go get` makes this easy. \n\n1. Install from GitHub (`go get -u github.com/fsnotify/fsnotify`)\n2. Create your feature branch (`git checkout -b my-new-feature`)\n3. Ensure everything works and the tests pass (see below)\n4. Commit your changes (`git commit -am 'Add some feature'`)\n\nContribute upstream:\n\n1. Fork fsnotify on GitHub\n2. Add your remote (`git remote add fork git@github.com:mycompany/repo.git`)\n3. Push to the branch (`git push fork my-new-feature`)\n4. Create a new Pull Request on GitHub\n\nThis workflow is [thoroughly explained by Katrina Owen](https://splice.com/blog/contributing-open-source-git-repositories-go/).\n\n### Testing\n\nfsnotify uses build tags to compile different code on Linux, BSD, macOS, and Windows.\n\nBefore doing a pull request, please do your best to test your changes on multiple platforms, and list which platforms you were able/unable to test on.\n\nTo aid in cross-platform testing there is a Vagrantfile for Linux and BSD.\n\n* Install [Vagrant](http://www.vagrantup.com/) and [VirtualBox](https://www.virtualbox.org/)\n* Setup [Vagrant Gopher](https://github.com/nathany/vagrant-gopher) in your `src` folder.\n* Run `vagrant up` from the project folder. You can also setup just one box with `vagrant up linux` or `vagrant up bsd` (note: the BSD box doesn't support Windows hosts at this time, and NFS may prompt for your host OS password)\n* Once setup, you can run the test suite on a given OS with a single command `vagrant ssh linux -c 'cd fsnotify/fsnotify; go test'`.\n* When you're done, you will want to halt or destroy the Vagrant boxes.\n\nNotice: fsnotify file system events won't trigger in shared folders. The tests get around this limitation by using the /tmp directory.\n\nRight now there is no equivalent solution for Windows and macOS, but there are Windows VMs [freely available from Microsoft](http://www.modern.ie/en-us/virtualization-tools#downloads).\n\n### Maintainers\n\nHelp maintaining fsnotify is welcome. To be a maintainer:\n\n* Submit a pull request and sign the CLA as above.\n* You must be able to run the test suite on Mac, Windows, Linux and BSD.\n\nTo keep master clean, the fsnotify project uses the \"apply mail\" workflow outlined in Nathaniel Talbott's post [\"Merge pull request\" Considered Harmful][am]. This requires installing [hub][].\n\nAll code changes should be internal pull requests.\n\nReleases are tagged using [Semantic Versioning](http://semver.org/).\n\n[hub]: https://github.com/github/hub\n[am]: http://blog.spreedly.com/2014/06/24/merge-pull-request-considered-harmful/#.VGa5yZPF_Zs\n" }, { "path": "vendor/github.com/fsnotify/fsnotify/LICENSE", "content": "Copyright (c) 2012 The Go Authors. All rights reserved.\nCopyright (c) 2012-2019 fsnotify Authors. All rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are\nmet:\n\n * Redistributions of source code must retain the above copyright\nnotice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above\ncopyright notice, this list of conditions and the following disclaimer\nin the documentation and/or other materials provided with the\ndistribution.\n * Neither the name of Google Inc. nor the names of its\ncontributors may be used to endorse or promote products derived from\nthis software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\nLIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\nA PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\nOWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\nSPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\nLIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\nDATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\nTHEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n" }, { "path": "vendor/github.com/fsnotify/fsnotify/README.md", "content": "# File system notifications for Go\n\n[![GoDoc](https://godoc.org/github.com/fsnotify/fsnotify?status.svg)](https://godoc.org/github.com/fsnotify/fsnotify) [![Go Report Card](https://goreportcard.com/badge/github.com/fsnotify/fsnotify)](https://goreportcard.com/report/github.com/fsnotify/fsnotify)\n\nfsnotify utilizes [golang.org/x/sys](https://godoc.org/golang.org/x/sys) rather than `syscall` from the standard library. Ensure you have the latest version installed by running:\n\n```console\ngo get -u golang.org/x/sys/...\n```\n\nCross platform: Windows, Linux, BSD and macOS.\n\n| Adapter | OS | Status |\n| --------------------- | -------------------------------- | ------------------------------------------------------------------------------------------------------------------------------- |\n| inotify | Linux 2.6.27 or later, Android\\* | Supported [![Build Status](https://travis-ci.org/fsnotify/fsnotify.svg?branch=master)](https://travis-ci.org/fsnotify/fsnotify) |\n| kqueue | BSD, macOS, iOS\\* | Supported [![Build Status](https://travis-ci.org/fsnotify/fsnotify.svg?branch=master)](https://travis-ci.org/fsnotify/fsnotify) |\n| ReadDirectoryChangesW | Windows | Supported [![Build Status](https://travis-ci.org/fsnotify/fsnotify.svg?branch=master)](https://travis-ci.org/fsnotify/fsnotify) |\n| FSEvents | macOS | [Planned](https://github.com/fsnotify/fsnotify/issues/11) |\n| FEN | Solaris 11 | [In Progress](https://github.com/fsnotify/fsnotify/issues/12) |\n| fanotify | Linux 2.6.37+ | [Planned](https://github.com/fsnotify/fsnotify/issues/114) |\n| USN Journals | Windows | [Maybe](https://github.com/fsnotify/fsnotify/issues/53) |\n| Polling | *All* | [Maybe](https://github.com/fsnotify/fsnotify/issues/9) |\n\n\\* Android and iOS are untested.\n\nPlease see [the documentation](https://godoc.org/github.com/fsnotify/fsnotify) and consult the [FAQ](#faq) for usage information.\n\n## API stability\n\nfsnotify is a fork of [howeyc/fsnotify](https://godoc.org/github.com/howeyc/fsnotify) with a new API as of v1.0. The API is based on [this design document](http://goo.gl/MrYxyA). \n\nAll [releases](https://github.com/fsnotify/fsnotify/releases) are tagged based on [Semantic Versioning](http://semver.org/). Further API changes are [planned](https://github.com/fsnotify/fsnotify/milestones), and will be tagged with a new major revision number.\n\nGo 1.6 supports dependencies located in the `vendor/` folder. Unless you are creating a library, it is recommended that you copy fsnotify into `vendor/github.com/fsnotify/fsnotify` within your project, and likewise for `golang.org/x/sys`.\n\n## Usage\n\n```go\npackage main\n\nimport (\n\t\"log\"\n\n\t\"github.com/fsnotify/fsnotify\"\n)\n\nfunc main() {\n\twatcher, err := fsnotify.NewWatcher()\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\tdefer watcher.Close()\n\n\tdone := make(chan bool)\n\tgo func() {\n\t\tfor {\n\t\t\tselect {\n\t\t\tcase event, ok := <-watcher.Events:\n\t\t\t\tif !ok {\n\t\t\t\t\treturn\n\t\t\t\t}\n\t\t\t\tlog.Println(\"event:\", event)\n\t\t\t\tif event.Op&fsnotify.Write == fsnotify.Write {\n\t\t\t\t\tlog.Println(\"modified file:\", event.Name)\n\t\t\t\t}\n\t\t\tcase err, ok := <-watcher.Errors:\n\t\t\t\tif !ok {\n\t\t\t\t\treturn\n\t\t\t\t}\n\t\t\t\tlog.Println(\"error:\", err)\n\t\t\t}\n\t\t}\n\t}()\n\n\terr = watcher.Add(\"/tmp/foo\")\n\tif err != nil {\n\t\tlog.Fatal(err)\n\t}\n\t<-done\n}\n```\n\n## Contributing\n\nPlease refer to [CONTRIBUTING][] before opening an issue or pull request.\n\n## Example\n\nSee [example_test.go](https://github.com/fsnotify/fsnotify/blob/master/example_test.go).\n\n## FAQ\n\n**When a file is moved to another directory is it still being watched?**\n\nNo (it shouldn't be, unless you are watching where it was moved to).\n\n**When I watch a directory, are all subdirectories watched as well?**\n\nNo, you must add watches for any directory you want to watch (a recursive watcher is on the roadmap [#18][]).\n\n**Do I have to watch the Error and Event channels in a separate goroutine?**\n\nAs of now, yes. Looking into making this single-thread friendly (see [howeyc #7][#7])\n\n**Why am I receiving multiple events for the same file on OS X?**\n\nSpotlight indexing on OS X can result in multiple events (see [howeyc #62][#62]). A temporary workaround is to add your folder(s) to the *Spotlight Privacy settings* until we have a native FSEvents implementation (see [#11][]).\n\n**How many files can be watched at once?**\n\nThere are OS-specific limits as to how many watches can be created:\n* Linux: /proc/sys/fs/inotify/max_user_watches contains the limit, reaching this limit results in a \"no space left on device\" error.\n* BSD / OSX: sysctl variables \"kern.maxfiles\" and \"kern.maxfilesperproc\", reaching these limits results in a \"too many open files\" error.\n\n**Why don't notifications work with NFS filesystems or filesystem in userspace (FUSE)?**\n\nfsnotify requires support from underlying OS to work. The current NFS protocol does not provide network level support for file notifications.\n\n[#62]: https://github.com/howeyc/fsnotify/issues/62\n[#18]: https://github.com/fsnotify/fsnotify/issues/18\n[#11]: https://github.com/fsnotify/fsnotify/issues/11\n[#7]: https://github.com/howeyc/fsnotify/issues/7\n\n[contributing]: https://github.com/fsnotify/fsnotify/blob/master/CONTRIBUTING.md\n\n## Related Projects\n\n* [notify](https://github.com/rjeczalik/notify)\n* [fsevents](https://github.com/fsnotify/fsevents)\n\n" }, { "path": "vendor/github.com/fsnotify/fsnotify/fen.go", "content": "// Copyright 2010 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// +build solaris\n\npackage fsnotify\n\nimport (\n\t\"errors\"\n)\n\n// Watcher watches a set of files, delivering events to a channel.\ntype Watcher struct {\n\tEvents chan Event\n\tErrors chan error\n}\n\n// NewWatcher establishes a new watcher with the underlying OS and begins waiting for events.\nfunc NewWatcher() (*Watcher, error) {\n\treturn nil, errors.New(\"FEN based watcher not yet supported for fsnotify\\n\")\n}\n\n// Close removes all watches and closes the events channel.\nfunc (w *Watcher) Close() error {\n\treturn nil\n}\n\n// Add starts watching the named file or directory (non-recursively).\nfunc (w *Watcher) Add(name string) error {\n\treturn nil\n}\n\n// Remove stops watching the the named file or directory (non-recursively).\nfunc (w *Watcher) Remove(name string) error {\n\treturn nil\n}\n" }, { "path": "vendor/github.com/fsnotify/fsnotify/fsnotify.go", "content": "// Copyright 2012 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// +build !plan9\n\n// Package fsnotify provides a platform-independent interface for file system notifications.\npackage fsnotify\n\nimport (\n\t\"bytes\"\n\t\"errors\"\n\t\"fmt\"\n)\n\n// Event represents a single file system notification.\ntype Event struct {\n\tName string // Relative path to the file or directory.\n\tOp Op // File operation that triggered the event.\n}\n\n// Op describes a set of file operations.\ntype Op uint32\n\n// These are the generalized file operations that can trigger a notification.\nconst (\n\tCreate Op = 1 << iota\n\tWrite\n\tRemove\n\tRename\n\tChmod\n)\n\nfunc (op Op) String() string {\n\t// Use a buffer for efficient string concatenation\n\tvar buffer bytes.Buffer\n\n\tif op&Create == Create {\n\t\tbuffer.WriteString(\"|CREATE\")\n\t}\n\tif op&Remove == Remove {\n\t\tbuffer.WriteString(\"|REMOVE\")\n\t}\n\tif op&Write == Write {\n\t\tbuffer.WriteString(\"|WRITE\")\n\t}\n\tif op&Rename == Rename {\n\t\tbuffer.WriteString(\"|RENAME\")\n\t}\n\tif op&Chmod == Chmod {\n\t\tbuffer.WriteString(\"|CHMOD\")\n\t}\n\tif buffer.Len() == 0 {\n\t\treturn \"\"\n\t}\n\treturn buffer.String()[1:] // Strip leading pipe\n}\n\n// String returns a string representation of the event in the form\n// \"file: REMOVE|WRITE|...\"\nfunc (e Event) String() string {\n\treturn fmt.Sprintf(\"%q: %s\", e.Name, e.Op.String())\n}\n\n// Common errors that can be reported by a watcher\nvar (\n\tErrEventOverflow = errors.New(\"fsnotify queue overflow\")\n)\n" }, { "path": "vendor/github.com/fsnotify/fsnotify/go.mod", "content": "module github.com/fsnotify/fsnotify\n\ngo 1.13\n\nrequire golang.org/x/sys v0.0.0-20191005200804-aed5e4c7ecf9\n" }, { "path": "vendor/github.com/fsnotify/fsnotify/go.sum", "content": "golang.org/x/sys v0.0.0-20191005200804-aed5e4c7ecf9 h1:L2auWcuQIvxz9xSEqzESnV/QN/gNRXNApHi3fYwl2w0=\ngolang.org/x/sys v0.0.0-20191005200804-aed5e4c7ecf9/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\n" }, { "path": "vendor/github.com/fsnotify/fsnotify/inotify.go", "content": "// Copyright 2010 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// +build linux\n\npackage fsnotify\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"io\"\n\t\"os\"\n\t\"path/filepath\"\n\t\"strings\"\n\t\"sync\"\n\t\"unsafe\"\n\n\t\"golang.org/x/sys/unix\"\n)\n\n// Watcher watches a set of files, delivering events to a channel.\ntype Watcher struct {\n\tEvents chan Event\n\tErrors chan error\n\tmu sync.Mutex // Map access\n\tfd int\n\tpoller *fdPoller\n\twatches map[string]*watch // Map of inotify watches (key: path)\n\tpaths map[int]string // Map of watched paths (key: watch descriptor)\n\tdone chan struct{} // Channel for sending a \"quit message\" to the reader goroutine\n\tdoneResp chan struct{} // Channel to respond to Close\n}\n\n// NewWatcher establishes a new watcher with the underlying OS and begins waiting for events.\nfunc NewWatcher() (*Watcher, error) {\n\t// Create inotify fd\n\tfd, errno := unix.InotifyInit1(unix.IN_CLOEXEC)\n\tif fd == -1 {\n\t\treturn nil, errno\n\t}\n\t// Create epoll\n\tpoller, err := newFdPoller(fd)\n\tif err != nil {\n\t\tunix.Close(fd)\n\t\treturn nil, err\n\t}\n\tw := &Watcher{\n\t\tfd: fd,\n\t\tpoller: poller,\n\t\twatches: make(map[string]*watch),\n\t\tpaths: make(map[int]string),\n\t\tEvents: make(chan Event),\n\t\tErrors: make(chan error),\n\t\tdone: make(chan struct{}),\n\t\tdoneResp: make(chan struct{}),\n\t}\n\n\tgo w.readEvents()\n\treturn w, nil\n}\n\nfunc (w *Watcher) isClosed() bool {\n\tselect {\n\tcase <-w.done:\n\t\treturn true\n\tdefault:\n\t\treturn false\n\t}\n}\n\n// Close removes all watches and closes the events channel.\nfunc (w *Watcher) Close() error {\n\tif w.isClosed() {\n\t\treturn nil\n\t}\n\n\t// Send 'close' signal to goroutine, and set the Watcher to closed.\n\tclose(w.done)\n\n\t// Wake up goroutine\n\tw.poller.wake()\n\n\t// Wait for goroutine to close\n\t<-w.doneResp\n\n\treturn nil\n}\n\n// Add starts watching the named file or directory (non-recursively).\nfunc (w *Watcher) Add(name string) error {\n\tname = filepath.Clean(name)\n\tif w.isClosed() {\n\t\treturn errors.New(\"inotify instance already closed\")\n\t}\n\n\tconst agnosticEvents = unix.IN_MOVED_TO | unix.IN_MOVED_FROM |\n\t\tunix.IN_CREATE | unix.IN_ATTRIB | unix.IN_MODIFY |\n\t\tunix.IN_MOVE_SELF | unix.IN_DELETE | unix.IN_DELETE_SELF\n\n\tvar flags uint32 = agnosticEvents\n\n\tw.mu.Lock()\n\tdefer w.mu.Unlock()\n\twatchEntry := w.watches[name]\n\tif watchEntry != nil {\n\t\tflags |= watchEntry.flags | unix.IN_MASK_ADD\n\t}\n\twd, errno := unix.InotifyAddWatch(w.fd, name, flags)\n\tif wd == -1 {\n\t\treturn errno\n\t}\n\n\tif watchEntry == nil {\n\t\tw.watches[name] = &watch{wd: uint32(wd), flags: flags}\n\t\tw.paths[wd] = name\n\t} else {\n\t\twatchEntry.wd = uint32(wd)\n\t\twatchEntry.flags = flags\n\t}\n\n\treturn nil\n}\n\n// Remove stops watching the named file or directory (non-recursively).\nfunc (w *Watcher) Remove(name string) error {\n\tname = filepath.Clean(name)\n\n\t// Fetch the watch.\n\tw.mu.Lock()\n\tdefer w.mu.Unlock()\n\twatch, ok := w.watches[name]\n\n\t// Remove it from inotify.\n\tif !ok {\n\t\treturn fmt.Errorf(\"can't remove non-existent inotify watch for: %s\", name)\n\t}\n\n\t// We successfully removed the watch if InotifyRmWatch doesn't return an\n\t// error, we need to clean up our internal state to ensure it matches\n\t// inotify's kernel state.\n\tdelete(w.paths, int(watch.wd))\n\tdelete(w.watches, name)\n\n\t// inotify_rm_watch will return EINVAL if the file has been deleted;\n\t// the inotify will already have been removed.\n\t// watches and pathes are deleted in ignoreLinux() implicitly and asynchronously\n\t// by calling inotify_rm_watch() below. e.g. readEvents() goroutine receives IN_IGNORE\n\t// so that EINVAL means that the wd is being rm_watch()ed or its file removed\n\t// by another thread and we have not received IN_IGNORE event.\n\tsuccess, errno := unix.InotifyRmWatch(w.fd, watch.wd)\n\tif success == -1 {\n\t\t// TODO: Perhaps it's not helpful to return an error here in every case.\n\t\t// the only two possible errors are:\n\t\t// EBADF, which happens when w.fd is not a valid file descriptor of any kind.\n\t\t// EINVAL, which is when fd is not an inotify descriptor or wd is not a valid watch descriptor.\n\t\t// Watch descriptors are invalidated when they are removed explicitly or implicitly;\n\t\t// explicitly by inotify_rm_watch, implicitly when the file they are watching is deleted.\n\t\treturn errno\n\t}\n\n\treturn nil\n}\n\ntype watch struct {\n\twd uint32 // Watch descriptor (as returned by the inotify_add_watch() syscall)\n\tflags uint32 // inotify flags of this watch (see inotify(7) for the list of valid flags)\n}\n\n// readEvents reads from the inotify file descriptor, converts the\n// received events into Event objects and sends them via the Events channel\nfunc (w *Watcher) readEvents() {\n\tvar (\n\t\tbuf [unix.SizeofInotifyEvent * 4096]byte // Buffer for a maximum of 4096 raw events\n\t\tn int // Number of bytes read with read()\n\t\terrno error // Syscall errno\n\t\tok bool // For poller.wait\n\t)\n\n\tdefer close(w.doneResp)\n\tdefer close(w.Errors)\n\tdefer close(w.Events)\n\tdefer unix.Close(w.fd)\n\tdefer w.poller.close()\n\n\tfor {\n\t\t// See if we have been closed.\n\t\tif w.isClosed() {\n\t\t\treturn\n\t\t}\n\n\t\tok, errno = w.poller.wait()\n\t\tif errno != nil {\n\t\t\tselect {\n\t\t\tcase w.Errors <- errno:\n\t\t\tcase <-w.done:\n\t\t\t\treturn\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\n\t\tif !ok {\n\t\t\tcontinue\n\t\t}\n\n\t\tn, errno = unix.Read(w.fd, buf[:])\n\t\t// If a signal interrupted execution, see if we've been asked to close, and try again.\n\t\t// http://man7.org/linux/man-pages/man7/signal.7.html :\n\t\t// \"Before Linux 3.8, reads from an inotify(7) file descriptor were not restartable\"\n\t\tif errno == unix.EINTR {\n\t\t\tcontinue\n\t\t}\n\n\t\t// unix.Read might have been woken up by Close. If so, we're done.\n\t\tif w.isClosed() {\n\t\t\treturn\n\t\t}\n\n\t\tif n < unix.SizeofInotifyEvent {\n\t\t\tvar err error\n\t\t\tif n == 0 {\n\t\t\t\t// If EOF is received. This should really never happen.\n\t\t\t\terr = io.EOF\n\t\t\t} else if n < 0 {\n\t\t\t\t// If an error occurred while reading.\n\t\t\t\terr = errno\n\t\t\t} else {\n\t\t\t\t// Read was too short.\n\t\t\t\terr = errors.New(\"notify: short read in readEvents()\")\n\t\t\t}\n\t\t\tselect {\n\t\t\tcase w.Errors <- err:\n\t\t\tcase <-w.done:\n\t\t\t\treturn\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\n\t\tvar offset uint32\n\t\t// We don't know how many events we just read into the buffer\n\t\t// While the offset points to at least one whole event...\n\t\tfor offset <= uint32(n-unix.SizeofInotifyEvent) {\n\t\t\t// Point \"raw\" to the event in the buffer\n\t\t\traw := (*unix.InotifyEvent)(unsafe.Pointer(&buf[offset]))\n\n\t\t\tmask := uint32(raw.Mask)\n\t\t\tnameLen := uint32(raw.Len)\n\n\t\t\tif mask&unix.IN_Q_OVERFLOW != 0 {\n\t\t\t\tselect {\n\t\t\t\tcase w.Errors <- ErrEventOverflow:\n\t\t\t\tcase <-w.done:\n\t\t\t\t\treturn\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// If the event happened to the watched directory or the watched file, the kernel\n\t\t\t// doesn't append the filename to the event, but we would like to always fill the\n\t\t\t// the \"Name\" field with a valid filename. We retrieve the path of the watch from\n\t\t\t// the \"paths\" map.\n\t\t\tw.mu.Lock()\n\t\t\tname, ok := w.paths[int(raw.Wd)]\n\t\t\t// IN_DELETE_SELF occurs when the file/directory being watched is removed.\n\t\t\t// This is a sign to clean up the maps, otherwise we are no longer in sync\n\t\t\t// with the inotify kernel state which has already deleted the watch\n\t\t\t// automatically.\n\t\t\tif ok && mask&unix.IN_DELETE_SELF == unix.IN_DELETE_SELF {\n\t\t\t\tdelete(w.paths, int(raw.Wd))\n\t\t\t\tdelete(w.watches, name)\n\t\t\t}\n\t\t\tw.mu.Unlock()\n\n\t\t\tif nameLen > 0 {\n\t\t\t\t// Point \"bytes\" at the first byte of the filename\n\t\t\t\tbytes := (*[unix.PathMax]byte)(unsafe.Pointer(&buf[offset+unix.SizeofInotifyEvent]))\n\t\t\t\t// The filename is padded with NULL bytes. TrimRight() gets rid of those.\n\t\t\t\tname += \"/\" + strings.TrimRight(string(bytes[0:nameLen]), \"\\000\")\n\t\t\t}\n\n\t\t\tevent := newEvent(name, mask)\n\n\t\t\t// Send the events that are not ignored on the events channel\n\t\t\tif !event.ignoreLinux(mask) {\n\t\t\t\tselect {\n\t\t\t\tcase w.Events <- event:\n\t\t\t\tcase <-w.done:\n\t\t\t\t\treturn\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Move to the next event in the buffer\n\t\t\toffset += unix.SizeofInotifyEvent + nameLen\n\t\t}\n\t}\n}\n\n// Certain types of events can be \"ignored\" and not sent over the Events\n// channel. Such as events marked ignore by the kernel, or MODIFY events\n// against files that do not exist.\nfunc (e *Event) ignoreLinux(mask uint32) bool {\n\t// Ignore anything the inotify API says to ignore\n\tif mask&unix.IN_IGNORED == unix.IN_IGNORED {\n\t\treturn true\n\t}\n\n\t// If the event is not a DELETE or RENAME, the file must exist.\n\t// Otherwise the event is ignored.\n\t// *Note*: this was put in place because it was seen that a MODIFY\n\t// event was sent after the DELETE. This ignores that MODIFY and\n\t// assumes a DELETE will come or has come if the file doesn't exist.\n\tif !(e.Op&Remove == Remove || e.Op&Rename == Rename) {\n\t\t_, statErr := os.Lstat(e.Name)\n\t\treturn os.IsNotExist(statErr)\n\t}\n\treturn false\n}\n\n// newEvent returns an platform-independent Event based on an inotify mask.\nfunc newEvent(name string, mask uint32) Event {\n\te := Event{Name: name}\n\tif mask&unix.IN_CREATE == unix.IN_CREATE || mask&unix.IN_MOVED_TO == unix.IN_MOVED_TO {\n\t\te.Op |= Create\n\t}\n\tif mask&unix.IN_DELETE_SELF == unix.IN_DELETE_SELF || mask&unix.IN_DELETE == unix.IN_DELETE {\n\t\te.Op |= Remove\n\t}\n\tif mask&unix.IN_MODIFY == unix.IN_MODIFY {\n\t\te.Op |= Write\n\t}\n\tif mask&unix.IN_MOVE_SELF == unix.IN_MOVE_SELF || mask&unix.IN_MOVED_FROM == unix.IN_MOVED_FROM {\n\t\te.Op |= Rename\n\t}\n\tif mask&unix.IN_ATTRIB == unix.IN_ATTRIB {\n\t\te.Op |= Chmod\n\t}\n\treturn e\n}\n" }, { "path": "vendor/github.com/fsnotify/fsnotify/inotify_poller.go", "content": "// Copyright 2015 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// +build linux\n\npackage fsnotify\n\nimport (\n\t\"errors\"\n\n\t\"golang.org/x/sys/unix\"\n)\n\ntype fdPoller struct {\n\tfd int // File descriptor (as returned by the inotify_init() syscall)\n\tepfd int // Epoll file descriptor\n\tpipe [2]int // Pipe for waking up\n}\n\nfunc emptyPoller(fd int) *fdPoller {\n\tpoller := new(fdPoller)\n\tpoller.fd = fd\n\tpoller.epfd = -1\n\tpoller.pipe[0] = -1\n\tpoller.pipe[1] = -1\n\treturn poller\n}\n\n// Create a new inotify poller.\n// This creates an inotify handler, and an epoll handler.\nfunc newFdPoller(fd int) (*fdPoller, error) {\n\tvar errno error\n\tpoller := emptyPoller(fd)\n\tdefer func() {\n\t\tif errno != nil {\n\t\t\tpoller.close()\n\t\t}\n\t}()\n\tpoller.fd = fd\n\n\t// Create epoll fd\n\tpoller.epfd, errno = unix.EpollCreate1(unix.EPOLL_CLOEXEC)\n\tif poller.epfd == -1 {\n\t\treturn nil, errno\n\t}\n\t// Create pipe; pipe[0] is the read end, pipe[1] the write end.\n\terrno = unix.Pipe2(poller.pipe[:], unix.O_NONBLOCK|unix.O_CLOEXEC)\n\tif errno != nil {\n\t\treturn nil, errno\n\t}\n\n\t// Register inotify fd with epoll\n\tevent := unix.EpollEvent{\n\t\tFd: int32(poller.fd),\n\t\tEvents: unix.EPOLLIN,\n\t}\n\terrno = unix.EpollCtl(poller.epfd, unix.EPOLL_CTL_ADD, poller.fd, &event)\n\tif errno != nil {\n\t\treturn nil, errno\n\t}\n\n\t// Register pipe fd with epoll\n\tevent = unix.EpollEvent{\n\t\tFd: int32(poller.pipe[0]),\n\t\tEvents: unix.EPOLLIN,\n\t}\n\terrno = unix.EpollCtl(poller.epfd, unix.EPOLL_CTL_ADD, poller.pipe[0], &event)\n\tif errno != nil {\n\t\treturn nil, errno\n\t}\n\n\treturn poller, nil\n}\n\n// Wait using epoll.\n// Returns true if something is ready to be read,\n// false if there is not.\nfunc (poller *fdPoller) wait() (bool, error) {\n\t// 3 possible events per fd, and 2 fds, makes a maximum of 6 events.\n\t// I don't know whether epoll_wait returns the number of events returned,\n\t// or the total number of events ready.\n\t// I decided to catch both by making the buffer one larger than the maximum.\n\tevents := make([]unix.EpollEvent, 7)\n\tfor {\n\t\tn, errno := unix.EpollWait(poller.epfd, events, -1)\n\t\tif n == -1 {\n\t\t\tif errno == unix.EINTR {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\treturn false, errno\n\t\t}\n\t\tif n == 0 {\n\t\t\t// If there are no events, try again.\n\t\t\tcontinue\n\t\t}\n\t\tif n > 6 {\n\t\t\t// This should never happen. More events were returned than should be possible.\n\t\t\treturn false, errors.New(\"epoll_wait returned more events than I know what to do with\")\n\t\t}\n\t\tready := events[:n]\n\t\tepollhup := false\n\t\tepollerr := false\n\t\tepollin := false\n\t\tfor _, event := range ready {\n\t\t\tif event.Fd == int32(poller.fd) {\n\t\t\t\tif event.Events&unix.EPOLLHUP != 0 {\n\t\t\t\t\t// This should not happen, but if it does, treat it as a wakeup.\n\t\t\t\t\tepollhup = true\n\t\t\t\t}\n\t\t\t\tif event.Events&unix.EPOLLERR != 0 {\n\t\t\t\t\t// If an error is waiting on the file descriptor, we should pretend\n\t\t\t\t\t// something is ready to read, and let unix.Read pick up the error.\n\t\t\t\t\tepollerr = true\n\t\t\t\t}\n\t\t\t\tif event.Events&unix.EPOLLIN != 0 {\n\t\t\t\t\t// There is data to read.\n\t\t\t\t\tepollin = true\n\t\t\t\t}\n\t\t\t}\n\t\t\tif event.Fd == int32(poller.pipe[0]) {\n\t\t\t\tif event.Events&unix.EPOLLHUP != 0 {\n\t\t\t\t\t// Write pipe descriptor was closed, by us. This means we're closing down the\n\t\t\t\t\t// watcher, and we should wake up.\n\t\t\t\t}\n\t\t\t\tif event.Events&unix.EPOLLERR != 0 {\n\t\t\t\t\t// If an error is waiting on the pipe file descriptor.\n\t\t\t\t\t// This is an absolute mystery, and should never ever happen.\n\t\t\t\t\treturn false, errors.New(\"Error on the pipe descriptor.\")\n\t\t\t\t}\n\t\t\t\tif event.Events&unix.EPOLLIN != 0 {\n\t\t\t\t\t// This is a regular wakeup, so we have to clear the buffer.\n\t\t\t\t\terr := poller.clearWake()\n\t\t\t\t\tif err != nil {\n\t\t\t\t\t\treturn false, err\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif epollhup || epollerr || epollin {\n\t\t\treturn true, nil\n\t\t}\n\t\treturn false, nil\n\t}\n}\n\n// Close the write end of the poller.\nfunc (poller *fdPoller) wake() error {\n\tbuf := make([]byte, 1)\n\tn, errno := unix.Write(poller.pipe[1], buf)\n\tif n == -1 {\n\t\tif errno == unix.EAGAIN {\n\t\t\t// Buffer is full, poller will wake.\n\t\t\treturn nil\n\t\t}\n\t\treturn errno\n\t}\n\treturn nil\n}\n\nfunc (poller *fdPoller) clearWake() error {\n\t// You have to be woken up a LOT in order to get to 100!\n\tbuf := make([]byte, 100)\n\tn, errno := unix.Read(poller.pipe[0], buf)\n\tif n == -1 {\n\t\tif errno == unix.EAGAIN {\n\t\t\t// Buffer is empty, someone else cleared our wake.\n\t\t\treturn nil\n\t\t}\n\t\treturn errno\n\t}\n\treturn nil\n}\n\n// Close all poller file descriptors, but not the one passed to it.\nfunc (poller *fdPoller) close() {\n\tif poller.pipe[1] != -1 {\n\t\tunix.Close(poller.pipe[1])\n\t}\n\tif poller.pipe[0] != -1 {\n\t\tunix.Close(poller.pipe[0])\n\t}\n\tif poller.epfd != -1 {\n\t\tunix.Close(poller.epfd)\n\t}\n}\n" }, { "path": "vendor/github.com/fsnotify/fsnotify/kqueue.go", "content": "// Copyright 2010 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// +build freebsd openbsd netbsd dragonfly darwin\n\npackage fsnotify\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"io/ioutil\"\n\t\"os\"\n\t\"path/filepath\"\n\t\"sync\"\n\t\"time\"\n\n\t\"golang.org/x/sys/unix\"\n)\n\n// Watcher watches a set of files, delivering events to a channel.\ntype Watcher struct {\n\tEvents chan Event\n\tErrors chan error\n\tdone chan struct{} // Channel for sending a \"quit message\" to the reader goroutine\n\n\tkq int // File descriptor (as returned by the kqueue() syscall).\n\n\tmu sync.Mutex // Protects access to watcher data\n\twatches map[string]int // Map of watched file descriptors (key: path).\n\texternalWatches map[string]bool // Map of watches added by user of the library.\n\tdirFlags map[string]uint32 // Map of watched directories to fflags used in kqueue.\n\tpaths map[int]pathInfo // Map file descriptors to path names for processing kqueue events.\n\tfileExists map[string]bool // Keep track of if we know this file exists (to stop duplicate create events).\n\tisClosed bool // Set to true when Close() is first called\n}\n\ntype pathInfo struct {\n\tname string\n\tisDir bool\n}\n\n// NewWatcher establishes a new watcher with the underlying OS and begins waiting for events.\nfunc NewWatcher() (*Watcher, error) {\n\tkq, err := kqueue()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tw := &Watcher{\n\t\tkq: kq,\n\t\twatches: make(map[string]int),\n\t\tdirFlags: make(map[string]uint32),\n\t\tpaths: make(map[int]pathInfo),\n\t\tfileExists: make(map[string]bool),\n\t\texternalWatches: make(map[string]bool),\n\t\tEvents: make(chan Event),\n\t\tErrors: make(chan error),\n\t\tdone: make(chan struct{}),\n\t}\n\n\tgo w.readEvents()\n\treturn w, nil\n}\n\n// Close removes all watches and closes the events channel.\nfunc (w *Watcher) Close() error {\n\tw.mu.Lock()\n\tif w.isClosed {\n\t\tw.mu.Unlock()\n\t\treturn nil\n\t}\n\tw.isClosed = true\n\n\t// copy paths to remove while locked\n\tvar pathsToRemove = make([]string, 0, len(w.watches))\n\tfor name := range w.watches {\n\t\tpathsToRemove = append(pathsToRemove, name)\n\t}\n\tw.mu.Unlock()\n\t// unlock before calling Remove, which also locks\n\n\tfor _, name := range pathsToRemove {\n\t\tw.Remove(name)\n\t}\n\n\t// send a \"quit\" message to the reader goroutine\n\tclose(w.done)\n\n\treturn nil\n}\n\n// Add starts watching the named file or directory (non-recursively).\nfunc (w *Watcher) Add(name string) error {\n\tw.mu.Lock()\n\tw.externalWatches[name] = true\n\tw.mu.Unlock()\n\t_, err := w.addWatch(name, noteAllEvents)\n\treturn err\n}\n\n// Remove stops watching the the named file or directory (non-recursively).\nfunc (w *Watcher) Remove(name string) error {\n\tname = filepath.Clean(name)\n\tw.mu.Lock()\n\twatchfd, ok := w.watches[name]\n\tw.mu.Unlock()\n\tif !ok {\n\t\treturn fmt.Errorf(\"can't remove non-existent kevent watch for: %s\", name)\n\t}\n\n\tconst registerRemove = unix.EV_DELETE\n\tif err := register(w.kq, []int{watchfd}, registerRemove, 0); err != nil {\n\t\treturn err\n\t}\n\n\tunix.Close(watchfd)\n\n\tw.mu.Lock()\n\tisDir := w.paths[watchfd].isDir\n\tdelete(w.watches, name)\n\tdelete(w.paths, watchfd)\n\tdelete(w.dirFlags, name)\n\tw.mu.Unlock()\n\n\t// Find all watched paths that are in this directory that are not external.\n\tif isDir {\n\t\tvar pathsToRemove []string\n\t\tw.mu.Lock()\n\t\tfor _, path := range w.paths {\n\t\t\twdir, _ := filepath.Split(path.name)\n\t\t\tif filepath.Clean(wdir) == name {\n\t\t\t\tif !w.externalWatches[path.name] {\n\t\t\t\t\tpathsToRemove = append(pathsToRemove, path.name)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tw.mu.Unlock()\n\t\tfor _, name := range pathsToRemove {\n\t\t\t// Since these are internal, not much sense in propagating error\n\t\t\t// to the user, as that will just confuse them with an error about\n\t\t\t// a path they did not explicitly watch themselves.\n\t\t\tw.Remove(name)\n\t\t}\n\t}\n\n\treturn nil\n}\n\n// Watch all events (except NOTE_EXTEND, NOTE_LINK, NOTE_REVOKE)\nconst noteAllEvents = unix.NOTE_DELETE | unix.NOTE_WRITE | unix.NOTE_ATTRIB | unix.NOTE_RENAME\n\n// keventWaitTime to block on each read from kevent\nvar keventWaitTime = durationToTimespec(100 * time.Millisecond)\n\n// addWatch adds name to the watched file set.\n// The flags are interpreted as described in kevent(2).\n// Returns the real path to the file which was added, if any, which may be different from the one passed in the case of symlinks.\nfunc (w *Watcher) addWatch(name string, flags uint32) (string, error) {\n\tvar isDir bool\n\t// Make ./name and name equivalent\n\tname = filepath.Clean(name)\n\n\tw.mu.Lock()\n\tif w.isClosed {\n\t\tw.mu.Unlock()\n\t\treturn \"\", errors.New(\"kevent instance already closed\")\n\t}\n\twatchfd, alreadyWatching := w.watches[name]\n\t// We already have a watch, but we can still override flags.\n\tif alreadyWatching {\n\t\tisDir = w.paths[watchfd].isDir\n\t}\n\tw.mu.Unlock()\n\n\tif !alreadyWatching {\n\t\tfi, err := os.Lstat(name)\n\t\tif err != nil {\n\t\t\treturn \"\", err\n\t\t}\n\n\t\t// Don't watch sockets.\n\t\tif fi.Mode()&os.ModeSocket == os.ModeSocket {\n\t\t\treturn \"\", nil\n\t\t}\n\n\t\t// Don't watch named pipes.\n\t\tif fi.Mode()&os.ModeNamedPipe == os.ModeNamedPipe {\n\t\t\treturn \"\", nil\n\t\t}\n\n\t\t// Follow Symlinks\n\t\t// Unfortunately, Linux can add bogus symlinks to watch list without\n\t\t// issue, and Windows can't do symlinks period (AFAIK). To maintain\n\t\t// consistency, we will act like everything is fine. There will simply\n\t\t// be no file events for broken symlinks.\n\t\t// Hence the returns of nil on errors.\n\t\tif fi.Mode()&os.ModeSymlink == os.ModeSymlink {\n\t\t\tname, err = filepath.EvalSymlinks(name)\n\t\t\tif err != nil {\n\t\t\t\treturn \"\", nil\n\t\t\t}\n\n\t\t\tw.mu.Lock()\n\t\t\t_, alreadyWatching = w.watches[name]\n\t\t\tw.mu.Unlock()\n\n\t\t\tif alreadyWatching {\n\t\t\t\treturn name, nil\n\t\t\t}\n\n\t\t\tfi, err = os.Lstat(name)\n\t\t\tif err != nil {\n\t\t\t\treturn \"\", nil\n\t\t\t}\n\t\t}\n\n\t\twatchfd, err = unix.Open(name, openMode, 0700)\n\t\tif watchfd == -1 {\n\t\t\treturn \"\", err\n\t\t}\n\n\t\tisDir = fi.IsDir()\n\t}\n\n\tconst registerAdd = unix.EV_ADD | unix.EV_CLEAR | unix.EV_ENABLE\n\tif err := register(w.kq, []int{watchfd}, registerAdd, flags); err != nil {\n\t\tunix.Close(watchfd)\n\t\treturn \"\", err\n\t}\n\n\tif !alreadyWatching {\n\t\tw.mu.Lock()\n\t\tw.watches[name] = watchfd\n\t\tw.paths[watchfd] = pathInfo{name: name, isDir: isDir}\n\t\tw.mu.Unlock()\n\t}\n\n\tif isDir {\n\t\t// Watch the directory if it has not been watched before,\n\t\t// or if it was watched before, but perhaps only a NOTE_DELETE (watchDirectoryFiles)\n\t\tw.mu.Lock()\n\n\t\twatchDir := (flags&unix.NOTE_WRITE) == unix.NOTE_WRITE &&\n\t\t\t(!alreadyWatching || (w.dirFlags[name]&unix.NOTE_WRITE) != unix.NOTE_WRITE)\n\t\t// Store flags so this watch can be updated later\n\t\tw.dirFlags[name] = flags\n\t\tw.mu.Unlock()\n\n\t\tif watchDir {\n\t\t\tif err := w.watchDirectoryFiles(name); err != nil {\n\t\t\t\treturn \"\", err\n\t\t\t}\n\t\t}\n\t}\n\treturn name, nil\n}\n\n// readEvents reads from kqueue and converts the received kevents into\n// Event values that it sends down the Events channel.\nfunc (w *Watcher) readEvents() {\n\teventBuffer := make([]unix.Kevent_t, 10)\n\nloop:\n\tfor {\n\t\t// See if there is a message on the \"done\" channel\n\t\tselect {\n\t\tcase <-w.done:\n\t\t\tbreak loop\n\t\tdefault:\n\t\t}\n\n\t\t// Get new events\n\t\tkevents, err := read(w.kq, eventBuffer, &keventWaitTime)\n\t\t// EINTR is okay, the syscall was interrupted before timeout expired.\n\t\tif err != nil && err != unix.EINTR {\n\t\t\tselect {\n\t\t\tcase w.Errors <- err:\n\t\t\tcase <-w.done:\n\t\t\t\tbreak loop\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\n\t\t// Flush the events we received to the Events channel\n\t\tfor len(kevents) > 0 {\n\t\t\tkevent := &kevents[0]\n\t\t\twatchfd := int(kevent.Ident)\n\t\t\tmask := uint32(kevent.Fflags)\n\t\t\tw.mu.Lock()\n\t\t\tpath := w.paths[watchfd]\n\t\t\tw.mu.Unlock()\n\t\t\tevent := newEvent(path.name, mask)\n\n\t\t\tif path.isDir && !(event.Op&Remove == Remove) {\n\t\t\t\t// Double check to make sure the directory exists. This can happen when\n\t\t\t\t// we do a rm -fr on a recursively watched folders and we receive a\n\t\t\t\t// modification event first but the folder has been deleted and later\n\t\t\t\t// receive the delete event\n\t\t\t\tif _, err := os.Lstat(event.Name); os.IsNotExist(err) {\n\t\t\t\t\t// mark is as delete event\n\t\t\t\t\tevent.Op |= Remove\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif event.Op&Rename == Rename || event.Op&Remove == Remove {\n\t\t\t\tw.Remove(event.Name)\n\t\t\t\tw.mu.Lock()\n\t\t\t\tdelete(w.fileExists, event.Name)\n\t\t\t\tw.mu.Unlock()\n\t\t\t}\n\n\t\t\tif path.isDir && event.Op&Write == Write && !(event.Op&Remove == Remove) {\n\t\t\t\tw.sendDirectoryChangeEvents(event.Name)\n\t\t\t} else {\n\t\t\t\t// Send the event on the Events channel.\n\t\t\t\tselect {\n\t\t\t\tcase w.Events <- event:\n\t\t\t\tcase <-w.done:\n\t\t\t\t\tbreak loop\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif event.Op&Remove == Remove {\n\t\t\t\t// Look for a file that may have overwritten this.\n\t\t\t\t// For example, mv f1 f2 will delete f2, then create f2.\n\t\t\t\tif path.isDir {\n\t\t\t\t\tfileDir := filepath.Clean(event.Name)\n\t\t\t\t\tw.mu.Lock()\n\t\t\t\t\t_, found := w.watches[fileDir]\n\t\t\t\t\tw.mu.Unlock()\n\t\t\t\t\tif found {\n\t\t\t\t\t\t// make sure the directory exists before we watch for changes. When we\n\t\t\t\t\t\t// do a recursive watch and perform rm -fr, the parent directory might\n\t\t\t\t\t\t// have gone missing, ignore the missing directory and let the\n\t\t\t\t\t\t// upcoming delete event remove the watch from the parent directory.\n\t\t\t\t\t\tif _, err := os.Lstat(fileDir); err == nil {\n\t\t\t\t\t\t\tw.sendDirectoryChangeEvents(fileDir)\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tfilePath := filepath.Clean(event.Name)\n\t\t\t\t\tif fileInfo, err := os.Lstat(filePath); err == nil {\n\t\t\t\t\t\tw.sendFileCreatedEventIfNew(filePath, fileInfo)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Move to next event\n\t\t\tkevents = kevents[1:]\n\t\t}\n\t}\n\n\t// cleanup\n\terr := unix.Close(w.kq)\n\tif err != nil {\n\t\t// only way the previous loop breaks is if w.done was closed so we need to async send to w.Errors.\n\t\tselect {\n\t\tcase w.Errors <- err:\n\t\tdefault:\n\t\t}\n\t}\n\tclose(w.Events)\n\tclose(w.Errors)\n}\n\n// newEvent returns an platform-independent Event based on kqueue Fflags.\nfunc newEvent(name string, mask uint32) Event {\n\te := Event{Name: name}\n\tif mask&unix.NOTE_DELETE == unix.NOTE_DELETE {\n\t\te.Op |= Remove\n\t}\n\tif mask&unix.NOTE_WRITE == unix.NOTE_WRITE {\n\t\te.Op |= Write\n\t}\n\tif mask&unix.NOTE_RENAME == unix.NOTE_RENAME {\n\t\te.Op |= Rename\n\t}\n\tif mask&unix.NOTE_ATTRIB == unix.NOTE_ATTRIB {\n\t\te.Op |= Chmod\n\t}\n\treturn e\n}\n\nfunc newCreateEvent(name string) Event {\n\treturn Event{Name: name, Op: Create}\n}\n\n// watchDirectoryFiles to mimic inotify when adding a watch on a directory\nfunc (w *Watcher) watchDirectoryFiles(dirPath string) error {\n\t// Get all files\n\tfiles, err := ioutil.ReadDir(dirPath)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tfor _, fileInfo := range files {\n\t\tfilePath := filepath.Join(dirPath, fileInfo.Name())\n\t\tfilePath, err = w.internalWatch(filePath, fileInfo)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\n\t\tw.mu.Lock()\n\t\tw.fileExists[filePath] = true\n\t\tw.mu.Unlock()\n\t}\n\n\treturn nil\n}\n\n// sendDirectoryEvents searches the directory for newly created files\n// and sends them over the event channel. This functionality is to have\n// the BSD version of fsnotify match Linux inotify which provides a\n// create event for files created in a watched directory.\nfunc (w *Watcher) sendDirectoryChangeEvents(dirPath string) {\n\t// Get all files\n\tfiles, err := ioutil.ReadDir(dirPath)\n\tif err != nil {\n\t\tselect {\n\t\tcase w.Errors <- err:\n\t\tcase <-w.done:\n\t\t\treturn\n\t\t}\n\t}\n\n\t// Search for new files\n\tfor _, fileInfo := range files {\n\t\tfilePath := filepath.Join(dirPath, fileInfo.Name())\n\t\terr := w.sendFileCreatedEventIfNew(filePath, fileInfo)\n\n\t\tif err != nil {\n\t\t\treturn\n\t\t}\n\t}\n}\n\n// sendFileCreatedEvent sends a create event if the file isn't already being tracked.\nfunc (w *Watcher) sendFileCreatedEventIfNew(filePath string, fileInfo os.FileInfo) (err error) {\n\tw.mu.Lock()\n\t_, doesExist := w.fileExists[filePath]\n\tw.mu.Unlock()\n\tif !doesExist {\n\t\t// Send create event\n\t\tselect {\n\t\tcase w.Events <- newCreateEvent(filePath):\n\t\tcase <-w.done:\n\t\t\treturn\n\t\t}\n\t}\n\n\t// like watchDirectoryFiles (but without doing another ReadDir)\n\tfilePath, err = w.internalWatch(filePath, fileInfo)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tw.mu.Lock()\n\tw.fileExists[filePath] = true\n\tw.mu.Unlock()\n\n\treturn nil\n}\n\nfunc (w *Watcher) internalWatch(name string, fileInfo os.FileInfo) (string, error) {\n\tif fileInfo.IsDir() {\n\t\t// mimic Linux providing delete events for subdirectories\n\t\t// but preserve the flags used if currently watching subdirectory\n\t\tw.mu.Lock()\n\t\tflags := w.dirFlags[name]\n\t\tw.mu.Unlock()\n\n\t\tflags |= unix.NOTE_DELETE | unix.NOTE_RENAME\n\t\treturn w.addWatch(name, flags)\n\t}\n\n\t// watch file to mimic Linux inotify\n\treturn w.addWatch(name, noteAllEvents)\n}\n\n// kqueue creates a new kernel event queue and returns a descriptor.\nfunc kqueue() (kq int, err error) {\n\tkq, err = unix.Kqueue()\n\tif kq == -1 {\n\t\treturn kq, err\n\t}\n\treturn kq, nil\n}\n\n// register events with the queue\nfunc register(kq int, fds []int, flags int, fflags uint32) error {\n\tchanges := make([]unix.Kevent_t, len(fds))\n\n\tfor i, fd := range fds {\n\t\t// SetKevent converts int to the platform-specific types:\n\t\tunix.SetKevent(&changes[i], fd, unix.EVFILT_VNODE, flags)\n\t\tchanges[i].Fflags = fflags\n\t}\n\n\t// register the events\n\tsuccess, err := unix.Kevent(kq, changes, nil, nil)\n\tif success == -1 {\n\t\treturn err\n\t}\n\treturn nil\n}\n\n// read retrieves pending events, or waits until an event occurs.\n// A timeout of nil blocks indefinitely, while 0 polls the queue.\nfunc read(kq int, events []unix.Kevent_t, timeout *unix.Timespec) ([]unix.Kevent_t, error) {\n\tn, err := unix.Kevent(kq, nil, events, timeout)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn events[0:n], nil\n}\n\n// durationToTimespec prepares a timeout value\nfunc durationToTimespec(d time.Duration) unix.Timespec {\n\treturn unix.NsecToTimespec(d.Nanoseconds())\n}\n" }, { "path": "vendor/github.com/fsnotify/fsnotify/open_mode_bsd.go", "content": "// Copyright 2013 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// +build freebsd openbsd netbsd dragonfly\n\npackage fsnotify\n\nimport \"golang.org/x/sys/unix\"\n\nconst openMode = unix.O_NONBLOCK | unix.O_RDONLY | unix.O_CLOEXEC\n" }, { "path": "vendor/github.com/fsnotify/fsnotify/open_mode_darwin.go", "content": "// Copyright 2013 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// +build darwin\n\npackage fsnotify\n\nimport \"golang.org/x/sys/unix\"\n\n// note: this constant is not defined on BSD\nconst openMode = unix.O_EVTONLY | unix.O_CLOEXEC\n" }, { "path": "vendor/github.com/fsnotify/fsnotify/windows.go", "content": "// Copyright 2011 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// +build windows\n\npackage fsnotify\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"os\"\n\t\"path/filepath\"\n\t\"runtime\"\n\t\"sync\"\n\t\"syscall\"\n\t\"unsafe\"\n)\n\n// Watcher watches a set of files, delivering events to a channel.\ntype Watcher struct {\n\tEvents chan Event\n\tErrors chan error\n\tisClosed bool // Set to true when Close() is first called\n\tmu sync.Mutex // Map access\n\tport syscall.Handle // Handle to completion port\n\twatches watchMap // Map of watches (key: i-number)\n\tinput chan *input // Inputs to the reader are sent on this channel\n\tquit chan chan<- error\n}\n\n// NewWatcher establishes a new watcher with the underlying OS and begins waiting for events.\nfunc NewWatcher() (*Watcher, error) {\n\tport, e := syscall.CreateIoCompletionPort(syscall.InvalidHandle, 0, 0, 0)\n\tif e != nil {\n\t\treturn nil, os.NewSyscallError(\"CreateIoCompletionPort\", e)\n\t}\n\tw := &Watcher{\n\t\tport: port,\n\t\twatches: make(watchMap),\n\t\tinput: make(chan *input, 1),\n\t\tEvents: make(chan Event, 50),\n\t\tErrors: make(chan error),\n\t\tquit: make(chan chan<- error, 1),\n\t}\n\tgo w.readEvents()\n\treturn w, nil\n}\n\n// Close removes all watches and closes the events channel.\nfunc (w *Watcher) Close() error {\n\tif w.isClosed {\n\t\treturn nil\n\t}\n\tw.isClosed = true\n\n\t// Send \"quit\" message to the reader goroutine\n\tch := make(chan error)\n\tw.quit <- ch\n\tif err := w.wakeupReader(); err != nil {\n\t\treturn err\n\t}\n\treturn <-ch\n}\n\n// Add starts watching the named file or directory (non-recursively).\nfunc (w *Watcher) Add(name string) error {\n\tif w.isClosed {\n\t\treturn errors.New(\"watcher already closed\")\n\t}\n\tin := &input{\n\t\top: opAddWatch,\n\t\tpath: filepath.Clean(name),\n\t\tflags: sysFSALLEVENTS,\n\t\treply: make(chan error),\n\t}\n\tw.input <- in\n\tif err := w.wakeupReader(); err != nil {\n\t\treturn err\n\t}\n\treturn <-in.reply\n}\n\n// Remove stops watching the the named file or directory (non-recursively).\nfunc (w *Watcher) Remove(name string) error {\n\tin := &input{\n\t\top: opRemoveWatch,\n\t\tpath: filepath.Clean(name),\n\t\treply: make(chan error),\n\t}\n\tw.input <- in\n\tif err := w.wakeupReader(); err != nil {\n\t\treturn err\n\t}\n\treturn <-in.reply\n}\n\nconst (\n\t// Options for AddWatch\n\tsysFSONESHOT = 0x80000000\n\tsysFSONLYDIR = 0x1000000\n\n\t// Events\n\tsysFSACCESS = 0x1\n\tsysFSALLEVENTS = 0xfff\n\tsysFSATTRIB = 0x4\n\tsysFSCLOSE = 0x18\n\tsysFSCREATE = 0x100\n\tsysFSDELETE = 0x200\n\tsysFSDELETESELF = 0x400\n\tsysFSMODIFY = 0x2\n\tsysFSMOVE = 0xc0\n\tsysFSMOVEDFROM = 0x40\n\tsysFSMOVEDTO = 0x80\n\tsysFSMOVESELF = 0x800\n\n\t// Special events\n\tsysFSIGNORED = 0x8000\n\tsysFSQOVERFLOW = 0x4000\n)\n\nfunc newEvent(name string, mask uint32) Event {\n\te := Event{Name: name}\n\tif mask&sysFSCREATE == sysFSCREATE || mask&sysFSMOVEDTO == sysFSMOVEDTO {\n\t\te.Op |= Create\n\t}\n\tif mask&sysFSDELETE == sysFSDELETE || mask&sysFSDELETESELF == sysFSDELETESELF {\n\t\te.Op |= Remove\n\t}\n\tif mask&sysFSMODIFY == sysFSMODIFY {\n\t\te.Op |= Write\n\t}\n\tif mask&sysFSMOVE == sysFSMOVE || mask&sysFSMOVESELF == sysFSMOVESELF || mask&sysFSMOVEDFROM == sysFSMOVEDFROM {\n\t\te.Op |= Rename\n\t}\n\tif mask&sysFSATTRIB == sysFSATTRIB {\n\t\te.Op |= Chmod\n\t}\n\treturn e\n}\n\nconst (\n\topAddWatch = iota\n\topRemoveWatch\n)\n\nconst (\n\tprovisional uint64 = 1 << (32 + iota)\n)\n\ntype input struct {\n\top int\n\tpath string\n\tflags uint32\n\treply chan error\n}\n\ntype inode struct {\n\thandle syscall.Handle\n\tvolume uint32\n\tindex uint64\n}\n\ntype watch struct {\n\tov syscall.Overlapped\n\tino *inode // i-number\n\tpath string // Directory path\n\tmask uint64 // Directory itself is being watched with these notify flags\n\tnames map[string]uint64 // Map of names being watched and their notify flags\n\trename string // Remembers the old name while renaming a file\n\tbuf [4096]byte\n}\n\ntype indexMap map[uint64]*watch\ntype watchMap map[uint32]indexMap\n\nfunc (w *Watcher) wakeupReader() error {\n\te := syscall.PostQueuedCompletionStatus(w.port, 0, 0, nil)\n\tif e != nil {\n\t\treturn os.NewSyscallError(\"PostQueuedCompletionStatus\", e)\n\t}\n\treturn nil\n}\n\nfunc getDir(pathname string) (dir string, err error) {\n\tattr, e := syscall.GetFileAttributes(syscall.StringToUTF16Ptr(pathname))\n\tif e != nil {\n\t\treturn \"\", os.NewSyscallError(\"GetFileAttributes\", e)\n\t}\n\tif attr&syscall.FILE_ATTRIBUTE_DIRECTORY != 0 {\n\t\tdir = pathname\n\t} else {\n\t\tdir, _ = filepath.Split(pathname)\n\t\tdir = filepath.Clean(dir)\n\t}\n\treturn\n}\n\nfunc getIno(path string) (ino *inode, err error) {\n\th, e := syscall.CreateFile(syscall.StringToUTF16Ptr(path),\n\t\tsyscall.FILE_LIST_DIRECTORY,\n\t\tsyscall.FILE_SHARE_READ|syscall.FILE_SHARE_WRITE|syscall.FILE_SHARE_DELETE,\n\t\tnil, syscall.OPEN_EXISTING,\n\t\tsyscall.FILE_FLAG_BACKUP_SEMANTICS|syscall.FILE_FLAG_OVERLAPPED, 0)\n\tif e != nil {\n\t\treturn nil, os.NewSyscallError(\"CreateFile\", e)\n\t}\n\tvar fi syscall.ByHandleFileInformation\n\tif e = syscall.GetFileInformationByHandle(h, &fi); e != nil {\n\t\tsyscall.CloseHandle(h)\n\t\treturn nil, os.NewSyscallError(\"GetFileInformationByHandle\", e)\n\t}\n\tino = &inode{\n\t\thandle: h,\n\t\tvolume: fi.VolumeSerialNumber,\n\t\tindex: uint64(fi.FileIndexHigh)<<32 | uint64(fi.FileIndexLow),\n\t}\n\treturn ino, nil\n}\n\n// Must run within the I/O thread.\nfunc (m watchMap) get(ino *inode) *watch {\n\tif i := m[ino.volume]; i != nil {\n\t\treturn i[ino.index]\n\t}\n\treturn nil\n}\n\n// Must run within the I/O thread.\nfunc (m watchMap) set(ino *inode, watch *watch) {\n\ti := m[ino.volume]\n\tif i == nil {\n\t\ti = make(indexMap)\n\t\tm[ino.volume] = i\n\t}\n\ti[ino.index] = watch\n}\n\n// Must run within the I/O thread.\nfunc (w *Watcher) addWatch(pathname string, flags uint64) error {\n\tdir, err := getDir(pathname)\n\tif err != nil {\n\t\treturn err\n\t}\n\tif flags&sysFSONLYDIR != 0 && pathname != dir {\n\t\treturn nil\n\t}\n\tino, err := getIno(dir)\n\tif err != nil {\n\t\treturn err\n\t}\n\tw.mu.Lock()\n\twatchEntry := w.watches.get(ino)\n\tw.mu.Unlock()\n\tif watchEntry == nil {\n\t\tif _, e := syscall.CreateIoCompletionPort(ino.handle, w.port, 0, 0); e != nil {\n\t\t\tsyscall.CloseHandle(ino.handle)\n\t\t\treturn os.NewSyscallError(\"CreateIoCompletionPort\", e)\n\t\t}\n\t\twatchEntry = &watch{\n\t\t\tino: ino,\n\t\t\tpath: dir,\n\t\t\tnames: make(map[string]uint64),\n\t\t}\n\t\tw.mu.Lock()\n\t\tw.watches.set(ino, watchEntry)\n\t\tw.mu.Unlock()\n\t\tflags |= provisional\n\t} else {\n\t\tsyscall.CloseHandle(ino.handle)\n\t}\n\tif pathname == dir {\n\t\twatchEntry.mask |= flags\n\t} else {\n\t\twatchEntry.names[filepath.Base(pathname)] |= flags\n\t}\n\tif err = w.startRead(watchEntry); err != nil {\n\t\treturn err\n\t}\n\tif pathname == dir {\n\t\twatchEntry.mask &= ^provisional\n\t} else {\n\t\twatchEntry.names[filepath.Base(pathname)] &= ^provisional\n\t}\n\treturn nil\n}\n\n// Must run within the I/O thread.\nfunc (w *Watcher) remWatch(pathname string) error {\n\tdir, err := getDir(pathname)\n\tif err != nil {\n\t\treturn err\n\t}\n\tino, err := getIno(dir)\n\tif err != nil {\n\t\treturn err\n\t}\n\tw.mu.Lock()\n\twatch := w.watches.get(ino)\n\tw.mu.Unlock()\n\tif watch == nil {\n\t\treturn fmt.Errorf(\"can't remove non-existent watch for: %s\", pathname)\n\t}\n\tif pathname == dir {\n\t\tw.sendEvent(watch.path, watch.mask&sysFSIGNORED)\n\t\twatch.mask = 0\n\t} else {\n\t\tname := filepath.Base(pathname)\n\t\tw.sendEvent(filepath.Join(watch.path, name), watch.names[name]&sysFSIGNORED)\n\t\tdelete(watch.names, name)\n\t}\n\treturn w.startRead(watch)\n}\n\n// Must run within the I/O thread.\nfunc (w *Watcher) deleteWatch(watch *watch) {\n\tfor name, mask := range watch.names {\n\t\tif mask&provisional == 0 {\n\t\t\tw.sendEvent(filepath.Join(watch.path, name), mask&sysFSIGNORED)\n\t\t}\n\t\tdelete(watch.names, name)\n\t}\n\tif watch.mask != 0 {\n\t\tif watch.mask&provisional == 0 {\n\t\t\tw.sendEvent(watch.path, watch.mask&sysFSIGNORED)\n\t\t}\n\t\twatch.mask = 0\n\t}\n}\n\n// Must run within the I/O thread.\nfunc (w *Watcher) startRead(watch *watch) error {\n\tif e := syscall.CancelIo(watch.ino.handle); e != nil {\n\t\tw.Errors <- os.NewSyscallError(\"CancelIo\", e)\n\t\tw.deleteWatch(watch)\n\t}\n\tmask := toWindowsFlags(watch.mask)\n\tfor _, m := range watch.names {\n\t\tmask |= toWindowsFlags(m)\n\t}\n\tif mask == 0 {\n\t\tif e := syscall.CloseHandle(watch.ino.handle); e != nil {\n\t\t\tw.Errors <- os.NewSyscallError(\"CloseHandle\", e)\n\t\t}\n\t\tw.mu.Lock()\n\t\tdelete(w.watches[watch.ino.volume], watch.ino.index)\n\t\tw.mu.Unlock()\n\t\treturn nil\n\t}\n\te := syscall.ReadDirectoryChanges(watch.ino.handle, &watch.buf[0],\n\t\tuint32(unsafe.Sizeof(watch.buf)), false, mask, nil, &watch.ov, 0)\n\tif e != nil {\n\t\terr := os.NewSyscallError(\"ReadDirectoryChanges\", e)\n\t\tif e == syscall.ERROR_ACCESS_DENIED && watch.mask&provisional == 0 {\n\t\t\t// Watched directory was probably removed\n\t\t\tif w.sendEvent(watch.path, watch.mask&sysFSDELETESELF) {\n\t\t\t\tif watch.mask&sysFSONESHOT != 0 {\n\t\t\t\t\twatch.mask = 0\n\t\t\t\t}\n\t\t\t}\n\t\t\terr = nil\n\t\t}\n\t\tw.deleteWatch(watch)\n\t\tw.startRead(watch)\n\t\treturn err\n\t}\n\treturn nil\n}\n\n// readEvents reads from the I/O completion port, converts the\n// received events into Event objects and sends them via the Events channel.\n// Entry point to the I/O thread.\nfunc (w *Watcher) readEvents() {\n\tvar (\n\t\tn, key uint32\n\t\tov *syscall.Overlapped\n\t)\n\truntime.LockOSThread()\n\n\tfor {\n\t\te := syscall.GetQueuedCompletionStatus(w.port, &n, &key, &ov, syscall.INFINITE)\n\t\twatch := (*watch)(unsafe.Pointer(ov))\n\n\t\tif watch == nil {\n\t\t\tselect {\n\t\t\tcase ch := <-w.quit:\n\t\t\t\tw.mu.Lock()\n\t\t\t\tvar indexes []indexMap\n\t\t\t\tfor _, index := range w.watches {\n\t\t\t\t\tindexes = append(indexes, index)\n\t\t\t\t}\n\t\t\t\tw.mu.Unlock()\n\t\t\t\tfor _, index := range indexes {\n\t\t\t\t\tfor _, watch := range index {\n\t\t\t\t\t\tw.deleteWatch(watch)\n\t\t\t\t\t\tw.startRead(watch)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tvar err error\n\t\t\t\tif e := syscall.CloseHandle(w.port); e != nil {\n\t\t\t\t\terr = os.NewSyscallError(\"CloseHandle\", e)\n\t\t\t\t}\n\t\t\t\tclose(w.Events)\n\t\t\t\tclose(w.Errors)\n\t\t\t\tch <- err\n\t\t\t\treturn\n\t\t\tcase in := <-w.input:\n\t\t\t\tswitch in.op {\n\t\t\t\tcase opAddWatch:\n\t\t\t\t\tin.reply <- w.addWatch(in.path, uint64(in.flags))\n\t\t\t\tcase opRemoveWatch:\n\t\t\t\t\tin.reply <- w.remWatch(in.path)\n\t\t\t\t}\n\t\t\tdefault:\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\n\t\tswitch e {\n\t\tcase syscall.ERROR_MORE_DATA:\n\t\t\tif watch == nil {\n\t\t\t\tw.Errors <- errors.New(\"ERROR_MORE_DATA has unexpectedly null lpOverlapped buffer\")\n\t\t\t} else {\n\t\t\t\t// The i/o succeeded but the buffer is full.\n\t\t\t\t// In theory we should be building up a full packet.\n\t\t\t\t// In practice we can get away with just carrying on.\n\t\t\t\tn = uint32(unsafe.Sizeof(watch.buf))\n\t\t\t}\n\t\tcase syscall.ERROR_ACCESS_DENIED:\n\t\t\t// Watched directory was probably removed\n\t\t\tw.sendEvent(watch.path, watch.mask&sysFSDELETESELF)\n\t\t\tw.deleteWatch(watch)\n\t\t\tw.startRead(watch)\n\t\t\tcontinue\n\t\tcase syscall.ERROR_OPERATION_ABORTED:\n\t\t\t// CancelIo was called on this handle\n\t\t\tcontinue\n\t\tdefault:\n\t\t\tw.Errors <- os.NewSyscallError(\"GetQueuedCompletionPort\", e)\n\t\t\tcontinue\n\t\tcase nil:\n\t\t}\n\n\t\tvar offset uint32\n\t\tfor {\n\t\t\tif n == 0 {\n\t\t\t\tw.Events <- newEvent(\"\", sysFSQOVERFLOW)\n\t\t\t\tw.Errors <- errors.New(\"short read in readEvents()\")\n\t\t\t\tbreak\n\t\t\t}\n\n\t\t\t// Point \"raw\" to the event in the buffer\n\t\t\traw := (*syscall.FileNotifyInformation)(unsafe.Pointer(&watch.buf[offset]))\n\t\t\tbuf := (*[syscall.MAX_PATH]uint16)(unsafe.Pointer(&raw.FileName))\n\t\t\tname := syscall.UTF16ToString(buf[:raw.FileNameLength/2])\n\t\t\tfullname := filepath.Join(watch.path, name)\n\n\t\t\tvar mask uint64\n\t\t\tswitch raw.Action {\n\t\t\tcase syscall.FILE_ACTION_REMOVED:\n\t\t\t\tmask = sysFSDELETESELF\n\t\t\tcase syscall.FILE_ACTION_MODIFIED:\n\t\t\t\tmask = sysFSMODIFY\n\t\t\tcase syscall.FILE_ACTION_RENAMED_OLD_NAME:\n\t\t\t\twatch.rename = name\n\t\t\tcase syscall.FILE_ACTION_RENAMED_NEW_NAME:\n\t\t\t\tif watch.names[watch.rename] != 0 {\n\t\t\t\t\twatch.names[name] |= watch.names[watch.rename]\n\t\t\t\t\tdelete(watch.names, watch.rename)\n\t\t\t\t\tmask = sysFSMOVESELF\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tsendNameEvent := func() {\n\t\t\t\tif w.sendEvent(fullname, watch.names[name]&mask) {\n\t\t\t\t\tif watch.names[name]&sysFSONESHOT != 0 {\n\t\t\t\t\t\tdelete(watch.names, name)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif raw.Action != syscall.FILE_ACTION_RENAMED_NEW_NAME {\n\t\t\t\tsendNameEvent()\n\t\t\t}\n\t\t\tif raw.Action == syscall.FILE_ACTION_REMOVED {\n\t\t\t\tw.sendEvent(fullname, watch.names[name]&sysFSIGNORED)\n\t\t\t\tdelete(watch.names, name)\n\t\t\t}\n\t\t\tif w.sendEvent(fullname, watch.mask&toFSnotifyFlags(raw.Action)) {\n\t\t\t\tif watch.mask&sysFSONESHOT != 0 {\n\t\t\t\t\twatch.mask = 0\n\t\t\t\t}\n\t\t\t}\n\t\t\tif raw.Action == syscall.FILE_ACTION_RENAMED_NEW_NAME {\n\t\t\t\tfullname = filepath.Join(watch.path, watch.rename)\n\t\t\t\tsendNameEvent()\n\t\t\t}\n\n\t\t\t// Move to the next event in the buffer\n\t\t\tif raw.NextEntryOffset == 0 {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\toffset += raw.NextEntryOffset\n\n\t\t\t// Error!\n\t\t\tif offset >= n {\n\t\t\t\tw.Errors <- errors.New(\"Windows system assumed buffer larger than it is, events have likely been missed.\")\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\n\t\tif err := w.startRead(watch); err != nil {\n\t\t\tw.Errors <- err\n\t\t}\n\t}\n}\n\nfunc (w *Watcher) sendEvent(name string, mask uint64) bool {\n\tif mask == 0 {\n\t\treturn false\n\t}\n\tevent := newEvent(name, uint32(mask))\n\tselect {\n\tcase ch := <-w.quit:\n\t\tw.quit <- ch\n\tcase w.Events <- event:\n\t}\n\treturn true\n}\n\nfunc toWindowsFlags(mask uint64) uint32 {\n\tvar m uint32\n\tif mask&sysFSACCESS != 0 {\n\t\tm |= syscall.FILE_NOTIFY_CHANGE_LAST_ACCESS\n\t}\n\tif mask&sysFSMODIFY != 0 {\n\t\tm |= syscall.FILE_NOTIFY_CHANGE_LAST_WRITE\n\t}\n\tif mask&sysFSATTRIB != 0 {\n\t\tm |= syscall.FILE_NOTIFY_CHANGE_ATTRIBUTES\n\t}\n\tif mask&(sysFSMOVE|sysFSCREATE|sysFSDELETE) != 0 {\n\t\tm |= syscall.FILE_NOTIFY_CHANGE_FILE_NAME | syscall.FILE_NOTIFY_CHANGE_DIR_NAME\n\t}\n\treturn m\n}\n\nfunc toFSnotifyFlags(action uint32) uint64 {\n\tswitch action {\n\tcase syscall.FILE_ACTION_ADDED:\n\t\treturn sysFSCREATE\n\tcase syscall.FILE_ACTION_REMOVED:\n\t\treturn sysFSDELETE\n\tcase syscall.FILE_ACTION_MODIFIED:\n\t\treturn sysFSMODIFY\n\tcase syscall.FILE_ACTION_RENAMED_OLD_NAME:\n\t\treturn sysFSMOVEDFROM\n\tcase syscall.FILE_ACTION_RENAMED_NEW_NAME:\n\t\treturn sysFSMOVEDTO\n\t}\n\treturn 0\n}\n" }, { "path": "vendor/github.com/nxadm/tail/.gitignore", "content": ".idea/\n.test/\nexamples/_*" }, { "path": "vendor/github.com/nxadm/tail/CHANGES.md", "content": "# Version v1.4.7-v1.4.8\n* Documentation updates.\n* Small linter cleanups.\n* Added example in test. \n\n# Version v1.4.6\n\n* Document the usage of Cleanup when re-reading a file (thanks to @lesovsky) for issue #18.\n* Add example directories with example and tests for issues.\n\n# Version v1.4.4-v1.4.5\n\n* Fix of checksum problem because of forced tag. No changes to the code.\n\n# Version v1.4.1\n\n* Incorporated PR 162 by by Mohammed902: \"Simplify non-Windows build tag\".\n\n# Version v1.4.0\n\n* Incorporated PR 9 by mschneider82: \"Added seekinfo to Tail\".\n\n# Version v1.3.1\n\n* Incorporated PR 7: \"Fix deadlock when stopping on non-empty file/buffer\",\nfixes upstream issue 93.\n\n\n# Version v1.3.0\n\n* Incorporated changes of unmerged upstream PR 149 by mezzi: \"added line num\nto Line struct\".\n\n# Version v1.2.1\n\n* Incorporated changes of unmerged upstream PR 128 by jadekler: \"Compile-able\ncode in readme\".\n* Incorporated changes of unmerged upstream PR 130 by fgeller: \"small change\nto comment wording\".\n* Incorporated changes of unmerged upstream PR 133 by sm3142: \"removed\nspurious newlines from log messages\".\n\n# Version v1.2.0\n\n* Incorporated changes of unmerged upstream PR 126 by Code-Hex: \"Solved the\n problem for never return the last line if it's not followed by a newline\".\n* Incorporated changes of unmerged upstream PR 131 by StoicPerlman: \"Remove\ndeprecated os.SEEK consts\". The changes bumped the minimal supported Go\nrelease to 1.9.\n\n# Version v1.1.0\n\n* migration to go modules.\n* release of master branch of the dormant upstream, because it contains\nfixes and improvement no present in the tagged release.\n\n" }, { "path": "vendor/github.com/nxadm/tail/Dockerfile", "content": "FROM golang\n\nRUN mkdir -p $GOPATH/src/github.com/nxadm/tail/\nADD . $GOPATH/src/github.com/nxadm/tail/\n\n# expecting to fetch dependencies successfully.\nRUN go get -v github.com/nxadm/tail\n\n# expecting to run the test successfully.\nRUN go test -v github.com/nxadm/tail\n\n# expecting to install successfully\nRUN go install -v github.com/nxadm/tail\nRUN go install -v github.com/nxadm/tail/cmd/gotail\n\nRUN $GOPATH/bin/gotail -h || true\n\nENV PATH $GOPATH/bin:$PATH\nCMD [\"gotail\"]\n" }, { "path": "vendor/github.com/nxadm/tail/LICENSE", "content": "# The MIT License (MIT)\n\n# © Copyright 2015 Hewlett Packard Enterprise Development LP\nCopyright (c) 2014 ActiveState\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n" }, { "path": "vendor/github.com/nxadm/tail/README.md", "content": "![ci](https://github.com/nxadm/tail/workflows/ci/badge.svg)[![Go Reference](https://pkg.go.dev/badge/github.com/nxadm/tail.svg)](https://pkg.go.dev/github.com/nxadm/tail)\n\n# tail functionality in Go\n\nnxadm/tail provides a Go library that emulates the features of the BSD `tail`\nprogram. The library comes with full support for truncation/move detection as\nit is designed to work with log rotation tools. The library works on all\noperating systems supported by Go, including POSIX systems like Linux and\n*BSD, and MS Windows. Go 1.9 is the oldest compiler release supported.\n\nA simple example:\n\n```Go\n// Create a tail\nt, err := tail.TailFile(\n\t\"/var/log/nginx.log\", tail.Config{Follow: true, ReOpen: true})\nif err != nil {\n panic(err)\n}\n\n// Print the text of each received line\nfor line := range t.Lines {\n fmt.Println(line.Text)\n}\n```\n\nSee [API documentation](https://pkg.go.dev/github.com/nxadm/tail).\n\n## Installing\n\n go get github.com/nxadm/tail/...\n\n## History\n\nThis project is an active, drop-in replacement for the\n[abandoned](https://en.wikipedia.org/wiki/HPE_Helion) Go tail library at\n[hpcloud](https://github.com/hpcloud/tail). Next to\n[addressing open issues/PRs of the original project](https://github.com/nxadm/tail/issues/6),\nnxadm/tail continues the development by keeping up to date with the Go toolchain\n(e.g. go modules) and dependencies, completing the documentation, adding features\nand fixing bugs.\n\n## Examples\nExamples, e.g. used to debug an issue, are kept in the [examples directory](/examples)." }, { "path": "vendor/github.com/nxadm/tail/go.mod", "content": "module github.com/nxadm/tail\n\ngo 1.13\n\nrequire (\n\tgithub.com/fsnotify/fsnotify v1.4.9\n\tgopkg.in/tomb.v1 v1.0.0-20141024135613-dd632973f1e7\n)\n" }, { "path": "vendor/github.com/nxadm/tail/go.sum", "content": "github.com/fsnotify/fsnotify v1.4.9 h1:hsms1Qyu0jgnwNXIxa+/V/PDsU6CfLf6CNO8H7IWoS4=\ngithub.com/fsnotify/fsnotify v1.4.9/go.mod h1:znqG4EE+3YCdAaPaxE2ZRY/06pZUdp0tY4IgpuI1SZQ=\ngolang.org/x/sys v0.0.0-20191005200804-aed5e4c7ecf9 h1:L2auWcuQIvxz9xSEqzESnV/QN/gNRXNApHi3fYwl2w0=\ngolang.org/x/sys v0.0.0-20191005200804-aed5e4c7ecf9/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngopkg.in/tomb.v1 v1.0.0-20141024135613-dd632973f1e7 h1:uRGJdciOHaEIrze2W8Q3AKkepLTh2hOroT7a+7czfdQ=\ngopkg.in/tomb.v1 v1.0.0-20141024135613-dd632973f1e7/go.mod h1:dt/ZhP58zS4L8KSrWDmTeBkI65Dw0HsyUHuEVlX15mw=\n" }, { "path": "vendor/github.com/nxadm/tail/ratelimiter/Licence", "content": "Copyright (C) 2013 99designs\n\nPermission 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:\n\nThe above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\n\nTHE 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.\n" }, { "path": "vendor/github.com/nxadm/tail/ratelimiter/leakybucket.go", "content": "// Package ratelimiter implements the Leaky Bucket ratelimiting algorithm with memcached and in-memory backends.\npackage ratelimiter\n\nimport (\n\t\"time\"\n)\n\ntype LeakyBucket struct {\n\tSize uint16\n\tFill float64\n\tLeakInterval time.Duration // time.Duration for 1 unit of size to leak\n\tLastupdate time.Time\n\tNow func() time.Time\n}\n\nfunc NewLeakyBucket(size uint16, leakInterval time.Duration) *LeakyBucket {\n\tbucket := LeakyBucket{\n\t\tSize: size,\n\t\tFill: 0,\n\t\tLeakInterval: leakInterval,\n\t\tNow: time.Now,\n\t\tLastupdate: time.Now(),\n\t}\n\n\treturn &bucket\n}\n\nfunc (b *LeakyBucket) updateFill() {\n\tnow := b.Now()\n\tif b.Fill > 0 {\n\t\telapsed := now.Sub(b.Lastupdate)\n\n\t\tb.Fill -= float64(elapsed) / float64(b.LeakInterval)\n\t\tif b.Fill < 0 {\n\t\t\tb.Fill = 0\n\t\t}\n\t}\n\tb.Lastupdate = now\n}\n\nfunc (b *LeakyBucket) Pour(amount uint16) bool {\n\tb.updateFill()\n\n\tvar newfill float64 = b.Fill + float64(amount)\n\n\tif newfill > float64(b.Size) {\n\t\treturn false\n\t}\n\n\tb.Fill = newfill\n\n\treturn true\n}\n\n// The time at which this bucket will be completely drained\nfunc (b *LeakyBucket) DrainedAt() time.Time {\n\treturn b.Lastupdate.Add(time.Duration(b.Fill * float64(b.LeakInterval)))\n}\n\n// The duration until this bucket is completely drained\nfunc (b *LeakyBucket) TimeToDrain() time.Duration {\n\treturn b.DrainedAt().Sub(b.Now())\n}\n\nfunc (b *LeakyBucket) TimeSinceLastUpdate() time.Duration {\n\treturn b.Now().Sub(b.Lastupdate)\n}\n\ntype LeakyBucketSer struct {\n\tSize uint16\n\tFill float64\n\tLeakInterval time.Duration // time.Duration for 1 unit of size to leak\n\tLastupdate time.Time\n}\n\nfunc (b *LeakyBucket) Serialise() *LeakyBucketSer {\n\tbucket := LeakyBucketSer{\n\t\tSize: b.Size,\n\t\tFill: b.Fill,\n\t\tLeakInterval: b.LeakInterval,\n\t\tLastupdate: b.Lastupdate,\n\t}\n\n\treturn &bucket\n}\n\nfunc (b *LeakyBucketSer) DeSerialise() *LeakyBucket {\n\tbucket := LeakyBucket{\n\t\tSize: b.Size,\n\t\tFill: b.Fill,\n\t\tLeakInterval: b.LeakInterval,\n\t\tLastupdate: b.Lastupdate,\n\t\tNow: time.Now,\n\t}\n\n\treturn &bucket\n}\n" }, { "path": "vendor/github.com/nxadm/tail/ratelimiter/memory.go", "content": "package ratelimiter\n\nimport (\n\t\"errors\"\n\t\"time\"\n)\n\nconst (\n\tGC_SIZE int = 100\n\tGC_PERIOD time.Duration = 60 * time.Second\n)\n\ntype Memory struct {\n\tstore map[string]LeakyBucket\n\tlastGCCollected time.Time\n}\n\nfunc NewMemory() *Memory {\n\tm := new(Memory)\n\tm.store = make(map[string]LeakyBucket)\n\tm.lastGCCollected = time.Now()\n\treturn m\n}\n\nfunc (m *Memory) GetBucketFor(key string) (*LeakyBucket, error) {\n\n\tbucket, ok := m.store[key]\n\tif !ok {\n\t\treturn nil, errors.New(\"miss\")\n\t}\n\n\treturn &bucket, nil\n}\n\nfunc (m *Memory) SetBucketFor(key string, bucket LeakyBucket) error {\n\n\tif len(m.store) > GC_SIZE {\n\t\tm.GarbageCollect()\n\t}\n\n\tm.store[key] = bucket\n\n\treturn nil\n}\n\nfunc (m *Memory) GarbageCollect() {\n\tnow := time.Now()\n\n\t// rate limit GC to once per minute\n\tif now.Unix() >= m.lastGCCollected.Add(GC_PERIOD).Unix() {\n\t\tfor key, bucket := range m.store {\n\t\t\t// if the bucket is drained, then GC\n\t\t\tif bucket.DrainedAt().Unix() < now.Unix() {\n\t\t\t\tdelete(m.store, key)\n\t\t\t}\n\t\t}\n\n\t\tm.lastGCCollected = now\n\t}\n}\n" }, { "path": "vendor/github.com/nxadm/tail/ratelimiter/storage.go", "content": "package ratelimiter\n\ntype Storage interface {\n\tGetBucketFor(string) (*LeakyBucket, error)\n\tSetBucketFor(string, LeakyBucket) error\n}\n" }, { "path": "vendor/github.com/nxadm/tail/tail.go", "content": "// Copyright (c) 2019 FOSS contributors of https://github.com/nxadm/tail\n// Copyright (c) 2015 HPE Software Inc. All rights reserved.\n// Copyright (c) 2013 ActiveState Software Inc. All rights reserved.\n\n//nxadm/tail provides a Go library that emulates the features of the BSD `tail`\n//program. The library comes with full support for truncation/move detection as\n//it is designed to work with log rotation tools. The library works on all\n//operating systems supported by Go, including POSIX systems like Linux and\n//*BSD, and MS Windows. Go 1.9 is the oldest compiler release supported.\npackage tail\n\nimport (\n\t\"bufio\"\n\t\"errors\"\n\t\"fmt\"\n\t\"io\"\n\t\"io/ioutil\"\n\t\"log\"\n\t\"os\"\n\t\"strings\"\n\t\"sync\"\n\t\"time\"\n\n\t\"github.com/nxadm/tail/ratelimiter\"\n\t\"github.com/nxadm/tail/util\"\n\t\"github.com/nxadm/tail/watch\"\n\t\"gopkg.in/tomb.v1\"\n)\n\nvar (\n\t// ErrStop is returned when the tail of a file has been marked to be stopped.\n\tErrStop = errors.New(\"tail should now stop\")\n)\n\ntype Line struct {\n\tText string // The contents of the file\n\tNum int // The line number\n\tSeekInfo SeekInfo // SeekInfo\n\tTime time.Time // Present time\n\tErr error // Error from tail\n}\n\n// Deprecated: this function is no longer used internally and it has little of no\n// use in the API. As such, it will be removed from the API in a future major\n// release.\n//\n// NewLine returns a * pointer to a Line struct.\nfunc NewLine(text string, lineNum int) *Line {\n\treturn &Line{text, lineNum, SeekInfo{}, time.Now(), nil}\n}\n\n// SeekInfo represents arguments to io.Seek. See: https://golang.org/pkg/io/#SectionReader.Seek\ntype SeekInfo struct {\n\tOffset int64\n\tWhence int\n}\n\ntype logger interface {\n\tFatal(v ...interface{})\n\tFatalf(format string, v ...interface{})\n\tFatalln(v ...interface{})\n\tPanic(v ...interface{})\n\tPanicf(format string, v ...interface{})\n\tPanicln(v ...interface{})\n\tPrint(v ...interface{})\n\tPrintf(format string, v ...interface{})\n\tPrintln(v ...interface{})\n}\n\n// Config is used to specify how a file must be tailed.\ntype Config struct {\n\t// File-specifc\n\tLocation *SeekInfo // Tail from this location. If nil, start at the beginning of the file\n\tReOpen bool // Reopen recreated files (tail -F)\n\tMustExist bool // Fail early if the file does not exist\n\tPoll bool // Poll for file changes instead of using the default inotify\n\tPipe bool // The file is a named pipe (mkfifo)\n\n\t// Generic IO\n\tFollow bool // Continue looking for new lines (tail -f)\n\tMaxLineSize int // If non-zero, split longer lines into multiple lines\n\n\t// Optionally, use a ratelimiter (e.g. created by the ratelimiter/NewLeakyBucket function)\n\tRateLimiter *ratelimiter.LeakyBucket\n\n\t// Optionally use a Logger. When nil, the Logger is set to tail.DefaultLogger.\n\t// To disable logging, set it to tail.DiscardingLogger\n\tLogger logger\n}\n\ntype Tail struct {\n\tFilename string // The filename\n\tLines chan *Line // A consumable channel of *Line\n\tConfig // Tail.Configuration\n\n\tfile *os.File\n\treader *bufio.Reader\n\tlineNum int\n\n\twatcher watch.FileWatcher\n\tchanges *watch.FileChanges\n\n\ttomb.Tomb // provides: Done, Kill, Dying\n\n\tlk sync.Mutex\n}\n\nvar (\n\t// DefaultLogger logs to os.Stderr and it is used when Config.Logger == nil\n\tDefaultLogger = log.New(os.Stderr, \"\", log.LstdFlags)\n\t// DiscardingLogger can be used to disable logging output\n\tDiscardingLogger = log.New(ioutil.Discard, \"\", 0)\n)\n\n// TailFile begins tailing the file. And returns a pointer to a Tail struct\n// and an error. An output stream is made available via the Tail.Lines\n// channel (e.g. to be looped and printed). To handle errors during tailing,\n// after finishing reading from the Lines channel, invoke the `Wait` or `Err`\n// method on the returned *Tail.\nfunc TailFile(filename string, config Config) (*Tail, error) {\n\tif config.ReOpen && !config.Follow {\n\t\tutil.Fatal(\"cannot set ReOpen without Follow.\")\n\t}\n\n\tt := &Tail{\n\t\tFilename: filename,\n\t\tLines: make(chan *Line),\n\t\tConfig: config,\n\t}\n\n\t// when Logger was not specified in config, use default logger\n\tif t.Logger == nil {\n\t\tt.Logger = DefaultLogger\n\t}\n\n\tif t.Poll {\n\t\tt.watcher = watch.NewPollingFileWatcher(filename)\n\t} else {\n\t\tt.watcher = watch.NewInotifyFileWatcher(filename)\n\t}\n\n\tif t.MustExist {\n\t\tvar err error\n\t\tt.file, err = OpenFile(t.Filename)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t}\n\n\tgo t.tailFileSync()\n\n\treturn t, nil\n}\n\n// Tell returns the file's current position, like stdio's ftell() and an error.\n// Beware that this value may not be completely accurate because one line from\n// the chan(tail.Lines) may have been read already.\nfunc (tail *Tail) Tell() (offset int64, err error) {\n\tif tail.file == nil {\n\t\treturn\n\t}\n\toffset, err = tail.file.Seek(0, io.SeekCurrent)\n\tif err != nil {\n\t\treturn\n\t}\n\n\ttail.lk.Lock()\n\tdefer tail.lk.Unlock()\n\tif tail.reader == nil {\n\t\treturn\n\t}\n\n\toffset -= int64(tail.reader.Buffered())\n\treturn\n}\n\n// Stop stops the tailing activity.\nfunc (tail *Tail) Stop() error {\n\ttail.Kill(nil)\n\treturn tail.Wait()\n}\n\n// StopAtEOF stops tailing as soon as the end of the file is reached. The function\n// returns an error,\nfunc (tail *Tail) StopAtEOF() error {\n\ttail.Kill(errStopAtEOF)\n\treturn tail.Wait()\n}\n\nvar errStopAtEOF = errors.New(\"tail: stop at eof\")\n\nfunc (tail *Tail) close() {\n\tclose(tail.Lines)\n\ttail.closeFile()\n}\n\nfunc (tail *Tail) closeFile() {\n\tif tail.file != nil {\n\t\ttail.file.Close()\n\t\ttail.file = nil\n\t}\n}\n\nfunc (tail *Tail) reopen() error {\n\ttail.closeFile()\n\ttail.lineNum = 0\n\tfor {\n\t\tvar err error\n\t\ttail.file, err = OpenFile(tail.Filename)\n\t\tif err != nil {\n\t\t\tif os.IsNotExist(err) {\n\t\t\t\ttail.Logger.Printf(\"Waiting for %s to appear...\", tail.Filename)\n\t\t\t\tif err := tail.watcher.BlockUntilExists(&tail.Tomb); err != nil {\n\t\t\t\t\tif err == tomb.ErrDying {\n\t\t\t\t\t\treturn err\n\t\t\t\t\t}\n\t\t\t\t\treturn fmt.Errorf(\"Failed to detect creation of %s: %s\", tail.Filename, err)\n\t\t\t\t}\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\treturn fmt.Errorf(\"Unable to open file %s: %s\", tail.Filename, err)\n\t\t}\n\t\tbreak\n\t}\n\treturn nil\n}\n\nfunc (tail *Tail) readLine() (string, error) {\n\ttail.lk.Lock()\n\tline, err := tail.reader.ReadString('\\n')\n\ttail.lk.Unlock()\n\tif err != nil {\n\t\t// Note ReadString \"returns the data read before the error\" in\n\t\t// case of an error, including EOF, so we return it as is. The\n\t\t// caller is expected to process it if err is EOF.\n\t\treturn line, err\n\t}\n\n\tline = strings.TrimRight(line, \"\\n\")\n\n\treturn line, err\n}\n\nfunc (tail *Tail) tailFileSync() {\n\tdefer tail.Done()\n\tdefer tail.close()\n\n\tif !tail.MustExist {\n\t\t// deferred first open.\n\t\terr := tail.reopen()\n\t\tif err != nil {\n\t\t\tif err != tomb.ErrDying {\n\t\t\t\ttail.Kill(err)\n\t\t\t}\n\t\t\treturn\n\t\t}\n\t}\n\n\t// Seek to requested location on first open of the file.\n\tif tail.Location != nil {\n\t\t_, err := tail.file.Seek(tail.Location.Offset, tail.Location.Whence)\n\t\tif err != nil {\n\t\t\ttail.Killf(\"Seek error on %s: %s\", tail.Filename, err)\n\t\t\treturn\n\t\t}\n\t}\n\n\ttail.openReader()\n\n\t// Read line by line.\n\tfor {\n\t\t// do not seek in named pipes\n\t\tif !tail.Pipe {\n\t\t\t// grab the position in case we need to back up in the event of a half-line\n\t\t\tif _, err := tail.Tell(); err != nil {\n\t\t\t\ttail.Kill(err)\n\t\t\t\treturn\n\t\t\t}\n\t\t}\n\n\t\tline, err := tail.readLine()\n\n\t\t// Process `line` even if err is EOF.\n\t\tif err == nil {\n\t\t\tcooloff := !tail.sendLine(line)\n\t\t\tif cooloff {\n\t\t\t\t// Wait a second before seeking till the end of\n\t\t\t\t// file when rate limit is reached.\n\t\t\t\tmsg := (\"Too much log activity; waiting a second before resuming tailing\")\n\t\t\t\toffset, _ := tail.Tell()\n\t\t\t\ttail.Lines <- &Line{msg, tail.lineNum, SeekInfo{Offset: offset}, time.Now(), errors.New(msg)}\n\t\t\t\tselect {\n\t\t\t\tcase <-time.After(time.Second):\n\t\t\t\tcase <-tail.Dying():\n\t\t\t\t\treturn\n\t\t\t\t}\n\t\t\t\tif err := tail.seekEnd(); err != nil {\n\t\t\t\t\ttail.Kill(err)\n\t\t\t\t\treturn\n\t\t\t\t}\n\t\t\t}\n\t\t} else if err == io.EOF {\n\t\t\tif !tail.Follow {\n\t\t\t\tif line != \"\" {\n\t\t\t\t\ttail.sendLine(line)\n\t\t\t\t}\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\tif tail.Follow && line != \"\" {\n\t\t\t\ttail.sendLine(line)\n\t\t\t\tif err := tail.seekEnd(); err != nil {\n\t\t\t\t\ttail.Kill(err)\n\t\t\t\t\treturn\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// When EOF is reached, wait for more data to become\n\t\t\t// available. Wait strategy is based on the `tail.watcher`\n\t\t\t// implementation (inotify or polling).\n\t\t\terr := tail.waitForChanges()\n\t\t\tif err != nil {\n\t\t\t\tif err != ErrStop {\n\t\t\t\t\ttail.Kill(err)\n\t\t\t\t}\n\t\t\t\treturn\n\t\t\t}\n\t\t} else {\n\t\t\t// non-EOF error\n\t\t\ttail.Killf(\"Error reading %s: %s\", tail.Filename, err)\n\t\t\treturn\n\t\t}\n\n\t\tselect {\n\t\tcase <-tail.Dying():\n\t\t\tif tail.Err() == errStopAtEOF {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\treturn\n\t\tdefault:\n\t\t}\n\t}\n}\n\n// waitForChanges waits until the file has been appended, deleted,\n// moved or truncated. When moved or deleted - the file will be\n// reopened if ReOpen is true. Truncated files are always reopened.\nfunc (tail *Tail) waitForChanges() error {\n\tif tail.changes == nil {\n\t\tpos, err := tail.file.Seek(0, io.SeekCurrent)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\ttail.changes, err = tail.watcher.ChangeEvents(&tail.Tomb, pos)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\n\tselect {\n\tcase <-tail.changes.Modified:\n\t\treturn nil\n\tcase <-tail.changes.Deleted:\n\t\ttail.changes = nil\n\t\tif tail.ReOpen {\n\t\t\t// XXX: we must not log from a library.\n\t\t\ttail.Logger.Printf(\"Re-opening moved/deleted file %s ...\", tail.Filename)\n\t\t\tif err := tail.reopen(); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\ttail.Logger.Printf(\"Successfully reopened %s\", tail.Filename)\n\t\t\ttail.openReader()\n\t\t\treturn nil\n\t\t}\n\t\ttail.Logger.Printf(\"Stopping tail as file no longer exists: %s\", tail.Filename)\n\t\treturn ErrStop\n\tcase <-tail.changes.Truncated:\n\t\t// Always reopen truncated files (Follow is true)\n\t\ttail.Logger.Printf(\"Re-opening truncated file %s ...\", tail.Filename)\n\t\tif err := tail.reopen(); err != nil {\n\t\t\treturn err\n\t\t}\n\t\ttail.Logger.Printf(\"Successfully reopened truncated %s\", tail.Filename)\n\t\ttail.openReader()\n\t\treturn nil\n\tcase <-tail.Dying():\n\t\treturn ErrStop\n\t}\n}\n\nfunc (tail *Tail) openReader() {\n\ttail.lk.Lock()\n\tif tail.MaxLineSize > 0 {\n\t\t// add 2 to account for newline characters\n\t\ttail.reader = bufio.NewReaderSize(tail.file, tail.MaxLineSize+2)\n\t} else {\n\t\ttail.reader = bufio.NewReader(tail.file)\n\t}\n\ttail.lk.Unlock()\n}\n\nfunc (tail *Tail) seekEnd() error {\n\treturn tail.seekTo(SeekInfo{Offset: 0, Whence: io.SeekEnd})\n}\n\nfunc (tail *Tail) seekTo(pos SeekInfo) error {\n\t_, err := tail.file.Seek(pos.Offset, pos.Whence)\n\tif err != nil {\n\t\treturn fmt.Errorf(\"Seek error on %s: %s\", tail.Filename, err)\n\t}\n\t// Reset the read buffer whenever the file is re-seek'ed\n\ttail.reader.Reset(tail.file)\n\treturn nil\n}\n\n// sendLine sends the line(s) to Lines channel, splitting longer lines\n// if necessary. Return false if rate limit is reached.\nfunc (tail *Tail) sendLine(line string) bool {\n\tnow := time.Now()\n\tlines := []string{line}\n\n\t// Split longer lines\n\tif tail.MaxLineSize > 0 && len(line) > tail.MaxLineSize {\n\t\tlines = util.PartitionString(line, tail.MaxLineSize)\n\t}\n\n\tfor _, line := range lines {\n\t\ttail.lineNum++\n\t\toffset, _ := tail.Tell()\n\t\tselect {\n\t\tcase tail.Lines <- &Line{line, tail.lineNum, SeekInfo{Offset: offset}, now, nil}:\n\t\tcase <-tail.Dying():\n\t\t\treturn true\n\t\t}\n\t}\n\n\tif tail.Config.RateLimiter != nil {\n\t\tok := tail.Config.RateLimiter.Pour(uint16(len(lines)))\n\t\tif !ok {\n\t\t\ttail.Logger.Printf(\"Leaky bucket full (%v); entering 1s cooloff period.\",\n\t\t\t\ttail.Filename)\n\t\t\treturn false\n\t\t}\n\t}\n\n\treturn true\n}\n\n// Cleanup removes inotify watches added by the tail package. This function is\n// meant to be invoked from a process's exit handler. Linux kernel may not\n// automatically remove inotify watches after the process exits.\n// If you plan to re-read a file, don't call Cleanup in between.\nfunc (tail *Tail) Cleanup() {\n\twatch.Cleanup(tail.Filename)\n}\n" }, { "path": "vendor/github.com/nxadm/tail/tail_posix.go", "content": "// Copyright (c) 2019 FOSS contributors of https://github.com/nxadm/tail\n// +build !windows\n\npackage tail\n\nimport (\n\t\"os\"\n)\n\n// Deprecated: this function is only useful internally and, as such,\n// it will be removed from the API in a future major release.\n//\n// OpenFile proxies a os.Open call for a file so it can be correctly tailed\n// on POSIX and non-POSIX OSes like MS Windows.\nfunc OpenFile(name string) (file *os.File, err error) {\n\treturn os.Open(name)\n}\n" }, { "path": "vendor/github.com/nxadm/tail/tail_windows.go", "content": "// Copyright (c) 2019 FOSS contributors of https://github.com/nxadm/tail\n// +build windows\n\npackage tail\n\nimport (\n\t\"os\"\n\n\t\"github.com/nxadm/tail/winfile\"\n)\n\n// Deprecated: this function is only useful internally and, as such,\n// it will be removed from the API in a future major release.\n//\n// OpenFile proxies a os.Open call for a file so it can be correctly tailed\n// on POSIX and non-POSIX OSes like MS Windows.\nfunc OpenFile(name string) (file *os.File, err error) {\n\treturn winfile.OpenFile(name, os.O_RDONLY, 0)\n}\n" }, { "path": "vendor/github.com/nxadm/tail/util/util.go", "content": "// Copyright (c) 2019 FOSS contributors of https://github.com/nxadm/tail\n// Copyright (c) 2015 HPE Software Inc. All rights reserved.\n// Copyright (c) 2013 ActiveState Software Inc. All rights reserved.\n\npackage util\n\nimport (\n\t\"fmt\"\n\t\"log\"\n\t\"os\"\n\t\"runtime/debug\"\n)\n\ntype Logger struct {\n\t*log.Logger\n}\n\nvar LOGGER = &Logger{log.New(os.Stderr, \"\", log.LstdFlags)}\n\n// fatal is like panic except it displays only the current goroutine's stack.\nfunc Fatal(format string, v ...interface{}) {\n\t// https://github.com/nxadm/log/blob/master/log.go#L45\n\tLOGGER.Output(2, fmt.Sprintf(\"FATAL -- \"+format, v...)+\"\\n\"+string(debug.Stack()))\n\tos.Exit(1)\n}\n\n// partitionString partitions the string into chunks of given size,\n// with the last chunk of variable size.\nfunc PartitionString(s string, chunkSize int) []string {\n\tif chunkSize <= 0 {\n\t\tpanic(\"invalid chunkSize\")\n\t}\n\tlength := len(s)\n\tchunks := 1 + length/chunkSize\n\tstart := 0\n\tend := chunkSize\n\tparts := make([]string, 0, chunks)\n\tfor {\n\t\tif end > length {\n\t\t\tend = length\n\t\t}\n\t\tparts = append(parts, s[start:end])\n\t\tif end == length {\n\t\t\tbreak\n\t\t}\n\t\tstart, end = end, end+chunkSize\n\t}\n\treturn parts\n}\n" }, { "path": "vendor/github.com/nxadm/tail/watch/filechanges.go", "content": "// Copyright (c) 2019 FOSS contributors of https://github.com/nxadm/tail\npackage watch\n\ntype FileChanges struct {\n\tModified chan bool // Channel to get notified of modifications\n\tTruncated chan bool // Channel to get notified of truncations\n\tDeleted chan bool // Channel to get notified of deletions/renames\n}\n\nfunc NewFileChanges() *FileChanges {\n\treturn &FileChanges{\n\t\tmake(chan bool, 1), make(chan bool, 1), make(chan bool, 1)}\n}\n\nfunc (fc *FileChanges) NotifyModified() {\n\tsendOnlyIfEmpty(fc.Modified)\n}\n\nfunc (fc *FileChanges) NotifyTruncated() {\n\tsendOnlyIfEmpty(fc.Truncated)\n}\n\nfunc (fc *FileChanges) NotifyDeleted() {\n\tsendOnlyIfEmpty(fc.Deleted)\n}\n\n// sendOnlyIfEmpty sends on a bool channel only if the channel has no\n// backlog to be read by other goroutines. This concurrency pattern\n// can be used to notify other goroutines if and only if they are\n// looking for it (i.e., subsequent notifications can be compressed\n// into one).\nfunc sendOnlyIfEmpty(ch chan bool) {\n\tselect {\n\tcase ch <- true:\n\tdefault:\n\t}\n}\n" }, { "path": "vendor/github.com/nxadm/tail/watch/inotify.go", "content": "// Copyright (c) 2019 FOSS contributors of https://github.com/nxadm/tail\n// Copyright (c) 2015 HPE Software Inc. All rights reserved.\n// Copyright (c) 2013 ActiveState Software Inc. All rights reserved.\n\npackage watch\n\nimport (\n\t\"fmt\"\n\t\"os\"\n\t\"path/filepath\"\n\n\t\"github.com/nxadm/tail/util\"\n\n \"github.com/fsnotify/fsnotify\"\n\t\"gopkg.in/tomb.v1\"\n)\n\n// InotifyFileWatcher uses inotify to monitor file changes.\ntype InotifyFileWatcher struct {\n\tFilename string\n\tSize int64\n}\n\nfunc NewInotifyFileWatcher(filename string) *InotifyFileWatcher {\n\tfw := &InotifyFileWatcher{filepath.Clean(filename), 0}\n\treturn fw\n}\n\nfunc (fw *InotifyFileWatcher) BlockUntilExists(t *tomb.Tomb) error {\n\terr := WatchCreate(fw.Filename)\n\tif err != nil {\n\t\treturn err\n\t}\n\tdefer RemoveWatchCreate(fw.Filename)\n\n\t// Do a real check now as the file might have been created before\n\t// calling `WatchFlags` above.\n\tif _, err = os.Stat(fw.Filename); !os.IsNotExist(err) {\n\t\t// file exists, or stat returned an error.\n\t\treturn err\n\t}\n\n\tevents := Events(fw.Filename)\n\n\tfor {\n\t\tselect {\n\t\tcase evt, ok := <-events:\n\t\t\tif !ok {\n\t\t\t\treturn fmt.Errorf(\"inotify watcher has been closed\")\n\t\t\t}\n\t\t\tevtName, err := filepath.Abs(evt.Name)\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tfwFilename, err := filepath.Abs(fw.Filename)\n\t\t\tif err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t\tif evtName == fwFilename {\n\t\t\t\treturn nil\n\t\t\t}\n\t\tcase <-t.Dying():\n\t\t\treturn tomb.ErrDying\n\t\t}\n\t}\n\tpanic(\"unreachable\")\n}\n\nfunc (fw *InotifyFileWatcher) ChangeEvents(t *tomb.Tomb, pos int64) (*FileChanges, error) {\n\terr := Watch(fw.Filename)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tchanges := NewFileChanges()\n\tfw.Size = pos\n\n\tgo func() {\n\n\t\tevents := Events(fw.Filename)\n\n\t\tfor {\n\t\t\tprevSize := fw.Size\n\n\t\t\tvar evt fsnotify.Event\n\t\t\tvar ok bool\n\n\t\t\tselect {\n\t\t\tcase evt, ok = <-events:\n\t\t\t\tif !ok {\n\t\t\t\t\tRemoveWatch(fw.Filename)\n\t\t\t\t\treturn\n\t\t\t\t}\n\t\t\tcase <-t.Dying():\n\t\t\t\tRemoveWatch(fw.Filename)\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\tswitch {\n\t\t\tcase evt.Op&fsnotify.Remove == fsnotify.Remove:\n\t\t\t\tfallthrough\n\n\t\t\tcase evt.Op&fsnotify.Rename == fsnotify.Rename:\n\t\t\t\tRemoveWatch(fw.Filename)\n\t\t\t\tchanges.NotifyDeleted()\n\t\t\t\treturn\n\n\t\t\t//With an open fd, unlink(fd) - inotify returns IN_ATTRIB (==fsnotify.Chmod)\n\t\t\tcase evt.Op&fsnotify.Chmod == fsnotify.Chmod:\n\t\t\t\tfallthrough\n\n\t\t\tcase evt.Op&fsnotify.Write == fsnotify.Write:\n\t\t\t\tfi, err := os.Stat(fw.Filename)\n\t\t\t\tif err != nil {\n\t\t\t\t\tif os.IsNotExist(err) {\n\t\t\t\t\t\tRemoveWatch(fw.Filename)\n\t\t\t\t\t\tchanges.NotifyDeleted()\n\t\t\t\t\t\treturn\n\t\t\t\t\t}\n\t\t\t\t\t// XXX: report this error back to the user\n\t\t\t\t\tutil.Fatal(\"Failed to stat file %v: %v\", fw.Filename, err)\n\t\t\t\t}\n\t\t\t\tfw.Size = fi.Size()\n\n\t\t\t\tif prevSize > 0 && prevSize > fw.Size {\n\t\t\t\t\tchanges.NotifyTruncated()\n\t\t\t\t} else {\n\t\t\t\t\tchanges.NotifyModified()\n\t\t\t\t}\n\t\t\t\tprevSize = fw.Size\n\t\t\t}\n\t\t}\n\t}()\n\n\treturn changes, nil\n}\n" }, { "path": "vendor/github.com/nxadm/tail/watch/inotify_tracker.go", "content": "// Copyright (c) 2019 FOSS contributors of https://github.com/nxadm/tail\n// Copyright (c) 2015 HPE Software Inc. All rights reserved.\n// Copyright (c) 2013 ActiveState Software Inc. All rights reserved.\n\npackage watch\n\nimport (\n\t\"log\"\n\t\"os\"\n\t\"path/filepath\"\n\t\"sync\"\n\t\"syscall\"\n\n\t\"github.com/nxadm/tail/util\"\n\n \"github.com/fsnotify/fsnotify\"\n)\n\ntype InotifyTracker struct {\n\tmux sync.Mutex\n\twatcher *fsnotify.Watcher\n\tchans map[string]chan fsnotify.Event\n\tdone map[string]chan bool\n\twatchNums map[string]int\n\twatch chan *watchInfo\n\tremove chan *watchInfo\n\terror chan error\n}\n\ntype watchInfo struct {\n\top fsnotify.Op\n\tfname string\n}\n\nfunc (this *watchInfo) isCreate() bool {\n\treturn this.op == fsnotify.Create\n}\n\nvar (\n\t// globally shared InotifyTracker; ensures only one fsnotify.Watcher is used\n\tshared *InotifyTracker\n\n\t// these are used to ensure the shared InotifyTracker is run exactly once\n\tonce = sync.Once{}\n\tgoRun = func() {\n\t\tshared = &InotifyTracker{\n\t\t\tmux: sync.Mutex{},\n\t\t\tchans: make(map[string]chan fsnotify.Event),\n\t\t\tdone: make(map[string]chan bool),\n\t\t\twatchNums: make(map[string]int),\n\t\t\twatch: make(chan *watchInfo),\n\t\t\tremove: make(chan *watchInfo),\n\t\t\terror: make(chan error),\n\t\t}\n\t\tgo shared.run()\n\t}\n\n\tlogger = log.New(os.Stderr, \"\", log.LstdFlags)\n)\n\n// Watch signals the run goroutine to begin watching the input filename\nfunc Watch(fname string) error {\n\treturn watch(&watchInfo{\n\t\tfname: fname,\n\t})\n}\n\n// Watch create signals the run goroutine to begin watching the input filename\n// if call the WatchCreate function, don't call the Cleanup, call the RemoveWatchCreate\nfunc WatchCreate(fname string) error {\n\treturn watch(&watchInfo{\n\t\top: fsnotify.Create,\n\t\tfname: fname,\n\t})\n}\n\nfunc watch(winfo *watchInfo) error {\n\t// start running the shared InotifyTracker if not already running\n\tonce.Do(goRun)\n\n\twinfo.fname = filepath.Clean(winfo.fname)\n\tshared.watch <- winfo\n\treturn <-shared.error\n}\n\n// RemoveWatch signals the run goroutine to remove the watch for the input filename\nfunc RemoveWatch(fname string) error {\n\treturn remove(&watchInfo{\n\t\tfname: fname,\n\t})\n}\n\n// RemoveWatch create signals the run goroutine to remove the watch for the input filename\nfunc RemoveWatchCreate(fname string) error {\n\treturn remove(&watchInfo{\n\t\top: fsnotify.Create,\n\t\tfname: fname,\n\t})\n}\n\nfunc remove(winfo *watchInfo) error {\n\t// start running the shared InotifyTracker if not already running\n\tonce.Do(goRun)\n\n\twinfo.fname = filepath.Clean(winfo.fname)\n\tshared.mux.Lock()\n\tdone := shared.done[winfo.fname]\n\tif done != nil {\n\t\tdelete(shared.done, winfo.fname)\n\t\tclose(done)\n\t}\n\tshared.mux.Unlock()\n\n\tshared.remove <- winfo\n\treturn <-shared.error\n}\n\n// Events returns a channel to which FileEvents corresponding to the input filename\n// will be sent. This channel will be closed when removeWatch is called on this\n// filename.\nfunc Events(fname string) <-chan fsnotify.Event {\n\tshared.mux.Lock()\n\tdefer shared.mux.Unlock()\n\n\treturn shared.chans[fname]\n}\n\n// Cleanup removes the watch for the input filename if necessary.\nfunc Cleanup(fname string) error {\n\treturn RemoveWatch(fname)\n}\n\n// watchFlags calls fsnotify.WatchFlags for the input filename and flags, creating\n// a new Watcher if the previous Watcher was closed.\nfunc (shared *InotifyTracker) addWatch(winfo *watchInfo) error {\n\tshared.mux.Lock()\n\tdefer shared.mux.Unlock()\n\n\tif shared.chans[winfo.fname] == nil {\n\t\tshared.chans[winfo.fname] = make(chan fsnotify.Event)\n\t}\n\tif shared.done[winfo.fname] == nil {\n\t\tshared.done[winfo.fname] = make(chan bool)\n\t}\n\n\tfname := winfo.fname\n\tif winfo.isCreate() {\n\t\t// Watch for new files to be created in the parent directory.\n\t\tfname = filepath.Dir(fname)\n\t}\n\n\tvar err error\n\t// already in inotify watch\n\tif shared.watchNums[fname] == 0 {\n\t\terr = shared.watcher.Add(fname)\n\t}\n\tif err == nil {\n\t\tshared.watchNums[fname]++\n\t}\n\treturn err\n}\n\n// removeWatch calls fsnotify.RemoveWatch for the input filename and closes the\n// corresponding events channel.\nfunc (shared *InotifyTracker) removeWatch(winfo *watchInfo) error {\n\tshared.mux.Lock()\n\n\tch := shared.chans[winfo.fname]\n\tif ch != nil {\n\t\tdelete(shared.chans, winfo.fname)\n\t\tclose(ch)\n\t}\n\n\tfname := winfo.fname\n\tif winfo.isCreate() {\n\t\t// Watch for new files to be created in the parent directory.\n\t\tfname = filepath.Dir(fname)\n\t}\n\tshared.watchNums[fname]--\n\twatchNum := shared.watchNums[fname]\n\tif watchNum == 0 {\n\t\tdelete(shared.watchNums, fname)\n\t}\n\tshared.mux.Unlock()\n\n\tvar err error\n\t// If we were the last ones to watch this file, unsubscribe from inotify.\n\t// This needs to happen after releasing the lock because fsnotify waits\n\t// synchronously for the kernel to acknowledge the removal of the watch\n\t// for this file, which causes us to deadlock if we still held the lock.\n\tif watchNum == 0 {\n\t\terr = shared.watcher.Remove(fname)\n\t}\n\n\treturn err\n}\n\n// sendEvent sends the input event to the appropriate Tail.\nfunc (shared *InotifyTracker) sendEvent(event fsnotify.Event) {\n\tname := filepath.Clean(event.Name)\n\n\tshared.mux.Lock()\n\tch := shared.chans[name]\n\tdone := shared.done[name]\n\tshared.mux.Unlock()\n\n\tif ch != nil && done != nil {\n\t\tselect {\n\t\tcase ch <- event:\n\t\tcase <-done:\n\t\t}\n\t}\n}\n\n// run starts the goroutine in which the shared struct reads events from its\n// Watcher's Event channel and sends the events to the appropriate Tail.\nfunc (shared *InotifyTracker) run() {\n\twatcher, err := fsnotify.NewWatcher()\n\tif err != nil {\n\t\tutil.Fatal(\"failed to create Watcher\")\n\t}\n\tshared.watcher = watcher\n\n\tfor {\n\t\tselect {\n\t\tcase winfo := <-shared.watch:\n\t\t\tshared.error <- shared.addWatch(winfo)\n\n\t\tcase winfo := <-shared.remove:\n\t\t\tshared.error <- shared.removeWatch(winfo)\n\n\t\tcase event, open := <-shared.watcher.Events:\n\t\t\tif !open {\n\t\t\t\treturn\n\t\t\t}\n\t\t\tshared.sendEvent(event)\n\n\t\tcase err, open := <-shared.watcher.Errors:\n\t\t\tif !open {\n\t\t\t\treturn\n\t\t\t} else if err != nil {\n\t\t\t\tsysErr, ok := err.(*os.SyscallError)\n\t\t\t\tif !ok || sysErr.Err != syscall.EINTR {\n\t\t\t\t\tlogger.Printf(\"Error in Watcher Error channel: %s\", err)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n" }, { "path": "vendor/github.com/nxadm/tail/watch/polling.go", "content": "// Copyright (c) 2019 FOSS contributors of https://github.com/nxadm/tail\n// Copyright (c) 2015 HPE Software Inc. All rights reserved.\n// Copyright (c) 2013 ActiveState Software Inc. All rights reserved.\n\npackage watch\n\nimport (\n\t\"os\"\n\t\"runtime\"\n\t\"time\"\n\n\t\"github.com/nxadm/tail/util\"\n\t\"gopkg.in/tomb.v1\"\n)\n\n// PollingFileWatcher polls the file for changes.\ntype PollingFileWatcher struct {\n\tFilename string\n\tSize int64\n}\n\nfunc NewPollingFileWatcher(filename string) *PollingFileWatcher {\n\tfw := &PollingFileWatcher{filename, 0}\n\treturn fw\n}\n\nvar POLL_DURATION time.Duration\n\nfunc (fw *PollingFileWatcher) BlockUntilExists(t *tomb.Tomb) error {\n\tfor {\n\t\tif _, err := os.Stat(fw.Filename); err == nil {\n\t\t\treturn nil\n\t\t} else if !os.IsNotExist(err) {\n\t\t\treturn err\n\t\t}\n\t\tselect {\n\t\tcase <-time.After(POLL_DURATION):\n\t\t\tcontinue\n\t\tcase <-t.Dying():\n\t\t\treturn tomb.ErrDying\n\t\t}\n\t}\n\tpanic(\"unreachable\")\n}\n\nfunc (fw *PollingFileWatcher) ChangeEvents(t *tomb.Tomb, pos int64) (*FileChanges, error) {\n\torigFi, err := os.Stat(fw.Filename)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tchanges := NewFileChanges()\n\tvar prevModTime time.Time\n\n\t// XXX: use tomb.Tomb to cleanly manage these goroutines. replace\n\t// the fatal (below) with tomb's Kill.\n\n\tfw.Size = pos\n\n\tgo func() {\n\t\tprevSize := fw.Size\n\t\tfor {\n\t\t\tselect {\n\t\t\tcase <-t.Dying():\n\t\t\t\treturn\n\t\t\tdefault:\n\t\t\t}\n\n\t\t\ttime.Sleep(POLL_DURATION)\n\t\t\tfi, err := os.Stat(fw.Filename)\n\t\t\tif err != nil {\n\t\t\t\t// Windows cannot delete a file if a handle is still open (tail keeps one open)\n\t\t\t\t// so it gives access denied to anything trying to read it until all handles are released.\n\t\t\t\tif os.IsNotExist(err) || (runtime.GOOS == \"windows\" && os.IsPermission(err)) {\n\t\t\t\t\t// File does not exist (has been deleted).\n\t\t\t\t\tchanges.NotifyDeleted()\n\t\t\t\t\treturn\n\t\t\t\t}\n\n\t\t\t\t// XXX: report this error back to the user\n\t\t\t\tutil.Fatal(\"Failed to stat file %v: %v\", fw.Filename, err)\n\t\t\t}\n\n\t\t\t// File got moved/renamed?\n\t\t\tif !os.SameFile(origFi, fi) {\n\t\t\t\tchanges.NotifyDeleted()\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\t// File got truncated?\n\t\t\tfw.Size = fi.Size()\n\t\t\tif prevSize > 0 && prevSize > fw.Size {\n\t\t\t\tchanges.NotifyTruncated()\n\t\t\t\tprevSize = fw.Size\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\t// File got bigger?\n\t\t\tif prevSize > 0 && prevSize < fw.Size {\n\t\t\t\tchanges.NotifyModified()\n\t\t\t\tprevSize = fw.Size\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tprevSize = fw.Size\n\n\t\t\t// File was appended to (changed)?\n\t\t\tmodTime := fi.ModTime()\n\t\t\tif modTime != prevModTime {\n\t\t\t\tprevModTime = modTime\n\t\t\t\tchanges.NotifyModified()\n\t\t\t}\n\t\t}\n\t}()\n\n\treturn changes, nil\n}\n\nfunc init() {\n\tPOLL_DURATION = 250 * time.Millisecond\n}\n" }, { "path": "vendor/github.com/nxadm/tail/watch/watch.go", "content": "// Copyright (c) 2019 FOSS contributors of https://github.com/nxadm/tail\n// Copyright (c) 2015 HPE Software Inc. All rights reserved.\n// Copyright (c) 2013 ActiveState Software Inc. All rights reserved.\n\npackage watch\n\nimport \"gopkg.in/tomb.v1\"\n\n// FileWatcher monitors file-level events.\ntype FileWatcher interface {\n\t// BlockUntilExists blocks until the file comes into existence.\n\tBlockUntilExists(*tomb.Tomb) error\n\n\t// ChangeEvents reports on changes to a file, be it modification,\n\t// deletion, renames or truncations. Returned FileChanges group of\n\t// channels will be closed, thus become unusable, after a deletion\n\t// or truncation event.\n\t// In order to properly report truncations, ChangeEvents requires\n\t// the caller to pass their current offset in the file.\n\tChangeEvents(*tomb.Tomb, int64) (*FileChanges, error)\n}\n" }, { "path": "vendor/github.com/nxadm/tail/winfile/winfile.go", "content": "// Copyright (c) 2019 FOSS contributors of https://github.com/nxadm/tail\n// +build windows\n\npackage winfile\n\nimport (\n\t\"os\"\n\t\"syscall\"\n\t\"unsafe\"\n)\n\n// issue also described here\n//https://codereview.appspot.com/8203043/\n\n// https://github.com/jnwhiteh/golang/blob/master/src/pkg/syscall/syscall_windows.go#L218\nfunc Open(path string, mode int, perm uint32) (fd syscall.Handle, err error) {\n\tif len(path) == 0 {\n\t\treturn syscall.InvalidHandle, syscall.ERROR_FILE_NOT_FOUND\n\t}\n\tpathp, err := syscall.UTF16PtrFromString(path)\n\tif err != nil {\n\t\treturn syscall.InvalidHandle, err\n\t}\n\tvar access uint32\n\tswitch mode & (syscall.O_RDONLY | syscall.O_WRONLY | syscall.O_RDWR) {\n\tcase syscall.O_RDONLY:\n\t\taccess = syscall.GENERIC_READ\n\tcase syscall.O_WRONLY:\n\t\taccess = syscall.GENERIC_WRITE\n\tcase syscall.O_RDWR:\n\t\taccess = syscall.GENERIC_READ | syscall.GENERIC_WRITE\n\t}\n\tif mode&syscall.O_CREAT != 0 {\n\t\taccess |= syscall.GENERIC_WRITE\n\t}\n\tif mode&syscall.O_APPEND != 0 {\n\t\taccess &^= syscall.GENERIC_WRITE\n\t\taccess |= syscall.FILE_APPEND_DATA\n\t}\n\tsharemode := uint32(syscall.FILE_SHARE_READ | syscall.FILE_SHARE_WRITE | syscall.FILE_SHARE_DELETE)\n\tvar sa *syscall.SecurityAttributes\n\tif mode&syscall.O_CLOEXEC == 0 {\n\t\tsa = makeInheritSa()\n\t}\n\tvar createmode uint32\n\tswitch {\n\tcase mode&(syscall.O_CREAT|syscall.O_EXCL) == (syscall.O_CREAT | syscall.O_EXCL):\n\t\tcreatemode = syscall.CREATE_NEW\n\tcase mode&(syscall.O_CREAT|syscall.O_TRUNC) == (syscall.O_CREAT | syscall.O_TRUNC):\n\t\tcreatemode = syscall.CREATE_ALWAYS\n\tcase mode&syscall.O_CREAT == syscall.O_CREAT:\n\t\tcreatemode = syscall.OPEN_ALWAYS\n\tcase mode&syscall.O_TRUNC == syscall.O_TRUNC:\n\t\tcreatemode = syscall.TRUNCATE_EXISTING\n\tdefault:\n\t\tcreatemode = syscall.OPEN_EXISTING\n\t}\n\th, e := syscall.CreateFile(pathp, access, sharemode, sa, createmode, syscall.FILE_ATTRIBUTE_NORMAL, 0)\n\treturn h, e\n}\n\n// https://github.com/jnwhiteh/golang/blob/master/src/pkg/syscall/syscall_windows.go#L211\nfunc makeInheritSa() *syscall.SecurityAttributes {\n\tvar sa syscall.SecurityAttributes\n\tsa.Length = uint32(unsafe.Sizeof(sa))\n\tsa.InheritHandle = 1\n\treturn &sa\n}\n\n// https://github.com/jnwhiteh/golang/blob/master/src/pkg/os/file_windows.go#L133\nfunc OpenFile(name string, flag int, perm os.FileMode) (file *os.File, err error) {\n\tr, e := Open(name, flag|syscall.O_CLOEXEC, syscallMode(perm))\n\tif e != nil {\n\t\treturn nil, e\n\t}\n\treturn os.NewFile(uintptr(r), name), nil\n}\n\n// https://github.com/jnwhiteh/golang/blob/master/src/pkg/os/file_posix.go#L61\nfunc syscallMode(i os.FileMode) (o uint32) {\n\to |= uint32(i.Perm())\n\tif i&os.ModeSetuid != 0 {\n\t\to |= syscall.S_ISUID\n\t}\n\tif i&os.ModeSetgid != 0 {\n\t\to |= syscall.S_ISGID\n\t}\n\tif i&os.ModeSticky != 0 {\n\t\to |= syscall.S_ISVTX\n\t}\n\t// No mapping for Go's ModeTemporary (plan9 only).\n\treturn\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/.gitignore", "content": ".DS_Store\nTODO\ntmp/**/*\n*.coverprofile\n.vscode\n.idea/\n*.log\n" }, { "path": "vendor/github.com/onsi/ginkgo/.travis.yml", "content": "language: go\ngo:\n - tip\n - 1.16.x\n - 1.15.x\n\ncache:\n directories:\n - $GOPATH/pkg/mod\n\n# allow internal package imports, necessary for forked repositories\ngo_import_path: github.com/onsi/ginkgo\n\ninstall:\n - GO111MODULE=\"off\" go get -v -t ./...\n - GO111MODULE=\"off\" go get golang.org/x/tools/cmd/cover\n - GO111MODULE=\"off\" go get github.com/onsi/gomega\n - GO111MODULE=\"off\" go install github.com/onsi/ginkgo/ginkgo\n - export PATH=$GOPATH/bin:$PATH\n\nscript:\n - GO111MODULE=\"on\" go mod tidy && git diff --exit-code go.mod go.sum\n - go vet\n - ginkgo -r --randomizeAllSpecs --randomizeSuites --race --trace\n" }, { "path": "vendor/github.com/onsi/ginkgo/CHANGELOG.md", "content": "## 1.16.5\n\nGinkgo 2.0 now has a Release Candidate. 1.16.5 advertises the existence of the RC.\n1.16.5 deprecates GinkgoParallelNode in favor of GinkgoParallelProcess\n\nYou can silence the RC advertisement by setting an `ACK_GINKG_RC=true` environment variable or creating a file in your home directory called `.ack-ginkgo-rc`\n\n## 1.16.4\n\n### Fixes\n1.16.4 retracts 1.16.3. There are no code changes. The 1.16.3 tag was associated with the wrong commit and an attempt to change it after-the-fact has proven problematic. 1.16.4 retracts 1.16.3 in Ginkgo's go.mod and creates a new, correctly tagged, release.\n\n## 1.16.3\n\n### Features\n- Measure is now deprecated and emits a deprecation warning.\n\n## 1.16.2\n\n### Fixes\n- Deprecations can be suppressed by setting an `ACK_GINKGO_DEPRECATIONS=` environment variable.\n\n## 1.16.1\n\n### Fixes\n- Supress --stream deprecation warning on windows (#793)\n\n## 1.16.0\n\n### Features\n- Advertise Ginkgo 2.0. Introduce deprecations. [9ef1913]\n - Update README.md to advertise that Ginkgo 2.0 is coming.\n - Backport the 2.0 DeprecationTracker and start alerting users\n about upcoming deprecations.\n\n- Add slim-sprig template functions to bootstrap/generate (#775) [9162b86]\n\n### Fixes\n- Fix accidental reference to 1488 (#784) [9fb7fe4]\n\n## 1.15.2\n\n### Fixes\n- ignore blank `-focus` and `-skip` flags (#780) [e90a4a0]\n\n## 1.15.1\n\n### Fixes\n- reporters/junit: Use `system-out` element instead of `passed` (#769) [9eda305]\n\n## 1.15.0\n\n### Features\n- Adds 'outline' command to print the outline of specs/containers in a file (#754) [071c369] [6803cc3] [935b538] [06744e8] [0c40583]\n- Add support for using template to generate tests (#752) [efb9e69]\n- Add a Chinese Doc #755 (#756) [5207632]\n- cli: allow multiple -focus and -skip flags (#736) [9a782fb]\n\n### Fixes\n- Add _internal to filename of tests created with internal flag (#751) [43c12da]\n\n## 1.14.2\n\n### Fixes\n- correct handling windows backslash in import path (#721) [97f3d51]\n- Add additional methods to GinkgoT() to improve compatibility with the testing.TB interface [b5fe44d]\n\n## 1.14.1\n\n### Fixes\n- Discard exported method declaration when running ginkgo bootstrap (#558) [f4b0240]\n\n## 1.14.0\n\n### Features\n- Defer running top-level container nodes until RunSpecs is called [d44dedf]\n- [Document Ginkgo lifecycle](http://onsi.github.io/ginkgo/#understanding-ginkgos-lifecycle)\n- Add `extensions/globals` package (#692) [3295c8f] - this can be helpful in contexts where you are test-driving your test-generation code (see [#692](https://github.com/onsi/ginkgo/pull/692))\n- Print Skip reason in JUnit reporter if one was provided [820dfab]\n\n## 1.13.0\n\n### Features\n- Add a version of table.Entry that allows dumping the entry parameters. (#689) [21eaef2]\n\n### Fixes\n- Ensure integration tests pass in an environment sans GOPATH [606fba2]\n- Add books package (#568) [fc0e44e]\n- doc(readme): installation via \"tools package\" (#677) [83bb20e]\n- Solve the undefined: unix.Dup2 compile error on mips64le (#680) [0624f75]\n- Import package without dot (#687) [6321024]\n- Fix integration tests to stop require GOPATH (#686) [a912ec5]\n\n## 1.12.3\n\n### Fixes\n- Print correct code location of failing table test (#666) [c6d7afb]\n\n## 1.12.2\n\n### Fixes\n- Update dependencies [ea4a036]\n\n## 1.12.1\n\n### Fixes\n- Make unfocus (\"blur\") much faster (#674) [8b18061]\n- Fix typo (#673) [7fdcbe8]\n- Test against 1.14 and remove 1.12 [d5c2ad6]\n- Test if a coverprofile content is empty before checking its latest character (#670) [14d9fa2]\n- replace tail package with maintained one. this fixes go get errors (#667) [4ba33d4]\n- improve ginkgo performance - makes progress on #644 [a14f98e]\n- fix convert integration tests [1f8ba69]\n- fix typo succesful -> successful (#663) [1ea49cf]\n- Fix invalid link (#658) [b886136]\n- convert utility : Include comments from source (#657) [1077c6d]\n- Explain what BDD means [d79e7fb]\n- skip race detector test on unsupported platform (#642) [f8ab89d]\n- Use Dup2 from golang.org/x/sys/unix instead of syscallDup (#638) [5d53c55]\n- Fix missing newline in combined coverage file (#641) [6a07ea2]\n- check if a spec is run before returning SpecSummary (#645) [8850000]\n\n## 1.12.0\n\n### Features\n- Add module definition (#630) [78916ab]\n\n## 1.11.0\n\n### Features\n- Add syscall for riscv64 architecture [f66e896]\n- teamcity reporter: output location of test failure as well as test definition (#626) [9869142]\n- teamcity reporter: output newline after every service message (#625) [3cfa02d]\n- Add support for go module when running `generate` command (#578) [9c89e3f]\n\n## 1.10.3\n\n### Fixes\n- Set go_import_path in travis.yml to allow internal packages in forks (#607) [3b721db]\n- Add integration test [d90e0dc]\n- Fix coverage files combining [e5dde8c]\n- A new CLI option: -ginkgo.reportFile (#601) [034fd25]\n\n## 1.10.2\n\n### Fixes\n- speed up table entry generateIt() (#609) [5049dc5]\n- Fix. Write errors to stderr instead of stdout (#610) [7bb3091]\n\n## 1.10.1\n\n### Fixes\n- stack backtrace: fix skipping (#600) [2a4c0bd]\n\n## 1.10.0\n\n### Fixes\n- stack backtrace: fix alignment and skipping [66915d6]\n- fix typo in documentation [8f97b93]\n\n## 1.9.0\n\n### Features\n- Option to print output into report, when tests have passed [0545415]\n\n### Fixes\n- Fixed typos in comments [0ecbc58]\n- gofmt code [a7f8bfb]\n- Simplify code [7454d00]\n- Simplify concatenation, incrementation and function assignment [4825557]\n- Avoid unnecessary conversions [9d9403c]\n- JUnit: include more detailed information about panic [19cca4b]\n- Print help to stdout when the user asks for help [4cb7441]\n\n\n## 1.8.0\n\n### New Features\n- allow config of the vet flag for `go test` (#562) [3cd45fa]\n- Support projects using go modules [d56ee76]\n\n### Fixes and Minor Improvements\n- chore(godoc): fixes typos in Measurement funcs [dbaca8e]\n- Optimize focus to avoid allocations [f493786]\n- Ensure generated test file names are underscored [505cc35]\n\n## 1.7.0\n\n### New Features\n- Add JustAfterEach (#484) [0d4f080]\n\n### Fixes\n- Correctly round suite time in junit reporter [2445fc1]\n- Avoid using -i argument to go test for Golang 1.10+ [46bbc26]\n\n## 1.6.0\n\n### New Features\n- add --debug flag to emit node output to files (#499) [39febac]\n\n### Fixes\n- fix: for `go vet` to pass [69338ec]\n- docs: fix for contributing instructions [7004cb1]\n- consolidate and streamline contribution docs (#494) [d848015]\n- Make generated Junit file compatable with \"Maven Surefire\" (#488) [e51bee6]\n- all: gofmt [000d317]\n- Increase eventually timeout to 30s [c73579c]\n- Clarify asynchronous test behaviour [294d8f4]\n- Travis badge should only show master [26d2143]\n\n## 1.5.0 5/10/2018\n\n### New Features\n- Supports go v1.10 (#443, #446, #451) [e873237, 468e89e, e37dbfe, a37f4c0, c0b857d, bca5260, 4177ca8]\n- Add a When() synonym for Context() (#386) [747514b, 7484dad, 7354a07, dd826c8]\n- Re-add noisySkippings flag [652e15c]\n- Allow coverage to be displayed for focused specs (#367) [11459a8]\n- Handle -outputdir flag (#364) [228e3a8]\n- Handle -coverprofile flag (#355) [43392d5]\n\n### Fixes\n- When using custom reporters register the custom reporters *before* the default reporter. This allows users to see the output of any print statements in their customer reporters. (#365) [8382b23]\n- When running a test and calculating the coverage using the `-coverprofile` and `-outputdir` flags, Ginkgo fails with an error if the directory does not exist. This is due to an [issue in go 1.10](https://github.com/golang/go/issues/24588) (#446) [b36a6e0]\n- `unfocus` command ignores vendor folder (#459) [e5e551c, c556e43, a3b6351, 9a820dd]\n- Ignore packages whose tests are all ignored by go (#456) [7430ca7, 6d8be98]\n- Increase the threshold when checking time measuments (#455) [2f714bf, 68f622c]\n- Fix race condition in coverage tests (#423) [a5a8ff7, ab9c08b]\n- Add an extra new line after reporting spec run completion for test2json [874520d]\n- added name name field to junit reported testsuite [ae61c63]\n- Do not set the run time of a spec when the dryRun flag is used (#438) [457e2d9, ba8e856]\n- Process FWhen and FSpecify when unfocusing (#434) [9008c7b, ee65bd, df87dfe]\n- Synchronise the access to the state of specs to avoid race conditions (#430) [7d481bc, ae6829d]\n- Added Duration on GinkgoTestDescription (#383) [5f49dad, 528417e, 0747408, 329d7ed]\n- Fix Ginkgo stack trace on failure for Specify (#415) [b977ede, 65ca40e, 6c46eb8]\n- Update README with Go 1.6+, Golang -> Go (#409) [17f6b97, bc14b66, 20d1598]\n- Use fmt.Errorf instead of errors.New(fmt.Sprintf (#401) [a299f56, 44e2eaa]\n- Imports in generated code should follow conventions (#398) [0bec0b0, e8536d8]\n- Prevent data race error when Recording a benchmark value from multiple go routines (#390) [c0c4881, 7a241e9]\n- Replace GOPATH in Environment [4b883f0]\n\n\n## 1.4.0 7/16/2017\n\n- `ginkgo` now provides a hint if you accidentally forget to run `ginkgo bootstrap` to generate a `*_suite_test.go` file that actually invokes the Ginkgo test runner. [#345](https://github.com/onsi/ginkgo/pull/345)\n- thanks to improvements in `go test -c` `ginkgo` no longer needs to fix Go's compilation output to ensure compilation errors are expressed relative to the CWD. [#357]\n- `ginkgo watch -watchRegExp=...` allows you to specify a custom regular expression to watch. Only files matching the regular expression are watched for changes (the default is `\\.go$`) [#356]\n- `ginkgo` now always emits compilation output. Previously, only failed compilation output was printed out. [#277]\n- `ginkgo -requireSuite` now fails the test run if there are `*_test.go` files but `go test` fails to detect any tests. Typically this means you forgot to run `ginkgo bootstrap` to generate a suite file. [#344]\n- `ginkgo -timeout=DURATION` allows you to adjust the timeout for the entire test suite (default is 24 hours) [#248]\n\n## 1.3.0 3/28/2017\n\nImprovements:\n\n- Significantly improved parallel test distribution. Now instead of pre-sharding test cases across workers (which can result in idle workers and poor test performance) Ginkgo uses a shared queue to keep all workers busy until all tests are complete. This improves test-time performance and consistency.\n- `Skip(message)` can be used to skip the current test.\n- Added `extensions/table` - a Ginkgo DSL for [Table Driven Tests](http://onsi.github.io/ginkgo/#table-driven-tests)\n- Add `GinkgoRandomSeed()` - shorthand for `config.GinkgoConfig.RandomSeed`\n- Support for retrying flaky tests with `--flakeAttempts`\n- `ginkgo ./...` now recurses as you'd expect\n- Added `Specify` a synonym for `It`\n- Support colorise on Windows\n- Broader support for various go compilation flags in the `ginkgo` CLI\n\nBug Fixes:\n\n- Ginkgo tests now fail when you `panic(nil)` (#167)\n\n## 1.2.0 5/31/2015\n\nImprovements\n\n- `ginkgo -coverpkg` calls down to `go test -coverpkg` (#160)\n- `ginkgo -afterSuiteHook COMMAND` invokes the passed-in `COMMAND` after a test suite completes (#152)\n- Relaxed requirement for Go 1.4+. `ginkgo` now works with Go v1.3+ (#166)\n\n## 1.2.0-beta\n\nGinkgo now requires Go 1.4+\n\nImprovements:\n\n- Call reporters in reverse order when announcing spec completion -- allows custom reporters to emit output before the default reporter does.\n- Improved focus behavior. Now, this:\n\n ```golang\n FDescribe(\"Some describe\", func() {\n It(\"A\", func() {})\n\n FIt(\"B\", func() {})\n })\n ```\n\n will run `B` but *not* `A`. This tends to be a common usage pattern when in the thick of writing and debugging tests.\n- When `SIGINT` is received, Ginkgo will emit the contents of the `GinkgoWriter` before running the `AfterSuite`. Useful for debugging stuck tests.\n- When `--progress` is set, Ginkgo will write test progress (in particular, Ginkgo will say when it is about to run a BeforeEach, AfterEach, It, etc...) to the `GinkgoWriter`. This is useful for debugging stuck tests and tests that generate many logs.\n- Improved output when an error occurs in a setup or teardown block.\n- When `--dryRun` is set, Ginkgo will walk the spec tree and emit to its reporter *without* actually running anything. Best paired with `-v` to understand which specs will run in which order.\n- Add `By` to help document long `It`s. `By` simply writes to the `GinkgoWriter`.\n- Add support for precompiled tests:\n - `ginkgo build ` will now compile the package, producing a file named `package.test`\n - The compiled `package.test` file can be run directly. This runs the tests in series.\n - To run precompiled tests in parallel, you can run: `ginkgo -p package.test`\n- Support `bootstrap`ping and `generate`ing [Agouti](http://agouti.org) specs.\n- `ginkgo generate` and `ginkgo bootstrap` now honor the package name already defined in a given directory\n- The `ginkgo` CLI ignores `SIGQUIT`. Prevents its stack dump from interlacing with the underlying test suite's stack dump.\n- The `ginkgo` CLI now compiles tests into a temporary directory instead of the package directory. This necessitates upgrading to Go v1.4+.\n- `ginkgo -notify` now works on Linux\n\nBug Fixes:\n\n- If --skipPackages is used and all packages are skipped, Ginkgo should exit 0.\n- Fix tempfile leak when running in parallel\n- Fix incorrect failure message when a panic occurs during a parallel test run\n- Fixed an issue where a pending test within a focused context (or a focused test within a pending context) would skip all other tests.\n- Be more consistent about handling SIGTERM as well as SIGINT\n- When interupted while concurrently compiling test suites in the background, Ginkgo now cleans up the compiled artifacts.\n- Fixed a long standing bug where `ginkgo -p` would hang if a process spawned by one of the Ginkgo parallel nodes does not exit. (Hooray!)\n\n## 1.1.0 (8/2/2014)\n\nNo changes, just dropping the beta.\n\n## 1.1.0-beta (7/22/2014)\nNew Features:\n\n- `ginkgo watch` now monitors packages *and their dependencies* for changes. The depth of the dependency tree can be modified with the `-depth` flag.\n- Test suites with a programmatic focus (`FIt`, `FDescribe`, etc...) exit with non-zero status code, even when they pass. This allows CI systems to detect accidental commits of focused test suites.\n- `ginkgo -p` runs the testsuite in parallel with an auto-detected number of nodes.\n- `ginkgo -tags=TAG_LIST` passes a list of tags down to the `go build` command.\n- `ginkgo --failFast` aborts the test suite after the first failure.\n- `ginkgo generate file_1 file_2` can take multiple file arguments.\n- Ginkgo now summarizes any spec failures that occurred at the end of the test run. \n- `ginkgo --randomizeSuites` will run tests *suites* in random order using the generated/passed-in seed.\n\nImprovements:\n\n- `ginkgo -skipPackage` now takes a comma-separated list of strings. If the *relative path* to a package matches one of the entries in the comma-separated list, that package is skipped.\n- `ginkgo --untilItFails` no longer recompiles between attempts.\n- Ginkgo now panics when a runnable node (`It`, `BeforeEach`, `JustBeforeEach`, `AfterEach`, `Measure`) is nested within another runnable node. This is always a mistake. Any test suites that panic because of this change should be fixed.\n\nBug Fixes:\n\n- `ginkgo boostrap` and `ginkgo generate` no longer fail when dealing with `hyphen-separated-packages`.\n- parallel specs are now better distributed across nodes - fixed a crashing bug where (for example) distributing 11 tests across 7 nodes would panic\n\n## 1.0.0 (5/24/2014)\nNew Features:\n\n- Add `GinkgoParallelNode()` - shorthand for `config.GinkgoConfig.ParallelNode`\n\nImprovements:\n\n- When compilation fails, the compilation output is rewritten to present a correct *relative* path. Allows ⌘-clicking in iTerm open the file in your text editor.\n- `--untilItFails` and `ginkgo watch` now generate new random seeds between test runs, unless a particular random seed is specified.\n\nBug Fixes:\n\n- `-cover` now generates a correctly combined coverprofile when running with in parallel with multiple `-node`s.\n- Print out the contents of the `GinkgoWriter` when `BeforeSuite` or `AfterSuite` fail.\n- Fix all remaining race conditions in Ginkgo's test suite.\n\n## 1.0.0-beta (4/14/2014)\nBreaking changes:\n\n- `thirdparty/gomocktestreporter` is gone. Use `GinkgoT()` instead\n- Modified the Reporter interface \n- `watch` is now a subcommand, not a flag.\n\nDSL changes:\n\n- `BeforeSuite` and `AfterSuite` for setting up and tearing down test suites.\n- `AfterSuite` is triggered on interrupt (`^C`) as well as exit.\n- `SynchronizedBeforeSuite` and `SynchronizedAfterSuite` for setting up and tearing down singleton resources across parallel nodes.\n\nCLI changes:\n\n- `watch` is now a subcommand, not a flag\n- `--nodot` flag can be passed to `ginkgo generate` and `ginkgo bootstrap` to avoid dot imports. This explicitly imports all exported identifiers in Ginkgo and Gomega. Refreshing this list can be done by running `ginkgo nodot`\n- Additional arguments can be passed to specs. Pass them after the `--` separator\n- `--skipPackage` flag takes a regexp and ignores any packages with package names passing said regexp.\n- `--trace` flag prints out full stack traces when errors occur, not just the line at which the error occurs.\n\nMisc:\n\n- Start using semantic versioning\n- Start maintaining changelog\n\nMajor refactor:\n\n- Pull out Ginkgo's internal to `internal`\n- Rename `example` everywhere to `spec`\n- Much more!\n" }, { "path": "vendor/github.com/onsi/ginkgo/CONTRIBUTING.md", "content": "# Contributing to Ginkgo\n\nYour contributions to Ginkgo are essential for its long-term maintenance and improvement.\n\n- Please **open an issue first** - describe what problem you are trying to solve and give the community a forum for input and feedback ahead of investing time in writing code!\n- Ensure adequate test coverage:\n - When adding to the Ginkgo library, add unit and/or integration tests (under the `integration` folder).\n - When adding to the Ginkgo CLI, note that there are very few unit tests. Please add an integration test.\n- Update the documentation. Ginko uses `godoc` comments and documentation on the `gh-pages` branch.\n If relevant, please submit a docs PR to that branch alongside your code PR.\n\nThanks for supporting Ginkgo!\n\n## Setup\n\nFork the repo, then:\n\n```\ngo get github.com/onsi/ginkgo\ngo get github.com/onsi/gomega/...\ncd $GOPATH/src/github.com/onsi/ginkgo\ngit remote add fork git@github.com:/ginkgo.git\n\nginkgo -r -p # ensure tests are green\ngo vet ./... # ensure linter is happy\n```\n\n## Making the PR\n - go to a new branch `git checkout -b my-feature`\n - make your changes\n - run tests and linter again (see above)\n - `git push fork`\n - open PR 🎉\n" }, { "path": "vendor/github.com/onsi/ginkgo/LICENSE", "content": "Copyright (c) 2013-2014 Onsi Fakhouri\n\nPermission is hereby granted, free of charge, to any person obtaining\na copy of this software and associated documentation files (the\n\"Software\"), to deal in the Software without restriction, including\nwithout limitation the rights to use, copy, modify, merge, publish,\ndistribute, sublicense, and/or sell copies of the Software, and to\npermit persons to whom the Software is furnished to do so, subject to\nthe following conditions:\n\nThe above copyright notice and this permission notice shall be\nincluded in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\nNONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE\nLIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\nOF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION\nWITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n" }, { "path": "vendor/github.com/onsi/ginkgo/README.md", "content": "![Ginkgo: A Go BDD Testing Framework](https://onsi.github.io/ginkgo/images/ginkgo.png)\n\n[![test](https://github.com/onsi/ginkgo/workflows/test/badge.svg?branch=master)](https://github.com/onsi/ginkgo/actions?query=workflow%3Atest+branch%3Amaster)\n\nJump to the [docs](https://onsi.github.io/ginkgo/) | [中文文档](https://ke-chain.github.io/ginkgodoc) to learn more. To start rolling your Ginkgo tests *now* [keep reading](#set-me-up)!\n\nIf you have a question, comment, bug report, feature request, etc. please open a GitHub issue, or visit the [Ginkgo Slack channel](https://app.slack.com/client/T029RQSE6/CQQ50BBNW).\n\n# Ginkgo 2.0 Release Candidate is available!\n\nAn effort is underway to develop and deliver Ginkgo 2.0. The work is happening in the [ver2](https://github.com/onsi/ginkgo/tree/ver2) branch and a changelog and migration guide is being maintained on that branch [here](https://github.com/onsi/ginkgo/blob/ver2/docs/MIGRATING_TO_V2.md). Issue [#711](https://github.com/onsi/ginkgo/issues/711) is the central place for discussion.\n\nAs described in the [changelog](https://github.com/onsi/ginkgo/blob/ver2/docs/MIGRATING_TO_V2.md) and [proposal](https://docs.google.com/document/d/1h28ZknXRsTLPNNiOjdHIO-F2toCzq4xoZDXbfYaBdoQ/edit#), Ginkgo 2.0 will clean up the Ginkgo codebase, deprecate and remove some v1 functionality, and add several new much-requested features. To help users get ready for the migration, Ginkgo v1 has started emitting deprecation warnings for features that will no longer be supported with links to documentation for how to migrate away from these features. If you have concerns or comments please chime in on [#711](https://github.com/onsi/ginkgo/issues/711).\n\nPlease start exploring and using the V2 release! To get started follow the [Using the Release Candidate](https://github.com/onsi/ginkgo/blob/ver2/docs/MIGRATING_TO_V2.md#using-the-beta) directions in the migration guide.\n\n## TLDR\nGinkgo builds on Go's `testing` package, allowing expressive [Behavior-Driven Development](https://en.wikipedia.org/wiki/Behavior-driven_development) (\"BDD\") style tests.\nIt is typically (and optionally) paired with the [Gomega](https://github.com/onsi/gomega) matcher library.\n\n```go\nDescribe(\"the strings package\", func() {\n Context(\"strings.Contains()\", func() {\n When(\"the string contains the substring in the middle\", func() {\n It(\"returns `true`\", func() {\n Expect(strings.Contains(\"Ginkgo is awesome\", \"is\")).To(BeTrue())\n })\n })\n })\n})\n```\n\n## Feature List\n\n- Ginkgo uses Go's `testing` package and can live alongside your existing `testing` tests. It's easy to [bootstrap](https://onsi.github.io/ginkgo/#bootstrapping-a-suite) and start writing your [first tests](https://onsi.github.io/ginkgo/#adding-specs-to-a-suite)\n\n- Ginkgo allows you to write tests in Go using expressive [Behavior-Driven Development](https://en.wikipedia.org/wiki/Behavior-driven_development) (\"BDD\") style:\n - Nestable [`Describe`, `Context` and `When` container blocks](https://onsi.github.io/ginkgo/#organizing-specs-with-containers-describe-and-context)\n - [`BeforeEach` and `AfterEach` blocks](https://onsi.github.io/ginkgo/#extracting-common-setup-beforeeach) for setup and teardown\n - [`It` and `Specify` blocks](https://onsi.github.io/ginkgo/#individual-specs-it) that hold your assertions\n - [`JustBeforeEach` blocks](https://onsi.github.io/ginkgo/#separating-creation-and-configuration-justbeforeeach) that separate creation from configuration (also known as the subject action pattern).\n - [`BeforeSuite` and `AfterSuite` blocks](https://onsi.github.io/ginkgo/#global-setup-and-teardown-beforesuite-and-aftersuite) to prep for and cleanup after a suite.\n\n- A comprehensive test runner that lets you:\n - Mark specs as [pending](https://onsi.github.io/ginkgo/#pending-specs)\n - [Focus](https://onsi.github.io/ginkgo/#focused-specs) individual specs, and groups of specs, either programmatically or on the command line\n - Run your tests in [random order](https://onsi.github.io/ginkgo/#spec-permutation), and then reuse random seeds to replicate the same order.\n - Break up your test suite into parallel processes for straightforward [test parallelization](https://onsi.github.io/ginkgo/#parallel-specs)\n\n- `ginkgo`: a command line interface with plenty of handy command line arguments for [running your tests](https://onsi.github.io/ginkgo/#running-tests) and [generating](https://onsi.github.io/ginkgo/#generators) test files. Here are a few choice examples:\n - `ginkgo -nodes=N` runs your tests in `N` parallel processes and print out coherent output in realtime\n - `ginkgo -cover` runs your tests using Go's code coverage tool\n - `ginkgo convert` converts an XUnit-style `testing` package to a Ginkgo-style package\n - `ginkgo -focus=\"REGEXP\"` and `ginkgo -skip=\"REGEXP\"` allow you to specify a subset of tests to run via regular expression\n - `ginkgo -r` runs all tests suites under the current directory\n - `ginkgo -v` prints out identifying information for each tests just before it runs\n\n And much more: run `ginkgo help` for details!\n\n The `ginkgo` CLI is convenient, but purely optional -- Ginkgo works just fine with `go test`\n\n- `ginkgo watch` [watches](https://onsi.github.io/ginkgo/#watching-for-changes) packages *and their dependencies* for changes, then reruns tests. Run tests immediately as you develop!\n\n- Built-in support for testing [asynchronicity](https://onsi.github.io/ginkgo/#asynchronous-tests)\n\n- Built-in support for [benchmarking](https://onsi.github.io/ginkgo/#benchmark-tests) your code. Control the number of benchmark samples as you gather runtimes and other, arbitrary, bits of numerical information about your code. \n\n- [Completions for Sublime Text](https://github.com/onsi/ginkgo-sublime-completions): just use [Package Control](https://sublime.wbond.net/) to install `Ginkgo Completions`.\n\n- [Completions for VSCode](https://github.com/onsi/vscode-ginkgo): just use VSCode's extension installer to install `vscode-ginkgo`.\n\n- [Ginkgo tools for VSCode](https://marketplace.visualstudio.com/items?itemName=joselitofilho.ginkgotestexplorer): just use VSCode's extension installer to install `ginkgoTestExplorer`.\n\n- Straightforward support for third-party testing libraries such as [Gomock](https://code.google.com/p/gomock/) and [Testify](https://github.com/stretchr/testify). Check out the [docs](https://onsi.github.io/ginkgo/#third-party-integrations) for details.\n\n- A modular architecture that lets you easily:\n - Write [custom reporters](https://onsi.github.io/ginkgo/#writing-custom-reporters) (for example, Ginkgo comes with a [JUnit XML reporter](https://onsi.github.io/ginkgo/#generating-junit-xml-output) and a TeamCity reporter).\n - [Adapt an existing matcher library (or write your own!)](https://onsi.github.io/ginkgo/#using-other-matcher-libraries) to work with Ginkgo\n\n## [Gomega](https://github.com/onsi/gomega): Ginkgo's Preferred Matcher Library\n\nGinkgo is best paired with Gomega. Learn more about Gomega [here](https://onsi.github.io/gomega/)\n\n## [Agouti](https://github.com/sclevine/agouti): A Go Acceptance Testing Framework\n\nAgouti allows you run WebDriver integration tests. Learn more about Agouti [here](https://agouti.org)\n\n## Getting Started\n\nYou'll need the Go command-line tools. Follow the [installation instructions](https://golang.org/doc/install) if you don't have it installed.\n\n### Global installation\nTo install the Ginkgo command line interface:\n```bash\ngo get -u github.com/onsi/ginkgo/ginkgo\n```\nNote that this will install it to `$GOBIN`, which will need to be in the `$PATH` (or equivalent). Run `go help install` for more information.\n\n### Go module [\"tools package\"](https://github.com/golang/go/issues/25922):\nCreate (or update) a file called `tools/tools.go` with the following contents:\n```go\n// +build tools\n\npackage tools\n\nimport (\n\t_ \"github.com/onsi/ginkgo/ginkgo\"\n)\n\n// This file imports packages that are used when running go generate, or used\n// during the development process but not otherwise depended on by built code.\n```\nThe Ginkgo command can then be run via `go run github.com/onsi/ginkgo/ginkgo`.\nThis approach allows the version of Ginkgo to be maintained under source control for reproducible results,\nand is well suited to automated test pipelines.\n\n### Bootstrapping\n```bash\ncd path/to/package/you/want/to/test\n\nginkgo bootstrap # set up a new ginkgo suite\nginkgo generate # will create a sample test file. edit this file and add your tests then...\n\ngo test # to run your tests\n\nginkgo # also runs your tests\n\n```\n\n## I'm new to Go: What are my testing options?\n\nOf course, I heartily recommend [Ginkgo](https://github.com/onsi/ginkgo) and [Gomega](https://github.com/onsi/gomega). Both packages are seeing heavy, daily, production use on a number of projects and boast a mature and comprehensive feature-set.\n\nWith that said, it's great to know what your options are :)\n\n### What Go gives you out of the box\n\nTesting is a first class citizen in Go, however Go's built-in testing primitives are somewhat limited: The [testing](https://golang.org/pkg/testing) package provides basic XUnit style tests and no assertion library.\n\n### Matcher libraries for Go's XUnit style tests\n\nA number of matcher libraries have been written to augment Go's built-in XUnit style tests. Here are two that have gained traction:\n\n- [testify](https://github.com/stretchr/testify)\n- [gocheck](https://labix.org/gocheck)\n\nYou can also use Ginkgo's matcher library [Gomega](https://github.com/onsi/gomega) in [XUnit style tests](https://onsi.github.io/gomega/#using-gomega-with-golangs-xunitstyle-tests)\n\n### BDD style testing frameworks\n\nThere are a handful of BDD-style testing frameworks written for Go. Here are a few:\n\n- [Ginkgo](https://github.com/onsi/ginkgo) ;)\n- [GoConvey](https://github.com/smartystreets/goconvey) \n- [Goblin](https://github.com/franela/goblin)\n- [Mao](https://github.com/azer/mao)\n- [Zen](https://github.com/pranavraja/zen)\n\nFinally, @shageman has [put together](https://github.com/shageman/gotestit) a comprehensive comparison of Go testing libraries.\n\nGo explore!\n\n## License\n\nGinkgo is MIT-Licensed\n\n## Contributing\n\nSee [CONTRIBUTING.md](CONTRIBUTING.md)\n" }, { "path": "vendor/github.com/onsi/ginkgo/RELEASING.md", "content": "A Ginkgo release is a tagged git sha and a GitHub release. To cut a release:\n\n1. Ensure CHANGELOG.md is up to date.\n - Use `git log --pretty=format:'- %s [%h]' HEAD...vX.X.X` to list all the commits since the last release\n - Categorize the changes into\n - Breaking Changes (requires a major version)\n - New Features (minor version)\n - Fixes (fix version)\n - Maintenance (which in general should not be mentioned in `CHANGELOG.md` as they have no user impact)\n1. Update `VERSION` in `config/config.go`\n1. Commit, push, and release:\n ```\n git commit -m \"vM.m.p\"\n git push\n gh release create \"vM.m.p\"\n git fetch --tags origin master\n ```" }, { "path": "vendor/github.com/onsi/ginkgo/config/config.go", "content": "/*\nGinkgo accepts a number of configuration options.\n\nThese are documented [here](http://onsi.github.io/ginkgo/#the-ginkgo-cli)\n\nYou can also learn more via\n\n\tginkgo help\n\nor (I kid you not):\n\n\tgo test -asdf\n*/\npackage config\n\nimport (\n\t\"flag\"\n\t\"time\"\n\n\t\"fmt\"\n)\n\nconst VERSION = \"1.16.5\"\n\ntype GinkgoConfigType struct {\n\tRandomSeed int64\n\tRandomizeAllSpecs bool\n\tRegexScansFilePath bool\n\tFocusStrings []string\n\tSkipStrings []string\n\tSkipMeasurements bool\n\tFailOnPending bool\n\tFailFast bool\n\tFlakeAttempts int\n\tEmitSpecProgress bool\n\tDryRun bool\n\tDebugParallel bool\n\n\tParallelNode int\n\tParallelTotal int\n\tSyncHost string\n\tStreamHost string\n}\n\nvar GinkgoConfig = GinkgoConfigType{}\n\ntype DefaultReporterConfigType struct {\n\tNoColor bool\n\tSlowSpecThreshold float64\n\tNoisyPendings bool\n\tNoisySkippings bool\n\tSuccinct bool\n\tVerbose bool\n\tFullTrace bool\n\tReportPassed bool\n\tReportFile string\n}\n\nvar DefaultReporterConfig = DefaultReporterConfigType{}\n\nfunc processPrefix(prefix string) string {\n\tif prefix != \"\" {\n\t\tprefix += \".\"\n\t}\n\treturn prefix\n}\n\ntype flagFunc func(string)\n\nfunc (f flagFunc) String() string { return \"\" }\nfunc (f flagFunc) Set(s string) error { f(s); return nil }\n\nfunc Flags(flagSet *flag.FlagSet, prefix string, includeParallelFlags bool) {\n\tprefix = processPrefix(prefix)\n\tflagSet.Int64Var(&(GinkgoConfig.RandomSeed), prefix+\"seed\", time.Now().Unix(), \"The seed used to randomize the spec suite.\")\n\tflagSet.BoolVar(&(GinkgoConfig.RandomizeAllSpecs), prefix+\"randomizeAllSpecs\", false, \"If set, ginkgo will randomize all specs together. By default, ginkgo only randomizes the top level Describe, Context and When groups.\")\n\tflagSet.BoolVar(&(GinkgoConfig.SkipMeasurements), prefix+\"skipMeasurements\", false, \"If set, ginkgo will skip any measurement specs.\")\n\tflagSet.BoolVar(&(GinkgoConfig.FailOnPending), prefix+\"failOnPending\", false, \"If set, ginkgo will mark the test suite as failed if any specs are pending.\")\n\tflagSet.BoolVar(&(GinkgoConfig.FailFast), prefix+\"failFast\", false, \"If set, ginkgo will stop running a test suite after a failure occurs.\")\n\n\tflagSet.BoolVar(&(GinkgoConfig.DryRun), prefix+\"dryRun\", false, \"If set, ginkgo will walk the test hierarchy without actually running anything. Best paired with -v.\")\n\n\tflagSet.Var(flagFunc(flagFocus), prefix+\"focus\", \"If set, ginkgo will only run specs that match this regular expression. Can be specified multiple times, values are ORed.\")\n\tflagSet.Var(flagFunc(flagSkip), prefix+\"skip\", \"If set, ginkgo will only run specs that do not match this regular expression. Can be specified multiple times, values are ORed.\")\n\n\tflagSet.BoolVar(&(GinkgoConfig.RegexScansFilePath), prefix+\"regexScansFilePath\", false, \"If set, ginkgo regex matching also will look at the file path (code location).\")\n\n\tflagSet.IntVar(&(GinkgoConfig.FlakeAttempts), prefix+\"flakeAttempts\", 1, \"Make up to this many attempts to run each spec. Please note that if any of the attempts succeed, the suite will not be failed. But any failures will still be recorded.\")\n\n\tflagSet.BoolVar(&(GinkgoConfig.EmitSpecProgress), prefix+\"progress\", false, \"If set, ginkgo will emit progress information as each spec runs to the GinkgoWriter.\")\n\n\tflagSet.BoolVar(&(GinkgoConfig.DebugParallel), prefix+\"debug\", false, \"If set, ginkgo will emit node output to files when running in parallel.\")\n\n\tif includeParallelFlags {\n\t\tflagSet.IntVar(&(GinkgoConfig.ParallelNode), prefix+\"parallel.node\", 1, \"This worker node's (one-indexed) node number. For running specs in parallel.\")\n\t\tflagSet.IntVar(&(GinkgoConfig.ParallelTotal), prefix+\"parallel.total\", 1, \"The total number of worker nodes. For running specs in parallel.\")\n\t\tflagSet.StringVar(&(GinkgoConfig.SyncHost), prefix+\"parallel.synchost\", \"\", \"The address for the server that will synchronize the running nodes.\")\n\t\tflagSet.StringVar(&(GinkgoConfig.StreamHost), prefix+\"parallel.streamhost\", \"\", \"The address for the server that the running nodes should stream data to.\")\n\t}\n\n\tflagSet.BoolVar(&(DefaultReporterConfig.NoColor), prefix+\"noColor\", false, \"If set, suppress color output in default reporter.\")\n\tflagSet.Float64Var(&(DefaultReporterConfig.SlowSpecThreshold), prefix+\"slowSpecThreshold\", 5.0, \"(in seconds) Specs that take longer to run than this threshold are flagged as slow by the default reporter.\")\n\tflagSet.BoolVar(&(DefaultReporterConfig.NoisyPendings), prefix+\"noisyPendings\", true, \"If set, default reporter will shout about pending tests.\")\n\tflagSet.BoolVar(&(DefaultReporterConfig.NoisySkippings), prefix+\"noisySkippings\", true, \"If set, default reporter will shout about skipping tests.\")\n\tflagSet.BoolVar(&(DefaultReporterConfig.Verbose), prefix+\"v\", false, \"If set, default reporter print out all specs as they begin.\")\n\tflagSet.BoolVar(&(DefaultReporterConfig.Succinct), prefix+\"succinct\", false, \"If set, default reporter prints out a very succinct report\")\n\tflagSet.BoolVar(&(DefaultReporterConfig.FullTrace), prefix+\"trace\", false, \"If set, default reporter prints out the full stack trace when a failure occurs\")\n\tflagSet.BoolVar(&(DefaultReporterConfig.ReportPassed), prefix+\"reportPassed\", false, \"If set, default reporter prints out captured output of passed tests.\")\n\tflagSet.StringVar(&(DefaultReporterConfig.ReportFile), prefix+\"reportFile\", \"\", \"Override the default reporter output file path.\")\n\n}\n\nfunc BuildFlagArgs(prefix string, ginkgo GinkgoConfigType, reporter DefaultReporterConfigType) []string {\n\tprefix = processPrefix(prefix)\n\tresult := make([]string, 0)\n\n\tif ginkgo.RandomSeed > 0 {\n\t\tresult = append(result, fmt.Sprintf(\"--%sseed=%d\", prefix, ginkgo.RandomSeed))\n\t}\n\n\tif ginkgo.RandomizeAllSpecs {\n\t\tresult = append(result, fmt.Sprintf(\"--%srandomizeAllSpecs\", prefix))\n\t}\n\n\tif ginkgo.SkipMeasurements {\n\t\tresult = append(result, fmt.Sprintf(\"--%sskipMeasurements\", prefix))\n\t}\n\n\tif ginkgo.FailOnPending {\n\t\tresult = append(result, fmt.Sprintf(\"--%sfailOnPending\", prefix))\n\t}\n\n\tif ginkgo.FailFast {\n\t\tresult = append(result, fmt.Sprintf(\"--%sfailFast\", prefix))\n\t}\n\n\tif ginkgo.DryRun {\n\t\tresult = append(result, fmt.Sprintf(\"--%sdryRun\", prefix))\n\t}\n\n\tfor _, s := range ginkgo.FocusStrings {\n\t\tresult = append(result, fmt.Sprintf(\"--%sfocus=%s\", prefix, s))\n\t}\n\n\tfor _, s := range ginkgo.SkipStrings {\n\t\tresult = append(result, fmt.Sprintf(\"--%sskip=%s\", prefix, s))\n\t}\n\n\tif ginkgo.FlakeAttempts > 1 {\n\t\tresult = append(result, fmt.Sprintf(\"--%sflakeAttempts=%d\", prefix, ginkgo.FlakeAttempts))\n\t}\n\n\tif ginkgo.EmitSpecProgress {\n\t\tresult = append(result, fmt.Sprintf(\"--%sprogress\", prefix))\n\t}\n\n\tif ginkgo.DebugParallel {\n\t\tresult = append(result, fmt.Sprintf(\"--%sdebug\", prefix))\n\t}\n\n\tif ginkgo.ParallelNode != 0 {\n\t\tresult = append(result, fmt.Sprintf(\"--%sparallel.node=%d\", prefix, ginkgo.ParallelNode))\n\t}\n\n\tif ginkgo.ParallelTotal != 0 {\n\t\tresult = append(result, fmt.Sprintf(\"--%sparallel.total=%d\", prefix, ginkgo.ParallelTotal))\n\t}\n\n\tif ginkgo.StreamHost != \"\" {\n\t\tresult = append(result, fmt.Sprintf(\"--%sparallel.streamhost=%s\", prefix, ginkgo.StreamHost))\n\t}\n\n\tif ginkgo.SyncHost != \"\" {\n\t\tresult = append(result, fmt.Sprintf(\"--%sparallel.synchost=%s\", prefix, ginkgo.SyncHost))\n\t}\n\n\tif ginkgo.RegexScansFilePath {\n\t\tresult = append(result, fmt.Sprintf(\"--%sregexScansFilePath\", prefix))\n\t}\n\n\tif reporter.NoColor {\n\t\tresult = append(result, fmt.Sprintf(\"--%snoColor\", prefix))\n\t}\n\n\tif reporter.SlowSpecThreshold > 0 {\n\t\tresult = append(result, fmt.Sprintf(\"--%sslowSpecThreshold=%.5f\", prefix, reporter.SlowSpecThreshold))\n\t}\n\n\tif !reporter.NoisyPendings {\n\t\tresult = append(result, fmt.Sprintf(\"--%snoisyPendings=false\", prefix))\n\t}\n\n\tif !reporter.NoisySkippings {\n\t\tresult = append(result, fmt.Sprintf(\"--%snoisySkippings=false\", prefix))\n\t}\n\n\tif reporter.Verbose {\n\t\tresult = append(result, fmt.Sprintf(\"--%sv\", prefix))\n\t}\n\n\tif reporter.Succinct {\n\t\tresult = append(result, fmt.Sprintf(\"--%ssuccinct\", prefix))\n\t}\n\n\tif reporter.FullTrace {\n\t\tresult = append(result, fmt.Sprintf(\"--%strace\", prefix))\n\t}\n\n\tif reporter.ReportPassed {\n\t\tresult = append(result, fmt.Sprintf(\"--%sreportPassed\", prefix))\n\t}\n\n\tif reporter.ReportFile != \"\" {\n\t\tresult = append(result, fmt.Sprintf(\"--%sreportFile=%s\", prefix, reporter.ReportFile))\n\t}\n\n\treturn result\n}\n\n// flagFocus implements the -focus flag.\nfunc flagFocus(arg string) {\n\tif arg != \"\" {\n\t\tGinkgoConfig.FocusStrings = append(GinkgoConfig.FocusStrings, arg)\n\t}\n}\n\n// flagSkip implements the -skip flag.\nfunc flagSkip(arg string) {\n\tif arg != \"\" {\n\t\tGinkgoConfig.SkipStrings = append(GinkgoConfig.SkipStrings, arg)\n\t}\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/formatter/formatter.go", "content": "package formatter\n\nimport (\n\t\"fmt\"\n\t\"regexp\"\n\t\"strings\"\n)\n\nconst COLS = 80\n\ntype ColorMode uint8\n\nconst (\n\tColorModeNone ColorMode = iota\n\tColorModeTerminal\n\tColorModePassthrough\n)\n\nvar SingletonFormatter = New(ColorModeTerminal)\n\nfunc F(format string, args ...interface{}) string {\n\treturn SingletonFormatter.F(format, args...)\n}\n\nfunc Fi(indentation uint, format string, args ...interface{}) string {\n\treturn SingletonFormatter.Fi(indentation, format, args...)\n}\n\nfunc Fiw(indentation uint, maxWidth uint, format string, args ...interface{}) string {\n\treturn SingletonFormatter.Fiw(indentation, maxWidth, format, args...)\n}\n\ntype Formatter struct {\n\tColorMode ColorMode\n\tcolors map[string]string\n\tstyleRe *regexp.Regexp\n\tpreserveColorStylingTags bool\n}\n\nfunc NewWithNoColorBool(noColor bool) Formatter {\n\tif noColor {\n\t\treturn New(ColorModeNone)\n\t}\n\treturn New(ColorModeTerminal)\n}\n\nfunc New(colorMode ColorMode) Formatter {\n\tf := Formatter{\n\t\tColorMode: colorMode,\n\t\tcolors: map[string]string{\n\t\t\t\"/\": \"\\x1b[0m\",\n\t\t\t\"bold\": \"\\x1b[1m\",\n\t\t\t\"underline\": \"\\x1b[4m\",\n\n\t\t\t\"red\": \"\\x1b[38;5;9m\",\n\t\t\t\"orange\": \"\\x1b[38;5;214m\",\n\t\t\t\"coral\": \"\\x1b[38;5;204m\",\n\t\t\t\"magenta\": \"\\x1b[38;5;13m\",\n\t\t\t\"green\": \"\\x1b[38;5;10m\",\n\t\t\t\"dark-green\": \"\\x1b[38;5;28m\",\n\t\t\t\"yellow\": \"\\x1b[38;5;11m\",\n\t\t\t\"light-yellow\": \"\\x1b[38;5;228m\",\n\t\t\t\"cyan\": \"\\x1b[38;5;14m\",\n\t\t\t\"gray\": \"\\x1b[38;5;243m\",\n\t\t\t\"light-gray\": \"\\x1b[38;5;246m\",\n\t\t\t\"blue\": \"\\x1b[38;5;12m\",\n\t\t},\n\t}\n\tcolors := []string{}\n\tfor color := range f.colors {\n\t\tcolors = append(colors, color)\n\t}\n\tf.styleRe = regexp.MustCompile(\"{{(\" + strings.Join(colors, \"|\") + \")}}\")\n\treturn f\n}\n\nfunc (f Formatter) F(format string, args ...interface{}) string {\n\treturn f.Fi(0, format, args...)\n}\n\nfunc (f Formatter) Fi(indentation uint, format string, args ...interface{}) string {\n\treturn f.Fiw(indentation, 0, format, args...)\n}\n\nfunc (f Formatter) Fiw(indentation uint, maxWidth uint, format string, args ...interface{}) string {\n\tout := fmt.Sprintf(f.style(format), args...)\n\n\tif indentation == 0 && maxWidth == 0 {\n\t\treturn out\n\t}\n\n\tlines := strings.Split(out, \"\\n\")\n\n\tif maxWidth != 0 {\n\t\toutLines := []string{}\n\n\t\tmaxWidth = maxWidth - indentation*2\n\t\tfor _, line := range lines {\n\t\t\tif f.length(line) <= maxWidth {\n\t\t\t\toutLines = append(outLines, line)\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\toutWords := []string{}\n\t\t\tlength := uint(0)\n\t\t\twords := strings.Split(line, \" \")\n\t\t\tfor _, word := range words {\n\t\t\t\twordLength := f.length(word)\n\t\t\t\tif length+wordLength <= maxWidth {\n\t\t\t\t\tlength += wordLength\n\t\t\t\t\toutWords = append(outWords, word)\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\toutLines = append(outLines, strings.Join(outWords, \" \"))\n\t\t\t\toutWords = []string{word}\n\t\t\t\tlength = wordLength\n\t\t\t}\n\t\t\tif len(outWords) > 0 {\n\t\t\t\toutLines = append(outLines, strings.Join(outWords, \" \"))\n\t\t\t}\n\t\t}\n\n\t\tlines = outLines\n\t}\n\n\tif indentation == 0 {\n\t\treturn strings.Join(lines, \"\\n\")\n\t}\n\n\tpadding := strings.Repeat(\" \", int(indentation))\n\tfor i := range lines {\n\t\tif lines[i] != \"\" {\n\t\t\tlines[i] = padding + lines[i]\n\t\t}\n\t}\n\n\treturn strings.Join(lines, \"\\n\")\n}\n\nfunc (f Formatter) length(styled string) uint {\n\tn := uint(0)\n\tinStyle := false\n\tfor _, b := range styled {\n\t\tif inStyle {\n\t\t\tif b == 'm' {\n\t\t\t\tinStyle = false\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tif b == '\\x1b' {\n\t\t\tinStyle = true\n\t\t\tcontinue\n\t\t}\n\t\tn += 1\n\t}\n\treturn n\n}\n\nfunc (f Formatter) CycleJoin(elements []string, joiner string, cycle []string) string {\n\tif len(elements) == 0 {\n\t\treturn \"\"\n\t}\n\tn := len(cycle)\n\tout := \"\"\n\tfor i, text := range elements {\n\t\tout += cycle[i%n] + text\n\t\tif i < len(elements)-1 {\n\t\t\tout += joiner\n\t\t}\n\t}\n\tout += \"{{/}}\"\n\treturn f.style(out)\n}\n\nfunc (f Formatter) style(s string) string {\n\tswitch f.ColorMode {\n\tcase ColorModeNone:\n\t\treturn f.styleRe.ReplaceAllString(s, \"\")\n\tcase ColorModePassthrough:\n\t\treturn s\n\tcase ColorModeTerminal:\n\t\treturn f.styleRe.ReplaceAllStringFunc(s, func(match string) string {\n\t\t\tif out, ok := f.colors[strings.Trim(match, \"{}\")]; ok {\n\t\t\t\treturn out\n\t\t\t}\n\t\t\treturn match\n\t\t})\n\t}\n\n\treturn \"\"\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/ginkgo_dsl.go", "content": "/*\nGinkgo is a BDD-style testing framework for Golang\n\nThe godoc documentation describes Ginkgo's API. More comprehensive documentation (with examples!) is available at http://onsi.github.io/ginkgo/\n\nGinkgo's preferred matcher library is [Gomega](http://github.com/onsi/gomega)\n\nGinkgo on Github: http://github.com/onsi/ginkgo\n\nGinkgo is MIT-Licensed\n*/\npackage ginkgo\n\nimport (\n\t\"flag\"\n\t\"fmt\"\n\t\"io\"\n\t\"net/http\"\n\t\"os\"\n\t\"reflect\"\n\t\"strings\"\n\t\"time\"\n\n\t\"github.com/onsi/ginkgo/config\"\n\t\"github.com/onsi/ginkgo/internal/codelocation\"\n\t\"github.com/onsi/ginkgo/internal/global\"\n\t\"github.com/onsi/ginkgo/internal/remote\"\n\t\"github.com/onsi/ginkgo/internal/testingtproxy\"\n\t\"github.com/onsi/ginkgo/internal/writer\"\n\t\"github.com/onsi/ginkgo/reporters\"\n\t\"github.com/onsi/ginkgo/reporters/stenographer\"\n\tcolorable \"github.com/onsi/ginkgo/reporters/stenographer/support/go-colorable\"\n\t\"github.com/onsi/ginkgo/types\"\n)\n\nvar deprecationTracker = types.NewDeprecationTracker()\n\nconst GINKGO_VERSION = config.VERSION\nconst GINKGO_PANIC = `\nYour test failed.\nGinkgo panics to prevent subsequent assertions from running.\nNormally Ginkgo rescues this panic so you shouldn't see it.\n\nBut, if you make an assertion in a goroutine, Ginkgo can't capture the panic.\nTo circumvent this, you should call\n\n\tdefer GinkgoRecover()\n\nat the top of the goroutine that caused this panic.\n`\n\nfunc init() {\n\tconfig.Flags(flag.CommandLine, \"ginkgo\", true)\n\tGinkgoWriter = writer.New(os.Stdout)\n}\n\n//GinkgoWriter implements an io.Writer\n//When running in verbose mode any writes to GinkgoWriter will be immediately printed\n//to stdout. Otherwise, GinkgoWriter will buffer any writes produced during the current test and flush them to screen\n//only if the current test fails.\nvar GinkgoWriter io.Writer\n\n//The interface by which Ginkgo receives *testing.T\ntype GinkgoTestingT interface {\n\tFail()\n}\n\n//GinkgoRandomSeed returns the seed used to randomize spec execution order. It is\n//useful for seeding your own pseudorandom number generators (PRNGs) to ensure\n//consistent executions from run to run, where your tests contain variability (for\n//example, when selecting random test data).\nfunc GinkgoRandomSeed() int64 {\n\treturn config.GinkgoConfig.RandomSeed\n}\n\n//GinkgoParallelNode is deprecated, use GinkgoParallelProcess instead\nfunc GinkgoParallelNode() int {\n\tdeprecationTracker.TrackDeprecation(types.Deprecations.ParallelNode(), codelocation.New(1))\n\treturn GinkgoParallelProcess()\n}\n\n//GinkgoParallelProcess returns the parallel process number for the current ginkgo process\n//The process number is 1-indexed\nfunc GinkgoParallelProcess() int {\n\treturn config.GinkgoConfig.ParallelNode\n}\n\n//Some matcher libraries or legacy codebases require a *testing.T\n//GinkgoT implements an interface analogous to *testing.T and can be used if\n//the library in question accepts *testing.T through an interface\n//\n// For example, with testify:\n// assert.Equal(GinkgoT(), 123, 123, \"they should be equal\")\n//\n// Or with gomock:\n// gomock.NewController(GinkgoT())\n//\n// GinkgoT() takes an optional offset argument that can be used to get the\n// correct line number associated with the failure.\nfunc GinkgoT(optionalOffset ...int) GinkgoTInterface {\n\toffset := 3\n\tif len(optionalOffset) > 0 {\n\t\toffset = optionalOffset[0]\n\t}\n\tfailedFunc := func() bool {\n\t\treturn CurrentGinkgoTestDescription().Failed\n\t}\n\tnameFunc := func() string {\n\t\treturn CurrentGinkgoTestDescription().FullTestText\n\t}\n\treturn testingtproxy.New(GinkgoWriter, Fail, Skip, failedFunc, nameFunc, offset)\n}\n\n//The interface returned by GinkgoT(). This covers most of the methods\n//in the testing package's T.\ntype GinkgoTInterface interface {\n\tCleanup(func())\n\tSetenv(key, value string)\n\tError(args ...interface{})\n\tErrorf(format string, args ...interface{})\n\tFail()\n\tFailNow()\n\tFailed() bool\n\tFatal(args ...interface{})\n\tFatalf(format string, args ...interface{})\n\tHelper()\n\tLog(args ...interface{})\n\tLogf(format string, args ...interface{})\n\tName() string\n\tParallel()\n\tSkip(args ...interface{})\n\tSkipNow()\n\tSkipf(format string, args ...interface{})\n\tSkipped() bool\n\tTempDir() string\n}\n\n//Custom Ginkgo test reporters must implement the Reporter interface.\n//\n//The custom reporter is passed in a SuiteSummary when the suite begins and ends,\n//and a SpecSummary just before a spec begins and just after a spec ends\ntype Reporter reporters.Reporter\n\n//Asynchronous specs are given a channel of the Done type. You must close or write to the channel\n//to tell Ginkgo that your async test is done.\ntype Done chan<- interface{}\n\n//GinkgoTestDescription represents the information about the current running test returned by CurrentGinkgoTestDescription\n//\tFullTestText: a concatenation of ComponentTexts and the TestText\n//\tComponentTexts: a list of all texts for the Describes & Contexts leading up to the current test\n//\tTestText: the text in the actual It or Measure node\n//\tIsMeasurement: true if the current test is a measurement\n//\tFileName: the name of the file containing the current test\n//\tLineNumber: the line number for the current test\n//\tFailed: if the current test has failed, this will be true (useful in an AfterEach)\ntype GinkgoTestDescription struct {\n\tFullTestText string\n\tComponentTexts []string\n\tTestText string\n\n\tIsMeasurement bool\n\n\tFileName string\n\tLineNumber int\n\n\tFailed bool\n\tDuration time.Duration\n}\n\n//CurrentGinkgoTestDescripton returns information about the current running test.\nfunc CurrentGinkgoTestDescription() GinkgoTestDescription {\n\tsummary, ok := global.Suite.CurrentRunningSpecSummary()\n\tif !ok {\n\t\treturn GinkgoTestDescription{}\n\t}\n\n\tsubjectCodeLocation := summary.ComponentCodeLocations[len(summary.ComponentCodeLocations)-1]\n\n\treturn GinkgoTestDescription{\n\t\tComponentTexts: summary.ComponentTexts[1:],\n\t\tFullTestText: strings.Join(summary.ComponentTexts[1:], \" \"),\n\t\tTestText: summary.ComponentTexts[len(summary.ComponentTexts)-1],\n\t\tIsMeasurement: summary.IsMeasurement,\n\t\tFileName: subjectCodeLocation.FileName,\n\t\tLineNumber: subjectCodeLocation.LineNumber,\n\t\tFailed: summary.HasFailureState(),\n\t\tDuration: summary.RunTime,\n\t}\n}\n\n//Measurement tests receive a Benchmarker.\n//\n//You use the Time() function to time how long the passed in body function takes to run\n//You use the RecordValue() function to track arbitrary numerical measurements.\n//The RecordValueWithPrecision() function can be used alternatively to provide the unit\n//and resolution of the numeric measurement.\n//The optional info argument is passed to the test reporter and can be used to\n// provide the measurement data to a custom reporter with context.\n//\n//See http://onsi.github.io/ginkgo/#benchmark_tests for more details\ntype Benchmarker interface {\n\tTime(name string, body func(), info ...interface{}) (elapsedTime time.Duration)\n\tRecordValue(name string, value float64, info ...interface{})\n\tRecordValueWithPrecision(name string, value float64, units string, precision int, info ...interface{})\n}\n\n//RunSpecs is the entry point for the Ginkgo test runner.\n//You must call this within a Golang testing TestX(t *testing.T) function.\n//\n//To bootstrap a test suite you can use the Ginkgo CLI:\n//\n//\tginkgo bootstrap\nfunc RunSpecs(t GinkgoTestingT, description string) bool {\n\tspecReporters := []Reporter{buildDefaultReporter()}\n\tif config.DefaultReporterConfig.ReportFile != \"\" {\n\t\treportFile := config.DefaultReporterConfig.ReportFile\n\t\tspecReporters[0] = reporters.NewJUnitReporter(reportFile)\n\t\tspecReporters = append(specReporters, buildDefaultReporter())\n\t}\n\treturn runSpecsWithCustomReporters(t, description, specReporters)\n}\n\n//To run your tests with Ginkgo's default reporter and your custom reporter(s), replace\n//RunSpecs() with this method.\nfunc RunSpecsWithDefaultAndCustomReporters(t GinkgoTestingT, description string, specReporters []Reporter) bool {\n\tdeprecationTracker.TrackDeprecation(types.Deprecations.CustomReporter())\n\tspecReporters = append(specReporters, buildDefaultReporter())\n\treturn runSpecsWithCustomReporters(t, description, specReporters)\n}\n\n//To run your tests with your custom reporter(s) (and *not* Ginkgo's default reporter), replace\n//RunSpecs() with this method. Note that parallel tests will not work correctly without the default reporter\nfunc RunSpecsWithCustomReporters(t GinkgoTestingT, description string, specReporters []Reporter) bool {\n\tdeprecationTracker.TrackDeprecation(types.Deprecations.CustomReporter())\n\treturn runSpecsWithCustomReporters(t, description, specReporters)\n}\n\nfunc runSpecsWithCustomReporters(t GinkgoTestingT, description string, specReporters []Reporter) bool {\n\twriter := GinkgoWriter.(*writer.Writer)\n\twriter.SetStream(config.DefaultReporterConfig.Verbose)\n\treporters := make([]reporters.Reporter, len(specReporters))\n\tfor i, reporter := range specReporters {\n\t\treporters[i] = reporter\n\t}\n\tpassed, hasFocusedTests := global.Suite.Run(t, description, reporters, writer, config.GinkgoConfig)\n\n\tif deprecationTracker.DidTrackDeprecations() {\n\t\tfmt.Fprintln(colorable.NewColorableStderr(), deprecationTracker.DeprecationsReport())\n\t}\n\n\tif passed && hasFocusedTests && strings.TrimSpace(os.Getenv(\"GINKGO_EDITOR_INTEGRATION\")) == \"\" {\n\t\tfmt.Println(\"PASS | FOCUSED\")\n\t\tos.Exit(types.GINKGO_FOCUS_EXIT_CODE)\n\t}\n\treturn passed\n}\n\nfunc buildDefaultReporter() Reporter {\n\tremoteReportingServer := config.GinkgoConfig.StreamHost\n\tif remoteReportingServer == \"\" {\n\t\tstenographer := stenographer.New(!config.DefaultReporterConfig.NoColor, config.GinkgoConfig.FlakeAttempts > 1, colorable.NewColorableStdout())\n\t\treturn reporters.NewDefaultReporter(config.DefaultReporterConfig, stenographer)\n\t} else {\n\t\tdebugFile := \"\"\n\t\tif config.GinkgoConfig.DebugParallel {\n\t\t\tdebugFile = fmt.Sprintf(\"ginkgo-node-%d.log\", config.GinkgoConfig.ParallelNode)\n\t\t}\n\t\treturn remote.NewForwardingReporter(config.DefaultReporterConfig, remoteReportingServer, &http.Client{}, remote.NewOutputInterceptor(), GinkgoWriter.(*writer.Writer), debugFile)\n\t}\n}\n\n//Skip notifies Ginkgo that the current spec was skipped.\nfunc Skip(message string, callerSkip ...int) {\n\tskip := 0\n\tif len(callerSkip) > 0 {\n\t\tskip = callerSkip[0]\n\t}\n\n\tglobal.Failer.Skip(message, codelocation.New(skip+1))\n\tpanic(GINKGO_PANIC)\n}\n\n//Fail notifies Ginkgo that the current spec has failed. (Gomega will call Fail for you automatically when an assertion fails.)\nfunc Fail(message string, callerSkip ...int) {\n\tskip := 0\n\tif len(callerSkip) > 0 {\n\t\tskip = callerSkip[0]\n\t}\n\n\tglobal.Failer.Fail(message, codelocation.New(skip+1))\n\tpanic(GINKGO_PANIC)\n}\n\n//GinkgoRecover should be deferred at the top of any spawned goroutine that (may) call `Fail`\n//Since Gomega assertions call fail, you should throw a `defer GinkgoRecover()` at the top of any goroutine that\n//calls out to Gomega\n//\n//Here's why: Ginkgo's `Fail` method records the failure and then panics to prevent\n//further assertions from running. This panic must be recovered. Ginkgo does this for you\n//if the panic originates in a Ginkgo node (an It, BeforeEach, etc...)\n//\n//Unfortunately, if a panic originates on a goroutine *launched* from one of these nodes there's no\n//way for Ginkgo to rescue the panic. To do this, you must remember to `defer GinkgoRecover()` at the top of such a goroutine.\nfunc GinkgoRecover() {\n\te := recover()\n\tif e != nil {\n\t\tglobal.Failer.Panic(codelocation.New(1), e)\n\t}\n}\n\n//Describe blocks allow you to organize your specs. A Describe block can contain any number of\n//BeforeEach, AfterEach, JustBeforeEach, It, and Measurement blocks.\n//\n//In addition you can nest Describe, Context and When blocks. Describe, Context and When blocks are functionally\n//equivalent. The difference is purely semantic -- you typically Describe the behavior of an object\n//or method and, within that Describe, outline a number of Contexts and Whens.\nfunc Describe(text string, body func()) bool {\n\tglobal.Suite.PushContainerNode(text, body, types.FlagTypeNone, codelocation.New(1))\n\treturn true\n}\n\n//You can focus the tests within a describe block using FDescribe\nfunc FDescribe(text string, body func()) bool {\n\tglobal.Suite.PushContainerNode(text, body, types.FlagTypeFocused, codelocation.New(1))\n\treturn true\n}\n\n//You can mark the tests within a describe block as pending using PDescribe\nfunc PDescribe(text string, body func()) bool {\n\tglobal.Suite.PushContainerNode(text, body, types.FlagTypePending, codelocation.New(1))\n\treturn true\n}\n\n//You can mark the tests within a describe block as pending using XDescribe\nfunc XDescribe(text string, body func()) bool {\n\tglobal.Suite.PushContainerNode(text, body, types.FlagTypePending, codelocation.New(1))\n\treturn true\n}\n\n//Context blocks allow you to organize your specs. A Context block can contain any number of\n//BeforeEach, AfterEach, JustBeforeEach, It, and Measurement blocks.\n//\n//In addition you can nest Describe, Context and When blocks. Describe, Context and When blocks are functionally\n//equivalent. The difference is purely semantic -- you typical Describe the behavior of an object\n//or method and, within that Describe, outline a number of Contexts and Whens.\nfunc Context(text string, body func()) bool {\n\tglobal.Suite.PushContainerNode(text, body, types.FlagTypeNone, codelocation.New(1))\n\treturn true\n}\n\n//You can focus the tests within a describe block using FContext\nfunc FContext(text string, body func()) bool {\n\tglobal.Suite.PushContainerNode(text, body, types.FlagTypeFocused, codelocation.New(1))\n\treturn true\n}\n\n//You can mark the tests within a describe block as pending using PContext\nfunc PContext(text string, body func()) bool {\n\tglobal.Suite.PushContainerNode(text, body, types.FlagTypePending, codelocation.New(1))\n\treturn true\n}\n\n//You can mark the tests within a describe block as pending using XContext\nfunc XContext(text string, body func()) bool {\n\tglobal.Suite.PushContainerNode(text, body, types.FlagTypePending, codelocation.New(1))\n\treturn true\n}\n\n//When blocks allow you to organize your specs. A When block can contain any number of\n//BeforeEach, AfterEach, JustBeforeEach, It, and Measurement blocks.\n//\n//In addition you can nest Describe, Context and When blocks. Describe, Context and When blocks are functionally\n//equivalent. The difference is purely semantic -- you typical Describe the behavior of an object\n//or method and, within that Describe, outline a number of Contexts and Whens.\nfunc When(text string, body func()) bool {\n\tglobal.Suite.PushContainerNode(\"when \"+text, body, types.FlagTypeNone, codelocation.New(1))\n\treturn true\n}\n\n//You can focus the tests within a describe block using FWhen\nfunc FWhen(text string, body func()) bool {\n\tglobal.Suite.PushContainerNode(\"when \"+text, body, types.FlagTypeFocused, codelocation.New(1))\n\treturn true\n}\n\n//You can mark the tests within a describe block as pending using PWhen\nfunc PWhen(text string, body func()) bool {\n\tglobal.Suite.PushContainerNode(\"when \"+text, body, types.FlagTypePending, codelocation.New(1))\n\treturn true\n}\n\n//You can mark the tests within a describe block as pending using XWhen\nfunc XWhen(text string, body func()) bool {\n\tglobal.Suite.PushContainerNode(\"when \"+text, body, types.FlagTypePending, codelocation.New(1))\n\treturn true\n}\n\n//It blocks contain your test code and assertions. You cannot nest any other Ginkgo blocks\n//within an It block.\n//\n//Ginkgo will normally run It blocks synchronously. To perform asynchronous tests, pass a\n//function that accepts a Done channel. When you do this, you can also provide an optional timeout.\nfunc It(text string, body interface{}, timeout ...float64) bool {\n\tvalidateBodyFunc(body, codelocation.New(1))\n\tglobal.Suite.PushItNode(text, body, types.FlagTypeNone, codelocation.New(1), parseTimeout(timeout...))\n\treturn true\n}\n\n//You can focus individual Its using FIt\nfunc FIt(text string, body interface{}, timeout ...float64) bool {\n\tvalidateBodyFunc(body, codelocation.New(1))\n\tglobal.Suite.PushItNode(text, body, types.FlagTypeFocused, codelocation.New(1), parseTimeout(timeout...))\n\treturn true\n}\n\n//You can mark Its as pending using PIt\nfunc PIt(text string, _ ...interface{}) bool {\n\tglobal.Suite.PushItNode(text, func() {}, types.FlagTypePending, codelocation.New(1), 0)\n\treturn true\n}\n\n//You can mark Its as pending using XIt\nfunc XIt(text string, _ ...interface{}) bool {\n\tglobal.Suite.PushItNode(text, func() {}, types.FlagTypePending, codelocation.New(1), 0)\n\treturn true\n}\n\n//Specify blocks are aliases for It blocks and allow for more natural wording in situations\n//which \"It\" does not fit into a natural sentence flow. All the same protocols apply for Specify blocks\n//which apply to It blocks.\nfunc Specify(text string, body interface{}, timeout ...float64) bool {\n\tvalidateBodyFunc(body, codelocation.New(1))\n\tglobal.Suite.PushItNode(text, body, types.FlagTypeNone, codelocation.New(1), parseTimeout(timeout...))\n\treturn true\n}\n\n//You can focus individual Specifys using FSpecify\nfunc FSpecify(text string, body interface{}, timeout ...float64) bool {\n\tvalidateBodyFunc(body, codelocation.New(1))\n\tglobal.Suite.PushItNode(text, body, types.FlagTypeFocused, codelocation.New(1), parseTimeout(timeout...))\n\treturn true\n}\n\n//You can mark Specifys as pending using PSpecify\nfunc PSpecify(text string, is ...interface{}) bool {\n\tglobal.Suite.PushItNode(text, func() {}, types.FlagTypePending, codelocation.New(1), 0)\n\treturn true\n}\n\n//You can mark Specifys as pending using XSpecify\nfunc XSpecify(text string, is ...interface{}) bool {\n\tglobal.Suite.PushItNode(text, func() {}, types.FlagTypePending, codelocation.New(1), 0)\n\treturn true\n}\n\n//By allows you to better document large Its.\n//\n//Generally you should try to keep your Its short and to the point. This is not always possible, however,\n//especially in the context of integration tests that capture a particular workflow.\n//\n//By allows you to document such flows. By must be called within a runnable node (It, BeforeEach, Measure, etc...)\n//By will simply log the passed in text to the GinkgoWriter. If By is handed a function it will immediately run the function.\nfunc By(text string, callbacks ...func()) {\n\tpreamble := \"\\x1b[1mSTEP\\x1b[0m\"\n\tif config.DefaultReporterConfig.NoColor {\n\t\tpreamble = \"STEP\"\n\t}\n\tfmt.Fprintln(GinkgoWriter, preamble+\": \"+text)\n\tif len(callbacks) == 1 {\n\t\tcallbacks[0]()\n\t}\n\tif len(callbacks) > 1 {\n\t\tpanic(\"just one callback per By, please\")\n\t}\n}\n\n//Measure blocks run the passed in body function repeatedly (determined by the samples argument)\n//and accumulate metrics provided to the Benchmarker by the body function.\n//\n//The body function must have the signature:\n//\tfunc(b Benchmarker)\nfunc Measure(text string, body interface{}, samples int) bool {\n\tdeprecationTracker.TrackDeprecation(types.Deprecations.Measure(), codelocation.New(1))\n\tglobal.Suite.PushMeasureNode(text, body, types.FlagTypeNone, codelocation.New(1), samples)\n\treturn true\n}\n\n//You can focus individual Measures using FMeasure\nfunc FMeasure(text string, body interface{}, samples int) bool {\n\tdeprecationTracker.TrackDeprecation(types.Deprecations.Measure(), codelocation.New(1))\n\tglobal.Suite.PushMeasureNode(text, body, types.FlagTypeFocused, codelocation.New(1), samples)\n\treturn true\n}\n\n//You can mark Measurements as pending using PMeasure\nfunc PMeasure(text string, _ ...interface{}) bool {\n\tdeprecationTracker.TrackDeprecation(types.Deprecations.Measure(), codelocation.New(1))\n\tglobal.Suite.PushMeasureNode(text, func(b Benchmarker) {}, types.FlagTypePending, codelocation.New(1), 0)\n\treturn true\n}\n\n//You can mark Measurements as pending using XMeasure\nfunc XMeasure(text string, _ ...interface{}) bool {\n\tdeprecationTracker.TrackDeprecation(types.Deprecations.Measure(), codelocation.New(1))\n\tglobal.Suite.PushMeasureNode(text, func(b Benchmarker) {}, types.FlagTypePending, codelocation.New(1), 0)\n\treturn true\n}\n\n//BeforeSuite blocks are run just once before any specs are run. When running in parallel, each\n//parallel node process will call BeforeSuite.\n//\n//BeforeSuite blocks can be made asynchronous by providing a body function that accepts a Done channel\n//\n//You may only register *one* BeforeSuite handler per test suite. You typically do so in your bootstrap file at the top level.\nfunc BeforeSuite(body interface{}, timeout ...float64) bool {\n\tvalidateBodyFunc(body, codelocation.New(1))\n\tglobal.Suite.SetBeforeSuiteNode(body, codelocation.New(1), parseTimeout(timeout...))\n\treturn true\n}\n\n//AfterSuite blocks are *always* run after all the specs regardless of whether specs have passed or failed.\n//Moreover, if Ginkgo receives an interrupt signal (^C) it will attempt to run the AfterSuite before exiting.\n//\n//When running in parallel, each parallel node process will call AfterSuite.\n//\n//AfterSuite blocks can be made asynchronous by providing a body function that accepts a Done channel\n//\n//You may only register *one* AfterSuite handler per test suite. You typically do so in your bootstrap file at the top level.\nfunc AfterSuite(body interface{}, timeout ...float64) bool {\n\tvalidateBodyFunc(body, codelocation.New(1))\n\tglobal.Suite.SetAfterSuiteNode(body, codelocation.New(1), parseTimeout(timeout...))\n\treturn true\n}\n\n//SynchronizedBeforeSuite blocks are primarily meant to solve the problem of setting up singleton external resources shared across\n//nodes when running tests in parallel. For example, say you have a shared database that you can only start one instance of that\n//must be used in your tests. When running in parallel, only one node should set up the database and all other nodes should wait\n//until that node is done before running.\n//\n//SynchronizedBeforeSuite accomplishes this by taking *two* function arguments. The first is only run on parallel node #1. The second is\n//run on all nodes, but *only* after the first function completes successfully. Ginkgo also makes it possible to send data from the first function (on Node 1)\n//to the second function (on all the other nodes).\n//\n//The functions have the following signatures. The first function (which only runs on node 1) has the signature:\n//\n//\tfunc() []byte\n//\n//or, to run asynchronously:\n//\n//\tfunc(done Done) []byte\n//\n//The byte array returned by the first function is then passed to the second function, which has the signature:\n//\n//\tfunc(data []byte)\n//\n//or, to run asynchronously:\n//\n//\tfunc(data []byte, done Done)\n//\n//Here's a simple pseudo-code example that starts a shared database on Node 1 and shares the database's address with the other nodes:\n//\n//\tvar dbClient db.Client\n//\tvar dbRunner db.Runner\n//\n//\tvar _ = SynchronizedBeforeSuite(func() []byte {\n//\t\tdbRunner = db.NewRunner()\n//\t\terr := dbRunner.Start()\n//\t\tΩ(err).ShouldNot(HaveOccurred())\n//\t\treturn []byte(dbRunner.URL)\n//\t}, func(data []byte) {\n//\t\tdbClient = db.NewClient()\n//\t\terr := dbClient.Connect(string(data))\n//\t\tΩ(err).ShouldNot(HaveOccurred())\n//\t})\nfunc SynchronizedBeforeSuite(node1Body interface{}, allNodesBody interface{}, timeout ...float64) bool {\n\tglobal.Suite.SetSynchronizedBeforeSuiteNode(\n\t\tnode1Body,\n\t\tallNodesBody,\n\t\tcodelocation.New(1),\n\t\tparseTimeout(timeout...),\n\t)\n\treturn true\n}\n\n//SynchronizedAfterSuite blocks complement the SynchronizedBeforeSuite blocks in solving the problem of setting up\n//external singleton resources shared across nodes when running tests in parallel.\n//\n//SynchronizedAfterSuite accomplishes this by taking *two* function arguments. The first runs on all nodes. The second runs only on parallel node #1\n//and *only* after all other nodes have finished and exited. This ensures that node 1, and any resources it is running, remain alive until\n//all other nodes are finished.\n//\n//Both functions have the same signature: either func() or func(done Done) to run asynchronously.\n//\n//Here's a pseudo-code example that complements that given in SynchronizedBeforeSuite. Here, SynchronizedAfterSuite is used to tear down the shared database\n//only after all nodes have finished:\n//\n//\tvar _ = SynchronizedAfterSuite(func() {\n//\t\tdbClient.Cleanup()\n//\t}, func() {\n//\t\tdbRunner.Stop()\n//\t})\nfunc SynchronizedAfterSuite(allNodesBody interface{}, node1Body interface{}, timeout ...float64) bool {\n\tglobal.Suite.SetSynchronizedAfterSuiteNode(\n\t\tallNodesBody,\n\t\tnode1Body,\n\t\tcodelocation.New(1),\n\t\tparseTimeout(timeout...),\n\t)\n\treturn true\n}\n\n//BeforeEach blocks are run before It blocks. When multiple BeforeEach blocks are defined in nested\n//Describe and Context blocks the outermost BeforeEach blocks are run first.\n//\n//Like It blocks, BeforeEach blocks can be made asynchronous by providing a body function that accepts\n//a Done channel\nfunc BeforeEach(body interface{}, timeout ...float64) bool {\n\tvalidateBodyFunc(body, codelocation.New(1))\n\tglobal.Suite.PushBeforeEachNode(body, codelocation.New(1), parseTimeout(timeout...))\n\treturn true\n}\n\n//JustBeforeEach blocks are run before It blocks but *after* all BeforeEach blocks. For more details,\n//read the [documentation](http://onsi.github.io/ginkgo/#separating_creation_and_configuration_)\n//\n//Like It blocks, BeforeEach blocks can be made asynchronous by providing a body function that accepts\n//a Done channel\nfunc JustBeforeEach(body interface{}, timeout ...float64) bool {\n\tvalidateBodyFunc(body, codelocation.New(1))\n\tglobal.Suite.PushJustBeforeEachNode(body, codelocation.New(1), parseTimeout(timeout...))\n\treturn true\n}\n\n//JustAfterEach blocks are run after It blocks but *before* all AfterEach blocks. For more details,\n//read the [documentation](http://onsi.github.io/ginkgo/#separating_creation_and_configuration_)\n//\n//Like It blocks, JustAfterEach blocks can be made asynchronous by providing a body function that accepts\n//a Done channel\nfunc JustAfterEach(body interface{}, timeout ...float64) bool {\n\tvalidateBodyFunc(body, codelocation.New(1))\n\tglobal.Suite.PushJustAfterEachNode(body, codelocation.New(1), parseTimeout(timeout...))\n\treturn true\n}\n\n//AfterEach blocks are run after It blocks. When multiple AfterEach blocks are defined in nested\n//Describe and Context blocks the innermost AfterEach blocks are run first.\n//\n//Like It blocks, AfterEach blocks can be made asynchronous by providing a body function that accepts\n//a Done channel\nfunc AfterEach(body interface{}, timeout ...float64) bool {\n\tvalidateBodyFunc(body, codelocation.New(1))\n\tglobal.Suite.PushAfterEachNode(body, codelocation.New(1), parseTimeout(timeout...))\n\treturn true\n}\n\nfunc validateBodyFunc(body interface{}, cl types.CodeLocation) {\n\tt := reflect.TypeOf(body)\n\tif t.Kind() != reflect.Func {\n\t\treturn\n\t}\n\n\tif t.NumOut() > 0 {\n\t\treturn\n\t}\n\n\tif t.NumIn() == 0 {\n\t\treturn\n\t}\n\n\tif t.In(0) == reflect.TypeOf(make(Done)) {\n\t\tdeprecationTracker.TrackDeprecation(types.Deprecations.Async(), cl)\n\t}\n}\n\nfunc parseTimeout(timeout ...float64) time.Duration {\n\tif len(timeout) == 0 {\n\t\treturn global.DefaultTimeout\n\t} else {\n\t\treturn time.Duration(timeout[0] * float64(time.Second))\n\t}\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/go.mod", "content": "module github.com/onsi/ginkgo\n\ngo 1.16\n\nrequire (\n\tgithub.com/go-task/slim-sprig v0.0.0-20210107165309-348f09dbbbc0\n\tgithub.com/nxadm/tail v1.4.8\n\tgithub.com/onsi/gomega v1.10.1\n\tgolang.org/x/sys v0.0.0-20210112080510-489259a85091\n\tgolang.org/x/tools v0.0.0-20201224043029-2b0845dc783e\n)\n\nretract v1.16.3 // git tag accidentally associated with incorrect git commit\n" }, { "path": "vendor/github.com/onsi/ginkgo/go.sum", "content": "github.com/davecgh/go-spew v1.1.0/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38=\ngithub.com/davecgh/go-spew v1.1.1 h1:vj9j/u1bqnvCEfJOwUhtlOARqs3+rkHYY13jYWTU97c=\ngithub.com/davecgh/go-spew v1.1.1/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38=\ngithub.com/fsnotify/fsnotify v1.4.7/go.mod h1:jwhsz4b93w/PPRr/qN1Yymfu8t87LnFCMoQvtojpjFo=\ngithub.com/fsnotify/fsnotify v1.4.9 h1:hsms1Qyu0jgnwNXIxa+/V/PDsU6CfLf6CNO8H7IWoS4=\ngithub.com/fsnotify/fsnotify v1.4.9/go.mod h1:znqG4EE+3YCdAaPaxE2ZRY/06pZUdp0tY4IgpuI1SZQ=\ngithub.com/go-task/slim-sprig v0.0.0-20210107165309-348f09dbbbc0 h1:p104kn46Q8WdvHunIJ9dAyjPVtrBPhSr3KT2yUst43I=\ngithub.com/go-task/slim-sprig v0.0.0-20210107165309-348f09dbbbc0/go.mod h1:fyg7847qk6SyHyPtNmDHnmrv/HOrqktSC+C9fM+CJOE=\ngithub.com/golang/protobuf v1.2.0/go.mod h1:6lQm79b+lXiMfvg/cZm0SGofjICqVBUtrP5yJMmIC1U=\ngithub.com/golang/protobuf v1.4.0-rc.1/go.mod h1:ceaxUfeHdC40wWswd/P6IGgMaK3YpKi5j83Wpe3EHw8=\ngithub.com/golang/protobuf v1.4.0-rc.1.0.20200221234624-67d41d38c208/go.mod h1:xKAWHe0F5eneWXFV3EuXVDTCmh+JuBKY0li0aMyXATA=\ngithub.com/golang/protobuf v1.4.0-rc.2/go.mod h1:LlEzMj4AhA7rCAGe4KMBDvJI+AwstrUpVNzEA03Pprs=\ngithub.com/golang/protobuf v1.4.0-rc.4.0.20200313231945-b860323f09d0/go.mod h1:WU3c8KckQ9AFe+yFwt9sWVRKCVIyN9cPHBJSNnbL67w=\ngithub.com/golang/protobuf v1.4.0/go.mod h1:jodUvKwWbYaEsadDk5Fwe5c77LiNKVO9IDvqG2KuDX0=\ngithub.com/golang/protobuf v1.4.2 h1:+Z5KGCizgyZCbGh1KZqA0fcLLkwbsjIzS4aV2v7wJX0=\ngithub.com/golang/protobuf v1.4.2/go.mod h1:oDoupMAO8OvCJWAcko0GGGIgR6R6ocIYbsSw735rRwI=\ngithub.com/google/go-cmp v0.3.0/go.mod h1:8QqcDgzrUqlUb/G2PQTWiueGozuR1884gddMywk6iLU=\ngithub.com/google/go-cmp v0.3.1/go.mod h1:8QqcDgzrUqlUb/G2PQTWiueGozuR1884gddMywk6iLU=\ngithub.com/google/go-cmp v0.4.0 h1:xsAVV57WRhGj6kEIi8ReJzQlHHqcBYCElAvkovg3B/4=\ngithub.com/google/go-cmp v0.4.0/go.mod h1:v8dTdLbMG2kIc/vJvl+f65V22dbkXbowE6jgT/gNBxE=\ngithub.com/hpcloud/tail v1.0.0/go.mod h1:ab1qPbhIpdTxEkNHXyeSf5vhxWSCs/tWer42PpOxQnU=\ngithub.com/nxadm/tail v1.4.4/go.mod h1:kenIhsEOeOJmVchQTgglprH7qJGnHDVpk1VPCcaMI8A=\ngithub.com/nxadm/tail v1.4.8 h1:nPr65rt6Y5JFSKQO7qToXr7pePgD6Gwiw05lkbyAQTE=\ngithub.com/nxadm/tail v1.4.8/go.mod h1:+ncqLTQzXmGhMZNUePPaPqPvBxHAIsmXswZKocGu+AU=\ngithub.com/onsi/ginkgo v1.6.0/go.mod h1:lLunBs/Ym6LB5Z9jYTR76FiuTmxDTDusOGeTQH+WWjE=\ngithub.com/onsi/ginkgo v1.12.1/go.mod h1:zj2OWP4+oCPe1qIXoGWkgMRwljMUYCdkwsT2108oapk=\ngithub.com/onsi/gomega v1.7.1/go.mod h1:XdKZgCCFLUoM/7CFJVPcG8C1xQ1AJ0vpAezJrB7JYyY=\ngithub.com/onsi/gomega v1.10.1 h1:o0+MgICZLuZ7xjH7Vx6zS/zcu93/BEp1VwkIW1mEXCE=\ngithub.com/onsi/gomega v1.10.1/go.mod h1:iN09h71vgCQne3DLsj+A5owkum+a2tYe+TOCB1ybHNo=\ngithub.com/pmezard/go-difflib v1.0.0 h1:4DBwDE0NGyQoBHbLQYPwSUPoCMWR5BEzIk/f1lZbAQM=\ngithub.com/pmezard/go-difflib v1.0.0/go.mod h1:iKH77koFhYxTK1pcRnkKkqfTogsbg7gZNVY4sRDYZ/4=\ngithub.com/stretchr/objx v0.1.0/go.mod h1:HFkY916IF+rwdDfMAkV7OtwuqBVzrE8GR6GFx+wExME=\ngithub.com/stretchr/testify v1.5.1 h1:nOGnQDM7FYENwehXlg/kFVnos3rEvtKTjRvOWSzb6H4=\ngithub.com/stretchr/testify v1.5.1/go.mod h1:5W2xD1RspED5o8YsWQXVCued0rvSQ+mT+I5cxcmMvtA=\ngithub.com/yuin/goldmark v1.2.1/go.mod h1:3hX8gzYuyVAZsxl0MRgGTJEmQBFcNTphYh9decYSb74=\ngolang.org/x/crypto v0.0.0-20190308221718-c2843e01d9a2/go.mod h1:djNgcEr1/C05ACkg1iLfiJU5Ep61QUkGW8qpdssI0+w=\ngolang.org/x/crypto v0.0.0-20191011191535-87dc89f01550/go.mod h1:yigFU9vqHzYiE8UmvKecakEJjdnWj3jj499lnFckfCI=\ngolang.org/x/crypto v0.0.0-20200622213623-75b288015ac9/go.mod h1:LzIPMQfyMNhhGPhUkYOs5KpL4U8rLKemX1yGLhDgUto=\ngolang.org/x/mod v0.3.0/go.mod h1:s0Qsj1ACt9ePp/hMypM3fl4fZqREWJwdYDEqhRiZZUA=\ngolang.org/x/net v0.0.0-20180906233101-161cd47e91fd/go.mod h1:mL1N/T3taQHkDXs73rZJwtUhF3w3ftmwwsq0BUmARs4=\ngolang.org/x/net v0.0.0-20190404232315-eb5bcb51f2a3/go.mod h1:t9HGtf8HONx5eT2rtn7q6eTqICYqUVnKs3thJo3Qplg=\ngolang.org/x/net v0.0.0-20190620200207-3b0461eec859/go.mod h1:z5CRVTTTmAJ677TzLLGU+0bjPO0LkuOLi4/5GtJWs/s=\ngolang.org/x/net v0.0.0-20200520004742-59133d7f0dd7/go.mod h1:qpuaurCH72eLCgpAm/N6yyVIVM9cpaDIP3A8BGJEC5A=\ngolang.org/x/net v0.0.0-20201021035429-f5854403a974 h1:IX6qOQeG5uLjB/hjjwjedwfjND0hgjPMMyO1RoIXQNI=\ngolang.org/x/net v0.0.0-20201021035429-f5854403a974/go.mod h1:sp8m0HH+o8qH0wwXwYZr8TS3Oi6o0r6Gce1SSxlDquU=\ngolang.org/x/sync v0.0.0-20180314180146-1d60e4601c6f/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM=\ngolang.org/x/sync v0.0.0-20190423024810-112230192c58/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM=\ngolang.org/x/sync v0.0.0-20201020160332-67f06af15bc9/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM=\ngolang.org/x/sys v0.0.0-20180909124046-d0be0721c37e/go.mod h1:STP8DvDyc/dI5b8T5hshtkjS+E42TnysNCUPdjciGhY=\ngolang.org/x/sys v0.0.0-20190215142949-d0b11bdaac8a/go.mod h1:STP8DvDyc/dI5b8T5hshtkjS+E42TnysNCUPdjciGhY=\ngolang.org/x/sys v0.0.0-20190412213103-97732733099d/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20190904154756-749cb33beabd/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20191005200804-aed5e4c7ecf9/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20191120155948-bd437916bb0e/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20200323222414-85ca7c5b95cd/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20200930185726-fdedc70b468f/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20210112080510-489259a85091 h1:DMyOG0U+gKfu8JZzg2UQe9MeaC1X+xQWlAKcRnjxjCw=\ngolang.org/x/sys v0.0.0-20210112080510-489259a85091/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/text v0.3.0/go.mod h1:NqM8EUOU14njkJ3fqMW+pc6Ldnwhi/IjpwHt7yyuwOQ=\ngolang.org/x/text v0.3.3 h1:cokOdA+Jmi5PJGXLlLllQSgYigAEfHXJAERHVMaCc2k=\ngolang.org/x/text v0.3.3/go.mod h1:5Zoc/QRtKVWzQhOtBMvqHzDpF6irO9z98xDceosuGiQ=\ngolang.org/x/tools v0.0.0-20180917221912-90fa682c2a6e/go.mod h1:n7NCudcB/nEzxVGmLbDWY5pfWTLqBcC2KZ6jyYvM4mQ=\ngolang.org/x/tools v0.0.0-20191119224855-298f0cb1881e/go.mod h1:b+2E5dAYhXwXZwtnZ6UAqBI28+e2cm9otk0dWdXHAEo=\ngolang.org/x/tools v0.0.0-20201224043029-2b0845dc783e h1:4nW4NLDYnU28ojHaHO8OVxFHk/aQ33U01a9cjED+pzE=\ngolang.org/x/tools v0.0.0-20201224043029-2b0845dc783e/go.mod h1:emZCQorbCU4vsT4fOWvOPXz4eW1wZW4PmDk9uLelYpA=\ngolang.org/x/xerrors v0.0.0-20190717185122-a985d3407aa7/go.mod h1:I/5z698sn9Ka8TeJc9MKroUUfqBBauWjQqLJ2OPfmY0=\ngolang.org/x/xerrors v0.0.0-20191011141410-1b5146add898/go.mod h1:I/5z698sn9Ka8TeJc9MKroUUfqBBauWjQqLJ2OPfmY0=\ngolang.org/x/xerrors v0.0.0-20191204190536-9bdfabe68543/go.mod h1:I/5z698sn9Ka8TeJc9MKroUUfqBBauWjQqLJ2OPfmY0=\ngolang.org/x/xerrors v0.0.0-20200804184101-5ec99f83aff1 h1:go1bK/D/BFZV2I8cIQd1NKEZ+0owSTG1fDTci4IqFcE=\ngolang.org/x/xerrors v0.0.0-20200804184101-5ec99f83aff1/go.mod h1:I/5z698sn9Ka8TeJc9MKroUUfqBBauWjQqLJ2OPfmY0=\ngoogle.golang.org/protobuf v0.0.0-20200109180630-ec00e32a8dfd/go.mod h1:DFci5gLYBciE7Vtevhsrf46CRTquxDuWsQurQQe4oz8=\ngoogle.golang.org/protobuf v0.0.0-20200221191635-4d8936d0db64/go.mod h1:kwYJMbMJ01Woi6D6+Kah6886xMZcty6N08ah7+eCXa0=\ngoogle.golang.org/protobuf v0.0.0-20200228230310-ab0ca4ff8a60/go.mod h1:cfTl7dwQJ+fmap5saPgwCLgHXTUD7jkjRqWcaiX5VyM=\ngoogle.golang.org/protobuf v1.20.1-0.20200309200217-e05f789c0967/go.mod h1:A+miEFZTKqfCUM6K7xSMQL9OKL/b6hQv+e19PK+JZNE=\ngoogle.golang.org/protobuf v1.21.0/go.mod h1:47Nbq4nVaFHyn7ilMalzfO3qCViNmqZ2kzikPIcrTAo=\ngoogle.golang.org/protobuf v1.23.0 h1:4MY060fB1DLGMB/7MBTLnwQUY6+F09GEiz6SsrNqyzM=\ngoogle.golang.org/protobuf v1.23.0/go.mod h1:EGpADcykh3NcUnDUJcl1+ZksZNG86OlYog2l/sGQquU=\ngopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405 h1:yhCVgyC4o1eVCa2tZl7eS0r+SDo693bJlVdllGtEeKM=\ngopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=\ngopkg.in/fsnotify.v1 v1.4.7/go.mod h1:Tz8NjZHkW78fSQdbUxIjBTcgA1z1m8ZHf0WmKUhAMys=\ngopkg.in/tomb.v1 v1.0.0-20141024135613-dd632973f1e7 h1:uRGJdciOHaEIrze2W8Q3AKkepLTh2hOroT7a+7czfdQ=\ngopkg.in/tomb.v1 v1.0.0-20141024135613-dd632973f1e7/go.mod h1:dt/ZhP58zS4L8KSrWDmTeBkI65Dw0HsyUHuEVlX15mw=\ngopkg.in/yaml.v2 v2.2.2/go.mod h1:hI93XBmqTisBFMUTm0b8Fm+jr3Dg1NNxqwp+5A1VGuI=\ngopkg.in/yaml.v2 v2.2.4/go.mod h1:hI93XBmqTisBFMUTm0b8Fm+jr3Dg1NNxqwp+5A1VGuI=\ngopkg.in/yaml.v2 v2.3.0 h1:clyUAQHOM3G0M3f5vQj7LuJrETvjVot3Z5el9nffUtU=\ngopkg.in/yaml.v2 v2.3.0/go.mod h1:hI93XBmqTisBFMUTm0b8Fm+jr3Dg1NNxqwp+5A1VGuI=\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/codelocation/code_location.go", "content": "package codelocation\n\nimport (\n\t\"regexp\"\n\t\"runtime\"\n\t\"runtime/debug\"\n\t\"strings\"\n\n\t\"github.com/onsi/ginkgo/types\"\n)\n\nfunc New(skip int) types.CodeLocation {\n\t_, file, line, _ := runtime.Caller(skip + 1)\n\tstackTrace := PruneStack(string(debug.Stack()), skip+1)\n\treturn types.CodeLocation{FileName: file, LineNumber: line, FullStackTrace: stackTrace}\n}\n\n// PruneStack removes references to functions that are internal to Ginkgo\n// and the Go runtime from a stack string and a certain number of stack entries\n// at the beginning of the stack. The stack string has the format\n// as returned by runtime/debug.Stack. The leading goroutine information is\n// optional and always removed if present. Beware that runtime/debug.Stack\n// adds itself as first entry, so typically skip must be >= 1 to remove that\n// entry.\nfunc PruneStack(fullStackTrace string, skip int) string {\n\tstack := strings.Split(fullStackTrace, \"\\n\")\n\t// Ensure that the even entries are the method names and the\n\t// the odd entries the source code information.\n\tif len(stack) > 0 && strings.HasPrefix(stack[0], \"goroutine \") {\n\t\t// Ignore \"goroutine 29 [running]:\" line.\n\t\tstack = stack[1:]\n\t}\n\t// The \"+1\" is for skipping over the initial entry, which is\n\t// runtime/debug.Stack() itself.\n\tif len(stack) > 2*(skip+1) {\n\t\tstack = stack[2*(skip+1):]\n\t}\n\tprunedStack := []string{}\n\tre := regexp.MustCompile(`\\/ginkgo\\/|\\/pkg\\/testing\\/|\\/pkg\\/runtime\\/`)\n\tfor i := 0; i < len(stack)/2; i++ {\n\t\t// We filter out based on the source code file name.\n\t\tif !re.Match([]byte(stack[i*2+1])) {\n\t\t\tprunedStack = append(prunedStack, stack[i*2])\n\t\t\tprunedStack = append(prunedStack, stack[i*2+1])\n\t\t}\n\t}\n\treturn strings.Join(prunedStack, \"\\n\")\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/containernode/container_node.go", "content": "package containernode\n\nimport (\n\t\"math/rand\"\n\t\"sort\"\n\n\t\"github.com/onsi/ginkgo/internal/leafnodes\"\n\t\"github.com/onsi/ginkgo/types\"\n)\n\ntype subjectOrContainerNode struct {\n\tcontainerNode *ContainerNode\n\tsubjectNode leafnodes.SubjectNode\n}\n\nfunc (n subjectOrContainerNode) text() string {\n\tif n.containerNode != nil {\n\t\treturn n.containerNode.Text()\n\t} else {\n\t\treturn n.subjectNode.Text()\n\t}\n}\n\ntype CollatedNodes struct {\n\tContainers []*ContainerNode\n\tSubject leafnodes.SubjectNode\n}\n\ntype ContainerNode struct {\n\ttext string\n\tflag types.FlagType\n\tcodeLocation types.CodeLocation\n\n\tsetupNodes []leafnodes.BasicNode\n\tsubjectAndContainerNodes []subjectOrContainerNode\n}\n\nfunc New(text string, flag types.FlagType, codeLocation types.CodeLocation) *ContainerNode {\n\treturn &ContainerNode{\n\t\ttext: text,\n\t\tflag: flag,\n\t\tcodeLocation: codeLocation,\n\t}\n}\n\nfunc (container *ContainerNode) Shuffle(r *rand.Rand) {\n\tsort.Sort(container)\n\tpermutation := r.Perm(len(container.subjectAndContainerNodes))\n\tshuffledNodes := make([]subjectOrContainerNode, len(container.subjectAndContainerNodes))\n\tfor i, j := range permutation {\n\t\tshuffledNodes[i] = container.subjectAndContainerNodes[j]\n\t}\n\tcontainer.subjectAndContainerNodes = shuffledNodes\n}\n\nfunc (node *ContainerNode) BackPropagateProgrammaticFocus() bool {\n\tif node.flag == types.FlagTypePending {\n\t\treturn false\n\t}\n\n\tshouldUnfocus := false\n\tfor _, subjectOrContainerNode := range node.subjectAndContainerNodes {\n\t\tif subjectOrContainerNode.containerNode != nil {\n\t\t\tshouldUnfocus = subjectOrContainerNode.containerNode.BackPropagateProgrammaticFocus() || shouldUnfocus\n\t\t} else {\n\t\t\tshouldUnfocus = (subjectOrContainerNode.subjectNode.Flag() == types.FlagTypeFocused) || shouldUnfocus\n\t\t}\n\t}\n\n\tif shouldUnfocus {\n\t\tif node.flag == types.FlagTypeFocused {\n\t\t\tnode.flag = types.FlagTypeNone\n\t\t}\n\t\treturn true\n\t}\n\n\treturn node.flag == types.FlagTypeFocused\n}\n\nfunc (node *ContainerNode) Collate() []CollatedNodes {\n\treturn node.collate([]*ContainerNode{})\n}\n\nfunc (node *ContainerNode) collate(enclosingContainers []*ContainerNode) []CollatedNodes {\n\tcollated := make([]CollatedNodes, 0)\n\n\tcontainers := make([]*ContainerNode, len(enclosingContainers))\n\tcopy(containers, enclosingContainers)\n\tcontainers = append(containers, node)\n\n\tfor _, subjectOrContainer := range node.subjectAndContainerNodes {\n\t\tif subjectOrContainer.containerNode != nil {\n\t\t\tcollated = append(collated, subjectOrContainer.containerNode.collate(containers)...)\n\t\t} else {\n\t\t\tcollated = append(collated, CollatedNodes{\n\t\t\t\tContainers: containers,\n\t\t\t\tSubject: subjectOrContainer.subjectNode,\n\t\t\t})\n\t\t}\n\t}\n\n\treturn collated\n}\n\nfunc (node *ContainerNode) PushContainerNode(container *ContainerNode) {\n\tnode.subjectAndContainerNodes = append(node.subjectAndContainerNodes, subjectOrContainerNode{containerNode: container})\n}\n\nfunc (node *ContainerNode) PushSubjectNode(subject leafnodes.SubjectNode) {\n\tnode.subjectAndContainerNodes = append(node.subjectAndContainerNodes, subjectOrContainerNode{subjectNode: subject})\n}\n\nfunc (node *ContainerNode) PushSetupNode(setupNode leafnodes.BasicNode) {\n\tnode.setupNodes = append(node.setupNodes, setupNode)\n}\n\nfunc (node *ContainerNode) SetupNodesOfType(nodeType types.SpecComponentType) []leafnodes.BasicNode {\n\tnodes := []leafnodes.BasicNode{}\n\tfor _, setupNode := range node.setupNodes {\n\t\tif setupNode.Type() == nodeType {\n\t\t\tnodes = append(nodes, setupNode)\n\t\t}\n\t}\n\treturn nodes\n}\n\nfunc (node *ContainerNode) Text() string {\n\treturn node.text\n}\n\nfunc (node *ContainerNode) CodeLocation() types.CodeLocation {\n\treturn node.codeLocation\n}\n\nfunc (node *ContainerNode) Flag() types.FlagType {\n\treturn node.flag\n}\n\n//sort.Interface\n\nfunc (node *ContainerNode) Len() int {\n\treturn len(node.subjectAndContainerNodes)\n}\n\nfunc (node *ContainerNode) Less(i, j int) bool {\n\treturn node.subjectAndContainerNodes[i].text() < node.subjectAndContainerNodes[j].text()\n}\n\nfunc (node *ContainerNode) Swap(i, j int) {\n\tnode.subjectAndContainerNodes[i], node.subjectAndContainerNodes[j] = node.subjectAndContainerNodes[j], node.subjectAndContainerNodes[i]\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/failer/failer.go", "content": "package failer\n\nimport (\n\t\"fmt\"\n\t\"sync\"\n\n\t\"github.com/onsi/ginkgo/types\"\n)\n\ntype Failer struct {\n\tlock *sync.Mutex\n\tfailure types.SpecFailure\n\tstate types.SpecState\n}\n\nfunc New() *Failer {\n\treturn &Failer{\n\t\tlock: &sync.Mutex{},\n\t\tstate: types.SpecStatePassed,\n\t}\n}\n\nfunc (f *Failer) Panic(location types.CodeLocation, forwardedPanic interface{}) {\n\tf.lock.Lock()\n\tdefer f.lock.Unlock()\n\n\tif f.state == types.SpecStatePassed {\n\t\tf.state = types.SpecStatePanicked\n\t\tf.failure = types.SpecFailure{\n\t\t\tMessage: \"Test Panicked\",\n\t\t\tLocation: location,\n\t\t\tForwardedPanic: fmt.Sprintf(\"%v\", forwardedPanic),\n\t\t}\n\t}\n}\n\nfunc (f *Failer) Timeout(location types.CodeLocation) {\n\tf.lock.Lock()\n\tdefer f.lock.Unlock()\n\n\tif f.state == types.SpecStatePassed {\n\t\tf.state = types.SpecStateTimedOut\n\t\tf.failure = types.SpecFailure{\n\t\t\tMessage: \"Timed out\",\n\t\t\tLocation: location,\n\t\t}\n\t}\n}\n\nfunc (f *Failer) Fail(message string, location types.CodeLocation) {\n\tf.lock.Lock()\n\tdefer f.lock.Unlock()\n\n\tif f.state == types.SpecStatePassed {\n\t\tf.state = types.SpecStateFailed\n\t\tf.failure = types.SpecFailure{\n\t\t\tMessage: message,\n\t\t\tLocation: location,\n\t\t}\n\t}\n}\n\nfunc (f *Failer) Drain(componentType types.SpecComponentType, componentIndex int, componentCodeLocation types.CodeLocation) (types.SpecFailure, types.SpecState) {\n\tf.lock.Lock()\n\tdefer f.lock.Unlock()\n\n\tfailure := f.failure\n\toutcome := f.state\n\tif outcome != types.SpecStatePassed {\n\t\tfailure.ComponentType = componentType\n\t\tfailure.ComponentIndex = componentIndex\n\t\tfailure.ComponentCodeLocation = componentCodeLocation\n\t}\n\n\tf.state = types.SpecStatePassed\n\tf.failure = types.SpecFailure{}\n\n\treturn failure, outcome\n}\n\nfunc (f *Failer) Skip(message string, location types.CodeLocation) {\n\tf.lock.Lock()\n\tdefer f.lock.Unlock()\n\n\tif f.state == types.SpecStatePassed {\n\t\tf.state = types.SpecStateSkipped\n\t\tf.failure = types.SpecFailure{\n\t\t\tMessage: message,\n\t\t\tLocation: location,\n\t\t}\n\t}\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/global/init.go", "content": "package global\n\nimport (\n\t\"time\"\n\n\t\"github.com/onsi/ginkgo/internal/failer\"\n\t\"github.com/onsi/ginkgo/internal/suite\"\n)\n\nconst DefaultTimeout = time.Duration(1 * time.Second)\n\nvar Suite *suite.Suite\nvar Failer *failer.Failer\n\nfunc init() {\n\tInitializeGlobals()\n}\n\nfunc InitializeGlobals() {\n\tFailer = failer.New()\n\tSuite = suite.New(Failer)\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/leafnodes/benchmarker.go", "content": "package leafnodes\n\nimport (\n\t\"math\"\n\t\"time\"\n\n\t\"sync\"\n\n\t\"github.com/onsi/ginkgo/types\"\n)\n\ntype benchmarker struct {\n\tmu sync.Mutex\n\tmeasurements map[string]*types.SpecMeasurement\n\torderCounter int\n}\n\nfunc newBenchmarker() *benchmarker {\n\treturn &benchmarker{\n\t\tmeasurements: make(map[string]*types.SpecMeasurement),\n\t}\n}\n\nfunc (b *benchmarker) Time(name string, body func(), info ...interface{}) (elapsedTime time.Duration) {\n\tt := time.Now()\n\tbody()\n\telapsedTime = time.Since(t)\n\n\tb.mu.Lock()\n\tdefer b.mu.Unlock()\n\tmeasurement := b.getMeasurement(name, \"Fastest Time\", \"Slowest Time\", \"Average Time\", \"s\", 3, info...)\n\tmeasurement.Results = append(measurement.Results, elapsedTime.Seconds())\n\n\treturn\n}\n\nfunc (b *benchmarker) RecordValue(name string, value float64, info ...interface{}) {\n\tb.mu.Lock()\n\tmeasurement := b.getMeasurement(name, \"Smallest\", \" Largest\", \" Average\", \"\", 3, info...)\n\tdefer b.mu.Unlock()\n\tmeasurement.Results = append(measurement.Results, value)\n}\n\nfunc (b *benchmarker) RecordValueWithPrecision(name string, value float64, units string, precision int, info ...interface{}) {\n\tb.mu.Lock()\n\tmeasurement := b.getMeasurement(name, \"Smallest\", \" Largest\", \" Average\", units, precision, info...)\n\tdefer b.mu.Unlock()\n\tmeasurement.Results = append(measurement.Results, value)\n}\n\nfunc (b *benchmarker) getMeasurement(name string, smallestLabel string, largestLabel string, averageLabel string, units string, precision int, info ...interface{}) *types.SpecMeasurement {\n\tmeasurement, ok := b.measurements[name]\n\tif !ok {\n\t\tvar computedInfo interface{}\n\t\tcomputedInfo = nil\n\t\tif len(info) > 0 {\n\t\t\tcomputedInfo = info[0]\n\t\t}\n\t\tmeasurement = &types.SpecMeasurement{\n\t\t\tName: name,\n\t\t\tInfo: computedInfo,\n\t\t\tOrder: b.orderCounter,\n\t\t\tSmallestLabel: smallestLabel,\n\t\t\tLargestLabel: largestLabel,\n\t\t\tAverageLabel: averageLabel,\n\t\t\tUnits: units,\n\t\t\tPrecision: precision,\n\t\t\tResults: make([]float64, 0),\n\t\t}\n\t\tb.measurements[name] = measurement\n\t\tb.orderCounter++\n\t}\n\n\treturn measurement\n}\n\nfunc (b *benchmarker) measurementsReport() map[string]*types.SpecMeasurement {\n\tb.mu.Lock()\n\tdefer b.mu.Unlock()\n\tfor _, measurement := range b.measurements {\n\t\tmeasurement.Smallest = math.MaxFloat64\n\t\tmeasurement.Largest = -math.MaxFloat64\n\t\tsum := float64(0)\n\t\tsumOfSquares := float64(0)\n\n\t\tfor _, result := range measurement.Results {\n\t\t\tif result > measurement.Largest {\n\t\t\t\tmeasurement.Largest = result\n\t\t\t}\n\t\t\tif result < measurement.Smallest {\n\t\t\t\tmeasurement.Smallest = result\n\t\t\t}\n\t\t\tsum += result\n\t\t\tsumOfSquares += result * result\n\t\t}\n\n\t\tn := float64(len(measurement.Results))\n\t\tmeasurement.Average = sum / n\n\t\tmeasurement.StdDeviation = math.Sqrt(sumOfSquares/n - (sum/n)*(sum/n))\n\t}\n\n\treturn b.measurements\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/leafnodes/interfaces.go", "content": "package leafnodes\n\nimport (\n\t\"github.com/onsi/ginkgo/types\"\n)\n\ntype BasicNode interface {\n\tType() types.SpecComponentType\n\tRun() (types.SpecState, types.SpecFailure)\n\tCodeLocation() types.CodeLocation\n}\n\ntype SubjectNode interface {\n\tBasicNode\n\n\tText() string\n\tFlag() types.FlagType\n\tSamples() int\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/leafnodes/it_node.go", "content": "package leafnodes\n\nimport (\n\t\"time\"\n\n\t\"github.com/onsi/ginkgo/internal/failer\"\n\t\"github.com/onsi/ginkgo/types\"\n)\n\ntype ItNode struct {\n\trunner *runner\n\n\tflag types.FlagType\n\ttext string\n}\n\nfunc NewItNode(text string, body interface{}, flag types.FlagType, codeLocation types.CodeLocation, timeout time.Duration, failer *failer.Failer, componentIndex int) *ItNode {\n\treturn &ItNode{\n\t\trunner: newRunner(body, codeLocation, timeout, failer, types.SpecComponentTypeIt, componentIndex),\n\t\tflag: flag,\n\t\ttext: text,\n\t}\n}\n\nfunc (node *ItNode) Run() (outcome types.SpecState, failure types.SpecFailure) {\n\treturn node.runner.run()\n}\n\nfunc (node *ItNode) Type() types.SpecComponentType {\n\treturn types.SpecComponentTypeIt\n}\n\nfunc (node *ItNode) Text() string {\n\treturn node.text\n}\n\nfunc (node *ItNode) Flag() types.FlagType {\n\treturn node.flag\n}\n\nfunc (node *ItNode) CodeLocation() types.CodeLocation {\n\treturn node.runner.codeLocation\n}\n\nfunc (node *ItNode) Samples() int {\n\treturn 1\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/leafnodes/measure_node.go", "content": "package leafnodes\n\nimport (\n\t\"reflect\"\n\n\t\"github.com/onsi/ginkgo/internal/failer\"\n\t\"github.com/onsi/ginkgo/types\"\n)\n\ntype MeasureNode struct {\n\trunner *runner\n\n\ttext string\n\tflag types.FlagType\n\tsamples int\n\tbenchmarker *benchmarker\n}\n\nfunc NewMeasureNode(text string, body interface{}, flag types.FlagType, codeLocation types.CodeLocation, samples int, failer *failer.Failer, componentIndex int) *MeasureNode {\n\tbenchmarker := newBenchmarker()\n\n\twrappedBody := func() {\n\t\treflect.ValueOf(body).Call([]reflect.Value{reflect.ValueOf(benchmarker)})\n\t}\n\n\treturn &MeasureNode{\n\t\trunner: newRunner(wrappedBody, codeLocation, 0, failer, types.SpecComponentTypeMeasure, componentIndex),\n\n\t\ttext: text,\n\t\tflag: flag,\n\t\tsamples: samples,\n\t\tbenchmarker: benchmarker,\n\t}\n}\n\nfunc (node *MeasureNode) Run() (outcome types.SpecState, failure types.SpecFailure) {\n\treturn node.runner.run()\n}\n\nfunc (node *MeasureNode) MeasurementsReport() map[string]*types.SpecMeasurement {\n\treturn node.benchmarker.measurementsReport()\n}\n\nfunc (node *MeasureNode) Type() types.SpecComponentType {\n\treturn types.SpecComponentTypeMeasure\n}\n\nfunc (node *MeasureNode) Text() string {\n\treturn node.text\n}\n\nfunc (node *MeasureNode) Flag() types.FlagType {\n\treturn node.flag\n}\n\nfunc (node *MeasureNode) CodeLocation() types.CodeLocation {\n\treturn node.runner.codeLocation\n}\n\nfunc (node *MeasureNode) Samples() int {\n\treturn node.samples\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/leafnodes/runner.go", "content": "package leafnodes\n\nimport (\n\t\"fmt\"\n\t\"reflect\"\n\t\"time\"\n\n\t\"github.com/onsi/ginkgo/internal/codelocation\"\n\t\"github.com/onsi/ginkgo/internal/failer\"\n\t\"github.com/onsi/ginkgo/types\"\n)\n\ntype runner struct {\n\tisAsync bool\n\tasyncFunc func(chan<- interface{})\n\tsyncFunc func()\n\tcodeLocation types.CodeLocation\n\ttimeoutThreshold time.Duration\n\tnodeType types.SpecComponentType\n\tcomponentIndex int\n\tfailer *failer.Failer\n}\n\nfunc newRunner(body interface{}, codeLocation types.CodeLocation, timeout time.Duration, failer *failer.Failer, nodeType types.SpecComponentType, componentIndex int) *runner {\n\tbodyType := reflect.TypeOf(body)\n\tif bodyType.Kind() != reflect.Func {\n\t\tpanic(fmt.Sprintf(\"Expected a function but got something else at %v\", codeLocation))\n\t}\n\n\trunner := &runner{\n\t\tcodeLocation: codeLocation,\n\t\ttimeoutThreshold: timeout,\n\t\tfailer: failer,\n\t\tnodeType: nodeType,\n\t\tcomponentIndex: componentIndex,\n\t}\n\n\tswitch bodyType.NumIn() {\n\tcase 0:\n\t\trunner.syncFunc = body.(func())\n\t\treturn runner\n\tcase 1:\n\t\tif !(bodyType.In(0).Kind() == reflect.Chan && bodyType.In(0).Elem().Kind() == reflect.Interface) {\n\t\t\tpanic(fmt.Sprintf(\"Must pass a Done channel to function at %v\", codeLocation))\n\t\t}\n\n\t\twrappedBody := func(done chan<- interface{}) {\n\t\t\tbodyValue := reflect.ValueOf(body)\n\t\t\tbodyValue.Call([]reflect.Value{reflect.ValueOf(done)})\n\t\t}\n\n\t\trunner.isAsync = true\n\t\trunner.asyncFunc = wrappedBody\n\t\treturn runner\n\t}\n\n\tpanic(fmt.Sprintf(\"Too many arguments to function at %v\", codeLocation))\n}\n\nfunc (r *runner) run() (outcome types.SpecState, failure types.SpecFailure) {\n\tif r.isAsync {\n\t\treturn r.runAsync()\n\t} else {\n\t\treturn r.runSync()\n\t}\n}\n\nfunc (r *runner) runAsync() (outcome types.SpecState, failure types.SpecFailure) {\n\tdone := make(chan interface{}, 1)\n\n\tgo func() {\n\t\tfinished := false\n\n\t\tdefer func() {\n\t\t\tif e := recover(); e != nil || !finished {\n\t\t\t\tr.failer.Panic(codelocation.New(2), e)\n\t\t\t\tselect {\n\t\t\t\tcase <-done:\n\t\t\t\t\tbreak\n\t\t\t\tdefault:\n\t\t\t\t\tclose(done)\n\t\t\t\t}\n\t\t\t}\n\t\t}()\n\n\t\tr.asyncFunc(done)\n\t\tfinished = true\n\t}()\n\n\t// If this goroutine gets no CPU time before the select block,\n\t// the <-done case may complete even if the test took longer than the timeoutThreshold.\n\t// This can cause flaky behaviour, but we haven't seen it in the wild.\n\tselect {\n\tcase <-done:\n\tcase <-time.After(r.timeoutThreshold):\n\t\tr.failer.Timeout(r.codeLocation)\n\t}\n\n\tfailure, outcome = r.failer.Drain(r.nodeType, r.componentIndex, r.codeLocation)\n\treturn\n}\nfunc (r *runner) runSync() (outcome types.SpecState, failure types.SpecFailure) {\n\tfinished := false\n\n\tdefer func() {\n\t\tif e := recover(); e != nil || !finished {\n\t\t\tr.failer.Panic(codelocation.New(2), e)\n\t\t}\n\n\t\tfailure, outcome = r.failer.Drain(r.nodeType, r.componentIndex, r.codeLocation)\n\t}()\n\n\tr.syncFunc()\n\tfinished = true\n\n\treturn\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/leafnodes/setup_nodes.go", "content": "package leafnodes\n\nimport (\n\t\"time\"\n\n\t\"github.com/onsi/ginkgo/internal/failer\"\n\t\"github.com/onsi/ginkgo/types\"\n)\n\ntype SetupNode struct {\n\trunner *runner\n}\n\nfunc (node *SetupNode) Run() (outcome types.SpecState, failure types.SpecFailure) {\n\treturn node.runner.run()\n}\n\nfunc (node *SetupNode) Type() types.SpecComponentType {\n\treturn node.runner.nodeType\n}\n\nfunc (node *SetupNode) CodeLocation() types.CodeLocation {\n\treturn node.runner.codeLocation\n}\n\nfunc NewBeforeEachNode(body interface{}, codeLocation types.CodeLocation, timeout time.Duration, failer *failer.Failer, componentIndex int) *SetupNode {\n\treturn &SetupNode{\n\t\trunner: newRunner(body, codeLocation, timeout, failer, types.SpecComponentTypeBeforeEach, componentIndex),\n\t}\n}\n\nfunc NewAfterEachNode(body interface{}, codeLocation types.CodeLocation, timeout time.Duration, failer *failer.Failer, componentIndex int) *SetupNode {\n\treturn &SetupNode{\n\t\trunner: newRunner(body, codeLocation, timeout, failer, types.SpecComponentTypeAfterEach, componentIndex),\n\t}\n}\n\nfunc NewJustBeforeEachNode(body interface{}, codeLocation types.CodeLocation, timeout time.Duration, failer *failer.Failer, componentIndex int) *SetupNode {\n\treturn &SetupNode{\n\t\trunner: newRunner(body, codeLocation, timeout, failer, types.SpecComponentTypeJustBeforeEach, componentIndex),\n\t}\n}\n\nfunc NewJustAfterEachNode(body interface{}, codeLocation types.CodeLocation, timeout time.Duration, failer *failer.Failer, componentIndex int) *SetupNode {\n\treturn &SetupNode{\n\t\trunner: newRunner(body, codeLocation, timeout, failer, types.SpecComponentTypeJustAfterEach, componentIndex),\n\t}\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/leafnodes/suite_nodes.go", "content": "package leafnodes\n\nimport (\n\t\"time\"\n\n\t\"github.com/onsi/ginkgo/internal/failer\"\n\t\"github.com/onsi/ginkgo/types\"\n)\n\ntype SuiteNode interface {\n\tRun(parallelNode int, parallelTotal int, syncHost string) bool\n\tPassed() bool\n\tSummary() *types.SetupSummary\n}\n\ntype simpleSuiteNode struct {\n\trunner *runner\n\toutcome types.SpecState\n\tfailure types.SpecFailure\n\trunTime time.Duration\n}\n\nfunc (node *simpleSuiteNode) Run(parallelNode int, parallelTotal int, syncHost string) bool {\n\tt := time.Now()\n\tnode.outcome, node.failure = node.runner.run()\n\tnode.runTime = time.Since(t)\n\n\treturn node.outcome == types.SpecStatePassed\n}\n\nfunc (node *simpleSuiteNode) Passed() bool {\n\treturn node.outcome == types.SpecStatePassed\n}\n\nfunc (node *simpleSuiteNode) Summary() *types.SetupSummary {\n\treturn &types.SetupSummary{\n\t\tComponentType: node.runner.nodeType,\n\t\tCodeLocation: node.runner.codeLocation,\n\t\tState: node.outcome,\n\t\tRunTime: node.runTime,\n\t\tFailure: node.failure,\n\t}\n}\n\nfunc NewBeforeSuiteNode(body interface{}, codeLocation types.CodeLocation, timeout time.Duration, failer *failer.Failer) SuiteNode {\n\treturn &simpleSuiteNode{\n\t\trunner: newRunner(body, codeLocation, timeout, failer, types.SpecComponentTypeBeforeSuite, 0),\n\t}\n}\n\nfunc NewAfterSuiteNode(body interface{}, codeLocation types.CodeLocation, timeout time.Duration, failer *failer.Failer) SuiteNode {\n\treturn &simpleSuiteNode{\n\t\trunner: newRunner(body, codeLocation, timeout, failer, types.SpecComponentTypeAfterSuite, 0),\n\t}\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/leafnodes/synchronized_after_suite_node.go", "content": "package leafnodes\n\nimport (\n\t\"encoding/json\"\n\t\"io/ioutil\"\n\t\"net/http\"\n\t\"time\"\n\n\t\"github.com/onsi/ginkgo/internal/failer\"\n\t\"github.com/onsi/ginkgo/types\"\n)\n\ntype synchronizedAfterSuiteNode struct {\n\trunnerA *runner\n\trunnerB *runner\n\n\toutcome types.SpecState\n\tfailure types.SpecFailure\n\trunTime time.Duration\n}\n\nfunc NewSynchronizedAfterSuiteNode(bodyA interface{}, bodyB interface{}, codeLocation types.CodeLocation, timeout time.Duration, failer *failer.Failer) SuiteNode {\n\treturn &synchronizedAfterSuiteNode{\n\t\trunnerA: newRunner(bodyA, codeLocation, timeout, failer, types.SpecComponentTypeAfterSuite, 0),\n\t\trunnerB: newRunner(bodyB, codeLocation, timeout, failer, types.SpecComponentTypeAfterSuite, 0),\n\t}\n}\n\nfunc (node *synchronizedAfterSuiteNode) Run(parallelNode int, parallelTotal int, syncHost string) bool {\n\tnode.outcome, node.failure = node.runnerA.run()\n\n\tif parallelNode == 1 {\n\t\tif parallelTotal > 1 {\n\t\t\tnode.waitUntilOtherNodesAreDone(syncHost)\n\t\t}\n\n\t\toutcome, failure := node.runnerB.run()\n\n\t\tif node.outcome == types.SpecStatePassed {\n\t\t\tnode.outcome, node.failure = outcome, failure\n\t\t}\n\t}\n\n\treturn node.outcome == types.SpecStatePassed\n}\n\nfunc (node *synchronizedAfterSuiteNode) Passed() bool {\n\treturn node.outcome == types.SpecStatePassed\n}\n\nfunc (node *synchronizedAfterSuiteNode) Summary() *types.SetupSummary {\n\treturn &types.SetupSummary{\n\t\tComponentType: node.runnerA.nodeType,\n\t\tCodeLocation: node.runnerA.codeLocation,\n\t\tState: node.outcome,\n\t\tRunTime: node.runTime,\n\t\tFailure: node.failure,\n\t}\n}\n\nfunc (node *synchronizedAfterSuiteNode) waitUntilOtherNodesAreDone(syncHost string) {\n\tfor {\n\t\tif node.canRun(syncHost) {\n\t\t\treturn\n\t\t}\n\n\t\ttime.Sleep(50 * time.Millisecond)\n\t}\n}\n\nfunc (node *synchronizedAfterSuiteNode) canRun(syncHost string) bool {\n\tresp, err := http.Get(syncHost + \"/RemoteAfterSuiteData\")\n\tif err != nil || resp.StatusCode != http.StatusOK {\n\t\treturn false\n\t}\n\n\tbody, err := ioutil.ReadAll(resp.Body)\n\tif err != nil {\n\t\treturn false\n\t}\n\tresp.Body.Close()\n\n\tafterSuiteData := types.RemoteAfterSuiteData{}\n\terr = json.Unmarshal(body, &afterSuiteData)\n\tif err != nil {\n\t\treturn false\n\t}\n\n\treturn afterSuiteData.CanRun\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/leafnodes/synchronized_before_suite_node.go", "content": "package leafnodes\n\nimport (\n\t\"bytes\"\n\t\"encoding/json\"\n\t\"io/ioutil\"\n\t\"net/http\"\n\t\"reflect\"\n\t\"time\"\n\n\t\"github.com/onsi/ginkgo/internal/failer\"\n\t\"github.com/onsi/ginkgo/types\"\n)\n\ntype synchronizedBeforeSuiteNode struct {\n\trunnerA *runner\n\trunnerB *runner\n\n\tdata []byte\n\n\toutcome types.SpecState\n\tfailure types.SpecFailure\n\trunTime time.Duration\n}\n\nfunc NewSynchronizedBeforeSuiteNode(bodyA interface{}, bodyB interface{}, codeLocation types.CodeLocation, timeout time.Duration, failer *failer.Failer) SuiteNode {\n\tnode := &synchronizedBeforeSuiteNode{}\n\n\tnode.runnerA = newRunner(node.wrapA(bodyA), codeLocation, timeout, failer, types.SpecComponentTypeBeforeSuite, 0)\n\tnode.runnerB = newRunner(node.wrapB(bodyB), codeLocation, timeout, failer, types.SpecComponentTypeBeforeSuite, 0)\n\n\treturn node\n}\n\nfunc (node *synchronizedBeforeSuiteNode) Run(parallelNode int, parallelTotal int, syncHost string) bool {\n\tt := time.Now()\n\tdefer func() {\n\t\tnode.runTime = time.Since(t)\n\t}()\n\n\tif parallelNode == 1 {\n\t\tnode.outcome, node.failure = node.runA(parallelTotal, syncHost)\n\t} else {\n\t\tnode.outcome, node.failure = node.waitForA(syncHost)\n\t}\n\n\tif node.outcome != types.SpecStatePassed {\n\t\treturn false\n\t}\n\tnode.outcome, node.failure = node.runnerB.run()\n\n\treturn node.outcome == types.SpecStatePassed\n}\n\nfunc (node *synchronizedBeforeSuiteNode) runA(parallelTotal int, syncHost string) (types.SpecState, types.SpecFailure) {\n\toutcome, failure := node.runnerA.run()\n\n\tif parallelTotal > 1 {\n\t\tstate := types.RemoteBeforeSuiteStatePassed\n\t\tif outcome != types.SpecStatePassed {\n\t\t\tstate = types.RemoteBeforeSuiteStateFailed\n\t\t}\n\t\tjson := (types.RemoteBeforeSuiteData{\n\t\t\tData: node.data,\n\t\t\tState: state,\n\t\t}).ToJSON()\n\t\thttp.Post(syncHost+\"/BeforeSuiteState\", \"application/json\", bytes.NewBuffer(json))\n\t}\n\n\treturn outcome, failure\n}\n\nfunc (node *synchronizedBeforeSuiteNode) waitForA(syncHost string) (types.SpecState, types.SpecFailure) {\n\tfailure := func(message string) types.SpecFailure {\n\t\treturn types.SpecFailure{\n\t\t\tMessage: message,\n\t\t\tLocation: node.runnerA.codeLocation,\n\t\t\tComponentType: node.runnerA.nodeType,\n\t\t\tComponentIndex: node.runnerA.componentIndex,\n\t\t\tComponentCodeLocation: node.runnerA.codeLocation,\n\t\t}\n\t}\n\tfor {\n\t\tresp, err := http.Get(syncHost + \"/BeforeSuiteState\")\n\t\tif err != nil || resp.StatusCode != http.StatusOK {\n\t\t\treturn types.SpecStateFailed, failure(\"Failed to fetch BeforeSuite state\")\n\t\t}\n\n\t\tbody, err := ioutil.ReadAll(resp.Body)\n\t\tif err != nil {\n\t\t\treturn types.SpecStateFailed, failure(\"Failed to read BeforeSuite state\")\n\t\t}\n\t\tresp.Body.Close()\n\n\t\tbeforeSuiteData := types.RemoteBeforeSuiteData{}\n\t\terr = json.Unmarshal(body, &beforeSuiteData)\n\t\tif err != nil {\n\t\t\treturn types.SpecStateFailed, failure(\"Failed to decode BeforeSuite state\")\n\t\t}\n\n\t\tswitch beforeSuiteData.State {\n\t\tcase types.RemoteBeforeSuiteStatePassed:\n\t\t\tnode.data = beforeSuiteData.Data\n\t\t\treturn types.SpecStatePassed, types.SpecFailure{}\n\t\tcase types.RemoteBeforeSuiteStateFailed:\n\t\t\treturn types.SpecStateFailed, failure(\"BeforeSuite on Node 1 failed\")\n\t\tcase types.RemoteBeforeSuiteStateDisappeared:\n\t\t\treturn types.SpecStateFailed, failure(\"Node 1 disappeared before completing BeforeSuite\")\n\t\t}\n\n\t\ttime.Sleep(50 * time.Millisecond)\n\t}\n}\n\nfunc (node *synchronizedBeforeSuiteNode) Passed() bool {\n\treturn node.outcome == types.SpecStatePassed\n}\n\nfunc (node *synchronizedBeforeSuiteNode) Summary() *types.SetupSummary {\n\treturn &types.SetupSummary{\n\t\tComponentType: node.runnerA.nodeType,\n\t\tCodeLocation: node.runnerA.codeLocation,\n\t\tState: node.outcome,\n\t\tRunTime: node.runTime,\n\t\tFailure: node.failure,\n\t}\n}\n\nfunc (node *synchronizedBeforeSuiteNode) wrapA(bodyA interface{}) interface{} {\n\ttypeA := reflect.TypeOf(bodyA)\n\tif typeA.Kind() != reflect.Func {\n\t\tpanic(\"SynchronizedBeforeSuite expects a function as its first argument\")\n\t}\n\n\ttakesNothing := typeA.NumIn() == 0\n\ttakesADoneChannel := typeA.NumIn() == 1 && typeA.In(0).Kind() == reflect.Chan && typeA.In(0).Elem().Kind() == reflect.Interface\n\treturnsBytes := typeA.NumOut() == 1 && typeA.Out(0).Kind() == reflect.Slice && typeA.Out(0).Elem().Kind() == reflect.Uint8\n\n\tif !((takesNothing || takesADoneChannel) && returnsBytes) {\n\t\tpanic(\"SynchronizedBeforeSuite's first argument should be a function that returns []byte and either takes no arguments or takes a Done channel.\")\n\t}\n\n\tif takesADoneChannel {\n\t\treturn func(done chan<- interface{}) {\n\t\t\tout := reflect.ValueOf(bodyA).Call([]reflect.Value{reflect.ValueOf(done)})\n\t\t\tnode.data = out[0].Interface().([]byte)\n\t\t}\n\t}\n\n\treturn func() {\n\t\tout := reflect.ValueOf(bodyA).Call([]reflect.Value{})\n\t\tnode.data = out[0].Interface().([]byte)\n\t}\n}\n\nfunc (node *synchronizedBeforeSuiteNode) wrapB(bodyB interface{}) interface{} {\n\ttypeB := reflect.TypeOf(bodyB)\n\tif typeB.Kind() != reflect.Func {\n\t\tpanic(\"SynchronizedBeforeSuite expects a function as its second argument\")\n\t}\n\n\treturnsNothing := typeB.NumOut() == 0\n\ttakesBytesOnly := typeB.NumIn() == 1 && typeB.In(0).Kind() == reflect.Slice && typeB.In(0).Elem().Kind() == reflect.Uint8\n\ttakesBytesAndDone := typeB.NumIn() == 2 &&\n\t\ttypeB.In(0).Kind() == reflect.Slice && typeB.In(0).Elem().Kind() == reflect.Uint8 &&\n\t\ttypeB.In(1).Kind() == reflect.Chan && typeB.In(1).Elem().Kind() == reflect.Interface\n\n\tif !((takesBytesOnly || takesBytesAndDone) && returnsNothing) {\n\t\tpanic(\"SynchronizedBeforeSuite's second argument should be a function that returns nothing and either takes []byte or ([]byte, Done)\")\n\t}\n\n\tif takesBytesAndDone {\n\t\treturn func(done chan<- interface{}) {\n\t\t\treflect.ValueOf(bodyB).Call([]reflect.Value{reflect.ValueOf(node.data), reflect.ValueOf(done)})\n\t\t}\n\t}\n\n\treturn func() {\n\t\treflect.ValueOf(bodyB).Call([]reflect.Value{reflect.ValueOf(node.data)})\n\t}\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/remote/aggregator.go", "content": "/*\n\nAggregator is a reporter used by the Ginkgo CLI to aggregate and present parallel test output\ncoherently as tests complete. You shouldn't need to use this in your code. To run tests in parallel:\n\n\tginkgo -nodes=N\n\nwhere N is the number of nodes you desire.\n*/\npackage remote\n\nimport (\n\t\"time\"\n\n\t\"github.com/onsi/ginkgo/config\"\n\t\"github.com/onsi/ginkgo/reporters/stenographer\"\n\t\"github.com/onsi/ginkgo/types\"\n)\n\ntype configAndSuite struct {\n\tconfig config.GinkgoConfigType\n\tsummary *types.SuiteSummary\n}\n\ntype Aggregator struct {\n\tnodeCount int\n\tconfig config.DefaultReporterConfigType\n\tstenographer stenographer.Stenographer\n\tresult chan bool\n\n\tsuiteBeginnings chan configAndSuite\n\taggregatedSuiteBeginnings []configAndSuite\n\n\tbeforeSuites chan *types.SetupSummary\n\taggregatedBeforeSuites []*types.SetupSummary\n\n\tafterSuites chan *types.SetupSummary\n\taggregatedAfterSuites []*types.SetupSummary\n\n\tspecCompletions chan *types.SpecSummary\n\tcompletedSpecs []*types.SpecSummary\n\n\tsuiteEndings chan *types.SuiteSummary\n\taggregatedSuiteEndings []*types.SuiteSummary\n\tspecs []*types.SpecSummary\n\n\tstartTime time.Time\n}\n\nfunc NewAggregator(nodeCount int, result chan bool, config config.DefaultReporterConfigType, stenographer stenographer.Stenographer) *Aggregator {\n\taggregator := &Aggregator{\n\t\tnodeCount: nodeCount,\n\t\tresult: result,\n\t\tconfig: config,\n\t\tstenographer: stenographer,\n\n\t\tsuiteBeginnings: make(chan configAndSuite),\n\t\tbeforeSuites: make(chan *types.SetupSummary),\n\t\tafterSuites: make(chan *types.SetupSummary),\n\t\tspecCompletions: make(chan *types.SpecSummary),\n\t\tsuiteEndings: make(chan *types.SuiteSummary),\n\t}\n\n\tgo aggregator.mux()\n\n\treturn aggregator\n}\n\nfunc (aggregator *Aggregator) SpecSuiteWillBegin(config config.GinkgoConfigType, summary *types.SuiteSummary) {\n\taggregator.suiteBeginnings <- configAndSuite{config, summary}\n}\n\nfunc (aggregator *Aggregator) BeforeSuiteDidRun(setupSummary *types.SetupSummary) {\n\taggregator.beforeSuites <- setupSummary\n}\n\nfunc (aggregator *Aggregator) AfterSuiteDidRun(setupSummary *types.SetupSummary) {\n\taggregator.afterSuites <- setupSummary\n}\n\nfunc (aggregator *Aggregator) SpecWillRun(specSummary *types.SpecSummary) {\n\t//noop\n}\n\nfunc (aggregator *Aggregator) SpecDidComplete(specSummary *types.SpecSummary) {\n\taggregator.specCompletions <- specSummary\n}\n\nfunc (aggregator *Aggregator) SpecSuiteDidEnd(summary *types.SuiteSummary) {\n\taggregator.suiteEndings <- summary\n}\n\nfunc (aggregator *Aggregator) mux() {\nloop:\n\tfor {\n\t\tselect {\n\t\tcase configAndSuite := <-aggregator.suiteBeginnings:\n\t\t\taggregator.registerSuiteBeginning(configAndSuite)\n\t\tcase setupSummary := <-aggregator.beforeSuites:\n\t\t\taggregator.registerBeforeSuite(setupSummary)\n\t\tcase setupSummary := <-aggregator.afterSuites:\n\t\t\taggregator.registerAfterSuite(setupSummary)\n\t\tcase specSummary := <-aggregator.specCompletions:\n\t\t\taggregator.registerSpecCompletion(specSummary)\n\t\tcase suite := <-aggregator.suiteEndings:\n\t\t\tfinished, passed := aggregator.registerSuiteEnding(suite)\n\t\t\tif finished {\n\t\t\t\taggregator.result <- passed\n\t\t\t\tbreak loop\n\t\t\t}\n\t\t}\n\t}\n}\n\nfunc (aggregator *Aggregator) registerSuiteBeginning(configAndSuite configAndSuite) {\n\taggregator.aggregatedSuiteBeginnings = append(aggregator.aggregatedSuiteBeginnings, configAndSuite)\n\n\tif len(aggregator.aggregatedSuiteBeginnings) == 1 {\n\t\taggregator.startTime = time.Now()\n\t}\n\n\tif len(aggregator.aggregatedSuiteBeginnings) != aggregator.nodeCount {\n\t\treturn\n\t}\n\n\taggregator.stenographer.AnnounceSuite(configAndSuite.summary.SuiteDescription, configAndSuite.config.RandomSeed, configAndSuite.config.RandomizeAllSpecs, aggregator.config.Succinct)\n\n\ttotalNumberOfSpecs := 0\n\tif len(aggregator.aggregatedSuiteBeginnings) > 0 {\n\t\ttotalNumberOfSpecs = configAndSuite.summary.NumberOfSpecsBeforeParallelization\n\t}\n\n\taggregator.stenographer.AnnounceTotalNumberOfSpecs(totalNumberOfSpecs, aggregator.config.Succinct)\n\taggregator.stenographer.AnnounceAggregatedParallelRun(aggregator.nodeCount, aggregator.config.Succinct)\n\taggregator.flushCompletedSpecs()\n}\n\nfunc (aggregator *Aggregator) registerBeforeSuite(setupSummary *types.SetupSummary) {\n\taggregator.aggregatedBeforeSuites = append(aggregator.aggregatedBeforeSuites, setupSummary)\n\taggregator.flushCompletedSpecs()\n}\n\nfunc (aggregator *Aggregator) registerAfterSuite(setupSummary *types.SetupSummary) {\n\taggregator.aggregatedAfterSuites = append(aggregator.aggregatedAfterSuites, setupSummary)\n\taggregator.flushCompletedSpecs()\n}\n\nfunc (aggregator *Aggregator) registerSpecCompletion(specSummary *types.SpecSummary) {\n\taggregator.completedSpecs = append(aggregator.completedSpecs, specSummary)\n\taggregator.specs = append(aggregator.specs, specSummary)\n\taggregator.flushCompletedSpecs()\n}\n\nfunc (aggregator *Aggregator) flushCompletedSpecs() {\n\tif len(aggregator.aggregatedSuiteBeginnings) != aggregator.nodeCount {\n\t\treturn\n\t}\n\n\tfor _, setupSummary := range aggregator.aggregatedBeforeSuites {\n\t\taggregator.announceBeforeSuite(setupSummary)\n\t}\n\n\tfor _, specSummary := range aggregator.completedSpecs {\n\t\taggregator.announceSpec(specSummary)\n\t}\n\n\tfor _, setupSummary := range aggregator.aggregatedAfterSuites {\n\t\taggregator.announceAfterSuite(setupSummary)\n\t}\n\n\taggregator.aggregatedBeforeSuites = []*types.SetupSummary{}\n\taggregator.completedSpecs = []*types.SpecSummary{}\n\taggregator.aggregatedAfterSuites = []*types.SetupSummary{}\n}\n\nfunc (aggregator *Aggregator) announceBeforeSuite(setupSummary *types.SetupSummary) {\n\taggregator.stenographer.AnnounceCapturedOutput(setupSummary.CapturedOutput)\n\tif setupSummary.State != types.SpecStatePassed {\n\t\taggregator.stenographer.AnnounceBeforeSuiteFailure(setupSummary, aggregator.config.Succinct, aggregator.config.FullTrace)\n\t}\n}\n\nfunc (aggregator *Aggregator) announceAfterSuite(setupSummary *types.SetupSummary) {\n\taggregator.stenographer.AnnounceCapturedOutput(setupSummary.CapturedOutput)\n\tif setupSummary.State != types.SpecStatePassed {\n\t\taggregator.stenographer.AnnounceAfterSuiteFailure(setupSummary, aggregator.config.Succinct, aggregator.config.FullTrace)\n\t}\n}\n\nfunc (aggregator *Aggregator) announceSpec(specSummary *types.SpecSummary) {\n\tif aggregator.config.Verbose && specSummary.State != types.SpecStatePending && specSummary.State != types.SpecStateSkipped {\n\t\taggregator.stenographer.AnnounceSpecWillRun(specSummary)\n\t}\n\n\taggregator.stenographer.AnnounceCapturedOutput(specSummary.CapturedOutput)\n\n\tswitch specSummary.State {\n\tcase types.SpecStatePassed:\n\t\tif specSummary.IsMeasurement {\n\t\t\taggregator.stenographer.AnnounceSuccessfulMeasurement(specSummary, aggregator.config.Succinct)\n\t\t} else if specSummary.RunTime.Seconds() >= aggregator.config.SlowSpecThreshold {\n\t\t\taggregator.stenographer.AnnounceSuccessfulSlowSpec(specSummary, aggregator.config.Succinct)\n\t\t} else {\n\t\t\taggregator.stenographer.AnnounceSuccessfulSpec(specSummary)\n\t\t}\n\n\tcase types.SpecStatePending:\n\t\taggregator.stenographer.AnnouncePendingSpec(specSummary, aggregator.config.NoisyPendings && !aggregator.config.Succinct)\n\tcase types.SpecStateSkipped:\n\t\taggregator.stenographer.AnnounceSkippedSpec(specSummary, aggregator.config.Succinct || !aggregator.config.NoisySkippings, aggregator.config.FullTrace)\n\tcase types.SpecStateTimedOut:\n\t\taggregator.stenographer.AnnounceSpecTimedOut(specSummary, aggregator.config.Succinct, aggregator.config.FullTrace)\n\tcase types.SpecStatePanicked:\n\t\taggregator.stenographer.AnnounceSpecPanicked(specSummary, aggregator.config.Succinct, aggregator.config.FullTrace)\n\tcase types.SpecStateFailed:\n\t\taggregator.stenographer.AnnounceSpecFailed(specSummary, aggregator.config.Succinct, aggregator.config.FullTrace)\n\t}\n}\n\nfunc (aggregator *Aggregator) registerSuiteEnding(suite *types.SuiteSummary) (finished bool, passed bool) {\n\taggregator.aggregatedSuiteEndings = append(aggregator.aggregatedSuiteEndings, suite)\n\tif len(aggregator.aggregatedSuiteEndings) < aggregator.nodeCount {\n\t\treturn false, false\n\t}\n\n\taggregatedSuiteSummary := &types.SuiteSummary{}\n\taggregatedSuiteSummary.SuiteSucceeded = true\n\n\tfor _, suiteSummary := range aggregator.aggregatedSuiteEndings {\n\t\tif !suiteSummary.SuiteSucceeded {\n\t\t\taggregatedSuiteSummary.SuiteSucceeded = false\n\t\t}\n\n\t\taggregatedSuiteSummary.NumberOfSpecsThatWillBeRun += suiteSummary.NumberOfSpecsThatWillBeRun\n\t\taggregatedSuiteSummary.NumberOfTotalSpecs += suiteSummary.NumberOfTotalSpecs\n\t\taggregatedSuiteSummary.NumberOfPassedSpecs += suiteSummary.NumberOfPassedSpecs\n\t\taggregatedSuiteSummary.NumberOfFailedSpecs += suiteSummary.NumberOfFailedSpecs\n\t\taggregatedSuiteSummary.NumberOfPendingSpecs += suiteSummary.NumberOfPendingSpecs\n\t\taggregatedSuiteSummary.NumberOfSkippedSpecs += suiteSummary.NumberOfSkippedSpecs\n\t\taggregatedSuiteSummary.NumberOfFlakedSpecs += suiteSummary.NumberOfFlakedSpecs\n\t}\n\n\taggregatedSuiteSummary.RunTime = time.Since(aggregator.startTime)\n\n\taggregator.stenographer.SummarizeFailures(aggregator.specs)\n\taggregator.stenographer.AnnounceSpecRunCompletion(aggregatedSuiteSummary, aggregator.config.Succinct)\n\n\treturn true, aggregatedSuiteSummary.SuiteSucceeded\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/remote/forwarding_reporter.go", "content": "package remote\n\nimport (\n\t\"bytes\"\n\t\"encoding/json\"\n\t\"fmt\"\n\t\"io\"\n\t\"net/http\"\n\t\"os\"\n\n\t\"github.com/onsi/ginkgo/internal/writer\"\n\t\"github.com/onsi/ginkgo/reporters\"\n\t\"github.com/onsi/ginkgo/reporters/stenographer\"\n\n\t\"github.com/onsi/ginkgo/config\"\n\t\"github.com/onsi/ginkgo/types\"\n)\n\n//An interface to net/http's client to allow the injection of fakes under test\ntype Poster interface {\n\tPost(url string, bodyType string, body io.Reader) (resp *http.Response, err error)\n}\n\n/*\nThe ForwardingReporter is a Ginkgo reporter that forwards information to\na Ginkgo remote server.\n\nWhen streaming parallel test output, this repoter is automatically installed by Ginkgo.\n\nThis is accomplished by passing in the GINKGO_REMOTE_REPORTING_SERVER environment variable to `go test`, the Ginkgo test runner\ndetects this environment variable (which should contain the host of the server) and automatically installs a ForwardingReporter\nin place of Ginkgo's DefaultReporter.\n*/\n\ntype ForwardingReporter struct {\n\tserverHost string\n\tposter Poster\n\toutputInterceptor OutputInterceptor\n\tdebugMode bool\n\tdebugFile *os.File\n\tnestedReporter *reporters.DefaultReporter\n}\n\nfunc NewForwardingReporter(config config.DefaultReporterConfigType, serverHost string, poster Poster, outputInterceptor OutputInterceptor, ginkgoWriter *writer.Writer, debugFile string) *ForwardingReporter {\n\treporter := &ForwardingReporter{\n\t\tserverHost: serverHost,\n\t\tposter: poster,\n\t\toutputInterceptor: outputInterceptor,\n\t}\n\n\tif debugFile != \"\" {\n\t\tvar err error\n\t\treporter.debugMode = true\n\t\treporter.debugFile, err = os.Create(debugFile)\n\t\tif err != nil {\n\t\t\tfmt.Println(err.Error())\n\t\t\tos.Exit(1)\n\t\t}\n\n\t\tif !config.Verbose {\n\t\t\t//if verbose is true then the GinkgoWriter emits to stdout. Don't _also_ redirect GinkgoWriter output as that will result in duplication.\n\t\t\tginkgoWriter.AndRedirectTo(reporter.debugFile)\n\t\t}\n\t\toutputInterceptor.StreamTo(reporter.debugFile) //This is not working\n\n\t\tstenographer := stenographer.New(false, true, reporter.debugFile)\n\t\tconfig.Succinct = false\n\t\tconfig.Verbose = true\n\t\tconfig.FullTrace = true\n\t\treporter.nestedReporter = reporters.NewDefaultReporter(config, stenographer)\n\t}\n\n\treturn reporter\n}\n\nfunc (reporter *ForwardingReporter) post(path string, data interface{}) {\n\tencoded, _ := json.Marshal(data)\n\tbuffer := bytes.NewBuffer(encoded)\n\treporter.poster.Post(reporter.serverHost+path, \"application/json\", buffer)\n}\n\nfunc (reporter *ForwardingReporter) SpecSuiteWillBegin(conf config.GinkgoConfigType, summary *types.SuiteSummary) {\n\tdata := struct {\n\t\tConfig config.GinkgoConfigType `json:\"config\"`\n\t\tSummary *types.SuiteSummary `json:\"suite-summary\"`\n\t}{\n\t\tconf,\n\t\tsummary,\n\t}\n\n\treporter.outputInterceptor.StartInterceptingOutput()\n\tif reporter.debugMode {\n\t\treporter.nestedReporter.SpecSuiteWillBegin(conf, summary)\n\t\treporter.debugFile.Sync()\n\t}\n\treporter.post(\"/SpecSuiteWillBegin\", data)\n}\n\nfunc (reporter *ForwardingReporter) BeforeSuiteDidRun(setupSummary *types.SetupSummary) {\n\toutput, _ := reporter.outputInterceptor.StopInterceptingAndReturnOutput()\n\treporter.outputInterceptor.StartInterceptingOutput()\n\tsetupSummary.CapturedOutput = output\n\tif reporter.debugMode {\n\t\treporter.nestedReporter.BeforeSuiteDidRun(setupSummary)\n\t\treporter.debugFile.Sync()\n\t}\n\treporter.post(\"/BeforeSuiteDidRun\", setupSummary)\n}\n\nfunc (reporter *ForwardingReporter) SpecWillRun(specSummary *types.SpecSummary) {\n\tif reporter.debugMode {\n\t\treporter.nestedReporter.SpecWillRun(specSummary)\n\t\treporter.debugFile.Sync()\n\t}\n\treporter.post(\"/SpecWillRun\", specSummary)\n}\n\nfunc (reporter *ForwardingReporter) SpecDidComplete(specSummary *types.SpecSummary) {\n\toutput, _ := reporter.outputInterceptor.StopInterceptingAndReturnOutput()\n\treporter.outputInterceptor.StartInterceptingOutput()\n\tspecSummary.CapturedOutput = output\n\tif reporter.debugMode {\n\t\treporter.nestedReporter.SpecDidComplete(specSummary)\n\t\treporter.debugFile.Sync()\n\t}\n\treporter.post(\"/SpecDidComplete\", specSummary)\n}\n\nfunc (reporter *ForwardingReporter) AfterSuiteDidRun(setupSummary *types.SetupSummary) {\n\toutput, _ := reporter.outputInterceptor.StopInterceptingAndReturnOutput()\n\treporter.outputInterceptor.StartInterceptingOutput()\n\tsetupSummary.CapturedOutput = output\n\tif reporter.debugMode {\n\t\treporter.nestedReporter.AfterSuiteDidRun(setupSummary)\n\t\treporter.debugFile.Sync()\n\t}\n\treporter.post(\"/AfterSuiteDidRun\", setupSummary)\n}\n\nfunc (reporter *ForwardingReporter) SpecSuiteDidEnd(summary *types.SuiteSummary) {\n\treporter.outputInterceptor.StopInterceptingAndReturnOutput()\n\tif reporter.debugMode {\n\t\treporter.nestedReporter.SpecSuiteDidEnd(summary)\n\t\treporter.debugFile.Sync()\n\t}\n\treporter.post(\"/SpecSuiteDidEnd\", summary)\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/remote/output_interceptor.go", "content": "package remote\n\nimport \"os\"\n\n/*\nThe OutputInterceptor is used by the ForwardingReporter to\nintercept and capture all stdin and stderr output during a test run.\n*/\ntype OutputInterceptor interface {\n\tStartInterceptingOutput() error\n\tStopInterceptingAndReturnOutput() (string, error)\n\tStreamTo(*os.File)\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/remote/output_interceptor_unix.go", "content": "// +build freebsd openbsd netbsd dragonfly darwin linux solaris\n\npackage remote\n\nimport (\n\t\"errors\"\n\t\"io/ioutil\"\n\t\"os\"\n\n\t\"github.com/nxadm/tail\"\n\t\"golang.org/x/sys/unix\"\n)\n\nfunc NewOutputInterceptor() OutputInterceptor {\n\treturn &outputInterceptor{}\n}\n\ntype outputInterceptor struct {\n\tredirectFile *os.File\n\tstreamTarget *os.File\n\tintercepting bool\n\ttailer *tail.Tail\n\tdoneTailing chan bool\n}\n\nfunc (interceptor *outputInterceptor) StartInterceptingOutput() error {\n\tif interceptor.intercepting {\n\t\treturn errors.New(\"Already intercepting output!\")\n\t}\n\tinterceptor.intercepting = true\n\n\tvar err error\n\n\tinterceptor.redirectFile, err = ioutil.TempFile(\"\", \"ginkgo-output\")\n\tif err != nil {\n\t\treturn err\n\t}\n\n\t// This might call Dup3 if the dup2 syscall is not available, e.g. on\n\t// linux/arm64 or linux/riscv64\n\tunix.Dup2(int(interceptor.redirectFile.Fd()), 1)\n\tunix.Dup2(int(interceptor.redirectFile.Fd()), 2)\n\n\tif interceptor.streamTarget != nil {\n\t\tinterceptor.tailer, _ = tail.TailFile(interceptor.redirectFile.Name(), tail.Config{Follow: true})\n\t\tinterceptor.doneTailing = make(chan bool)\n\n\t\tgo func() {\n\t\t\tfor line := range interceptor.tailer.Lines {\n\t\t\t\tinterceptor.streamTarget.Write([]byte(line.Text + \"\\n\"))\n\t\t\t}\n\t\t\tclose(interceptor.doneTailing)\n\t\t}()\n\t}\n\n\treturn nil\n}\n\nfunc (interceptor *outputInterceptor) StopInterceptingAndReturnOutput() (string, error) {\n\tif !interceptor.intercepting {\n\t\treturn \"\", errors.New(\"Not intercepting output!\")\n\t}\n\n\tinterceptor.redirectFile.Close()\n\toutput, err := ioutil.ReadFile(interceptor.redirectFile.Name())\n\tos.Remove(interceptor.redirectFile.Name())\n\n\tinterceptor.intercepting = false\n\n\tif interceptor.streamTarget != nil {\n\t\tinterceptor.tailer.Stop()\n\t\tinterceptor.tailer.Cleanup()\n\t\t<-interceptor.doneTailing\n\t\tinterceptor.streamTarget.Sync()\n\t}\n\n\treturn string(output), err\n}\n\nfunc (interceptor *outputInterceptor) StreamTo(out *os.File) {\n\tinterceptor.streamTarget = out\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/remote/output_interceptor_win.go", "content": "// +build windows\n\npackage remote\n\nimport (\n\t\"errors\"\n\t\"os\"\n)\n\nfunc NewOutputInterceptor() OutputInterceptor {\n\treturn &outputInterceptor{}\n}\n\ntype outputInterceptor struct {\n\tintercepting bool\n}\n\nfunc (interceptor *outputInterceptor) StartInterceptingOutput() error {\n\tif interceptor.intercepting {\n\t\treturn errors.New(\"Already intercepting output!\")\n\t}\n\tinterceptor.intercepting = true\n\n\t// not working on windows...\n\n\treturn nil\n}\n\nfunc (interceptor *outputInterceptor) StopInterceptingAndReturnOutput() (string, error) {\n\t// not working on windows...\n\tinterceptor.intercepting = false\n\n\treturn \"\", nil\n}\n\nfunc (interceptor *outputInterceptor) StreamTo(*os.File) {}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/remote/server.go", "content": "/*\n\nThe remote package provides the pieces to allow Ginkgo test suites to report to remote listeners.\nThis is used, primarily, to enable streaming parallel test output but has, in principal, broader applications (e.g. streaming test output to a browser).\n\n*/\n\npackage remote\n\nimport (\n\t\"encoding/json\"\n\t\"io/ioutil\"\n\t\"net\"\n\t\"net/http\"\n\t\"sync\"\n\n\t\"github.com/onsi/ginkgo/internal/spec_iterator\"\n\n\t\"github.com/onsi/ginkgo/config\"\n\t\"github.com/onsi/ginkgo/reporters\"\n\t\"github.com/onsi/ginkgo/types\"\n)\n\n/*\nServer spins up on an automatically selected port and listens for communication from the forwarding reporter.\nIt then forwards that communication to attached reporters.\n*/\ntype Server struct {\n\tlistener net.Listener\n\treporters []reporters.Reporter\n\talives []func() bool\n\tlock *sync.Mutex\n\tbeforeSuiteData types.RemoteBeforeSuiteData\n\tparallelTotal int\n\tcounter int\n}\n\n//Create a new server, automatically selecting a port\nfunc NewServer(parallelTotal int) (*Server, error) {\n\tlistener, err := net.Listen(\"tcp\", \"127.0.0.1:0\")\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn &Server{\n\t\tlistener: listener,\n\t\tlock: &sync.Mutex{},\n\t\talives: make([]func() bool, parallelTotal),\n\t\tbeforeSuiteData: types.RemoteBeforeSuiteData{Data: nil, State: types.RemoteBeforeSuiteStatePending},\n\t\tparallelTotal: parallelTotal,\n\t}, nil\n}\n\n//Start the server. You don't need to `go s.Start()`, just `s.Start()`\nfunc (server *Server) Start() {\n\thttpServer := &http.Server{}\n\tmux := http.NewServeMux()\n\thttpServer.Handler = mux\n\n\t//streaming endpoints\n\tmux.HandleFunc(\"/SpecSuiteWillBegin\", server.specSuiteWillBegin)\n\tmux.HandleFunc(\"/BeforeSuiteDidRun\", server.beforeSuiteDidRun)\n\tmux.HandleFunc(\"/AfterSuiteDidRun\", server.afterSuiteDidRun)\n\tmux.HandleFunc(\"/SpecWillRun\", server.specWillRun)\n\tmux.HandleFunc(\"/SpecDidComplete\", server.specDidComplete)\n\tmux.HandleFunc(\"/SpecSuiteDidEnd\", server.specSuiteDidEnd)\n\n\t//synchronization endpoints\n\tmux.HandleFunc(\"/BeforeSuiteState\", server.handleBeforeSuiteState)\n\tmux.HandleFunc(\"/RemoteAfterSuiteData\", server.handleRemoteAfterSuiteData)\n\tmux.HandleFunc(\"/counter\", server.handleCounter)\n\tmux.HandleFunc(\"/has-counter\", server.handleHasCounter) //for backward compatibility\n\n\tgo httpServer.Serve(server.listener)\n}\n\n//Stop the server\nfunc (server *Server) Close() {\n\tserver.listener.Close()\n}\n\n//The address the server can be reached it. Pass this into the `ForwardingReporter`.\nfunc (server *Server) Address() string {\n\treturn \"http://\" + server.listener.Addr().String()\n}\n\n//\n// Streaming Endpoints\n//\n\n//The server will forward all received messages to Ginkgo reporters registered with `RegisterReporters`\nfunc (server *Server) readAll(request *http.Request) []byte {\n\tdefer request.Body.Close()\n\tbody, _ := ioutil.ReadAll(request.Body)\n\treturn body\n}\n\nfunc (server *Server) RegisterReporters(reporters ...reporters.Reporter) {\n\tserver.reporters = reporters\n}\n\nfunc (server *Server) specSuiteWillBegin(writer http.ResponseWriter, request *http.Request) {\n\tbody := server.readAll(request)\n\n\tvar data struct {\n\t\tConfig config.GinkgoConfigType `json:\"config\"`\n\t\tSummary *types.SuiteSummary `json:\"suite-summary\"`\n\t}\n\n\tjson.Unmarshal(body, &data)\n\n\tfor _, reporter := range server.reporters {\n\t\treporter.SpecSuiteWillBegin(data.Config, data.Summary)\n\t}\n}\n\nfunc (server *Server) beforeSuiteDidRun(writer http.ResponseWriter, request *http.Request) {\n\tbody := server.readAll(request)\n\tvar setupSummary *types.SetupSummary\n\tjson.Unmarshal(body, &setupSummary)\n\n\tfor _, reporter := range server.reporters {\n\t\treporter.BeforeSuiteDidRun(setupSummary)\n\t}\n}\n\nfunc (server *Server) afterSuiteDidRun(writer http.ResponseWriter, request *http.Request) {\n\tbody := server.readAll(request)\n\tvar setupSummary *types.SetupSummary\n\tjson.Unmarshal(body, &setupSummary)\n\n\tfor _, reporter := range server.reporters {\n\t\treporter.AfterSuiteDidRun(setupSummary)\n\t}\n}\n\nfunc (server *Server) specWillRun(writer http.ResponseWriter, request *http.Request) {\n\tbody := server.readAll(request)\n\tvar specSummary *types.SpecSummary\n\tjson.Unmarshal(body, &specSummary)\n\n\tfor _, reporter := range server.reporters {\n\t\treporter.SpecWillRun(specSummary)\n\t}\n}\n\nfunc (server *Server) specDidComplete(writer http.ResponseWriter, request *http.Request) {\n\tbody := server.readAll(request)\n\tvar specSummary *types.SpecSummary\n\tjson.Unmarshal(body, &specSummary)\n\n\tfor _, reporter := range server.reporters {\n\t\treporter.SpecDidComplete(specSummary)\n\t}\n}\n\nfunc (server *Server) specSuiteDidEnd(writer http.ResponseWriter, request *http.Request) {\n\tbody := server.readAll(request)\n\tvar suiteSummary *types.SuiteSummary\n\tjson.Unmarshal(body, &suiteSummary)\n\n\tfor _, reporter := range server.reporters {\n\t\treporter.SpecSuiteDidEnd(suiteSummary)\n\t}\n}\n\n//\n// Synchronization Endpoints\n//\n\nfunc (server *Server) RegisterAlive(node int, alive func() bool) {\n\tserver.lock.Lock()\n\tdefer server.lock.Unlock()\n\tserver.alives[node-1] = alive\n}\n\nfunc (server *Server) nodeIsAlive(node int) bool {\n\tserver.lock.Lock()\n\tdefer server.lock.Unlock()\n\talive := server.alives[node-1]\n\tif alive == nil {\n\t\treturn true\n\t}\n\treturn alive()\n}\n\nfunc (server *Server) handleBeforeSuiteState(writer http.ResponseWriter, request *http.Request) {\n\tif request.Method == \"POST\" {\n\t\tdec := json.NewDecoder(request.Body)\n\t\tdec.Decode(&(server.beforeSuiteData))\n\t} else {\n\t\tbeforeSuiteData := server.beforeSuiteData\n\t\tif beforeSuiteData.State == types.RemoteBeforeSuiteStatePending && !server.nodeIsAlive(1) {\n\t\t\tbeforeSuiteData.State = types.RemoteBeforeSuiteStateDisappeared\n\t\t}\n\t\tenc := json.NewEncoder(writer)\n\t\tenc.Encode(beforeSuiteData)\n\t}\n}\n\nfunc (server *Server) handleRemoteAfterSuiteData(writer http.ResponseWriter, request *http.Request) {\n\tafterSuiteData := types.RemoteAfterSuiteData{\n\t\tCanRun: true,\n\t}\n\tfor i := 2; i <= server.parallelTotal; i++ {\n\t\tafterSuiteData.CanRun = afterSuiteData.CanRun && !server.nodeIsAlive(i)\n\t}\n\n\tenc := json.NewEncoder(writer)\n\tenc.Encode(afterSuiteData)\n}\n\nfunc (server *Server) handleCounter(writer http.ResponseWriter, request *http.Request) {\n\tc := spec_iterator.Counter{}\n\tserver.lock.Lock()\n\tc.Index = server.counter\n\tserver.counter++\n\tserver.lock.Unlock()\n\n\tjson.NewEncoder(writer).Encode(c)\n}\n\nfunc (server *Server) handleHasCounter(writer http.ResponseWriter, request *http.Request) {\n\twriter.Write([]byte(\"\"))\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/spec/spec.go", "content": "package spec\n\nimport (\n\t\"fmt\"\n\t\"io\"\n\t\"time\"\n\n\t\"sync\"\n\n\t\"github.com/onsi/ginkgo/internal/containernode\"\n\t\"github.com/onsi/ginkgo/internal/leafnodes\"\n\t\"github.com/onsi/ginkgo/types\"\n)\n\ntype Spec struct {\n\tsubject leafnodes.SubjectNode\n\tfocused bool\n\tannounceProgress bool\n\n\tcontainers []*containernode.ContainerNode\n\n\tstate types.SpecState\n\trunTime time.Duration\n\tstartTime time.Time\n\tfailure types.SpecFailure\n\tpreviousFailures bool\n\n\tstateMutex *sync.Mutex\n}\n\nfunc New(subject leafnodes.SubjectNode, containers []*containernode.ContainerNode, announceProgress bool) *Spec {\n\tspec := &Spec{\n\t\tsubject: subject,\n\t\tcontainers: containers,\n\t\tfocused: subject.Flag() == types.FlagTypeFocused,\n\t\tannounceProgress: announceProgress,\n\t\tstateMutex: &sync.Mutex{},\n\t}\n\n\tspec.processFlag(subject.Flag())\n\tfor i := len(containers) - 1; i >= 0; i-- {\n\t\tspec.processFlag(containers[i].Flag())\n\t}\n\n\treturn spec\n}\n\nfunc (spec *Spec) processFlag(flag types.FlagType) {\n\tif flag == types.FlagTypeFocused {\n\t\tspec.focused = true\n\t} else if flag == types.FlagTypePending {\n\t\tspec.setState(types.SpecStatePending)\n\t}\n}\n\nfunc (spec *Spec) Skip() {\n\tspec.setState(types.SpecStateSkipped)\n}\n\nfunc (spec *Spec) Failed() bool {\n\treturn spec.getState() == types.SpecStateFailed || spec.getState() == types.SpecStatePanicked || spec.getState() == types.SpecStateTimedOut\n}\n\nfunc (spec *Spec) Passed() bool {\n\treturn spec.getState() == types.SpecStatePassed\n}\n\nfunc (spec *Spec) Flaked() bool {\n\treturn spec.getState() == types.SpecStatePassed && spec.previousFailures\n}\n\nfunc (spec *Spec) Pending() bool {\n\treturn spec.getState() == types.SpecStatePending\n}\n\nfunc (spec *Spec) Skipped() bool {\n\treturn spec.getState() == types.SpecStateSkipped\n}\n\nfunc (spec *Spec) Focused() bool {\n\treturn spec.focused\n}\n\nfunc (spec *Spec) IsMeasurement() bool {\n\treturn spec.subject.Type() == types.SpecComponentTypeMeasure\n}\n\nfunc (spec *Spec) Summary(suiteID string) *types.SpecSummary {\n\tcomponentTexts := make([]string, len(spec.containers)+1)\n\tcomponentCodeLocations := make([]types.CodeLocation, len(spec.containers)+1)\n\n\tfor i, container := range spec.containers {\n\t\tcomponentTexts[i] = container.Text()\n\t\tcomponentCodeLocations[i] = container.CodeLocation()\n\t}\n\n\tcomponentTexts[len(spec.containers)] = spec.subject.Text()\n\tcomponentCodeLocations[len(spec.containers)] = spec.subject.CodeLocation()\n\n\trunTime := spec.runTime\n\tif runTime == 0 && !spec.startTime.IsZero() {\n\t\trunTime = time.Since(spec.startTime)\n\t}\n\n\treturn &types.SpecSummary{\n\t\tIsMeasurement: spec.IsMeasurement(),\n\t\tNumberOfSamples: spec.subject.Samples(),\n\t\tComponentTexts: componentTexts,\n\t\tComponentCodeLocations: componentCodeLocations,\n\t\tState: spec.getState(),\n\t\tRunTime: runTime,\n\t\tFailure: spec.failure,\n\t\tMeasurements: spec.measurementsReport(),\n\t\tSuiteID: suiteID,\n\t}\n}\n\nfunc (spec *Spec) ConcatenatedString() string {\n\ts := \"\"\n\tfor _, container := range spec.containers {\n\t\ts += container.Text() + \" \"\n\t}\n\n\treturn s + spec.subject.Text()\n}\n\nfunc (spec *Spec) Run(writer io.Writer) {\n\tif spec.getState() == types.SpecStateFailed {\n\t\tspec.previousFailures = true\n\t}\n\n\tspec.startTime = time.Now()\n\tdefer func() {\n\t\tspec.runTime = time.Since(spec.startTime)\n\t}()\n\n\tfor sample := 0; sample < spec.subject.Samples(); sample++ {\n\t\tspec.runSample(sample, writer)\n\n\t\tif spec.getState() != types.SpecStatePassed {\n\t\t\treturn\n\t\t}\n\t}\n}\n\nfunc (spec *Spec) getState() types.SpecState {\n\tspec.stateMutex.Lock()\n\tdefer spec.stateMutex.Unlock()\n\treturn spec.state\n}\n\nfunc (spec *Spec) setState(state types.SpecState) {\n\tspec.stateMutex.Lock()\n\tdefer spec.stateMutex.Unlock()\n\tspec.state = state\n}\n\nfunc (spec *Spec) runSample(sample int, writer io.Writer) {\n\tspec.setState(types.SpecStatePassed)\n\tspec.failure = types.SpecFailure{}\n\tinnerMostContainerIndexToUnwind := -1\n\n\tdefer func() {\n\t\tfor i := innerMostContainerIndexToUnwind; i >= 0; i-- {\n\t\t\tcontainer := spec.containers[i]\n\t\t\tfor _, justAfterEach := range container.SetupNodesOfType(types.SpecComponentTypeJustAfterEach) {\n\t\t\t\tspec.announceSetupNode(writer, \"JustAfterEach\", container, justAfterEach)\n\t\t\t\tjustAfterEachState, justAfterEachFailure := justAfterEach.Run()\n\t\t\t\tif justAfterEachState != types.SpecStatePassed && spec.state == types.SpecStatePassed {\n\t\t\t\t\tspec.state = justAfterEachState\n\t\t\t\t\tspec.failure = justAfterEachFailure\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor i := innerMostContainerIndexToUnwind; i >= 0; i-- {\n\t\t\tcontainer := spec.containers[i]\n\t\t\tfor _, afterEach := range container.SetupNodesOfType(types.SpecComponentTypeAfterEach) {\n\t\t\t\tspec.announceSetupNode(writer, \"AfterEach\", container, afterEach)\n\t\t\t\tafterEachState, afterEachFailure := afterEach.Run()\n\t\t\t\tif afterEachState != types.SpecStatePassed && spec.getState() == types.SpecStatePassed {\n\t\t\t\t\tspec.setState(afterEachState)\n\t\t\t\t\tspec.failure = afterEachFailure\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}()\n\n\tfor i, container := range spec.containers {\n\t\tinnerMostContainerIndexToUnwind = i\n\t\tfor _, beforeEach := range container.SetupNodesOfType(types.SpecComponentTypeBeforeEach) {\n\t\t\tspec.announceSetupNode(writer, \"BeforeEach\", container, beforeEach)\n\t\t\ts, f := beforeEach.Run()\n\t\t\tspec.failure = f\n\t\t\tspec.setState(s)\n\t\t\tif spec.getState() != types.SpecStatePassed {\n\t\t\t\treturn\n\t\t\t}\n\t\t}\n\t}\n\n\tfor _, container := range spec.containers {\n\t\tfor _, justBeforeEach := range container.SetupNodesOfType(types.SpecComponentTypeJustBeforeEach) {\n\t\t\tspec.announceSetupNode(writer, \"JustBeforeEach\", container, justBeforeEach)\n\t\t\ts, f := justBeforeEach.Run()\n\t\t\tspec.failure = f\n\t\t\tspec.setState(s)\n\t\t\tif spec.getState() != types.SpecStatePassed {\n\t\t\t\treturn\n\t\t\t}\n\t\t}\n\t}\n\n\tspec.announceSubject(writer, spec.subject)\n\ts, f := spec.subject.Run()\n\tspec.failure = f\n\tspec.setState(s)\n}\n\nfunc (spec *Spec) announceSetupNode(writer io.Writer, nodeType string, container *containernode.ContainerNode, setupNode leafnodes.BasicNode) {\n\tif spec.announceProgress {\n\t\ts := fmt.Sprintf(\"[%s] %s\\n %s\\n\", nodeType, container.Text(), setupNode.CodeLocation().String())\n\t\twriter.Write([]byte(s))\n\t}\n}\n\nfunc (spec *Spec) announceSubject(writer io.Writer, subject leafnodes.SubjectNode) {\n\tif spec.announceProgress {\n\t\tnodeType := \"\"\n\t\tswitch subject.Type() {\n\t\tcase types.SpecComponentTypeIt:\n\t\t\tnodeType = \"It\"\n\t\tcase types.SpecComponentTypeMeasure:\n\t\t\tnodeType = \"Measure\"\n\t\t}\n\t\ts := fmt.Sprintf(\"[%s] %s\\n %s\\n\", nodeType, subject.Text(), subject.CodeLocation().String())\n\t\twriter.Write([]byte(s))\n\t}\n}\n\nfunc (spec *Spec) measurementsReport() map[string]*types.SpecMeasurement {\n\tif !spec.IsMeasurement() || spec.Failed() {\n\t\treturn map[string]*types.SpecMeasurement{}\n\t}\n\n\treturn spec.subject.(*leafnodes.MeasureNode).MeasurementsReport()\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/spec/specs.go", "content": "package spec\n\nimport (\n\t\"math/rand\"\n\t\"regexp\"\n\t\"sort\"\n\t\"strings\"\n)\n\ntype Specs struct {\n\tspecs []*Spec\n\tnames []string\n\n\thasProgrammaticFocus bool\n\tRegexScansFilePath bool\n}\n\nfunc NewSpecs(specs []*Spec) *Specs {\n\tnames := make([]string, len(specs))\n\tfor i, spec := range specs {\n\t\tnames[i] = spec.ConcatenatedString()\n\t}\n\treturn &Specs{\n\t\tspecs: specs,\n\t\tnames: names,\n\t}\n}\n\nfunc (e *Specs) Specs() []*Spec {\n\treturn e.specs\n}\n\nfunc (e *Specs) HasProgrammaticFocus() bool {\n\treturn e.hasProgrammaticFocus\n}\n\nfunc (e *Specs) Shuffle(r *rand.Rand) {\n\tsort.Sort(e)\n\tpermutation := r.Perm(len(e.specs))\n\tshuffledSpecs := make([]*Spec, len(e.specs))\n\tnames := make([]string, len(e.specs))\n\tfor i, j := range permutation {\n\t\tshuffledSpecs[i] = e.specs[j]\n\t\tnames[i] = e.names[j]\n\t}\n\te.specs = shuffledSpecs\n\te.names = names\n}\n\nfunc (e *Specs) ApplyFocus(description string, focus, skip []string) {\n\tif len(focus)+len(skip) == 0 {\n\t\te.applyProgrammaticFocus()\n\t} else {\n\t\te.applyRegExpFocusAndSkip(description, focus, skip)\n\t}\n}\n\nfunc (e *Specs) applyProgrammaticFocus() {\n\te.hasProgrammaticFocus = false\n\tfor _, spec := range e.specs {\n\t\tif spec.Focused() && !spec.Pending() {\n\t\t\te.hasProgrammaticFocus = true\n\t\t\tbreak\n\t\t}\n\t}\n\n\tif e.hasProgrammaticFocus {\n\t\tfor _, spec := range e.specs {\n\t\t\tif !spec.Focused() {\n\t\t\t\tspec.Skip()\n\t\t\t}\n\t\t}\n\t}\n}\n\n// toMatch returns a byte[] to be used by regex matchers. When adding new behaviours to the matching function,\n// this is the place which we append to.\nfunc (e *Specs) toMatch(description string, i int) []byte {\n\tif i > len(e.names) {\n\t\treturn nil\n\t}\n\tif e.RegexScansFilePath {\n\t\treturn []byte(\n\t\t\tdescription + \" \" +\n\t\t\t\te.names[i] + \" \" +\n\t\t\t\te.specs[i].subject.CodeLocation().FileName)\n\t} else {\n\t\treturn []byte(\n\t\t\tdescription + \" \" +\n\t\t\t\te.names[i])\n\t}\n}\n\nfunc (e *Specs) applyRegExpFocusAndSkip(description string, focus, skip []string) {\n\tvar focusFilter, skipFilter *regexp.Regexp\n\tif len(focus) > 0 {\n\t\tfocusFilter = regexp.MustCompile(strings.Join(focus, \"|\"))\n\t}\n\tif len(skip) > 0 {\n\t\tskipFilter = regexp.MustCompile(strings.Join(skip, \"|\"))\n\t}\n\n\tfor i, spec := range e.specs {\n\t\tmatchesFocus := true\n\t\tmatchesSkip := false\n\n\t\ttoMatch := e.toMatch(description, i)\n\n\t\tif focusFilter != nil {\n\t\t\tmatchesFocus = focusFilter.Match(toMatch)\n\t\t}\n\n\t\tif skipFilter != nil {\n\t\t\tmatchesSkip = skipFilter.Match(toMatch)\n\t\t}\n\n\t\tif !matchesFocus || matchesSkip {\n\t\t\tspec.Skip()\n\t\t}\n\t}\n}\n\nfunc (e *Specs) SkipMeasurements() {\n\tfor _, spec := range e.specs {\n\t\tif spec.IsMeasurement() {\n\t\t\tspec.Skip()\n\t\t}\n\t}\n}\n\n//sort.Interface\n\nfunc (e *Specs) Len() int {\n\treturn len(e.specs)\n}\n\nfunc (e *Specs) Less(i, j int) bool {\n\treturn e.names[i] < e.names[j]\n}\n\nfunc (e *Specs) Swap(i, j int) {\n\te.names[i], e.names[j] = e.names[j], e.names[i]\n\te.specs[i], e.specs[j] = e.specs[j], e.specs[i]\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/spec_iterator/index_computer.go", "content": "package spec_iterator\n\nfunc ParallelizedIndexRange(length int, parallelTotal int, parallelNode int) (startIndex int, count int) {\n\tif length == 0 {\n\t\treturn 0, 0\n\t}\n\n\t// We have more nodes than tests. Trivial case.\n\tif parallelTotal >= length {\n\t\tif parallelNode > length {\n\t\t\treturn 0, 0\n\t\t} else {\n\t\t\treturn parallelNode - 1, 1\n\t\t}\n\t}\n\n\t// This is the minimum amount of tests that a node will be required to run\n\tminTestsPerNode := length / parallelTotal\n\n\t// This is the maximum amount of tests that a node will be required to run\n\t// The algorithm guarantees that this would be equal to at least the minimum amount\n\t// and at most one more\n\tmaxTestsPerNode := minTestsPerNode\n\tif length%parallelTotal != 0 {\n\t\tmaxTestsPerNode++\n\t}\n\n\t// Number of nodes that will have to run the maximum amount of tests per node\n\tnumMaxLoadNodes := length % parallelTotal\n\n\t// Number of nodes that precede the current node and will have to run the maximum amount of tests per node\n\tvar numPrecedingMaxLoadNodes int\n\tif parallelNode > numMaxLoadNodes {\n\t\tnumPrecedingMaxLoadNodes = numMaxLoadNodes\n\t} else {\n\t\tnumPrecedingMaxLoadNodes = parallelNode - 1\n\t}\n\n\t// Number of nodes that precede the current node and will have to run the minimum amount of tests per node\n\tvar numPrecedingMinLoadNodes int\n\tif parallelNode <= numMaxLoadNodes {\n\t\tnumPrecedingMinLoadNodes = 0\n\t} else {\n\t\tnumPrecedingMinLoadNodes = parallelNode - numMaxLoadNodes - 1\n\t}\n\n\t// Evaluate the test start index and number of tests to run\n\tstartIndex = numPrecedingMaxLoadNodes*maxTestsPerNode + numPrecedingMinLoadNodes*minTestsPerNode\n\tif parallelNode > numMaxLoadNodes {\n\t\tcount = minTestsPerNode\n\t} else {\n\t\tcount = maxTestsPerNode\n\t}\n\treturn\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/spec_iterator/parallel_spec_iterator.go", "content": "package spec_iterator\n\nimport (\n\t\"encoding/json\"\n\t\"fmt\"\n\t\"net/http\"\n\n\t\"github.com/onsi/ginkgo/internal/spec\"\n)\n\ntype ParallelIterator struct {\n\tspecs []*spec.Spec\n\thost string\n\tclient *http.Client\n}\n\nfunc NewParallelIterator(specs []*spec.Spec, host string) *ParallelIterator {\n\treturn &ParallelIterator{\n\t\tspecs: specs,\n\t\thost: host,\n\t\tclient: &http.Client{},\n\t}\n}\n\nfunc (s *ParallelIterator) Next() (*spec.Spec, error) {\n\tresp, err := s.client.Get(s.host + \"/counter\")\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tdefer resp.Body.Close()\n\n\tif resp.StatusCode != http.StatusOK {\n\t\treturn nil, fmt.Errorf(\"unexpected status code %d\", resp.StatusCode)\n\t}\n\n\tvar counter Counter\n\terr = json.NewDecoder(resp.Body).Decode(&counter)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tif counter.Index >= len(s.specs) {\n\t\treturn nil, ErrClosed\n\t}\n\n\treturn s.specs[counter.Index], nil\n}\n\nfunc (s *ParallelIterator) NumberOfSpecsPriorToIteration() int {\n\treturn len(s.specs)\n}\n\nfunc (s *ParallelIterator) NumberOfSpecsToProcessIfKnown() (int, bool) {\n\treturn -1, false\n}\n\nfunc (s *ParallelIterator) NumberOfSpecsThatWillBeRunIfKnown() (int, bool) {\n\treturn -1, false\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/spec_iterator/serial_spec_iterator.go", "content": "package spec_iterator\n\nimport (\n\t\"github.com/onsi/ginkgo/internal/spec\"\n)\n\ntype SerialIterator struct {\n\tspecs []*spec.Spec\n\tindex int\n}\n\nfunc NewSerialIterator(specs []*spec.Spec) *SerialIterator {\n\treturn &SerialIterator{\n\t\tspecs: specs,\n\t\tindex: 0,\n\t}\n}\n\nfunc (s *SerialIterator) Next() (*spec.Spec, error) {\n\tif s.index >= len(s.specs) {\n\t\treturn nil, ErrClosed\n\t}\n\n\tspec := s.specs[s.index]\n\ts.index += 1\n\treturn spec, nil\n}\n\nfunc (s *SerialIterator) NumberOfSpecsPriorToIteration() int {\n\treturn len(s.specs)\n}\n\nfunc (s *SerialIterator) NumberOfSpecsToProcessIfKnown() (int, bool) {\n\treturn len(s.specs), true\n}\n\nfunc (s *SerialIterator) NumberOfSpecsThatWillBeRunIfKnown() (int, bool) {\n\tcount := 0\n\tfor _, s := range s.specs {\n\t\tif !s.Skipped() && !s.Pending() {\n\t\t\tcount += 1\n\t\t}\n\t}\n\treturn count, true\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/spec_iterator/sharded_parallel_spec_iterator.go", "content": "package spec_iterator\n\nimport \"github.com/onsi/ginkgo/internal/spec\"\n\ntype ShardedParallelIterator struct {\n\tspecs []*spec.Spec\n\tindex int\n\tmaxIndex int\n}\n\nfunc NewShardedParallelIterator(specs []*spec.Spec, total int, node int) *ShardedParallelIterator {\n\tstartIndex, count := ParallelizedIndexRange(len(specs), total, node)\n\n\treturn &ShardedParallelIterator{\n\t\tspecs: specs,\n\t\tindex: startIndex,\n\t\tmaxIndex: startIndex + count,\n\t}\n}\n\nfunc (s *ShardedParallelIterator) Next() (*spec.Spec, error) {\n\tif s.index >= s.maxIndex {\n\t\treturn nil, ErrClosed\n\t}\n\n\tspec := s.specs[s.index]\n\ts.index += 1\n\treturn spec, nil\n}\n\nfunc (s *ShardedParallelIterator) NumberOfSpecsPriorToIteration() int {\n\treturn len(s.specs)\n}\n\nfunc (s *ShardedParallelIterator) NumberOfSpecsToProcessIfKnown() (int, bool) {\n\treturn s.maxIndex - s.index, true\n}\n\nfunc (s *ShardedParallelIterator) NumberOfSpecsThatWillBeRunIfKnown() (int, bool) {\n\tcount := 0\n\tfor i := s.index; i < s.maxIndex; i += 1 {\n\t\tif !s.specs[i].Skipped() && !s.specs[i].Pending() {\n\t\t\tcount += 1\n\t\t}\n\t}\n\treturn count, true\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/spec_iterator/spec_iterator.go", "content": "package spec_iterator\n\nimport (\n\t\"errors\"\n\n\t\"github.com/onsi/ginkgo/internal/spec\"\n)\n\nvar ErrClosed = errors.New(\"no more specs to run\")\n\ntype SpecIterator interface {\n\tNext() (*spec.Spec, error)\n\tNumberOfSpecsPriorToIteration() int\n\tNumberOfSpecsToProcessIfKnown() (int, bool)\n\tNumberOfSpecsThatWillBeRunIfKnown() (int, bool)\n}\n\ntype Counter struct {\n\tIndex int `json:\"index\"`\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/specrunner/random_id.go", "content": "package specrunner\n\nimport (\n\t\"crypto/rand\"\n\t\"fmt\"\n)\n\nfunc randomID() string {\n\tb := make([]byte, 8)\n\t_, err := rand.Read(b)\n\tif err != nil {\n\t\treturn \"\"\n\t}\n\treturn fmt.Sprintf(\"%x-%x-%x-%x\", b[0:2], b[2:4], b[4:6], b[6:8])\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/specrunner/spec_runner.go", "content": "package specrunner\n\nimport (\n\t\"fmt\"\n\t\"os\"\n\t\"os/signal\"\n\t\"sync\"\n\t\"syscall\"\n\n\t\"github.com/onsi/ginkgo/internal/spec_iterator\"\n\n\t\"github.com/onsi/ginkgo/config\"\n\t\"github.com/onsi/ginkgo/internal/leafnodes\"\n\t\"github.com/onsi/ginkgo/internal/spec\"\n\tWriter \"github.com/onsi/ginkgo/internal/writer\"\n\t\"github.com/onsi/ginkgo/reporters\"\n\t\"github.com/onsi/ginkgo/types\"\n\n\t\"time\"\n)\n\ntype SpecRunner struct {\n\tdescription string\n\tbeforeSuiteNode leafnodes.SuiteNode\n\titerator spec_iterator.SpecIterator\n\tafterSuiteNode leafnodes.SuiteNode\n\treporters []reporters.Reporter\n\tstartTime time.Time\n\tsuiteID string\n\trunningSpec *spec.Spec\n\twriter Writer.WriterInterface\n\tconfig config.GinkgoConfigType\n\tinterrupted bool\n\tprocessedSpecs []*spec.Spec\n\tlock *sync.Mutex\n}\n\nfunc New(description string, beforeSuiteNode leafnodes.SuiteNode, iterator spec_iterator.SpecIterator, afterSuiteNode leafnodes.SuiteNode, reporters []reporters.Reporter, writer Writer.WriterInterface, config config.GinkgoConfigType) *SpecRunner {\n\treturn &SpecRunner{\n\t\tdescription: description,\n\t\tbeforeSuiteNode: beforeSuiteNode,\n\t\titerator: iterator,\n\t\tafterSuiteNode: afterSuiteNode,\n\t\treporters: reporters,\n\t\twriter: writer,\n\t\tconfig: config,\n\t\tsuiteID: randomID(),\n\t\tlock: &sync.Mutex{},\n\t}\n}\n\nfunc (runner *SpecRunner) Run() bool {\n\tif runner.config.DryRun {\n\t\trunner.performDryRun()\n\t\treturn true\n\t}\n\n\trunner.reportSuiteWillBegin()\n\tsignalRegistered := make(chan struct{})\n\tgo runner.registerForInterrupts(signalRegistered)\n\t<-signalRegistered\n\n\tsuitePassed := runner.runBeforeSuite()\n\n\tif suitePassed {\n\t\tsuitePassed = runner.runSpecs()\n\t}\n\n\trunner.blockForeverIfInterrupted()\n\n\tsuitePassed = runner.runAfterSuite() && suitePassed\n\n\trunner.reportSuiteDidEnd(suitePassed)\n\n\treturn suitePassed\n}\n\nfunc (runner *SpecRunner) performDryRun() {\n\trunner.reportSuiteWillBegin()\n\n\tif runner.beforeSuiteNode != nil {\n\t\tsummary := runner.beforeSuiteNode.Summary()\n\t\tsummary.State = types.SpecStatePassed\n\t\trunner.reportBeforeSuite(summary)\n\t}\n\n\tfor {\n\t\tspec, err := runner.iterator.Next()\n\t\tif err == spec_iterator.ErrClosed {\n\t\t\tbreak\n\t\t}\n\t\tif err != nil {\n\t\t\tfmt.Println(\"failed to iterate over tests:\\n\" + err.Error())\n\t\t\tbreak\n\t\t}\n\n\t\trunner.processedSpecs = append(runner.processedSpecs, spec)\n\n\t\tsummary := spec.Summary(runner.suiteID)\n\t\trunner.reportSpecWillRun(summary)\n\t\tif summary.State == types.SpecStateInvalid {\n\t\t\tsummary.State = types.SpecStatePassed\n\t\t}\n\t\trunner.reportSpecDidComplete(summary, false)\n\t}\n\n\tif runner.afterSuiteNode != nil {\n\t\tsummary := runner.afterSuiteNode.Summary()\n\t\tsummary.State = types.SpecStatePassed\n\t\trunner.reportAfterSuite(summary)\n\t}\n\n\trunner.reportSuiteDidEnd(true)\n}\n\nfunc (runner *SpecRunner) runBeforeSuite() bool {\n\tif runner.beforeSuiteNode == nil || runner.wasInterrupted() {\n\t\treturn true\n\t}\n\n\trunner.writer.Truncate()\n\tconf := runner.config\n\tpassed := runner.beforeSuiteNode.Run(conf.ParallelNode, conf.ParallelTotal, conf.SyncHost)\n\tif !passed {\n\t\trunner.writer.DumpOut()\n\t}\n\trunner.reportBeforeSuite(runner.beforeSuiteNode.Summary())\n\treturn passed\n}\n\nfunc (runner *SpecRunner) runAfterSuite() bool {\n\tif runner.afterSuiteNode == nil {\n\t\treturn true\n\t}\n\n\trunner.writer.Truncate()\n\tconf := runner.config\n\tpassed := runner.afterSuiteNode.Run(conf.ParallelNode, conf.ParallelTotal, conf.SyncHost)\n\tif !passed {\n\t\trunner.writer.DumpOut()\n\t}\n\trunner.reportAfterSuite(runner.afterSuiteNode.Summary())\n\treturn passed\n}\n\nfunc (runner *SpecRunner) runSpecs() bool {\n\tsuiteFailed := false\n\tskipRemainingSpecs := false\n\tfor {\n\t\tspec, err := runner.iterator.Next()\n\t\tif err == spec_iterator.ErrClosed {\n\t\t\tbreak\n\t\t}\n\t\tif err != nil {\n\t\t\tfmt.Println(\"failed to iterate over tests:\\n\" + err.Error())\n\t\t\tsuiteFailed = true\n\t\t\tbreak\n\t\t}\n\n\t\trunner.processedSpecs = append(runner.processedSpecs, spec)\n\n\t\tif runner.wasInterrupted() {\n\t\t\tbreak\n\t\t}\n\t\tif skipRemainingSpecs {\n\t\t\tspec.Skip()\n\t\t}\n\n\t\tif !spec.Skipped() && !spec.Pending() {\n\t\t\tif passed := runner.runSpec(spec); !passed {\n\t\t\t\tsuiteFailed = true\n\t\t\t}\n\t\t} else if spec.Pending() && runner.config.FailOnPending {\n\t\t\trunner.reportSpecWillRun(spec.Summary(runner.suiteID))\n\t\t\tsuiteFailed = true\n\t\t\trunner.reportSpecDidComplete(spec.Summary(runner.suiteID), spec.Failed())\n\t\t} else {\n\t\t\trunner.reportSpecWillRun(spec.Summary(runner.suiteID))\n\t\t\trunner.reportSpecDidComplete(spec.Summary(runner.suiteID), spec.Failed())\n\t\t}\n\n\t\tif spec.Failed() && runner.config.FailFast {\n\t\t\tskipRemainingSpecs = true\n\t\t}\n\t}\n\n\treturn !suiteFailed\n}\n\nfunc (runner *SpecRunner) runSpec(spec *spec.Spec) (passed bool) {\n\tmaxAttempts := 1\n\tif runner.config.FlakeAttempts > 0 {\n\t\t// uninitialized configs count as 1\n\t\tmaxAttempts = runner.config.FlakeAttempts\n\t}\n\n\tfor i := 0; i < maxAttempts; i++ {\n\t\trunner.reportSpecWillRun(spec.Summary(runner.suiteID))\n\t\trunner.runningSpec = spec\n\t\tspec.Run(runner.writer)\n\t\trunner.runningSpec = nil\n\t\trunner.reportSpecDidComplete(spec.Summary(runner.suiteID), spec.Failed())\n\t\tif !spec.Failed() {\n\t\t\treturn true\n\t\t}\n\t}\n\treturn false\n}\n\nfunc (runner *SpecRunner) CurrentSpecSummary() (*types.SpecSummary, bool) {\n\tif runner.runningSpec == nil {\n\t\treturn nil, false\n\t}\n\n\treturn runner.runningSpec.Summary(runner.suiteID), true\n}\n\nfunc (runner *SpecRunner) registerForInterrupts(signalRegistered chan struct{}) {\n\tc := make(chan os.Signal, 1)\n\tsignal.Notify(c, os.Interrupt, syscall.SIGTERM)\n\tclose(signalRegistered)\n\n\t<-c\n\tsignal.Stop(c)\n\trunner.markInterrupted()\n\tgo runner.registerForHardInterrupts()\n\trunner.writer.DumpOutWithHeader(`\nReceived interrupt. Emitting contents of GinkgoWriter...\n---------------------------------------------------------\n`)\n\tif runner.afterSuiteNode != nil {\n\t\tfmt.Fprint(os.Stderr, `\n---------------------------------------------------------\nReceived interrupt. Running AfterSuite...\n^C again to terminate immediately\n`)\n\t\trunner.runAfterSuite()\n\t}\n\trunner.reportSuiteDidEnd(false)\n\tos.Exit(1)\n}\n\nfunc (runner *SpecRunner) registerForHardInterrupts() {\n\tc := make(chan os.Signal, 1)\n\tsignal.Notify(c, os.Interrupt, syscall.SIGTERM)\n\n\t<-c\n\tfmt.Fprintln(os.Stderr, \"\\nReceived second interrupt. Shutting down.\")\n\tos.Exit(1)\n}\n\nfunc (runner *SpecRunner) blockForeverIfInterrupted() {\n\trunner.lock.Lock()\n\tinterrupted := runner.interrupted\n\trunner.lock.Unlock()\n\n\tif interrupted {\n\t\tselect {}\n\t}\n}\n\nfunc (runner *SpecRunner) markInterrupted() {\n\trunner.lock.Lock()\n\tdefer runner.lock.Unlock()\n\trunner.interrupted = true\n}\n\nfunc (runner *SpecRunner) wasInterrupted() bool {\n\trunner.lock.Lock()\n\tdefer runner.lock.Unlock()\n\treturn runner.interrupted\n}\n\nfunc (runner *SpecRunner) reportSuiteWillBegin() {\n\trunner.startTime = time.Now()\n\tsummary := runner.suiteWillBeginSummary()\n\tfor _, reporter := range runner.reporters {\n\t\treporter.SpecSuiteWillBegin(runner.config, summary)\n\t}\n}\n\nfunc (runner *SpecRunner) reportBeforeSuite(summary *types.SetupSummary) {\n\tfor _, reporter := range runner.reporters {\n\t\treporter.BeforeSuiteDidRun(summary)\n\t}\n}\n\nfunc (runner *SpecRunner) reportAfterSuite(summary *types.SetupSummary) {\n\tfor _, reporter := range runner.reporters {\n\t\treporter.AfterSuiteDidRun(summary)\n\t}\n}\n\nfunc (runner *SpecRunner) reportSpecWillRun(summary *types.SpecSummary) {\n\trunner.writer.Truncate()\n\n\tfor _, reporter := range runner.reporters {\n\t\treporter.SpecWillRun(summary)\n\t}\n}\n\nfunc (runner *SpecRunner) reportSpecDidComplete(summary *types.SpecSummary, failed bool) {\n\tif len(summary.CapturedOutput) == 0 {\n\t\tsummary.CapturedOutput = string(runner.writer.Bytes())\n\t}\n\tfor i := len(runner.reporters) - 1; i >= 1; i-- {\n\t\trunner.reporters[i].SpecDidComplete(summary)\n\t}\n\n\tif failed {\n\t\trunner.writer.DumpOut()\n\t}\n\n\trunner.reporters[0].SpecDidComplete(summary)\n}\n\nfunc (runner *SpecRunner) reportSuiteDidEnd(success bool) {\n\tsummary := runner.suiteDidEndSummary(success)\n\tsummary.RunTime = time.Since(runner.startTime)\n\tfor _, reporter := range runner.reporters {\n\t\treporter.SpecSuiteDidEnd(summary)\n\t}\n}\n\nfunc (runner *SpecRunner) countSpecsThatRanSatisfying(filter func(ex *spec.Spec) bool) (count int) {\n\tcount = 0\n\n\tfor _, spec := range runner.processedSpecs {\n\t\tif filter(spec) {\n\t\t\tcount++\n\t\t}\n\t}\n\n\treturn count\n}\n\nfunc (runner *SpecRunner) suiteDidEndSummary(success bool) *types.SuiteSummary {\n\tnumberOfSpecsThatWillBeRun := runner.countSpecsThatRanSatisfying(func(ex *spec.Spec) bool {\n\t\treturn !ex.Skipped() && !ex.Pending()\n\t})\n\n\tnumberOfPendingSpecs := runner.countSpecsThatRanSatisfying(func(ex *spec.Spec) bool {\n\t\treturn ex.Pending()\n\t})\n\n\tnumberOfSkippedSpecs := runner.countSpecsThatRanSatisfying(func(ex *spec.Spec) bool {\n\t\treturn ex.Skipped()\n\t})\n\n\tnumberOfPassedSpecs := runner.countSpecsThatRanSatisfying(func(ex *spec.Spec) bool {\n\t\treturn ex.Passed()\n\t})\n\n\tnumberOfFlakedSpecs := runner.countSpecsThatRanSatisfying(func(ex *spec.Spec) bool {\n\t\treturn ex.Flaked()\n\t})\n\n\tnumberOfFailedSpecs := runner.countSpecsThatRanSatisfying(func(ex *spec.Spec) bool {\n\t\treturn ex.Failed()\n\t})\n\n\tif runner.beforeSuiteNode != nil && !runner.beforeSuiteNode.Passed() && !runner.config.DryRun {\n\t\tvar known bool\n\t\tnumberOfSpecsThatWillBeRun, known = runner.iterator.NumberOfSpecsThatWillBeRunIfKnown()\n\t\tif !known {\n\t\t\tnumberOfSpecsThatWillBeRun = runner.iterator.NumberOfSpecsPriorToIteration()\n\t\t}\n\t\tnumberOfFailedSpecs = numberOfSpecsThatWillBeRun\n\t}\n\n\treturn &types.SuiteSummary{\n\t\tSuiteDescription: runner.description,\n\t\tSuiteSucceeded: success,\n\t\tSuiteID: runner.suiteID,\n\n\t\tNumberOfSpecsBeforeParallelization: runner.iterator.NumberOfSpecsPriorToIteration(),\n\t\tNumberOfTotalSpecs: len(runner.processedSpecs),\n\t\tNumberOfSpecsThatWillBeRun: numberOfSpecsThatWillBeRun,\n\t\tNumberOfPendingSpecs: numberOfPendingSpecs,\n\t\tNumberOfSkippedSpecs: numberOfSkippedSpecs,\n\t\tNumberOfPassedSpecs: numberOfPassedSpecs,\n\t\tNumberOfFailedSpecs: numberOfFailedSpecs,\n\t\tNumberOfFlakedSpecs: numberOfFlakedSpecs,\n\t}\n}\n\nfunc (runner *SpecRunner) suiteWillBeginSummary() *types.SuiteSummary {\n\tnumTotal, known := runner.iterator.NumberOfSpecsToProcessIfKnown()\n\tif !known {\n\t\tnumTotal = -1\n\t}\n\n\tnumToRun, known := runner.iterator.NumberOfSpecsThatWillBeRunIfKnown()\n\tif !known {\n\t\tnumToRun = -1\n\t}\n\n\treturn &types.SuiteSummary{\n\t\tSuiteDescription: runner.description,\n\t\tSuiteID: runner.suiteID,\n\n\t\tNumberOfSpecsBeforeParallelization: runner.iterator.NumberOfSpecsPriorToIteration(),\n\t\tNumberOfTotalSpecs: numTotal,\n\t\tNumberOfSpecsThatWillBeRun: numToRun,\n\t\tNumberOfPendingSpecs: -1,\n\t\tNumberOfSkippedSpecs: -1,\n\t\tNumberOfPassedSpecs: -1,\n\t\tNumberOfFailedSpecs: -1,\n\t\tNumberOfFlakedSpecs: -1,\n\t}\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/suite/suite.go", "content": "package suite\n\nimport (\n\t\"math/rand\"\n\t\"net/http\"\n\t\"time\"\n\n\t\"github.com/onsi/ginkgo/internal/spec_iterator\"\n\n\t\"github.com/onsi/ginkgo/config\"\n\t\"github.com/onsi/ginkgo/internal/containernode\"\n\t\"github.com/onsi/ginkgo/internal/failer\"\n\t\"github.com/onsi/ginkgo/internal/leafnodes\"\n\t\"github.com/onsi/ginkgo/internal/spec\"\n\t\"github.com/onsi/ginkgo/internal/specrunner\"\n\t\"github.com/onsi/ginkgo/internal/writer\"\n\t\"github.com/onsi/ginkgo/reporters\"\n\t\"github.com/onsi/ginkgo/types\"\n)\n\ntype ginkgoTestingT interface {\n\tFail()\n}\n\ntype deferredContainerNode struct {\n\ttext string\n\tbody func()\n\tflag types.FlagType\n\tcodeLocation types.CodeLocation\n}\n\ntype Suite struct {\n\ttopLevelContainer *containernode.ContainerNode\n\tcurrentContainer *containernode.ContainerNode\n\n\tdeferredContainerNodes []deferredContainerNode\n\n\tcontainerIndex int\n\tbeforeSuiteNode leafnodes.SuiteNode\n\tafterSuiteNode leafnodes.SuiteNode\n\trunner *specrunner.SpecRunner\n\tfailer *failer.Failer\n\trunning bool\n\texpandTopLevelNodes bool\n}\n\nfunc New(failer *failer.Failer) *Suite {\n\ttopLevelContainer := containernode.New(\"[Top Level]\", types.FlagTypeNone, types.CodeLocation{})\n\n\treturn &Suite{\n\t\ttopLevelContainer: topLevelContainer,\n\t\tcurrentContainer: topLevelContainer,\n\t\tfailer: failer,\n\t\tcontainerIndex: 1,\n\t\tdeferredContainerNodes: []deferredContainerNode{},\n\t}\n}\n\nfunc (suite *Suite) Run(t ginkgoTestingT, description string, reporters []reporters.Reporter, writer writer.WriterInterface, config config.GinkgoConfigType) (bool, bool) {\n\tif config.ParallelTotal < 1 {\n\t\tpanic(\"ginkgo.parallel.total must be >= 1\")\n\t}\n\n\tif config.ParallelNode > config.ParallelTotal || config.ParallelNode < 1 {\n\t\tpanic(\"ginkgo.parallel.node is one-indexed and must be <= ginkgo.parallel.total\")\n\t}\n\n\tsuite.expandTopLevelNodes = true\n\tfor _, deferredNode := range suite.deferredContainerNodes {\n\t\tsuite.PushContainerNode(deferredNode.text, deferredNode.body, deferredNode.flag, deferredNode.codeLocation)\n\t}\n\n\tr := rand.New(rand.NewSource(config.RandomSeed))\n\tsuite.topLevelContainer.Shuffle(r)\n\titerator, hasProgrammaticFocus := suite.generateSpecsIterator(description, config)\n\tsuite.runner = specrunner.New(description, suite.beforeSuiteNode, iterator, suite.afterSuiteNode, reporters, writer, config)\n\n\tsuite.running = true\n\tsuccess := suite.runner.Run()\n\tif !success {\n\t\tt.Fail()\n\t}\n\treturn success, hasProgrammaticFocus\n}\n\nfunc (suite *Suite) generateSpecsIterator(description string, config config.GinkgoConfigType) (spec_iterator.SpecIterator, bool) {\n\tspecsSlice := []*spec.Spec{}\n\tsuite.topLevelContainer.BackPropagateProgrammaticFocus()\n\tfor _, collatedNodes := range suite.topLevelContainer.Collate() {\n\t\tspecsSlice = append(specsSlice, spec.New(collatedNodes.Subject, collatedNodes.Containers, config.EmitSpecProgress))\n\t}\n\n\tspecs := spec.NewSpecs(specsSlice)\n\tspecs.RegexScansFilePath = config.RegexScansFilePath\n\n\tif config.RandomizeAllSpecs {\n\t\tspecs.Shuffle(rand.New(rand.NewSource(config.RandomSeed)))\n\t}\n\n\tspecs.ApplyFocus(description, config.FocusStrings, config.SkipStrings)\n\n\tif config.SkipMeasurements {\n\t\tspecs.SkipMeasurements()\n\t}\n\n\tvar iterator spec_iterator.SpecIterator\n\n\tif config.ParallelTotal > 1 {\n\t\titerator = spec_iterator.NewParallelIterator(specs.Specs(), config.SyncHost)\n\t\tresp, err := http.Get(config.SyncHost + \"/has-counter\")\n\t\tif err != nil || resp.StatusCode != http.StatusOK {\n\t\t\titerator = spec_iterator.NewShardedParallelIterator(specs.Specs(), config.ParallelTotal, config.ParallelNode)\n\t\t}\n\t} else {\n\t\titerator = spec_iterator.NewSerialIterator(specs.Specs())\n\t}\n\n\treturn iterator, specs.HasProgrammaticFocus()\n}\n\nfunc (suite *Suite) CurrentRunningSpecSummary() (*types.SpecSummary, bool) {\n\tif !suite.running {\n\t\treturn nil, false\n\t}\n\treturn suite.runner.CurrentSpecSummary()\n}\n\nfunc (suite *Suite) SetBeforeSuiteNode(body interface{}, codeLocation types.CodeLocation, timeout time.Duration) {\n\tif suite.beforeSuiteNode != nil {\n\t\tpanic(\"You may only call BeforeSuite once!\")\n\t}\n\tsuite.beforeSuiteNode = leafnodes.NewBeforeSuiteNode(body, codeLocation, timeout, suite.failer)\n}\n\nfunc (suite *Suite) SetAfterSuiteNode(body interface{}, codeLocation types.CodeLocation, timeout time.Duration) {\n\tif suite.afterSuiteNode != nil {\n\t\tpanic(\"You may only call AfterSuite once!\")\n\t}\n\tsuite.afterSuiteNode = leafnodes.NewAfterSuiteNode(body, codeLocation, timeout, suite.failer)\n}\n\nfunc (suite *Suite) SetSynchronizedBeforeSuiteNode(bodyA interface{}, bodyB interface{}, codeLocation types.CodeLocation, timeout time.Duration) {\n\tif suite.beforeSuiteNode != nil {\n\t\tpanic(\"You may only call BeforeSuite once!\")\n\t}\n\tsuite.beforeSuiteNode = leafnodes.NewSynchronizedBeforeSuiteNode(bodyA, bodyB, codeLocation, timeout, suite.failer)\n}\n\nfunc (suite *Suite) SetSynchronizedAfterSuiteNode(bodyA interface{}, bodyB interface{}, codeLocation types.CodeLocation, timeout time.Duration) {\n\tif suite.afterSuiteNode != nil {\n\t\tpanic(\"You may only call AfterSuite once!\")\n\t}\n\tsuite.afterSuiteNode = leafnodes.NewSynchronizedAfterSuiteNode(bodyA, bodyB, codeLocation, timeout, suite.failer)\n}\n\nfunc (suite *Suite) PushContainerNode(text string, body func(), flag types.FlagType, codeLocation types.CodeLocation) {\n\t/*\n\t\tWe defer walking the container nodes (which immediately evaluates the `body` function)\n\t\tuntil `RunSpecs` is called. We do this by storing off the deferred container nodes. Then, when\n\t\t`RunSpecs` is called we actually go through and add the container nodes to the test structure.\n\n\t\tThis allows us to defer calling all the `body` functions until _after_ the top level functions\n\t\thave been walked, _after_ func init()s have been called, and _after_ `go test` has called `flag.Parse()`.\n\n\t\tThis allows users to load up configuration information in the `TestX` go test hook just before `RunSpecs`\n\t\tis invoked and solves issues like #693 and makes the lifecycle easier to reason about.\n\n\t*/\n\tif !suite.expandTopLevelNodes {\n\t\tsuite.deferredContainerNodes = append(suite.deferredContainerNodes, deferredContainerNode{text, body, flag, codeLocation})\n\t\treturn\n\t}\n\n\tcontainer := containernode.New(text, flag, codeLocation)\n\tsuite.currentContainer.PushContainerNode(container)\n\n\tpreviousContainer := suite.currentContainer\n\tsuite.currentContainer = container\n\tsuite.containerIndex++\n\n\tbody()\n\n\tsuite.containerIndex--\n\tsuite.currentContainer = previousContainer\n}\n\nfunc (suite *Suite) PushItNode(text string, body interface{}, flag types.FlagType, codeLocation types.CodeLocation, timeout time.Duration) {\n\tif suite.running {\n\t\tsuite.failer.Fail(\"You may only call It from within a Describe, Context or When\", codeLocation)\n\t}\n\tsuite.currentContainer.PushSubjectNode(leafnodes.NewItNode(text, body, flag, codeLocation, timeout, suite.failer, suite.containerIndex))\n}\n\nfunc (suite *Suite) PushMeasureNode(text string, body interface{}, flag types.FlagType, codeLocation types.CodeLocation, samples int) {\n\tif suite.running {\n\t\tsuite.failer.Fail(\"You may only call Measure from within a Describe, Context or When\", codeLocation)\n\t}\n\tsuite.currentContainer.PushSubjectNode(leafnodes.NewMeasureNode(text, body, flag, codeLocation, samples, suite.failer, suite.containerIndex))\n}\n\nfunc (suite *Suite) PushBeforeEachNode(body interface{}, codeLocation types.CodeLocation, timeout time.Duration) {\n\tif suite.running {\n\t\tsuite.failer.Fail(\"You may only call BeforeEach from within a Describe, Context or When\", codeLocation)\n\t}\n\tsuite.currentContainer.PushSetupNode(leafnodes.NewBeforeEachNode(body, codeLocation, timeout, suite.failer, suite.containerIndex))\n}\n\nfunc (suite *Suite) PushJustBeforeEachNode(body interface{}, codeLocation types.CodeLocation, timeout time.Duration) {\n\tif suite.running {\n\t\tsuite.failer.Fail(\"You may only call JustBeforeEach from within a Describe, Context or When\", codeLocation)\n\t}\n\tsuite.currentContainer.PushSetupNode(leafnodes.NewJustBeforeEachNode(body, codeLocation, timeout, suite.failer, suite.containerIndex))\n}\n\nfunc (suite *Suite) PushJustAfterEachNode(body interface{}, codeLocation types.CodeLocation, timeout time.Duration) {\n\tif suite.running {\n\t\tsuite.failer.Fail(\"You may only call JustAfterEach from within a Describe or Context\", codeLocation)\n\t}\n\tsuite.currentContainer.PushSetupNode(leafnodes.NewJustAfterEachNode(body, codeLocation, timeout, suite.failer, suite.containerIndex))\n}\n\nfunc (suite *Suite) PushAfterEachNode(body interface{}, codeLocation types.CodeLocation, timeout time.Duration) {\n\tif suite.running {\n\t\tsuite.failer.Fail(\"You may only call AfterEach from within a Describe, Context or When\", codeLocation)\n\t}\n\tsuite.currentContainer.PushSetupNode(leafnodes.NewAfterEachNode(body, codeLocation, timeout, suite.failer, suite.containerIndex))\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/testingtproxy/testing_t_proxy.go", "content": "package testingtproxy\n\nimport (\n\t\"fmt\"\n\t\"io\"\n)\n\ntype failFunc func(message string, callerSkip ...int)\ntype skipFunc func(message string, callerSkip ...int)\ntype failedFunc func() bool\ntype nameFunc func() string\n\nfunc New(writer io.Writer, fail failFunc, skip skipFunc, failed failedFunc, name nameFunc, offset int) *ginkgoTestingTProxy {\n\treturn &ginkgoTestingTProxy{\n\t\tfail: fail,\n\t\toffset: offset,\n\t\twriter: writer,\n\t\tskip: skip,\n\t\tfailed: failed,\n\t\tname: name,\n\t}\n}\n\ntype ginkgoTestingTProxy struct {\n\tfail failFunc\n\tskip skipFunc\n\tfailed failedFunc\n\tname nameFunc\n\toffset int\n\twriter io.Writer\n}\n\nfunc (t *ginkgoTestingTProxy) Cleanup(func()) {\n\t// No-op\n}\n\nfunc (t *ginkgoTestingTProxy) Setenv(kev, value string) {\n\tfmt.Println(\"Setenv is a noop for Ginkgo at the moment but will be implemented in V2\")\n\t// No-op until Cleanup is implemented\n}\n\nfunc (t *ginkgoTestingTProxy) Error(args ...interface{}) {\n\tt.fail(fmt.Sprintln(args...), t.offset)\n}\n\nfunc (t *ginkgoTestingTProxy) Errorf(format string, args ...interface{}) {\n\tt.fail(fmt.Sprintf(format, args...), t.offset)\n}\n\nfunc (t *ginkgoTestingTProxy) Fail() {\n\tt.fail(\"failed\", t.offset)\n}\n\nfunc (t *ginkgoTestingTProxy) FailNow() {\n\tt.fail(\"failed\", t.offset)\n}\n\nfunc (t *ginkgoTestingTProxy) Failed() bool {\n\treturn t.failed()\n}\n\nfunc (t *ginkgoTestingTProxy) Fatal(args ...interface{}) {\n\tt.fail(fmt.Sprintln(args...), t.offset)\n}\n\nfunc (t *ginkgoTestingTProxy) Fatalf(format string, args ...interface{}) {\n\tt.fail(fmt.Sprintf(format, args...), t.offset)\n}\n\nfunc (t *ginkgoTestingTProxy) Helper() {\n\t// No-op\n}\n\nfunc (t *ginkgoTestingTProxy) Log(args ...interface{}) {\n\tfmt.Fprintln(t.writer, args...)\n}\n\nfunc (t *ginkgoTestingTProxy) Logf(format string, args ...interface{}) {\n\tt.Log(fmt.Sprintf(format, args...))\n}\n\nfunc (t *ginkgoTestingTProxy) Name() string {\n\treturn t.name()\n}\n\nfunc (t *ginkgoTestingTProxy) Parallel() {\n\t// No-op\n}\n\nfunc (t *ginkgoTestingTProxy) Skip(args ...interface{}) {\n\tt.skip(fmt.Sprintln(args...), t.offset)\n}\n\nfunc (t *ginkgoTestingTProxy) SkipNow() {\n\tt.skip(\"skip\", t.offset)\n}\n\nfunc (t *ginkgoTestingTProxy) Skipf(format string, args ...interface{}) {\n\tt.skip(fmt.Sprintf(format, args...), t.offset)\n}\n\nfunc (t *ginkgoTestingTProxy) Skipped() bool {\n\treturn false\n}\n\nfunc (t *ginkgoTestingTProxy) TempDir() string {\n\t// No-op\n\treturn \"\"\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/writer/fake_writer.go", "content": "package writer\n\ntype FakeGinkgoWriter struct {\n\tEventStream []string\n}\n\nfunc NewFake() *FakeGinkgoWriter {\n\treturn &FakeGinkgoWriter{\n\t\tEventStream: []string{},\n\t}\n}\n\nfunc (writer *FakeGinkgoWriter) AddEvent(event string) {\n\twriter.EventStream = append(writer.EventStream, event)\n}\n\nfunc (writer *FakeGinkgoWriter) Truncate() {\n\twriter.EventStream = append(writer.EventStream, \"TRUNCATE\")\n}\n\nfunc (writer *FakeGinkgoWriter) DumpOut() {\n\twriter.EventStream = append(writer.EventStream, \"DUMP\")\n}\n\nfunc (writer *FakeGinkgoWriter) DumpOutWithHeader(header string) {\n\twriter.EventStream = append(writer.EventStream, \"DUMP_WITH_HEADER: \"+header)\n}\n\nfunc (writer *FakeGinkgoWriter) Bytes() []byte {\n\twriter.EventStream = append(writer.EventStream, \"BYTES\")\n\treturn nil\n}\n\nfunc (writer *FakeGinkgoWriter) Write(data []byte) (n int, err error) {\n\treturn 0, nil\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/internal/writer/writer.go", "content": "package writer\n\nimport (\n\t\"bytes\"\n\t\"io\"\n\t\"sync\"\n)\n\ntype WriterInterface interface {\n\tio.Writer\n\n\tTruncate()\n\tDumpOut()\n\tDumpOutWithHeader(header string)\n\tBytes() []byte\n}\n\ntype Writer struct {\n\tbuffer *bytes.Buffer\n\toutWriter io.Writer\n\tlock *sync.Mutex\n\tstream bool\n\tredirector io.Writer\n}\n\nfunc New(outWriter io.Writer) *Writer {\n\treturn &Writer{\n\t\tbuffer: &bytes.Buffer{},\n\t\tlock: &sync.Mutex{},\n\t\toutWriter: outWriter,\n\t\tstream: true,\n\t}\n}\n\nfunc (w *Writer) AndRedirectTo(writer io.Writer) {\n\tw.redirector = writer\n}\n\nfunc (w *Writer) SetStream(stream bool) {\n\tw.lock.Lock()\n\tdefer w.lock.Unlock()\n\tw.stream = stream\n}\n\nfunc (w *Writer) Write(b []byte) (n int, err error) {\n\tw.lock.Lock()\n\tdefer w.lock.Unlock()\n\n\tn, err = w.buffer.Write(b)\n\tif w.redirector != nil {\n\t\tw.redirector.Write(b)\n\t}\n\tif w.stream {\n\t\treturn w.outWriter.Write(b)\n\t}\n\treturn n, err\n}\n\nfunc (w *Writer) Truncate() {\n\tw.lock.Lock()\n\tdefer w.lock.Unlock()\n\tw.buffer.Reset()\n}\n\nfunc (w *Writer) DumpOut() {\n\tw.lock.Lock()\n\tdefer w.lock.Unlock()\n\tif !w.stream {\n\t\tw.buffer.WriteTo(w.outWriter)\n\t}\n}\n\nfunc (w *Writer) Bytes() []byte {\n\tw.lock.Lock()\n\tdefer w.lock.Unlock()\n\tb := w.buffer.Bytes()\n\tcopied := make([]byte, len(b))\n\tcopy(copied, b)\n\treturn copied\n}\n\nfunc (w *Writer) DumpOutWithHeader(header string) {\n\tw.lock.Lock()\n\tdefer w.lock.Unlock()\n\tif !w.stream && w.buffer.Len() > 0 {\n\t\tw.outWriter.Write([]byte(header))\n\t\tw.buffer.WriteTo(w.outWriter)\n\t}\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/reporters/default_reporter.go", "content": "/*\nGinkgo's Default Reporter\n\nA number of command line flags are available to tweak Ginkgo's default output.\n\nThese are documented [here](http://onsi.github.io/ginkgo/#running_tests)\n*/\npackage reporters\n\nimport (\n\t\"github.com/onsi/ginkgo/config\"\n\t\"github.com/onsi/ginkgo/reporters/stenographer\"\n\t\"github.com/onsi/ginkgo/types\"\n)\n\ntype DefaultReporter struct {\n\tconfig config.DefaultReporterConfigType\n\tstenographer stenographer.Stenographer\n\tspecSummaries []*types.SpecSummary\n}\n\nfunc NewDefaultReporter(config config.DefaultReporterConfigType, stenographer stenographer.Stenographer) *DefaultReporter {\n\treturn &DefaultReporter{\n\t\tconfig: config,\n\t\tstenographer: stenographer,\n\t}\n}\n\nfunc (reporter *DefaultReporter) SpecSuiteWillBegin(config config.GinkgoConfigType, summary *types.SuiteSummary) {\n\treporter.stenographer.AnnounceSuite(summary.SuiteDescription, config.RandomSeed, config.RandomizeAllSpecs, reporter.config.Succinct)\n\tif config.ParallelTotal > 1 {\n\t\treporter.stenographer.AnnounceParallelRun(config.ParallelNode, config.ParallelTotal, reporter.config.Succinct)\n\t} else {\n\t\treporter.stenographer.AnnounceNumberOfSpecs(summary.NumberOfSpecsThatWillBeRun, summary.NumberOfTotalSpecs, reporter.config.Succinct)\n\t}\n}\n\nfunc (reporter *DefaultReporter) BeforeSuiteDidRun(setupSummary *types.SetupSummary) {\n\tif setupSummary.State != types.SpecStatePassed {\n\t\treporter.stenographer.AnnounceBeforeSuiteFailure(setupSummary, reporter.config.Succinct, reporter.config.FullTrace)\n\t}\n}\n\nfunc (reporter *DefaultReporter) AfterSuiteDidRun(setupSummary *types.SetupSummary) {\n\tif setupSummary.State != types.SpecStatePassed {\n\t\treporter.stenographer.AnnounceAfterSuiteFailure(setupSummary, reporter.config.Succinct, reporter.config.FullTrace)\n\t}\n}\n\nfunc (reporter *DefaultReporter) SpecWillRun(specSummary *types.SpecSummary) {\n\tif reporter.config.Verbose && !reporter.config.Succinct && specSummary.State != types.SpecStatePending && specSummary.State != types.SpecStateSkipped {\n\t\treporter.stenographer.AnnounceSpecWillRun(specSummary)\n\t}\n}\n\nfunc (reporter *DefaultReporter) SpecDidComplete(specSummary *types.SpecSummary) {\n\tswitch specSummary.State {\n\tcase types.SpecStatePassed:\n\t\tif specSummary.IsMeasurement {\n\t\t\treporter.stenographer.AnnounceSuccessfulMeasurement(specSummary, reporter.config.Succinct)\n\t\t} else if specSummary.RunTime.Seconds() >= reporter.config.SlowSpecThreshold {\n\t\t\treporter.stenographer.AnnounceSuccessfulSlowSpec(specSummary, reporter.config.Succinct)\n\t\t} else {\n\t\t\treporter.stenographer.AnnounceSuccessfulSpec(specSummary)\n\t\t\tif reporter.config.ReportPassed {\n\t\t\t\treporter.stenographer.AnnounceCapturedOutput(specSummary.CapturedOutput)\n\t\t\t}\n\t\t}\n\tcase types.SpecStatePending:\n\t\treporter.stenographer.AnnouncePendingSpec(specSummary, reporter.config.NoisyPendings && !reporter.config.Succinct)\n\tcase types.SpecStateSkipped:\n\t\treporter.stenographer.AnnounceSkippedSpec(specSummary, reporter.config.Succinct || !reporter.config.NoisySkippings, reporter.config.FullTrace)\n\tcase types.SpecStateTimedOut:\n\t\treporter.stenographer.AnnounceSpecTimedOut(specSummary, reporter.config.Succinct, reporter.config.FullTrace)\n\tcase types.SpecStatePanicked:\n\t\treporter.stenographer.AnnounceSpecPanicked(specSummary, reporter.config.Succinct, reporter.config.FullTrace)\n\tcase types.SpecStateFailed:\n\t\treporter.stenographer.AnnounceSpecFailed(specSummary, reporter.config.Succinct, reporter.config.FullTrace)\n\t}\n\n\treporter.specSummaries = append(reporter.specSummaries, specSummary)\n}\n\nfunc (reporter *DefaultReporter) SpecSuiteDidEnd(summary *types.SuiteSummary) {\n\treporter.stenographer.SummarizeFailures(reporter.specSummaries)\n\treporter.stenographer.AnnounceSpecRunCompletion(summary, reporter.config.Succinct)\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/reporters/fake_reporter.go", "content": "package reporters\n\nimport (\n\t\"github.com/onsi/ginkgo/config\"\n\t\"github.com/onsi/ginkgo/types\"\n)\n\n//FakeReporter is useful for testing purposes\ntype FakeReporter struct {\n\tConfig config.GinkgoConfigType\n\n\tBeginSummary *types.SuiteSummary\n\tBeforeSuiteSummary *types.SetupSummary\n\tSpecWillRunSummaries []*types.SpecSummary\n\tSpecSummaries []*types.SpecSummary\n\tAfterSuiteSummary *types.SetupSummary\n\tEndSummary *types.SuiteSummary\n\n\tSpecWillRunStub func(specSummary *types.SpecSummary)\n\tSpecDidCompleteStub func(specSummary *types.SpecSummary)\n}\n\nfunc NewFakeReporter() *FakeReporter {\n\treturn &FakeReporter{\n\t\tSpecWillRunSummaries: make([]*types.SpecSummary, 0),\n\t\tSpecSummaries: make([]*types.SpecSummary, 0),\n\t}\n}\n\nfunc (fakeR *FakeReporter) SpecSuiteWillBegin(config config.GinkgoConfigType, summary *types.SuiteSummary) {\n\tfakeR.Config = config\n\tfakeR.BeginSummary = summary\n}\n\nfunc (fakeR *FakeReporter) BeforeSuiteDidRun(setupSummary *types.SetupSummary) {\n\tfakeR.BeforeSuiteSummary = setupSummary\n}\n\nfunc (fakeR *FakeReporter) SpecWillRun(specSummary *types.SpecSummary) {\n\tif fakeR.SpecWillRunStub != nil {\n\t\tfakeR.SpecWillRunStub(specSummary)\n\t}\n\tfakeR.SpecWillRunSummaries = append(fakeR.SpecWillRunSummaries, specSummary)\n}\n\nfunc (fakeR *FakeReporter) SpecDidComplete(specSummary *types.SpecSummary) {\n\tif fakeR.SpecDidCompleteStub != nil {\n\t\tfakeR.SpecDidCompleteStub(specSummary)\n\t}\n\tfakeR.SpecSummaries = append(fakeR.SpecSummaries, specSummary)\n}\n\nfunc (fakeR *FakeReporter) AfterSuiteDidRun(setupSummary *types.SetupSummary) {\n\tfakeR.AfterSuiteSummary = setupSummary\n}\n\nfunc (fakeR *FakeReporter) SpecSuiteDidEnd(summary *types.SuiteSummary) {\n\tfakeR.EndSummary = summary\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/reporters/junit_reporter.go", "content": "/*\n\nJUnit XML Reporter for Ginkgo\n\nFor usage instructions: http://onsi.github.io/ginkgo/#generating_junit_xml_output\n\n*/\n\npackage reporters\n\nimport (\n\t\"encoding/xml\"\n\t\"fmt\"\n\t\"math\"\n\t\"os\"\n\t\"path/filepath\"\n\t\"strings\"\n\n\t\"github.com/onsi/ginkgo/config\"\n\t\"github.com/onsi/ginkgo/types\"\n)\n\ntype JUnitTestSuite struct {\n\tXMLName xml.Name `xml:\"testsuite\"`\n\tTestCases []JUnitTestCase `xml:\"testcase\"`\n\tName string `xml:\"name,attr\"`\n\tTests int `xml:\"tests,attr\"`\n\tFailures int `xml:\"failures,attr\"`\n\tErrors int `xml:\"errors,attr\"`\n\tTime float64 `xml:\"time,attr\"`\n}\n\ntype JUnitTestCase struct {\n\tName string `xml:\"name,attr\"`\n\tClassName string `xml:\"classname,attr\"`\n\tFailureMessage *JUnitFailureMessage `xml:\"failure,omitempty\"`\n\tSkipped *JUnitSkipped `xml:\"skipped,omitempty\"`\n\tTime float64 `xml:\"time,attr\"`\n\tSystemOut string `xml:\"system-out,omitempty\"`\n}\n\ntype JUnitFailureMessage struct {\n\tType string `xml:\"type,attr\"`\n\tMessage string `xml:\",chardata\"`\n}\n\ntype JUnitSkipped struct {\n\tMessage string `xml:\",chardata\"`\n}\n\ntype JUnitReporter struct {\n\tsuite JUnitTestSuite\n\tfilename string\n\ttestSuiteName string\n\tReporterConfig config.DefaultReporterConfigType\n}\n\n//NewJUnitReporter creates a new JUnit XML reporter. The XML will be stored in the passed in filename.\nfunc NewJUnitReporter(filename string) *JUnitReporter {\n\treturn &JUnitReporter{\n\t\tfilename: filename,\n\t}\n}\n\nfunc (reporter *JUnitReporter) SpecSuiteWillBegin(ginkgoConfig config.GinkgoConfigType, summary *types.SuiteSummary) {\n\treporter.suite = JUnitTestSuite{\n\t\tName: summary.SuiteDescription,\n\t\tTestCases: []JUnitTestCase{},\n\t}\n\treporter.testSuiteName = summary.SuiteDescription\n\treporter.ReporterConfig = config.DefaultReporterConfig\n}\n\nfunc (reporter *JUnitReporter) SpecWillRun(specSummary *types.SpecSummary) {\n}\n\nfunc (reporter *JUnitReporter) BeforeSuiteDidRun(setupSummary *types.SetupSummary) {\n\treporter.handleSetupSummary(\"BeforeSuite\", setupSummary)\n}\n\nfunc (reporter *JUnitReporter) AfterSuiteDidRun(setupSummary *types.SetupSummary) {\n\treporter.handleSetupSummary(\"AfterSuite\", setupSummary)\n}\n\nfunc failureMessage(failure types.SpecFailure) string {\n\treturn fmt.Sprintf(\"%s\\n%s\\n%s\", failure.ComponentCodeLocation.String(), failure.Message, failure.Location.String())\n}\n\nfunc (reporter *JUnitReporter) handleSetupSummary(name string, setupSummary *types.SetupSummary) {\n\tif setupSummary.State != types.SpecStatePassed {\n\t\ttestCase := JUnitTestCase{\n\t\t\tName: name,\n\t\t\tClassName: reporter.testSuiteName,\n\t\t}\n\n\t\ttestCase.FailureMessage = &JUnitFailureMessage{\n\t\t\tType: reporter.failureTypeForState(setupSummary.State),\n\t\t\tMessage: failureMessage(setupSummary.Failure),\n\t\t}\n\t\ttestCase.SystemOut = setupSummary.CapturedOutput\n\t\ttestCase.Time = setupSummary.RunTime.Seconds()\n\t\treporter.suite.TestCases = append(reporter.suite.TestCases, testCase)\n\t}\n}\n\nfunc (reporter *JUnitReporter) SpecDidComplete(specSummary *types.SpecSummary) {\n\ttestCase := JUnitTestCase{\n\t\tName: strings.Join(specSummary.ComponentTexts[1:], \" \"),\n\t\tClassName: reporter.testSuiteName,\n\t}\n\tif reporter.ReporterConfig.ReportPassed && specSummary.State == types.SpecStatePassed {\n\t\ttestCase.SystemOut = specSummary.CapturedOutput\n\t}\n\tif specSummary.State == types.SpecStateFailed || specSummary.State == types.SpecStateTimedOut || specSummary.State == types.SpecStatePanicked {\n\t\ttestCase.FailureMessage = &JUnitFailureMessage{\n\t\t\tType: reporter.failureTypeForState(specSummary.State),\n\t\t\tMessage: failureMessage(specSummary.Failure),\n\t\t}\n\t\tif specSummary.State == types.SpecStatePanicked {\n\t\t\ttestCase.FailureMessage.Message += fmt.Sprintf(\"\\n\\nPanic: %s\\n\\nFull stack:\\n%s\",\n\t\t\t\tspecSummary.Failure.ForwardedPanic,\n\t\t\t\tspecSummary.Failure.Location.FullStackTrace)\n\t\t}\n\t\ttestCase.SystemOut = specSummary.CapturedOutput\n\t}\n\tif specSummary.State == types.SpecStateSkipped || specSummary.State == types.SpecStatePending {\n\t\ttestCase.Skipped = &JUnitSkipped{}\n\t\tif specSummary.Failure.Message != \"\" {\n\t\t\ttestCase.Skipped.Message = failureMessage(specSummary.Failure)\n\t\t}\n\t}\n\ttestCase.Time = specSummary.RunTime.Seconds()\n\treporter.suite.TestCases = append(reporter.suite.TestCases, testCase)\n}\n\nfunc (reporter *JUnitReporter) SpecSuiteDidEnd(summary *types.SuiteSummary) {\n\treporter.suite.Tests = summary.NumberOfSpecsThatWillBeRun\n\treporter.suite.Time = math.Trunc(summary.RunTime.Seconds()*1000) / 1000\n\treporter.suite.Failures = summary.NumberOfFailedSpecs\n\treporter.suite.Errors = 0\n\tif reporter.ReporterConfig.ReportFile != \"\" {\n\t\treporter.filename = reporter.ReporterConfig.ReportFile\n\t\tfmt.Printf(\"\\nJUnit path was configured: %s\\n\", reporter.filename)\n\t}\n\tfilePath, _ := filepath.Abs(reporter.filename)\n\tdirPath := filepath.Dir(filePath)\n\terr := os.MkdirAll(dirPath, os.ModePerm)\n\tif err != nil {\n\t\tfmt.Printf(\"\\nFailed to create JUnit directory: %s\\n\\t%s\", filePath, err.Error())\n\t}\n\tfile, err := os.Create(filePath)\n\tif err != nil {\n\t\tfmt.Fprintf(os.Stderr, \"Failed to create JUnit report file: %s\\n\\t%s\", filePath, err.Error())\n\t}\n\tdefer file.Close()\n\tfile.WriteString(xml.Header)\n\tencoder := xml.NewEncoder(file)\n\tencoder.Indent(\" \", \" \")\n\terr = encoder.Encode(reporter.suite)\n\tif err == nil {\n\t\tfmt.Fprintf(os.Stdout, \"\\nJUnit report was created: %s\\n\", filePath)\n\t} else {\n\t\tfmt.Fprintf(os.Stderr,\"\\nFailed to generate JUnit report data:\\n\\t%s\", err.Error())\n\t}\n}\n\nfunc (reporter *JUnitReporter) failureTypeForState(state types.SpecState) string {\n\tswitch state {\n\tcase types.SpecStateFailed:\n\t\treturn \"Failure\"\n\tcase types.SpecStateTimedOut:\n\t\treturn \"Timeout\"\n\tcase types.SpecStatePanicked:\n\t\treturn \"Panic\"\n\tdefault:\n\t\treturn \"\"\n\t}\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/reporters/reporter.go", "content": "package reporters\n\nimport (\n\t\"github.com/onsi/ginkgo/config\"\n\t\"github.com/onsi/ginkgo/types\"\n)\n\ntype Reporter interface {\n\tSpecSuiteWillBegin(config config.GinkgoConfigType, summary *types.SuiteSummary)\n\tBeforeSuiteDidRun(setupSummary *types.SetupSummary)\n\tSpecWillRun(specSummary *types.SpecSummary)\n\tSpecDidComplete(specSummary *types.SpecSummary)\n\tAfterSuiteDidRun(setupSummary *types.SetupSummary)\n\tSpecSuiteDidEnd(summary *types.SuiteSummary)\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/reporters/stenographer/console_logging.go", "content": "package stenographer\n\nimport (\n\t\"fmt\"\n\t\"strings\"\n)\n\nfunc (s *consoleStenographer) colorize(colorCode string, format string, args ...interface{}) string {\n\tvar out string\n\n\tif len(args) > 0 {\n\t\tout = fmt.Sprintf(format, args...)\n\t} else {\n\t\tout = format\n\t}\n\n\tif s.color {\n\t\treturn fmt.Sprintf(\"%s%s%s\", colorCode, out, defaultStyle)\n\t} else {\n\t\treturn out\n\t}\n}\n\nfunc (s *consoleStenographer) printBanner(text string, bannerCharacter string) {\n\tfmt.Fprintln(s.w, text)\n\tfmt.Fprintln(s.w, strings.Repeat(bannerCharacter, len(text)))\n}\n\nfunc (s *consoleStenographer) printNewLine() {\n\tfmt.Fprintln(s.w, \"\")\n}\n\nfunc (s *consoleStenographer) printDelimiter() {\n\tfmt.Fprintln(s.w, s.colorize(grayColor, \"%s\", strings.Repeat(\"-\", 30)))\n}\n\nfunc (s *consoleStenographer) print(indentation int, format string, args ...interface{}) {\n\tfmt.Fprint(s.w, s.indent(indentation, format, args...))\n}\n\nfunc (s *consoleStenographer) println(indentation int, format string, args ...interface{}) {\n\tfmt.Fprintln(s.w, s.indent(indentation, format, args...))\n}\n\nfunc (s *consoleStenographer) indent(indentation int, format string, args ...interface{}) string {\n\tvar text string\n\n\tif len(args) > 0 {\n\t\ttext = fmt.Sprintf(format, args...)\n\t} else {\n\t\ttext = format\n\t}\n\n\tstringArray := strings.Split(text, \"\\n\")\n\tpadding := \"\"\n\tif indentation >= 0 {\n\t\tpadding = strings.Repeat(\" \", indentation)\n\t}\n\tfor i, s := range stringArray {\n\t\tstringArray[i] = fmt.Sprintf(\"%s%s\", padding, s)\n\t}\n\n\treturn strings.Join(stringArray, \"\\n\")\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/reporters/stenographer/fake_stenographer.go", "content": "package stenographer\n\nimport (\n\t\"sync\"\n\n\t\"github.com/onsi/ginkgo/types\"\n)\n\nfunc NewFakeStenographerCall(method string, args ...interface{}) FakeStenographerCall {\n\treturn FakeStenographerCall{\n\t\tMethod: method,\n\t\tArgs: args,\n\t}\n}\n\ntype FakeStenographer struct {\n\tcalls []FakeStenographerCall\n\tlock *sync.Mutex\n}\n\ntype FakeStenographerCall struct {\n\tMethod string\n\tArgs []interface{}\n}\n\nfunc NewFakeStenographer() *FakeStenographer {\n\tstenographer := &FakeStenographer{\n\t\tlock: &sync.Mutex{},\n\t}\n\tstenographer.Reset()\n\treturn stenographer\n}\n\nfunc (stenographer *FakeStenographer) Calls() []FakeStenographerCall {\n\tstenographer.lock.Lock()\n\tdefer stenographer.lock.Unlock()\n\n\treturn stenographer.calls\n}\n\nfunc (stenographer *FakeStenographer) Reset() {\n\tstenographer.lock.Lock()\n\tdefer stenographer.lock.Unlock()\n\n\tstenographer.calls = make([]FakeStenographerCall, 0)\n}\n\nfunc (stenographer *FakeStenographer) CallsTo(method string) []FakeStenographerCall {\n\tstenographer.lock.Lock()\n\tdefer stenographer.lock.Unlock()\n\n\tresults := make([]FakeStenographerCall, 0)\n\tfor _, call := range stenographer.calls {\n\t\tif call.Method == method {\n\t\t\tresults = append(results, call)\n\t\t}\n\t}\n\n\treturn results\n}\n\nfunc (stenographer *FakeStenographer) registerCall(method string, args ...interface{}) {\n\tstenographer.lock.Lock()\n\tdefer stenographer.lock.Unlock()\n\n\tstenographer.calls = append(stenographer.calls, NewFakeStenographerCall(method, args...))\n}\n\nfunc (stenographer *FakeStenographer) AnnounceSuite(description string, randomSeed int64, randomizingAll bool, succinct bool) {\n\tstenographer.registerCall(\"AnnounceSuite\", description, randomSeed, randomizingAll, succinct)\n}\n\nfunc (stenographer *FakeStenographer) AnnounceAggregatedParallelRun(nodes int, succinct bool) {\n\tstenographer.registerCall(\"AnnounceAggregatedParallelRun\", nodes, succinct)\n}\n\nfunc (stenographer *FakeStenographer) AnnounceParallelRun(node int, nodes int, succinct bool) {\n\tstenographer.registerCall(\"AnnounceParallelRun\", node, nodes, succinct)\n}\n\nfunc (stenographer *FakeStenographer) AnnounceNumberOfSpecs(specsToRun int, total int, succinct bool) {\n\tstenographer.registerCall(\"AnnounceNumberOfSpecs\", specsToRun, total, succinct)\n}\n\nfunc (stenographer *FakeStenographer) AnnounceTotalNumberOfSpecs(total int, succinct bool) {\n\tstenographer.registerCall(\"AnnounceTotalNumberOfSpecs\", total, succinct)\n}\n\nfunc (stenographer *FakeStenographer) AnnounceSpecRunCompletion(summary *types.SuiteSummary, succinct bool) {\n\tstenographer.registerCall(\"AnnounceSpecRunCompletion\", summary, succinct)\n}\n\nfunc (stenographer *FakeStenographer) AnnounceSpecWillRun(spec *types.SpecSummary) {\n\tstenographer.registerCall(\"AnnounceSpecWillRun\", spec)\n}\n\nfunc (stenographer *FakeStenographer) AnnounceBeforeSuiteFailure(summary *types.SetupSummary, succinct bool, fullTrace bool) {\n\tstenographer.registerCall(\"AnnounceBeforeSuiteFailure\", summary, succinct, fullTrace)\n}\n\nfunc (stenographer *FakeStenographer) AnnounceAfterSuiteFailure(summary *types.SetupSummary, succinct bool, fullTrace bool) {\n\tstenographer.registerCall(\"AnnounceAfterSuiteFailure\", summary, succinct, fullTrace)\n}\nfunc (stenographer *FakeStenographer) AnnounceCapturedOutput(output string) {\n\tstenographer.registerCall(\"AnnounceCapturedOutput\", output)\n}\n\nfunc (stenographer *FakeStenographer) AnnounceSuccessfulSpec(spec *types.SpecSummary) {\n\tstenographer.registerCall(\"AnnounceSuccessfulSpec\", spec)\n}\n\nfunc (stenographer *FakeStenographer) AnnounceSuccessfulSlowSpec(spec *types.SpecSummary, succinct bool) {\n\tstenographer.registerCall(\"AnnounceSuccessfulSlowSpec\", spec, succinct)\n}\n\nfunc (stenographer *FakeStenographer) AnnounceSuccessfulMeasurement(spec *types.SpecSummary, succinct bool) {\n\tstenographer.registerCall(\"AnnounceSuccessfulMeasurement\", spec, succinct)\n}\n\nfunc (stenographer *FakeStenographer) AnnouncePendingSpec(spec *types.SpecSummary, noisy bool) {\n\tstenographer.registerCall(\"AnnouncePendingSpec\", spec, noisy)\n}\n\nfunc (stenographer *FakeStenographer) AnnounceSkippedSpec(spec *types.SpecSummary, succinct bool, fullTrace bool) {\n\tstenographer.registerCall(\"AnnounceSkippedSpec\", spec, succinct, fullTrace)\n}\n\nfunc (stenographer *FakeStenographer) AnnounceSpecTimedOut(spec *types.SpecSummary, succinct bool, fullTrace bool) {\n\tstenographer.registerCall(\"AnnounceSpecTimedOut\", spec, succinct, fullTrace)\n}\n\nfunc (stenographer *FakeStenographer) AnnounceSpecPanicked(spec *types.SpecSummary, succinct bool, fullTrace bool) {\n\tstenographer.registerCall(\"AnnounceSpecPanicked\", spec, succinct, fullTrace)\n}\n\nfunc (stenographer *FakeStenographer) AnnounceSpecFailed(spec *types.SpecSummary, succinct bool, fullTrace bool) {\n\tstenographer.registerCall(\"AnnounceSpecFailed\", spec, succinct, fullTrace)\n}\n\nfunc (stenographer *FakeStenographer) SummarizeFailures(summaries []*types.SpecSummary) {\n\tstenographer.registerCall(\"SummarizeFailures\", summaries)\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/reporters/stenographer/stenographer.go", "content": "/*\nThe stenographer is used by Ginkgo's reporters to generate output.\n\nMove along, nothing to see here.\n*/\n\npackage stenographer\n\nimport (\n\t\"fmt\"\n\t\"io\"\n\t\"runtime\"\n\t\"strings\"\n\n\t\"github.com/onsi/ginkgo/types\"\n)\n\nconst defaultStyle = \"\\x1b[0m\"\nconst boldStyle = \"\\x1b[1m\"\nconst redColor = \"\\x1b[91m\"\nconst greenColor = \"\\x1b[32m\"\nconst yellowColor = \"\\x1b[33m\"\nconst cyanColor = \"\\x1b[36m\"\nconst grayColor = \"\\x1b[90m\"\nconst lightGrayColor = \"\\x1b[37m\"\n\ntype cursorStateType int\n\nconst (\n\tcursorStateTop cursorStateType = iota\n\tcursorStateStreaming\n\tcursorStateMidBlock\n\tcursorStateEndBlock\n)\n\ntype Stenographer interface {\n\tAnnounceSuite(description string, randomSeed int64, randomizingAll bool, succinct bool)\n\tAnnounceAggregatedParallelRun(nodes int, succinct bool)\n\tAnnounceParallelRun(node int, nodes int, succinct bool)\n\tAnnounceTotalNumberOfSpecs(total int, succinct bool)\n\tAnnounceNumberOfSpecs(specsToRun int, total int, succinct bool)\n\tAnnounceSpecRunCompletion(summary *types.SuiteSummary, succinct bool)\n\n\tAnnounceSpecWillRun(spec *types.SpecSummary)\n\tAnnounceBeforeSuiteFailure(summary *types.SetupSummary, succinct bool, fullTrace bool)\n\tAnnounceAfterSuiteFailure(summary *types.SetupSummary, succinct bool, fullTrace bool)\n\n\tAnnounceCapturedOutput(output string)\n\n\tAnnounceSuccessfulSpec(spec *types.SpecSummary)\n\tAnnounceSuccessfulSlowSpec(spec *types.SpecSummary, succinct bool)\n\tAnnounceSuccessfulMeasurement(spec *types.SpecSummary, succinct bool)\n\n\tAnnouncePendingSpec(spec *types.SpecSummary, noisy bool)\n\tAnnounceSkippedSpec(spec *types.SpecSummary, succinct bool, fullTrace bool)\n\n\tAnnounceSpecTimedOut(spec *types.SpecSummary, succinct bool, fullTrace bool)\n\tAnnounceSpecPanicked(spec *types.SpecSummary, succinct bool, fullTrace bool)\n\tAnnounceSpecFailed(spec *types.SpecSummary, succinct bool, fullTrace bool)\n\n\tSummarizeFailures(summaries []*types.SpecSummary)\n}\n\nfunc New(color bool, enableFlakes bool, writer io.Writer) Stenographer {\n\tdenoter := \"•\"\n\tif runtime.GOOS == \"windows\" {\n\t\tdenoter = \"+\"\n\t}\n\treturn &consoleStenographer{\n\t\tcolor: color,\n\t\tdenoter: denoter,\n\t\tcursorState: cursorStateTop,\n\t\tenableFlakes: enableFlakes,\n\t\tw: writer,\n\t}\n}\n\ntype consoleStenographer struct {\n\tcolor bool\n\tdenoter string\n\tcursorState cursorStateType\n\tenableFlakes bool\n\tw io.Writer\n}\n\nvar alternatingColors = []string{defaultStyle, grayColor}\n\nfunc (s *consoleStenographer) AnnounceSuite(description string, randomSeed int64, randomizingAll bool, succinct bool) {\n\tif succinct {\n\t\ts.print(0, \"[%d] %s \", randomSeed, s.colorize(boldStyle, description))\n\t\treturn\n\t}\n\ts.printBanner(fmt.Sprintf(\"Running Suite: %s\", description), \"=\")\n\ts.print(0, \"Random Seed: %s\", s.colorize(boldStyle, \"%d\", randomSeed))\n\tif randomizingAll {\n\t\ts.print(0, \" - Will randomize all specs\")\n\t}\n\ts.printNewLine()\n}\n\nfunc (s *consoleStenographer) AnnounceParallelRun(node int, nodes int, succinct bool) {\n\tif succinct {\n\t\ts.print(0, \"- node #%d \", node)\n\t\treturn\n\t}\n\ts.println(0,\n\t\t\"Parallel test node %s/%s.\",\n\t\ts.colorize(boldStyle, \"%d\", node),\n\t\ts.colorize(boldStyle, \"%d\", nodes),\n\t)\n\ts.printNewLine()\n}\n\nfunc (s *consoleStenographer) AnnounceAggregatedParallelRun(nodes int, succinct bool) {\n\tif succinct {\n\t\ts.print(0, \"- %d nodes \", nodes)\n\t\treturn\n\t}\n\ts.println(0,\n\t\t\"Running in parallel across %s nodes\",\n\t\ts.colorize(boldStyle, \"%d\", nodes),\n\t)\n\ts.printNewLine()\n}\n\nfunc (s *consoleStenographer) AnnounceNumberOfSpecs(specsToRun int, total int, succinct bool) {\n\tif succinct {\n\t\ts.print(0, \"- %d/%d specs \", specsToRun, total)\n\t\ts.stream()\n\t\treturn\n\t}\n\ts.println(0,\n\t\t\"Will run %s of %s specs\",\n\t\ts.colorize(boldStyle, \"%d\", specsToRun),\n\t\ts.colorize(boldStyle, \"%d\", total),\n\t)\n\n\ts.printNewLine()\n}\n\nfunc (s *consoleStenographer) AnnounceTotalNumberOfSpecs(total int, succinct bool) {\n\tif succinct {\n\t\ts.print(0, \"- %d specs \", total)\n\t\ts.stream()\n\t\treturn\n\t}\n\ts.println(0,\n\t\t\"Will run %s specs\",\n\t\ts.colorize(boldStyle, \"%d\", total),\n\t)\n\n\ts.printNewLine()\n}\n\nfunc (s *consoleStenographer) AnnounceSpecRunCompletion(summary *types.SuiteSummary, succinct bool) {\n\tif succinct && summary.SuiteSucceeded {\n\t\ts.print(0, \" %s %s \", s.colorize(greenColor, \"SUCCESS!\"), summary.RunTime)\n\t\treturn\n\t}\n\ts.printNewLine()\n\tcolor := greenColor\n\tif !summary.SuiteSucceeded {\n\t\tcolor = redColor\n\t}\n\ts.println(0, s.colorize(boldStyle+color, \"Ran %d of %d Specs in %.3f seconds\", summary.NumberOfSpecsThatWillBeRun, summary.NumberOfTotalSpecs, summary.RunTime.Seconds()))\n\n\tstatus := \"\"\n\tif summary.SuiteSucceeded {\n\t\tstatus = s.colorize(boldStyle+greenColor, \"SUCCESS!\")\n\t} else {\n\t\tstatus = s.colorize(boldStyle+redColor, \"FAIL!\")\n\t}\n\n\tflakes := \"\"\n\tif s.enableFlakes {\n\t\tflakes = \" | \" + s.colorize(yellowColor+boldStyle, \"%d Flaked\", summary.NumberOfFlakedSpecs)\n\t}\n\n\ts.print(0,\n\t\t\"%s -- %s | %s | %s | %s\\n\",\n\t\tstatus,\n\t\ts.colorize(greenColor+boldStyle, \"%d Passed\", summary.NumberOfPassedSpecs),\n\t\ts.colorize(redColor+boldStyle, \"%d Failed\", summary.NumberOfFailedSpecs)+flakes,\n\t\ts.colorize(yellowColor+boldStyle, \"%d Pending\", summary.NumberOfPendingSpecs),\n\t\ts.colorize(cyanColor+boldStyle, \"%d Skipped\", summary.NumberOfSkippedSpecs),\n\t)\n}\n\nfunc (s *consoleStenographer) AnnounceSpecWillRun(spec *types.SpecSummary) {\n\ts.startBlock()\n\tfor i, text := range spec.ComponentTexts[1 : len(spec.ComponentTexts)-1] {\n\t\ts.print(0, s.colorize(alternatingColors[i%2], text)+\" \")\n\t}\n\n\tindentation := 0\n\tif len(spec.ComponentTexts) > 2 {\n\t\tindentation = 1\n\t\ts.printNewLine()\n\t}\n\tindex := len(spec.ComponentTexts) - 1\n\ts.print(indentation, s.colorize(boldStyle, spec.ComponentTexts[index]))\n\ts.printNewLine()\n\ts.print(indentation, s.colorize(lightGrayColor, spec.ComponentCodeLocations[index].String()))\n\ts.printNewLine()\n\ts.midBlock()\n}\n\nfunc (s *consoleStenographer) AnnounceBeforeSuiteFailure(summary *types.SetupSummary, succinct bool, fullTrace bool) {\n\ts.announceSetupFailure(\"BeforeSuite\", summary, succinct, fullTrace)\n}\n\nfunc (s *consoleStenographer) AnnounceAfterSuiteFailure(summary *types.SetupSummary, succinct bool, fullTrace bool) {\n\ts.announceSetupFailure(\"AfterSuite\", summary, succinct, fullTrace)\n}\n\nfunc (s *consoleStenographer) announceSetupFailure(name string, summary *types.SetupSummary, succinct bool, fullTrace bool) {\n\ts.startBlock()\n\tvar message string\n\tswitch summary.State {\n\tcase types.SpecStateFailed:\n\t\tmessage = \"Failure\"\n\tcase types.SpecStatePanicked:\n\t\tmessage = \"Panic\"\n\tcase types.SpecStateTimedOut:\n\t\tmessage = \"Timeout\"\n\t}\n\n\ts.println(0, s.colorize(redColor+boldStyle, \"%s [%.3f seconds]\", message, summary.RunTime.Seconds()))\n\n\tindentation := s.printCodeLocationBlock([]string{name}, []types.CodeLocation{summary.CodeLocation}, summary.ComponentType, 0, summary.State, true)\n\n\ts.printNewLine()\n\ts.printFailure(indentation, summary.State, summary.Failure, fullTrace)\n\n\ts.endBlock()\n}\n\nfunc (s *consoleStenographer) AnnounceCapturedOutput(output string) {\n\tif output == \"\" {\n\t\treturn\n\t}\n\n\ts.startBlock()\n\ts.println(0, output)\n\ts.midBlock()\n}\n\nfunc (s *consoleStenographer) AnnounceSuccessfulSpec(spec *types.SpecSummary) {\n\ts.print(0, s.colorize(greenColor, s.denoter))\n\ts.stream()\n}\n\nfunc (s *consoleStenographer) AnnounceSuccessfulSlowSpec(spec *types.SpecSummary, succinct bool) {\n\ts.printBlockWithMessage(\n\t\ts.colorize(greenColor, \"%s [SLOW TEST:%.3f seconds]\", s.denoter, spec.RunTime.Seconds()),\n\t\t\"\",\n\t\tspec,\n\t\tsuccinct,\n\t)\n}\n\nfunc (s *consoleStenographer) AnnounceSuccessfulMeasurement(spec *types.SpecSummary, succinct bool) {\n\ts.printBlockWithMessage(\n\t\ts.colorize(greenColor, \"%s [MEASUREMENT]\", s.denoter),\n\t\ts.measurementReport(spec, succinct),\n\t\tspec,\n\t\tsuccinct,\n\t)\n}\n\nfunc (s *consoleStenographer) AnnouncePendingSpec(spec *types.SpecSummary, noisy bool) {\n\tif noisy {\n\t\ts.printBlockWithMessage(\n\t\t\ts.colorize(yellowColor, \"P [PENDING]\"),\n\t\t\t\"\",\n\t\t\tspec,\n\t\t\tfalse,\n\t\t)\n\t} else {\n\t\ts.print(0, s.colorize(yellowColor, \"P\"))\n\t\ts.stream()\n\t}\n}\n\nfunc (s *consoleStenographer) AnnounceSkippedSpec(spec *types.SpecSummary, succinct bool, fullTrace bool) {\n\t// Skips at runtime will have a non-empty spec.Failure. All others should be succinct.\n\tif succinct || spec.Failure == (types.SpecFailure{}) {\n\t\ts.print(0, s.colorize(cyanColor, \"S\"))\n\t\ts.stream()\n\t} else {\n\t\ts.startBlock()\n\t\ts.println(0, s.colorize(cyanColor+boldStyle, \"S [SKIPPING]%s [%.3f seconds]\", s.failureContext(spec.Failure.ComponentType), spec.RunTime.Seconds()))\n\n\t\tindentation := s.printCodeLocationBlock(spec.ComponentTexts, spec.ComponentCodeLocations, spec.Failure.ComponentType, spec.Failure.ComponentIndex, spec.State, succinct)\n\n\t\ts.printNewLine()\n\t\ts.printSkip(indentation, spec.Failure)\n\t\ts.endBlock()\n\t}\n}\n\nfunc (s *consoleStenographer) AnnounceSpecTimedOut(spec *types.SpecSummary, succinct bool, fullTrace bool) {\n\ts.printSpecFailure(fmt.Sprintf(\"%s... Timeout\", s.denoter), spec, succinct, fullTrace)\n}\n\nfunc (s *consoleStenographer) AnnounceSpecPanicked(spec *types.SpecSummary, succinct bool, fullTrace bool) {\n\ts.printSpecFailure(fmt.Sprintf(\"%s! Panic\", s.denoter), spec, succinct, fullTrace)\n}\n\nfunc (s *consoleStenographer) AnnounceSpecFailed(spec *types.SpecSummary, succinct bool, fullTrace bool) {\n\ts.printSpecFailure(fmt.Sprintf(\"%s Failure\", s.denoter), spec, succinct, fullTrace)\n}\n\nfunc (s *consoleStenographer) SummarizeFailures(summaries []*types.SpecSummary) {\n\tfailingSpecs := []*types.SpecSummary{}\n\n\tfor _, summary := range summaries {\n\t\tif summary.HasFailureState() {\n\t\t\tfailingSpecs = append(failingSpecs, summary)\n\t\t}\n\t}\n\n\tif len(failingSpecs) == 0 {\n\t\treturn\n\t}\n\n\ts.printNewLine()\n\ts.printNewLine()\n\tplural := \"s\"\n\tif len(failingSpecs) == 1 {\n\t\tplural = \"\"\n\t}\n\ts.println(0, s.colorize(redColor+boldStyle, \"Summarizing %d Failure%s:\", len(failingSpecs), plural))\n\tfor _, summary := range failingSpecs {\n\t\ts.printNewLine()\n\t\tif summary.HasFailureState() {\n\t\t\tif summary.TimedOut() {\n\t\t\t\ts.print(0, s.colorize(redColor+boldStyle, \"[Timeout...] \"))\n\t\t\t} else if summary.Panicked() {\n\t\t\t\ts.print(0, s.colorize(redColor+boldStyle, \"[Panic!] \"))\n\t\t\t} else if summary.Failed() {\n\t\t\t\ts.print(0, s.colorize(redColor+boldStyle, \"[Fail] \"))\n\t\t\t}\n\t\t\ts.printSpecContext(summary.ComponentTexts, summary.ComponentCodeLocations, summary.Failure.ComponentType, summary.Failure.ComponentIndex, summary.State, true)\n\t\t\ts.printNewLine()\n\t\t\ts.println(0, s.colorize(lightGrayColor, summary.Failure.Location.String()))\n\t\t}\n\t}\n}\n\nfunc (s *consoleStenographer) startBlock() {\n\tif s.cursorState == cursorStateStreaming {\n\t\ts.printNewLine()\n\t\ts.printDelimiter()\n\t} else if s.cursorState == cursorStateMidBlock {\n\t\ts.printNewLine()\n\t}\n}\n\nfunc (s *consoleStenographer) midBlock() {\n\ts.cursorState = cursorStateMidBlock\n}\n\nfunc (s *consoleStenographer) endBlock() {\n\ts.printDelimiter()\n\ts.cursorState = cursorStateEndBlock\n}\n\nfunc (s *consoleStenographer) stream() {\n\ts.cursorState = cursorStateStreaming\n}\n\nfunc (s *consoleStenographer) printBlockWithMessage(header string, message string, spec *types.SpecSummary, succinct bool) {\n\ts.startBlock()\n\ts.println(0, header)\n\n\tindentation := s.printCodeLocationBlock(spec.ComponentTexts, spec.ComponentCodeLocations, types.SpecComponentTypeInvalid, 0, spec.State, succinct)\n\n\tif message != \"\" {\n\t\ts.printNewLine()\n\t\ts.println(indentation, message)\n\t}\n\n\ts.endBlock()\n}\n\nfunc (s *consoleStenographer) printSpecFailure(message string, spec *types.SpecSummary, succinct bool, fullTrace bool) {\n\ts.startBlock()\n\ts.println(0, s.colorize(redColor+boldStyle, \"%s%s [%.3f seconds]\", message, s.failureContext(spec.Failure.ComponentType), spec.RunTime.Seconds()))\n\n\tindentation := s.printCodeLocationBlock(spec.ComponentTexts, spec.ComponentCodeLocations, spec.Failure.ComponentType, spec.Failure.ComponentIndex, spec.State, succinct)\n\n\ts.printNewLine()\n\ts.printFailure(indentation, spec.State, spec.Failure, fullTrace)\n\ts.endBlock()\n}\n\nfunc (s *consoleStenographer) failureContext(failedComponentType types.SpecComponentType) string {\n\tswitch failedComponentType {\n\tcase types.SpecComponentTypeBeforeSuite:\n\t\treturn \" in Suite Setup (BeforeSuite)\"\n\tcase types.SpecComponentTypeAfterSuite:\n\t\treturn \" in Suite Teardown (AfterSuite)\"\n\tcase types.SpecComponentTypeBeforeEach:\n\t\treturn \" in Spec Setup (BeforeEach)\"\n\tcase types.SpecComponentTypeJustBeforeEach:\n\t\treturn \" in Spec Setup (JustBeforeEach)\"\n\tcase types.SpecComponentTypeAfterEach:\n\t\treturn \" in Spec Teardown (AfterEach)\"\n\t}\n\n\treturn \"\"\n}\n\nfunc (s *consoleStenographer) printSkip(indentation int, spec types.SpecFailure) {\n\ts.println(indentation, s.colorize(cyanColor, spec.Message))\n\ts.printNewLine()\n\ts.println(indentation, spec.Location.String())\n}\n\nfunc (s *consoleStenographer) printFailure(indentation int, state types.SpecState, failure types.SpecFailure, fullTrace bool) {\n\tif state == types.SpecStatePanicked {\n\t\ts.println(indentation, s.colorize(redColor+boldStyle, failure.Message))\n\t\ts.println(indentation, s.colorize(redColor, failure.ForwardedPanic))\n\t\ts.println(indentation, failure.Location.String())\n\t\ts.printNewLine()\n\t\ts.println(indentation, s.colorize(redColor, \"Full Stack Trace\"))\n\t\ts.println(indentation, failure.Location.FullStackTrace)\n\t} else {\n\t\ts.println(indentation, s.colorize(redColor, failure.Message))\n\t\ts.printNewLine()\n\t\ts.println(indentation, failure.Location.String())\n\t\tif fullTrace {\n\t\t\ts.printNewLine()\n\t\t\ts.println(indentation, s.colorize(redColor, \"Full Stack Trace\"))\n\t\t\ts.println(indentation, failure.Location.FullStackTrace)\n\t\t}\n\t}\n}\n\nfunc (s *consoleStenographer) printSpecContext(componentTexts []string, componentCodeLocations []types.CodeLocation, failedComponentType types.SpecComponentType, failedComponentIndex int, state types.SpecState, succinct bool) int {\n\tstartIndex := 1\n\tindentation := 0\n\n\tif len(componentTexts) == 1 {\n\t\tstartIndex = 0\n\t}\n\n\tfor i := startIndex; i < len(componentTexts); i++ {\n\t\tif (state.IsFailure() || state == types.SpecStateSkipped) && i == failedComponentIndex {\n\t\t\tcolor := redColor\n\t\t\tif state == types.SpecStateSkipped {\n\t\t\t\tcolor = cyanColor\n\t\t\t}\n\t\t\tblockType := \"\"\n\t\t\tswitch failedComponentType {\n\t\t\tcase types.SpecComponentTypeBeforeSuite:\n\t\t\t\tblockType = \"BeforeSuite\"\n\t\t\tcase types.SpecComponentTypeAfterSuite:\n\t\t\t\tblockType = \"AfterSuite\"\n\t\t\tcase types.SpecComponentTypeBeforeEach:\n\t\t\t\tblockType = \"BeforeEach\"\n\t\t\tcase types.SpecComponentTypeJustBeforeEach:\n\t\t\t\tblockType = \"JustBeforeEach\"\n\t\t\tcase types.SpecComponentTypeAfterEach:\n\t\t\t\tblockType = \"AfterEach\"\n\t\t\tcase types.SpecComponentTypeIt:\n\t\t\t\tblockType = \"It\"\n\t\t\tcase types.SpecComponentTypeMeasure:\n\t\t\t\tblockType = \"Measurement\"\n\t\t\t}\n\t\t\tif succinct {\n\t\t\t\ts.print(0, s.colorize(color+boldStyle, \"[%s] %s \", blockType, componentTexts[i]))\n\t\t\t} else {\n\t\t\t\ts.println(indentation, s.colorize(color+boldStyle, \"%s [%s]\", componentTexts[i], blockType))\n\t\t\t\ts.println(indentation, s.colorize(grayColor, \"%s\", componentCodeLocations[i]))\n\t\t\t}\n\t\t} else {\n\t\t\tif succinct {\n\t\t\t\ts.print(0, s.colorize(alternatingColors[i%2], \"%s \", componentTexts[i]))\n\t\t\t} else {\n\t\t\t\ts.println(indentation, componentTexts[i])\n\t\t\t\ts.println(indentation, s.colorize(grayColor, \"%s\", componentCodeLocations[i]))\n\t\t\t}\n\t\t}\n\t\tindentation++\n\t}\n\n\treturn indentation\n}\n\nfunc (s *consoleStenographer) printCodeLocationBlock(componentTexts []string, componentCodeLocations []types.CodeLocation, failedComponentType types.SpecComponentType, failedComponentIndex int, state types.SpecState, succinct bool) int {\n\tindentation := s.printSpecContext(componentTexts, componentCodeLocations, failedComponentType, failedComponentIndex, state, succinct)\n\n\tif succinct {\n\t\tif len(componentTexts) > 0 {\n\t\t\ts.printNewLine()\n\t\t\ts.print(0, s.colorize(lightGrayColor, \"%s\", componentCodeLocations[len(componentCodeLocations)-1]))\n\t\t}\n\t\ts.printNewLine()\n\t\tindentation = 1\n\t} else {\n\t\tindentation--\n\t}\n\n\treturn indentation\n}\n\nfunc (s *consoleStenographer) orderedMeasurementKeys(measurements map[string]*types.SpecMeasurement) []string {\n\torderedKeys := make([]string, len(measurements))\n\tfor key, measurement := range measurements {\n\t\torderedKeys[measurement.Order] = key\n\t}\n\treturn orderedKeys\n}\n\nfunc (s *consoleStenographer) measurementReport(spec *types.SpecSummary, succinct bool) string {\n\tif len(spec.Measurements) == 0 {\n\t\treturn \"Found no measurements\"\n\t}\n\n\tmessage := []string{}\n\torderedKeys := s.orderedMeasurementKeys(spec.Measurements)\n\n\tif succinct {\n\t\tmessage = append(message, fmt.Sprintf(\"%s samples:\", s.colorize(boldStyle, \"%d\", spec.NumberOfSamples)))\n\t\tfor _, key := range orderedKeys {\n\t\t\tmeasurement := spec.Measurements[key]\n\t\t\tmessage = append(message, fmt.Sprintf(\" %s - %s: %s%s, %s: %s%s ± %s%s, %s: %s%s\",\n\t\t\t\ts.colorize(boldStyle, \"%s\", measurement.Name),\n\t\t\t\tmeasurement.SmallestLabel,\n\t\t\t\ts.colorize(greenColor, measurement.PrecisionFmt(), measurement.Smallest),\n\t\t\t\tmeasurement.Units,\n\t\t\t\tmeasurement.AverageLabel,\n\t\t\t\ts.colorize(cyanColor, measurement.PrecisionFmt(), measurement.Average),\n\t\t\t\tmeasurement.Units,\n\t\t\t\ts.colorize(cyanColor, measurement.PrecisionFmt(), measurement.StdDeviation),\n\t\t\t\tmeasurement.Units,\n\t\t\t\tmeasurement.LargestLabel,\n\t\t\t\ts.colorize(redColor, measurement.PrecisionFmt(), measurement.Largest),\n\t\t\t\tmeasurement.Units,\n\t\t\t))\n\t\t}\n\t} else {\n\t\tmessage = append(message, fmt.Sprintf(\"Ran %s samples:\", s.colorize(boldStyle, \"%d\", spec.NumberOfSamples)))\n\t\tfor _, key := range orderedKeys {\n\t\t\tmeasurement := spec.Measurements[key]\n\t\t\tinfo := \"\"\n\t\t\tif measurement.Info != nil {\n\t\t\t\tmessage = append(message, fmt.Sprintf(\"%v\", measurement.Info))\n\t\t\t}\n\n\t\t\tmessage = append(message, fmt.Sprintf(\"%s:\\n%s %s: %s%s\\n %s: %s%s\\n %s: %s%s ± %s%s\",\n\t\t\t\ts.colorize(boldStyle, \"%s\", measurement.Name),\n\t\t\t\tinfo,\n\t\t\t\tmeasurement.SmallestLabel,\n\t\t\t\ts.colorize(greenColor, measurement.PrecisionFmt(), measurement.Smallest),\n\t\t\t\tmeasurement.Units,\n\t\t\t\tmeasurement.LargestLabel,\n\t\t\t\ts.colorize(redColor, measurement.PrecisionFmt(), measurement.Largest),\n\t\t\t\tmeasurement.Units,\n\t\t\t\tmeasurement.AverageLabel,\n\t\t\t\ts.colorize(cyanColor, measurement.PrecisionFmt(), measurement.Average),\n\t\t\t\tmeasurement.Units,\n\t\t\t\ts.colorize(cyanColor, measurement.PrecisionFmt(), measurement.StdDeviation),\n\t\t\t\tmeasurement.Units,\n\t\t\t))\n\t\t}\n\t}\n\n\treturn strings.Join(message, \"\\n\")\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/reporters/stenographer/support/go-colorable/LICENSE", "content": "The MIT License (MIT)\n\nCopyright (c) 2016 Yasuhiro Matsumoto\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in all\ncopies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\nSOFTWARE.\n" }, { "path": "vendor/github.com/onsi/ginkgo/reporters/stenographer/support/go-colorable/README.md", "content": "# go-colorable\n\nColorable writer for windows.\n\nFor example, most of logger packages doesn't show colors on windows. (I know we can do it with ansicon. But I don't want.)\nThis package is possible to handle escape sequence for ansi color on windows.\n\n## Too Bad!\n\n![](https://raw.githubusercontent.com/mattn/go-colorable/gh-pages/bad.png)\n\n\n## So Good!\n\n![](https://raw.githubusercontent.com/mattn/go-colorable/gh-pages/good.png)\n\n## Usage\n\n```go\nlogrus.SetFormatter(&logrus.TextFormatter{ForceColors: true})\nlogrus.SetOutput(colorable.NewColorableStdout())\n\nlogrus.Info(\"succeeded\")\nlogrus.Warn(\"not correct\")\nlogrus.Error(\"something error\")\nlogrus.Fatal(\"panic\")\n```\n\nYou can compile above code on non-windows OSs.\n\n## Installation\n\n```\n$ go get github.com/mattn/go-colorable\n```\n\n# License\n\nMIT\n\n# Author\n\nYasuhiro Matsumoto (a.k.a mattn)\n" }, { "path": "vendor/github.com/onsi/ginkgo/reporters/stenographer/support/go-colorable/colorable_others.go", "content": "// +build !windows\n\npackage colorable\n\nimport (\n\t\"io\"\n\t\"os\"\n)\n\nfunc NewColorable(file *os.File) io.Writer {\n\tif file == nil {\n\t\tpanic(\"nil passed instead of *os.File to NewColorable()\")\n\t}\n\n\treturn file\n}\n\nfunc NewColorableStdout() io.Writer {\n\treturn os.Stdout\n}\n\nfunc NewColorableStderr() io.Writer {\n\treturn os.Stderr\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/reporters/stenographer/support/go-colorable/colorable_windows.go", "content": "package colorable\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n\t\"io\"\n\t\"math\"\n\t\"os\"\n\t\"strconv\"\n\t\"strings\"\n\t\"syscall\"\n\t\"unsafe\"\n\n\t\"github.com/onsi/ginkgo/reporters/stenographer/support/go-isatty\"\n)\n\nconst (\n\tforegroundBlue = 0x1\n\tforegroundGreen = 0x2\n\tforegroundRed = 0x4\n\tforegroundIntensity = 0x8\n\tforegroundMask = (foregroundRed | foregroundBlue | foregroundGreen | foregroundIntensity)\n\tbackgroundBlue = 0x10\n\tbackgroundGreen = 0x20\n\tbackgroundRed = 0x40\n\tbackgroundIntensity = 0x80\n\tbackgroundMask = (backgroundRed | backgroundBlue | backgroundGreen | backgroundIntensity)\n)\n\ntype wchar uint16\ntype short int16\ntype dword uint32\ntype word uint16\n\ntype coord struct {\n\tx short\n\ty short\n}\n\ntype smallRect struct {\n\tleft short\n\ttop short\n\tright short\n\tbottom short\n}\n\ntype consoleScreenBufferInfo struct {\n\tsize coord\n\tcursorPosition coord\n\tattributes word\n\twindow smallRect\n\tmaximumWindowSize coord\n}\n\nvar (\n\tkernel32 = syscall.NewLazyDLL(\"kernel32.dll\")\n\tprocGetConsoleScreenBufferInfo = kernel32.NewProc(\"GetConsoleScreenBufferInfo\")\n\tprocSetConsoleTextAttribute = kernel32.NewProc(\"SetConsoleTextAttribute\")\n\tprocSetConsoleCursorPosition = kernel32.NewProc(\"SetConsoleCursorPosition\")\n\tprocFillConsoleOutputCharacter = kernel32.NewProc(\"FillConsoleOutputCharacterW\")\n\tprocFillConsoleOutputAttribute = kernel32.NewProc(\"FillConsoleOutputAttribute\")\n)\n\ntype Writer struct {\n\tout io.Writer\n\thandle syscall.Handle\n\tlastbuf bytes.Buffer\n\toldattr word\n}\n\nfunc NewColorable(file *os.File) io.Writer {\n\tif file == nil {\n\t\tpanic(\"nil passed instead of *os.File to NewColorable()\")\n\t}\n\n\tif isatty.IsTerminal(file.Fd()) {\n\t\tvar csbi consoleScreenBufferInfo\n\t\thandle := syscall.Handle(file.Fd())\n\t\tprocGetConsoleScreenBufferInfo.Call(uintptr(handle), uintptr(unsafe.Pointer(&csbi)))\n\t\treturn &Writer{out: file, handle: handle, oldattr: csbi.attributes}\n\t} else {\n\t\treturn file\n\t}\n}\n\nfunc NewColorableStdout() io.Writer {\n\treturn NewColorable(os.Stdout)\n}\n\nfunc NewColorableStderr() io.Writer {\n\treturn NewColorable(os.Stderr)\n}\n\nvar color256 = map[int]int{\n\t0: 0x000000,\n\t1: 0x800000,\n\t2: 0x008000,\n\t3: 0x808000,\n\t4: 0x000080,\n\t5: 0x800080,\n\t6: 0x008080,\n\t7: 0xc0c0c0,\n\t8: 0x808080,\n\t9: 0xff0000,\n\t10: 0x00ff00,\n\t11: 0xffff00,\n\t12: 0x0000ff,\n\t13: 0xff00ff,\n\t14: 0x00ffff,\n\t15: 0xffffff,\n\t16: 0x000000,\n\t17: 0x00005f,\n\t18: 0x000087,\n\t19: 0x0000af,\n\t20: 0x0000d7,\n\t21: 0x0000ff,\n\t22: 0x005f00,\n\t23: 0x005f5f,\n\t24: 0x005f87,\n\t25: 0x005faf,\n\t26: 0x005fd7,\n\t27: 0x005fff,\n\t28: 0x008700,\n\t29: 0x00875f,\n\t30: 0x008787,\n\t31: 0x0087af,\n\t32: 0x0087d7,\n\t33: 0x0087ff,\n\t34: 0x00af00,\n\t35: 0x00af5f,\n\t36: 0x00af87,\n\t37: 0x00afaf,\n\t38: 0x00afd7,\n\t39: 0x00afff,\n\t40: 0x00d700,\n\t41: 0x00d75f,\n\t42: 0x00d787,\n\t43: 0x00d7af,\n\t44: 0x00d7d7,\n\t45: 0x00d7ff,\n\t46: 0x00ff00,\n\t47: 0x00ff5f,\n\t48: 0x00ff87,\n\t49: 0x00ffaf,\n\t50: 0x00ffd7,\n\t51: 0x00ffff,\n\t52: 0x5f0000,\n\t53: 0x5f005f,\n\t54: 0x5f0087,\n\t55: 0x5f00af,\n\t56: 0x5f00d7,\n\t57: 0x5f00ff,\n\t58: 0x5f5f00,\n\t59: 0x5f5f5f,\n\t60: 0x5f5f87,\n\t61: 0x5f5faf,\n\t62: 0x5f5fd7,\n\t63: 0x5f5fff,\n\t64: 0x5f8700,\n\t65: 0x5f875f,\n\t66: 0x5f8787,\n\t67: 0x5f87af,\n\t68: 0x5f87d7,\n\t69: 0x5f87ff,\n\t70: 0x5faf00,\n\t71: 0x5faf5f,\n\t72: 0x5faf87,\n\t73: 0x5fafaf,\n\t74: 0x5fafd7,\n\t75: 0x5fafff,\n\t76: 0x5fd700,\n\t77: 0x5fd75f,\n\t78: 0x5fd787,\n\t79: 0x5fd7af,\n\t80: 0x5fd7d7,\n\t81: 0x5fd7ff,\n\t82: 0x5fff00,\n\t83: 0x5fff5f,\n\t84: 0x5fff87,\n\t85: 0x5fffaf,\n\t86: 0x5fffd7,\n\t87: 0x5fffff,\n\t88: 0x870000,\n\t89: 0x87005f,\n\t90: 0x870087,\n\t91: 0x8700af,\n\t92: 0x8700d7,\n\t93: 0x8700ff,\n\t94: 0x875f00,\n\t95: 0x875f5f,\n\t96: 0x875f87,\n\t97: 0x875faf,\n\t98: 0x875fd7,\n\t99: 0x875fff,\n\t100: 0x878700,\n\t101: 0x87875f,\n\t102: 0x878787,\n\t103: 0x8787af,\n\t104: 0x8787d7,\n\t105: 0x8787ff,\n\t106: 0x87af00,\n\t107: 0x87af5f,\n\t108: 0x87af87,\n\t109: 0x87afaf,\n\t110: 0x87afd7,\n\t111: 0x87afff,\n\t112: 0x87d700,\n\t113: 0x87d75f,\n\t114: 0x87d787,\n\t115: 0x87d7af,\n\t116: 0x87d7d7,\n\t117: 0x87d7ff,\n\t118: 0x87ff00,\n\t119: 0x87ff5f,\n\t120: 0x87ff87,\n\t121: 0x87ffaf,\n\t122: 0x87ffd7,\n\t123: 0x87ffff,\n\t124: 0xaf0000,\n\t125: 0xaf005f,\n\t126: 0xaf0087,\n\t127: 0xaf00af,\n\t128: 0xaf00d7,\n\t129: 0xaf00ff,\n\t130: 0xaf5f00,\n\t131: 0xaf5f5f,\n\t132: 0xaf5f87,\n\t133: 0xaf5faf,\n\t134: 0xaf5fd7,\n\t135: 0xaf5fff,\n\t136: 0xaf8700,\n\t137: 0xaf875f,\n\t138: 0xaf8787,\n\t139: 0xaf87af,\n\t140: 0xaf87d7,\n\t141: 0xaf87ff,\n\t142: 0xafaf00,\n\t143: 0xafaf5f,\n\t144: 0xafaf87,\n\t145: 0xafafaf,\n\t146: 0xafafd7,\n\t147: 0xafafff,\n\t148: 0xafd700,\n\t149: 0xafd75f,\n\t150: 0xafd787,\n\t151: 0xafd7af,\n\t152: 0xafd7d7,\n\t153: 0xafd7ff,\n\t154: 0xafff00,\n\t155: 0xafff5f,\n\t156: 0xafff87,\n\t157: 0xafffaf,\n\t158: 0xafffd7,\n\t159: 0xafffff,\n\t160: 0xd70000,\n\t161: 0xd7005f,\n\t162: 0xd70087,\n\t163: 0xd700af,\n\t164: 0xd700d7,\n\t165: 0xd700ff,\n\t166: 0xd75f00,\n\t167: 0xd75f5f,\n\t168: 0xd75f87,\n\t169: 0xd75faf,\n\t170: 0xd75fd7,\n\t171: 0xd75fff,\n\t172: 0xd78700,\n\t173: 0xd7875f,\n\t174: 0xd78787,\n\t175: 0xd787af,\n\t176: 0xd787d7,\n\t177: 0xd787ff,\n\t178: 0xd7af00,\n\t179: 0xd7af5f,\n\t180: 0xd7af87,\n\t181: 0xd7afaf,\n\t182: 0xd7afd7,\n\t183: 0xd7afff,\n\t184: 0xd7d700,\n\t185: 0xd7d75f,\n\t186: 0xd7d787,\n\t187: 0xd7d7af,\n\t188: 0xd7d7d7,\n\t189: 0xd7d7ff,\n\t190: 0xd7ff00,\n\t191: 0xd7ff5f,\n\t192: 0xd7ff87,\n\t193: 0xd7ffaf,\n\t194: 0xd7ffd7,\n\t195: 0xd7ffff,\n\t196: 0xff0000,\n\t197: 0xff005f,\n\t198: 0xff0087,\n\t199: 0xff00af,\n\t200: 0xff00d7,\n\t201: 0xff00ff,\n\t202: 0xff5f00,\n\t203: 0xff5f5f,\n\t204: 0xff5f87,\n\t205: 0xff5faf,\n\t206: 0xff5fd7,\n\t207: 0xff5fff,\n\t208: 0xff8700,\n\t209: 0xff875f,\n\t210: 0xff8787,\n\t211: 0xff87af,\n\t212: 0xff87d7,\n\t213: 0xff87ff,\n\t214: 0xffaf00,\n\t215: 0xffaf5f,\n\t216: 0xffaf87,\n\t217: 0xffafaf,\n\t218: 0xffafd7,\n\t219: 0xffafff,\n\t220: 0xffd700,\n\t221: 0xffd75f,\n\t222: 0xffd787,\n\t223: 0xffd7af,\n\t224: 0xffd7d7,\n\t225: 0xffd7ff,\n\t226: 0xffff00,\n\t227: 0xffff5f,\n\t228: 0xffff87,\n\t229: 0xffffaf,\n\t230: 0xffffd7,\n\t231: 0xffffff,\n\t232: 0x080808,\n\t233: 0x121212,\n\t234: 0x1c1c1c,\n\t235: 0x262626,\n\t236: 0x303030,\n\t237: 0x3a3a3a,\n\t238: 0x444444,\n\t239: 0x4e4e4e,\n\t240: 0x585858,\n\t241: 0x626262,\n\t242: 0x6c6c6c,\n\t243: 0x767676,\n\t244: 0x808080,\n\t245: 0x8a8a8a,\n\t246: 0x949494,\n\t247: 0x9e9e9e,\n\t248: 0xa8a8a8,\n\t249: 0xb2b2b2,\n\t250: 0xbcbcbc,\n\t251: 0xc6c6c6,\n\t252: 0xd0d0d0,\n\t253: 0xdadada,\n\t254: 0xe4e4e4,\n\t255: 0xeeeeee,\n}\n\nfunc (w *Writer) Write(data []byte) (n int, err error) {\n\tvar csbi consoleScreenBufferInfo\n\tprocGetConsoleScreenBufferInfo.Call(uintptr(w.handle), uintptr(unsafe.Pointer(&csbi)))\n\n\ter := bytes.NewBuffer(data)\nloop:\n\tfor {\n\t\tr1, _, err := procGetConsoleScreenBufferInfo.Call(uintptr(w.handle), uintptr(unsafe.Pointer(&csbi)))\n\t\tif r1 == 0 {\n\t\t\tbreak loop\n\t\t}\n\n\t\tc1, _, err := er.ReadRune()\n\t\tif err != nil {\n\t\t\tbreak loop\n\t\t}\n\t\tif c1 != 0x1b {\n\t\t\tfmt.Fprint(w.out, string(c1))\n\t\t\tcontinue\n\t\t}\n\t\tc2, _, err := er.ReadRune()\n\t\tif err != nil {\n\t\t\tw.lastbuf.WriteRune(c1)\n\t\t\tbreak loop\n\t\t}\n\t\tif c2 != 0x5b {\n\t\t\tw.lastbuf.WriteRune(c1)\n\t\t\tw.lastbuf.WriteRune(c2)\n\t\t\tcontinue\n\t\t}\n\n\t\tvar buf bytes.Buffer\n\t\tvar m rune\n\t\tfor {\n\t\t\tc, _, err := er.ReadRune()\n\t\t\tif err != nil {\n\t\t\t\tw.lastbuf.WriteRune(c1)\n\t\t\t\tw.lastbuf.WriteRune(c2)\n\t\t\t\tw.lastbuf.Write(buf.Bytes())\n\t\t\t\tbreak loop\n\t\t\t}\n\t\t\tif ('a' <= c && c <= 'z') || ('A' <= c && c <= 'Z') || c == '@' {\n\t\t\t\tm = c\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tbuf.Write([]byte(string(c)))\n\t\t}\n\n\t\tvar csbi consoleScreenBufferInfo\n\t\tswitch m {\n\t\tcase 'A':\n\t\t\tn, err = strconv.Atoi(buf.String())\n\t\t\tif err != nil {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tprocGetConsoleScreenBufferInfo.Call(uintptr(w.handle), uintptr(unsafe.Pointer(&csbi)))\n\t\t\tcsbi.cursorPosition.y -= short(n)\n\t\t\tprocSetConsoleCursorPosition.Call(uintptr(w.handle), *(*uintptr)(unsafe.Pointer(&csbi.cursorPosition)))\n\t\tcase 'B':\n\t\t\tn, err = strconv.Atoi(buf.String())\n\t\t\tif err != nil {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tprocGetConsoleScreenBufferInfo.Call(uintptr(w.handle), uintptr(unsafe.Pointer(&csbi)))\n\t\t\tcsbi.cursorPosition.y += short(n)\n\t\t\tprocSetConsoleCursorPosition.Call(uintptr(w.handle), *(*uintptr)(unsafe.Pointer(&csbi.cursorPosition)))\n\t\tcase 'C':\n\t\t\tn, err = strconv.Atoi(buf.String())\n\t\t\tif err != nil {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tprocGetConsoleScreenBufferInfo.Call(uintptr(w.handle), uintptr(unsafe.Pointer(&csbi)))\n\t\t\tcsbi.cursorPosition.x -= short(n)\n\t\t\tprocSetConsoleCursorPosition.Call(uintptr(w.handle), *(*uintptr)(unsafe.Pointer(&csbi.cursorPosition)))\n\t\tcase 'D':\n\t\t\tn, err = strconv.Atoi(buf.String())\n\t\t\tif err != nil {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif n, err = strconv.Atoi(buf.String()); err == nil {\n\t\t\t\tvar csbi consoleScreenBufferInfo\n\t\t\t\tprocGetConsoleScreenBufferInfo.Call(uintptr(w.handle), uintptr(unsafe.Pointer(&csbi)))\n\t\t\t\tcsbi.cursorPosition.x += short(n)\n\t\t\t\tprocSetConsoleCursorPosition.Call(uintptr(w.handle), *(*uintptr)(unsafe.Pointer(&csbi.cursorPosition)))\n\t\t\t}\n\t\tcase 'E':\n\t\t\tn, err = strconv.Atoi(buf.String())\n\t\t\tif err != nil {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tprocGetConsoleScreenBufferInfo.Call(uintptr(w.handle), uintptr(unsafe.Pointer(&csbi)))\n\t\t\tcsbi.cursorPosition.x = 0\n\t\t\tcsbi.cursorPosition.y += short(n)\n\t\t\tprocSetConsoleCursorPosition.Call(uintptr(w.handle), *(*uintptr)(unsafe.Pointer(&csbi.cursorPosition)))\n\t\tcase 'F':\n\t\t\tn, err = strconv.Atoi(buf.String())\n\t\t\tif err != nil {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tprocGetConsoleScreenBufferInfo.Call(uintptr(w.handle), uintptr(unsafe.Pointer(&csbi)))\n\t\t\tcsbi.cursorPosition.x = 0\n\t\t\tcsbi.cursorPosition.y -= short(n)\n\t\t\tprocSetConsoleCursorPosition.Call(uintptr(w.handle), *(*uintptr)(unsafe.Pointer(&csbi.cursorPosition)))\n\t\tcase 'G':\n\t\t\tn, err = strconv.Atoi(buf.String())\n\t\t\tif err != nil {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tprocGetConsoleScreenBufferInfo.Call(uintptr(w.handle), uintptr(unsafe.Pointer(&csbi)))\n\t\t\tcsbi.cursorPosition.x = short(n)\n\t\t\tprocSetConsoleCursorPosition.Call(uintptr(w.handle), *(*uintptr)(unsafe.Pointer(&csbi.cursorPosition)))\n\t\tcase 'H':\n\t\t\ttoken := strings.Split(buf.String(), \";\")\n\t\t\tif len(token) != 2 {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tn1, err := strconv.Atoi(token[0])\n\t\t\tif err != nil {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tn2, err := strconv.Atoi(token[1])\n\t\t\tif err != nil {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tcsbi.cursorPosition.x = short(n2)\n\t\t\tcsbi.cursorPosition.x = short(n1)\n\t\t\tprocSetConsoleCursorPosition.Call(uintptr(w.handle), *(*uintptr)(unsafe.Pointer(&csbi.cursorPosition)))\n\t\tcase 'J':\n\t\t\tn, err := strconv.Atoi(buf.String())\n\t\t\tif err != nil {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tvar cursor coord\n\t\t\tswitch n {\n\t\t\tcase 0:\n\t\t\t\tcursor = coord{x: csbi.cursorPosition.x, y: csbi.cursorPosition.y}\n\t\t\tcase 1:\n\t\t\t\tcursor = coord{x: csbi.window.left, y: csbi.window.top}\n\t\t\tcase 2:\n\t\t\t\tcursor = coord{x: csbi.window.left, y: csbi.window.top}\n\t\t\t}\n\t\t\tvar count, written dword\n\t\t\tcount = dword(csbi.size.x - csbi.cursorPosition.x + (csbi.size.y-csbi.cursorPosition.y)*csbi.size.x)\n\t\t\tprocFillConsoleOutputCharacter.Call(uintptr(w.handle), uintptr(' '), uintptr(count), *(*uintptr)(unsafe.Pointer(&cursor)), uintptr(unsafe.Pointer(&written)))\n\t\t\tprocFillConsoleOutputAttribute.Call(uintptr(w.handle), uintptr(csbi.attributes), uintptr(count), *(*uintptr)(unsafe.Pointer(&cursor)), uintptr(unsafe.Pointer(&written)))\n\t\tcase 'K':\n\t\t\tn, err := strconv.Atoi(buf.String())\n\t\t\tif err != nil {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tvar cursor coord\n\t\t\tswitch n {\n\t\t\tcase 0:\n\t\t\t\tcursor = coord{x: csbi.cursorPosition.x, y: csbi.cursorPosition.y}\n\t\t\tcase 1:\n\t\t\t\tcursor = coord{x: csbi.window.left, y: csbi.window.top + csbi.cursorPosition.y}\n\t\t\tcase 2:\n\t\t\t\tcursor = coord{x: csbi.window.left, y: csbi.window.top + csbi.cursorPosition.y}\n\t\t\t}\n\t\t\tvar count, written dword\n\t\t\tcount = dword(csbi.size.x - csbi.cursorPosition.x)\n\t\t\tprocFillConsoleOutputCharacter.Call(uintptr(w.handle), uintptr(' '), uintptr(count), *(*uintptr)(unsafe.Pointer(&cursor)), uintptr(unsafe.Pointer(&written)))\n\t\t\tprocFillConsoleOutputAttribute.Call(uintptr(w.handle), uintptr(csbi.attributes), uintptr(count), *(*uintptr)(unsafe.Pointer(&cursor)), uintptr(unsafe.Pointer(&written)))\n\t\tcase 'm':\n\t\t\tattr := csbi.attributes\n\t\t\tcs := buf.String()\n\t\t\tif cs == \"\" {\n\t\t\t\tprocSetConsoleTextAttribute.Call(uintptr(w.handle), uintptr(w.oldattr))\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\ttoken := strings.Split(cs, \";\")\n\t\t\tfor i := 0; i < len(token); i += 1 {\n\t\t\t\tns := token[i]\n\t\t\t\tif n, err = strconv.Atoi(ns); err == nil {\n\t\t\t\t\tswitch {\n\t\t\t\t\tcase n == 0 || n == 100:\n\t\t\t\t\t\tattr = w.oldattr\n\t\t\t\t\tcase 1 <= n && n <= 5:\n\t\t\t\t\t\tattr |= foregroundIntensity\n\t\t\t\t\tcase n == 7:\n\t\t\t\t\t\tattr = ((attr & foregroundMask) << 4) | ((attr & backgroundMask) >> 4)\n\t\t\t\t\tcase 22 == n || n == 25 || n == 25:\n\t\t\t\t\t\tattr |= foregroundIntensity\n\t\t\t\t\tcase n == 27:\n\t\t\t\t\t\tattr = ((attr & foregroundMask) << 4) | ((attr & backgroundMask) >> 4)\n\t\t\t\t\tcase 30 <= n && n <= 37:\n\t\t\t\t\t\tattr = (attr & backgroundMask)\n\t\t\t\t\t\tif (n-30)&1 != 0 {\n\t\t\t\t\t\t\tattr |= foregroundRed\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (n-30)&2 != 0 {\n\t\t\t\t\t\t\tattr |= foregroundGreen\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (n-30)&4 != 0 {\n\t\t\t\t\t\t\tattr |= foregroundBlue\n\t\t\t\t\t\t}\n\t\t\t\t\tcase n == 38: // set foreground color.\n\t\t\t\t\t\tif i < len(token)-2 && (token[i+1] == \"5\" || token[i+1] == \"05\") {\n\t\t\t\t\t\t\tif n256, err := strconv.Atoi(token[i+2]); err == nil {\n\t\t\t\t\t\t\t\tif n256foreAttr == nil {\n\t\t\t\t\t\t\t\t\tn256setup()\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tattr &= backgroundMask\n\t\t\t\t\t\t\t\tattr |= n256foreAttr[n256]\n\t\t\t\t\t\t\t\ti += 2\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tattr = attr & (w.oldattr & backgroundMask)\n\t\t\t\t\t\t}\n\t\t\t\t\tcase n == 39: // reset foreground color.\n\t\t\t\t\t\tattr &= backgroundMask\n\t\t\t\t\t\tattr |= w.oldattr & foregroundMask\n\t\t\t\t\tcase 40 <= n && n <= 47:\n\t\t\t\t\t\tattr = (attr & foregroundMask)\n\t\t\t\t\t\tif (n-40)&1 != 0 {\n\t\t\t\t\t\t\tattr |= backgroundRed\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (n-40)&2 != 0 {\n\t\t\t\t\t\t\tattr |= backgroundGreen\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (n-40)&4 != 0 {\n\t\t\t\t\t\t\tattr |= backgroundBlue\n\t\t\t\t\t\t}\n\t\t\t\t\tcase n == 48: // set background color.\n\t\t\t\t\t\tif i < len(token)-2 && token[i+1] == \"5\" {\n\t\t\t\t\t\t\tif n256, err := strconv.Atoi(token[i+2]); err == nil {\n\t\t\t\t\t\t\t\tif n256backAttr == nil {\n\t\t\t\t\t\t\t\t\tn256setup()\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tattr &= foregroundMask\n\t\t\t\t\t\t\t\tattr |= n256backAttr[n256]\n\t\t\t\t\t\t\t\ti += 2\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tattr = attr & (w.oldattr & foregroundMask)\n\t\t\t\t\t\t}\n\t\t\t\t\tcase n == 49: // reset foreground color.\n\t\t\t\t\t\tattr &= foregroundMask\n\t\t\t\t\t\tattr |= w.oldattr & backgroundMask\n\t\t\t\t\tcase 90 <= n && n <= 97:\n\t\t\t\t\t\tattr = (attr & backgroundMask)\n\t\t\t\t\t\tattr |= foregroundIntensity\n\t\t\t\t\t\tif (n-90)&1 != 0 {\n\t\t\t\t\t\t\tattr |= foregroundRed\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (n-90)&2 != 0 {\n\t\t\t\t\t\t\tattr |= foregroundGreen\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (n-90)&4 != 0 {\n\t\t\t\t\t\t\tattr |= foregroundBlue\n\t\t\t\t\t\t}\n\t\t\t\t\tcase 100 <= n && n <= 107:\n\t\t\t\t\t\tattr = (attr & foregroundMask)\n\t\t\t\t\t\tattr |= backgroundIntensity\n\t\t\t\t\t\tif (n-100)&1 != 0 {\n\t\t\t\t\t\t\tattr |= backgroundRed\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (n-100)&2 != 0 {\n\t\t\t\t\t\t\tattr |= backgroundGreen\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (n-100)&4 != 0 {\n\t\t\t\t\t\t\tattr |= backgroundBlue\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tprocSetConsoleTextAttribute.Call(uintptr(w.handle), uintptr(attr))\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn len(data) - w.lastbuf.Len(), nil\n}\n\ntype consoleColor struct {\n\trgb int\n\tred bool\n\tgreen bool\n\tblue bool\n\tintensity bool\n}\n\nfunc (c consoleColor) foregroundAttr() (attr word) {\n\tif c.red {\n\t\tattr |= foregroundRed\n\t}\n\tif c.green {\n\t\tattr |= foregroundGreen\n\t}\n\tif c.blue {\n\t\tattr |= foregroundBlue\n\t}\n\tif c.intensity {\n\t\tattr |= foregroundIntensity\n\t}\n\treturn\n}\n\nfunc (c consoleColor) backgroundAttr() (attr word) {\n\tif c.red {\n\t\tattr |= backgroundRed\n\t}\n\tif c.green {\n\t\tattr |= backgroundGreen\n\t}\n\tif c.blue {\n\t\tattr |= backgroundBlue\n\t}\n\tif c.intensity {\n\t\tattr |= backgroundIntensity\n\t}\n\treturn\n}\n\nvar color16 = []consoleColor{\n\tconsoleColor{0x000000, false, false, false, false},\n\tconsoleColor{0x000080, false, false, true, false},\n\tconsoleColor{0x008000, false, true, false, false},\n\tconsoleColor{0x008080, false, true, true, false},\n\tconsoleColor{0x800000, true, false, false, false},\n\tconsoleColor{0x800080, true, false, true, false},\n\tconsoleColor{0x808000, true, true, false, false},\n\tconsoleColor{0xc0c0c0, true, true, true, false},\n\tconsoleColor{0x808080, false, false, false, true},\n\tconsoleColor{0x0000ff, false, false, true, true},\n\tconsoleColor{0x00ff00, false, true, false, true},\n\tconsoleColor{0x00ffff, false, true, true, true},\n\tconsoleColor{0xff0000, true, false, false, true},\n\tconsoleColor{0xff00ff, true, false, true, true},\n\tconsoleColor{0xffff00, true, true, false, true},\n\tconsoleColor{0xffffff, true, true, true, true},\n}\n\ntype hsv struct {\n\th, s, v float32\n}\n\nfunc (a hsv) dist(b hsv) float32 {\n\tdh := a.h - b.h\n\tswitch {\n\tcase dh > 0.5:\n\t\tdh = 1 - dh\n\tcase dh < -0.5:\n\t\tdh = -1 - dh\n\t}\n\tds := a.s - b.s\n\tdv := a.v - b.v\n\treturn float32(math.Sqrt(float64(dh*dh + ds*ds + dv*dv)))\n}\n\nfunc toHSV(rgb int) hsv {\n\tr, g, b := float32((rgb&0xFF0000)>>16)/256.0,\n\t\tfloat32((rgb&0x00FF00)>>8)/256.0,\n\t\tfloat32(rgb&0x0000FF)/256.0\n\tmin, max := minmax3f(r, g, b)\n\th := max - min\n\tif h > 0 {\n\t\tif max == r {\n\t\t\th = (g - b) / h\n\t\t\tif h < 0 {\n\t\t\t\th += 6\n\t\t\t}\n\t\t} else if max == g {\n\t\t\th = 2 + (b-r)/h\n\t\t} else {\n\t\t\th = 4 + (r-g)/h\n\t\t}\n\t}\n\th /= 6.0\n\ts := max - min\n\tif max != 0 {\n\t\ts /= max\n\t}\n\tv := max\n\treturn hsv{h: h, s: s, v: v}\n}\n\ntype hsvTable []hsv\n\nfunc toHSVTable(rgbTable []consoleColor) hsvTable {\n\tt := make(hsvTable, len(rgbTable))\n\tfor i, c := range rgbTable {\n\t\tt[i] = toHSV(c.rgb)\n\t}\n\treturn t\n}\n\nfunc (t hsvTable) find(rgb int) consoleColor {\n\thsv := toHSV(rgb)\n\tn := 7\n\tl := float32(5.0)\n\tfor i, p := range t {\n\t\td := hsv.dist(p)\n\t\tif d < l {\n\t\t\tl, n = d, i\n\t\t}\n\t}\n\treturn color16[n]\n}\n\nfunc minmax3f(a, b, c float32) (min, max float32) {\n\tif a < b {\n\t\tif b < c {\n\t\t\treturn a, c\n\t\t} else if a < c {\n\t\t\treturn a, b\n\t\t} else {\n\t\t\treturn c, b\n\t\t}\n\t} else {\n\t\tif a < c {\n\t\t\treturn b, c\n\t\t} else if b < c {\n\t\t\treturn b, a\n\t\t} else {\n\t\t\treturn c, a\n\t\t}\n\t}\n}\n\nvar n256foreAttr []word\nvar n256backAttr []word\n\nfunc n256setup() {\n\tn256foreAttr = make([]word, 256)\n\tn256backAttr = make([]word, 256)\n\tt := toHSVTable(color16)\n\tfor i, rgb := range color256 {\n\t\tc := t.find(rgb)\n\t\tn256foreAttr[i] = c.foregroundAttr()\n\t\tn256backAttr[i] = c.backgroundAttr()\n\t}\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/reporters/stenographer/support/go-colorable/noncolorable.go", "content": "package colorable\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n\t\"io\"\n)\n\ntype NonColorable struct {\n\tout io.Writer\n\tlastbuf bytes.Buffer\n}\n\nfunc NewNonColorable(w io.Writer) io.Writer {\n\treturn &NonColorable{out: w}\n}\n\nfunc (w *NonColorable) Write(data []byte) (n int, err error) {\n\ter := bytes.NewBuffer(data)\nloop:\n\tfor {\n\t\tc1, _, err := er.ReadRune()\n\t\tif err != nil {\n\t\t\tbreak loop\n\t\t}\n\t\tif c1 != 0x1b {\n\t\t\tfmt.Fprint(w.out, string(c1))\n\t\t\tcontinue\n\t\t}\n\t\tc2, _, err := er.ReadRune()\n\t\tif err != nil {\n\t\t\tw.lastbuf.WriteRune(c1)\n\t\t\tbreak loop\n\t\t}\n\t\tif c2 != 0x5b {\n\t\t\tw.lastbuf.WriteRune(c1)\n\t\t\tw.lastbuf.WriteRune(c2)\n\t\t\tcontinue\n\t\t}\n\n\t\tvar buf bytes.Buffer\n\t\tfor {\n\t\t\tc, _, err := er.ReadRune()\n\t\t\tif err != nil {\n\t\t\t\tw.lastbuf.WriteRune(c1)\n\t\t\t\tw.lastbuf.WriteRune(c2)\n\t\t\t\tw.lastbuf.Write(buf.Bytes())\n\t\t\t\tbreak loop\n\t\t\t}\n\t\t\tif ('a' <= c && c <= 'z') || ('A' <= c && c <= 'Z') || c == '@' {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\tbuf.Write([]byte(string(c)))\n\t\t}\n\t}\n\treturn len(data) - w.lastbuf.Len(), nil\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/reporters/stenographer/support/go-isatty/LICENSE", "content": "Copyright (c) Yasuhiro MATSUMOTO \n\nMIT License (Expat)\n\nPermission 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:\n\nThe above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.\n\nTHE 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.\n" }, { "path": "vendor/github.com/onsi/ginkgo/reporters/stenographer/support/go-isatty/README.md", "content": "# go-isatty\n\nisatty for golang\n\n## Usage\n\n```go\npackage main\n\nimport (\n\t\"fmt\"\n\t\"github.com/mattn/go-isatty\"\n\t\"os\"\n)\n\nfunc main() {\n\tif isatty.IsTerminal(os.Stdout.Fd()) {\n\t\tfmt.Println(\"Is Terminal\")\n\t} else {\n\t\tfmt.Println(\"Is Not Terminal\")\n\t}\n}\n```\n\n## Installation\n\n```\n$ go get github.com/mattn/go-isatty\n```\n\n# License\n\nMIT\n\n# Author\n\nYasuhiro Matsumoto (a.k.a mattn)\n" }, { "path": "vendor/github.com/onsi/ginkgo/reporters/stenographer/support/go-isatty/doc.go", "content": "// Package isatty implements interface to isatty\npackage isatty\n" }, { "path": "vendor/github.com/onsi/ginkgo/reporters/stenographer/support/go-isatty/isatty_appengine.go", "content": "// +build appengine\n\npackage isatty\n\n// IsTerminal returns true if the file descriptor is terminal which\n// is always false on on appengine classic which is a sandboxed PaaS.\nfunc IsTerminal(fd uintptr) bool {\n\treturn false\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/reporters/stenographer/support/go-isatty/isatty_bsd.go", "content": "// +build darwin freebsd openbsd netbsd\n// +build !appengine\n\npackage isatty\n\nimport (\n\t\"syscall\"\n\t\"unsafe\"\n)\n\nconst ioctlReadTermios = syscall.TIOCGETA\n\n// IsTerminal return true if the file descriptor is terminal.\nfunc IsTerminal(fd uintptr) bool {\n\tvar termios syscall.Termios\n\t_, _, err := syscall.Syscall6(syscall.SYS_IOCTL, fd, ioctlReadTermios, uintptr(unsafe.Pointer(&termios)), 0, 0, 0)\n\treturn err == 0\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/reporters/stenographer/support/go-isatty/isatty_linux.go", "content": "// +build linux\n// +build !appengine\n\npackage isatty\n\nimport (\n\t\"syscall\"\n\t\"unsafe\"\n)\n\nconst ioctlReadTermios = syscall.TCGETS\n\n// IsTerminal return true if the file descriptor is terminal.\nfunc IsTerminal(fd uintptr) bool {\n\tvar termios syscall.Termios\n\t_, _, err := syscall.Syscall6(syscall.SYS_IOCTL, fd, ioctlReadTermios, uintptr(unsafe.Pointer(&termios)), 0, 0, 0)\n\treturn err == 0\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/reporters/stenographer/support/go-isatty/isatty_solaris.go", "content": "// +build solaris\n// +build !appengine\n\npackage isatty\n\nimport (\n\t\"golang.org/x/sys/unix\"\n)\n\n// IsTerminal returns true if the given file descriptor is a terminal.\n// see: http://src.illumos.org/source/xref/illumos-gate/usr/src/lib/libbc/libc/gen/common/isatty.c\nfunc IsTerminal(fd uintptr) bool {\n\tvar termio unix.Termio\n\terr := unix.IoctlSetTermio(int(fd), unix.TCGETA, &termio)\n\treturn err == nil\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/reporters/stenographer/support/go-isatty/isatty_windows.go", "content": "// +build windows\n// +build !appengine\n\npackage isatty\n\nimport (\n\t\"syscall\"\n\t\"unsafe\"\n)\n\nvar kernel32 = syscall.NewLazyDLL(\"kernel32.dll\")\nvar procGetConsoleMode = kernel32.NewProc(\"GetConsoleMode\")\n\n// IsTerminal return true if the file descriptor is terminal.\nfunc IsTerminal(fd uintptr) bool {\n\tvar st uint32\n\tr, _, e := syscall.Syscall(procGetConsoleMode.Addr(), 2, fd, uintptr(unsafe.Pointer(&st)), 0)\n\treturn r != 0 && e == 0\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/reporters/teamcity_reporter.go", "content": "/*\n\nTeamCity Reporter for Ginkgo\n\nMakes use of TeamCity's support for Service Messages\nhttp://confluence.jetbrains.com/display/TCD7/Build+Script+Interaction+with+TeamCity#BuildScriptInteractionwithTeamCity-ReportingTests\n*/\n\npackage reporters\n\nimport (\n\t\"fmt\"\n\t\"io\"\n\t\"strings\"\n\n\t\"github.com/onsi/ginkgo/config\"\n\t\"github.com/onsi/ginkgo/types\"\n)\n\nconst (\n\tmessageId = \"##teamcity\"\n)\n\ntype TeamCityReporter struct {\n\twriter io.Writer\n\ttestSuiteName string\n\tReporterConfig config.DefaultReporterConfigType\n}\n\nfunc NewTeamCityReporter(writer io.Writer) *TeamCityReporter {\n\treturn &TeamCityReporter{\n\t\twriter: writer,\n\t}\n}\n\nfunc (reporter *TeamCityReporter) SpecSuiteWillBegin(config config.GinkgoConfigType, summary *types.SuiteSummary) {\n\treporter.testSuiteName = escape(summary.SuiteDescription)\n\tfmt.Fprintf(reporter.writer, \"%s[testSuiteStarted name='%s']\\n\", messageId, reporter.testSuiteName)\n}\n\nfunc (reporter *TeamCityReporter) BeforeSuiteDidRun(setupSummary *types.SetupSummary) {\n\treporter.handleSetupSummary(\"BeforeSuite\", setupSummary)\n}\n\nfunc (reporter *TeamCityReporter) AfterSuiteDidRun(setupSummary *types.SetupSummary) {\n\treporter.handleSetupSummary(\"AfterSuite\", setupSummary)\n}\n\nfunc (reporter *TeamCityReporter) handleSetupSummary(name string, setupSummary *types.SetupSummary) {\n\tif setupSummary.State != types.SpecStatePassed {\n\t\ttestName := escape(name)\n\t\tfmt.Fprintf(reporter.writer, \"%s[testStarted name='%s']\\n\", messageId, testName)\n\t\tmessage := reporter.failureMessage(setupSummary.Failure)\n\t\tdetails := reporter.failureDetails(setupSummary.Failure)\n\t\tfmt.Fprintf(reporter.writer, \"%s[testFailed name='%s' message='%s' details='%s']\\n\", messageId, testName, message, details)\n\t\tdurationInMilliseconds := setupSummary.RunTime.Seconds() * 1000\n\t\tfmt.Fprintf(reporter.writer, \"%s[testFinished name='%s' duration='%v']\\n\", messageId, testName, durationInMilliseconds)\n\t}\n}\n\nfunc (reporter *TeamCityReporter) SpecWillRun(specSummary *types.SpecSummary) {\n\ttestName := escape(strings.Join(specSummary.ComponentTexts[1:], \" \"))\n\tfmt.Fprintf(reporter.writer, \"%s[testStarted name='%s']\\n\", messageId, testName)\n}\n\nfunc (reporter *TeamCityReporter) SpecDidComplete(specSummary *types.SpecSummary) {\n\ttestName := escape(strings.Join(specSummary.ComponentTexts[1:], \" \"))\n\n\tif reporter.ReporterConfig.ReportPassed && specSummary.State == types.SpecStatePassed {\n\t\tdetails := escape(specSummary.CapturedOutput)\n\t\tfmt.Fprintf(reporter.writer, \"%s[testPassed name='%s' details='%s']\\n\", messageId, testName, details)\n\t}\n\tif specSummary.State == types.SpecStateFailed || specSummary.State == types.SpecStateTimedOut || specSummary.State == types.SpecStatePanicked {\n\t\tmessage := reporter.failureMessage(specSummary.Failure)\n\t\tdetails := reporter.failureDetails(specSummary.Failure)\n\t\tfmt.Fprintf(reporter.writer, \"%s[testFailed name='%s' message='%s' details='%s']\\n\", messageId, testName, message, details)\n\t}\n\tif specSummary.State == types.SpecStateSkipped || specSummary.State == types.SpecStatePending {\n\t\tfmt.Fprintf(reporter.writer, \"%s[testIgnored name='%s']\\n\", messageId, testName)\n\t}\n\n\tdurationInMilliseconds := specSummary.RunTime.Seconds() * 1000\n\tfmt.Fprintf(reporter.writer, \"%s[testFinished name='%s' duration='%v']\\n\", messageId, testName, durationInMilliseconds)\n}\n\nfunc (reporter *TeamCityReporter) SpecSuiteDidEnd(summary *types.SuiteSummary) {\n\tfmt.Fprintf(reporter.writer, \"%s[testSuiteFinished name='%s']\\n\", messageId, reporter.testSuiteName)\n}\n\nfunc (reporter *TeamCityReporter) failureMessage(failure types.SpecFailure) string {\n\treturn escape(failure.ComponentCodeLocation.String())\n}\n\nfunc (reporter *TeamCityReporter) failureDetails(failure types.SpecFailure) string {\n\treturn escape(fmt.Sprintf(\"%s\\n%s\", failure.Message, failure.Location.String()))\n}\n\nfunc escape(output string) string {\n\toutput = strings.Replace(output, \"|\", \"||\", -1)\n\toutput = strings.Replace(output, \"'\", \"|'\", -1)\n\toutput = strings.Replace(output, \"\\n\", \"|n\", -1)\n\toutput = strings.Replace(output, \"\\r\", \"|r\", -1)\n\toutput = strings.Replace(output, \"[\", \"|[\", -1)\n\toutput = strings.Replace(output, \"]\", \"|]\", -1)\n\treturn output\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/types/code_location.go", "content": "package types\n\nimport (\n\t\"fmt\"\n)\n\ntype CodeLocation struct {\n\tFileName string\n\tLineNumber int\n\tFullStackTrace string\n}\n\nfunc (codeLocation CodeLocation) String() string {\n\treturn fmt.Sprintf(\"%s:%d\", codeLocation.FileName, codeLocation.LineNumber)\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/types/deprecation_support.go", "content": "package types\n\nimport (\n\t\"os\"\n\t\"strconv\"\n\t\"strings\"\n\t\"unicode\"\n\n\t\"github.com/onsi/ginkgo/config\"\n\t\"github.com/onsi/ginkgo/formatter\"\n)\n\ntype Deprecation struct {\n\tMessage string\n\tDocLink string\n\tVersion string\n}\n\ntype deprecations struct{}\n\nvar Deprecations = deprecations{}\n\nfunc (d deprecations) CustomReporter() Deprecation {\n\treturn Deprecation{\n\t\tMessage: \"You are using a custom reporter. Support for custom reporters will likely be removed in V2. Most users were using them to generate junit or teamcity reports and this functionality will be merged into the core reporter. In addition, Ginkgo 2.0 will support emitting a JSON-formatted report that users can then manipulate to generate custom reports.\\n\\n{{red}}{{bold}}If this change will be impactful to you please leave a comment on {{cyan}}{{underline}}https://github.com/onsi/ginkgo/issues/711{{/}}\",\n\t\tDocLink: \"removed-custom-reporters\",\n\t\tVersion: \"1.16.0\",\n\t}\n}\n\nfunc (d deprecations) V1Reporter() Deprecation {\n\treturn Deprecation{\n\t\tMessage: \"You are using a V1 Ginkgo Reporter. Please update your custom reporter to the new V2 Reporter interface.\",\n\t\tDocLink: \"changed-reporter-interface\",\n\t\tVersion: \"1.16.0\",\n\t}\n}\n\nfunc (d deprecations) Async() Deprecation {\n\treturn Deprecation{\n\t\tMessage: \"You are passing a Done channel to a test node to test asynchronous behavior. This is deprecated in Ginkgo V2. Your test will run synchronously and the timeout will be ignored.\",\n\t\tDocLink: \"removed-async-testing\",\n\t\tVersion: \"1.16.0\",\n\t}\n}\n\nfunc (d deprecations) Measure() Deprecation {\n\treturn Deprecation{\n\t\tMessage: \"Measure is deprecated and will be removed in Ginkgo V2. Please migrate to gomega/gmeasure.\",\n\t\tDocLink: \"removed-measure\",\n\t\tVersion: \"1.16.3\",\n\t}\n}\n\nfunc (d deprecations) ParallelNode() Deprecation {\n\treturn Deprecation{\n\t\tMessage: \"GinkgoParallelNode is deprecated and will be removed in Ginkgo V2. Please use GinkgoParallelProcess instead.\",\n\t\tDocLink: \"renamed-ginkgoparallelnode\",\n\t\tVersion: \"1.16.5\",\n\t}\n}\n\nfunc (d deprecations) Convert() Deprecation {\n\treturn Deprecation{\n\t\tMessage: \"The convert command is deprecated in Ginkgo V2\",\n\t\tDocLink: \"removed-ginkgo-convert\",\n\t\tVersion: \"1.16.0\",\n\t}\n}\n\nfunc (d deprecations) Blur() Deprecation {\n\treturn Deprecation{\n\t\tMessage: \"The blur command is deprecated in Ginkgo V2. Use 'ginkgo unfocus' instead.\",\n\t\tVersion: \"1.16.0\",\n\t}\n}\n\ntype DeprecationTracker struct {\n\tdeprecations map[Deprecation][]CodeLocation\n}\n\nfunc NewDeprecationTracker() *DeprecationTracker {\n\treturn &DeprecationTracker{\n\t\tdeprecations: map[Deprecation][]CodeLocation{},\n\t}\n}\n\nfunc (d *DeprecationTracker) TrackDeprecation(deprecation Deprecation, cl ...CodeLocation) {\n\tackVersion := os.Getenv(\"ACK_GINKGO_DEPRECATIONS\")\n\tif deprecation.Version != \"\" && ackVersion != \"\" {\n\t\tack := ParseSemVer(ackVersion)\n\t\tversion := ParseSemVer(deprecation.Version)\n\t\tif ack.GreaterThanOrEqualTo(version) {\n\t\t\treturn\n\t\t}\n\t}\n\n\tif len(cl) == 1 {\n\t\td.deprecations[deprecation] = append(d.deprecations[deprecation], cl[0])\n\t} else {\n\t\td.deprecations[deprecation] = []CodeLocation{}\n\t}\n}\n\nfunc (d *DeprecationTracker) DidTrackDeprecations() bool {\n\treturn len(d.deprecations) > 0\n}\n\nfunc (d *DeprecationTracker) DeprecationsReport() string {\n\tout := formatter.F(\"\\n{{light-yellow}}You're using deprecated Ginkgo functionality:{{/}}\\n\")\n\tout += formatter.F(\"{{light-yellow}}============================================={{/}}\\n\")\n\tout += formatter.F(\"{{bold}}{{green}}Ginkgo 2.0{{/}} is under active development and will introduce several new features, improvements, and a small handful of breaking changes.\\n\")\n\tout += formatter.F(\"A release candidate for 2.0 is now available and 2.0 should GA in Fall 2021. {{bold}}Please give the RC a try and send us feedback!{{/}}\\n\")\n\tout += formatter.F(\" - To learn more, view the migration guide at {{cyan}}{{underline}}https://github.com/onsi/ginkgo/blob/ver2/docs/MIGRATING_TO_V2.md{{/}}\\n\")\n\tout += formatter.F(\" - For instructions on using the Release Candidate visit {{cyan}}{{underline}}https://github.com/onsi/ginkgo/blob/ver2/docs/MIGRATING_TO_V2.md#using-the-beta{{/}}\\n\")\n\tout += formatter.F(\" - To comment, chime in at {{cyan}}{{underline}}https://github.com/onsi/ginkgo/issues/711{{/}}\\n\\n\")\n\n\tfor deprecation, locations := range d.deprecations {\n\t\tout += formatter.Fi(1, \"{{yellow}}\"+deprecation.Message+\"{{/}}\\n\")\n\t\tif deprecation.DocLink != \"\" {\n\t\t\tout += formatter.Fi(1, \"{{bold}}Learn more at:{{/}} {{cyan}}{{underline}}https://github.com/onsi/ginkgo/blob/ver2/docs/MIGRATING_TO_V2.md#%s{{/}}\\n\", deprecation.DocLink)\n\t\t}\n\t\tfor _, location := range locations {\n\t\t\tout += formatter.Fi(2, \"{{gray}}%s{{/}}\\n\", location)\n\t\t}\n\t}\n\tout += formatter.F(\"\\n{{gray}}To silence deprecations that can be silenced set the following environment variable:{{/}}\\n\")\n\tout += formatter.Fi(1, \"{{gray}}ACK_GINKGO_DEPRECATIONS=%s{{/}}\\n\", config.VERSION)\n\treturn out\n}\n\ntype SemVer struct {\n\tMajor int\n\tMinor int\n\tPatch int\n}\n\nfunc (s SemVer) GreaterThanOrEqualTo(o SemVer) bool {\n\treturn (s.Major > o.Major) ||\n\t\t(s.Major == o.Major && s.Minor > o.Minor) ||\n\t\t(s.Major == o.Major && s.Minor == o.Minor && s.Patch >= o.Patch)\n}\n\nfunc ParseSemVer(semver string) SemVer {\n\tout := SemVer{}\n\tsemver = strings.TrimFunc(semver, func(r rune) bool {\n\t\treturn !(unicode.IsNumber(r) || r == '.')\n\t})\n\tcomponents := strings.Split(semver, \".\")\n\tif len(components) > 0 {\n\t\tout.Major, _ = strconv.Atoi(components[0])\n\t}\n\tif len(components) > 1 {\n\t\tout.Minor, _ = strconv.Atoi(components[1])\n\t}\n\tif len(components) > 2 {\n\t\tout.Patch, _ = strconv.Atoi(components[2])\n\t}\n\treturn out\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/types/synchronization.go", "content": "package types\n\nimport (\n\t\"encoding/json\"\n)\n\ntype RemoteBeforeSuiteState int\n\nconst (\n\tRemoteBeforeSuiteStateInvalid RemoteBeforeSuiteState = iota\n\n\tRemoteBeforeSuiteStatePending\n\tRemoteBeforeSuiteStatePassed\n\tRemoteBeforeSuiteStateFailed\n\tRemoteBeforeSuiteStateDisappeared\n)\n\ntype RemoteBeforeSuiteData struct {\n\tData []byte\n\tState RemoteBeforeSuiteState\n}\n\nfunc (r RemoteBeforeSuiteData) ToJSON() []byte {\n\tdata, _ := json.Marshal(r)\n\treturn data\n}\n\ntype RemoteAfterSuiteData struct {\n\tCanRun bool\n}\n" }, { "path": "vendor/github.com/onsi/ginkgo/types/types.go", "content": "package types\n\nimport (\n\t\"strconv\"\n\t\"time\"\n)\n\nconst GINKGO_FOCUS_EXIT_CODE = 197\n\n/*\nSuiteSummary represents the a summary of the test suite and is passed to both\nReporter.SpecSuiteWillBegin\nReporter.SpecSuiteDidEnd\n\nthis is unfortunate as these two methods should receive different objects. When running in parallel\neach node does not deterministically know how many specs it will end up running.\n\nUnfortunately making such a change would break backward compatibility.\n\nUntil Ginkgo 2.0 comes out we will continue to reuse this struct but populate unknown fields\nwith -1.\n*/\ntype SuiteSummary struct {\n\tSuiteDescription string\n\tSuiteSucceeded bool\n\tSuiteID string\n\n\tNumberOfSpecsBeforeParallelization int\n\tNumberOfTotalSpecs int\n\tNumberOfSpecsThatWillBeRun int\n\tNumberOfPendingSpecs int\n\tNumberOfSkippedSpecs int\n\tNumberOfPassedSpecs int\n\tNumberOfFailedSpecs int\n\t// Flaked specs are those that failed initially, but then passed on a\n\t// subsequent try.\n\tNumberOfFlakedSpecs int\n\tRunTime time.Duration\n}\n\ntype SpecSummary struct {\n\tComponentTexts []string\n\tComponentCodeLocations []CodeLocation\n\n\tState SpecState\n\tRunTime time.Duration\n\tFailure SpecFailure\n\tIsMeasurement bool\n\tNumberOfSamples int\n\tMeasurements map[string]*SpecMeasurement\n\n\tCapturedOutput string\n\tSuiteID string\n}\n\nfunc (s SpecSummary) HasFailureState() bool {\n\treturn s.State.IsFailure()\n}\n\nfunc (s SpecSummary) TimedOut() bool {\n\treturn s.State == SpecStateTimedOut\n}\n\nfunc (s SpecSummary) Panicked() bool {\n\treturn s.State == SpecStatePanicked\n}\n\nfunc (s SpecSummary) Failed() bool {\n\treturn s.State == SpecStateFailed\n}\n\nfunc (s SpecSummary) Passed() bool {\n\treturn s.State == SpecStatePassed\n}\n\nfunc (s SpecSummary) Skipped() bool {\n\treturn s.State == SpecStateSkipped\n}\n\nfunc (s SpecSummary) Pending() bool {\n\treturn s.State == SpecStatePending\n}\n\ntype SetupSummary struct {\n\tComponentType SpecComponentType\n\tCodeLocation CodeLocation\n\n\tState SpecState\n\tRunTime time.Duration\n\tFailure SpecFailure\n\n\tCapturedOutput string\n\tSuiteID string\n}\n\ntype SpecFailure struct {\n\tMessage string\n\tLocation CodeLocation\n\tForwardedPanic string\n\n\tComponentIndex int\n\tComponentType SpecComponentType\n\tComponentCodeLocation CodeLocation\n}\n\ntype SpecMeasurement struct {\n\tName string\n\tInfo interface{}\n\tOrder int\n\n\tResults []float64\n\n\tSmallest float64\n\tLargest float64\n\tAverage float64\n\tStdDeviation float64\n\n\tSmallestLabel string\n\tLargestLabel string\n\tAverageLabel string\n\tUnits string\n\tPrecision int\n}\n\nfunc (s SpecMeasurement) PrecisionFmt() string {\n\tif s.Precision == 0 {\n\t\treturn \"%f\"\n\t}\n\n\tstr := strconv.Itoa(s.Precision)\n\n\treturn \"%.\" + str + \"f\"\n}\n\ntype SpecState uint\n\nconst (\n\tSpecStateInvalid SpecState = iota\n\n\tSpecStatePending\n\tSpecStateSkipped\n\tSpecStatePassed\n\tSpecStateFailed\n\tSpecStatePanicked\n\tSpecStateTimedOut\n)\n\nfunc (state SpecState) IsFailure() bool {\n\treturn state == SpecStateTimedOut || state == SpecStatePanicked || state == SpecStateFailed\n}\n\ntype SpecComponentType uint\n\nconst (\n\tSpecComponentTypeInvalid SpecComponentType = iota\n\n\tSpecComponentTypeContainer\n\tSpecComponentTypeBeforeSuite\n\tSpecComponentTypeAfterSuite\n\tSpecComponentTypeBeforeEach\n\tSpecComponentTypeJustBeforeEach\n\tSpecComponentTypeJustAfterEach\n\tSpecComponentTypeAfterEach\n\tSpecComponentTypeIt\n\tSpecComponentTypeMeasure\n)\n\ntype FlagType uint\n\nconst (\n\tFlagTypeNone FlagType = iota\n\tFlagTypeFocused\n\tFlagTypePending\n)\n" }, { "path": "vendor/github.com/onsi/gomega/.gitignore", "content": ".DS_Store\n*.test\n.\n.idea\ngomega.iml\n" }, { "path": "vendor/github.com/onsi/gomega/.travis.yml", "content": "language: go\narch:\n - amd64\n - ppc64le\n\ngo:\n - gotip\n - 1.16.x\n - 1.15.x\n\nenv:\n - GO111MODULE=on\n\ninstall: skip\n\nscript:\n - go mod tidy && git diff --exit-code go.mod go.sum\n - make test\n" }, { "path": "vendor/github.com/onsi/gomega/CHANGELOG.md", "content": "## 1.17.0\n\n### Features\n- Add HaveField matcher [3a26311]\n- add Error() assertions on the final error value of multi-return values (#480) [2f96943]\n- separate out offsets and timeouts (#478) [18a4723]\n- fix transformation error reporting (#479) [e001fab]\n- allow transform functions to report errors (#472) [bf93408]\n\n### Fixes\nStop using deprecated ioutil package (#467) [07f405d]\n\n## 1.16.0\n\n### Features\n- feat: HaveHTTPStatus multiple expected values (#465) [aa69f1b]\n- feat: HaveHTTPHeaderWithValue() matcher (#463) [dd83a96]\n- feat: HaveHTTPBody matcher (#462) [504e1f2]\n- feat: formatter for HTTP responses (#461) [e5b3157]\n\n## 1.15.0\n\n### Fixes\nThe previous version (1.14.0) introduced a change to allow `Eventually` and `Consistently` to support functions that make assertions. This was accomplished by overriding the global fail handler when running the callbacks passed to `Eventually/Consistently` in order to capture any resulting errors. Issue #457 uncovered a flaw with this approach: when multiple `Eventually`s are running concurrently they race when overriding the singleton global fail handler.\n\n1.15.0 resolves this by requiring users who want to make assertions in `Eventually/Consistently` call backs to explicitly pass in a function that takes a `Gomega` as an argument. The passed-in `Gomega` instance can be used to make assertions. Any failures will cause `Eventually` to retry the callback. This cleaner interface avoids the issue of swapping out globals but comes at the cost of changing the contract introduced in v1.14.0. As such 1.15.0 introduces a breaking change with respect to 1.14.0 - however we expect that adoption of this feature in 1.14.0 remains limited.\n\nIn addition, 1.15.0 cleans up some of Gomega's internals. Most users shouldn't notice any differences stemming from the refactoring that was made.\n\n## 1.14.0\n\n### Features\n- gmeasure.SamplingConfig now suppers a MinSamplingInterval [e94dbca]\n- Eventually and Consistently support functions that make assertions [2f04e6e]\n - Eventually and Consistently now allow their passed-in functions to make assertions.\n These assertions must pass or the function is considered to have failed and is retried.\n - Eventually and Consistently can now take functions with no return values. These implicitly return nil\n if they contain no failed assertion. Otherwise they return an error wrapping the first assertion failure. This allows\n these functions to be used with the Succeed() matcher.\n - Introduce InterceptGomegaFailure - an analogue to InterceptGomegaFailures - that captures the first assertion failure\n and halts execution in its passed-in callback.\n\n### Fixes\n- Call Verify GHTTPWithGomega receiver funcs (#454) [496e6fd]\n- Build a binary with an expected name (#446) [7356360]\n\n## 1.13.0\n\n### Features\n- gmeasure provides BETA support for benchmarking (#447) [8f2dfbf]\n- Set consistently and eventually defaults on init (#443) [12eb778]\n\n## 1.12.0\n\n### Features\n- Add Satisfy() matcher (#437) [c548f31]\n- tweak truncation message [3360b8c]\n- Add format.GomegaStringer (#427) [cc80b6f]\n- Add Clear() method to gbytes.Buffer [c3c0920]\n\n### Fixes\n- Fix error message in BeNumericallyMatcher (#432) [09c074a]\n- Bump github.com/onsi/ginkgo from 1.12.1 to 1.16.2 (#442) [e5f6ea0]\n- Bump github.com/golang/protobuf from 1.4.3 to 1.5.2 (#431) [adae3bf]\n- Bump golang.org/x/net (#441) [3275b35]\n\n## 1.11.0\n\n### Features\n- feature: add index to gstruct element func (#419) [334e00d]\n- feat(gexec) Add CompileTest functions. Close #410 (#411) [47c613f]\n\n### Fixes\n- Check more carefully for nils in WithTransform (#423) [3c60a15]\n- fix: typo in Makefile [b82522a]\n- Allow WithTransform function to accept a nil value (#422) [b75d2f2]\n- fix: print value type for interface{} containers (#409) [f08e2dc]\n- fix(BeElementOf): consistently flatten expected values [1fa9468]\n\n## 1.10.5\n\n### Fixes\n- fix: collections matchers should display type of expectation (#408) [6b4eb5a]\n- fix(ContainElements): consistently flatten expected values [073b880]\n- fix(ConsistOf): consistently flatten expected values [7266efe]\n\n## 1.10.4\n\n### Fixes\n- update golang net library to more recent version without vulnerability (#406) [817a8b9]\n- Correct spelling: alloted -> allotted (#403) [0bae715]\n- fix a panic in MessageWithDiff with long message (#402) [ea06b9b]\n\n## 1.10.3\n\n### Fixes\n- updates golang/x/net to fix vulnerability detected by snyk (#394) [c479356]\n\n## 1.10.2\n\n### Fixes\n- Add ExpectWithOffset, EventuallyWithOffset and ConsistentlyWithOffset to WithT (#391) [990941a]\n\n## 1.10.1\n\n### Fixes\n- Update dependencies (#389) [9f5eecd]\n\n## 1.10.0\n\n### Features\n- Add HaveHTTPStatusMatcher (#378) [f335c94]\n- Changed matcher for content-type in VerifyJSONRepresenting (#377) [6024f5b]\n- Make ghttp usable with x-unit style tests (#376) [c0be499]\n- Implement PanicWith matcher (#381) [f8032b4]\n\n## 1.9.0\n\n### Features\n- Add ContainElements matcher (#370) [2f57380]\n- Output missing and extra elements in ConsistOf failure message [a31eda7]\n- Document method LargestMatching [7c5a280]\n\n## 1.8.1\n\n### Fixes\n- Fix unexpected MatchError() behaviour (#375) [8ae7b2f]\n\n## 1.8.0\n\n### Features\n- Allow optional description to be lazily evaluated function (#364) [bf64010]\n- Support wrapped errors (#359) [0a981cb]\n\n## 1.7.1\n\n### Fixes\n- Bump go-yaml version to cover fixed ddos heuristic (#362) [95e431e]\n\n## 1.7.0\n\n### Features\n- export format property variables (#347) [642e5ba]\n\n### Fixes\n- minor fix in the documentation of ExpectWithOffset (#358) [beea727]\n\n## 1.6.0\n\n### Features\n\n- Display special chars on error [41e1b26]\n- Add BeElementOf matcher [6a48b48]\n\n### Fixes\n\n- Remove duplication in XML matcher tests [cc1a6cb]\n- Remove unnecessary conversions (#357) [7bf756a]\n- Fixed import order (#353) [2e3b965]\n- Added missing error handling in test (#355) [c98d3eb]\n- Simplify code (#356) [0001ed9]\n- Simplify code (#354) [0d9100e]\n- Fixed typos (#352) [3f647c4]\n- Add failure message tests to BeElementOf matcher [efe19c3]\n- Update go-testcov untested sections [37ee382]\n- Mark all uncovered files so go-testcov ./... works [53b150e]\n- Reenable gotip in travis [5c249dc]\n- Fix the typo of comment (#345) [f0e010e]\n- Optimize contain_element_matcher [abeb93d]\n\n\n## 1.5.0\n\n### Features\n\n- Added MatchKeys matchers [8b909fc]\n\n### Fixes and Minor Improvements\n\n- Add type aliases to remove stuttering [03b0461]\n- Don't run session_test.go on windows (#324) [5533ce8]\n\n## 1.4.3\n\n### Fixes:\n\n- ensure file name and line numbers are correctly reported for XUnit [6fff58f]\n- Fixed matcher for content-type (#305) [69d9b43]\n\n## 1.4.2\n\n### Fixes:\n\n- Add go.mod and go.sum files to define the gomega go module [f3de367, a085d30]\n- Work around go vet issue with Go v1.11 (#300) [40dd6ad]\n- Better output when using with go XUnit-style tests, fixes #255 (#297) [29a4b97]\n- Fix MatchJSON fail to parse json.RawMessage (#298) [ae19f1b]\n- show threshold in failure message of BeNumericallyMatcher (#293) [4bbecc8]\n\n## 1.4.1\n\n### Fixes:\n\n- Update documentation formatting and examples (#289) [9be8410]\n- allow 'Receive' matcher to be used with concrete types (#286) [41673fd]\n- Fix data race in ghttp server (#283) [7ac6b01]\n- Travis badge should only show master [cc102ab]\n\n## 1.4.0\n\n### Features\n- Make string pretty diff user configurable (#273) [eb112ce, 649b44d]\n\n### Fixes\n- Use httputil.DumpRequest to pretty-print unhandled requests (#278) [a4ff0fc, b7d1a52]\n- fix typo floa32 > float32 (#272) [041ae3b, 6e33911]\n- Fix link to documentation on adding your own matchers (#270) [bb2c830, fcebc62]\n- Use setters and getters to avoid race condition (#262) [13057c3, a9c79f1]\n- Avoid sending a signal if the process is not alive (#259) [b8043e5, 4fc1762]\n- Improve message from AssignableToTypeOf when expected value is nil (#281) [9c1fb20]\n\n## 1.3.0\n\nImprovements:\n\n- The `Equal` matcher matches byte slices more performantly.\n- Improved how `MatchError` matches error strings.\n- `MatchXML` ignores the order of xml node attributes.\n- Improve support for XUnit style golang tests. ([#254](https://github.com/onsi/gomega/issues/254))\n\nBug Fixes:\n\n- Diff generation now handles multi-byte sequences correctly.\n- Multiple goroutines can now call `gexec.Build` concurrently.\n\n## 1.2.0\n\nImprovements:\n\n- Added `BeSent` which attempts to send a value down a channel and fails if the attempt blocks. Can be paired with `Eventually` to safely send a value down a channel with a timeout.\n- `Ω`, `Expect`, `Eventually`, and `Consistently` now immediately `panic` if there is no registered fail handler. This is always a mistake that can hide failing tests.\n- `Receive()` no longer errors when passed a closed channel, it's perfectly fine to attempt to read from a closed channel so Ω(c).Should(Receive()) always fails and Ω(c).ShoudlNot(Receive()) always passes with a closed channel.\n- Added `HavePrefix` and `HaveSuffix` matchers.\n- `ghttp` can now handle concurrent requests.\n- Added `Succeed` which allows one to write `Ω(MyFunction()).Should(Succeed())`.\n- Improved `ghttp`'s behavior around failing assertions and panics:\n - If a registered handler makes a failing assertion `ghttp` will return `500`.\n - If a registered handler panics, `ghttp` will return `500` *and* fail the test. This is new behavior that may cause existing code to break. This code is almost certainly incorrect and creating a false positive.\n- `ghttp` servers can take an `io.Writer`. `ghttp` will write a line to the writer when each request arrives.\n- Added `WithTransform` matcher to allow munging input data before feeding into the relevant matcher\n- Added boolean `And`, `Or`, and `Not` matchers to allow creating composite matchers\n- Added `gbytes.TimeoutCloser`, `gbytes.TimeoutReader`, and `gbytes.TimeoutWriter` - these are convenience wrappers that timeout if the underlying Closer/Reader/Writer does not return within the alloted time.\n- Added `gbytes.BufferReader` - this constructs a `gbytes.Buffer` that asynchronously reads the passed-in `io.Reader` into its buffer.\n\nBug Fixes:\n- gexec: `session.Wait` now uses `EventuallyWithOffset` to get the right line number in the failure.\n- `ContainElement` no longer bails if a passed-in matcher errors.\n\n## 1.0 (8/2/2014)\n\nNo changes. Dropping \"beta\" from the version number.\n\n## 1.0.0-beta (7/8/2014)\nBreaking Changes:\n\n- Changed OmegaMatcher interface. Instead of having `Match` return failure messages, two new methods `FailureMessage` and `NegatedFailureMessage` are called instead.\n- Moved and renamed OmegaFailHandler to types.GomegaFailHandler and OmegaMatcher to types.GomegaMatcher. Any references to OmegaMatcher in any custom matchers will need to be changed to point to types.GomegaMatcher\n\nNew Test-Support Features:\n\n- `ghttp`: supports testing http clients\n - Provides a flexible fake http server\n - Provides a collection of chainable http handlers that perform assertions.\n- `gbytes`: supports making ordered assertions against streams of data\n - Provides a `gbytes.Buffer`\n - Provides a `Say` matcher to perform ordered assertions against output data\n- `gexec`: supports testing external processes\n - Provides support for building Go binaries\n - Wraps and starts `exec.Cmd` commands\n - Makes it easy to assert against stdout and stderr\n - Makes it easy to send signals and wait for processes to exit\n - Provides an `Exit` matcher to assert against exit code.\n\nDSL Changes:\n\n- `Eventually` and `Consistently` can accept `time.Duration` interval and polling inputs.\n- The default timeouts for `Eventually` and `Consistently` are now configurable.\n\nNew Matchers:\n\n- `ConsistOf`: order-independent assertion against the elements of an array/slice or keys of a map.\n- `BeTemporally`: like `BeNumerically` but for `time.Time`\n- `HaveKeyWithValue`: asserts a map has a given key with the given value.\n\nUpdated Matchers:\n\n- `Receive` matcher can take a matcher as an argument and passes only if the channel under test receives an objet that satisfies the passed-in matcher.\n- Matchers that implement `MatchMayChangeInTheFuture(actual interface{}) bool` can inform `Eventually` and/or `Consistently` when a match has no chance of changing status in the future. For example, `Receive` returns `false` when a channel is closed.\n\nMisc:\n\n- Start using semantic versioning\n- Start maintaining changelog\n\nMajor refactor:\n\n- Pull out Gomega's internal to `internal`\n" }, { "path": "vendor/github.com/onsi/gomega/CONTRIBUTING.md", "content": "# Contributing to Gomega\n\nYour contributions to Gomega are essential for its long-term maintenance and improvement. To make a contribution:\n\n- Please **open an issue first** - describe what problem you are trying to solve and give the community a forum for input and feedback ahead of investing time in writing code!\n- Ensure adequate test coverage:\n - Make sure to add appropriate unit tests\n - Please run all tests locally (`ginkgo -r -p`) and make sure they go green before submitting the PR\n - Please run following linter locally `go vet ./...` and make sure output does not contain any warnings\n- Update the documentation. In addition to standard `godoc` comments Gomega has extensive documentation on the `gh-pages` branch. If relevant, please submit a docs PR to that branch alongside your code PR.\n\nIf you're a committer, check out RELEASING.md to learn how to cut a release.\n\nThanks for supporting Gomega!\n" }, { "path": "vendor/github.com/onsi/gomega/Dockerfile", "content": "FROM golang:1.15\n" }, { "path": "vendor/github.com/onsi/gomega/LICENSE", "content": "Copyright (c) 2013-2014 Onsi Fakhouri\n\nPermission is hereby granted, free of charge, to any person obtaining\na copy of this software and associated documentation files (the\n\"Software\"), to deal in the Software without restriction, including\nwithout limitation the rights to use, copy, modify, merge, publish,\ndistribute, sublicense, and/or sell copies of the Software, and to\npermit persons to whom the Software is furnished to do so, subject to\nthe following conditions:\n\nThe above copyright notice and this permission notice shall be\nincluded in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND\nNONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE\nLIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION\nOF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION\nWITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n" }, { "path": "vendor/github.com/onsi/gomega/Makefile", "content": "###### Help ###################################################################\n\n.DEFAULT_GOAL = help\n\n.PHONY: help\n\nhelp: ## list Makefile targets\n\t@grep -E '^[a-zA-Z_-]+:.*?## .*$$' $(MAKEFILE_LIST) | sort | awk 'BEGIN {FS = \":.*?## \"}; {printf \"\\033[36m%-30s\\033[0m %s\\n\", $$1, $$2}'\n\n###### Targets ################################################################\n\ntest: version download fmt vet ginkgo ## Runs all build, static analysis, and test steps\n\ndownload: ## Download dependencies\n\tgo mod download\n\nvet: ## Run static code analysis\n\tgo vet ./...\n\nginkgo: ## Run tests using Ginkgo\n\tgo run github.com/onsi/ginkgo/ginkgo -p -r --randomizeAllSpecs --failOnPending --randomizeSuites --race\n\nfmt: ## Checks that the code is formatted correcty\n\t@@if [ -n \"$$(gofmt -s -e -l -d .)\" ]; then \\\n\t\techo \"gofmt check failed: run 'gofmt -s -e -l -w .'\"; \\\n\t\texit 1; \\\n\tfi\n\ndocker_test: ## Run tests in a container via docker-compose\n\tdocker-compose build test && docker-compose run --rm test make test\n\nversion: ## Display the version of Go\n\t@@go version\n" }, { "path": "vendor/github.com/onsi/gomega/README.md", "content": "![Gomega: Ginkgo's Preferred Matcher Library](http://onsi.github.io/gomega/images/gomega.png)\n\n[![test](https://github.com/onsi/gomega/actions/workflows/test.yml/badge.svg)](https://github.com/onsi/gomega/actions/workflows/test.yml)\n\nJump straight to the [docs](http://onsi.github.io/gomega/) to learn about Gomega, including a list of [all available matchers](http://onsi.github.io/gomega/#provided-matchers).\n\nIf you have a question, comment, bug report, feature request, etc. please open a GitHub issue.\n\n## [Ginkgo](http://github.com/onsi/ginkgo): a BDD Testing Framework for Golang\n\nLearn more about Ginkgo [here](http://onsi.github.io/ginkgo/)\n\n## Community Matchers\n\nA collection of community matchers is available on the [wiki](https://github.com/onsi/gomega/wiki).\n\n## License\n\nGomega is MIT-Licensed\n\nThe `ConsistOf` matcher uses [goraph](https://github.com/amitkgupta/goraph) which is embedded in the source to simplify distribution. goraph has an MIT license.\n" }, { "path": "vendor/github.com/onsi/gomega/RELEASING.md", "content": "A Gomega release is a tagged sha and a GitHub release. To cut a release:\n\n1. Ensure CHANGELOG.md is up to date.\n - Use `git log --pretty=format:'- %s [%h]' HEAD...vX.X.X` to list all the commits since the last release\n - Categorize the changes into\n - Breaking Changes (requires a major version)\n - New Features (minor version)\n - Fixes (fix version)\n - Maintenance (which in general should not be mentioned in `CHANGELOG.md` as they have no user impact)\n2. Update GOMEGA_VERSION in `gomega_dsl.go`\n3. Push a commit with the version number as the commit message (e.g. `v1.3.0`)\n4. Create a new [GitHub release](https://help.github.com/articles/creating-releases/) with the version number as the tag (e.g. `v1.3.0`). List the key changes in the release notes.\n" }, { "path": "vendor/github.com/onsi/gomega/docker-compose.yaml", "content": "version: '3.0'\n\nservices:\n test:\n build:\n dockerfile: Dockerfile\n context: .\n working_dir: /app\n volumes:\n - ${PWD}:/app\n" }, { "path": "vendor/github.com/onsi/gomega/format/format.go", "content": "/*\nGomega's format package pretty-prints objects. It explores input objects recursively and generates formatted, indented output with type information.\n*/\n\n// untested sections: 4\n\npackage format\n\nimport (\n\t\"context\"\n\t\"fmt\"\n\t\"reflect\"\n\t\"strconv\"\n\t\"strings\"\n\t\"time\"\n)\n\n// Use MaxDepth to set the maximum recursion depth when printing deeply nested objects\nvar MaxDepth = uint(10)\n\n// MaxLength of the string representation of an object.\n// If MaxLength is set to 0, the Object will not be truncated.\nvar MaxLength = 4000\n\n/*\nBy default, all objects (even those that implement fmt.Stringer and fmt.GoStringer) are recursively inspected to generate output.\n\nSet UseStringerRepresentation = true to use GoString (for fmt.GoStringers) or String (for fmt.Stringer) instead.\n\nNote that GoString and String don't always have all the information you need to understand why a test failed!\n*/\nvar UseStringerRepresentation = false\n\n/*\nPrint the content of context objects. By default it will be suppressed.\n\nSet PrintContextObjects = true to enable printing of the context internals.\n*/\nvar PrintContextObjects = false\n\n// TruncatedDiff choose if we should display a truncated pretty diff or not\nvar TruncatedDiff = true\n\n// TruncateThreshold (default 50) specifies the maximum length string to print in string comparison assertion error\n// messages.\nvar TruncateThreshold uint = 50\n\n// CharactersAroundMismatchToInclude (default 5) specifies how many contextual characters should be printed before and\n// after the first diff location in a truncated string assertion error message.\nvar CharactersAroundMismatchToInclude uint = 5\n\nvar contextType = reflect.TypeOf((*context.Context)(nil)).Elem()\nvar timeType = reflect.TypeOf(time.Time{})\n\n//The default indentation string emitted by the format package\nvar Indent = \" \"\n\nvar longFormThreshold = 20\n\n// GomegaStringer allows for custom formating of objects for gomega.\ntype GomegaStringer interface {\n\t// GomegaString will be used to custom format an object.\n\t// It does not follow UseStringerRepresentation value and will always be called regardless.\n\t// It also ignores the MaxLength value.\n\tGomegaString() string\n}\n\n/*\nGenerates a formatted matcher success/failure message of the form:\n\n\tExpected\n\t\t\n\t\n\t\t\n\nIf expected is omitted, then the message looks like:\n\n\tExpected\n\t\t\n\t\n*/\nfunc Message(actual interface{}, message string, expected ...interface{}) string {\n\tif len(expected) == 0 {\n\t\treturn fmt.Sprintf(\"Expected\\n%s\\n%s\", Object(actual, 1), message)\n\t}\n\treturn fmt.Sprintf(\"Expected\\n%s\\n%s\\n%s\", Object(actual, 1), message, Object(expected[0], 1))\n}\n\n/*\n\nGenerates a nicely formatted matcher success / failure message\n\nMuch like Message(...), but it attempts to pretty print diffs in strings\n\nExpected\n : \"...aaaaabaaaaa...\"\nto equal |\n : \"...aaaaazaaaaa...\"\n\n*/\n\nfunc MessageWithDiff(actual, message, expected string) string {\n\tif TruncatedDiff && len(actual) >= int(TruncateThreshold) && len(expected) >= int(TruncateThreshold) {\n\t\tdiffPoint := findFirstMismatch(actual, expected)\n\t\tformattedActual := truncateAndFormat(actual, diffPoint)\n\t\tformattedExpected := truncateAndFormat(expected, diffPoint)\n\n\t\tspacesBeforeFormattedMismatch := findFirstMismatch(formattedActual, formattedExpected)\n\n\t\ttabLength := 4\n\t\tspaceFromMessageToActual := tabLength + len(\": \") - len(message)\n\n\t\tpaddingCount := spaceFromMessageToActual + spacesBeforeFormattedMismatch\n\t\tif paddingCount < 0 {\n\t\t\treturn Message(formattedActual, message, formattedExpected)\n\t\t}\n\n\t\tpadding := strings.Repeat(\" \", paddingCount) + \"|\"\n\t\treturn Message(formattedActual, message+padding, formattedExpected)\n\t}\n\n\tactual = escapedWithGoSyntax(actual)\n\texpected = escapedWithGoSyntax(expected)\n\n\treturn Message(actual, message, expected)\n}\n\nfunc escapedWithGoSyntax(str string) string {\n\twithQuotes := fmt.Sprintf(\"%q\", str)\n\treturn withQuotes[1 : len(withQuotes)-1]\n}\n\nfunc truncateAndFormat(str string, index int) string {\n\tleftPadding := `...`\n\trightPadding := `...`\n\n\tstart := index - int(CharactersAroundMismatchToInclude)\n\tif start < 0 {\n\t\tstart = 0\n\t\tleftPadding = \"\"\n\t}\n\n\t// slice index must include the mis-matched character\n\tlengthOfMismatchedCharacter := 1\n\tend := index + int(CharactersAroundMismatchToInclude) + lengthOfMismatchedCharacter\n\tif end > len(str) {\n\t\tend = len(str)\n\t\trightPadding = \"\"\n\n\t}\n\treturn fmt.Sprintf(\"\\\"%s\\\"\", leftPadding+str[start:end]+rightPadding)\n}\n\nfunc findFirstMismatch(a, b string) int {\n\taSlice := strings.Split(a, \"\")\n\tbSlice := strings.Split(b, \"\")\n\n\tfor index, str := range aSlice {\n\t\tif index > len(bSlice)-1 {\n\t\t\treturn index\n\t\t}\n\t\tif str != bSlice[index] {\n\t\t\treturn index\n\t\t}\n\t}\n\n\tif len(b) > len(a) {\n\t\treturn len(a) + 1\n\t}\n\n\treturn 0\n}\n\nconst truncateHelpText = `\nGomega truncated this representation as it exceeds 'format.MaxLength'.\nConsider having the object provide a custom 'GomegaStringer' representation\nor adjust the parameters in Gomega's 'format' package.\n\nLearn more here: https://onsi.github.io/gomega/#adjusting-output\n`\n\nfunc truncateLongStrings(s string) string {\n\tif MaxLength > 0 && len(s) > MaxLength {\n\t\tvar sb strings.Builder\n\t\tfor i, r := range s {\n\t\t\tif i < MaxLength {\n\t\t\t\tsb.WriteRune(r)\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tbreak\n\t\t}\n\n\t\tsb.WriteString(\"...\\n\")\n\t\tsb.WriteString(truncateHelpText)\n\n\t\treturn sb.String()\n\t}\n\treturn s\n}\n\n/*\nPretty prints the passed in object at the passed in indentation level.\n\nObject recurses into deeply nested objects emitting pretty-printed representations of their components.\n\nModify format.MaxDepth to control how deep the recursion is allowed to go\nSet format.UseStringerRepresentation to true to return object.GoString() or object.String() when available instead of\nrecursing into the object.\n\nSet PrintContextObjects to true to print the content of objects implementing context.Context\n*/\nfunc Object(object interface{}, indentation uint) string {\n\tindent := strings.Repeat(Indent, int(indentation))\n\tvalue := reflect.ValueOf(object)\n\treturn fmt.Sprintf(\"%s<%s>: %s\", indent, formatType(value), formatValue(value, indentation))\n}\n\n/*\nIndentString takes a string and indents each line by the specified amount.\n*/\nfunc IndentString(s string, indentation uint) string {\n\tcomponents := strings.Split(s, \"\\n\")\n\tresult := \"\"\n\tindent := strings.Repeat(Indent, int(indentation))\n\tfor i, component := range components {\n\t\tresult += indent + component\n\t\tif i < len(components)-1 {\n\t\t\tresult += \"\\n\"\n\t\t}\n\t}\n\n\treturn result\n}\n\nfunc formatType(v reflect.Value) string {\n\tswitch v.Kind() {\n\tcase reflect.Invalid:\n\t\treturn \"nil\"\n\tcase reflect.Chan:\n\t\treturn fmt.Sprintf(\"%s | len:%d, cap:%d\", v.Type(), v.Len(), v.Cap())\n\tcase reflect.Ptr:\n\t\treturn fmt.Sprintf(\"%s | 0x%x\", v.Type(), v.Pointer())\n\tcase reflect.Slice:\n\t\treturn fmt.Sprintf(\"%s | len:%d, cap:%d\", v.Type(), v.Len(), v.Cap())\n\tcase reflect.Map:\n\t\treturn fmt.Sprintf(\"%s | len:%d\", v.Type(), v.Len())\n\tdefault:\n\t\treturn fmt.Sprintf(\"%s\", v.Type())\n\t}\n}\n\nfunc formatValue(value reflect.Value, indentation uint) string {\n\tif indentation > MaxDepth {\n\t\treturn \"...\"\n\t}\n\n\tif isNilValue(value) {\n\t\treturn \"nil\"\n\t}\n\n\tif value.CanInterface() {\n\t\tobj := value.Interface()\n\n\t\t// GomegaStringer will take precedence to other representations and disregards UseStringerRepresentation\n\t\tif x, ok := obj.(GomegaStringer); ok {\n\t\t\t// do not truncate a user-defined GoMegaString() value\n\t\t\treturn x.GomegaString()\n\t\t}\n\n\t\tif UseStringerRepresentation {\n\t\t\tswitch x := obj.(type) {\n\t\t\tcase fmt.GoStringer:\n\t\t\t\treturn truncateLongStrings(x.GoString())\n\t\t\tcase fmt.Stringer:\n\t\t\t\treturn truncateLongStrings(x.String())\n\t\t\t}\n\t\t}\n\t}\n\n\tif !PrintContextObjects {\n\t\tif value.Type().Implements(contextType) && indentation > 1 {\n\t\t\treturn \"\"\n\t\t}\n\t}\n\n\tswitch value.Kind() {\n\tcase reflect.Bool:\n\t\treturn fmt.Sprintf(\"%v\", value.Bool())\n\tcase reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:\n\t\treturn fmt.Sprintf(\"%v\", value.Int())\n\tcase reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64:\n\t\treturn fmt.Sprintf(\"%v\", value.Uint())\n\tcase reflect.Uintptr:\n\t\treturn fmt.Sprintf(\"0x%x\", value.Uint())\n\tcase reflect.Float32, reflect.Float64:\n\t\treturn fmt.Sprintf(\"%v\", value.Float())\n\tcase reflect.Complex64, reflect.Complex128:\n\t\treturn fmt.Sprintf(\"%v\", value.Complex())\n\tcase reflect.Chan:\n\t\treturn fmt.Sprintf(\"0x%x\", value.Pointer())\n\tcase reflect.Func:\n\t\treturn fmt.Sprintf(\"0x%x\", value.Pointer())\n\tcase reflect.Ptr:\n\t\treturn formatValue(value.Elem(), indentation)\n\tcase reflect.Slice:\n\t\treturn truncateLongStrings(formatSlice(value, indentation))\n\tcase reflect.String:\n\t\treturn truncateLongStrings(formatString(value.String(), indentation))\n\tcase reflect.Array:\n\t\treturn truncateLongStrings(formatSlice(value, indentation))\n\tcase reflect.Map:\n\t\treturn truncateLongStrings(formatMap(value, indentation))\n\tcase reflect.Struct:\n\t\tif value.Type() == timeType && value.CanInterface() {\n\t\t\tt, _ := value.Interface().(time.Time)\n\t\t\treturn t.Format(time.RFC3339Nano)\n\t\t}\n\t\treturn truncateLongStrings(formatStruct(value, indentation))\n\tcase reflect.Interface:\n\t\treturn formatInterface(value, indentation)\n\tdefault:\n\t\tif value.CanInterface() {\n\t\t\treturn truncateLongStrings(fmt.Sprintf(\"%#v\", value.Interface()))\n\t\t}\n\t\treturn truncateLongStrings(fmt.Sprintf(\"%#v\", value))\n\t}\n}\n\nfunc formatString(object interface{}, indentation uint) string {\n\tif indentation == 1 {\n\t\ts := fmt.Sprintf(\"%s\", object)\n\t\tcomponents := strings.Split(s, \"\\n\")\n\t\tresult := \"\"\n\t\tfor i, component := range components {\n\t\t\tif i == 0 {\n\t\t\t\tresult += component\n\t\t\t} else {\n\t\t\t\tresult += Indent + component\n\t\t\t}\n\t\t\tif i < len(components)-1 {\n\t\t\t\tresult += \"\\n\"\n\t\t\t}\n\t\t}\n\n\t\treturn result\n\t} else {\n\t\treturn fmt.Sprintf(\"%q\", object)\n\t}\n}\n\nfunc formatSlice(v reflect.Value, indentation uint) string {\n\tif v.Kind() == reflect.Slice && v.Type().Elem().Kind() == reflect.Uint8 && isPrintableString(string(v.Bytes())) {\n\t\treturn formatString(v.Bytes(), indentation)\n\t}\n\n\tl := v.Len()\n\tresult := make([]string, l)\n\tlongest := 0\n\tfor i := 0; i < l; i++ {\n\t\tresult[i] = formatValue(v.Index(i), indentation+1)\n\t\tif len(result[i]) > longest {\n\t\t\tlongest = len(result[i])\n\t\t}\n\t}\n\n\tif longest > longFormThreshold {\n\t\tindenter := strings.Repeat(Indent, int(indentation))\n\t\treturn fmt.Sprintf(\"[\\n%s%s,\\n%s]\", indenter+Indent, strings.Join(result, \",\\n\"+indenter+Indent), indenter)\n\t}\n\treturn fmt.Sprintf(\"[%s]\", strings.Join(result, \", \"))\n}\n\nfunc formatMap(v reflect.Value, indentation uint) string {\n\tl := v.Len()\n\tresult := make([]string, l)\n\n\tlongest := 0\n\tfor i, key := range v.MapKeys() {\n\t\tvalue := v.MapIndex(key)\n\t\tresult[i] = fmt.Sprintf(\"%s: %s\", formatValue(key, indentation+1), formatValue(value, indentation+1))\n\t\tif len(result[i]) > longest {\n\t\t\tlongest = len(result[i])\n\t\t}\n\t}\n\n\tif longest > longFormThreshold {\n\t\tindenter := strings.Repeat(Indent, int(indentation))\n\t\treturn fmt.Sprintf(\"{\\n%s%s,\\n%s}\", indenter+Indent, strings.Join(result, \",\\n\"+indenter+Indent), indenter)\n\t}\n\treturn fmt.Sprintf(\"{%s}\", strings.Join(result, \", \"))\n}\n\nfunc formatStruct(v reflect.Value, indentation uint) string {\n\tt := v.Type()\n\n\tl := v.NumField()\n\tresult := []string{}\n\tlongest := 0\n\tfor i := 0; i < l; i++ {\n\t\tstructField := t.Field(i)\n\t\tfieldEntry := v.Field(i)\n\t\trepresentation := fmt.Sprintf(\"%s: %s\", structField.Name, formatValue(fieldEntry, indentation+1))\n\t\tresult = append(result, representation)\n\t\tif len(representation) > longest {\n\t\t\tlongest = len(representation)\n\t\t}\n\t}\n\tif longest > longFormThreshold {\n\t\tindenter := strings.Repeat(Indent, int(indentation))\n\t\treturn fmt.Sprintf(\"{\\n%s%s,\\n%s}\", indenter+Indent, strings.Join(result, \",\\n\"+indenter+Indent), indenter)\n\t}\n\treturn fmt.Sprintf(\"{%s}\", strings.Join(result, \", \"))\n}\n\nfunc formatInterface(v reflect.Value, indentation uint) string {\n\treturn fmt.Sprintf(\"<%s>%s\", formatType(v.Elem()), formatValue(v.Elem(), indentation))\n}\n\nfunc isNilValue(a reflect.Value) bool {\n\tswitch a.Kind() {\n\tcase reflect.Invalid:\n\t\treturn true\n\tcase reflect.Chan, reflect.Func, reflect.Interface, reflect.Map, reflect.Ptr, reflect.Slice:\n\t\treturn a.IsNil()\n\t}\n\n\treturn false\n}\n\n/*\nReturns true when the string is entirely made of printable runes, false otherwise.\n*/\nfunc isPrintableString(str string) bool {\n\tfor _, runeValue := range str {\n\t\tif !strconv.IsPrint(runeValue) {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n" }, { "path": "vendor/github.com/onsi/gomega/go.mod", "content": "module github.com/onsi/gomega\n\ngo 1.16\n\nrequire (\n\tgithub.com/golang/protobuf v1.5.2\n\tgithub.com/onsi/ginkgo v1.16.4\n\tgolang.org/x/net v0.0.0-20210428140749-89ef3d95e781\n\tgopkg.in/yaml.v2 v2.4.0\n)\n" }, { "path": "vendor/github.com/onsi/gomega/go.sum", "content": "github.com/davecgh/go-spew v1.1.0/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38=\ngithub.com/davecgh/go-spew v1.1.1 h1:vj9j/u1bqnvCEfJOwUhtlOARqs3+rkHYY13jYWTU97c=\ngithub.com/davecgh/go-spew v1.1.1/go.mod h1:J7Y8YcW2NihsgmVo/mv3lAwl/skON4iLHjSsI+c5H38=\ngithub.com/fsnotify/fsnotify v1.4.7/go.mod h1:jwhsz4b93w/PPRr/qN1Yymfu8t87LnFCMoQvtojpjFo=\ngithub.com/fsnotify/fsnotify v1.4.9 h1:hsms1Qyu0jgnwNXIxa+/V/PDsU6CfLf6CNO8H7IWoS4=\ngithub.com/fsnotify/fsnotify v1.4.9/go.mod h1:znqG4EE+3YCdAaPaxE2ZRY/06pZUdp0tY4IgpuI1SZQ=\ngithub.com/go-task/slim-sprig v0.0.0-20210107165309-348f09dbbbc0 h1:p104kn46Q8WdvHunIJ9dAyjPVtrBPhSr3KT2yUst43I=\ngithub.com/go-task/slim-sprig v0.0.0-20210107165309-348f09dbbbc0/go.mod h1:fyg7847qk6SyHyPtNmDHnmrv/HOrqktSC+C9fM+CJOE=\ngithub.com/golang/protobuf v1.2.0/go.mod h1:6lQm79b+lXiMfvg/cZm0SGofjICqVBUtrP5yJMmIC1U=\ngithub.com/golang/protobuf v1.4.0-rc.1/go.mod h1:ceaxUfeHdC40wWswd/P6IGgMaK3YpKi5j83Wpe3EHw8=\ngithub.com/golang/protobuf v1.4.0-rc.1.0.20200221234624-67d41d38c208/go.mod h1:xKAWHe0F5eneWXFV3EuXVDTCmh+JuBKY0li0aMyXATA=\ngithub.com/golang/protobuf v1.4.0-rc.2/go.mod h1:LlEzMj4AhA7rCAGe4KMBDvJI+AwstrUpVNzEA03Pprs=\ngithub.com/golang/protobuf v1.4.0-rc.4.0.20200313231945-b860323f09d0/go.mod h1:WU3c8KckQ9AFe+yFwt9sWVRKCVIyN9cPHBJSNnbL67w=\ngithub.com/golang/protobuf v1.4.0/go.mod h1:jodUvKwWbYaEsadDk5Fwe5c77LiNKVO9IDvqG2KuDX0=\ngithub.com/golang/protobuf v1.4.2/go.mod h1:oDoupMAO8OvCJWAcko0GGGIgR6R6ocIYbsSw735rRwI=\ngithub.com/golang/protobuf v1.5.0/go.mod h1:FsONVRAS9T7sI+LIUmWTfcYkHO4aIWwzhcaSAoJOfIk=\ngithub.com/golang/protobuf v1.5.2 h1:ROPKBNFfQgOUMifHyP+KYbvpjbdoFNs+aK7DXlji0Tw=\ngithub.com/golang/protobuf v1.5.2/go.mod h1:XVQd3VNwM+JqD3oG2Ue2ip4fOMUkwXdXDdiuN0vRsmY=\ngithub.com/google/go-cmp v0.3.0/go.mod h1:8QqcDgzrUqlUb/G2PQTWiueGozuR1884gddMywk6iLU=\ngithub.com/google/go-cmp v0.3.1/go.mod h1:8QqcDgzrUqlUb/G2PQTWiueGozuR1884gddMywk6iLU=\ngithub.com/google/go-cmp v0.4.0/go.mod h1:v8dTdLbMG2kIc/vJvl+f65V22dbkXbowE6jgT/gNBxE=\ngithub.com/google/go-cmp v0.5.5 h1:Khx7svrCpmxxtHBq5j2mp/xVjsi8hQMfNLvJFAlrGgU=\ngithub.com/google/go-cmp v0.5.5/go.mod h1:v8dTdLbMG2kIc/vJvl+f65V22dbkXbowE6jgT/gNBxE=\ngithub.com/hpcloud/tail v1.0.0 h1:nfCOvKYfkgYP8hkirhJocXT2+zOD8yUNjXaWfTlyFKI=\ngithub.com/hpcloud/tail v1.0.0/go.mod h1:ab1qPbhIpdTxEkNHXyeSf5vhxWSCs/tWer42PpOxQnU=\ngithub.com/nxadm/tail v1.4.4/go.mod h1:kenIhsEOeOJmVchQTgglprH7qJGnHDVpk1VPCcaMI8A=\ngithub.com/nxadm/tail v1.4.8 h1:nPr65rt6Y5JFSKQO7qToXr7pePgD6Gwiw05lkbyAQTE=\ngithub.com/nxadm/tail v1.4.8/go.mod h1:+ncqLTQzXmGhMZNUePPaPqPvBxHAIsmXswZKocGu+AU=\ngithub.com/onsi/ginkgo v1.6.0/go.mod h1:lLunBs/Ym6LB5Z9jYTR76FiuTmxDTDusOGeTQH+WWjE=\ngithub.com/onsi/ginkgo v1.12.1/go.mod h1:zj2OWP4+oCPe1qIXoGWkgMRwljMUYCdkwsT2108oapk=\ngithub.com/onsi/ginkgo v1.16.4 h1:29JGrr5oVBm5ulCWet69zQkzWipVXIol6ygQUe/EzNc=\ngithub.com/onsi/ginkgo v1.16.4/go.mod h1:dX+/inL/fNMqNlz0e9LfyB9TswhZpCVdJM/Z6Vvnwo0=\ngithub.com/onsi/gomega v1.7.1/go.mod h1:XdKZgCCFLUoM/7CFJVPcG8C1xQ1AJ0vpAezJrB7JYyY=\ngithub.com/onsi/gomega v1.10.1/go.mod h1:iN09h71vgCQne3DLsj+A5owkum+a2tYe+TOCB1ybHNo=\ngithub.com/pmezard/go-difflib v1.0.0 h1:4DBwDE0NGyQoBHbLQYPwSUPoCMWR5BEzIk/f1lZbAQM=\ngithub.com/pmezard/go-difflib v1.0.0/go.mod h1:iKH77koFhYxTK1pcRnkKkqfTogsbg7gZNVY4sRDYZ/4=\ngithub.com/stretchr/objx v0.1.0 h1:4G4v2dO3VZwixGIRoQ5Lfboy6nUhCyYzaqnIAPPhYs4=\ngithub.com/stretchr/objx v0.1.0/go.mod h1:HFkY916IF+rwdDfMAkV7OtwuqBVzrE8GR6GFx+wExME=\ngithub.com/stretchr/testify v1.5.1 h1:nOGnQDM7FYENwehXlg/kFVnos3rEvtKTjRvOWSzb6H4=\ngithub.com/stretchr/testify v1.5.1/go.mod h1:5W2xD1RspED5o8YsWQXVCued0rvSQ+mT+I5cxcmMvtA=\ngithub.com/yuin/goldmark v1.2.1 h1:ruQGxdhGHe7FWOJPT0mKs5+pD2Xs1Bm/kdGlHO04FmM=\ngithub.com/yuin/goldmark v1.2.1/go.mod h1:3hX8gzYuyVAZsxl0MRgGTJEmQBFcNTphYh9decYSb74=\ngolang.org/x/crypto v0.0.0-20190308221718-c2843e01d9a2/go.mod h1:djNgcEr1/C05ACkg1iLfiJU5Ep61QUkGW8qpdssI0+w=\ngolang.org/x/crypto v0.0.0-20191011191535-87dc89f01550/go.mod h1:yigFU9vqHzYiE8UmvKecakEJjdnWj3jj499lnFckfCI=\ngolang.org/x/crypto v0.0.0-20200622213623-75b288015ac9 h1:psW17arqaxU48Z5kZ0CQnkZWQJsqcURM6tKiBApRjXI=\ngolang.org/x/crypto v0.0.0-20200622213623-75b288015ac9/go.mod h1:LzIPMQfyMNhhGPhUkYOs5KpL4U8rLKemX1yGLhDgUto=\ngolang.org/x/mod v0.3.0 h1:RM4zey1++hCTbCVQfnWeKs9/IEsaBLA8vTkd0WVtmH4=\ngolang.org/x/mod v0.3.0/go.mod h1:s0Qsj1ACt9ePp/hMypM3fl4fZqREWJwdYDEqhRiZZUA=\ngolang.org/x/net v0.0.0-20180906233101-161cd47e91fd/go.mod h1:mL1N/T3taQHkDXs73rZJwtUhF3w3ftmwwsq0BUmARs4=\ngolang.org/x/net v0.0.0-20190404232315-eb5bcb51f2a3/go.mod h1:t9HGtf8HONx5eT2rtn7q6eTqICYqUVnKs3thJo3Qplg=\ngolang.org/x/net v0.0.0-20190620200207-3b0461eec859/go.mod h1:z5CRVTTTmAJ677TzLLGU+0bjPO0LkuOLi4/5GtJWs/s=\ngolang.org/x/net v0.0.0-20200520004742-59133d7f0dd7/go.mod h1:qpuaurCH72eLCgpAm/N6yyVIVM9cpaDIP3A8BGJEC5A=\ngolang.org/x/net v0.0.0-20201021035429-f5854403a974/go.mod h1:sp8m0HH+o8qH0wwXwYZr8TS3Oi6o0r6Gce1SSxlDquU=\ngolang.org/x/net v0.0.0-20210428140749-89ef3d95e781 h1:DzZ89McO9/gWPsQXS/FVKAlG02ZjaQ6AlZRBimEYOd0=\ngolang.org/x/net v0.0.0-20210428140749-89ef3d95e781/go.mod h1:OJAsFXCWl8Ukc7SiCT/9KSuxbyM7479/AVlXFRxuMCk=\ngolang.org/x/sync v0.0.0-20180314180146-1d60e4601c6f/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM=\ngolang.org/x/sync v0.0.0-20190423024810-112230192c58/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM=\ngolang.org/x/sync v0.0.0-20201020160332-67f06af15bc9 h1:SQFwaSi55rU7vdNs9Yr0Z324VNlrF+0wMqRXT4St8ck=\ngolang.org/x/sync v0.0.0-20201020160332-67f06af15bc9/go.mod h1:RxMgew5VJxzue5/jJTE5uejpjVlOe/izrB70Jof72aM=\ngolang.org/x/sys v0.0.0-20180909124046-d0be0721c37e/go.mod h1:STP8DvDyc/dI5b8T5hshtkjS+E42TnysNCUPdjciGhY=\ngolang.org/x/sys v0.0.0-20190215142949-d0b11bdaac8a/go.mod h1:STP8DvDyc/dI5b8T5hshtkjS+E42TnysNCUPdjciGhY=\ngolang.org/x/sys v0.0.0-20190412213103-97732733099d/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20190904154756-749cb33beabd/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20191005200804-aed5e4c7ecf9/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20191120155948-bd437916bb0e/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20200323222414-85ca7c5b95cd/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20200930185726-fdedc70b468f/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20201119102817-f84b799fce68/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20210112080510-489259a85091/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/sys v0.0.0-20210423082822-04245dca01da h1:b3NXsE2LusjYGGjL5bxEVZZORm/YEFFrWFjR8eFrw/c=\ngolang.org/x/sys v0.0.0-20210423082822-04245dca01da/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\ngolang.org/x/term v0.0.0-20201126162022-7de9c90e9dd1 h1:v+OssWQX+hTHEmOBgwxdZxK4zHq3yOs8F9J7mk0PY8E=\ngolang.org/x/term v0.0.0-20201126162022-7de9c90e9dd1/go.mod h1:bj7SfCRtBDWHUb9snDiAeCFNEtKQo2Wmx5Cou7ajbmo=\ngolang.org/x/text v0.3.0/go.mod h1:NqM8EUOU14njkJ3fqMW+pc6Ldnwhi/IjpwHt7yyuwOQ=\ngolang.org/x/text v0.3.3/go.mod h1:5Zoc/QRtKVWzQhOtBMvqHzDpF6irO9z98xDceosuGiQ=\ngolang.org/x/text v0.3.6 h1:aRYxNxv6iGQlyVaZmk6ZgYEDa+Jg18DxebPSrd6bg1M=\ngolang.org/x/text v0.3.6/go.mod h1:5Zoc/QRtKVWzQhOtBMvqHzDpF6irO9z98xDceosuGiQ=\ngolang.org/x/tools v0.0.0-20180917221912-90fa682c2a6e/go.mod h1:n7NCudcB/nEzxVGmLbDWY5pfWTLqBcC2KZ6jyYvM4mQ=\ngolang.org/x/tools v0.0.0-20191119224855-298f0cb1881e/go.mod h1:b+2E5dAYhXwXZwtnZ6UAqBI28+e2cm9otk0dWdXHAEo=\ngolang.org/x/tools v0.0.0-20201224043029-2b0845dc783e h1:4nW4NLDYnU28ojHaHO8OVxFHk/aQ33U01a9cjED+pzE=\ngolang.org/x/tools v0.0.0-20201224043029-2b0845dc783e/go.mod h1:emZCQorbCU4vsT4fOWvOPXz4eW1wZW4PmDk9uLelYpA=\ngolang.org/x/xerrors v0.0.0-20190717185122-a985d3407aa7/go.mod h1:I/5z698sn9Ka8TeJc9MKroUUfqBBauWjQqLJ2OPfmY0=\ngolang.org/x/xerrors v0.0.0-20191011141410-1b5146add898/go.mod h1:I/5z698sn9Ka8TeJc9MKroUUfqBBauWjQqLJ2OPfmY0=\ngolang.org/x/xerrors v0.0.0-20191204190536-9bdfabe68543/go.mod h1:I/5z698sn9Ka8TeJc9MKroUUfqBBauWjQqLJ2OPfmY0=\ngolang.org/x/xerrors v0.0.0-20200804184101-5ec99f83aff1 h1:go1bK/D/BFZV2I8cIQd1NKEZ+0owSTG1fDTci4IqFcE=\ngolang.org/x/xerrors v0.0.0-20200804184101-5ec99f83aff1/go.mod h1:I/5z698sn9Ka8TeJc9MKroUUfqBBauWjQqLJ2OPfmY0=\ngoogle.golang.org/protobuf v0.0.0-20200109180630-ec00e32a8dfd/go.mod h1:DFci5gLYBciE7Vtevhsrf46CRTquxDuWsQurQQe4oz8=\ngoogle.golang.org/protobuf v0.0.0-20200221191635-4d8936d0db64/go.mod h1:kwYJMbMJ01Woi6D6+Kah6886xMZcty6N08ah7+eCXa0=\ngoogle.golang.org/protobuf v0.0.0-20200228230310-ab0ca4ff8a60/go.mod h1:cfTl7dwQJ+fmap5saPgwCLgHXTUD7jkjRqWcaiX5VyM=\ngoogle.golang.org/protobuf v1.20.1-0.20200309200217-e05f789c0967/go.mod h1:A+miEFZTKqfCUM6K7xSMQL9OKL/b6hQv+e19PK+JZNE=\ngoogle.golang.org/protobuf v1.21.0/go.mod h1:47Nbq4nVaFHyn7ilMalzfO3qCViNmqZ2kzikPIcrTAo=\ngoogle.golang.org/protobuf v1.23.0/go.mod h1:EGpADcykh3NcUnDUJcl1+ZksZNG86OlYog2l/sGQquU=\ngoogle.golang.org/protobuf v1.26.0-rc.1/go.mod h1:jlhhOSvTdKEhbULTjvd4ARK9grFBp09yW+WbY/TyQbw=\ngoogle.golang.org/protobuf v1.26.0 h1:bxAC2xTBsZGibn2RTntX0oH50xLsqy1OxA9tTL3p/lk=\ngoogle.golang.org/protobuf v1.26.0/go.mod h1:9q0QmTI4eRPtz6boOQmLYwt+qCgq0jsYwAQnmE0givc=\ngopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405 h1:yhCVgyC4o1eVCa2tZl7eS0r+SDo693bJlVdllGtEeKM=\ngopkg.in/check.v1 v0.0.0-20161208181325-20d25e280405/go.mod h1:Co6ibVJAznAaIkqp8huTwlJQCZ016jof/cbN4VW5Yz0=\ngopkg.in/fsnotify.v1 v1.4.7 h1:xOHLXZwVvI9hhs+cLKq5+I5onOuwQLhQwiu63xxlHs4=\ngopkg.in/fsnotify.v1 v1.4.7/go.mod h1:Tz8NjZHkW78fSQdbUxIjBTcgA1z1m8ZHf0WmKUhAMys=\ngopkg.in/tomb.v1 v1.0.0-20141024135613-dd632973f1e7 h1:uRGJdciOHaEIrze2W8Q3AKkepLTh2hOroT7a+7czfdQ=\ngopkg.in/tomb.v1 v1.0.0-20141024135613-dd632973f1e7/go.mod h1:dt/ZhP58zS4L8KSrWDmTeBkI65Dw0HsyUHuEVlX15mw=\ngopkg.in/yaml.v2 v2.2.2/go.mod h1:hI93XBmqTisBFMUTm0b8Fm+jr3Dg1NNxqwp+5A1VGuI=\ngopkg.in/yaml.v2 v2.2.4/go.mod h1:hI93XBmqTisBFMUTm0b8Fm+jr3Dg1NNxqwp+5A1VGuI=\ngopkg.in/yaml.v2 v2.3.0/go.mod h1:hI93XBmqTisBFMUTm0b8Fm+jr3Dg1NNxqwp+5A1VGuI=\ngopkg.in/yaml.v2 v2.4.0 h1:D8xgwECY7CYvx+Y2n4sBz93Jn9JRvxdiyyo8CTfuKaY=\ngopkg.in/yaml.v2 v2.4.0/go.mod h1:RDklbk79AGWmwhnvt/jBztapEOGDOx6ZbXqjP6csGnQ=\n" }, { "path": "vendor/github.com/onsi/gomega/gomega_dsl.go", "content": "/*\nGomega is the Ginkgo BDD-style testing framework's preferred matcher library.\n\nThe godoc documentation describes Gomega's API. More comprehensive documentation (with examples!) is available at http://onsi.github.io/gomega/\n\nGomega on Github: http://github.com/onsi/gomega\n\nLearn more about Ginkgo online: http://onsi.github.io/ginkgo\n\nGinkgo on Github: http://github.com/onsi/ginkgo\n\nGomega is MIT-Licensed\n*/\npackage gomega\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"time\"\n\n\t\"github.com/onsi/gomega/internal\"\n\t\"github.com/onsi/gomega/types\"\n)\n\nconst GOMEGA_VERSION = \"1.17.0\"\n\nconst nilGomegaPanic = `You are trying to make an assertion, but haven't registered Gomega's fail handler.\nIf you're using Ginkgo then you probably forgot to put your assertion in an It().\nAlternatively, you may have forgotten to register a fail handler with RegisterFailHandler() or RegisterTestingT().\nDepending on your vendoring solution you may be inadvertently importing gomega and subpackages (e.g. ghhtp, gexec,...) from different locations.\n`\n\n// Gomega describes the essential Gomega DSL. This interface allows libraries\n// to abstract between the standard package-level function implementations\n// and alternatives like *WithT.\n//\n// The types in the top-level DSL have gotten a bit messy due to earlier depracations that avoid stuttering\n// and due to an accidental use of a concrete type (*WithT) in an earlier release.\n//\n// As of 1.15 both the WithT and Ginkgo variants of Gomega are implemented by the same underlying object\n// however one (the Ginkgo variant) is exported as an interface (types.Gomega) whereas the other (the withT variant)\n// is shared as a concrete type (*WithT, which is aliased to *internal.Gomega). 1.15 did not clean this mess up to ensure\n// that declarations of *WithT in existing code are not broken by the upgrade to 1.15.\ntype Gomega = types.Gomega\n\n// DefaultGomega supplies the standard package-level implementation\nvar Default = Gomega(internal.NewGomega(internal.FetchDefaultDurationBundle()))\n\n// NewGomega returns an instance of Gomega wired into the passed-in fail handler.\n// You generally don't need to use this when using Ginkgo - RegisterFailHandler will wire up the global gomega\n// However creating a NewGomega with a custom fail handler can be useful in contexts where you want to use Gomega's\n// rich ecosystem of matchers without causing a test to fail. For example, to aggregate a series of potential failures\n// or for use in a non-test setting.\nfunc NewGomega(fail types.GomegaFailHandler) Gomega {\n\treturn internal.NewGomega(Default.(*internal.Gomega).DurationBundle).ConfigureWithFailHandler(fail)\n}\n\n// WithT wraps a *testing.T and provides `Expect`, `Eventually`, and `Consistently` methods. This allows you to leverage\n// Gomega's rich ecosystem of matchers in standard `testing` test suites.\n//\n// Use `NewWithT` to instantiate a `WithT`\n//\n// As of 1.15 both the WithT and Ginkgo variants of Gomega are implemented by the same underlying object\n// however one (the Ginkgo variant) is exported as an interface (types.Gomega) whereas the other (the withT variant)\n// is shared as a concrete type (*WithT, which is aliased to *internal.Gomega). 1.15 did not clean this mess up to ensure\n// that declarations of *WithT in existing code are not broken by the upgrade to 1.15.\ntype WithT = internal.Gomega\n\n// GomegaWithT is deprecated in favor of gomega.WithT, which does not stutter.\ntype GomegaWithT = WithT\n\n// NewWithT takes a *testing.T and returngs a `gomega.WithT` allowing you to use `Expect`, `Eventually`, and `Consistently` along with\n// Gomega's rich ecosystem of matchers in standard `testing` test suits.\n//\n// func TestFarmHasCow(t *testing.T) {\n// g := gomega.NewWithT(t)\n//\n// f := farm.New([]string{\"Cow\", \"Horse\"})\n// g.Expect(f.HasCow()).To(BeTrue(), \"Farm should have cow\")\n// }\nfunc NewWithT(t types.GomegaTestingT) *WithT {\n\treturn internal.NewGomega(Default.(*internal.Gomega).DurationBundle).ConfigureWithT(t)\n}\n\n// NewGomegaWithT is deprecated in favor of gomega.NewWithT, which does not stutter.\nvar NewGomegaWithT = NewWithT\n\n// RegisterFailHandler connects Ginkgo to Gomega. When a matcher fails\n// the fail handler passed into RegisterFailHandler is called.\nfunc RegisterFailHandler(fail types.GomegaFailHandler) {\n\tDefault.(*internal.Gomega).ConfigureWithFailHandler(fail)\n}\n\n// RegisterFailHandlerWithT is deprecated and will be removed in a future release.\n// users should use RegisterFailHandler, or RegisterTestingT\nfunc RegisterFailHandlerWithT(_ types.GomegaTestingT, fail types.GomegaFailHandler) {\n\tfmt.Println(\"RegisterFailHandlerWithT is deprecated. Please use RegisterFailHandler or RegisterTestingT instead.\")\n\tDefault.(*internal.Gomega).ConfigureWithFailHandler(fail)\n}\n\n// RegisterTestingT connects Gomega to Golang's XUnit style\n// Testing.T tests. It is now deprecated and you should use NewWithT() instead to get a fresh instance of Gomega for each test.\nfunc RegisterTestingT(t types.GomegaTestingT) {\n\tDefault.(*internal.Gomega).ConfigureWithT(t)\n}\n\n// InterceptGomegaFailures runs a given callback and returns an array of\n// failure messages generated by any Gomega assertions within the callback.\n// Exeuction continues after the first failure allowing users to collect all failures\n// in the callback.\n//\n// This is most useful when testing custom matchers, but can also be used to check\n// on a value using a Gomega assertion without causing a test failure.\nfunc InterceptGomegaFailures(f func()) []string {\n\toriginalHandler := Default.(*internal.Gomega).Fail\n\tfailures := []string{}\n\tDefault.(*internal.Gomega).Fail = func(message string, callerSkip ...int) {\n\t\tfailures = append(failures, message)\n\t}\n\tdefer func() {\n\t\tDefault.(*internal.Gomega).Fail = originalHandler\n\t}()\n\tf()\n\treturn failures\n}\n\n// InterceptGomegaFailure runs a given callback and returns the first\n// failure message generated by any Gomega assertions within the callback, wrapped in an error.\n//\n// The callback ceases execution as soon as the first failed assertion occurs, however Gomega\n// does not register a failure with the FailHandler registered via RegisterFailHandler - it is up\n// to the user to decide what to do with the returned error\nfunc InterceptGomegaFailure(f func()) (err error) {\n\toriginalHandler := Default.(*internal.Gomega).Fail\n\tDefault.(*internal.Gomega).Fail = func(message string, callerSkip ...int) {\n\t\terr = errors.New(message)\n\t\tpanic(\"stop execution\")\n\t}\n\n\tdefer func() {\n\t\tDefault.(*internal.Gomega).Fail = originalHandler\n\t\tif e := recover(); e != nil {\n\t\t\tif err == nil {\n\t\t\t\tpanic(e)\n\t\t\t}\n\t\t}\n\t}()\n\n\tf()\n\treturn err\n}\n\nfunc ensureDefaultGomegaIsConfigured() {\n\tif !Default.(*internal.Gomega).IsConfigured() {\n\t\tpanic(nilGomegaPanic)\n\t}\n}\n\n// Ω wraps an actual value allowing assertions to be made on it:\n// Ω(\"foo\").Should(Equal(\"foo\"))\n//\n// If Ω is passed more than one argument it will pass the *first* argument to the matcher.\n// All subsequent arguments will be required to be nil/zero.\n//\n// This is convenient if you want to make an assertion on a method/function that returns\n// a value and an error - a common patter in Go.\n//\n// For example, given a function with signature:\n// func MyAmazingThing() (int, error)\n//\n// Then:\n// Ω(MyAmazingThing()).Should(Equal(3))\n// Will succeed only if `MyAmazingThing()` returns `(3, nil)`\n//\n// Ω and Expect are identical\nfunc Ω(actual interface{}, extra ...interface{}) Assertion {\n\tensureDefaultGomegaIsConfigured()\n\treturn Default.Ω(actual, extra...)\n}\n\n// Expect wraps an actual value allowing assertions to be made on it:\n// Expect(\"foo\").To(Equal(\"foo\"))\n//\n// If Expect is passed more than one argument it will pass the *first* argument to the matcher.\n// All subsequent arguments will be required to be nil/zero.\n//\n// This is convenient if you want to make an assertion on a method/function that returns\n// a value and an error - a common patter in Go.\n//\n// For example, given a function with signature:\n// func MyAmazingThing() (int, error)\n//\n// Then:\n// Expect(MyAmazingThing()).Should(Equal(3))\n// Will succeed only if `MyAmazingThing()` returns `(3, nil)`\n//\n// Expect and Ω are identical\nfunc Expect(actual interface{}, extra ...interface{}) Assertion {\n\tensureDefaultGomegaIsConfigured()\n\treturn Default.Expect(actual, extra...)\n}\n\n// ExpectWithOffset wraps an actual value allowing assertions to be made on it:\n// ExpectWithOffset(1, \"foo\").To(Equal(\"foo\"))\n//\n// Unlike `Expect` and `Ω`, `ExpectWithOffset` takes an additional integer argument\n// that is used to modify the call-stack offset when computing line numbers. It is\n// the same as `Expect(...).WithOffset`.\n//\n// This is most useful in helper functions that make assertions. If you want Gomega's\n// error message to refer to the calling line in the test (as opposed to the line in the helper function)\n// set the first argument of `ExpectWithOffset` appropriately.\nfunc ExpectWithOffset(offset int, actual interface{}, extra ...interface{}) Assertion {\n\tensureDefaultGomegaIsConfigured()\n\treturn Default.ExpectWithOffset(offset, actual, extra...)\n}\n\n/*\nEventually enables making assertions on asynchronous behavior.\n\nEventually checks that an assertion *eventually* passes. Eventually blocks when called and attempts an assertion periodically until it passes or a timeout occurs. Both the timeout and polling interval are configurable as optional arguments.\nThe first optional argument is the timeout (which defaults to 1s), the second is the polling interval (which defaults to 10ms). Both intervals can be specified as time.Duration, parsable duration strings or floats/integers (in which case they are interpreted as seconds).\n\nEventually works with any Gomega compatible matcher and supports making assertions against three categories of actual value:\n\n**Category 1: Making Eventually assertions on values**\n\nThere are several examples of values that can change over time. These can be passed in to Eventually and will be passed to the matcher repeatedly until a match occurs. For example:\n\n c := make(chan bool)\n go DoStuff(c)\n Eventually(c, \"50ms\").Should(BeClosed())\n\nwill poll the channel repeatedly until it is closed. In this example `Eventually` will block until either the specified timeout of 50ms has elapsed or the channel is closed, whichever comes first.\n\nSeveral Gomega libraries allow you to use Eventually in this way. For example, the gomega/gexec package allows you to block until a *gexec.Session exits successfuly via:\n\n Eventually(session).Should(gexec.Exit(0))\n\nAnd the gomega/gbytes package allows you to monitor a streaming *gbytes.Buffer until a given string is seen:\n\n\tEventually(buffer).Should(gbytes.Say(\"hello there\"))\n\nIn these examples, both `session` and `buffer` are designed to be thread-safe when polled by the `Exit` and `Say` matchers. This is not true in general of most raw values, so while it is tempting to do something like:\n\n\t// THIS IS NOT THREAD-SAFE\n\tvar s *string\n\tgo mutateStringEventually(s)\n\tEventually(s).Should(Equal(\"I've changed\"))\n\nthis will trigger Go's race detector as the goroutine polling via Eventually will race over the value of s with the goroutine mutating the string. For cases like this you can use channels or introduce your own locking around s by passing Eventually a function.\n\n**Category 2: Make Eventually assertions on functions**\n\nEventually can be passed functions that **take no arguments** and **return at least one value**. When configured this way, Eventually will poll the function repeatedly and pass the first returned value to the matcher.\n\nFor example:\n\n Eventually(func() int {\n \treturn client.FetchCount()\n }).Should(BeNumerically(\">=\", 17))\n\n will repeatedly poll client.FetchCount until the BeNumerically matcher is satisfied. (Note that this example could have been written as Eventually(client.FetchCount).Should(BeNumerically(\">=\", 17)))\n\nIf multple values are returned by the function, Eventually will pass the first value to the matcher and require that all others are zero-valued. This allows you to pass Eventually a function that returns a value and an error - a common patternin Go.\n\nFor example, consider a method that returns a value and an error:\n func FetchFromDB() (string, error)\n\nThen\n Eventually(FetchFromDB).Should(Equal(\"got it\"))\n\nwill pass only if and when the returned error is nil *and* the returned string satisfies the matcher.\n\nIt is important to note that the function passed into Eventually is invoked *synchronously* when polled. Eventually does not (in fact, it cannot) kill the function if it takes longer to return than Eventually's configured timeout. You should design your functions with this in mind.\n\n**Category 3: Making assertions _in_ the function passed into Eventually**\n\nWhen testing complex systems it can be valuable to assert that a _set_ of assertions passes Eventually. Eventually supports this by accepting functions that take a single Gomega argument and return zero or more values.\n\nHere's an example that makes some asssertions and returns a value and error:\n\n\tEventually(func(g Gomega) (Widget, error) {\n\t\tids, err := client.FetchIDs()\n\t\tg.Expect(err).NotTo(HaveOccurred())\n\t\tg.Expect(ids).To(ContainElement(1138))\n\t\treturn client.FetchWidget(1138)\n\t}).Should(Equal(expectedWidget))\n\nwill pass only if all the assertions in the polled function pass and the return value satisfied the matcher.\n\nEventually also supports a special case polling function that takes a single Gomega argument and returns no values. Eventually assumes such a function is making assertions and is designed to work with the Succeed matcher to validate that all assertions have passed.\nFor example:\n\n Eventually(func(g Gomega) {\n \tmodel, err := client.Find(1138)\n \tg.Expect(err).NotTo(HaveOccurred())\n \tg.Expect(model.Reticulate()).To(Succeed())\n \tg.Expect(model.IsReticulated()).To(BeTrue())\n \tg.Expect(model.Save()).To(Succeed())\n }).Should(Succeed())\n\nwill rerun the function until all assertions pass.\n\n`Eventually` specifying a timeout interval (and an optional polling interval) are\nthe same as `Eventually(...).WithTimeout` or `Eventually(...).WithTimeout(...).WithPolling`.\n*/\nfunc Eventually(actual interface{}, intervals ...interface{}) AsyncAssertion {\n\tensureDefaultGomegaIsConfigured()\n\treturn Default.Eventually(actual, intervals...)\n}\n\n// EventuallyWithOffset operates like Eventually but takes an additional\n// initial argument to indicate an offset in the call stack. This is useful when building helper\n// functions that contain matchers. To learn more, read about `ExpectWithOffset`.\n//\n// `EventuallyWithOffset` is the same as `Eventually(...).WithOffset`.\n//\n// `EventuallyWithOffset` specifying a timeout interval (and an optional polling interval) are\n// the same as `Eventually(...).WithOffset(...).WithTimeout` or\n// `Eventually(...).WithOffset(...).WithTimeout(...).WithPolling`.\nfunc EventuallyWithOffset(offset int, actual interface{}, intervals ...interface{}) AsyncAssertion {\n\tensureDefaultGomegaIsConfigured()\n\treturn Default.EventuallyWithOffset(offset, actual, intervals...)\n}\n\n/*\nConsistently, like Eventually, enables making assertions on asynchronous behavior.\n\nConsistently blocks when called for a specified duration. During that duration Consistently repeatedly polls its matcher and ensures that it is satisfied. If the matcher is consistently satisfied, then Consistently will pass. Otherwise Consistently will fail.\n\nBoth the total waiting duration and the polling interval are configurable as optional arguments. The first optional arugment is the duration that Consistently will run for (defaults to 100ms), and the second argument is the polling interval (defaults to 10ms). As with Eventually, these intervals can be passed in as time.Duration, parsable duration strings or an integer or float number of seconds.\n\nConsistently accepts the same three categories of actual as Eventually, check the Eventually docs to learn more.\n\nConsistently is useful in cases where you want to assert that something *does not happen* for a period of time. For example, you may want to assert that a goroutine does *not* send data down a channel. In this case you could write:\n\n Consistently(channel, \"200ms\").ShouldNot(Receive())\n\nThis will block for 200 milliseconds and repeatedly check the channel and ensure nothing has been received.\n*/\nfunc Consistently(actual interface{}, intervals ...interface{}) AsyncAssertion {\n\tensureDefaultGomegaIsConfigured()\n\treturn Default.Consistently(actual, intervals...)\n}\n\n// ConsistentlyWithOffset operates like Consistently but takes an additional\n// initial argument to indicate an offset in the call stack. This is useful when building helper\n// functions that contain matchers. To learn more, read about `ExpectWithOffset`.\n//\n// `ConsistentlyWithOffset` is the same as `Consistently(...).WithOffset` and\n// optional `WithTimeout` and `WithPolling`.\nfunc ConsistentlyWithOffset(offset int, actual interface{}, intervals ...interface{}) AsyncAssertion {\n\tensureDefaultGomegaIsConfigured()\n\treturn Default.ConsistentlyWithOffset(offset, actual, intervals...)\n}\n\n// SetDefaultEventuallyTimeout sets the default timeout duration for Eventually. Eventually will repeatedly poll your condition until it succeeds, or until this timeout elapses.\nfunc SetDefaultEventuallyTimeout(t time.Duration) {\n\tDefault.SetDefaultEventuallyTimeout(t)\n}\n\n// SetDefaultEventuallyPollingInterval sets the default polling interval for Eventually.\nfunc SetDefaultEventuallyPollingInterval(t time.Duration) {\n\tDefault.SetDefaultEventuallyPollingInterval(t)\n}\n\n// SetDefaultConsistentlyDuration sets the default duration for Consistently. Consistently will verify that your condition is satisfied for this long.\nfunc SetDefaultConsistentlyDuration(t time.Duration) {\n\tDefault.SetDefaultConsistentlyDuration(t)\n}\n\n// SetDefaultConsistentlyPollingInterval sets the default polling interval for Consistently.\nfunc SetDefaultConsistentlyPollingInterval(t time.Duration) {\n\tDefault.SetDefaultConsistentlyPollingInterval(t)\n}\n\n// AsyncAssertion is returned by Eventually and Consistently and polls the actual value passed into Eventually against\n// the matcher passed to the Should and ShouldNot methods.\n//\n// Both Should and ShouldNot take a variadic optionalDescription argument.\n// This argument allows you to make your failure messages more descriptive.\n// If a single argument of type `func() string` is passed, this function will be lazily evaluated if a failure occurs\n// and the returned string is used to annotate the failure message.\n// Otherwise, this argument is passed on to fmt.Sprintf() and then used to annotate the failure message.\n//\n// Both Should and ShouldNot return a boolean that is true if the assertion passed and false if it failed.\n//\n// Example:\n//\n// Eventually(myChannel).Should(Receive(), \"Something should have come down the pipe.\")\n// Consistently(myChannel).ShouldNot(Receive(), func() string { return \"Nothing should have come down the pipe.\" })\ntype AsyncAssertion = types.AsyncAssertion\n\n// GomegaAsyncAssertion is deprecated in favor of AsyncAssertion, which does not stutter.\ntype GomegaAsyncAssertion = types.AsyncAssertion\n\n// Assertion is returned by Ω and Expect and compares the actual value to the matcher\n// passed to the Should/ShouldNot and To/ToNot/NotTo methods.\n//\n// Typically Should/ShouldNot are used with Ω and To/ToNot/NotTo are used with Expect\n// though this is not enforced.\n//\n// All methods take a variadic optionalDescription argument.\n// This argument allows you to make your failure messages more descriptive.\n// If a single argument of type `func() string` is passed, this function will be lazily evaluated if a failure occurs\n// and the returned string is used to annotate the failure message.\n// Otherwise, this argument is passed on to fmt.Sprintf() and then used to annotate the failure message.\n//\n// All methods return a bool that is true if the assertion passed and false if it failed.\n//\n// Example:\n//\n// Ω(farm.HasCow()).Should(BeTrue(), \"Farm %v should have a cow\", farm)\ntype Assertion = types.Assertion\n\n// GomegaAssertion is deprecated in favor of Assertion, which does not stutter.\ntype GomegaAssertion = types.Assertion\n\n// OmegaMatcher is deprecated in favor of the better-named and better-organized types.GomegaMatcher but sticks around to support existing code that uses it\ntype OmegaMatcher = types.GomegaMatcher\n" }, { "path": "vendor/github.com/onsi/gomega/internal/assertion.go", "content": "package internal\n\nimport (\n\t\"fmt\"\n\t\"reflect\"\n\n\t\"github.com/onsi/gomega/types\"\n)\n\ntype Assertion struct {\n\tactuals []interface{} // actual value plus all extra values\n\tactualIndex int // value to pass to the matcher\n\tvet vetinari // the vet to call before calling Gomega matcher\n\toffset int\n\tg *Gomega\n}\n\n// ...obligatory discworld reference, as \"vetineer\" doesn't sound ... quite right.\ntype vetinari func(assertion *Assertion, optionalDescription ...interface{}) bool\n\nfunc NewAssertion(actualInput interface{}, g *Gomega, offset int, extra ...interface{}) *Assertion {\n\treturn &Assertion{\n\t\tactuals: append([]interface{}{actualInput}, extra...),\n\t\tactualIndex: 0,\n\t\tvet: (*Assertion).vetActuals,\n\t\toffset: offset,\n\t\tg: g,\n\t}\n}\n\nfunc (assertion *Assertion) WithOffset(offset int) types.Assertion {\n\tassertion.offset = offset\n\treturn assertion\n}\n\nfunc (assertion *Assertion) Error() types.Assertion {\n\treturn &Assertion{\n\t\tactuals: assertion.actuals,\n\t\tactualIndex: len(assertion.actuals) - 1,\n\t\tvet: (*Assertion).vetError,\n\t\toffset: assertion.offset,\n\t\tg: assertion.g,\n\t}\n}\n\nfunc (assertion *Assertion) Should(matcher types.GomegaMatcher, optionalDescription ...interface{}) bool {\n\tassertion.g.THelper()\n\treturn assertion.vet(assertion, optionalDescription...) && assertion.match(matcher, true, optionalDescription...)\n}\n\nfunc (assertion *Assertion) ShouldNot(matcher types.GomegaMatcher, optionalDescription ...interface{}) bool {\n\tassertion.g.THelper()\n\treturn assertion.vet(assertion, optionalDescription...) && assertion.match(matcher, false, optionalDescription...)\n}\n\nfunc (assertion *Assertion) To(matcher types.GomegaMatcher, optionalDescription ...interface{}) bool {\n\tassertion.g.THelper()\n\treturn assertion.vet(assertion, optionalDescription...) && assertion.match(matcher, true, optionalDescription...)\n}\n\nfunc (assertion *Assertion) ToNot(matcher types.GomegaMatcher, optionalDescription ...interface{}) bool {\n\tassertion.g.THelper()\n\treturn assertion.vet(assertion, optionalDescription...) && assertion.match(matcher, false, optionalDescription...)\n}\n\nfunc (assertion *Assertion) NotTo(matcher types.GomegaMatcher, optionalDescription ...interface{}) bool {\n\tassertion.g.THelper()\n\treturn assertion.vet(assertion, optionalDescription...) && assertion.match(matcher, false, optionalDescription...)\n}\n\nfunc (assertion *Assertion) buildDescription(optionalDescription ...interface{}) string {\n\tswitch len(optionalDescription) {\n\tcase 0:\n\t\treturn \"\"\n\tcase 1:\n\t\tif describe, ok := optionalDescription[0].(func() string); ok {\n\t\t\treturn describe() + \"\\n\"\n\t\t}\n\t}\n\treturn fmt.Sprintf(optionalDescription[0].(string), optionalDescription[1:]...) + \"\\n\"\n}\n\nfunc (assertion *Assertion) match(matcher types.GomegaMatcher, desiredMatch bool, optionalDescription ...interface{}) bool {\n\tactualInput := assertion.actuals[assertion.actualIndex]\n\tmatches, err := matcher.Match(actualInput)\n\tassertion.g.THelper()\n\tif err != nil {\n\t\tdescription := assertion.buildDescription(optionalDescription...)\n\t\tassertion.g.Fail(description+err.Error(), 2+assertion.offset)\n\t\treturn false\n\t}\n\tif matches != desiredMatch {\n\t\tvar message string\n\t\tif desiredMatch {\n\t\t\tmessage = matcher.FailureMessage(actualInput)\n\t\t} else {\n\t\t\tmessage = matcher.NegatedFailureMessage(actualInput)\n\t\t}\n\t\tdescription := assertion.buildDescription(optionalDescription...)\n\t\tassertion.g.Fail(description+message, 2+assertion.offset)\n\t\treturn false\n\t}\n\n\treturn true\n}\n\n// vetActuals vets the actual values, with the (optional) exception of a\n// specific value, such as the first value in case non-error assertions, or the\n// last value in case of Error()-based assertions.\nfunc (assertion *Assertion) vetActuals(optionalDescription ...interface{}) bool {\n\tsuccess, message := vetActuals(assertion.actuals, assertion.actualIndex)\n\tif success {\n\t\treturn true\n\t}\n\n\tdescription := assertion.buildDescription(optionalDescription...)\n\tassertion.g.THelper()\n\tassertion.g.Fail(description+message, 2+assertion.offset)\n\treturn false\n}\n\n// vetError vets the actual values, except for the final error value, in case\n// the final error value is non-zero. Otherwise, it doesn't vet the actual\n// values, as these are allowed to take on any values unless there is a non-zero\n// error value.\nfunc (assertion *Assertion) vetError(optionalDescription ...interface{}) bool {\n\tif err := assertion.actuals[assertion.actualIndex]; err != nil {\n\t\t// Go error result idiom: all other actual values must be zero values.\n\t\treturn assertion.vetActuals(optionalDescription...)\n\t}\n\treturn true\n}\n\n// vetActuals vets a slice of actual values, optionally skipping a particular\n// value slice element, such as the first or last value slice element.\nfunc vetActuals(actuals []interface{}, skipIndex int) (bool, string) {\n\tfor i, actual := range actuals {\n\t\tif i == skipIndex {\n\t\t\tcontinue\n\t\t}\n\t\tif actual != nil {\n\t\t\tzeroValue := reflect.Zero(reflect.TypeOf(actual)).Interface()\n\t\t\tif !reflect.DeepEqual(zeroValue, actual) {\n\t\t\t\tmessage := fmt.Sprintf(\"Unexpected non-nil/non-zero argument at index %d:\\n\\t<%T>: %#v\", i, actual, actual)\n\t\t\t\treturn false, message\n\t\t\t}\n\t\t}\n\t}\n\treturn true, \"\"\n}\n" }, { "path": "vendor/github.com/onsi/gomega/internal/async_assertion.go", "content": "package internal\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"reflect\"\n\t\"runtime\"\n\t\"time\"\n\n\t\"github.com/onsi/gomega/types\"\n)\n\ntype AsyncAssertionType uint\n\nconst (\n\tAsyncAssertionTypeEventually AsyncAssertionType = iota\n\tAsyncAssertionTypeConsistently\n)\n\ntype AsyncAssertion struct {\n\tasyncType AsyncAssertionType\n\n\tactualIsFunc bool\n\tactualValue interface{}\n\tactualFunc func() ([]reflect.Value, error)\n\n\ttimeoutInterval time.Duration\n\tpollingInterval time.Duration\n\toffset int\n\tg *Gomega\n}\n\nfunc NewAsyncAssertion(asyncType AsyncAssertionType, actualInput interface{}, g *Gomega, timeoutInterval time.Duration, pollingInterval time.Duration, offset int) *AsyncAssertion {\n\tout := &AsyncAssertion{\n\t\tasyncType: asyncType,\n\t\ttimeoutInterval: timeoutInterval,\n\t\tpollingInterval: pollingInterval,\n\t\toffset: offset,\n\t\tg: g,\n\t}\n\n\tswitch actualType := reflect.TypeOf(actualInput); {\n\tcase actualType.Kind() != reflect.Func:\n\t\tout.actualValue = actualInput\n\tcase actualType.NumIn() == 0 && actualType.NumOut() > 0:\n\t\tout.actualIsFunc = true\n\t\tout.actualFunc = func() ([]reflect.Value, error) {\n\t\t\treturn reflect.ValueOf(actualInput).Call([]reflect.Value{}), nil\n\t\t}\n\tcase actualType.NumIn() == 1 && actualType.In(0).Implements(reflect.TypeOf((*types.Gomega)(nil)).Elem()):\n\t\tout.actualIsFunc = true\n\t\tout.actualFunc = func() (values []reflect.Value, err error) {\n\t\t\tvar assertionFailure error\n\t\t\tassertionCapturingGomega := NewGomega(g.DurationBundle).ConfigureWithFailHandler(func(message string, callerSkip ...int) {\n\t\t\t\tskip := 0\n\t\t\t\tif len(callerSkip) > 0 {\n\t\t\t\t\tskip = callerSkip[0]\n\t\t\t\t}\n\t\t\t\t_, file, line, _ := runtime.Caller(skip + 1)\n\t\t\t\tassertionFailure = fmt.Errorf(\"Assertion in callback at %s:%d failed:\\n%s\", file, line, message)\n\t\t\t\tpanic(\"stop execution\")\n\t\t\t})\n\n\t\t\tdefer func() {\n\t\t\t\tif actualType.NumOut() == 0 {\n\t\t\t\t\tif assertionFailure == nil {\n\t\t\t\t\t\tvalues = []reflect.Value{reflect.Zero(reflect.TypeOf((*error)(nil)).Elem())}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tvalues = []reflect.Value{reflect.ValueOf(assertionFailure)}\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\terr = assertionFailure\n\t\t\t\t}\n\t\t\t\tif e := recover(); e != nil && assertionFailure == nil {\n\t\t\t\t\tpanic(e)\n\t\t\t\t}\n\t\t\t}()\n\n\t\t\tvalues = reflect.ValueOf(actualInput).Call([]reflect.Value{reflect.ValueOf(assertionCapturingGomega)})\n\t\t\treturn\n\t\t}\n\tdefault:\n\t\tmsg := fmt.Sprintf(\"The function passed to Gomega's async assertions should either take no arguments and return values, or take a single Gomega interface that it can use to make assertions within the body of the function. When taking a Gomega interface the function can optionally return values or return nothing. The function you passed takes %d arguments and returns %d values.\", actualType.NumIn(), actualType.NumOut())\n\t\tg.Fail(msg, offset+4)\n\t}\n\n\treturn out\n}\n\nfunc (assertion *AsyncAssertion) WithOffset(offset int) types.AsyncAssertion {\n\tassertion.offset = offset\n\treturn assertion\n}\n\nfunc (assertion *AsyncAssertion) WithTimeout(interval time.Duration) types.AsyncAssertion {\n\tassertion.timeoutInterval = interval\n\treturn assertion\n}\n\nfunc (assertion *AsyncAssertion) WithPolling(interval time.Duration) types.AsyncAssertion {\n\tassertion.pollingInterval = interval\n\treturn assertion\n}\n\nfunc (assertion *AsyncAssertion) Should(matcher types.GomegaMatcher, optionalDescription ...interface{}) bool {\n\tassertion.g.THelper()\n\treturn assertion.match(matcher, true, optionalDescription...)\n}\n\nfunc (assertion *AsyncAssertion) ShouldNot(matcher types.GomegaMatcher, optionalDescription ...interface{}) bool {\n\tassertion.g.THelper()\n\treturn assertion.match(matcher, false, optionalDescription...)\n}\n\nfunc (assertion *AsyncAssertion) buildDescription(optionalDescription ...interface{}) string {\n\tswitch len(optionalDescription) {\n\tcase 0:\n\t\treturn \"\"\n\tcase 1:\n\t\tif describe, ok := optionalDescription[0].(func() string); ok {\n\t\t\treturn describe() + \"\\n\"\n\t\t}\n\t}\n\treturn fmt.Sprintf(optionalDescription[0].(string), optionalDescription[1:]...) + \"\\n\"\n}\n\nfunc (assertion *AsyncAssertion) pollActual() (interface{}, error) {\n\tif !assertion.actualIsFunc {\n\t\treturn assertion.actualValue, nil\n\t}\n\n\tvalues, err := assertion.actualFunc()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\textras := []interface{}{nil}\n\tfor _, value := range values[1:] {\n\t\textras = append(extras, value.Interface())\n\t}\n\tsuccess, message := vetActuals(extras, 0)\n\tif !success {\n\t\treturn nil, errors.New(message)\n\t}\n\n\treturn values[0].Interface(), nil\n}\n\nfunc (assertion *AsyncAssertion) matcherMayChange(matcher types.GomegaMatcher, value interface{}) bool {\n\tif assertion.actualIsFunc {\n\t\treturn true\n\t}\n\treturn types.MatchMayChangeInTheFuture(matcher, value)\n}\n\nfunc (assertion *AsyncAssertion) match(matcher types.GomegaMatcher, desiredMatch bool, optionalDescription ...interface{}) bool {\n\ttimer := time.Now()\n\ttimeout := time.After(assertion.timeoutInterval)\n\n\tvar matches bool\n\tvar err error\n\tmayChange := true\n\tvalue, err := assertion.pollActual()\n\tif err == nil {\n\t\tmayChange = assertion.matcherMayChange(matcher, value)\n\t\tmatches, err = matcher.Match(value)\n\t}\n\n\tassertion.g.THelper()\n\n\tfail := func(preamble string) {\n\t\terrMsg := \"\"\n\t\tmessage := \"\"\n\t\tif err != nil {\n\t\t\terrMsg = \"Error: \" + err.Error()\n\t\t} else {\n\t\t\tif desiredMatch {\n\t\t\t\tmessage = matcher.FailureMessage(value)\n\t\t\t} else {\n\t\t\t\tmessage = matcher.NegatedFailureMessage(value)\n\t\t\t}\n\t\t}\n\t\tassertion.g.THelper()\n\t\tdescription := assertion.buildDescription(optionalDescription...)\n\t\tassertion.g.Fail(fmt.Sprintf(\"%s after %.3fs.\\n%s%s%s\", preamble, time.Since(timer).Seconds(), description, message, errMsg), 3+assertion.offset)\n\t}\n\n\tif assertion.asyncType == AsyncAssertionTypeEventually {\n\t\tfor {\n\t\t\tif err == nil && matches == desiredMatch {\n\t\t\t\treturn true\n\t\t\t}\n\n\t\t\tif !mayChange {\n\t\t\t\tfail(\"No future change is possible. Bailing out early\")\n\t\t\t\treturn false\n\t\t\t}\n\n\t\t\tselect {\n\t\t\tcase <-time.After(assertion.pollingInterval):\n\t\t\t\tvalue, err = assertion.pollActual()\n\t\t\t\tif err == nil {\n\t\t\t\t\tmayChange = assertion.matcherMayChange(matcher, value)\n\t\t\t\t\tmatches, err = matcher.Match(value)\n\t\t\t\t}\n\t\t\tcase <-timeout:\n\t\t\t\tfail(\"Timed out\")\n\t\t\t\treturn false\n\t\t\t}\n\t\t}\n\t} else if assertion.asyncType == AsyncAssertionTypeConsistently {\n\t\tfor {\n\t\t\tif !(err == nil && matches == desiredMatch) {\n\t\t\t\tfail(\"Failed\")\n\t\t\t\treturn false\n\t\t\t}\n\n\t\t\tif !mayChange {\n\t\t\t\treturn true\n\t\t\t}\n\n\t\t\tselect {\n\t\t\tcase <-time.After(assertion.pollingInterval):\n\t\t\t\tvalue, err = assertion.pollActual()\n\t\t\t\tif err == nil {\n\t\t\t\t\tmayChange = assertion.matcherMayChange(matcher, value)\n\t\t\t\t\tmatches, err = matcher.Match(value)\n\t\t\t\t}\n\t\t\tcase <-timeout:\n\t\t\t\treturn true\n\t\t\t}\n\t\t}\n\t}\n\n\treturn false\n}\n" }, { "path": "vendor/github.com/onsi/gomega/internal/duration_bundle.go", "content": "package internal\n\nimport (\n\t\"fmt\"\n\t\"os\"\n\t\"reflect\"\n\t\"time\"\n)\n\ntype DurationBundle struct {\n\tEventuallyTimeout time.Duration\n\tEventuallyPollingInterval time.Duration\n\tConsistentlyDuration time.Duration\n\tConsistentlyPollingInterval time.Duration\n}\n\nconst (\n\tEventuallyTimeoutEnvVarName = \"GOMEGA_DEFAULT_EVENTUALLY_TIMEOUT\"\n\tEventuallyPollingIntervalEnvVarName = \"GOMEGA_DEFAULT_EVENTUALLY_POLLING_INTERVAL\"\n\n\tConsistentlyDurationEnvVarName = \"GOMEGA_DEFAULT_CONSISTENTLY_DURATION\"\n\tConsistentlyPollingIntervalEnvVarName = \"GOMEGA_DEFAULT_CONSISTENTLY_POLLING_INTERVAL\"\n)\n\nfunc FetchDefaultDurationBundle() DurationBundle {\n\treturn DurationBundle{\n\t\tEventuallyTimeout: durationFromEnv(EventuallyTimeoutEnvVarName, time.Second),\n\t\tEventuallyPollingInterval: durationFromEnv(EventuallyPollingIntervalEnvVarName, 10*time.Millisecond),\n\n\t\tConsistentlyDuration: durationFromEnv(ConsistentlyDurationEnvVarName, 100*time.Millisecond),\n\t\tConsistentlyPollingInterval: durationFromEnv(ConsistentlyPollingIntervalEnvVarName, 10*time.Millisecond),\n\t}\n}\n\nfunc durationFromEnv(key string, defaultDuration time.Duration) time.Duration {\n\tvalue := os.Getenv(key)\n\tif value == \"\" {\n\t\treturn defaultDuration\n\t}\n\tduration, err := time.ParseDuration(value)\n\tif err != nil {\n\t\tpanic(fmt.Sprintf(\"Expected a duration when using %s! Parse error %v\", key, err))\n\t}\n\treturn duration\n}\n\nfunc toDuration(input interface{}) time.Duration {\n\tduration, ok := input.(time.Duration)\n\tif ok {\n\t\treturn duration\n\t}\n\n\tvalue := reflect.ValueOf(input)\n\tkind := reflect.TypeOf(input).Kind()\n\n\tif reflect.Int <= kind && kind <= reflect.Int64 {\n\t\treturn time.Duration(value.Int()) * time.Second\n\t} else if reflect.Uint <= kind && kind <= reflect.Uint64 {\n\t\treturn time.Duration(value.Uint()) * time.Second\n\t} else if reflect.Float32 <= kind && kind <= reflect.Float64 {\n\t\treturn time.Duration(value.Float() * float64(time.Second))\n\t} else if reflect.String == kind {\n\t\tduration, err := time.ParseDuration(value.String())\n\t\tif err != nil {\n\t\t\tpanic(fmt.Sprintf(\"%#v is not a valid parsable duration string.\", input))\n\t\t}\n\t\treturn duration\n\t}\n\n\tpanic(fmt.Sprintf(\"%v is not a valid interval. Must be time.Duration, parsable duration string or a number.\", input))\n}\n" }, { "path": "vendor/github.com/onsi/gomega/internal/gomega.go", "content": "package internal\n\nimport (\n\t\"time\"\n\n\t\"github.com/onsi/gomega/types\"\n)\n\ntype Gomega struct {\n\tFail types.GomegaFailHandler\n\tTHelper func()\n\tDurationBundle DurationBundle\n}\n\nfunc NewGomega(bundle DurationBundle) *Gomega {\n\treturn &Gomega{\n\t\tFail: nil,\n\t\tTHelper: nil,\n\t\tDurationBundle: bundle,\n\t}\n}\n\nfunc (g *Gomega) IsConfigured() bool {\n\treturn g.Fail != nil && g.THelper != nil\n}\n\nfunc (g *Gomega) ConfigureWithFailHandler(fail types.GomegaFailHandler) *Gomega {\n\tg.Fail = fail\n\tg.THelper = func() {}\n\treturn g\n}\n\nfunc (g *Gomega) ConfigureWithT(t types.GomegaTestingT) *Gomega {\n\tg.Fail = func(message string, _ ...int) {\n\t\tt.Helper()\n\t\tt.Fatalf(\"\\n%s\", message)\n\t}\n\tg.THelper = t.Helper\n\treturn g\n}\n\nfunc (g *Gomega) Ω(actual interface{}, extra ...interface{}) types.Assertion {\n\treturn g.ExpectWithOffset(0, actual, extra...)\n}\n\nfunc (g *Gomega) Expect(actual interface{}, extra ...interface{}) types.Assertion {\n\treturn g.ExpectWithOffset(0, actual, extra...)\n}\n\nfunc (g *Gomega) ExpectWithOffset(offset int, actual interface{}, extra ...interface{}) types.Assertion {\n\treturn NewAssertion(actual, g, offset, extra...)\n}\n\nfunc (g *Gomega) Eventually(actual interface{}, intervals ...interface{}) types.AsyncAssertion {\n\treturn g.EventuallyWithOffset(0, actual, intervals...)\n}\n\nfunc (g *Gomega) EventuallyWithOffset(offset int, actual interface{}, intervals ...interface{}) types.AsyncAssertion {\n\ttimeoutInterval := g.DurationBundle.EventuallyTimeout\n\tpollingInterval := g.DurationBundle.EventuallyPollingInterval\n\tif len(intervals) > 0 {\n\t\ttimeoutInterval = toDuration(intervals[0])\n\t}\n\tif len(intervals) > 1 {\n\t\tpollingInterval = toDuration(intervals[1])\n\t}\n\n\treturn NewAsyncAssertion(AsyncAssertionTypeEventually, actual, g, timeoutInterval, pollingInterval, offset)\n}\n\nfunc (g *Gomega) Consistently(actual interface{}, intervals ...interface{}) types.AsyncAssertion {\n\treturn g.ConsistentlyWithOffset(0, actual, intervals...)\n}\n\nfunc (g *Gomega) ConsistentlyWithOffset(offset int, actual interface{}, intervals ...interface{}) types.AsyncAssertion {\n\ttimeoutInterval := g.DurationBundle.ConsistentlyDuration\n\tpollingInterval := g.DurationBundle.ConsistentlyPollingInterval\n\tif len(intervals) > 0 {\n\t\ttimeoutInterval = toDuration(intervals[0])\n\t}\n\tif len(intervals) > 1 {\n\t\tpollingInterval = toDuration(intervals[1])\n\t}\n\n\treturn NewAsyncAssertion(AsyncAssertionTypeConsistently, actual, g, timeoutInterval, pollingInterval, offset)\n}\n\nfunc (g *Gomega) SetDefaultEventuallyTimeout(t time.Duration) {\n\tg.DurationBundle.EventuallyTimeout = t\n}\n\nfunc (g *Gomega) SetDefaultEventuallyPollingInterval(t time.Duration) {\n\tg.DurationBundle.EventuallyPollingInterval = t\n}\n\nfunc (g *Gomega) SetDefaultConsistentlyDuration(t time.Duration) {\n\tg.DurationBundle.ConsistentlyDuration = t\n}\n\nfunc (g *Gomega) SetDefaultConsistentlyPollingInterval(t time.Duration) {\n\tg.DurationBundle.ConsistentlyPollingInterval = t\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/and.go", "content": "package matchers\n\nimport (\n\t\"fmt\"\n\n\t\"github.com/onsi/gomega/format\"\n\t\"github.com/onsi/gomega/types\"\n)\n\ntype AndMatcher struct {\n\tMatchers []types.GomegaMatcher\n\n\t// state\n\tfirstFailedMatcher types.GomegaMatcher\n}\n\nfunc (m *AndMatcher) Match(actual interface{}) (success bool, err error) {\n\tm.firstFailedMatcher = nil\n\tfor _, matcher := range m.Matchers {\n\t\tsuccess, err := matcher.Match(actual)\n\t\tif !success || err != nil {\n\t\t\tm.firstFailedMatcher = matcher\n\t\t\treturn false, err\n\t\t}\n\t}\n\treturn true, nil\n}\n\nfunc (m *AndMatcher) FailureMessage(actual interface{}) (message string) {\n\treturn m.firstFailedMatcher.FailureMessage(actual)\n}\n\nfunc (m *AndMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\t// not the most beautiful list of matchers, but not bad either...\n\treturn format.Message(actual, fmt.Sprintf(\"To not satisfy all of these matchers: %s\", m.Matchers))\n}\n\nfunc (m *AndMatcher) MatchMayChangeInTheFuture(actual interface{}) bool {\n\t/*\n\t\tExample with 3 matchers: A, B, C\n\n\t\tMatch evaluates them: T, F, => F\n\t\tSo match is currently F, what should MatchMayChangeInTheFuture() return?\n\t\tSeems like it only depends on B, since currently B MUST change to allow the result to become T\n\n\t\tMatch eval: T, T, T => T\n\t\tSo match is currently T, what should MatchMayChangeInTheFuture() return?\n\t\tSeems to depend on ANY of them being able to change to F.\n\t*/\n\n\tif m.firstFailedMatcher == nil {\n\t\t// so all matchers succeeded.. Any one of them changing would change the result.\n\t\tfor _, matcher := range m.Matchers {\n\t\t\tif types.MatchMayChangeInTheFuture(matcher, actual) {\n\t\t\t\treturn true\n\t\t\t}\n\t\t}\n\t\treturn false // none of were going to change\n\t}\n\t// one of the matchers failed.. it must be able to change in order to affect the result\n\treturn types.MatchMayChangeInTheFuture(m.firstFailedMatcher, actual)\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/assignable_to_type_of_matcher.go", "content": "// untested sections: 2\n\npackage matchers\n\nimport (\n\t\"fmt\"\n\t\"reflect\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype AssignableToTypeOfMatcher struct {\n\tExpected interface{}\n}\n\nfunc (matcher *AssignableToTypeOfMatcher) Match(actual interface{}) (success bool, err error) {\n\tif actual == nil && matcher.Expected == nil {\n\t\treturn false, fmt.Errorf(\"Refusing to compare to .\\nBe explicit and use BeNil() instead. This is to avoid mistakes where both sides of an assertion are erroneously uninitialized.\")\n\t} else if matcher.Expected == nil {\n\t\treturn false, fmt.Errorf(\"Refusing to compare type to .\\nBe explicit and use BeNil() instead. This is to avoid mistakes where both sides of an assertion are erroneously uninitialized.\")\n\t} else if actual == nil {\n\t\treturn false, nil\n\t}\n\n\tactualType := reflect.TypeOf(actual)\n\texpectedType := reflect.TypeOf(matcher.Expected)\n\n\treturn actualType.AssignableTo(expectedType), nil\n}\n\nfunc (matcher *AssignableToTypeOfMatcher) FailureMessage(actual interface{}) string {\n\treturn format.Message(actual, fmt.Sprintf(\"to be assignable to the type: %T\", matcher.Expected))\n}\n\nfunc (matcher *AssignableToTypeOfMatcher) NegatedFailureMessage(actual interface{}) string {\n\treturn format.Message(actual, fmt.Sprintf(\"not to be assignable to the type: %T\", matcher.Expected))\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/attributes_slice.go", "content": "package matchers\n\nimport (\n\t\"encoding/xml\"\n\t\"strings\"\n)\n\ntype attributesSlice []xml.Attr\n\nfunc (attrs attributesSlice) Len() int { return len(attrs) }\nfunc (attrs attributesSlice) Less(i, j int) bool {\n\treturn strings.Compare(attrs[i].Name.Local, attrs[j].Name.Local) == -1\n}\nfunc (attrs attributesSlice) Swap(i, j int) { attrs[i], attrs[j] = attrs[j], attrs[i] }\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/be_a_directory.go", "content": "// untested sections: 5\n\npackage matchers\n\nimport (\n\t\"fmt\"\n\t\"os\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype notADirectoryError struct {\n\tos.FileInfo\n}\n\nfunc (t notADirectoryError) Error() string {\n\tfileInfo := os.FileInfo(t)\n\tswitch {\n\tcase fileInfo.Mode().IsRegular():\n\t\treturn \"file is a regular file\"\n\tdefault:\n\t\treturn fmt.Sprintf(\"file mode is: %s\", fileInfo.Mode().String())\n\t}\n}\n\ntype BeADirectoryMatcher struct {\n\texpected interface{}\n\terr error\n}\n\nfunc (matcher *BeADirectoryMatcher) Match(actual interface{}) (success bool, err error) {\n\tactualFilename, ok := actual.(string)\n\tif !ok {\n\t\treturn false, fmt.Errorf(\"BeADirectoryMatcher matcher expects a file path\")\n\t}\n\n\tfileInfo, err := os.Stat(actualFilename)\n\tif err != nil {\n\t\tmatcher.err = err\n\t\treturn false, nil\n\t}\n\n\tif !fileInfo.Mode().IsDir() {\n\t\tmatcher.err = notADirectoryError{fileInfo}\n\t\treturn false, nil\n\t}\n\treturn true, nil\n}\n\nfunc (matcher *BeADirectoryMatcher) FailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, fmt.Sprintf(\"to be a directory: %s\", matcher.err))\n}\n\nfunc (matcher *BeADirectoryMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, fmt.Sprintf(\"not be a directory\"))\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/be_a_regular_file.go", "content": "// untested sections: 5\n\npackage matchers\n\nimport (\n\t\"fmt\"\n\t\"os\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype notARegularFileError struct {\n\tos.FileInfo\n}\n\nfunc (t notARegularFileError) Error() string {\n\tfileInfo := os.FileInfo(t)\n\tswitch {\n\tcase fileInfo.IsDir():\n\t\treturn \"file is a directory\"\n\tdefault:\n\t\treturn fmt.Sprintf(\"file mode is: %s\", fileInfo.Mode().String())\n\t}\n}\n\ntype BeARegularFileMatcher struct {\n\texpected interface{}\n\terr error\n}\n\nfunc (matcher *BeARegularFileMatcher) Match(actual interface{}) (success bool, err error) {\n\tactualFilename, ok := actual.(string)\n\tif !ok {\n\t\treturn false, fmt.Errorf(\"BeARegularFileMatcher matcher expects a file path\")\n\t}\n\n\tfileInfo, err := os.Stat(actualFilename)\n\tif err != nil {\n\t\tmatcher.err = err\n\t\treturn false, nil\n\t}\n\n\tif !fileInfo.Mode().IsRegular() {\n\t\tmatcher.err = notARegularFileError{fileInfo}\n\t\treturn false, nil\n\t}\n\treturn true, nil\n}\n\nfunc (matcher *BeARegularFileMatcher) FailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, fmt.Sprintf(\"to be a regular file: %s\", matcher.err))\n}\n\nfunc (matcher *BeARegularFileMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, fmt.Sprintf(\"not be a regular file\"))\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/be_an_existing_file.go", "content": "// untested sections: 3\n\npackage matchers\n\nimport (\n\t\"fmt\"\n\t\"os\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype BeAnExistingFileMatcher struct {\n\texpected interface{}\n}\n\nfunc (matcher *BeAnExistingFileMatcher) Match(actual interface{}) (success bool, err error) {\n\tactualFilename, ok := actual.(string)\n\tif !ok {\n\t\treturn false, fmt.Errorf(\"BeAnExistingFileMatcher matcher expects a file path\")\n\t}\n\n\tif _, err = os.Stat(actualFilename); err != nil {\n\t\tswitch {\n\t\tcase os.IsNotExist(err):\n\t\t\treturn false, nil\n\t\tdefault:\n\t\t\treturn false, err\n\t\t}\n\t}\n\n\treturn true, nil\n}\n\nfunc (matcher *BeAnExistingFileMatcher) FailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, fmt.Sprintf(\"to exist\"))\n}\n\nfunc (matcher *BeAnExistingFileMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, fmt.Sprintf(\"not to exist\"))\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/be_closed_matcher.go", "content": "// untested sections: 2\n\npackage matchers\n\nimport (\n\t\"fmt\"\n\t\"reflect\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype BeClosedMatcher struct {\n}\n\nfunc (matcher *BeClosedMatcher) Match(actual interface{}) (success bool, err error) {\n\tif !isChan(actual) {\n\t\treturn false, fmt.Errorf(\"BeClosed matcher expects a channel. Got:\\n%s\", format.Object(actual, 1))\n\t}\n\n\tchannelType := reflect.TypeOf(actual)\n\tchannelValue := reflect.ValueOf(actual)\n\n\tif channelType.ChanDir() == reflect.SendDir {\n\t\treturn false, fmt.Errorf(\"BeClosed matcher cannot determine if a send-only channel is closed or open. Got:\\n%s\", format.Object(actual, 1))\n\t}\n\n\twinnerIndex, _, open := reflect.Select([]reflect.SelectCase{\n\t\t{Dir: reflect.SelectRecv, Chan: channelValue},\n\t\t{Dir: reflect.SelectDefault},\n\t})\n\n\tvar closed bool\n\tif winnerIndex == 0 {\n\t\tclosed = !open\n\t} else if winnerIndex == 1 {\n\t\tclosed = false\n\t}\n\n\treturn closed, nil\n}\n\nfunc (matcher *BeClosedMatcher) FailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"to be closed\")\n}\n\nfunc (matcher *BeClosedMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"to be open\")\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/be_element_of_matcher.go", "content": "// untested sections: 1\n\npackage matchers\n\nimport (\n\t\"fmt\"\n\t\"reflect\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype BeElementOfMatcher struct {\n\tElements []interface{}\n}\n\nfunc (matcher *BeElementOfMatcher) Match(actual interface{}) (success bool, err error) {\n\tif reflect.TypeOf(actual) == nil {\n\t\treturn false, fmt.Errorf(\"BeElement matcher expects actual to be typed\")\n\t}\n\n\tvar lastError error\n\tfor _, m := range flatten(matcher.Elements) {\n\t\tmatcher := &EqualMatcher{Expected: m}\n\t\tsuccess, err := matcher.Match(actual)\n\t\tif err != nil {\n\t\t\tlastError = err\n\t\t\tcontinue\n\t\t}\n\t\tif success {\n\t\t\treturn true, nil\n\t\t}\n\t}\n\n\treturn false, lastError\n}\n\nfunc (matcher *BeElementOfMatcher) FailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"to be an element of\", presentable(matcher.Elements))\n}\n\nfunc (matcher *BeElementOfMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"not to be an element of\", presentable(matcher.Elements))\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/be_empty_matcher.go", "content": "// untested sections: 2\n\npackage matchers\n\nimport (\n\t\"fmt\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype BeEmptyMatcher struct {\n}\n\nfunc (matcher *BeEmptyMatcher) Match(actual interface{}) (success bool, err error) {\n\tlength, ok := lengthOf(actual)\n\tif !ok {\n\t\treturn false, fmt.Errorf(\"BeEmpty matcher expects a string/array/map/channel/slice. Got:\\n%s\", format.Object(actual, 1))\n\t}\n\n\treturn length == 0, nil\n}\n\nfunc (matcher *BeEmptyMatcher) FailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"to be empty\")\n}\n\nfunc (matcher *BeEmptyMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"not to be empty\")\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/be_equivalent_to_matcher.go", "content": "// untested sections: 2\n\npackage matchers\n\nimport (\n\t\"fmt\"\n\t\"reflect\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype BeEquivalentToMatcher struct {\n\tExpected interface{}\n}\n\nfunc (matcher *BeEquivalentToMatcher) Match(actual interface{}) (success bool, err error) {\n\tif actual == nil && matcher.Expected == nil {\n\t\treturn false, fmt.Errorf(\"Both actual and expected must not be nil.\")\n\t}\n\n\tconvertedActual := actual\n\n\tif actual != nil && matcher.Expected != nil && reflect.TypeOf(actual).ConvertibleTo(reflect.TypeOf(matcher.Expected)) {\n\t\tconvertedActual = reflect.ValueOf(actual).Convert(reflect.TypeOf(matcher.Expected)).Interface()\n\t}\n\n\treturn reflect.DeepEqual(convertedActual, matcher.Expected), nil\n}\n\nfunc (matcher *BeEquivalentToMatcher) FailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"to be equivalent to\", matcher.Expected)\n}\n\nfunc (matcher *BeEquivalentToMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"not to be equivalent to\", matcher.Expected)\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/be_false_matcher.go", "content": "// untested sections: 2\n\npackage matchers\n\nimport (\n\t\"fmt\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype BeFalseMatcher struct {\n}\n\nfunc (matcher *BeFalseMatcher) Match(actual interface{}) (success bool, err error) {\n\tif !isBool(actual) {\n\t\treturn false, fmt.Errorf(\"Expected a boolean. Got:\\n%s\", format.Object(actual, 1))\n\t}\n\n\treturn actual == false, nil\n}\n\nfunc (matcher *BeFalseMatcher) FailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"to be false\")\n}\n\nfunc (matcher *BeFalseMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"not to be false\")\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/be_identical_to.go", "content": "// untested sections: 2\n\npackage matchers\n\nimport (\n\t\"fmt\"\n\t\"runtime\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype BeIdenticalToMatcher struct {\n\tExpected interface{}\n}\n\nfunc (matcher *BeIdenticalToMatcher) Match(actual interface{}) (success bool, matchErr error) {\n\tif actual == nil && matcher.Expected == nil {\n\t\treturn false, fmt.Errorf(\"Refusing to compare to .\\nBe explicit and use BeNil() instead. This is to avoid mistakes where both sides of an assertion are erroneously uninitialized.\")\n\t}\n\n\tdefer func() {\n\t\tif r := recover(); r != nil {\n\t\t\tif _, ok := r.(runtime.Error); ok {\n\t\t\t\tsuccess = false\n\t\t\t\tmatchErr = nil\n\t\t\t}\n\t\t}\n\t}()\n\n\treturn actual == matcher.Expected, nil\n}\n\nfunc (matcher *BeIdenticalToMatcher) FailureMessage(actual interface{}) string {\n\treturn format.Message(actual, \"to be identical to\", matcher.Expected)\n}\n\nfunc (matcher *BeIdenticalToMatcher) NegatedFailureMessage(actual interface{}) string {\n\treturn format.Message(actual, \"not to be identical to\", matcher.Expected)\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/be_nil_matcher.go", "content": "// untested sections: 2\n\npackage matchers\n\nimport \"github.com/onsi/gomega/format\"\n\ntype BeNilMatcher struct {\n}\n\nfunc (matcher *BeNilMatcher) Match(actual interface{}) (success bool, err error) {\n\treturn isNil(actual), nil\n}\n\nfunc (matcher *BeNilMatcher) FailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"to be nil\")\n}\n\nfunc (matcher *BeNilMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"not to be nil\")\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/be_numerically_matcher.go", "content": "// untested sections: 4\n\npackage matchers\n\nimport (\n\t\"fmt\"\n\t\"math\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype BeNumericallyMatcher struct {\n\tComparator string\n\tCompareTo []interface{}\n}\n\nfunc (matcher *BeNumericallyMatcher) FailureMessage(actual interface{}) (message string) {\n\treturn matcher.FormatFailureMessage(actual, false)\n}\n\nfunc (matcher *BeNumericallyMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn matcher.FormatFailureMessage(actual, true)\n}\n\nfunc (matcher *BeNumericallyMatcher) FormatFailureMessage(actual interface{}, negated bool) (message string) {\n\tif len(matcher.CompareTo) == 1 {\n\t\tmessage = fmt.Sprintf(\"to be %s\", matcher.Comparator)\n\t} else {\n\t\tmessage = fmt.Sprintf(\"to be within %v of %s\", matcher.CompareTo[1], matcher.Comparator)\n\t}\n\tif negated {\n\t\tmessage = \"not \" + message\n\t}\n\treturn format.Message(actual, message, matcher.CompareTo[0])\n}\n\nfunc (matcher *BeNumericallyMatcher) Match(actual interface{}) (success bool, err error) {\n\tif len(matcher.CompareTo) == 0 || len(matcher.CompareTo) > 2 {\n\t\treturn false, fmt.Errorf(\"BeNumerically requires 1 or 2 CompareTo arguments. Got:\\n%s\", format.Object(matcher.CompareTo, 1))\n\t}\n\tif !isNumber(actual) {\n\t\treturn false, fmt.Errorf(\"Expected a number. Got:\\n%s\", format.Object(actual, 1))\n\t}\n\tif !isNumber(matcher.CompareTo[0]) {\n\t\treturn false, fmt.Errorf(\"Expected a number. Got:\\n%s\", format.Object(matcher.CompareTo[0], 1))\n\t}\n\tif len(matcher.CompareTo) == 2 && !isNumber(matcher.CompareTo[1]) {\n\t\treturn false, fmt.Errorf(\"Expected a number. Got:\\n%s\", format.Object(matcher.CompareTo[1], 1))\n\t}\n\n\tswitch matcher.Comparator {\n\tcase \"==\", \"~\", \">\", \">=\", \"<\", \"<=\":\n\tdefault:\n\t\treturn false, fmt.Errorf(\"Unknown comparator: %s\", matcher.Comparator)\n\t}\n\n\tif isFloat(actual) || isFloat(matcher.CompareTo[0]) {\n\t\tvar secondOperand float64 = 1e-8\n\t\tif len(matcher.CompareTo) == 2 {\n\t\t\tsecondOperand = toFloat(matcher.CompareTo[1])\n\t\t}\n\t\tsuccess = matcher.matchFloats(toFloat(actual), toFloat(matcher.CompareTo[0]), secondOperand)\n\t} else if isInteger(actual) {\n\t\tvar secondOperand int64 = 0\n\t\tif len(matcher.CompareTo) == 2 {\n\t\t\tsecondOperand = toInteger(matcher.CompareTo[1])\n\t\t}\n\t\tsuccess = matcher.matchIntegers(toInteger(actual), toInteger(matcher.CompareTo[0]), secondOperand)\n\t} else if isUnsignedInteger(actual) {\n\t\tvar secondOperand uint64 = 0\n\t\tif len(matcher.CompareTo) == 2 {\n\t\t\tsecondOperand = toUnsignedInteger(matcher.CompareTo[1])\n\t\t}\n\t\tsuccess = matcher.matchUnsignedIntegers(toUnsignedInteger(actual), toUnsignedInteger(matcher.CompareTo[0]), secondOperand)\n\t} else {\n\t\treturn false, fmt.Errorf(\"Failed to compare:\\n%s\\n%s:\\n%s\", format.Object(actual, 1), matcher.Comparator, format.Object(matcher.CompareTo[0], 1))\n\t}\n\n\treturn success, nil\n}\n\nfunc (matcher *BeNumericallyMatcher) matchIntegers(actual, compareTo, threshold int64) (success bool) {\n\tswitch matcher.Comparator {\n\tcase \"==\", \"~\":\n\t\tdiff := actual - compareTo\n\t\treturn -threshold <= diff && diff <= threshold\n\tcase \">\":\n\t\treturn (actual > compareTo)\n\tcase \">=\":\n\t\treturn (actual >= compareTo)\n\tcase \"<\":\n\t\treturn (actual < compareTo)\n\tcase \"<=\":\n\t\treturn (actual <= compareTo)\n\t}\n\treturn false\n}\n\nfunc (matcher *BeNumericallyMatcher) matchUnsignedIntegers(actual, compareTo, threshold uint64) (success bool) {\n\tswitch matcher.Comparator {\n\tcase \"==\", \"~\":\n\t\tif actual < compareTo {\n\t\t\tactual, compareTo = compareTo, actual\n\t\t}\n\t\treturn actual-compareTo <= threshold\n\tcase \">\":\n\t\treturn (actual > compareTo)\n\tcase \">=\":\n\t\treturn (actual >= compareTo)\n\tcase \"<\":\n\t\treturn (actual < compareTo)\n\tcase \"<=\":\n\t\treturn (actual <= compareTo)\n\t}\n\treturn false\n}\n\nfunc (matcher *BeNumericallyMatcher) matchFloats(actual, compareTo, threshold float64) (success bool) {\n\tswitch matcher.Comparator {\n\tcase \"~\":\n\t\treturn math.Abs(actual-compareTo) <= threshold\n\tcase \"==\":\n\t\treturn (actual == compareTo)\n\tcase \">\":\n\t\treturn (actual > compareTo)\n\tcase \">=\":\n\t\treturn (actual >= compareTo)\n\tcase \"<\":\n\t\treturn (actual < compareTo)\n\tcase \"<=\":\n\t\treturn (actual <= compareTo)\n\t}\n\treturn false\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/be_sent_matcher.go", "content": "// untested sections: 3\n\npackage matchers\n\nimport (\n\t\"fmt\"\n\t\"reflect\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype BeSentMatcher struct {\n\tArg interface{}\n\tchannelClosed bool\n}\n\nfunc (matcher *BeSentMatcher) Match(actual interface{}) (success bool, err error) {\n\tif !isChan(actual) {\n\t\treturn false, fmt.Errorf(\"BeSent expects a channel. Got:\\n%s\", format.Object(actual, 1))\n\t}\n\n\tchannelType := reflect.TypeOf(actual)\n\tchannelValue := reflect.ValueOf(actual)\n\n\tif channelType.ChanDir() == reflect.RecvDir {\n\t\treturn false, fmt.Errorf(\"BeSent matcher cannot be passed a receive-only channel. Got:\\n%s\", format.Object(actual, 1))\n\t}\n\n\targType := reflect.TypeOf(matcher.Arg)\n\tassignable := argType.AssignableTo(channelType.Elem())\n\n\tif !assignable {\n\t\treturn false, fmt.Errorf(\"Cannot pass:\\n%s to the channel:\\n%s\\nThe types don't match.\", format.Object(matcher.Arg, 1), format.Object(actual, 1))\n\t}\n\n\targValue := reflect.ValueOf(matcher.Arg)\n\n\tdefer func() {\n\t\tif e := recover(); e != nil {\n\t\t\tsuccess = false\n\t\t\terr = fmt.Errorf(\"Cannot send to a closed channel\")\n\t\t\tmatcher.channelClosed = true\n\t\t}\n\t}()\n\n\twinnerIndex, _, _ := reflect.Select([]reflect.SelectCase{\n\t\t{Dir: reflect.SelectSend, Chan: channelValue, Send: argValue},\n\t\t{Dir: reflect.SelectDefault},\n\t})\n\n\tvar didSend bool\n\tif winnerIndex == 0 {\n\t\tdidSend = true\n\t}\n\n\treturn didSend, nil\n}\n\nfunc (matcher *BeSentMatcher) FailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"to send:\", matcher.Arg)\n}\n\nfunc (matcher *BeSentMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"not to send:\", matcher.Arg)\n}\n\nfunc (matcher *BeSentMatcher) MatchMayChangeInTheFuture(actual interface{}) bool {\n\tif !isChan(actual) {\n\t\treturn false\n\t}\n\n\treturn !matcher.channelClosed\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/be_temporally_matcher.go", "content": "// untested sections: 3\n\npackage matchers\n\nimport (\n\t\"fmt\"\n\t\"time\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype BeTemporallyMatcher struct {\n\tComparator string\n\tCompareTo time.Time\n\tThreshold []time.Duration\n}\n\nfunc (matcher *BeTemporallyMatcher) FailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, fmt.Sprintf(\"to be %s\", matcher.Comparator), matcher.CompareTo)\n}\n\nfunc (matcher *BeTemporallyMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, fmt.Sprintf(\"not to be %s\", matcher.Comparator), matcher.CompareTo)\n}\n\nfunc (matcher *BeTemporallyMatcher) Match(actual interface{}) (bool, error) {\n\t// predicate to test for time.Time type\n\tisTime := func(t interface{}) bool {\n\t\t_, ok := t.(time.Time)\n\t\treturn ok\n\t}\n\n\tif !isTime(actual) {\n\t\treturn false, fmt.Errorf(\"Expected a time.Time. Got:\\n%s\", format.Object(actual, 1))\n\t}\n\n\tswitch matcher.Comparator {\n\tcase \"==\", \"~\", \">\", \">=\", \"<\", \"<=\":\n\tdefault:\n\t\treturn false, fmt.Errorf(\"Unknown comparator: %s\", matcher.Comparator)\n\t}\n\n\tvar threshold = time.Millisecond\n\tif len(matcher.Threshold) == 1 {\n\t\tthreshold = matcher.Threshold[0]\n\t}\n\n\treturn matcher.matchTimes(actual.(time.Time), matcher.CompareTo, threshold), nil\n}\n\nfunc (matcher *BeTemporallyMatcher) matchTimes(actual, compareTo time.Time, threshold time.Duration) (success bool) {\n\tswitch matcher.Comparator {\n\tcase \"==\":\n\t\treturn actual.Equal(compareTo)\n\tcase \"~\":\n\t\tdiff := actual.Sub(compareTo)\n\t\treturn -threshold <= diff && diff <= threshold\n\tcase \">\":\n\t\treturn actual.After(compareTo)\n\tcase \">=\":\n\t\treturn !actual.Before(compareTo)\n\tcase \"<\":\n\t\treturn actual.Before(compareTo)\n\tcase \"<=\":\n\t\treturn !actual.After(compareTo)\n\t}\n\treturn false\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/be_true_matcher.go", "content": "// untested sections: 2\n\npackage matchers\n\nimport (\n\t\"fmt\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype BeTrueMatcher struct {\n}\n\nfunc (matcher *BeTrueMatcher) Match(actual interface{}) (success bool, err error) {\n\tif !isBool(actual) {\n\t\treturn false, fmt.Errorf(\"Expected a boolean. Got:\\n%s\", format.Object(actual, 1))\n\t}\n\n\treturn actual.(bool), nil\n}\n\nfunc (matcher *BeTrueMatcher) FailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"to be true\")\n}\n\nfunc (matcher *BeTrueMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"not to be true\")\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/be_zero_matcher.go", "content": "package matchers\n\nimport (\n\t\"reflect\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype BeZeroMatcher struct {\n}\n\nfunc (matcher *BeZeroMatcher) Match(actual interface{}) (success bool, err error) {\n\tif actual == nil {\n\t\treturn true, nil\n\t}\n\tzeroValue := reflect.Zero(reflect.TypeOf(actual)).Interface()\n\n\treturn reflect.DeepEqual(zeroValue, actual), nil\n\n}\n\nfunc (matcher *BeZeroMatcher) FailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"to be zero-valued\")\n}\n\nfunc (matcher *BeZeroMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"not to be zero-valued\")\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/consist_of.go", "content": "// untested sections: 3\n\npackage matchers\n\nimport (\n\t\"fmt\"\n\t\"reflect\"\n\n\t\"github.com/onsi/gomega/format\"\n\t\"github.com/onsi/gomega/matchers/support/goraph/bipartitegraph\"\n)\n\ntype ConsistOfMatcher struct {\n\tElements []interface{}\n\tmissingElements []interface{}\n\textraElements []interface{}\n}\n\nfunc (matcher *ConsistOfMatcher) Match(actual interface{}) (success bool, err error) {\n\tif !isArrayOrSlice(actual) && !isMap(actual) {\n\t\treturn false, fmt.Errorf(\"ConsistOf matcher expects an array/slice/map. Got:\\n%s\", format.Object(actual, 1))\n\t}\n\n\tmatchers := matchers(matcher.Elements)\n\tvalues := valuesOf(actual)\n\n\tbipartiteGraph, err := bipartitegraph.NewBipartiteGraph(values, matchers, neighbours)\n\tif err != nil {\n\t\treturn false, err\n\t}\n\n\tedges := bipartiteGraph.LargestMatching()\n\tif len(edges) == len(values) && len(edges) == len(matchers) {\n\t\treturn true, nil\n\t}\n\n\tvar missingMatchers []interface{}\n\tmatcher.extraElements, missingMatchers = bipartiteGraph.FreeLeftRight(edges)\n\tmatcher.missingElements = equalMatchersToElements(missingMatchers)\n\n\treturn false, nil\n}\n\nfunc neighbours(value, matcher interface{}) (bool, error) {\n\tmatch, err := matcher.(omegaMatcher).Match(value)\n\treturn match && err == nil, nil\n}\n\nfunc equalMatchersToElements(matchers []interface{}) (elements []interface{}) {\n\tfor _, matcher := range matchers {\n\t\tequalMatcher, ok := matcher.(*EqualMatcher)\n\t\tif ok {\n\t\t\tmatcher = equalMatcher.Expected\n\t\t}\n\t\telements = append(elements, matcher)\n\t}\n\treturn\n}\n\nfunc flatten(elems []interface{}) []interface{} {\n\tif len(elems) != 1 || !isArrayOrSlice(elems[0]) {\n\t\treturn elems\n\t}\n\n\tvalue := reflect.ValueOf(elems[0])\n\tflattened := make([]interface{}, value.Len())\n\tfor i := 0; i < value.Len(); i++ {\n\t\tflattened[i] = value.Index(i).Interface()\n\t}\n\treturn flattened\n}\n\nfunc matchers(expectedElems []interface{}) (matchers []interface{}) {\n\tfor _, e := range flatten(expectedElems) {\n\t\tmatcher, isMatcher := e.(omegaMatcher)\n\t\tif !isMatcher {\n\t\t\tmatcher = &EqualMatcher{Expected: e}\n\t\t}\n\t\tmatchers = append(matchers, matcher)\n\t}\n\treturn\n}\n\nfunc presentable(elems []interface{}) interface{} {\n\telems = flatten(elems)\n\n\tif len(elems) == 0 {\n\t\treturn []interface{}{}\n\t}\n\n\tsv := reflect.ValueOf(elems)\n\ttt := sv.Index(0).Elem().Type()\n\tfor i := 1; i < sv.Len(); i++ {\n\t\tif sv.Index(i).Elem().Type() != tt {\n\t\t\treturn elems\n\t\t}\n\t}\n\n\tss := reflect.MakeSlice(reflect.SliceOf(tt), sv.Len(), sv.Len())\n\tfor i := 0; i < sv.Len(); i++ {\n\t\tss.Index(i).Set(sv.Index(i).Elem())\n\t}\n\n\treturn ss.Interface()\n}\n\nfunc valuesOf(actual interface{}) []interface{} {\n\tvalue := reflect.ValueOf(actual)\n\tvalues := []interface{}{}\n\tif isMap(actual) {\n\t\tkeys := value.MapKeys()\n\t\tfor i := 0; i < value.Len(); i++ {\n\t\t\tvalues = append(values, value.MapIndex(keys[i]).Interface())\n\t\t}\n\t} else {\n\t\tfor i := 0; i < value.Len(); i++ {\n\t\t\tvalues = append(values, value.Index(i).Interface())\n\t\t}\n\t}\n\n\treturn values\n}\n\nfunc (matcher *ConsistOfMatcher) FailureMessage(actual interface{}) (message string) {\n\tmessage = format.Message(actual, \"to consist of\", presentable(matcher.Elements))\n\tmessage = appendMissingElements(message, matcher.missingElements)\n\tif len(matcher.extraElements) > 0 {\n\t\tmessage = fmt.Sprintf(\"%s\\nthe extra elements were\\n%s\", message,\n\t\t\tformat.Object(presentable(matcher.extraElements), 1))\n\t}\n\treturn\n}\n\nfunc appendMissingElements(message string, missingElements []interface{}) string {\n\tif len(missingElements) == 0 {\n\t\treturn message\n\t}\n\treturn fmt.Sprintf(\"%s\\nthe missing elements were\\n%s\", message,\n\t\tformat.Object(presentable(missingElements), 1))\n}\n\nfunc (matcher *ConsistOfMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"not to consist of\", presentable(matcher.Elements))\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/contain_element_matcher.go", "content": "// untested sections: 2\n\npackage matchers\n\nimport (\n\t\"fmt\"\n\t\"reflect\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype ContainElementMatcher struct {\n\tElement interface{}\n}\n\nfunc (matcher *ContainElementMatcher) Match(actual interface{}) (success bool, err error) {\n\tif !isArrayOrSlice(actual) && !isMap(actual) {\n\t\treturn false, fmt.Errorf(\"ContainElement matcher expects an array/slice/map. Got:\\n%s\", format.Object(actual, 1))\n\t}\n\n\telemMatcher, elementIsMatcher := matcher.Element.(omegaMatcher)\n\tif !elementIsMatcher {\n\t\telemMatcher = &EqualMatcher{Expected: matcher.Element}\n\t}\n\n\tvalue := reflect.ValueOf(actual)\n\tvar valueAt func(int) interface{}\n\tif isMap(actual) {\n\t\tkeys := value.MapKeys()\n\t\tvalueAt = func(i int) interface{} {\n\t\t\treturn value.MapIndex(keys[i]).Interface()\n\t\t}\n\t} else {\n\t\tvalueAt = func(i int) interface{} {\n\t\t\treturn value.Index(i).Interface()\n\t\t}\n\t}\n\n\tvar lastError error\n\tfor i := 0; i < value.Len(); i++ {\n\t\tsuccess, err := elemMatcher.Match(valueAt(i))\n\t\tif err != nil {\n\t\t\tlastError = err\n\t\t\tcontinue\n\t\t}\n\t\tif success {\n\t\t\treturn true, nil\n\t\t}\n\t}\n\n\treturn false, lastError\n}\n\nfunc (matcher *ContainElementMatcher) FailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"to contain element matching\", matcher.Element)\n}\n\nfunc (matcher *ContainElementMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"not to contain element matching\", matcher.Element)\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/contain_elements_matcher.go", "content": "package matchers\n\nimport (\n\t\"fmt\"\n\n\t\"github.com/onsi/gomega/format\"\n\t\"github.com/onsi/gomega/matchers/support/goraph/bipartitegraph\"\n)\n\ntype ContainElementsMatcher struct {\n\tElements []interface{}\n\tmissingElements []interface{}\n}\n\nfunc (matcher *ContainElementsMatcher) Match(actual interface{}) (success bool, err error) {\n\tif !isArrayOrSlice(actual) && !isMap(actual) {\n\t\treturn false, fmt.Errorf(\"ContainElements matcher expects an array/slice/map. Got:\\n%s\", format.Object(actual, 1))\n\t}\n\n\tmatchers := matchers(matcher.Elements)\n\tbipartiteGraph, err := bipartitegraph.NewBipartiteGraph(valuesOf(actual), matchers, neighbours)\n\tif err != nil {\n\t\treturn false, err\n\t}\n\n\tedges := bipartiteGraph.LargestMatching()\n\tif len(edges) == len(matchers) {\n\t\treturn true, nil\n\t}\n\n\t_, missingMatchers := bipartiteGraph.FreeLeftRight(edges)\n\tmatcher.missingElements = equalMatchersToElements(missingMatchers)\n\n\treturn false, nil\n}\n\nfunc (matcher *ContainElementsMatcher) FailureMessage(actual interface{}) (message string) {\n\tmessage = format.Message(actual, \"to contain elements\", presentable(matcher.Elements))\n\treturn appendMissingElements(message, matcher.missingElements)\n}\n\nfunc (matcher *ContainElementsMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"not to contain elements\", presentable(matcher.Elements))\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/contain_substring_matcher.go", "content": "// untested sections: 2\n\npackage matchers\n\nimport (\n\t\"fmt\"\n\t\"strings\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype ContainSubstringMatcher struct {\n\tSubstr string\n\tArgs []interface{}\n}\n\nfunc (matcher *ContainSubstringMatcher) Match(actual interface{}) (success bool, err error) {\n\tactualString, ok := toString(actual)\n\tif !ok {\n\t\treturn false, fmt.Errorf(\"ContainSubstring matcher requires a string or stringer. Got:\\n%s\", format.Object(actual, 1))\n\t}\n\n\treturn strings.Contains(actualString, matcher.stringToMatch()), nil\n}\n\nfunc (matcher *ContainSubstringMatcher) stringToMatch() string {\n\tstringToMatch := matcher.Substr\n\tif len(matcher.Args) > 0 {\n\t\tstringToMatch = fmt.Sprintf(matcher.Substr, matcher.Args...)\n\t}\n\treturn stringToMatch\n}\n\nfunc (matcher *ContainSubstringMatcher) FailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"to contain substring\", matcher.stringToMatch())\n}\n\nfunc (matcher *ContainSubstringMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"not to contain substring\", matcher.stringToMatch())\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/equal_matcher.go", "content": "package matchers\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n\t\"reflect\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype EqualMatcher struct {\n\tExpected interface{}\n}\n\nfunc (matcher *EqualMatcher) Match(actual interface{}) (success bool, err error) {\n\tif actual == nil && matcher.Expected == nil {\n\t\treturn false, fmt.Errorf(\"Refusing to compare to .\\nBe explicit and use BeNil() instead. This is to avoid mistakes where both sides of an assertion are erroneously uninitialized.\")\n\t}\n\t// Shortcut for byte slices.\n\t// Comparing long byte slices with reflect.DeepEqual is very slow,\n\t// so use bytes.Equal if actual and expected are both byte slices.\n\tif actualByteSlice, ok := actual.([]byte); ok {\n\t\tif expectedByteSlice, ok := matcher.Expected.([]byte); ok {\n\t\t\treturn bytes.Equal(actualByteSlice, expectedByteSlice), nil\n\t\t}\n\t}\n\treturn reflect.DeepEqual(actual, matcher.Expected), nil\n}\n\nfunc (matcher *EqualMatcher) FailureMessage(actual interface{}) (message string) {\n\tactualString, actualOK := actual.(string)\n\texpectedString, expectedOK := matcher.Expected.(string)\n\tif actualOK && expectedOK {\n\t\treturn format.MessageWithDiff(actualString, \"to equal\", expectedString)\n\t}\n\n\treturn format.Message(actual, \"to equal\", matcher.Expected)\n}\n\nfunc (matcher *EqualMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"not to equal\", matcher.Expected)\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/have_cap_matcher.go", "content": "// untested sections: 2\n\npackage matchers\n\nimport (\n\t\"fmt\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype HaveCapMatcher struct {\n\tCount int\n}\n\nfunc (matcher *HaveCapMatcher) Match(actual interface{}) (success bool, err error) {\n\tlength, ok := capOf(actual)\n\tif !ok {\n\t\treturn false, fmt.Errorf(\"HaveCap matcher expects a array/channel/slice. Got:\\n%s\", format.Object(actual, 1))\n\t}\n\n\treturn length == matcher.Count, nil\n}\n\nfunc (matcher *HaveCapMatcher) FailureMessage(actual interface{}) (message string) {\n\treturn fmt.Sprintf(\"Expected\\n%s\\nto have capacity %d\", format.Object(actual, 1), matcher.Count)\n}\n\nfunc (matcher *HaveCapMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn fmt.Sprintf(\"Expected\\n%s\\nnot to have capacity %d\", format.Object(actual, 1), matcher.Count)\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/have_field.go", "content": "package matchers\n\nimport (\n\t\"fmt\"\n\t\"reflect\"\n\t\"strings\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\nfunc extractField(actual interface{}, field string) (interface{}, error) {\n\tfields := strings.SplitN(field, \".\", 2)\n\tactualValue := reflect.ValueOf(actual)\n\n\tif actualValue.Kind() != reflect.Struct {\n\t\treturn nil, fmt.Errorf(\"HaveField encountered:\\n%s\\nWhich is not a struct.\", format.Object(actual, 1))\n\t}\n\n\tvar extractedValue reflect.Value\n\n\tif strings.HasSuffix(fields[0], \"()\") {\n\t\textractedValue = actualValue.MethodByName(strings.TrimSuffix(fields[0], \"()\"))\n\t\tif extractedValue == (reflect.Value{}) {\n\t\t\treturn nil, fmt.Errorf(\"HaveField could not find method named '%s' in struct of type %T.\", fields[0], actual)\n\t\t}\n\t\tt := extractedValue.Type()\n\t\tif t.NumIn() != 0 || t.NumOut() != 1 {\n\t\t\treturn nil, fmt.Errorf(\"HaveField found an invalid method named '%s' in struct of type %T.\\nMethods must take no arguments and return exactly one value.\", fields[0], actual)\n\t\t}\n\t\textractedValue = extractedValue.Call([]reflect.Value{})[0]\n\t} else {\n\t\textractedValue = actualValue.FieldByName(fields[0])\n\t\tif extractedValue == (reflect.Value{}) {\n\t\t\treturn nil, fmt.Errorf(\"HaveField could not find field named '%s' in struct:\\n%s\", fields[0], format.Object(actual, 1))\n\t\t}\n\t}\n\n\tif len(fields) == 1 {\n\t\treturn extractedValue.Interface(), nil\n\t} else {\n\t\treturn extractField(extractedValue.Interface(), fields[1])\n\t}\n}\n\ntype HaveFieldMatcher struct {\n\tField string\n\tExpected interface{}\n\n\textractedField interface{}\n\texpectedMatcher omegaMatcher\n}\n\nfunc (matcher *HaveFieldMatcher) Match(actual interface{}) (success bool, err error) {\n\tmatcher.extractedField, err = extractField(actual, matcher.Field)\n\tif err != nil {\n\t\treturn false, err\n\t}\n\n\tvar isMatcher bool\n\tmatcher.expectedMatcher, isMatcher = matcher.Expected.(omegaMatcher)\n\tif !isMatcher {\n\t\tmatcher.expectedMatcher = &EqualMatcher{Expected: matcher.Expected}\n\t}\n\n\treturn matcher.expectedMatcher.Match(matcher.extractedField)\n}\n\nfunc (matcher *HaveFieldMatcher) FailureMessage(actual interface{}) (message string) {\n\tmessage = fmt.Sprintf(\"Value for field '%s' failed to satisfy matcher.\\n\", matcher.Field)\n\tmessage += matcher.expectedMatcher.FailureMessage(matcher.extractedField)\n\n\treturn message\n}\n\nfunc (matcher *HaveFieldMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\tmessage = fmt.Sprintf(\"Value for field '%s' satisfied matcher, but should not have.\\n\", matcher.Field)\n\tmessage += matcher.expectedMatcher.NegatedFailureMessage(matcher.extractedField)\n\n\treturn message\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/have_http_body_matcher.go", "content": "package matchers\n\nimport (\n\t\"fmt\"\n\t\"io\"\n\t\"net/http\"\n\t\"net/http/httptest\"\n\n\t\"github.com/onsi/gomega/format\"\n\t\"github.com/onsi/gomega/types\"\n)\n\ntype HaveHTTPBodyMatcher struct {\n\tExpected interface{}\n\tcachedBody []byte\n}\n\nfunc (matcher *HaveHTTPBodyMatcher) Match(actual interface{}) (bool, error) {\n\tbody, err := matcher.body(actual)\n\tif err != nil {\n\t\treturn false, err\n\t}\n\n\tswitch e := matcher.Expected.(type) {\n\tcase string:\n\t\treturn (&EqualMatcher{Expected: e}).Match(string(body))\n\tcase []byte:\n\t\treturn (&EqualMatcher{Expected: e}).Match(body)\n\tcase types.GomegaMatcher:\n\t\treturn e.Match(body)\n\tdefault:\n\t\treturn false, fmt.Errorf(\"HaveHTTPBody matcher expects string, []byte, or GomegaMatcher. Got:\\n%s\", format.Object(matcher.Expected, 1))\n\t}\n}\n\nfunc (matcher *HaveHTTPBodyMatcher) FailureMessage(actual interface{}) (message string) {\n\tbody, err := matcher.body(actual)\n\tif err != nil {\n\t\treturn fmt.Sprintf(\"failed to read body: %s\", err)\n\t}\n\n\tswitch e := matcher.Expected.(type) {\n\tcase string:\n\t\treturn (&EqualMatcher{Expected: e}).FailureMessage(string(body))\n\tcase []byte:\n\t\treturn (&EqualMatcher{Expected: e}).FailureMessage(body)\n\tcase types.GomegaMatcher:\n\t\treturn e.FailureMessage(body)\n\tdefault:\n\t\treturn fmt.Sprintf(\"HaveHTTPBody matcher expects string, []byte, or GomegaMatcher. Got:\\n%s\", format.Object(matcher.Expected, 1))\n\t}\n}\n\nfunc (matcher *HaveHTTPBodyMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\tbody, err := matcher.body(actual)\n\tif err != nil {\n\t\treturn fmt.Sprintf(\"failed to read body: %s\", err)\n\t}\n\n\tswitch e := matcher.Expected.(type) {\n\tcase string:\n\t\treturn (&EqualMatcher{Expected: e}).NegatedFailureMessage(string(body))\n\tcase []byte:\n\t\treturn (&EqualMatcher{Expected: e}).NegatedFailureMessage(body)\n\tcase types.GomegaMatcher:\n\t\treturn e.NegatedFailureMessage(body)\n\tdefault:\n\t\treturn fmt.Sprintf(\"HaveHTTPBody matcher expects string, []byte, or GomegaMatcher. Got:\\n%s\", format.Object(matcher.Expected, 1))\n\t}\n}\n\n// body returns the body. It is cached because once we read it in Match()\n// the Reader is closed and it is not readable again in FailureMessage()\n// or NegatedFailureMessage()\nfunc (matcher *HaveHTTPBodyMatcher) body(actual interface{}) ([]byte, error) {\n\tif matcher.cachedBody != nil {\n\t\treturn matcher.cachedBody, nil\n\t}\n\n\tbody := func(a *http.Response) ([]byte, error) {\n\t\tif a.Body != nil {\n\t\t\tdefer a.Body.Close()\n\t\t\tvar err error\n\t\t\tmatcher.cachedBody, err = io.ReadAll(a.Body)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, fmt.Errorf(\"error reading response body: %w\", err)\n\t\t\t}\n\t\t}\n\t\treturn matcher.cachedBody, nil\n\t}\n\n\tswitch a := actual.(type) {\n\tcase *http.Response:\n\t\treturn body(a)\n\tcase *httptest.ResponseRecorder:\n\t\treturn body(a.Result())\n\tdefault:\n\t\treturn nil, fmt.Errorf(\"HaveHTTPBody matcher expects *http.Response or *httptest.ResponseRecorder. Got:\\n%s\", format.Object(actual, 1))\n\t}\n\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/have_http_header_with_value_matcher.go", "content": "package matchers\n\nimport (\n\t\"fmt\"\n\t\"net/http\"\n\t\"net/http/httptest\"\n\n\t\"github.com/onsi/gomega/format\"\n\t\"github.com/onsi/gomega/types\"\n)\n\ntype HaveHTTPHeaderWithValueMatcher struct {\n\tHeader string\n\tValue interface{}\n}\n\nfunc (matcher *HaveHTTPHeaderWithValueMatcher) Match(actual interface{}) (success bool, err error) {\n\theaderValue, err := matcher.extractHeader(actual)\n\tif err != nil {\n\t\treturn false, err\n\t}\n\n\theaderMatcher, err := matcher.getSubMatcher()\n\tif err != nil {\n\t\treturn false, err\n\t}\n\n\treturn headerMatcher.Match(headerValue)\n}\n\nfunc (matcher *HaveHTTPHeaderWithValueMatcher) FailureMessage(actual interface{}) string {\n\theaderValue, err := matcher.extractHeader(actual)\n\tif err != nil {\n\t\tpanic(err) // protected by Match()\n\t}\n\n\theaderMatcher, err := matcher.getSubMatcher()\n\tif err != nil {\n\t\tpanic(err) // protected by Match()\n\t}\n\n\tdiff := format.IndentString(headerMatcher.FailureMessage(headerValue), 1)\n\treturn fmt.Sprintf(\"HTTP header %q:\\n%s\", matcher.Header, diff)\n}\n\nfunc (matcher *HaveHTTPHeaderWithValueMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\theaderValue, err := matcher.extractHeader(actual)\n\tif err != nil {\n\t\tpanic(err) // protected by Match()\n\t}\n\n\theaderMatcher, err := matcher.getSubMatcher()\n\tif err != nil {\n\t\tpanic(err) // protected by Match()\n\t}\n\n\tdiff := format.IndentString(headerMatcher.NegatedFailureMessage(headerValue), 1)\n\treturn fmt.Sprintf(\"HTTP header %q:\\n%s\", matcher.Header, diff)\n}\n\nfunc (matcher *HaveHTTPHeaderWithValueMatcher) getSubMatcher() (types.GomegaMatcher, error) {\n\tswitch m := matcher.Value.(type) {\n\tcase string:\n\t\treturn &EqualMatcher{Expected: matcher.Value}, nil\n\tcase types.GomegaMatcher:\n\t\treturn m, nil\n\tdefault:\n\t\treturn nil, fmt.Errorf(\"HaveHTTPHeaderWithValue matcher must be passed a string or a GomegaMatcher. Got:\\n%s\", format.Object(matcher.Value, 1))\n\t}\n}\n\nfunc (matcher *HaveHTTPHeaderWithValueMatcher) extractHeader(actual interface{}) (string, error) {\n\tswitch r := actual.(type) {\n\tcase *http.Response:\n\t\treturn r.Header.Get(matcher.Header), nil\n\tcase *httptest.ResponseRecorder:\n\t\treturn r.Result().Header.Get(matcher.Header), nil\n\tdefault:\n\t\treturn \"\", fmt.Errorf(\"HaveHTTPHeaderWithValue matcher expects *http.Response or *httptest.ResponseRecorder. Got:\\n%s\", format.Object(actual, 1))\n\t}\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/have_http_status_matcher.go", "content": "package matchers\n\nimport (\n\t\"fmt\"\n\t\"io\"\n\t\"net/http\"\n\t\"net/http/httptest\"\n\t\"reflect\"\n\t\"strings\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype HaveHTTPStatusMatcher struct {\n\tExpected []interface{}\n}\n\nfunc (matcher *HaveHTTPStatusMatcher) Match(actual interface{}) (success bool, err error) {\n\tvar resp *http.Response\n\tswitch a := actual.(type) {\n\tcase *http.Response:\n\t\tresp = a\n\tcase *httptest.ResponseRecorder:\n\t\tresp = a.Result()\n\tdefault:\n\t\treturn false, fmt.Errorf(\"HaveHTTPStatus matcher expects *http.Response or *httptest.ResponseRecorder. Got:\\n%s\", format.Object(actual, 1))\n\t}\n\n\tif len(matcher.Expected) == 0 {\n\t\treturn false, fmt.Errorf(\"HaveHTTPStatus matcher must be passed an int or a string. Got nothing\")\n\t}\n\n\tfor _, expected := range matcher.Expected {\n\t\tswitch e := expected.(type) {\n\t\tcase int:\n\t\t\tif resp.StatusCode == e {\n\t\t\t\treturn true, nil\n\t\t\t}\n\t\tcase string:\n\t\t\tif resp.Status == e {\n\t\t\t\treturn true, nil\n\t\t\t}\n\t\tdefault:\n\t\t\treturn false, fmt.Errorf(\"HaveHTTPStatus matcher must be passed int or string types. Got:\\n%s\", format.Object(expected, 1))\n\t\t}\n\t}\n\n\treturn false, nil\n}\n\nfunc (matcher *HaveHTTPStatusMatcher) FailureMessage(actual interface{}) (message string) {\n\treturn fmt.Sprintf(\"Expected\\n%s\\n%s\\n%s\", formatHttpResponse(actual), \"to have HTTP status\", matcher.expectedString())\n}\n\nfunc (matcher *HaveHTTPStatusMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn fmt.Sprintf(\"Expected\\n%s\\n%s\\n%s\", formatHttpResponse(actual), \"not to have HTTP status\", matcher.expectedString())\n}\n\nfunc (matcher *HaveHTTPStatusMatcher) expectedString() string {\n\tvar lines []string\n\tfor _, expected := range matcher.Expected {\n\t\tlines = append(lines, format.Object(expected, 1))\n\t}\n\treturn strings.Join(lines, \"\\n\")\n}\n\nfunc formatHttpResponse(input interface{}) string {\n\tvar resp *http.Response\n\tswitch r := input.(type) {\n\tcase *http.Response:\n\t\tresp = r\n\tcase *httptest.ResponseRecorder:\n\t\tresp = r.Result()\n\tdefault:\n\t\treturn \"cannot format invalid HTTP response\"\n\t}\n\n\tbody := \"\"\n\tif resp.Body != nil {\n\t\tdefer resp.Body.Close()\n\t\tdata, err := io.ReadAll(resp.Body)\n\t\tif err != nil {\n\t\t\tdata = []byte(\"\")\n\t\t}\n\t\tbody = format.Object(string(data), 0)\n\t}\n\n\tvar s strings.Builder\n\ts.WriteString(fmt.Sprintf(\"%s<%s>: {\\n\", format.Indent, reflect.TypeOf(input)))\n\ts.WriteString(fmt.Sprintf(\"%s%sStatus: %s\\n\", format.Indent, format.Indent, format.Object(resp.Status, 0)))\n\ts.WriteString(fmt.Sprintf(\"%s%sStatusCode: %s\\n\", format.Indent, format.Indent, format.Object(resp.StatusCode, 0)))\n\ts.WriteString(fmt.Sprintf(\"%s%sBody: %s\\n\", format.Indent, format.Indent, body))\n\ts.WriteString(fmt.Sprintf(\"%s}\", format.Indent))\n\n\treturn s.String()\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/have_key_matcher.go", "content": "// untested sections: 6\n\npackage matchers\n\nimport (\n\t\"fmt\"\n\t\"reflect\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype HaveKeyMatcher struct {\n\tKey interface{}\n}\n\nfunc (matcher *HaveKeyMatcher) Match(actual interface{}) (success bool, err error) {\n\tif !isMap(actual) {\n\t\treturn false, fmt.Errorf(\"HaveKey matcher expects a map. Got:%s\", format.Object(actual, 1))\n\t}\n\n\tkeyMatcher, keyIsMatcher := matcher.Key.(omegaMatcher)\n\tif !keyIsMatcher {\n\t\tkeyMatcher = &EqualMatcher{Expected: matcher.Key}\n\t}\n\n\tkeys := reflect.ValueOf(actual).MapKeys()\n\tfor i := 0; i < len(keys); i++ {\n\t\tsuccess, err := keyMatcher.Match(keys[i].Interface())\n\t\tif err != nil {\n\t\t\treturn false, fmt.Errorf(\"HaveKey's key matcher failed with:\\n%s%s\", format.Indent, err.Error())\n\t\t}\n\t\tif success {\n\t\t\treturn true, nil\n\t\t}\n\t}\n\n\treturn false, nil\n}\n\nfunc (matcher *HaveKeyMatcher) FailureMessage(actual interface{}) (message string) {\n\tswitch matcher.Key.(type) {\n\tcase omegaMatcher:\n\t\treturn format.Message(actual, \"to have key matching\", matcher.Key)\n\tdefault:\n\t\treturn format.Message(actual, \"to have key\", matcher.Key)\n\t}\n}\n\nfunc (matcher *HaveKeyMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\tswitch matcher.Key.(type) {\n\tcase omegaMatcher:\n\t\treturn format.Message(actual, \"not to have key matching\", matcher.Key)\n\tdefault:\n\t\treturn format.Message(actual, \"not to have key\", matcher.Key)\n\t}\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/have_key_with_value_matcher.go", "content": "// untested sections:10\n\npackage matchers\n\nimport (\n\t\"fmt\"\n\t\"reflect\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype HaveKeyWithValueMatcher struct {\n\tKey interface{}\n\tValue interface{}\n}\n\nfunc (matcher *HaveKeyWithValueMatcher) Match(actual interface{}) (success bool, err error) {\n\tif !isMap(actual) {\n\t\treturn false, fmt.Errorf(\"HaveKeyWithValue matcher expects a map. Got:%s\", format.Object(actual, 1))\n\t}\n\n\tkeyMatcher, keyIsMatcher := matcher.Key.(omegaMatcher)\n\tif !keyIsMatcher {\n\t\tkeyMatcher = &EqualMatcher{Expected: matcher.Key}\n\t}\n\n\tvalueMatcher, valueIsMatcher := matcher.Value.(omegaMatcher)\n\tif !valueIsMatcher {\n\t\tvalueMatcher = &EqualMatcher{Expected: matcher.Value}\n\t}\n\n\tkeys := reflect.ValueOf(actual).MapKeys()\n\tfor i := 0; i < len(keys); i++ {\n\t\tsuccess, err := keyMatcher.Match(keys[i].Interface())\n\t\tif err != nil {\n\t\t\treturn false, fmt.Errorf(\"HaveKeyWithValue's key matcher failed with:\\n%s%s\", format.Indent, err.Error())\n\t\t}\n\t\tif success {\n\t\t\tactualValue := reflect.ValueOf(actual).MapIndex(keys[i])\n\t\t\tsuccess, err := valueMatcher.Match(actualValue.Interface())\n\t\t\tif err != nil {\n\t\t\t\treturn false, fmt.Errorf(\"HaveKeyWithValue's value matcher failed with:\\n%s%s\", format.Indent, err.Error())\n\t\t\t}\n\t\t\treturn success, nil\n\t\t}\n\t}\n\n\treturn false, nil\n}\n\nfunc (matcher *HaveKeyWithValueMatcher) FailureMessage(actual interface{}) (message string) {\n\tstr := \"to have {key: value}\"\n\tif _, ok := matcher.Key.(omegaMatcher); ok {\n\t\tstr += \" matching\"\n\t} else if _, ok := matcher.Value.(omegaMatcher); ok {\n\t\tstr += \" matching\"\n\t}\n\n\texpect := make(map[interface{}]interface{}, 1)\n\texpect[matcher.Key] = matcher.Value\n\treturn format.Message(actual, str, expect)\n}\n\nfunc (matcher *HaveKeyWithValueMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\tkStr := \"not to have key\"\n\tif _, ok := matcher.Key.(omegaMatcher); ok {\n\t\tkStr = \"not to have key matching\"\n\t}\n\n\tvStr := \"or that key's value not be\"\n\tif _, ok := matcher.Value.(omegaMatcher); ok {\n\t\tvStr = \"or to have that key's value not matching\"\n\t}\n\n\treturn format.Message(actual, kStr, matcher.Key, vStr, matcher.Value)\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/have_len_matcher.go", "content": "package matchers\n\nimport (\n\t\"fmt\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype HaveLenMatcher struct {\n\tCount int\n}\n\nfunc (matcher *HaveLenMatcher) Match(actual interface{}) (success bool, err error) {\n\tlength, ok := lengthOf(actual)\n\tif !ok {\n\t\treturn false, fmt.Errorf(\"HaveLen matcher expects a string/array/map/channel/slice. Got:\\n%s\", format.Object(actual, 1))\n\t}\n\n\treturn length == matcher.Count, nil\n}\n\nfunc (matcher *HaveLenMatcher) FailureMessage(actual interface{}) (message string) {\n\treturn fmt.Sprintf(\"Expected\\n%s\\nto have length %d\", format.Object(actual, 1), matcher.Count)\n}\n\nfunc (matcher *HaveLenMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn fmt.Sprintf(\"Expected\\n%s\\nnot to have length %d\", format.Object(actual, 1), matcher.Count)\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/have_occurred_matcher.go", "content": "// untested sections: 2\n\npackage matchers\n\nimport (\n\t\"fmt\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype HaveOccurredMatcher struct {\n}\n\nfunc (matcher *HaveOccurredMatcher) Match(actual interface{}) (success bool, err error) {\n\t// is purely nil?\n\tif actual == nil {\n\t\treturn false, nil\n\t}\n\n\t// must be an 'error' type\n\tif !isError(actual) {\n\t\treturn false, fmt.Errorf(\"Expected an error-type. Got:\\n%s\", format.Object(actual, 1))\n\t}\n\n\t// must be non-nil (or a pointer to a non-nil)\n\treturn !isNil(actual), nil\n}\n\nfunc (matcher *HaveOccurredMatcher) FailureMessage(actual interface{}) (message string) {\n\treturn fmt.Sprintf(\"Expected an error to have occurred. Got:\\n%s\", format.Object(actual, 1))\n}\n\nfunc (matcher *HaveOccurredMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn fmt.Sprintf(\"Unexpected error:\\n%s\\n%s\\n%s\", format.Object(actual, 1), format.IndentString(actual.(error).Error(), 1), \"occurred\")\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/have_prefix_matcher.go", "content": "package matchers\n\nimport (\n\t\"fmt\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype HavePrefixMatcher struct {\n\tPrefix string\n\tArgs []interface{}\n}\n\nfunc (matcher *HavePrefixMatcher) Match(actual interface{}) (success bool, err error) {\n\tactualString, ok := toString(actual)\n\tif !ok {\n\t\treturn false, fmt.Errorf(\"HavePrefix matcher requires a string or stringer. Got:\\n%s\", format.Object(actual, 1))\n\t}\n\tprefix := matcher.prefix()\n\treturn len(actualString) >= len(prefix) && actualString[0:len(prefix)] == prefix, nil\n}\n\nfunc (matcher *HavePrefixMatcher) prefix() string {\n\tif len(matcher.Args) > 0 {\n\t\treturn fmt.Sprintf(matcher.Prefix, matcher.Args...)\n\t}\n\treturn matcher.Prefix\n}\n\nfunc (matcher *HavePrefixMatcher) FailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"to have prefix\", matcher.prefix())\n}\n\nfunc (matcher *HavePrefixMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"not to have prefix\", matcher.prefix())\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/have_suffix_matcher.go", "content": "package matchers\n\nimport (\n\t\"fmt\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype HaveSuffixMatcher struct {\n\tSuffix string\n\tArgs []interface{}\n}\n\nfunc (matcher *HaveSuffixMatcher) Match(actual interface{}) (success bool, err error) {\n\tactualString, ok := toString(actual)\n\tif !ok {\n\t\treturn false, fmt.Errorf(\"HaveSuffix matcher requires a string or stringer. Got:\\n%s\", format.Object(actual, 1))\n\t}\n\tsuffix := matcher.suffix()\n\treturn len(actualString) >= len(suffix) && actualString[len(actualString)-len(suffix):] == suffix, nil\n}\n\nfunc (matcher *HaveSuffixMatcher) suffix() string {\n\tif len(matcher.Args) > 0 {\n\t\treturn fmt.Sprintf(matcher.Suffix, matcher.Args...)\n\t}\n\treturn matcher.Suffix\n}\n\nfunc (matcher *HaveSuffixMatcher) FailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"to have suffix\", matcher.suffix())\n}\n\nfunc (matcher *HaveSuffixMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"not to have suffix\", matcher.suffix())\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/match_error_matcher.go", "content": "package matchers\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"reflect\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype MatchErrorMatcher struct {\n\tExpected interface{}\n}\n\nfunc (matcher *MatchErrorMatcher) Match(actual interface{}) (success bool, err error) {\n\tif isNil(actual) {\n\t\treturn false, fmt.Errorf(\"Expected an error, got nil\")\n\t}\n\n\tif !isError(actual) {\n\t\treturn false, fmt.Errorf(\"Expected an error. Got:\\n%s\", format.Object(actual, 1))\n\t}\n\n\tactualErr := actual.(error)\n\texpected := matcher.Expected\n\n\tif isError(expected) {\n\t\treturn reflect.DeepEqual(actualErr, expected) || errors.Is(actualErr, expected.(error)), nil\n\t}\n\n\tif isString(expected) {\n\t\treturn actualErr.Error() == expected, nil\n\t}\n\n\tvar subMatcher omegaMatcher\n\tvar hasSubMatcher bool\n\tif expected != nil {\n\t\tsubMatcher, hasSubMatcher = (expected).(omegaMatcher)\n\t\tif hasSubMatcher {\n\t\t\treturn subMatcher.Match(actualErr.Error())\n\t\t}\n\t}\n\n\treturn false, fmt.Errorf(\n\t\t\"MatchError must be passed an error, a string, or a Matcher that can match on strings. Got:\\n%s\",\n\t\tformat.Object(expected, 1))\n}\n\nfunc (matcher *MatchErrorMatcher) FailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"to match error\", matcher.Expected)\n}\n\nfunc (matcher *MatchErrorMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"not to match error\", matcher.Expected)\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/match_json_matcher.go", "content": "package matchers\n\nimport (\n\t\"bytes\"\n\t\"encoding/json\"\n\t\"fmt\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype MatchJSONMatcher struct {\n\tJSONToMatch interface{}\n\tfirstFailurePath []interface{}\n}\n\nfunc (matcher *MatchJSONMatcher) Match(actual interface{}) (success bool, err error) {\n\tactualString, expectedString, err := matcher.prettyPrint(actual)\n\tif err != nil {\n\t\treturn false, err\n\t}\n\n\tvar aval interface{}\n\tvar eval interface{}\n\n\t// this is guarded by prettyPrint\n\tjson.Unmarshal([]byte(actualString), &aval)\n\tjson.Unmarshal([]byte(expectedString), &eval)\n\tvar equal bool\n\tequal, matcher.firstFailurePath = deepEqual(aval, eval)\n\treturn equal, nil\n}\n\nfunc (matcher *MatchJSONMatcher) FailureMessage(actual interface{}) (message string) {\n\tactualString, expectedString, _ := matcher.prettyPrint(actual)\n\treturn formattedMessage(format.Message(actualString, \"to match JSON of\", expectedString), matcher.firstFailurePath)\n}\n\nfunc (matcher *MatchJSONMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\tactualString, expectedString, _ := matcher.prettyPrint(actual)\n\treturn formattedMessage(format.Message(actualString, \"not to match JSON of\", expectedString), matcher.firstFailurePath)\n}\n\nfunc (matcher *MatchJSONMatcher) prettyPrint(actual interface{}) (actualFormatted, expectedFormatted string, err error) {\n\tactualString, ok := toString(actual)\n\tif !ok {\n\t\treturn \"\", \"\", fmt.Errorf(\"MatchJSONMatcher matcher requires a string, stringer, or []byte. Got actual:\\n%s\", format.Object(actual, 1))\n\t}\n\texpectedString, ok := toString(matcher.JSONToMatch)\n\tif !ok {\n\t\treturn \"\", \"\", fmt.Errorf(\"MatchJSONMatcher matcher requires a string, stringer, or []byte. Got expected:\\n%s\", format.Object(matcher.JSONToMatch, 1))\n\t}\n\n\tabuf := new(bytes.Buffer)\n\tebuf := new(bytes.Buffer)\n\n\tif err := json.Indent(abuf, []byte(actualString), \"\", \" \"); err != nil {\n\t\treturn \"\", \"\", fmt.Errorf(\"Actual '%s' should be valid JSON, but it is not.\\nUnderlying error:%s\", actualString, err)\n\t}\n\n\tif err := json.Indent(ebuf, []byte(expectedString), \"\", \" \"); err != nil {\n\t\treturn \"\", \"\", fmt.Errorf(\"Expected '%s' should be valid JSON, but it is not.\\nUnderlying error:%s\", expectedString, err)\n\t}\n\n\treturn abuf.String(), ebuf.String(), nil\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/match_regexp_matcher.go", "content": "package matchers\n\nimport (\n\t\"fmt\"\n\t\"regexp\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype MatchRegexpMatcher struct {\n\tRegexp string\n\tArgs []interface{}\n}\n\nfunc (matcher *MatchRegexpMatcher) Match(actual interface{}) (success bool, err error) {\n\tactualString, ok := toString(actual)\n\tif !ok {\n\t\treturn false, fmt.Errorf(\"RegExp matcher requires a string or stringer.\\nGot:%s\", format.Object(actual, 1))\n\t}\n\n\tmatch, err := regexp.Match(matcher.regexp(), []byte(actualString))\n\tif err != nil {\n\t\treturn false, fmt.Errorf(\"RegExp match failed to compile with error:\\n\\t%s\", err.Error())\n\t}\n\n\treturn match, nil\n}\n\nfunc (matcher *MatchRegexpMatcher) FailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"to match regular expression\", matcher.regexp())\n}\n\nfunc (matcher *MatchRegexpMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"not to match regular expression\", matcher.regexp())\n}\n\nfunc (matcher *MatchRegexpMatcher) regexp() string {\n\tre := matcher.Regexp\n\tif len(matcher.Args) > 0 {\n\t\tre = fmt.Sprintf(matcher.Regexp, matcher.Args...)\n\t}\n\treturn re\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/match_xml_matcher.go", "content": "package matchers\n\nimport (\n\t\"bytes\"\n\t\"encoding/xml\"\n\t\"errors\"\n\t\"fmt\"\n\t\"io\"\n\t\"reflect\"\n\t\"sort\"\n\t\"strings\"\n\n\t\"github.com/onsi/gomega/format\"\n\t\"golang.org/x/net/html/charset\"\n)\n\ntype MatchXMLMatcher struct {\n\tXMLToMatch interface{}\n}\n\nfunc (matcher *MatchXMLMatcher) Match(actual interface{}) (success bool, err error) {\n\tactualString, expectedString, err := matcher.formattedPrint(actual)\n\tif err != nil {\n\t\treturn false, err\n\t}\n\n\taval, err := parseXmlContent(actualString)\n\tif err != nil {\n\t\treturn false, fmt.Errorf(\"Actual '%s' should be valid XML, but it is not.\\nUnderlying error:%s\", actualString, err)\n\t}\n\n\teval, err := parseXmlContent(expectedString)\n\tif err != nil {\n\t\treturn false, fmt.Errorf(\"Expected '%s' should be valid XML, but it is not.\\nUnderlying error:%s\", expectedString, err)\n\t}\n\n\treturn reflect.DeepEqual(aval, eval), nil\n}\n\nfunc (matcher *MatchXMLMatcher) FailureMessage(actual interface{}) (message string) {\n\tactualString, expectedString, _ := matcher.formattedPrint(actual)\n\treturn fmt.Sprintf(\"Expected\\n%s\\nto match XML of\\n%s\", actualString, expectedString)\n}\n\nfunc (matcher *MatchXMLMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\tactualString, expectedString, _ := matcher.formattedPrint(actual)\n\treturn fmt.Sprintf(\"Expected\\n%s\\nnot to match XML of\\n%s\", actualString, expectedString)\n}\n\nfunc (matcher *MatchXMLMatcher) formattedPrint(actual interface{}) (actualString, expectedString string, err error) {\n\tvar ok bool\n\tactualString, ok = toString(actual)\n\tif !ok {\n\t\treturn \"\", \"\", fmt.Errorf(\"MatchXMLMatcher matcher requires a string, stringer, or []byte. Got actual:\\n%s\", format.Object(actual, 1))\n\t}\n\texpectedString, ok = toString(matcher.XMLToMatch)\n\tif !ok {\n\t\treturn \"\", \"\", fmt.Errorf(\"MatchXMLMatcher matcher requires a string, stringer, or []byte. Got expected:\\n%s\", format.Object(matcher.XMLToMatch, 1))\n\t}\n\treturn actualString, expectedString, nil\n}\n\nfunc parseXmlContent(content string) (*xmlNode, error) {\n\tallNodes := []*xmlNode{}\n\n\tdec := newXmlDecoder(strings.NewReader(content))\n\tfor {\n\t\ttok, err := dec.Token()\n\t\tif err != nil {\n\t\t\tif err == io.EOF {\n\t\t\t\tbreak\n\t\t\t}\n\t\t\treturn nil, fmt.Errorf(\"failed to decode next token: %v\", err) // untested section\n\t\t}\n\n\t\tlastNodeIndex := len(allNodes) - 1\n\t\tvar lastNode *xmlNode\n\t\tif len(allNodes) > 0 {\n\t\t\tlastNode = allNodes[lastNodeIndex]\n\t\t} else {\n\t\t\tlastNode = &xmlNode{}\n\t\t}\n\n\t\tswitch tok := tok.(type) {\n\t\tcase xml.StartElement:\n\t\t\tattrs := attributesSlice(tok.Attr)\n\t\t\tsort.Sort(attrs)\n\t\t\tallNodes = append(allNodes, &xmlNode{XMLName: tok.Name, XMLAttr: tok.Attr})\n\t\tcase xml.EndElement:\n\t\t\tif len(allNodes) > 1 {\n\t\t\t\tallNodes[lastNodeIndex-1].Nodes = append(allNodes[lastNodeIndex-1].Nodes, lastNode)\n\t\t\t\tallNodes = allNodes[:lastNodeIndex]\n\t\t\t}\n\t\tcase xml.CharData:\n\t\t\tlastNode.Content = append(lastNode.Content, tok.Copy()...)\n\t\tcase xml.Comment:\n\t\t\tlastNode.Comments = append(lastNode.Comments, tok.Copy()) // untested section\n\t\tcase xml.ProcInst:\n\t\t\tlastNode.ProcInsts = append(lastNode.ProcInsts, tok.Copy())\n\t\t}\n\t}\n\n\tif len(allNodes) == 0 {\n\t\treturn nil, errors.New(\"found no nodes\")\n\t}\n\tfirstNode := allNodes[0]\n\ttrimParentNodesContentSpaces(firstNode)\n\n\treturn firstNode, nil\n}\n\nfunc newXmlDecoder(reader io.Reader) *xml.Decoder {\n\tdec := xml.NewDecoder(reader)\n\tdec.CharsetReader = charset.NewReaderLabel\n\treturn dec\n}\n\nfunc trimParentNodesContentSpaces(node *xmlNode) {\n\tif len(node.Nodes) > 0 {\n\t\tnode.Content = bytes.TrimSpace(node.Content)\n\t\tfor _, childNode := range node.Nodes {\n\t\t\ttrimParentNodesContentSpaces(childNode)\n\t\t}\n\t}\n}\n\ntype xmlNode struct {\n\tXMLName xml.Name\n\tComments []xml.Comment\n\tProcInsts []xml.ProcInst\n\tXMLAttr []xml.Attr\n\tContent []byte\n\tNodes []*xmlNode\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/match_yaml_matcher.go", "content": "package matchers\n\nimport (\n\t\"fmt\"\n\t\"strings\"\n\n\t\"github.com/onsi/gomega/format\"\n\t\"gopkg.in/yaml.v2\"\n)\n\ntype MatchYAMLMatcher struct {\n\tYAMLToMatch interface{}\n\tfirstFailurePath []interface{}\n}\n\nfunc (matcher *MatchYAMLMatcher) Match(actual interface{}) (success bool, err error) {\n\tactualString, expectedString, err := matcher.toStrings(actual)\n\tif err != nil {\n\t\treturn false, err\n\t}\n\n\tvar aval interface{}\n\tvar eval interface{}\n\n\tif err := yaml.Unmarshal([]byte(actualString), &aval); err != nil {\n\t\treturn false, fmt.Errorf(\"Actual '%s' should be valid YAML, but it is not.\\nUnderlying error:%s\", actualString, err)\n\t}\n\tif err := yaml.Unmarshal([]byte(expectedString), &eval); err != nil {\n\t\treturn false, fmt.Errorf(\"Expected '%s' should be valid YAML, but it is not.\\nUnderlying error:%s\", expectedString, err)\n\t}\n\n\tvar equal bool\n\tequal, matcher.firstFailurePath = deepEqual(aval, eval)\n\treturn equal, nil\n}\n\nfunc (matcher *MatchYAMLMatcher) FailureMessage(actual interface{}) (message string) {\n\tactualString, expectedString, _ := matcher.toNormalisedStrings(actual)\n\treturn formattedMessage(format.Message(actualString, \"to match YAML of\", expectedString), matcher.firstFailurePath)\n}\n\nfunc (matcher *MatchYAMLMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\tactualString, expectedString, _ := matcher.toNormalisedStrings(actual)\n\treturn formattedMessage(format.Message(actualString, \"not to match YAML of\", expectedString), matcher.firstFailurePath)\n}\n\nfunc (matcher *MatchYAMLMatcher) toNormalisedStrings(actual interface{}) (actualFormatted, expectedFormatted string, err error) {\n\tactualString, expectedString, err := matcher.toStrings(actual)\n\treturn normalise(actualString), normalise(expectedString), err\n}\n\nfunc normalise(input string) string {\n\tvar val interface{}\n\terr := yaml.Unmarshal([]byte(input), &val)\n\tif err != nil {\n\t\tpanic(err) // unreachable since Match already calls Unmarshal\n\t}\n\toutput, err := yaml.Marshal(val)\n\tif err != nil {\n\t\tpanic(err) // untested section, unreachable since we Unmarshal above\n\t}\n\treturn strings.TrimSpace(string(output))\n}\n\nfunc (matcher *MatchYAMLMatcher) toStrings(actual interface{}) (actualFormatted, expectedFormatted string, err error) {\n\tactualString, ok := toString(actual)\n\tif !ok {\n\t\treturn \"\", \"\", fmt.Errorf(\"MatchYAMLMatcher matcher requires a string, stringer, or []byte. Got actual:\\n%s\", format.Object(actual, 1))\n\t}\n\texpectedString, ok := toString(matcher.YAMLToMatch)\n\tif !ok {\n\t\treturn \"\", \"\", fmt.Errorf(\"MatchYAMLMatcher matcher requires a string, stringer, or []byte. Got expected:\\n%s\", format.Object(matcher.YAMLToMatch, 1))\n\t}\n\n\treturn actualString, expectedString, nil\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/not.go", "content": "package matchers\n\nimport (\n\t\"github.com/onsi/gomega/types\"\n)\n\ntype NotMatcher struct {\n\tMatcher types.GomegaMatcher\n}\n\nfunc (m *NotMatcher) Match(actual interface{}) (bool, error) {\n\tsuccess, err := m.Matcher.Match(actual)\n\tif err != nil {\n\t\treturn false, err\n\t}\n\treturn !success, nil\n}\n\nfunc (m *NotMatcher) FailureMessage(actual interface{}) (message string) {\n\treturn m.Matcher.NegatedFailureMessage(actual) // works beautifully\n}\n\nfunc (m *NotMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn m.Matcher.FailureMessage(actual) // works beautifully\n}\n\nfunc (m *NotMatcher) MatchMayChangeInTheFuture(actual interface{}) bool {\n\treturn types.MatchMayChangeInTheFuture(m.Matcher, actual) // just return m.Matcher's value\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/or.go", "content": "package matchers\n\nimport (\n\t\"fmt\"\n\n\t\"github.com/onsi/gomega/format\"\n\t\"github.com/onsi/gomega/types\"\n)\n\ntype OrMatcher struct {\n\tMatchers []types.GomegaMatcher\n\n\t// state\n\tfirstSuccessfulMatcher types.GomegaMatcher\n}\n\nfunc (m *OrMatcher) Match(actual interface{}) (success bool, err error) {\n\tm.firstSuccessfulMatcher = nil\n\tfor _, matcher := range m.Matchers {\n\t\tsuccess, err := matcher.Match(actual)\n\t\tif err != nil {\n\t\t\treturn false, err\n\t\t}\n\t\tif success {\n\t\t\tm.firstSuccessfulMatcher = matcher\n\t\t\treturn true, nil\n\t\t}\n\t}\n\treturn false, nil\n}\n\nfunc (m *OrMatcher) FailureMessage(actual interface{}) (message string) {\n\t// not the most beautiful list of matchers, but not bad either...\n\treturn format.Message(actual, fmt.Sprintf(\"To satisfy at least one of these matchers: %s\", m.Matchers))\n}\n\nfunc (m *OrMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn m.firstSuccessfulMatcher.NegatedFailureMessage(actual)\n}\n\nfunc (m *OrMatcher) MatchMayChangeInTheFuture(actual interface{}) bool {\n\t/*\n\t\tExample with 3 matchers: A, B, C\n\n\t\tMatch evaluates them: F, T, => T\n\t\tSo match is currently T, what should MatchMayChangeInTheFuture() return?\n\t\tSeems like it only depends on B, since currently B MUST change to allow the result to become F\n\n\t\tMatch eval: F, F, F => F\n\t\tSo match is currently F, what should MatchMayChangeInTheFuture() return?\n\t\tSeems to depend on ANY of them being able to change to T.\n\t*/\n\n\tif m.firstSuccessfulMatcher != nil {\n\t\t// one of the matchers succeeded.. it must be able to change in order to affect the result\n\t\treturn types.MatchMayChangeInTheFuture(m.firstSuccessfulMatcher, actual)\n\t} else {\n\t\t// so all matchers failed.. Any one of them changing would change the result.\n\t\tfor _, matcher := range m.Matchers {\n\t\t\tif types.MatchMayChangeInTheFuture(matcher, actual) {\n\t\t\t\treturn true\n\t\t\t}\n\t\t}\n\t\treturn false // none of were going to change\n\t}\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/panic_matcher.go", "content": "package matchers\n\nimport (\n\t\"fmt\"\n\t\"reflect\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype PanicMatcher struct {\n\tExpected interface{}\n\tobject interface{}\n}\n\nfunc (matcher *PanicMatcher) Match(actual interface{}) (success bool, err error) {\n\tif actual == nil {\n\t\treturn false, fmt.Errorf(\"PanicMatcher expects a non-nil actual.\")\n\t}\n\n\tactualType := reflect.TypeOf(actual)\n\tif actualType.Kind() != reflect.Func {\n\t\treturn false, fmt.Errorf(\"PanicMatcher expects a function. Got:\\n%s\", format.Object(actual, 1))\n\t}\n\tif !(actualType.NumIn() == 0 && actualType.NumOut() == 0) {\n\t\treturn false, fmt.Errorf(\"PanicMatcher expects a function with no arguments and no return value. Got:\\n%s\", format.Object(actual, 1))\n\t}\n\n\tsuccess = false\n\tdefer func() {\n\t\tif e := recover(); e != nil {\n\t\t\tmatcher.object = e\n\n\t\t\tif matcher.Expected == nil {\n\t\t\t\tsuccess = true\n\t\t\t\treturn\n\t\t\t}\n\n\t\t\tvalueMatcher, valueIsMatcher := matcher.Expected.(omegaMatcher)\n\t\t\tif !valueIsMatcher {\n\t\t\t\tvalueMatcher = &EqualMatcher{Expected: matcher.Expected}\n\t\t\t}\n\n\t\t\tsuccess, err = valueMatcher.Match(e)\n\t\t\tif err != nil {\n\t\t\t\terr = fmt.Errorf(\"PanicMatcher's value matcher failed with:\\n%s%s\", format.Indent, err.Error())\n\t\t\t}\n\t\t}\n\t}()\n\n\treflect.ValueOf(actual).Call([]reflect.Value{})\n\n\treturn\n}\n\nfunc (matcher *PanicMatcher) FailureMessage(actual interface{}) (message string) {\n\tif matcher.Expected == nil {\n\t\t// We wanted any panic to occur, but none did.\n\t\treturn format.Message(actual, \"to panic\")\n\t}\n\n\tif matcher.object == nil {\n\t\t// We wanted a panic with a specific value to occur, but none did.\n\t\tswitch matcher.Expected.(type) {\n\t\tcase omegaMatcher:\n\t\t\treturn format.Message(actual, \"to panic with a value matching\", matcher.Expected)\n\t\tdefault:\n\t\t\treturn format.Message(actual, \"to panic with\", matcher.Expected)\n\t\t}\n\t}\n\n\t// We got a panic, but the value isn't what we expected.\n\tswitch matcher.Expected.(type) {\n\tcase omegaMatcher:\n\t\treturn format.Message(\n\t\t\tactual,\n\t\t\tfmt.Sprintf(\n\t\t\t\t\"to panic with a value matching\\n%s\\nbut panicked with\\n%s\",\n\t\t\t\tformat.Object(matcher.Expected, 1),\n\t\t\t\tformat.Object(matcher.object, 1),\n\t\t\t),\n\t\t)\n\tdefault:\n\t\treturn format.Message(\n\t\t\tactual,\n\t\t\tfmt.Sprintf(\n\t\t\t\t\"to panic with\\n%s\\nbut panicked with\\n%s\",\n\t\t\t\tformat.Object(matcher.Expected, 1),\n\t\t\t\tformat.Object(matcher.object, 1),\n\t\t\t),\n\t\t)\n\t}\n}\n\nfunc (matcher *PanicMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\tif matcher.Expected == nil {\n\t\t// We didn't want any panic to occur, but one did.\n\t\treturn format.Message(actual, fmt.Sprintf(\"not to panic, but panicked with\\n%s\", format.Object(matcher.object, 1)))\n\t}\n\n\t// We wanted a to ensure a panic with a specific value did not occur, but it did.\n\tswitch matcher.Expected.(type) {\n\tcase omegaMatcher:\n\t\treturn format.Message(\n\t\t\tactual,\n\t\t\tfmt.Sprintf(\n\t\t\t\t\"not to panic with a value matching\\n%s\\nbut panicked with\\n%s\",\n\t\t\t\tformat.Object(matcher.Expected, 1),\n\t\t\t\tformat.Object(matcher.object, 1),\n\t\t\t),\n\t\t)\n\tdefault:\n\t\treturn format.Message(actual, \"not to panic with\", matcher.Expected)\n\t}\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/receive_matcher.go", "content": "// untested sections: 3\n\npackage matchers\n\nimport (\n\t\"fmt\"\n\t\"reflect\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype ReceiveMatcher struct {\n\tArg interface{}\n\treceivedValue reflect.Value\n\tchannelClosed bool\n}\n\nfunc (matcher *ReceiveMatcher) Match(actual interface{}) (success bool, err error) {\n\tif !isChan(actual) {\n\t\treturn false, fmt.Errorf(\"ReceiveMatcher expects a channel. Got:\\n%s\", format.Object(actual, 1))\n\t}\n\n\tchannelType := reflect.TypeOf(actual)\n\tchannelValue := reflect.ValueOf(actual)\n\n\tif channelType.ChanDir() == reflect.SendDir {\n\t\treturn false, fmt.Errorf(\"ReceiveMatcher matcher cannot be passed a send-only channel. Got:\\n%s\", format.Object(actual, 1))\n\t}\n\n\tvar subMatcher omegaMatcher\n\tvar hasSubMatcher bool\n\n\tif matcher.Arg != nil {\n\t\tsubMatcher, hasSubMatcher = (matcher.Arg).(omegaMatcher)\n\t\tif !hasSubMatcher {\n\t\t\targType := reflect.TypeOf(matcher.Arg)\n\t\t\tif argType.Kind() != reflect.Ptr {\n\t\t\t\treturn false, fmt.Errorf(\"Cannot assign a value from the channel:\\n%s\\nTo:\\n%s\\nYou need to pass a pointer!\", format.Object(actual, 1), format.Object(matcher.Arg, 1))\n\t\t\t}\n\t\t}\n\t}\n\n\twinnerIndex, value, open := reflect.Select([]reflect.SelectCase{\n\t\t{Dir: reflect.SelectRecv, Chan: channelValue},\n\t\t{Dir: reflect.SelectDefault},\n\t})\n\n\tvar closed bool\n\tvar didReceive bool\n\tif winnerIndex == 0 {\n\t\tclosed = !open\n\t\tdidReceive = open\n\t}\n\tmatcher.channelClosed = closed\n\n\tif closed {\n\t\treturn false, nil\n\t}\n\n\tif hasSubMatcher {\n\t\tif didReceive {\n\t\t\tmatcher.receivedValue = value\n\t\t\treturn subMatcher.Match(matcher.receivedValue.Interface())\n\t\t}\n\t\treturn false, nil\n\t}\n\n\tif didReceive {\n\t\tif matcher.Arg != nil {\n\t\t\toutValue := reflect.ValueOf(matcher.Arg)\n\n\t\t\tif value.Type().AssignableTo(outValue.Elem().Type()) {\n\t\t\t\toutValue.Elem().Set(value)\n\t\t\t\treturn true, nil\n\t\t\t}\n\t\t\tif value.Type().Kind() == reflect.Interface && value.Elem().Type().AssignableTo(outValue.Elem().Type()) {\n\t\t\t\toutValue.Elem().Set(value.Elem())\n\t\t\t\treturn true, nil\n\t\t\t} else {\n\t\t\t\treturn false, fmt.Errorf(\"Cannot assign a value from the channel:\\n%s\\nType:\\n%s\\nTo:\\n%s\", format.Object(actual, 1), format.Object(value.Interface(), 1), format.Object(matcher.Arg, 1))\n\t\t\t}\n\n\t\t}\n\n\t\treturn true, nil\n\t}\n\treturn false, nil\n}\n\nfunc (matcher *ReceiveMatcher) FailureMessage(actual interface{}) (message string) {\n\tsubMatcher, hasSubMatcher := (matcher.Arg).(omegaMatcher)\n\n\tclosedAddendum := \"\"\n\tif matcher.channelClosed {\n\t\tclosedAddendum = \" The channel is closed.\"\n\t}\n\n\tif hasSubMatcher {\n\t\tif matcher.receivedValue.IsValid() {\n\t\t\treturn subMatcher.FailureMessage(matcher.receivedValue.Interface())\n\t\t}\n\t\treturn \"When passed a matcher, ReceiveMatcher's channel *must* receive something.\"\n\t}\n\treturn format.Message(actual, \"to receive something.\"+closedAddendum)\n}\n\nfunc (matcher *ReceiveMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\tsubMatcher, hasSubMatcher := (matcher.Arg).(omegaMatcher)\n\n\tclosedAddendum := \"\"\n\tif matcher.channelClosed {\n\t\tclosedAddendum = \" The channel is closed.\"\n\t}\n\n\tif hasSubMatcher {\n\t\tif matcher.receivedValue.IsValid() {\n\t\t\treturn subMatcher.NegatedFailureMessage(matcher.receivedValue.Interface())\n\t\t}\n\t\treturn \"When passed a matcher, ReceiveMatcher's channel *must* receive something.\"\n\t}\n\treturn format.Message(actual, \"not to receive anything.\"+closedAddendum)\n}\n\nfunc (matcher *ReceiveMatcher) MatchMayChangeInTheFuture(actual interface{}) bool {\n\tif !isChan(actual) {\n\t\treturn false\n\t}\n\n\treturn !matcher.channelClosed\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/satisfy_matcher.go", "content": "package matchers\n\nimport (\n\t\"fmt\"\n\t\"reflect\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype SatisfyMatcher struct {\n\tPredicate interface{}\n\n\t// cached type\n\tpredicateArgType reflect.Type\n}\n\nfunc NewSatisfyMatcher(predicate interface{}) *SatisfyMatcher {\n\tif predicate == nil {\n\t\tpanic(\"predicate cannot be nil\")\n\t}\n\tpredicateType := reflect.TypeOf(predicate)\n\tif predicateType.Kind() != reflect.Func {\n\t\tpanic(\"predicate must be a function\")\n\t}\n\tif predicateType.NumIn() != 1 {\n\t\tpanic(\"predicate must have 1 argument\")\n\t}\n\tif predicateType.NumOut() != 1 || predicateType.Out(0).Kind() != reflect.Bool {\n\t\tpanic(\"predicate must return bool\")\n\t}\n\n\treturn &SatisfyMatcher{\n\t\tPredicate: predicate,\n\t\tpredicateArgType: predicateType.In(0),\n\t}\n}\n\nfunc (m *SatisfyMatcher) Match(actual interface{}) (success bool, err error) {\n\t// prepare a parameter to pass to the predicate\n\tvar param reflect.Value\n\tif actual != nil && reflect.TypeOf(actual).AssignableTo(m.predicateArgType) {\n\t\t// The dynamic type of actual is compatible with the predicate argument.\n\t\tparam = reflect.ValueOf(actual)\n\n\t} else if actual == nil && m.predicateArgType.Kind() == reflect.Interface {\n\t\t// The dynamic type of actual is unknown, so there's no way to make its\n\t\t// reflect.Value. Create a nil of the predicate argument, which is known.\n\t\tparam = reflect.Zero(m.predicateArgType)\n\n\t} else {\n\t\treturn false, fmt.Errorf(\"predicate expects '%s' but we have '%T'\", m.predicateArgType, actual)\n\t}\n\n\t// call the predicate with `actual`\n\tfn := reflect.ValueOf(m.Predicate)\n\tresult := fn.Call([]reflect.Value{param})\n\treturn result[0].Bool(), nil\n}\n\nfunc (m *SatisfyMatcher) FailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"to satisfy predicate\", m.Predicate)\n}\n\nfunc (m *SatisfyMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn format.Message(actual, \"to not satisfy predicate\", m.Predicate)\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/semi_structured_data_support.go", "content": "// untested sections: 5\n\npackage matchers\n\nimport (\n\t\"fmt\"\n\t\"reflect\"\n\t\"strings\"\n)\n\nfunc formattedMessage(comparisonMessage string, failurePath []interface{}) string {\n\tvar diffMessage string\n\tif len(failurePath) == 0 {\n\t\tdiffMessage = \"\"\n\t} else {\n\t\tdiffMessage = fmt.Sprintf(\"\\n\\nfirst mismatched key: %s\", formattedFailurePath(failurePath))\n\t}\n\treturn fmt.Sprintf(\"%s%s\", comparisonMessage, diffMessage)\n}\n\nfunc formattedFailurePath(failurePath []interface{}) string {\n\tformattedPaths := []string{}\n\tfor i := len(failurePath) - 1; i >= 0; i-- {\n\t\tswitch p := failurePath[i].(type) {\n\t\tcase int:\n\t\t\tformattedPaths = append(formattedPaths, fmt.Sprintf(`[%d]`, p))\n\t\tdefault:\n\t\t\tif i != len(failurePath)-1 {\n\t\t\t\tformattedPaths = append(formattedPaths, \".\")\n\t\t\t}\n\t\t\tformattedPaths = append(formattedPaths, fmt.Sprintf(`\"%s\"`, p))\n\t\t}\n\t}\n\treturn strings.Join(formattedPaths, \"\")\n}\n\nfunc deepEqual(a interface{}, b interface{}) (bool, []interface{}) {\n\tvar errorPath []interface{}\n\tif reflect.TypeOf(a) != reflect.TypeOf(b) {\n\t\treturn false, errorPath\n\t}\n\n\tswitch a.(type) {\n\tcase []interface{}:\n\t\tif len(a.([]interface{})) != len(b.([]interface{})) {\n\t\t\treturn false, errorPath\n\t\t}\n\n\t\tfor i, v := range a.([]interface{}) {\n\t\t\telementEqual, keyPath := deepEqual(v, b.([]interface{})[i])\n\t\t\tif !elementEqual {\n\t\t\t\treturn false, append(keyPath, i)\n\t\t\t}\n\t\t}\n\t\treturn true, errorPath\n\n\tcase map[interface{}]interface{}:\n\t\tif len(a.(map[interface{}]interface{})) != len(b.(map[interface{}]interface{})) {\n\t\t\treturn false, errorPath\n\t\t}\n\n\t\tfor k, v1 := range a.(map[interface{}]interface{}) {\n\t\t\tv2, ok := b.(map[interface{}]interface{})[k]\n\t\t\tif !ok {\n\t\t\t\treturn false, errorPath\n\t\t\t}\n\t\t\telementEqual, keyPath := deepEqual(v1, v2)\n\t\t\tif !elementEqual {\n\t\t\t\treturn false, append(keyPath, k)\n\t\t\t}\n\t\t}\n\t\treturn true, errorPath\n\n\tcase map[string]interface{}:\n\t\tif len(a.(map[string]interface{})) != len(b.(map[string]interface{})) {\n\t\t\treturn false, errorPath\n\t\t}\n\n\t\tfor k, v1 := range a.(map[string]interface{}) {\n\t\t\tv2, ok := b.(map[string]interface{})[k]\n\t\t\tif !ok {\n\t\t\t\treturn false, errorPath\n\t\t\t}\n\t\t\telementEqual, keyPath := deepEqual(v1, v2)\n\t\t\tif !elementEqual {\n\t\t\t\treturn false, append(keyPath, k)\n\t\t\t}\n\t\t}\n\t\treturn true, errorPath\n\n\tdefault:\n\t\treturn a == b, errorPath\n\t}\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/succeed_matcher.go", "content": "package matchers\n\nimport (\n\t\"fmt\"\n\n\t\"github.com/onsi/gomega/format\"\n)\n\ntype SucceedMatcher struct {\n}\n\nfunc (matcher *SucceedMatcher) Match(actual interface{}) (success bool, err error) {\n\t// is purely nil?\n\tif actual == nil {\n\t\treturn true, nil\n\t}\n\n\t// must be an 'error' type\n\tif !isError(actual) {\n\t\treturn false, fmt.Errorf(\"Expected an error-type. Got:\\n%s\", format.Object(actual, 1))\n\t}\n\n\t// must be nil (or a pointer to a nil)\n\treturn isNil(actual), nil\n}\n\nfunc (matcher *SucceedMatcher) FailureMessage(actual interface{}) (message string) {\n\treturn fmt.Sprintf(\"Expected success, but got an error:\\n%s\\n%s\", format.Object(actual, 1), format.IndentString(actual.(error).Error(), 1))\n}\n\nfunc (matcher *SucceedMatcher) NegatedFailureMessage(actual interface{}) (message string) {\n\treturn \"Expected failure, but got no error.\"\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/bipartitegraph.go", "content": "package bipartitegraph\n\nimport \"fmt\"\n\nimport . \"github.com/onsi/gomega/matchers/support/goraph/node\"\nimport . \"github.com/onsi/gomega/matchers/support/goraph/edge\"\n\ntype BipartiteGraph struct {\n\tLeft NodeOrderedSet\n\tRight NodeOrderedSet\n\tEdges EdgeSet\n}\n\nfunc NewBipartiteGraph(leftValues, rightValues []interface{}, neighbours func(interface{}, interface{}) (bool, error)) (*BipartiteGraph, error) {\n\tleft := NodeOrderedSet{}\n\tfor i, v := range leftValues {\n\t\tleft = append(left, Node{ID: i, Value: v})\n\t}\n\n\tright := NodeOrderedSet{}\n\tfor j, v := range rightValues {\n\t\tright = append(right, Node{ID: j + len(left), Value: v})\n\t}\n\n\tedges := EdgeSet{}\n\tfor i, leftValue := range leftValues {\n\t\tfor j, rightValue := range rightValues {\n\t\t\tneighbours, err := neighbours(leftValue, rightValue)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, fmt.Errorf(\"error determining adjacency for %v and %v: %s\", leftValue, rightValue, err.Error())\n\t\t\t}\n\n\t\t\tif neighbours {\n\t\t\t\tedges = append(edges, Edge{Node1: left[i].ID, Node2: right[j].ID})\n\t\t\t}\n\t\t}\n\t}\n\n\treturn &BipartiteGraph{left, right, edges}, nil\n}\n\n// FreeLeftRight returns left node values and right node values\n// of the BipartiteGraph's nodes which are not part of the given edges.\nfunc (bg *BipartiteGraph) FreeLeftRight(edges EdgeSet) (leftValues, rightValues []interface{}) {\n\tfor _, node := range bg.Left {\n\t\tif edges.Free(node) {\n\t\t\tleftValues = append(leftValues, node.Value)\n\t\t}\n\t}\n\tfor _, node := range bg.Right {\n\t\tif edges.Free(node) {\n\t\t\trightValues = append(rightValues, node.Value)\n\t\t}\n\t}\n\treturn\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/support/goraph/bipartitegraph/bipartitegraphmatching.go", "content": "package bipartitegraph\n\nimport (\n\t. \"github.com/onsi/gomega/matchers/support/goraph/edge\"\n\t. \"github.com/onsi/gomega/matchers/support/goraph/node\"\n\t\"github.com/onsi/gomega/matchers/support/goraph/util\"\n)\n\n// LargestMatching implements the Hopcroft–Karp algorithm taking as input a bipartite graph\n// and outputting a maximum cardinality matching, i.e. a set of as many edges as possible\n// with the property that no two edges share an endpoint.\nfunc (bg *BipartiteGraph) LargestMatching() (matching EdgeSet) {\n\tpaths := bg.maximalDisjointSLAPCollection(matching)\n\n\tfor len(paths) > 0 {\n\t\tfor _, path := range paths {\n\t\t\tmatching = matching.SymmetricDifference(path)\n\t\t}\n\t\tpaths = bg.maximalDisjointSLAPCollection(matching)\n\t}\n\n\treturn\n}\n\nfunc (bg *BipartiteGraph) maximalDisjointSLAPCollection(matching EdgeSet) (result []EdgeSet) {\n\tguideLayers := bg.createSLAPGuideLayers(matching)\n\tif len(guideLayers) == 0 {\n\t\treturn\n\t}\n\n\tused := make(map[int]bool)\n\n\tfor _, u := range guideLayers[len(guideLayers)-1] {\n\t\tslap, found := bg.findDisjointSLAP(u, matching, guideLayers, used)\n\t\tif found {\n\t\t\tfor _, edge := range slap {\n\t\t\t\tused[edge.Node1] = true\n\t\t\t\tused[edge.Node2] = true\n\t\t\t}\n\t\t\tresult = append(result, slap)\n\t\t}\n\t}\n\n\treturn\n}\n\nfunc (bg *BipartiteGraph) findDisjointSLAP(\n\tstart Node,\n\tmatching EdgeSet,\n\tguideLayers []NodeOrderedSet,\n\tused map[int]bool,\n) ([]Edge, bool) {\n\treturn bg.findDisjointSLAPHelper(start, EdgeSet{}, len(guideLayers)-1, matching, guideLayers, used)\n}\n\nfunc (bg *BipartiteGraph) findDisjointSLAPHelper(\n\tcurrentNode Node,\n\tcurrentSLAP EdgeSet,\n\tcurrentLevel int,\n\tmatching EdgeSet,\n\tguideLayers []NodeOrderedSet,\n\tused map[int]bool,\n) (EdgeSet, bool) {\n\tused[currentNode.ID] = true\n\n\tif currentLevel == 0 {\n\t\treturn currentSLAP, true\n\t}\n\n\tfor _, nextNode := range guideLayers[currentLevel-1] {\n\t\tif used[nextNode.ID] {\n\t\t\tcontinue\n\t\t}\n\n\t\tedge, found := bg.Edges.FindByNodes(currentNode, nextNode)\n\t\tif !found {\n\t\t\tcontinue\n\t\t}\n\n\t\tif matching.Contains(edge) == util.Odd(currentLevel) {\n\t\t\tcontinue\n\t\t}\n\n\t\tcurrentSLAP = append(currentSLAP, edge)\n\t\tslap, found := bg.findDisjointSLAPHelper(nextNode, currentSLAP, currentLevel-1, matching, guideLayers, used)\n\t\tif found {\n\t\t\treturn slap, true\n\t\t}\n\t\tcurrentSLAP = currentSLAP[:len(currentSLAP)-1]\n\t}\n\n\tused[currentNode.ID] = false\n\treturn nil, false\n}\n\nfunc (bg *BipartiteGraph) createSLAPGuideLayers(matching EdgeSet) (guideLayers []NodeOrderedSet) {\n\tused := make(map[int]bool)\n\tcurrentLayer := NodeOrderedSet{}\n\n\tfor _, node := range bg.Left {\n\t\tif matching.Free(node) {\n\t\t\tused[node.ID] = true\n\t\t\tcurrentLayer = append(currentLayer, node)\n\t\t}\n\t}\n\n\tif len(currentLayer) == 0 {\n\t\treturn []NodeOrderedSet{}\n\t}\n\tguideLayers = append(guideLayers, currentLayer)\n\n\tdone := false\n\n\tfor !done {\n\t\tlastLayer := currentLayer\n\t\tcurrentLayer = NodeOrderedSet{}\n\n\t\tif util.Odd(len(guideLayers)) {\n\t\t\tfor _, leftNode := range lastLayer {\n\t\t\t\tfor _, rightNode := range bg.Right {\n\t\t\t\t\tif used[rightNode.ID] {\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\n\t\t\t\t\tedge, found := bg.Edges.FindByNodes(leftNode, rightNode)\n\t\t\t\t\tif !found || matching.Contains(edge) {\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\n\t\t\t\t\tcurrentLayer = append(currentLayer, rightNode)\n\t\t\t\t\tused[rightNode.ID] = true\n\n\t\t\t\t\tif matching.Free(rightNode) {\n\t\t\t\t\t\tdone = true\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tfor _, rightNode := range lastLayer {\n\t\t\t\tfor _, leftNode := range bg.Left {\n\t\t\t\t\tif used[leftNode.ID] {\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\n\t\t\t\t\tedge, found := bg.Edges.FindByNodes(leftNode, rightNode)\n\t\t\t\t\tif !found || !matching.Contains(edge) {\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\n\t\t\t\t\tcurrentLayer = append(currentLayer, leftNode)\n\t\t\t\t\tused[leftNode.ID] = true\n\t\t\t\t}\n\t\t\t}\n\n\t\t}\n\n\t\tif len(currentLayer) == 0 {\n\t\t\treturn []NodeOrderedSet{}\n\t\t}\n\t\tguideLayers = append(guideLayers, currentLayer)\n\t}\n\n\treturn\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/support/goraph/edge/edge.go", "content": "package edge\n\nimport . \"github.com/onsi/gomega/matchers/support/goraph/node\"\n\ntype Edge struct {\n\tNode1 int\n\tNode2 int\n}\n\ntype EdgeSet []Edge\n\nfunc (ec EdgeSet) Free(node Node) bool {\n\tfor _, e := range ec {\n\t\tif e.Node1 == node.ID || e.Node2 == node.ID {\n\t\t\treturn false\n\t\t}\n\t}\n\n\treturn true\n}\n\nfunc (ec EdgeSet) Contains(edge Edge) bool {\n\tfor _, e := range ec {\n\t\tif e == edge {\n\t\t\treturn true\n\t\t}\n\t}\n\n\treturn false\n}\n\nfunc (ec EdgeSet) FindByNodes(node1, node2 Node) (Edge, bool) {\n\tfor _, e := range ec {\n\t\tif (e.Node1 == node1.ID && e.Node2 == node2.ID) || (e.Node1 == node2.ID && e.Node2 == node1.ID) {\n\t\t\treturn e, true\n\t\t}\n\t}\n\n\treturn Edge{}, false\n}\n\nfunc (ec EdgeSet) SymmetricDifference(ec2 EdgeSet) EdgeSet {\n\tedgesToInclude := make(map[Edge]bool)\n\n\tfor _, e := range ec {\n\t\tedgesToInclude[e] = true\n\t}\n\n\tfor _, e := range ec2 {\n\t\tedgesToInclude[e] = !edgesToInclude[e]\n\t}\n\n\tresult := EdgeSet{}\n\tfor e, include := range edgesToInclude {\n\t\tif include {\n\t\t\tresult = append(result, e)\n\t\t}\n\t}\n\n\treturn result\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/support/goraph/node/node.go", "content": "package node\n\ntype Node struct {\n\tID int\n\tValue interface{}\n}\n\ntype NodeOrderedSet []Node\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/support/goraph/util/util.go", "content": "package util\n\nimport \"math\"\n\nfunc Odd(n int) bool {\n\treturn math.Mod(float64(n), 2.0) == 1.0\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/type_support.go", "content": "/*\nGomega matchers\n\nThis package implements the Gomega matchers and does not typically need to be imported.\nSee the docs for Gomega for documentation on the matchers\n\nhttp://onsi.github.io/gomega/\n*/\n\n// untested sections: 11\n\npackage matchers\n\nimport (\n\t\"encoding/json\"\n\t\"fmt\"\n\t\"reflect\"\n)\n\ntype omegaMatcher interface {\n\tMatch(actual interface{}) (success bool, err error)\n\tFailureMessage(actual interface{}) (message string)\n\tNegatedFailureMessage(actual interface{}) (message string)\n}\n\nfunc isBool(a interface{}) bool {\n\treturn reflect.TypeOf(a).Kind() == reflect.Bool\n}\n\nfunc isNumber(a interface{}) bool {\n\tif a == nil {\n\t\treturn false\n\t}\n\tkind := reflect.TypeOf(a).Kind()\n\treturn reflect.Int <= kind && kind <= reflect.Float64\n}\n\nfunc isInteger(a interface{}) bool {\n\tkind := reflect.TypeOf(a).Kind()\n\treturn reflect.Int <= kind && kind <= reflect.Int64\n}\n\nfunc isUnsignedInteger(a interface{}) bool {\n\tkind := reflect.TypeOf(a).Kind()\n\treturn reflect.Uint <= kind && kind <= reflect.Uint64\n}\n\nfunc isFloat(a interface{}) bool {\n\tkind := reflect.TypeOf(a).Kind()\n\treturn reflect.Float32 <= kind && kind <= reflect.Float64\n}\n\nfunc toInteger(a interface{}) int64 {\n\tif isInteger(a) {\n\t\treturn reflect.ValueOf(a).Int()\n\t} else if isUnsignedInteger(a) {\n\t\treturn int64(reflect.ValueOf(a).Uint())\n\t} else if isFloat(a) {\n\t\treturn int64(reflect.ValueOf(a).Float())\n\t}\n\tpanic(fmt.Sprintf(\"Expected a number! Got <%T> %#v\", a, a))\n}\n\nfunc toUnsignedInteger(a interface{}) uint64 {\n\tif isInteger(a) {\n\t\treturn uint64(reflect.ValueOf(a).Int())\n\t} else if isUnsignedInteger(a) {\n\t\treturn reflect.ValueOf(a).Uint()\n\t} else if isFloat(a) {\n\t\treturn uint64(reflect.ValueOf(a).Float())\n\t}\n\tpanic(fmt.Sprintf(\"Expected a number! Got <%T> %#v\", a, a))\n}\n\nfunc toFloat(a interface{}) float64 {\n\tif isInteger(a) {\n\t\treturn float64(reflect.ValueOf(a).Int())\n\t} else if isUnsignedInteger(a) {\n\t\treturn float64(reflect.ValueOf(a).Uint())\n\t} else if isFloat(a) {\n\t\treturn reflect.ValueOf(a).Float()\n\t}\n\tpanic(fmt.Sprintf(\"Expected a number! Got <%T> %#v\", a, a))\n}\n\nfunc isError(a interface{}) bool {\n\t_, ok := a.(error)\n\treturn ok\n}\n\nfunc isChan(a interface{}) bool {\n\tif isNil(a) {\n\t\treturn false\n\t}\n\treturn reflect.TypeOf(a).Kind() == reflect.Chan\n}\n\nfunc isMap(a interface{}) bool {\n\tif a == nil {\n\t\treturn false\n\t}\n\treturn reflect.TypeOf(a).Kind() == reflect.Map\n}\n\nfunc isArrayOrSlice(a interface{}) bool {\n\tif a == nil {\n\t\treturn false\n\t}\n\tswitch reflect.TypeOf(a).Kind() {\n\tcase reflect.Array, reflect.Slice:\n\t\treturn true\n\tdefault:\n\t\treturn false\n\t}\n}\n\nfunc isString(a interface{}) bool {\n\tif a == nil {\n\t\treturn false\n\t}\n\treturn reflect.TypeOf(a).Kind() == reflect.String\n}\n\nfunc toString(a interface{}) (string, bool) {\n\taString, isString := a.(string)\n\tif isString {\n\t\treturn aString, true\n\t}\n\n\taBytes, isBytes := a.([]byte)\n\tif isBytes {\n\t\treturn string(aBytes), true\n\t}\n\n\taStringer, isStringer := a.(fmt.Stringer)\n\tif isStringer {\n\t\treturn aStringer.String(), true\n\t}\n\n\taJSONRawMessage, isJSONRawMessage := a.(json.RawMessage)\n\tif isJSONRawMessage {\n\t\treturn string(aJSONRawMessage), true\n\t}\n\n\treturn \"\", false\n}\n\nfunc lengthOf(a interface{}) (int, bool) {\n\tif a == nil {\n\t\treturn 0, false\n\t}\n\tswitch reflect.TypeOf(a).Kind() {\n\tcase reflect.Map, reflect.Array, reflect.String, reflect.Chan, reflect.Slice:\n\t\treturn reflect.ValueOf(a).Len(), true\n\tdefault:\n\t\treturn 0, false\n\t}\n}\nfunc capOf(a interface{}) (int, bool) {\n\tif a == nil {\n\t\treturn 0, false\n\t}\n\tswitch reflect.TypeOf(a).Kind() {\n\tcase reflect.Array, reflect.Chan, reflect.Slice:\n\t\treturn reflect.ValueOf(a).Cap(), true\n\tdefault:\n\t\treturn 0, false\n\t}\n}\n\nfunc isNil(a interface{}) bool {\n\tif a == nil {\n\t\treturn true\n\t}\n\n\tswitch reflect.TypeOf(a).Kind() {\n\tcase reflect.Chan, reflect.Func, reflect.Interface, reflect.Map, reflect.Ptr, reflect.Slice:\n\t\treturn reflect.ValueOf(a).IsNil()\n\t}\n\n\treturn false\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers/with_transform.go", "content": "package matchers\n\nimport (\n\t\"fmt\"\n\t\"reflect\"\n\n\t\"github.com/onsi/gomega/types\"\n)\n\ntype WithTransformMatcher struct {\n\t// input\n\tTransform interface{} // must be a function of one parameter that returns one value and an optional error\n\tMatcher types.GomegaMatcher\n\n\t// cached value\n\ttransformArgType reflect.Type\n\n\t// state\n\ttransformedValue interface{}\n}\n\n// reflect.Type for error\nvar errorT = reflect.TypeOf((*error)(nil)).Elem()\n\nfunc NewWithTransformMatcher(transform interface{}, matcher types.GomegaMatcher) *WithTransformMatcher {\n\tif transform == nil {\n\t\tpanic(\"transform function cannot be nil\")\n\t}\n\ttxType := reflect.TypeOf(transform)\n\tif txType.NumIn() != 1 {\n\t\tpanic(\"transform function must have 1 argument\")\n\t}\n\tif numout := txType.NumOut(); numout != 1 {\n\t\tif numout != 2 || !txType.Out(1).AssignableTo(errorT) {\n\t\t\tpanic(\"transform function must either have 1 return value, or 1 return value plus 1 error value\")\n\t\t}\n\t}\n\n\treturn &WithTransformMatcher{\n\t\tTransform: transform,\n\t\tMatcher: matcher,\n\t\ttransformArgType: reflect.TypeOf(transform).In(0),\n\t}\n}\n\nfunc (m *WithTransformMatcher) Match(actual interface{}) (bool, error) {\n\t// prepare a parameter to pass to the Transform function\n\tvar param reflect.Value\n\tif actual != nil && reflect.TypeOf(actual).AssignableTo(m.transformArgType) {\n\t\t// The dynamic type of actual is compatible with the transform argument.\n\t\tparam = reflect.ValueOf(actual)\n\n\t} else if actual == nil && m.transformArgType.Kind() == reflect.Interface {\n\t\t// The dynamic type of actual is unknown, so there's no way to make its\n\t\t// reflect.Value. Create a nil of the transform argument, which is known.\n\t\tparam = reflect.Zero(m.transformArgType)\n\n\t} else {\n\t\treturn false, fmt.Errorf(\"Transform function expects '%s' but we have '%T'\", m.transformArgType, actual)\n\t}\n\n\t// call the Transform function with `actual`\n\tfn := reflect.ValueOf(m.Transform)\n\tresult := fn.Call([]reflect.Value{param})\n\tif len(result) == 2 {\n\t\tif !result[1].IsNil() {\n\t\t\treturn false, fmt.Errorf(\"Transform function failed: %s\", result[1].Interface().(error).Error())\n\t\t}\n\t}\n\tm.transformedValue = result[0].Interface() // expect exactly one value\n\n\treturn m.Matcher.Match(m.transformedValue)\n}\n\nfunc (m *WithTransformMatcher) FailureMessage(_ interface{}) (message string) {\n\treturn m.Matcher.FailureMessage(m.transformedValue)\n}\n\nfunc (m *WithTransformMatcher) NegatedFailureMessage(_ interface{}) (message string) {\n\treturn m.Matcher.NegatedFailureMessage(m.transformedValue)\n}\n\nfunc (m *WithTransformMatcher) MatchMayChangeInTheFuture(_ interface{}) bool {\n\t// TODO: Maybe this should always just return true? (Only an issue for non-deterministic transformers.)\n\t//\n\t// Querying the next matcher is fine if the transformer always will return the same value.\n\t// But if the transformer is non-deterministic and returns a different value each time, then there\n\t// is no point in querying the next matcher, since it can only comment on the last transformed value.\n\treturn types.MatchMayChangeInTheFuture(m.Matcher, m.transformedValue)\n}\n" }, { "path": "vendor/github.com/onsi/gomega/matchers.go", "content": "package gomega\n\nimport (\n\t\"time\"\n\n\t\"github.com/onsi/gomega/matchers\"\n\t\"github.com/onsi/gomega/types\"\n)\n\n//Equal uses reflect.DeepEqual to compare actual with expected. Equal is strict about\n//types when performing comparisons.\n//It is an error for both actual and expected to be nil. Use BeNil() instead.\nfunc Equal(expected interface{}) types.GomegaMatcher {\n\treturn &matchers.EqualMatcher{\n\t\tExpected: expected,\n\t}\n}\n\n//BeEquivalentTo is more lax than Equal, allowing equality between different types.\n//This is done by converting actual to have the type of expected before\n//attempting equality with reflect.DeepEqual.\n//It is an error for actual and expected to be nil. Use BeNil() instead.\nfunc BeEquivalentTo(expected interface{}) types.GomegaMatcher {\n\treturn &matchers.BeEquivalentToMatcher{\n\t\tExpected: expected,\n\t}\n}\n\n//BeIdenticalTo uses the == operator to compare actual with expected.\n//BeIdenticalTo is strict about types when performing comparisons.\n//It is an error for both actual and expected to be nil. Use BeNil() instead.\nfunc BeIdenticalTo(expected interface{}) types.GomegaMatcher {\n\treturn &matchers.BeIdenticalToMatcher{\n\t\tExpected: expected,\n\t}\n}\n\n//BeNil succeeds if actual is nil\nfunc BeNil() types.GomegaMatcher {\n\treturn &matchers.BeNilMatcher{}\n}\n\n//BeTrue succeeds if actual is true\nfunc BeTrue() types.GomegaMatcher {\n\treturn &matchers.BeTrueMatcher{}\n}\n\n//BeFalse succeeds if actual is false\nfunc BeFalse() types.GomegaMatcher {\n\treturn &matchers.BeFalseMatcher{}\n}\n\n//HaveOccurred succeeds if actual is a non-nil error\n//The typical Go error checking pattern looks like:\n// err := SomethingThatMightFail()\n// Expect(err).ShouldNot(HaveOccurred())\nfunc HaveOccurred() types.GomegaMatcher {\n\treturn &matchers.HaveOccurredMatcher{}\n}\n\n//Succeed passes if actual is a nil error\n//Succeed is intended to be used with functions that return a single error value. Instead of\n// err := SomethingThatMightFail()\n// Expect(err).ShouldNot(HaveOccurred())\n//\n//You can write:\n// Expect(SomethingThatMightFail()).Should(Succeed())\n//\n//It is a mistake to use Succeed with a function that has multiple return values. Gomega's Ω and Expect\n//functions automatically trigger failure if any return values after the first return value are non-zero/non-nil.\n//This means that Ω(MultiReturnFunc()).ShouldNot(Succeed()) can never pass.\nfunc Succeed() types.GomegaMatcher {\n\treturn &matchers.SucceedMatcher{}\n}\n\n//MatchError succeeds if actual is a non-nil error that matches the passed in string/error.\n//\n//These are valid use-cases:\n// Expect(err).Should(MatchError(\"an error\")) //asserts that err.Error() == \"an error\"\n// Expect(err).Should(MatchError(SomeError)) //asserts that err == SomeError (via reflect.DeepEqual)\n//\n//It is an error for err to be nil or an object that does not implement the Error interface\nfunc MatchError(expected interface{}) types.GomegaMatcher {\n\treturn &matchers.MatchErrorMatcher{\n\t\tExpected: expected,\n\t}\n}\n\n//BeClosed succeeds if actual is a closed channel.\n//It is an error to pass a non-channel to BeClosed, it is also an error to pass nil\n//\n//In order to check whether or not the channel is closed, Gomega must try to read from the channel\n//(even in the `ShouldNot(BeClosed())` case). You should keep this in mind if you wish to make subsequent assertions about\n//values coming down the channel.\n//\n//Also, if you are testing that a *buffered* channel is closed you must first read all values out of the channel before\n//asserting that it is closed (it is not possible to detect that a buffered-channel has been closed until all its buffered values are read).\n//\n//Finally, as a corollary: it is an error to check whether or not a send-only channel is closed.\nfunc BeClosed() types.GomegaMatcher {\n\treturn &matchers.BeClosedMatcher{}\n}\n\n//Receive succeeds if there is a value to be received on actual.\n//Actual must be a channel (and cannot be a send-only channel) -- anything else is an error.\n//\n//Receive returns immediately and never blocks:\n//\n//- If there is nothing on the channel `c` then Expect(c).Should(Receive()) will fail and Ω(c).ShouldNot(Receive()) will pass.\n//\n//- If the channel `c` is closed then Expect(c).Should(Receive()) will fail and Ω(c).ShouldNot(Receive()) will pass.\n//\n//- If there is something on the channel `c` ready to be read, then Expect(c).Should(Receive()) will pass and Ω(c).ShouldNot(Receive()) will fail.\n//\n//If you have a go-routine running in the background that will write to channel `c` you can:\n// Eventually(c).Should(Receive())\n//\n//This will timeout if nothing gets sent to `c` (you can modify the timeout interval as you normally do with `Eventually`)\n//\n//A similar use-case is to assert that no go-routine writes to a channel (for a period of time). You can do this with `Consistently`:\n// Consistently(c).ShouldNot(Receive())\n//\n//You can pass `Receive` a matcher. If you do so, it will match the received object against the matcher. For example:\n// Expect(c).Should(Receive(Equal(\"foo\")))\n//\n//When given a matcher, `Receive` will always fail if there is nothing to be received on the channel.\n//\n//Passing Receive a matcher is especially useful when paired with Eventually:\n//\n// Eventually(c).Should(Receive(ContainSubstring(\"bar\")))\n//\n//will repeatedly attempt to pull values out of `c` until a value matching \"bar\" is received.\n//\n//Finally, if you want to have a reference to the value *sent* to the channel you can pass the `Receive` matcher a pointer to a variable of the appropriate type:\n// var myThing thing\n// Eventually(thingChan).Should(Receive(&myThing))\n// Expect(myThing.Sprocket).Should(Equal(\"foo\"))\n// Expect(myThing.IsValid()).Should(BeTrue())\nfunc Receive(args ...interface{}) types.GomegaMatcher {\n\tvar arg interface{}\n\tif len(args) > 0 {\n\t\targ = args[0]\n\t}\n\n\treturn &matchers.ReceiveMatcher{\n\t\tArg: arg,\n\t}\n}\n\n//BeSent succeeds if a value can be sent to actual.\n//Actual must be a channel (and cannot be a receive-only channel) that can sent the type of the value passed into BeSent -- anything else is an error.\n//In addition, actual must not be closed.\n//\n//BeSent never blocks:\n//\n//- If the channel `c` is not ready to receive then Expect(c).Should(BeSent(\"foo\")) will fail immediately\n//- If the channel `c` is eventually ready to receive then Eventually(c).Should(BeSent(\"foo\")) will succeed.. presuming the channel becomes ready to receive before Eventually's timeout\n//- If the channel `c` is closed then Expect(c).Should(BeSent(\"foo\")) and Ω(c).ShouldNot(BeSent(\"foo\")) will both fail immediately\n//\n//Of course, the value is actually sent to the channel. The point of `BeSent` is less to make an assertion about the availability of the channel (which is typically an implementation detail that your test should not be concerned with).\n//Rather, the point of `BeSent` is to make it possible to easily and expressively write tests that can timeout on blocked channel sends.\nfunc BeSent(arg interface{}) types.GomegaMatcher {\n\treturn &matchers.BeSentMatcher{\n\t\tArg: arg,\n\t}\n}\n\n//MatchRegexp succeeds if actual is a string or stringer that matches the\n//passed-in regexp. Optional arguments can be provided to construct a regexp\n//via fmt.Sprintf().\nfunc MatchRegexp(regexp string, args ...interface{}) types.GomegaMatcher {\n\treturn &matchers.MatchRegexpMatcher{\n\t\tRegexp: regexp,\n\t\tArgs: args,\n\t}\n}\n\n//ContainSubstring succeeds if actual is a string or stringer that contains the\n//passed-in substring. Optional arguments can be provided to construct the substring\n//via fmt.Sprintf().\nfunc ContainSubstring(substr string, args ...interface{}) types.GomegaMatcher {\n\treturn &matchers.ContainSubstringMatcher{\n\t\tSubstr: substr,\n\t\tArgs: args,\n\t}\n}\n\n//HavePrefix succeeds if actual is a string or stringer that contains the\n//passed-in string as a prefix. Optional arguments can be provided to construct\n//via fmt.Sprintf().\nfunc HavePrefix(prefix string, args ...interface{}) types.GomegaMatcher {\n\treturn &matchers.HavePrefixMatcher{\n\t\tPrefix: prefix,\n\t\tArgs: args,\n\t}\n}\n\n//HaveSuffix succeeds if actual is a string or stringer that contains the\n//passed-in string as a suffix. Optional arguments can be provided to construct\n//via fmt.Sprintf().\nfunc HaveSuffix(suffix string, args ...interface{}) types.GomegaMatcher {\n\treturn &matchers.HaveSuffixMatcher{\n\t\tSuffix: suffix,\n\t\tArgs: args,\n\t}\n}\n\n//MatchJSON succeeds if actual is a string or stringer of JSON that matches\n//the expected JSON. The JSONs are decoded and the resulting objects are compared via\n//reflect.DeepEqual so things like key-ordering and whitespace shouldn't matter.\nfunc MatchJSON(json interface{}) types.GomegaMatcher {\n\treturn &matchers.MatchJSONMatcher{\n\t\tJSONToMatch: json,\n\t}\n}\n\n//MatchXML succeeds if actual is a string or stringer of XML that matches\n//the expected XML. The XMLs are decoded and the resulting objects are compared via\n//reflect.DeepEqual so things like whitespaces shouldn't matter.\nfunc MatchXML(xml interface{}) types.GomegaMatcher {\n\treturn &matchers.MatchXMLMatcher{\n\t\tXMLToMatch: xml,\n\t}\n}\n\n//MatchYAML succeeds if actual is a string or stringer of YAML that matches\n//the expected YAML. The YAML's are decoded and the resulting objects are compared via\n//reflect.DeepEqual so things like key-ordering and whitespace shouldn't matter.\nfunc MatchYAML(yaml interface{}) types.GomegaMatcher {\n\treturn &matchers.MatchYAMLMatcher{\n\t\tYAMLToMatch: yaml,\n\t}\n}\n\n//BeEmpty succeeds if actual is empty. Actual must be of type string, array, map, chan, or slice.\nfunc BeEmpty() types.GomegaMatcher {\n\treturn &matchers.BeEmptyMatcher{}\n}\n\n//HaveLen succeeds if actual has the passed-in length. Actual must be of type string, array, map, chan, or slice.\nfunc HaveLen(count int) types.GomegaMatcher {\n\treturn &matchers.HaveLenMatcher{\n\t\tCount: count,\n\t}\n}\n\n//HaveCap succeeds if actual has the passed-in capacity. Actual must be of type array, chan, or slice.\nfunc HaveCap(count int) types.GomegaMatcher {\n\treturn &matchers.HaveCapMatcher{\n\t\tCount: count,\n\t}\n}\n\n//BeZero succeeds if actual is the zero value for its type or if actual is nil.\nfunc BeZero() types.GomegaMatcher {\n\treturn &matchers.BeZeroMatcher{}\n}\n\n//ContainElement succeeds if actual contains the passed in element.\n//By default ContainElement() uses Equal() to perform the match, however a\n//matcher can be passed in instead:\n// Expect([]string{\"Foo\", \"FooBar\"}).Should(ContainElement(ContainSubstring(\"Bar\")))\n//\n//Actual must be an array, slice or map.\n//For maps, ContainElement searches through the map's values.\nfunc ContainElement(element interface{}) types.GomegaMatcher {\n\treturn &matchers.ContainElementMatcher{\n\t\tElement: element,\n\t}\n}\n\n//BeElementOf succeeds if actual is contained in the passed in elements.\n//BeElementOf() always uses Equal() to perform the match.\n//When the passed in elements are comprised of a single element that is either an Array or Slice, BeElementOf() behaves\n//as the reverse of ContainElement() that operates with Equal() to perform the match.\n// Expect(2).Should(BeElementOf([]int{1, 2}))\n// Expect(2).Should(BeElementOf([2]int{1, 2}))\n//Otherwise, BeElementOf() provides a syntactic sugar for Or(Equal(_), Equal(_), ...):\n// Expect(2).Should(BeElementOf(1, 2))\n//\n//Actual must be typed.\nfunc BeElementOf(elements ...interface{}) types.GomegaMatcher {\n\treturn &matchers.BeElementOfMatcher{\n\t\tElements: elements,\n\t}\n}\n\n//ConsistOf succeeds if actual contains precisely the elements passed into the matcher. The ordering of the elements does not matter.\n//By default ConsistOf() uses Equal() to match the elements, however custom matchers can be passed in instead. Here are some examples:\n//\n// Expect([]string{\"Foo\", \"FooBar\"}).Should(ConsistOf(\"FooBar\", \"Foo\"))\n// Expect([]string{\"Foo\", \"FooBar\"}).Should(ConsistOf(ContainSubstring(\"Bar\"), \"Foo\"))\n// Expect([]string{\"Foo\", \"FooBar\"}).Should(ConsistOf(ContainSubstring(\"Foo\"), ContainSubstring(\"Foo\")))\n//\n//Actual must be an array, slice or map. For maps, ConsistOf matches against the map's values.\n//\n//You typically pass variadic arguments to ConsistOf (as in the examples above). However, if you need to pass in a slice you can provided that it\n//is the only element passed in to ConsistOf:\n//\n// Expect([]string{\"Foo\", \"FooBar\"}).Should(ConsistOf([]string{\"FooBar\", \"Foo\"}))\n//\n//Note that Go's type system does not allow you to write this as ConsistOf([]string{\"FooBar\", \"Foo\"}...) as []string and []interface{} are different types - hence the need for this special rule.\nfunc ConsistOf(elements ...interface{}) types.GomegaMatcher {\n\treturn &matchers.ConsistOfMatcher{\n\t\tElements: elements,\n\t}\n}\n\n//ContainElements succeeds if actual contains the passed in elements. The ordering of the elements does not matter.\n//By default ContainElements() uses Equal() to match the elements, however custom matchers can be passed in instead. Here are some examples:\n//\n// Expect([]string{\"Foo\", \"FooBar\"}).Should(ContainElements(\"FooBar\"))\n// Expect([]string{\"Foo\", \"FooBar\"}).Should(ContainElements(ContainSubstring(\"Bar\"), \"Foo\"))\n//\n//Actual must be an array, slice or map.\n//For maps, ContainElements searches through the map's values.\nfunc ContainElements(elements ...interface{}) types.GomegaMatcher {\n\treturn &matchers.ContainElementsMatcher{\n\t\tElements: elements,\n\t}\n}\n\n//HaveKey succeeds if actual is a map with the passed in key.\n//By default HaveKey uses Equal() to perform the match, however a\n//matcher can be passed in instead:\n// Expect(map[string]string{\"Foo\": \"Bar\", \"BazFoo\": \"Duck\"}).Should(HaveKey(MatchRegexp(`.+Foo$`)))\nfunc HaveKey(key interface{}) types.GomegaMatcher {\n\treturn &matchers.HaveKeyMatcher{\n\t\tKey: key,\n\t}\n}\n\n//HaveKeyWithValue succeeds if actual is a map with the passed in key and value.\n//By default HaveKeyWithValue uses Equal() to perform the match, however a\n//matcher can be passed in instead:\n// Expect(map[string]string{\"Foo\": \"Bar\", \"BazFoo\": \"Duck\"}).Should(HaveKeyWithValue(\"Foo\", \"Bar\"))\n// Expect(map[string]string{\"Foo\": \"Bar\", \"BazFoo\": \"Duck\"}).Should(HaveKeyWithValue(MatchRegexp(`.+Foo$`), \"Bar\"))\nfunc HaveKeyWithValue(key interface{}, value interface{}) types.GomegaMatcher {\n\treturn &matchers.HaveKeyWithValueMatcher{\n\t\tKey: key,\n\t\tValue: value,\n\t}\n}\n\n//HaveField succeeds if actual is a struct and the value at the passed in field\n//matches the passed in matcher. By default HaveField used Equal() to perform the match,\n//however a matcher can be passed in in stead.\n//\n//The field must be a string that resolves to the name of a field in the struct. Structs can be traversed\n//using the '.' delimiter. If the field ends with '()' a method named field is assumed to exist on the struct and is invoked.\n//Such methods must take no arguments and return a single value:\n//\n// type Book struct {\n// Title string\n// Author Person\n// }\n// type Person struct {\n// FirstName string\n// LastName string\n//\t\t DOB time.Time\n// }\n// Expect(book).To(HaveField(\"Title\", \"Les Miserables\"))\n// Expect(book).To(HaveField(\"Title\", ContainSubstring(\"Les\"))\n// Expect(book).To(HaveField(\"Person.FirstName\", Equal(\"Victor\"))\n// Expect(book).To(HaveField(\"Person.DOB.Year()\", BeNumerically(\"<\", 1900))\nfunc HaveField(field string, expected interface{}) types.GomegaMatcher {\n\treturn &matchers.HaveFieldMatcher{\n\t\tField: field,\n\t\tExpected: expected,\n\t}\n}\n\n//BeNumerically performs numerical assertions in a type-agnostic way.\n//Actual and expected should be numbers, though the specific type of\n//number is irrelevant (float32, float64, uint8, etc...).\n//\n//There are six, self-explanatory, supported comparators:\n// Expect(1.0).Should(BeNumerically(\"==\", 1))\n// Expect(1.0).Should(BeNumerically(\"~\", 0.999, 0.01))\n// Expect(1.0).Should(BeNumerically(\">\", 0.9))\n// Expect(1.0).Should(BeNumerically(\">=\", 1.0))\n// Expect(1.0).Should(BeNumerically(\"<\", 3))\n// Expect(1.0).Should(BeNumerically(\"<=\", 1.0))\nfunc BeNumerically(comparator string, compareTo ...interface{}) types.GomegaMatcher {\n\treturn &matchers.BeNumericallyMatcher{\n\t\tComparator: comparator,\n\t\tCompareTo: compareTo,\n\t}\n}\n\n//BeTemporally compares time.Time's like BeNumerically\n//Actual and expected must be time.Time. The comparators are the same as for BeNumerically\n// Expect(time.Now()).Should(BeTemporally(\">\", time.Time{}))\n// Expect(time.Now()).Should(BeTemporally(\"~\", time.Now(), time.Second))\nfunc BeTemporally(comparator string, compareTo time.Time, threshold ...time.Duration) types.GomegaMatcher {\n\treturn &matchers.BeTemporallyMatcher{\n\t\tComparator: comparator,\n\t\tCompareTo: compareTo,\n\t\tThreshold: threshold,\n\t}\n}\n\n//BeAssignableToTypeOf succeeds if actual is assignable to the type of expected.\n//It will return an error when one of the values is nil.\n// Expect(0).Should(BeAssignableToTypeOf(0)) // Same values\n// Expect(5).Should(BeAssignableToTypeOf(-1)) // different values same type\n// Expect(\"foo\").Should(BeAssignableToTypeOf(\"bar\")) // different values same type\n// Expect(struct{ Foo string }{}).Should(BeAssignableToTypeOf(struct{ Foo string }{}))\nfunc BeAssignableToTypeOf(expected interface{}) types.GomegaMatcher {\n\treturn &matchers.AssignableToTypeOfMatcher{\n\t\tExpected: expected,\n\t}\n}\n\n//Panic succeeds if actual is a function that, when invoked, panics.\n//Actual must be a function that takes no arguments and returns no results.\nfunc Panic() types.GomegaMatcher {\n\treturn &matchers.PanicMatcher{}\n}\n\n//PanicWith succeeds if actual is a function that, when invoked, panics with a specific value.\n//Actual must be a function that takes no arguments and returns no results.\n//\n//By default PanicWith uses Equal() to perform the match, however a\n//matcher can be passed in instead:\n// Expect(fn).Should(PanicWith(MatchRegexp(`.+Foo$`)))\nfunc PanicWith(expected interface{}) types.GomegaMatcher {\n\treturn &matchers.PanicMatcher{Expected: expected}\n}\n\n//BeAnExistingFile succeeds if a file exists.\n//Actual must be a string representing the abs path to the file being checked.\nfunc BeAnExistingFile() types.GomegaMatcher {\n\treturn &matchers.BeAnExistingFileMatcher{}\n}\n\n//BeARegularFile succeeds if a file exists and is a regular file.\n//Actual must be a string representing the abs path to the file being checked.\nfunc BeARegularFile() types.GomegaMatcher {\n\treturn &matchers.BeARegularFileMatcher{}\n}\n\n//BeADirectory succeeds if a file exists and is a directory.\n//Actual must be a string representing the abs path to the file being checked.\nfunc BeADirectory() types.GomegaMatcher {\n\treturn &matchers.BeADirectoryMatcher{}\n}\n\n//HaveHTTPStatus succeeds if the Status or StatusCode field of an HTTP response matches.\n//Actual must be either a *http.Response or *httptest.ResponseRecorder.\n//Expected must be either an int or a string.\n// Expect(resp).Should(HaveHTTPStatus(http.StatusOK)) // asserts that resp.StatusCode == 200\n// Expect(resp).Should(HaveHTTPStatus(\"404 Not Found\")) // asserts that resp.Status == \"404 Not Found\"\n// Expect(resp).Should(HaveHTTPStatus(http.StatusOK, http.StatusNoContent)) // asserts that resp.StatusCode == 200 || resp.StatusCode == 204\nfunc HaveHTTPStatus(expected ...interface{}) types.GomegaMatcher {\n\treturn &matchers.HaveHTTPStatusMatcher{Expected: expected}\n}\n\n// HaveHTTPHeaderWithValue succeeds if the header is found and the value matches.\n// Actual must be either a *http.Response or *httptest.ResponseRecorder.\n// Expected must be a string header name, followed by a header value which\n// can be a string, or another matcher.\nfunc HaveHTTPHeaderWithValue(header string, value interface{}) types.GomegaMatcher {\n\treturn &matchers.HaveHTTPHeaderWithValueMatcher{\n\t\tHeader: header,\n\t\tValue: value,\n\t}\n}\n\n// HaveHTTPBody matches if the body matches.\n// Actual must be either a *http.Response or *httptest.ResponseRecorder.\n// Expected must be either a string, []byte, or other matcher\nfunc HaveHTTPBody(expected interface{}) types.GomegaMatcher {\n\treturn &matchers.HaveHTTPBodyMatcher{Expected: expected}\n}\n\n//And succeeds only if all of the given matchers succeed.\n//The matchers are tried in order, and will fail-fast if one doesn't succeed.\n// Expect(\"hi\").To(And(HaveLen(2), Equal(\"hi\"))\n//\n//And(), Or(), Not() and WithTransform() allow matchers to be composed into complex expressions.\nfunc And(ms ...types.GomegaMatcher) types.GomegaMatcher {\n\treturn &matchers.AndMatcher{Matchers: ms}\n}\n\n//SatisfyAll is an alias for And().\n// Expect(\"hi\").Should(SatisfyAll(HaveLen(2), Equal(\"hi\")))\nfunc SatisfyAll(matchers ...types.GomegaMatcher) types.GomegaMatcher {\n\treturn And(matchers...)\n}\n\n//Or succeeds if any of the given matchers succeed.\n//The matchers are tried in order and will return immediately upon the first successful match.\n// Expect(\"hi\").To(Or(HaveLen(3), HaveLen(2))\n//\n//And(), Or(), Not() and WithTransform() allow matchers to be composed into complex expressions.\nfunc Or(ms ...types.GomegaMatcher) types.GomegaMatcher {\n\treturn &matchers.OrMatcher{Matchers: ms}\n}\n\n//SatisfyAny is an alias for Or().\n// Expect(\"hi\").SatisfyAny(Or(HaveLen(3), HaveLen(2))\nfunc SatisfyAny(matchers ...types.GomegaMatcher) types.GomegaMatcher {\n\treturn Or(matchers...)\n}\n\n//Not negates the given matcher; it succeeds if the given matcher fails.\n// Expect(1).To(Not(Equal(2))\n//\n//And(), Or(), Not() and WithTransform() allow matchers to be composed into complex expressions.\nfunc Not(matcher types.GomegaMatcher) types.GomegaMatcher {\n\treturn &matchers.NotMatcher{Matcher: matcher}\n}\n\n//WithTransform applies the `transform` to the actual value and matches it against `matcher`.\n//The given transform must be either a function of one parameter that returns one value or a\n// function of one parameter that returns two values, where the second value must be of the\n// error type.\n// var plus1 = func(i int) int { return i + 1 }\n// Expect(1).To(WithTransform(plus1, Equal(2))\n//\n// var failingplus1 = func(i int) (int, error) { return 42, \"this does not compute\" }\n// Expect(1).To(WithTransform(failingplus1, Equal(2)))\n//\n//And(), Or(), Not() and WithTransform() allow matchers to be composed into complex expressions.\nfunc WithTransform(transform interface{}, matcher types.GomegaMatcher) types.GomegaMatcher {\n\treturn matchers.NewWithTransformMatcher(transform, matcher)\n}\n\n//Satisfy matches the actual value against the `predicate` function.\n//The given predicate must be a function of one paramter that returns bool.\n// var isEven = func(i int) bool { return i%2 == 0 }\n// Expect(2).To(Satisfy(isEven))\nfunc Satisfy(predicate interface{}) types.GomegaMatcher {\n\treturn matchers.NewSatisfyMatcher(predicate)\n}\n" }, { "path": "vendor/github.com/onsi/gomega/types/types.go", "content": "package types\n\nimport (\n\t\"time\"\n)\n\ntype GomegaFailHandler func(message string, callerSkip ...int)\n\n//A simple *testing.T interface wrapper\ntype GomegaTestingT interface {\n\tHelper()\n\tFatalf(format string, args ...interface{})\n}\n\n// Gomega represents an object that can perform synchronous and assynchronous assertions with Gomega matchers\ntype Gomega interface {\n\tΩ(actual interface{}, extra ...interface{}) Assertion\n\tExpect(actual interface{}, extra ...interface{}) Assertion\n\tExpectWithOffset(offset int, actual interface{}, extra ...interface{}) Assertion\n\n\tEventually(actual interface{}, intervals ...interface{}) AsyncAssertion\n\tEventuallyWithOffset(offset int, actual interface{}, intervals ...interface{}) AsyncAssertion\n\n\tConsistently(actual interface{}, intervals ...interface{}) AsyncAssertion\n\tConsistentlyWithOffset(offset int, actual interface{}, intervals ...interface{}) AsyncAssertion\n\n\tSetDefaultEventuallyTimeout(time.Duration)\n\tSetDefaultEventuallyPollingInterval(time.Duration)\n\tSetDefaultConsistentlyDuration(time.Duration)\n\tSetDefaultConsistentlyPollingInterval(time.Duration)\n}\n\n//All Gomega matchers must implement the GomegaMatcher interface\n//\n//For details on writing custom matchers, check out: http://onsi.github.io/gomega/#adding-your-own-matchers\ntype GomegaMatcher interface {\n\tMatch(actual interface{}) (success bool, err error)\n\tFailureMessage(actual interface{}) (message string)\n\tNegatedFailureMessage(actual interface{}) (message string)\n}\n\n/*\nGomegaMatchers that also match the OracleMatcher interface can convey information about\nwhether or not their result will change upon future attempts.\n\nThis allows `Eventually` and `Consistently` to short circuit if success becomes impossible.\n\nFor example, a process' exit code can never change. So, gexec's Exit matcher returns `true`\nfor `MatchMayChangeInTheFuture` until the process exits, at which point it returns `false` forevermore.\n*/\ntype OracleMatcher interface {\n\tMatchMayChangeInTheFuture(actual interface{}) bool\n}\n\nfunc MatchMayChangeInTheFuture(matcher GomegaMatcher, value interface{}) bool {\n\toracleMatcher, ok := matcher.(OracleMatcher)\n\tif !ok {\n\t\treturn true\n\t}\n\n\treturn oracleMatcher.MatchMayChangeInTheFuture(value)\n}\n\n// AsyncAssertions are returned by Eventually and Consistently and enable matchers to be polled repeatedly to ensure\n// they are eventually satisfied\ntype AsyncAssertion interface {\n\tShould(matcher GomegaMatcher, optionalDescription ...interface{}) bool\n\tShouldNot(matcher GomegaMatcher, optionalDescription ...interface{}) bool\n\n\tWithOffset(offset int) AsyncAssertion\n\tWithTimeout(interval time.Duration) AsyncAssertion\n\tWithPolling(interval time.Duration) AsyncAssertion\n}\n\n// Assertions are returned by Ω and Expect and enable assertions against Gomega matchers\ntype Assertion interface {\n\tShould(matcher GomegaMatcher, optionalDescription ...interface{}) bool\n\tShouldNot(matcher GomegaMatcher, optionalDescription ...interface{}) bool\n\n\tTo(matcher GomegaMatcher, optionalDescription ...interface{}) bool\n\tToNot(matcher GomegaMatcher, optionalDescription ...interface{}) bool\n\tNotTo(matcher GomegaMatcher, optionalDescription ...interface{}) bool\n\n\tWithOffset(offset int) Assertion\n\n\tError() Assertion\n}\n" }, { "path": "vendor/github.com/pkg/errors/.gitignore", "content": "# Compiled Object files, Static and Dynamic libs (Shared Objects)\n*.o\n*.a\n*.so\n\n# Folders\n_obj\n_test\n\n# Architecture specific extensions/prefixes\n*.[568vq]\n[568vq].out\n\n*.cgo1.go\n*.cgo2.c\n_cgo_defun.c\n_cgo_gotypes.go\n_cgo_export.*\n\n_testmain.go\n\n*.exe\n*.test\n*.prof\n" }, { "path": "vendor/github.com/pkg/errors/.travis.yml", "content": "language: go\ngo_import_path: github.com/pkg/errors\ngo:\n - 1.11.x\n - 1.12.x\n - 1.13.x\n - tip\n\nscript:\n - make check\n" }, { "path": "vendor/github.com/pkg/errors/LICENSE", "content": "Copyright (c) 2015, Dave Cheney \nAll rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are met:\n\n* Redistributions of source code must retain the above copyright notice, this\n list of conditions and the following disclaimer.\n\n* Redistributions in binary form must reproduce the above copyright notice,\n this list of conditions and the following disclaimer in the documentation\n and/or other materials provided with the distribution.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\"\nAND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\nIMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\nDISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\nFOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\nDAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\nSERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\nCAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\nOR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n" }, { "path": "vendor/github.com/pkg/errors/Makefile", "content": "PKGS := github.com/pkg/errors\nSRCDIRS := $(shell go list -f '{{.Dir}}' $(PKGS))\nGO := go\n\ncheck: test vet gofmt misspell unconvert staticcheck ineffassign unparam\n\ntest: \n\t$(GO) test $(PKGS)\n\nvet: | test\n\t$(GO) vet $(PKGS)\n\nstaticcheck:\n\t$(GO) get honnef.co/go/tools/cmd/staticcheck\n\tstaticcheck -checks all $(PKGS)\n\nmisspell:\n\t$(GO) get github.com/client9/misspell/cmd/misspell\n\tmisspell \\\n\t\t-locale GB \\\n\t\t-error \\\n\t\t*.md *.go\n\nunconvert:\n\t$(GO) get github.com/mdempsky/unconvert\n\tunconvert -v $(PKGS)\n\nineffassign:\n\t$(GO) get github.com/gordonklaus/ineffassign\n\tfind $(SRCDIRS) -name '*.go' | xargs ineffassign\n\npedantic: check errcheck\n\nunparam:\n\t$(GO) get mvdan.cc/unparam\n\tunparam ./...\n\nerrcheck:\n\t$(GO) get github.com/kisielk/errcheck\n\terrcheck $(PKGS)\n\ngofmt: \n\t@echo Checking code is gofmted\n\t@test -z \"$(shell gofmt -s -l -d -e $(SRCDIRS) | tee /dev/stderr)\"\n" }, { "path": "vendor/github.com/pkg/errors/README.md", "content": "# errors [![Travis-CI](https://travis-ci.org/pkg/errors.svg)](https://travis-ci.org/pkg/errors) [![AppVeyor](https://ci.appveyor.com/api/projects/status/b98mptawhudj53ep/branch/master?svg=true)](https://ci.appveyor.com/project/davecheney/errors/branch/master) [![GoDoc](https://godoc.org/github.com/pkg/errors?status.svg)](http://godoc.org/github.com/pkg/errors) [![Report card](https://goreportcard.com/badge/github.com/pkg/errors)](https://goreportcard.com/report/github.com/pkg/errors) [![Sourcegraph](https://sourcegraph.com/github.com/pkg/errors/-/badge.svg)](https://sourcegraph.com/github.com/pkg/errors?badge)\n\nPackage errors provides simple error handling primitives.\n\n`go get github.com/pkg/errors`\n\nThe traditional error handling idiom in Go is roughly akin to\n```go\nif err != nil {\n return err\n}\n```\nwhich applied recursively up the call stack results in error reports without context or debugging information. The errors package allows programmers to add context to the failure path in their code in a way that does not destroy the original value of the error.\n\n## Adding context to an error\n\nThe errors.Wrap function returns a new error that adds context to the original error. For example\n```go\n_, err := ioutil.ReadAll(r)\nif err != nil {\n return errors.Wrap(err, \"read failed\")\n}\n```\n## Retrieving the cause of an error\n\nUsing `errors.Wrap` constructs a stack of errors, adding context to the preceding error. Depending on the nature of the error it may be necessary to reverse the operation of errors.Wrap to retrieve the original error for inspection. Any error value which implements this interface can be inspected by `errors.Cause`.\n```go\ntype causer interface {\n Cause() error\n}\n```\n`errors.Cause` will recursively retrieve the topmost error which does not implement `causer`, which is assumed to be the original cause. For example:\n```go\nswitch err := errors.Cause(err).(type) {\ncase *MyError:\n // handle specifically\ndefault:\n // unknown error\n}\n```\n\n[Read the package documentation for more information](https://godoc.org/github.com/pkg/errors).\n\n## Roadmap\n\nWith the upcoming [Go2 error proposals](https://go.googlesource.com/proposal/+/master/design/go2draft.md) this package is moving into maintenance mode. The roadmap for a 1.0 release is as follows:\n\n- 0.9. Remove pre Go 1.9 and Go 1.10 support, address outstanding pull requests (if possible)\n- 1.0. Final release.\n\n## Contributing\n\nBecause of the Go2 errors changes, this package is not accepting proposals for new functionality. With that said, we welcome pull requests, bug fixes and issue reports. \n\nBefore sending a PR, please discuss your change by raising an issue.\n\n## License\n\nBSD-2-Clause\n" }, { "path": "vendor/github.com/pkg/errors/appveyor.yml", "content": "version: build-{build}.{branch}\n\nclone_folder: C:\\gopath\\src\\github.com\\pkg\\errors\nshallow_clone: true # for startup speed\n\nenvironment:\n GOPATH: C:\\gopath\n\nplatform:\n - x64\n\n# http://www.appveyor.com/docs/installed-software\ninstall:\n # some helpful output for debugging builds\n - go version\n - go env\n # pre-installed MinGW at C:\\MinGW is 32bit only\n # but MSYS2 at C:\\msys64 has mingw64\n - set PATH=C:\\msys64\\mingw64\\bin;%PATH%\n - gcc --version\n - g++ --version\n\nbuild_script:\n - go install -v ./...\n\ntest_script:\n - set PATH=C:\\gopath\\bin;%PATH%\n - go test -v ./...\n\n#artifacts:\n# - path: '%GOPATH%\\bin\\*.exe'\ndeploy: off\n" }, { "path": "vendor/github.com/pkg/errors/errors.go", "content": "// Package errors provides simple error handling primitives.\n//\n// The traditional error handling idiom in Go is roughly akin to\n//\n// if err != nil {\n// return err\n// }\n//\n// which when applied recursively up the call stack results in error reports\n// without context or debugging information. The errors package allows\n// programmers to add context to the failure path in their code in a way\n// that does not destroy the original value of the error.\n//\n// Adding context to an error\n//\n// The errors.Wrap function returns a new error that adds context to the\n// original error by recording a stack trace at the point Wrap is called,\n// together with the supplied message. For example\n//\n// _, err := ioutil.ReadAll(r)\n// if err != nil {\n// return errors.Wrap(err, \"read failed\")\n// }\n//\n// If additional control is required, the errors.WithStack and\n// errors.WithMessage functions destructure errors.Wrap into its component\n// operations: annotating an error with a stack trace and with a message,\n// respectively.\n//\n// Retrieving the cause of an error\n//\n// Using errors.Wrap constructs a stack of errors, adding context to the\n// preceding error. Depending on the nature of the error it may be necessary\n// to reverse the operation of errors.Wrap to retrieve the original error\n// for inspection. Any error value which implements this interface\n//\n// type causer interface {\n// Cause() error\n// }\n//\n// can be inspected by errors.Cause. errors.Cause will recursively retrieve\n// the topmost error that does not implement causer, which is assumed to be\n// the original cause. For example:\n//\n// switch err := errors.Cause(err).(type) {\n// case *MyError:\n// // handle specifically\n// default:\n// // unknown error\n// }\n//\n// Although the causer interface is not exported by this package, it is\n// considered a part of its stable public interface.\n//\n// Formatted printing of errors\n//\n// All error values returned from this package implement fmt.Formatter and can\n// be formatted by the fmt package. The following verbs are supported:\n//\n// %s print the error. If the error has a Cause it will be\n// printed recursively.\n// %v see %s\n// %+v extended format. Each Frame of the error's StackTrace will\n// be printed in detail.\n//\n// Retrieving the stack trace of an error or wrapper\n//\n// New, Errorf, Wrap, and Wrapf record a stack trace at the point they are\n// invoked. This information can be retrieved with the following interface:\n//\n// type stackTracer interface {\n// StackTrace() errors.StackTrace\n// }\n//\n// The returned errors.StackTrace type is defined as\n//\n// type StackTrace []Frame\n//\n// The Frame type represents a call site in the stack trace. Frame supports\n// the fmt.Formatter interface that can be used for printing information about\n// the stack trace of this error. For example:\n//\n// if err, ok := err.(stackTracer); ok {\n// for _, f := range err.StackTrace() {\n// fmt.Printf(\"%+s:%d\\n\", f, f)\n// }\n// }\n//\n// Although the stackTracer interface is not exported by this package, it is\n// considered a part of its stable public interface.\n//\n// See the documentation for Frame.Format for more details.\npackage errors\n\nimport (\n\t\"fmt\"\n\t\"io\"\n)\n\n// New returns an error with the supplied message.\n// New also records the stack trace at the point it was called.\nfunc New(message string) error {\n\treturn &fundamental{\n\t\tmsg: message,\n\t\tstack: callers(),\n\t}\n}\n\n// Errorf formats according to a format specifier and returns the string\n// as a value that satisfies error.\n// Errorf also records the stack trace at the point it was called.\nfunc Errorf(format string, args ...interface{}) error {\n\treturn &fundamental{\n\t\tmsg: fmt.Sprintf(format, args...),\n\t\tstack: callers(),\n\t}\n}\n\n// fundamental is an error that has a message and a stack, but no caller.\ntype fundamental struct {\n\tmsg string\n\t*stack\n}\n\nfunc (f *fundamental) Error() string { return f.msg }\n\nfunc (f *fundamental) Format(s fmt.State, verb rune) {\n\tswitch verb {\n\tcase 'v':\n\t\tif s.Flag('+') {\n\t\t\tio.WriteString(s, f.msg)\n\t\t\tf.stack.Format(s, verb)\n\t\t\treturn\n\t\t}\n\t\tfallthrough\n\tcase 's':\n\t\tio.WriteString(s, f.msg)\n\tcase 'q':\n\t\tfmt.Fprintf(s, \"%q\", f.msg)\n\t}\n}\n\n// WithStack annotates err with a stack trace at the point WithStack was called.\n// If err is nil, WithStack returns nil.\nfunc WithStack(err error) error {\n\tif err == nil {\n\t\treturn nil\n\t}\n\treturn &withStack{\n\t\terr,\n\t\tcallers(),\n\t}\n}\n\ntype withStack struct {\n\terror\n\t*stack\n}\n\nfunc (w *withStack) Cause() error { return w.error }\n\n// Unwrap provides compatibility for Go 1.13 error chains.\nfunc (w *withStack) Unwrap() error { return w.error }\n\nfunc (w *withStack) Format(s fmt.State, verb rune) {\n\tswitch verb {\n\tcase 'v':\n\t\tif s.Flag('+') {\n\t\t\tfmt.Fprintf(s, \"%+v\", w.Cause())\n\t\t\tw.stack.Format(s, verb)\n\t\t\treturn\n\t\t}\n\t\tfallthrough\n\tcase 's':\n\t\tio.WriteString(s, w.Error())\n\tcase 'q':\n\t\tfmt.Fprintf(s, \"%q\", w.Error())\n\t}\n}\n\n// Wrap returns an error annotating err with a stack trace\n// at the point Wrap is called, and the supplied message.\n// If err is nil, Wrap returns nil.\nfunc Wrap(err error, message string) error {\n\tif err == nil {\n\t\treturn nil\n\t}\n\terr = &withMessage{\n\t\tcause: err,\n\t\tmsg: message,\n\t}\n\treturn &withStack{\n\t\terr,\n\t\tcallers(),\n\t}\n}\n\n// Wrapf returns an error annotating err with a stack trace\n// at the point Wrapf is called, and the format specifier.\n// If err is nil, Wrapf returns nil.\nfunc Wrapf(err error, format string, args ...interface{}) error {\n\tif err == nil {\n\t\treturn nil\n\t}\n\terr = &withMessage{\n\t\tcause: err,\n\t\tmsg: fmt.Sprintf(format, args...),\n\t}\n\treturn &withStack{\n\t\terr,\n\t\tcallers(),\n\t}\n}\n\n// WithMessage annotates err with a new message.\n// If err is nil, WithMessage returns nil.\nfunc WithMessage(err error, message string) error {\n\tif err == nil {\n\t\treturn nil\n\t}\n\treturn &withMessage{\n\t\tcause: err,\n\t\tmsg: message,\n\t}\n}\n\n// WithMessagef annotates err with the format specifier.\n// If err is nil, WithMessagef returns nil.\nfunc WithMessagef(err error, format string, args ...interface{}) error {\n\tif err == nil {\n\t\treturn nil\n\t}\n\treturn &withMessage{\n\t\tcause: err,\n\t\tmsg: fmt.Sprintf(format, args...),\n\t}\n}\n\ntype withMessage struct {\n\tcause error\n\tmsg string\n}\n\nfunc (w *withMessage) Error() string { return w.msg + \": \" + w.cause.Error() }\nfunc (w *withMessage) Cause() error { return w.cause }\n\n// Unwrap provides compatibility for Go 1.13 error chains.\nfunc (w *withMessage) Unwrap() error { return w.cause }\n\nfunc (w *withMessage) Format(s fmt.State, verb rune) {\n\tswitch verb {\n\tcase 'v':\n\t\tif s.Flag('+') {\n\t\t\tfmt.Fprintf(s, \"%+v\\n\", w.Cause())\n\t\t\tio.WriteString(s, w.msg)\n\t\t\treturn\n\t\t}\n\t\tfallthrough\n\tcase 's', 'q':\n\t\tio.WriteString(s, w.Error())\n\t}\n}\n\n// Cause returns the underlying cause of the error, if possible.\n// An error value has a cause if it implements the following\n// interface:\n//\n// type causer interface {\n// Cause() error\n// }\n//\n// If the error does not implement Cause, the original error will\n// be returned. If the error is nil, nil will be returned without further\n// investigation.\nfunc Cause(err error) error {\n\ttype causer interface {\n\t\tCause() error\n\t}\n\n\tfor err != nil {\n\t\tcause, ok := err.(causer)\n\t\tif !ok {\n\t\t\tbreak\n\t\t}\n\t\terr = cause.Cause()\n\t}\n\treturn err\n}\n" }, { "path": "vendor/github.com/pkg/errors/go113.go", "content": "// +build go1.13\n\npackage errors\n\nimport (\n\tstderrors \"errors\"\n)\n\n// Is reports whether any error in err's chain matches target.\n//\n// The chain consists of err itself followed by the sequence of errors obtained by\n// repeatedly calling Unwrap.\n//\n// An error is considered to match a target if it is equal to that target or if\n// it implements a method Is(error) bool such that Is(target) returns true.\nfunc Is(err, target error) bool { return stderrors.Is(err, target) }\n\n// As finds the first error in err's chain that matches target, and if so, sets\n// target to that error value and returns true.\n//\n// The chain consists of err itself followed by the sequence of errors obtained by\n// repeatedly calling Unwrap.\n//\n// An error matches target if the error's concrete value is assignable to the value\n// pointed to by target, or if the error has a method As(interface{}) bool such that\n// As(target) returns true. In the latter case, the As method is responsible for\n// setting target.\n//\n// As will panic if target is not a non-nil pointer to either a type that implements\n// error, or to any interface type. As returns false if err is nil.\nfunc As(err error, target interface{}) bool { return stderrors.As(err, target) }\n\n// Unwrap returns the result of calling the Unwrap method on err, if err's\n// type contains an Unwrap method returning error.\n// Otherwise, Unwrap returns nil.\nfunc Unwrap(err error) error {\n\treturn stderrors.Unwrap(err)\n}\n" }, { "path": "vendor/github.com/pkg/errors/stack.go", "content": "package errors\n\nimport (\n\t\"fmt\"\n\t\"io\"\n\t\"path\"\n\t\"runtime\"\n\t\"strconv\"\n\t\"strings\"\n)\n\n// Frame represents a program counter inside a stack frame.\n// For historical reasons if Frame is interpreted as a uintptr\n// its value represents the program counter + 1.\ntype Frame uintptr\n\n// pc returns the program counter for this frame;\n// multiple frames may have the same PC value.\nfunc (f Frame) pc() uintptr { return uintptr(f) - 1 }\n\n// file returns the full path to the file that contains the\n// function for this Frame's pc.\nfunc (f Frame) file() string {\n\tfn := runtime.FuncForPC(f.pc())\n\tif fn == nil {\n\t\treturn \"unknown\"\n\t}\n\tfile, _ := fn.FileLine(f.pc())\n\treturn file\n}\n\n// line returns the line number of source code of the\n// function for this Frame's pc.\nfunc (f Frame) line() int {\n\tfn := runtime.FuncForPC(f.pc())\n\tif fn == nil {\n\t\treturn 0\n\t}\n\t_, line := fn.FileLine(f.pc())\n\treturn line\n}\n\n// name returns the name of this function, if known.\nfunc (f Frame) name() string {\n\tfn := runtime.FuncForPC(f.pc())\n\tif fn == nil {\n\t\treturn \"unknown\"\n\t}\n\treturn fn.Name()\n}\n\n// Format formats the frame according to the fmt.Formatter interface.\n//\n// %s source file\n// %d source line\n// %n function name\n// %v equivalent to %s:%d\n//\n// Format accepts flags that alter the printing of some verbs, as follows:\n//\n// %+s function name and path of source file relative to the compile time\n// GOPATH separated by \\n\\t (\\n\\t)\n// %+v equivalent to %+s:%d\nfunc (f Frame) Format(s fmt.State, verb rune) {\n\tswitch verb {\n\tcase 's':\n\t\tswitch {\n\t\tcase s.Flag('+'):\n\t\t\tio.WriteString(s, f.name())\n\t\t\tio.WriteString(s, \"\\n\\t\")\n\t\t\tio.WriteString(s, f.file())\n\t\tdefault:\n\t\t\tio.WriteString(s, path.Base(f.file()))\n\t\t}\n\tcase 'd':\n\t\tio.WriteString(s, strconv.Itoa(f.line()))\n\tcase 'n':\n\t\tio.WriteString(s, funcname(f.name()))\n\tcase 'v':\n\t\tf.Format(s, 's')\n\t\tio.WriteString(s, \":\")\n\t\tf.Format(s, 'd')\n\t}\n}\n\n// MarshalText formats a stacktrace Frame as a text string. The output is the\n// same as that of fmt.Sprintf(\"%+v\", f), but without newlines or tabs.\nfunc (f Frame) MarshalText() ([]byte, error) {\n\tname := f.name()\n\tif name == \"unknown\" {\n\t\treturn []byte(name), nil\n\t}\n\treturn []byte(fmt.Sprintf(\"%s %s:%d\", name, f.file(), f.line())), nil\n}\n\n// StackTrace is stack of Frames from innermost (newest) to outermost (oldest).\ntype StackTrace []Frame\n\n// Format formats the stack of Frames according to the fmt.Formatter interface.\n//\n// %s\tlists source files for each Frame in the stack\n// %v\tlists the source file and line number for each Frame in the stack\n//\n// Format accepts flags that alter the printing of some verbs, as follows:\n//\n// %+v Prints filename, function, and line number for each Frame in the stack.\nfunc (st StackTrace) Format(s fmt.State, verb rune) {\n\tswitch verb {\n\tcase 'v':\n\t\tswitch {\n\t\tcase s.Flag('+'):\n\t\t\tfor _, f := range st {\n\t\t\t\tio.WriteString(s, \"\\n\")\n\t\t\t\tf.Format(s, verb)\n\t\t\t}\n\t\tcase s.Flag('#'):\n\t\t\tfmt.Fprintf(s, \"%#v\", []Frame(st))\n\t\tdefault:\n\t\t\tst.formatSlice(s, verb)\n\t\t}\n\tcase 's':\n\t\tst.formatSlice(s, verb)\n\t}\n}\n\n// formatSlice will format this StackTrace into the given buffer as a slice of\n// Frame, only valid when called with '%s' or '%v'.\nfunc (st StackTrace) formatSlice(s fmt.State, verb rune) {\n\tio.WriteString(s, \"[\")\n\tfor i, f := range st {\n\t\tif i > 0 {\n\t\t\tio.WriteString(s, \" \")\n\t\t}\n\t\tf.Format(s, verb)\n\t}\n\tio.WriteString(s, \"]\")\n}\n\n// stack represents a stack of program counters.\ntype stack []uintptr\n\nfunc (s *stack) Format(st fmt.State, verb rune) {\n\tswitch verb {\n\tcase 'v':\n\t\tswitch {\n\t\tcase st.Flag('+'):\n\t\t\tfor _, pc := range *s {\n\t\t\t\tf := Frame(pc)\n\t\t\t\tfmt.Fprintf(st, \"\\n%+v\", f)\n\t\t\t}\n\t\t}\n\t}\n}\n\nfunc (s *stack) StackTrace() StackTrace {\n\tf := make([]Frame, len(*s))\n\tfor i := 0; i < len(f); i++ {\n\t\tf[i] = Frame((*s)[i])\n\t}\n\treturn f\n}\n\nfunc callers() *stack {\n\tconst depth = 32\n\tvar pcs [depth]uintptr\n\tn := runtime.Callers(3, pcs[:])\n\tvar st stack = pcs[0:n]\n\treturn &st\n}\n\n// funcname removes the path prefix component of a function's name reported by func.Name().\nfunc funcname(name string) string {\n\ti := strings.LastIndex(name, \"/\")\n\tname = name[i+1:]\n\ti = strings.Index(name, \".\")\n\treturn name[i+1:]\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/.gitignore", "content": ".idea/\n" }, { "path": "vendor/github.com/vishvananda/netlink/.travis.yml", "content": "language: go\ngo:\n - \"1.12.x\"\n - \"1.13.x\"\n - \"1.14.x\"\nbefore_script:\n # make sure we keep path in tact when we sudo\n - sudo sed -i -e 's/^Defaults\\tsecure_path.*$//' /etc/sudoers\n # modprobe ip_gre or else the first gre device can't be deleted\n - sudo modprobe ip_gre\n # modprobe nf_conntrack for the conntrack testing\n - sudo modprobe nf_conntrack\n - sudo modprobe nf_conntrack_netlink\n - sudo modprobe nf_conntrack_ipv4\n - sudo modprobe nf_conntrack_ipv6\n - sudo modprobe sch_hfsc\n - sudo modprobe sch_sfq\ninstall:\n - go get -v -t ./...\ngo_import_path: github.com/vishvananda/netlink\n" }, { "path": "vendor/github.com/vishvananda/netlink/CHANGELOG.md", "content": "# Changelog\n\n## 1.0.0 (2018-03-15)\n\nInitial release tagging" }, { "path": "vendor/github.com/vishvananda/netlink/LICENSE", "content": "\n Apache License\n Version 2.0, January 2004\n http://www.apache.org/licenses/\n\n TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION\n\n 1. Definitions.\n\n \"License\" shall mean the terms and conditions for use, reproduction,\n and distribution as defined by Sections 1 through 9 of this document.\n\n \"Licensor\" shall mean the copyright owner or entity authorized by\n the copyright owner that is granting the License.\n\n \"Legal Entity\" shall mean the union of the acting entity and all\n other entities that control, are controlled by, or are under common\n control with that entity. For the purposes of this definition,\n \"control\" means (i) the power, direct or indirect, to cause the\n direction or management of such entity, whether by contract or\n otherwise, or (ii) ownership of fifty percent (50%) or more of the\n outstanding shares, or (iii) beneficial ownership of such entity.\n\n \"You\" (or \"Your\") shall mean an individual or Legal Entity\n exercising permissions granted by this License.\n\n \"Source\" form shall mean the preferred form for making modifications,\n including but not limited to software source code, documentation\n source, and configuration files.\n\n \"Object\" form shall mean any form resulting from mechanical\n transformation or translation of a Source form, including but\n not limited to compiled object code, generated documentation,\n and conversions to other media types.\n\n \"Work\" shall mean the work of authorship, whether in Source or\n Object form, made available under the License, as indicated by a\n copyright notice that is included in or attached to the work\n (an example is provided in the Appendix below).\n\n \"Derivative Works\" shall mean any work, whether in Source or Object\n form, that is based on (or derived from) the Work and for which the\n editorial revisions, annotations, elaborations, or other modifications\n represent, as a whole, an original work of authorship. For the purposes\n of this License, Derivative Works shall not include works that remain\n separable from, or merely link (or bind by name) to the interfaces of,\n the Work and Derivative Works thereof.\n\n \"Contribution\" shall mean any work of authorship, including\n the original version of the Work and any modifications or additions\n to that Work or Derivative Works thereof, that is intentionally\n submitted to Licensor for inclusion in the Work by the copyright owner\n or by an individual or Legal Entity authorized to submit on behalf of\n the copyright owner. For the purposes of this definition, \"submitted\"\n means any form of electronic, verbal, or written communication sent\n to the Licensor or its representatives, including but not limited to\n communication on electronic mailing lists, source code control systems,\n and issue tracking systems that are managed by, or on behalf of, the\n Licensor for the purpose of discussing and improving the Work, but\n excluding communication that is conspicuously marked or otherwise\n designated in writing by the copyright owner as \"Not a Contribution.\"\n\n \"Contributor\" shall mean Licensor and any individual or Legal Entity\n on behalf of whom a Contribution has been received by Licensor and\n subsequently incorporated within the Work.\n\n 2. Grant of Copyright License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n copyright license to reproduce, prepare Derivative Works of,\n publicly display, publicly perform, sublicense, and distribute the\n Work and such Derivative Works in Source or Object form.\n\n 3. Grant of Patent License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n (except as stated in this section) patent license to make, have made,\n use, offer to sell, sell, import, and otherwise transfer the Work,\n where such license applies only to those patent claims licensable\n by such Contributor that are necessarily infringed by their\n Contribution(s) alone or by combination of their Contribution(s)\n with the Work to which such Contribution(s) was submitted. If You\n institute patent litigation against any entity (including a\n cross-claim or counterclaim in a lawsuit) alleging that the Work\n or a Contribution incorporated within the Work constitutes direct\n or contributory patent infringement, then any patent licenses\n granted to You under this License for that Work shall terminate\n as of the date such litigation is filed.\n\n 4. Redistribution. You may reproduce and distribute copies of the\n Work or Derivative Works thereof in any medium, with or without\n modifications, and in Source or Object form, provided that You\n meet the following conditions:\n\n (a) You must give any other recipients of the Work or\n Derivative Works a copy of this License; and\n\n (b) You must cause any modified files to carry prominent notices\n stating that You changed the files; and\n\n (c) You must retain, in the Source form of any Derivative Works\n that You distribute, all copyright, patent, trademark, and\n attribution notices from the Source form of the Work,\n excluding those notices that do not pertain to any part of\n the Derivative Works; and\n\n (d) If the Work includes a \"NOTICE\" text file as part of its\n distribution, then any Derivative Works that You distribute must\n include a readable copy of the attribution notices contained\n within such NOTICE file, excluding those notices that do not\n pertain to any part of the Derivative Works, in at least one\n of the following places: within a NOTICE text file distributed\n as part of the Derivative Works; within the Source form or\n documentation, if provided along with the Derivative Works; or,\n within a display generated by the Derivative Works, if and\n wherever such third-party notices normally appear. The contents\n of the NOTICE file are for informational purposes only and\n do not modify the License. You may add Your own attribution\n notices within Derivative Works that You distribute, alongside\n or as an addendum to the NOTICE text from the Work, provided\n that such additional attribution notices cannot be construed\n as modifying the License.\n\n You may add Your own copyright statement to Your modifications and\n may provide additional or different license terms and conditions\n for use, reproduction, or distribution of Your modifications, or\n for any such Derivative Works as a whole, provided Your use,\n reproduction, and distribution of the Work otherwise complies with\n the conditions stated in this License.\n\n 5. Submission of Contributions. Unless You explicitly state otherwise,\n any Contribution intentionally submitted for inclusion in the Work\n by You to the Licensor shall be under the terms and conditions of\n this License, without any additional terms or conditions.\n Notwithstanding the above, nothing herein shall supersede or modify\n the terms of any separate license agreement you may have executed\n with Licensor regarding such Contributions.\n\n 6. Trademarks. This License does not grant permission to use the trade\n names, trademarks, service marks, or product names of the Licensor,\n except as required for reasonable and customary use in describing the\n origin of the Work and reproducing the content of the NOTICE file.\n\n 7. Disclaimer of Warranty. Unless required by applicable law or\n agreed to in writing, Licensor provides the Work (and each\n Contributor provides its Contributions) on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\n implied, including, without limitation, any warranties or conditions\n of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A\n PARTICULAR PURPOSE. You are solely responsible for determining the\n appropriateness of using or redistributing the Work and assume any\n risks associated with Your exercise of permissions under this License.\n\n 8. Limitation of Liability. In no event and under no legal theory,\n whether in tort (including negligence), contract, or otherwise,\n unless required by applicable law (such as deliberate and grossly\n negligent acts) or agreed to in writing, shall any Contributor be\n liable to You for damages, including any direct, indirect, special,\n incidental, or consequential damages of any character arising as a\n result of this License or out of the use or inability to use the\n Work (including but not limited to damages for loss of goodwill,\n work stoppage, computer failure or malfunction, or any and all\n other commercial damages or losses), even if such Contributor\n has been advised of the possibility of such damages.\n\n 9. Accepting Warranty or Additional Liability. While redistributing\n the Work or Derivative Works thereof, You may choose to offer,\n and charge a fee for, acceptance of support, warranty, indemnity,\n or other liability obligations and/or rights consistent with this\n License. However, in accepting such obligations, You may act only\n on Your own behalf and on Your sole responsibility, not on behalf\n of any other Contributor, and only if You agree to indemnify,\n defend, and hold each Contributor harmless for any liability\n incurred by, or claims asserted against, such Contributor by reason\n of your accepting any such warranty or additional liability.\n\n END OF TERMS AND CONDITIONS\n\n Copyright 2014 Vishvananda Ishaya.\n Copyright 2014 Docker, Inc.\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n" }, { "path": "vendor/github.com/vishvananda/netlink/Makefile", "content": "DIRS := \\\n\t. \\\n\tnl\n\nDEPS = \\\n\tgithub.com/vishvananda/netns \\\n\tgolang.org/x/sys/unix\n\nuniq = $(if $1,$(firstword $1) $(call uniq,$(filter-out $(firstword $1),$1)))\ntestdirs = $(call uniq,$(foreach d,$(1),$(dir $(wildcard $(d)/*_test.go))))\ngoroot = $(addprefix ../../../,$(1))\nunroot = $(subst ../../../,,$(1))\nfmt = $(addprefix fmt-,$(1))\n\nall: test\n\n$(call goroot,$(DEPS)):\n\tgo get $(call unroot,$@)\n\n.PHONY: $(call testdirs,$(DIRS))\n$(call testdirs,$(DIRS)):\n\tgo test -test.exec sudo -test.parallel 4 -timeout 60s -test.v github.com/vishvananda/netlink/$@\n\n$(call fmt,$(call testdirs,$(DIRS))):\n\t! gofmt -l $(subst fmt-,,$@)/*.go | grep -q .\n\n.PHONY: fmt\nfmt: $(call fmt,$(call testdirs,$(DIRS)))\n\ntest: fmt $(call goroot,$(DEPS)) $(call testdirs,$(DIRS))\n" }, { "path": "vendor/github.com/vishvananda/netlink/README.md", "content": "# netlink - netlink library for go #\n\n[![Build Status](https://app.travis-ci.com/vishvananda/netlink.svg?branch=master)](https://app.travis-ci.com/vishvananda/netlink.svg?branch=master) [![GoDoc](https://godoc.org/github.com/vishvananda/netlink?status.svg)](https://godoc.org/github.com/vishvananda/netlink)\n\nThe netlink package provides a simple netlink library for go. Netlink\nis the interface a user-space program in linux uses to communicate with\nthe kernel. It can be used to add and remove interfaces, set ip addresses\nand routes, and configure ipsec. Netlink communication requires elevated\nprivileges, so in most cases this code needs to be run as root. Since\nlow-level netlink messages are inscrutable at best, the library attempts\nto provide an api that is loosely modeled on the CLI provided by iproute2.\nActions like `ip link add` will be accomplished via a similarly named\nfunction like AddLink(). This library began its life as a fork of the\nnetlink functionality in\n[docker/libcontainer](https://github.com/docker/libcontainer) but was\nheavily rewritten to improve testability, performance, and to add new\nfunctionality like ipsec xfrm handling.\n\n## Local Build and Test ##\n\nYou can use go get command:\n\n go get github.com/vishvananda/netlink\n\nTesting dependencies:\n\n go get github.com/vishvananda/netns\n\nTesting (requires root):\n\n sudo -E go test github.com/vishvananda/netlink\n\n## Examples ##\n\nAdd a new bridge and add eth1 into it:\n\n```go\npackage main\n\nimport (\n \"fmt\"\n \"github.com/vishvananda/netlink\"\n)\n\nfunc main() {\n la := netlink.NewLinkAttrs()\n la.Name = \"foo\"\n mybridge := &netlink.Bridge{LinkAttrs: la}\n err := netlink.LinkAdd(mybridge)\n if err != nil {\n fmt.Printf(\"could not add %s: %v\\n\", la.Name, err)\n }\n eth1, _ := netlink.LinkByName(\"eth1\")\n netlink.LinkSetMaster(eth1, mybridge)\n}\n\n```\nNote `NewLinkAttrs` constructor, it sets default values in structure. For now\nit sets only `TxQLen` to `-1`, so kernel will set default by itself. If you're\nusing simple initialization(`LinkAttrs{Name: \"foo\"}`) `TxQLen` will be set to\n`0` unless you specify it like `LinkAttrs{Name: \"foo\", TxQLen: 1000}`.\n\nAdd a new ip address to loopback:\n\n```go\npackage main\n\nimport (\n \"github.com/vishvananda/netlink\"\n)\n\nfunc main() {\n lo, _ := netlink.LinkByName(\"lo\")\n addr, _ := netlink.ParseAddr(\"169.254.169.254/32\")\n netlink.AddrAdd(lo, addr)\n}\n\n```\n\n## Future Work ##\n\nMany pieces of netlink are not yet fully supported in the high-level\ninterface. Aspects of virtually all of the high-level objects don't exist.\nMany of the underlying primitives are there, so its a matter of putting\nthe right fields into the high-level objects and making sure that they\nare serialized and deserialized correctly in the Add and List methods.\n\nThere are also a few pieces of low level netlink functionality that still\nneed to be implemented. Routing rules are not in place and some of the\nmore advanced link types. Hopefully there is decent structure and testing\nin place to make these fairly straightforward to add.\n\n" }, { "path": "vendor/github.com/vishvananda/netlink/addr.go", "content": "package netlink\n\nimport (\n\t\"fmt\"\n\t\"net\"\n\t\"strings\"\n)\n\n// Addr represents an IP address from netlink. Netlink ip addresses\n// include a mask, so it stores the address as a net.IPNet.\ntype Addr struct {\n\t*net.IPNet\n\tLabel string\n\tFlags int\n\tScope int\n\tPeer *net.IPNet\n\tBroadcast net.IP\n\tPreferedLft int\n\tValidLft int\n\tLinkIndex int\n}\n\n// String returns $ip/$netmask $label\nfunc (a Addr) String() string {\n\treturn strings.TrimSpace(fmt.Sprintf(\"%s %s\", a.IPNet, a.Label))\n}\n\n// ParseAddr parses the string representation of an address in the\n// form $ip/$netmask $label. The label portion is optional\nfunc ParseAddr(s string) (*Addr, error) {\n\tlabel := \"\"\n\tparts := strings.Split(s, \" \")\n\tif len(parts) > 1 {\n\t\ts = parts[0]\n\t\tlabel = parts[1]\n\t}\n\tm, err := ParseIPNet(s)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn &Addr{IPNet: m, Label: label}, nil\n}\n\n// Equal returns true if both Addrs have the same net.IPNet value.\nfunc (a Addr) Equal(x Addr) bool {\n\tsizea, _ := a.Mask.Size()\n\tsizeb, _ := x.Mask.Size()\n\t// ignore label for comparison\n\treturn a.IP.Equal(x.IP) && sizea == sizeb\n}\n\nfunc (a Addr) PeerEqual(x Addr) bool {\n\tsizea, _ := a.Peer.Mask.Size()\n\tsizeb, _ := x.Peer.Mask.Size()\n\t// ignore label for comparison\n\treturn a.Peer.IP.Equal(x.Peer.IP) && sizea == sizeb\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/addr_linux.go", "content": "package netlink\n\nimport (\n\t\"fmt\"\n\t\"net\"\n\t\"strings\"\n\t\"syscall\"\n\n\t\"github.com/vishvananda/netlink/nl\"\n\t\"github.com/vishvananda/netns\"\n\t\"golang.org/x/sys/unix\"\n)\n\n// AddrAdd will add an IP address to a link device.\n//\n// Equivalent to: `ip addr add $addr dev $link`\n//\n// If `addr` is an IPv4 address and the broadcast address is not given, it\n// will be automatically computed based on the IP mask if /30 or larger.\nfunc AddrAdd(link Link, addr *Addr) error {\n\treturn pkgHandle.AddrAdd(link, addr)\n}\n\n// AddrAdd will add an IP address to a link device.\n//\n// Equivalent to: `ip addr add $addr dev $link`\n//\n// If `addr` is an IPv4 address and the broadcast address is not given, it\n// will be automatically computed based on the IP mask if /30 or larger.\nfunc (h *Handle) AddrAdd(link Link, addr *Addr) error {\n\treq := h.newNetlinkRequest(unix.RTM_NEWADDR, unix.NLM_F_CREATE|unix.NLM_F_EXCL|unix.NLM_F_ACK)\n\treturn h.addrHandle(link, addr, req)\n}\n\n// AddrReplace will replace (or, if not present, add) an IP address on a link device.\n//\n// Equivalent to: `ip addr replace $addr dev $link`\n//\n// If `addr` is an IPv4 address and the broadcast address is not given, it\n// will be automatically computed based on the IP mask if /30 or larger.\nfunc AddrReplace(link Link, addr *Addr) error {\n\treturn pkgHandle.AddrReplace(link, addr)\n}\n\n// AddrReplace will replace (or, if not present, add) an IP address on a link device.\n//\n// Equivalent to: `ip addr replace $addr dev $link`\n//\n// If `addr` is an IPv4 address and the broadcast address is not given, it\n// will be automatically computed based on the IP mask if /30 or larger.\nfunc (h *Handle) AddrReplace(link Link, addr *Addr) error {\n\treq := h.newNetlinkRequest(unix.RTM_NEWADDR, unix.NLM_F_CREATE|unix.NLM_F_REPLACE|unix.NLM_F_ACK)\n\treturn h.addrHandle(link, addr, req)\n}\n\n// AddrDel will delete an IP address from a link device.\n//\n// Equivalent to: `ip addr del $addr dev $link`\n//\n// If `addr` is an IPv4 address and the broadcast address is not given, it\n// will be automatically computed based on the IP mask if /30 or larger.\nfunc AddrDel(link Link, addr *Addr) error {\n\treturn pkgHandle.AddrDel(link, addr)\n}\n\n// AddrDel will delete an IP address from a link device.\n// Equivalent to: `ip addr del $addr dev $link`\n//\n// If `addr` is an IPv4 address and the broadcast address is not given, it\n// will be automatically computed based on the IP mask if /30 or larger.\nfunc (h *Handle) AddrDel(link Link, addr *Addr) error {\n\treq := h.newNetlinkRequest(unix.RTM_DELADDR, unix.NLM_F_ACK)\n\treturn h.addrHandle(link, addr, req)\n}\n\nfunc (h *Handle) addrHandle(link Link, addr *Addr, req *nl.NetlinkRequest) error {\n\tbase := link.Attrs()\n\tif addr.Label != \"\" && !strings.HasPrefix(addr.Label, base.Name) {\n\t\treturn fmt.Errorf(\"label must begin with interface name\")\n\t}\n\th.ensureIndex(base)\n\n\tfamily := nl.GetIPFamily(addr.IP)\n\n\tmsg := nl.NewIfAddrmsg(family)\n\tmsg.Index = uint32(base.Index)\n\tmsg.Scope = uint8(addr.Scope)\n\tmask := addr.Mask\n\tif addr.Peer != nil {\n\t\tmask = addr.Peer.Mask\n\t}\n\tprefixlen, masklen := mask.Size()\n\tmsg.Prefixlen = uint8(prefixlen)\n\treq.AddData(msg)\n\n\tvar localAddrData []byte\n\tif family == FAMILY_V4 {\n\t\tlocalAddrData = addr.IP.To4()\n\t} else {\n\t\tlocalAddrData = addr.IP.To16()\n\t}\n\n\tlocalData := nl.NewRtAttr(unix.IFA_LOCAL, localAddrData)\n\treq.AddData(localData)\n\tvar peerAddrData []byte\n\tif addr.Peer != nil {\n\t\tif family == FAMILY_V4 {\n\t\t\tpeerAddrData = addr.Peer.IP.To4()\n\t\t} else {\n\t\t\tpeerAddrData = addr.Peer.IP.To16()\n\t\t}\n\t} else {\n\t\tpeerAddrData = localAddrData\n\t}\n\n\taddressData := nl.NewRtAttr(unix.IFA_ADDRESS, peerAddrData)\n\treq.AddData(addressData)\n\n\tif addr.Flags != 0 {\n\t\tif addr.Flags <= 0xff {\n\t\t\tmsg.IfAddrmsg.Flags = uint8(addr.Flags)\n\t\t} else {\n\t\t\tb := make([]byte, 4)\n\t\t\tnative.PutUint32(b, uint32(addr.Flags))\n\t\t\tflagsData := nl.NewRtAttr(unix.IFA_FLAGS, b)\n\t\t\treq.AddData(flagsData)\n\t\t}\n\t}\n\n\tif family == FAMILY_V4 {\n\t\t// Automatically set the broadcast address if it is unset and the\n\t\t// subnet is large enough to sensibly have one (/30 or larger).\n\t\t// See: RFC 3021\n\t\tif addr.Broadcast == nil && prefixlen < 31 {\n\t\t\tcalcBroadcast := make(net.IP, masklen/8)\n\t\t\tfor i := range localAddrData {\n\t\t\t\tcalcBroadcast[i] = localAddrData[i] | ^mask[i]\n\t\t\t}\n\t\t\taddr.Broadcast = calcBroadcast\n\t\t}\n\n\t\tif addr.Broadcast != nil {\n\t\t\treq.AddData(nl.NewRtAttr(unix.IFA_BROADCAST, addr.Broadcast))\n\t\t}\n\n\t\tif addr.Label != \"\" {\n\t\t\tlabelData := nl.NewRtAttr(unix.IFA_LABEL, nl.ZeroTerminated(addr.Label))\n\t\t\treq.AddData(labelData)\n\t\t}\n\t}\n\n\t// 0 is the default value for these attributes. However, 0 means \"expired\", while the least-surprising default\n\t// value should be \"forever\". To compensate for that, only add the attributes if at least one of the values is\n\t// non-zero, which means the caller has explicitly set them\n\tif addr.ValidLft > 0 || addr.PreferedLft > 0 {\n\t\tcachedata := nl.IfaCacheInfo{unix.IfaCacheinfo{\n\t\t\tValid: uint32(addr.ValidLft),\n\t\t\tPrefered: uint32(addr.PreferedLft),\n\t\t}}\n\t\treq.AddData(nl.NewRtAttr(unix.IFA_CACHEINFO, cachedata.Serialize()))\n\t}\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// AddrList gets a list of IP addresses in the system.\n// Equivalent to: `ip addr show`.\n// The list can be filtered by link and ip family.\nfunc AddrList(link Link, family int) ([]Addr, error) {\n\treturn pkgHandle.AddrList(link, family)\n}\n\n// AddrList gets a list of IP addresses in the system.\n// Equivalent to: `ip addr show`.\n// The list can be filtered by link and ip family.\nfunc (h *Handle) AddrList(link Link, family int) ([]Addr, error) {\n\treq := h.newNetlinkRequest(unix.RTM_GETADDR, unix.NLM_F_DUMP)\n\tmsg := nl.NewIfInfomsg(family)\n\treq.AddData(msg)\n\n\tmsgs, err := req.Execute(unix.NETLINK_ROUTE, unix.RTM_NEWADDR)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tindexFilter := 0\n\tif link != nil {\n\t\tbase := link.Attrs()\n\t\th.ensureIndex(base)\n\t\tindexFilter = base.Index\n\t}\n\n\tvar res []Addr\n\tfor _, m := range msgs {\n\t\taddr, msgFamily, err := parseAddr(m)\n\t\tif err != nil {\n\t\t\treturn res, err\n\t\t}\n\n\t\tif link != nil && addr.LinkIndex != indexFilter {\n\t\t\t// Ignore messages from other interfaces\n\t\t\tcontinue\n\t\t}\n\n\t\tif family != FAMILY_ALL && msgFamily != family {\n\t\t\tcontinue\n\t\t}\n\n\t\tres = append(res, addr)\n\t}\n\n\treturn res, nil\n}\n\nfunc parseAddr(m []byte) (addr Addr, family int, err error) {\n\tmsg := nl.DeserializeIfAddrmsg(m)\n\n\tfamily = -1\n\taddr.LinkIndex = -1\n\n\tattrs, err1 := nl.ParseRouteAttr(m[msg.Len():])\n\tif err1 != nil {\n\t\terr = err1\n\t\treturn\n\t}\n\n\tfamily = int(msg.Family)\n\taddr.LinkIndex = int(msg.Index)\n\n\tvar local, dst *net.IPNet\n\tfor _, attr := range attrs {\n\t\tswitch attr.Attr.Type {\n\t\tcase unix.IFA_ADDRESS:\n\t\t\tdst = &net.IPNet{\n\t\t\t\tIP: attr.Value,\n\t\t\t\tMask: net.CIDRMask(int(msg.Prefixlen), 8*len(attr.Value)),\n\t\t\t}\n\t\tcase unix.IFA_LOCAL:\n\t\t\t// iproute2 manual:\n\t\t\t// If a peer address is specified, the local address\n\t\t\t// cannot have a prefix length. The network prefix is\n\t\t\t// associated with the peer rather than with the local\n\t\t\t// address.\n\t\t\tn := 8 * len(attr.Value)\n\t\t\tlocal = &net.IPNet{\n\t\t\t\tIP: attr.Value,\n\t\t\t\tMask: net.CIDRMask(n, n),\n\t\t\t}\n\t\tcase unix.IFA_BROADCAST:\n\t\t\taddr.Broadcast = attr.Value\n\t\tcase unix.IFA_LABEL:\n\t\t\taddr.Label = string(attr.Value[:len(attr.Value)-1])\n\t\tcase unix.IFA_FLAGS:\n\t\t\taddr.Flags = int(native.Uint32(attr.Value[0:4]))\n\t\tcase unix.IFA_CACHEINFO:\n\t\t\tci := nl.DeserializeIfaCacheInfo(attr.Value)\n\t\t\taddr.PreferedLft = int(ci.Prefered)\n\t\t\taddr.ValidLft = int(ci.Valid)\n\t\t}\n\t}\n\n\t// libnl addr.c comment:\n\t// IPv6 sends the local address as IFA_ADDRESS with no\n\t// IFA_LOCAL, IPv4 sends both IFA_LOCAL and IFA_ADDRESS\n\t// with IFA_ADDRESS being the peer address if they differ\n\t//\n\t// But obviously, as there are IPv6 PtP addresses, too,\n\t// IFA_LOCAL should also be handled for IPv6.\n\tif local != nil {\n\t\tif family == FAMILY_V4 && dst != nil && local.IP.Equal(dst.IP) {\n\t\t\taddr.IPNet = dst\n\t\t} else {\n\t\t\taddr.IPNet = local\n\t\t\taddr.Peer = dst\n\t\t}\n\t} else {\n\t\taddr.IPNet = dst\n\t}\n\n\taddr.Scope = int(msg.Scope)\n\n\treturn\n}\n\ntype AddrUpdate struct {\n\tLinkAddress net.IPNet\n\tLinkIndex int\n\tFlags int\n\tScope int\n\tPreferedLft int\n\tValidLft int\n\tNewAddr bool // true=added false=deleted\n}\n\n// AddrSubscribe takes a chan down which notifications will be sent\n// when addresses change. Close the 'done' chan to stop subscription.\nfunc AddrSubscribe(ch chan<- AddrUpdate, done <-chan struct{}) error {\n\treturn addrSubscribeAt(netns.None(), netns.None(), ch, done, nil, false, 0)\n}\n\n// AddrSubscribeAt works like AddrSubscribe plus it allows the caller\n// to choose the network namespace in which to subscribe (ns).\nfunc AddrSubscribeAt(ns netns.NsHandle, ch chan<- AddrUpdate, done <-chan struct{}) error {\n\treturn addrSubscribeAt(ns, netns.None(), ch, done, nil, false, 0)\n}\n\n// AddrSubscribeOptions contains a set of options to use with\n// AddrSubscribeWithOptions.\ntype AddrSubscribeOptions struct {\n\tNamespace *netns.NsHandle\n\tErrorCallback func(error)\n\tListExisting bool\n\tReceiveBufferSize int\n}\n\n// AddrSubscribeWithOptions work like AddrSubscribe but enable to\n// provide additional options to modify the behavior. Currently, the\n// namespace can be provided as well as an error callback.\nfunc AddrSubscribeWithOptions(ch chan<- AddrUpdate, done <-chan struct{}, options AddrSubscribeOptions) error {\n\tif options.Namespace == nil {\n\t\tnone := netns.None()\n\t\toptions.Namespace = &none\n\t}\n\treturn addrSubscribeAt(*options.Namespace, netns.None(), ch, done, options.ErrorCallback, options.ListExisting, options.ReceiveBufferSize)\n}\n\nfunc addrSubscribeAt(newNs, curNs netns.NsHandle, ch chan<- AddrUpdate, done <-chan struct{}, cberr func(error), listExisting bool, rcvbuf int) error {\n\ts, err := nl.SubscribeAt(newNs, curNs, unix.NETLINK_ROUTE, unix.RTNLGRP_IPV4_IFADDR, unix.RTNLGRP_IPV6_IFADDR)\n\tif err != nil {\n\t\treturn err\n\t}\n\tif done != nil {\n\t\tgo func() {\n\t\t\t<-done\n\t\t\ts.Close()\n\t\t}()\n\t}\n\tif rcvbuf != 0 {\n\t\terr = pkgHandle.SetSocketReceiveBufferSize(rcvbuf, false)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\tif listExisting {\n\t\treq := pkgHandle.newNetlinkRequest(unix.RTM_GETADDR,\n\t\t\tunix.NLM_F_DUMP)\n\t\tinfmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\t\treq.AddData(infmsg)\n\t\tif err := s.Send(req); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\tgo func() {\n\t\tdefer close(ch)\n\t\tfor {\n\t\t\tmsgs, from, err := s.Receive()\n\t\t\tif err != nil {\n\t\t\t\tif cberr != nil {\n\t\t\t\t\tcberr(fmt.Errorf(\"Receive failed: %v\",\n\t\t\t\t\t\terr))\n\t\t\t\t}\n\t\t\t\treturn\n\t\t\t}\n\t\t\tif from.Pid != nl.PidKernel {\n\t\t\t\tif cberr != nil {\n\t\t\t\t\tcberr(fmt.Errorf(\"Wrong sender portid %d, expected %d\", from.Pid, nl.PidKernel))\n\t\t\t\t}\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tfor _, m := range msgs {\n\t\t\t\tif m.Header.Type == unix.NLMSG_DONE {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tif m.Header.Type == unix.NLMSG_ERROR {\n\t\t\t\t\terror := int32(native.Uint32(m.Data[0:4]))\n\t\t\t\t\tif error == 0 {\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\t\t\t\t\tif cberr != nil {\n\t\t\t\t\t\tcberr(fmt.Errorf(\"error message: %v\",\n\t\t\t\t\t\t\tsyscall.Errno(-error)))\n\t\t\t\t\t}\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tmsgType := m.Header.Type\n\t\t\t\tif msgType != unix.RTM_NEWADDR && msgType != unix.RTM_DELADDR {\n\t\t\t\t\tif cberr != nil {\n\t\t\t\t\t\tcberr(fmt.Errorf(\"bad message type: %d\", msgType))\n\t\t\t\t\t}\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\n\t\t\t\taddr, _, err := parseAddr(m.Data)\n\t\t\t\tif err != nil {\n\t\t\t\t\tif cberr != nil {\n\t\t\t\t\t\tcberr(fmt.Errorf(\"could not parse address: %v\", err))\n\t\t\t\t\t}\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\n\t\t\t\tch <- AddrUpdate{LinkAddress: *addr.IPNet,\n\t\t\t\t\tLinkIndex: addr.LinkIndex,\n\t\t\t\t\tNewAddr: msgType == unix.RTM_NEWADDR,\n\t\t\t\t\tFlags: addr.Flags,\n\t\t\t\t\tScope: addr.Scope,\n\t\t\t\t\tPreferedLft: addr.PreferedLft,\n\t\t\t\t\tValidLft: addr.ValidLft}\n\t\t\t}\n\t\t}\n\t}()\n\n\treturn nil\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/bpf_linux.go", "content": "package netlink\n\nimport (\n\t\"unsafe\"\n\n\t\"golang.org/x/sys/unix\"\n)\n\ntype BpfProgType uint32\n\nconst (\n\tBPF_PROG_TYPE_UNSPEC BpfProgType = iota\n\tBPF_PROG_TYPE_SOCKET_FILTER\n\tBPF_PROG_TYPE_KPROBE\n\tBPF_PROG_TYPE_SCHED_CLS\n\tBPF_PROG_TYPE_SCHED_ACT\n\tBPF_PROG_TYPE_TRACEPOINT\n\tBPF_PROG_TYPE_XDP\n\tBPF_PROG_TYPE_PERF_EVENT\n\tBPF_PROG_TYPE_CGROUP_SKB\n\tBPF_PROG_TYPE_CGROUP_SOCK\n\tBPF_PROG_TYPE_LWT_IN\n\tBPF_PROG_TYPE_LWT_OUT\n\tBPF_PROG_TYPE_LWT_XMIT\n\tBPF_PROG_TYPE_SOCK_OPS\n\tBPF_PROG_TYPE_SK_SKB\n\tBPF_PROG_TYPE_CGROUP_DEVICE\n\tBPF_PROG_TYPE_SK_MSG\n\tBPF_PROG_TYPE_RAW_TRACEPOINT\n\tBPF_PROG_TYPE_CGROUP_SOCK_ADDR\n\tBPF_PROG_TYPE_LWT_SEG6LOCAL\n\tBPF_PROG_TYPE_LIRC_MODE2\n\tBPF_PROG_TYPE_SK_REUSEPORT\n\tBPF_PROG_TYPE_FLOW_DISSECTOR\n\tBPF_PROG_TYPE_CGROUP_SYSCTL\n\tBPF_PROG_TYPE_RAW_TRACEPOINT_WRITABLE\n\tBPF_PROG_TYPE_CGROUP_SOCKOPT\n\tBPF_PROG_TYPE_TRACING\n\tBPF_PROG_TYPE_STRUCT_OPS\n\tBPF_PROG_TYPE_EXT\n\tBPF_PROG_TYPE_LSM\n\tBPF_PROG_TYPE_SK_LOOKUP\n)\n\ntype BPFAttr struct {\n\tProgType uint32\n\tInsnCnt uint32\n\tInsns uintptr\n\tLicense uintptr\n\tLogLevel uint32\n\tLogSize uint32\n\tLogBuf uintptr\n\tKernVersion uint32\n}\n\n// loadSimpleBpf loads a trivial bpf program for testing purposes.\nfunc loadSimpleBpf(progType BpfProgType, ret uint32) (int, error) {\n\tinsns := []uint64{\n\t\t0x00000000000000b7 | (uint64(ret) << 32),\n\t\t0x0000000000000095,\n\t}\n\tlicense := []byte{'A', 'S', 'L', '2', '\\x00'}\n\tattr := BPFAttr{\n\t\tProgType: uint32(progType),\n\t\tInsnCnt: uint32(len(insns)),\n\t\tInsns: uintptr(unsafe.Pointer(&insns[0])),\n\t\tLicense: uintptr(unsafe.Pointer(&license[0])),\n\t}\n\tfd, _, errno := unix.Syscall(unix.SYS_BPF,\n\t\t5, /* bpf cmd */\n\t\tuintptr(unsafe.Pointer(&attr)),\n\t\tunsafe.Sizeof(attr))\n\tif errno != 0 {\n\t\treturn 0, errno\n\t}\n\treturn int(fd), nil\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/bridge_linux.go", "content": "package netlink\n\nimport (\n\t\"fmt\"\n\n\t\"github.com/vishvananda/netlink/nl\"\n\t\"golang.org/x/sys/unix\"\n)\n\n// BridgeVlanList gets a map of device id to bridge vlan infos.\n// Equivalent to: `bridge vlan show`\nfunc BridgeVlanList() (map[int32][]*nl.BridgeVlanInfo, error) {\n\treturn pkgHandle.BridgeVlanList()\n}\n\n// BridgeVlanList gets a map of device id to bridge vlan infos.\n// Equivalent to: `bridge vlan show`\nfunc (h *Handle) BridgeVlanList() (map[int32][]*nl.BridgeVlanInfo, error) {\n\treq := h.newNetlinkRequest(unix.RTM_GETLINK, unix.NLM_F_DUMP)\n\tmsg := nl.NewIfInfomsg(unix.AF_BRIDGE)\n\treq.AddData(msg)\n\treq.AddData(nl.NewRtAttr(unix.IFLA_EXT_MASK, nl.Uint32Attr(uint32(nl.RTEXT_FILTER_BRVLAN))))\n\n\tmsgs, err := req.Execute(unix.NETLINK_ROUTE, unix.RTM_NEWLINK)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tret := make(map[int32][]*nl.BridgeVlanInfo)\n\tfor _, m := range msgs {\n\t\tmsg := nl.DeserializeIfInfomsg(m)\n\n\t\tattrs, err := nl.ParseRouteAttr(m[msg.Len():])\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tfor _, attr := range attrs {\n\t\t\tswitch attr.Attr.Type {\n\t\t\tcase unix.IFLA_AF_SPEC:\n\t\t\t\t//nested attr\n\t\t\t\tnestAttrs, err := nl.ParseRouteAttr(attr.Value)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn nil, fmt.Errorf(\"failed to parse nested attr %v\", err)\n\t\t\t\t}\n\t\t\t\tfor _, nestAttr := range nestAttrs {\n\t\t\t\t\tswitch nestAttr.Attr.Type {\n\t\t\t\t\tcase nl.IFLA_BRIDGE_VLAN_INFO:\n\t\t\t\t\t\tvlanInfo := nl.DeserializeBridgeVlanInfo(nestAttr.Value)\n\t\t\t\t\t\tret[msg.Index] = append(ret[msg.Index], vlanInfo)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn ret, nil\n}\n\n// BridgeVlanAdd adds a new vlan filter entry\n// Equivalent to: `bridge vlan add dev DEV vid VID [ pvid ] [ untagged ] [ self ] [ master ]`\nfunc BridgeVlanAdd(link Link, vid uint16, pvid, untagged, self, master bool) error {\n\treturn pkgHandle.BridgeVlanAdd(link, vid, pvid, untagged, self, master)\n}\n\n// BridgeVlanAdd adds a new vlan filter entry\n// Equivalent to: `bridge vlan add dev DEV vid VID [ pvid ] [ untagged ] [ self ] [ master ]`\nfunc (h *Handle) BridgeVlanAdd(link Link, vid uint16, pvid, untagged, self, master bool) error {\n\treturn h.bridgeVlanModify(unix.RTM_SETLINK, link, vid, pvid, untagged, self, master)\n}\n\n// BridgeVlanDel adds a new vlan filter entry\n// Equivalent to: `bridge vlan del dev DEV vid VID [ pvid ] [ untagged ] [ self ] [ master ]`\nfunc BridgeVlanDel(link Link, vid uint16, pvid, untagged, self, master bool) error {\n\treturn pkgHandle.BridgeVlanDel(link, vid, pvid, untagged, self, master)\n}\n\n// BridgeVlanDel adds a new vlan filter entry\n// Equivalent to: `bridge vlan del dev DEV vid VID [ pvid ] [ untagged ] [ self ] [ master ]`\nfunc (h *Handle) BridgeVlanDel(link Link, vid uint16, pvid, untagged, self, master bool) error {\n\treturn h.bridgeVlanModify(unix.RTM_DELLINK, link, vid, pvid, untagged, self, master)\n}\n\nfunc (h *Handle) bridgeVlanModify(cmd int, link Link, vid uint16, pvid, untagged, self, master bool) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(cmd, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_BRIDGE)\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\tbr := nl.NewRtAttr(unix.IFLA_AF_SPEC, nil)\n\tvar flags uint16\n\tif self {\n\t\tflags |= nl.BRIDGE_FLAGS_SELF\n\t}\n\tif master {\n\t\tflags |= nl.BRIDGE_FLAGS_MASTER\n\t}\n\tif flags > 0 {\n\t\tbr.AddRtAttr(nl.IFLA_BRIDGE_FLAGS, nl.Uint16Attr(flags))\n\t}\n\tvlanInfo := &nl.BridgeVlanInfo{Vid: vid}\n\tif pvid {\n\t\tvlanInfo.Flags |= nl.BRIDGE_VLAN_INFO_PVID\n\t}\n\tif untagged {\n\t\tvlanInfo.Flags |= nl.BRIDGE_VLAN_INFO_UNTAGGED\n\t}\n\tbr.AddRtAttr(nl.IFLA_BRIDGE_VLAN_INFO, vlanInfo.Serialize())\n\treq.AddData(br)\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/class.go", "content": "package netlink\n\nimport (\n\t\"fmt\"\n)\n\n// Class interfaces for all classes\ntype Class interface {\n\tAttrs() *ClassAttrs\n\tType() string\n}\n\n// Generic networking statistics for netlink users.\n// This file contains \"gnet_\" prefixed structs and relevant functions.\n// See Documentation/networking/getn_stats.txt in Linux source code for more details.\n\n// GnetStatsBasic Ref: struct gnet_stats_basic { ... }\ntype GnetStatsBasic struct {\n\tBytes uint64 // number of seen bytes\n\tPackets uint32 // number of seen packets\n}\n\n// GnetStatsRateEst Ref: struct gnet_stats_rate_est { ... }\ntype GnetStatsRateEst struct {\n\tBps uint32 // current byte rate\n\tPps uint32 // current packet rate\n}\n\n// GnetStatsRateEst64 Ref: struct gnet_stats_rate_est64 { ... }\ntype GnetStatsRateEst64 struct {\n\tBps uint64 // current byte rate\n\tPps uint64 // current packet rate\n}\n\n// GnetStatsQueue Ref: struct gnet_stats_queue { ... }\ntype GnetStatsQueue struct {\n\tQlen uint32 // queue length\n\tBacklog uint32 // backlog size of queue\n\tDrops uint32 // number of dropped packets\n\tRequeues uint32 // number of requues\n\tOverlimits uint32 // number of enqueues over the limit\n}\n\n// ClassStatistics representation based on generic networking statistics for netlink.\n// See Documentation/networking/gen_stats.txt in Linux source code for more details.\ntype ClassStatistics struct {\n\tBasic *GnetStatsBasic\n\tQueue *GnetStatsQueue\n\tRateEst *GnetStatsRateEst\n}\n\n// NewClassStatistics Construct a ClassStatistics struct which fields are all initialized by 0.\nfunc NewClassStatistics() *ClassStatistics {\n\treturn &ClassStatistics{\n\t\tBasic: &GnetStatsBasic{},\n\t\tQueue: &GnetStatsQueue{},\n\t\tRateEst: &GnetStatsRateEst{},\n\t}\n}\n\n// ClassAttrs represents a netlink class. A filter is associated with a link,\n// has a handle and a parent. The root filter of a device should have a\n// parent == HANDLE_ROOT.\ntype ClassAttrs struct {\n\tLinkIndex int\n\tHandle uint32\n\tParent uint32\n\tLeaf uint32\n\tStatistics *ClassStatistics\n}\n\nfunc (q ClassAttrs) String() string {\n\treturn fmt.Sprintf(\"{LinkIndex: %d, Handle: %s, Parent: %s, Leaf: %d}\", q.LinkIndex, HandleStr(q.Handle), HandleStr(q.Parent), q.Leaf)\n}\n\n// HtbClassAttrs stores the attributes of HTB class\ntype HtbClassAttrs struct {\n\t// TODO handle all attributes\n\tRate uint64\n\tCeil uint64\n\tBuffer uint32\n\tCbuffer uint32\n\tQuantum uint32\n\tLevel uint32\n\tPrio uint32\n}\n\nfunc (q HtbClassAttrs) String() string {\n\treturn fmt.Sprintf(\"{Rate: %d, Ceil: %d, Buffer: %d, Cbuffer: %d}\", q.Rate, q.Ceil, q.Buffer, q.Cbuffer)\n}\n\n// HtbClass represents an Htb class\ntype HtbClass struct {\n\tClassAttrs\n\tRate uint64\n\tCeil uint64\n\tBuffer uint32\n\tCbuffer uint32\n\tQuantum uint32\n\tLevel uint32\n\tPrio uint32\n}\n\nfunc (q HtbClass) String() string {\n\treturn fmt.Sprintf(\"{Rate: %d, Ceil: %d, Buffer: %d, Cbuffer: %d}\", q.Rate, q.Ceil, q.Buffer, q.Cbuffer)\n}\n\n// Attrs returns the class attributes\nfunc (q *HtbClass) Attrs() *ClassAttrs {\n\treturn &q.ClassAttrs\n}\n\n// Type return the class type\nfunc (q *HtbClass) Type() string {\n\treturn \"htb\"\n}\n\n// GenericClass classes represent types that are not currently understood\n// by this netlink library.\ntype GenericClass struct {\n\tClassAttrs\n\tClassType string\n}\n\n// Attrs return the class attributes\nfunc (class *GenericClass) Attrs() *ClassAttrs {\n\treturn &class.ClassAttrs\n}\n\n// Type return the class type\nfunc (class *GenericClass) Type() string {\n\treturn class.ClassType\n}\n\n// ServiceCurve is a nondecreasing function of some time unit, returning the amount of service\n// (an allowed or allocated amount of bandwidth) at some specific point in time. The purpose of it\n// should be subconsciously obvious: if a class was allowed to transfer not less than the amount\n// specified by its service curve, then the service curve is not violated.\ntype ServiceCurve struct {\n\tm1 uint32\n\td uint32\n\tm2 uint32\n}\n\n// Attrs return the parameters of the service curve\nfunc (c *ServiceCurve) Attrs() (uint32, uint32, uint32) {\n\treturn c.m1, c.d, c.m2\n}\n\n// Burst returns the burst rate (m1) of the curve\nfunc (c *ServiceCurve) Burst() uint32 {\n\treturn c.m1\n}\n\n// Delay return the delay (d) of the curve\nfunc (c *ServiceCurve) Delay() uint32 {\n\treturn c.d\n}\n\n// Rate returns the rate (m2) of the curve\nfunc (c *ServiceCurve) Rate() uint32 {\n\treturn c.m2\n}\n\n// HfscClass is a representation of the HFSC class\ntype HfscClass struct {\n\tClassAttrs\n\tRsc ServiceCurve\n\tFsc ServiceCurve\n\tUsc ServiceCurve\n}\n\n// SetUsc sets the USC curve. The bandwidth (m1 and m2) is specified in bits and the delay in\n// seconds.\nfunc (hfsc *HfscClass) SetUsc(m1 uint32, d uint32, m2 uint32) {\n\thfsc.Usc = ServiceCurve{m1: m1, d: d, m2: m2}\n}\n\n// SetFsc sets the Fsc curve. The bandwidth (m1 and m2) is specified in bits and the delay in\n// seconds.\nfunc (hfsc *HfscClass) SetFsc(m1 uint32, d uint32, m2 uint32) {\n\thfsc.Fsc = ServiceCurve{m1: m1, d: d, m2: m2}\n}\n\n// SetRsc sets the Rsc curve. The bandwidth (m1 and m2) is specified in bits and the delay in\n// seconds.\nfunc (hfsc *HfscClass) SetRsc(m1 uint32, d uint32, m2 uint32) {\n\thfsc.Rsc = ServiceCurve{m1: m1, d: d, m2: m2}\n}\n\n// SetSC implements the SC from the `tc` CLI. This function behaves the same as if one would set the\n// USC through the `tc` command-line tool. This means bandwidth (m1 and m2) is specified in bits and\n// the delay in ms.\nfunc (hfsc *HfscClass) SetSC(m1 uint32, d uint32, m2 uint32) {\n\thfsc.SetRsc(m1, d, m2)\n\thfsc.SetFsc(m1, d, m2)\n}\n\n// SetUL implements the UL from the `tc` CLI. This function behaves the same as if one would set the\n// USC through the `tc` command-line tool. This means bandwidth (m1 and m2) is specified in bits and\n// the delay in ms.\nfunc (hfsc *HfscClass) SetUL(m1 uint32, d uint32, m2 uint32) {\n\thfsc.SetUsc(m1, d, m2)\n}\n\n// SetLS implements the LS from the `tc` CLI. This function behaves the same as if one would set the\n// USC through the `tc` command-line tool. This means bandwidth (m1 and m2) is specified in bits and\n// the delay in ms.\nfunc (hfsc *HfscClass) SetLS(m1 uint32, d uint32, m2 uint32) {\n\thfsc.SetFsc(m1, d, m2)\n}\n\n// NewHfscClass returns a new HFSC struct with the set parameters\nfunc NewHfscClass(attrs ClassAttrs) *HfscClass {\n\treturn &HfscClass{\n\t\tClassAttrs: attrs,\n\t\tRsc: ServiceCurve{},\n\t\tFsc: ServiceCurve{},\n\t\tUsc: ServiceCurve{},\n\t}\n}\n\n// String() returns a string that contains the information and attributes of the HFSC class\nfunc (hfsc *HfscClass) String() string {\n\treturn fmt.Sprintf(\n\t\t\"{%s -- {RSC: {m1=%d d=%d m2=%d}} {FSC: {m1=%d d=%d m2=%d}} {USC: {m1=%d d=%d m2=%d}}}\",\n\t\thfsc.Attrs(), hfsc.Rsc.m1*8, hfsc.Rsc.d, hfsc.Rsc.m2*8, hfsc.Fsc.m1*8, hfsc.Fsc.d, hfsc.Fsc.m2*8, hfsc.Usc.m1*8, hfsc.Usc.d, hfsc.Usc.m2*8,\n\t)\n}\n\n// Attrs return the Hfsc parameters\nfunc (hfsc *HfscClass) Attrs() *ClassAttrs {\n\treturn &hfsc.ClassAttrs\n}\n\n// Type return the type of the class\nfunc (hfsc *HfscClass) Type() string {\n\treturn \"hfsc\"\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/class_linux.go", "content": "package netlink\n\nimport (\n\t\"bytes\"\n\t\"encoding/binary\"\n\t\"encoding/hex\"\n\t\"errors\"\n\t\"fmt\"\n\t\"syscall\"\n\n\t\"github.com/vishvananda/netlink/nl\"\n\t\"golang.org/x/sys/unix\"\n)\n\n// Internal tc_stats representation in Go struct.\n// This is for internal uses only to deserialize the payload of rtattr.\n// After the deserialization, this should be converted into the canonical stats\n// struct, ClassStatistics, in case of statistics of a class.\n// Ref: struct tc_stats { ... }\ntype tcStats struct {\n\tBytes uint64 // Number of enqueued bytes\n\tPackets uint32 // Number of enqueued packets\n\tDrops uint32 // Packets dropped because of lack of resources\n\tOverlimits uint32 // Number of throttle events when this flow goes out of allocated bandwidth\n\tBps uint32 // Current flow byte rate\n\tPps uint32 // Current flow packet rate\n\tQlen uint32\n\tBacklog uint32\n}\n\n// NewHtbClass NOTE: function is in here because it uses other linux functions\nfunc NewHtbClass(attrs ClassAttrs, cattrs HtbClassAttrs) *HtbClass {\n\tmtu := 1600\n\trate := cattrs.Rate / 8\n\tceil := cattrs.Ceil / 8\n\tbuffer := cattrs.Buffer\n\tcbuffer := cattrs.Cbuffer\n\n\tif ceil == 0 {\n\t\tceil = rate\n\t}\n\n\tif buffer == 0 {\n\t\tbuffer = uint32(float64(rate)/Hz() + float64(mtu))\n\t}\n\tbuffer = Xmittime(rate, buffer)\n\n\tif cbuffer == 0 {\n\t\tcbuffer = uint32(float64(ceil)/Hz() + float64(mtu))\n\t}\n\tcbuffer = Xmittime(ceil, cbuffer)\n\n\treturn &HtbClass{\n\t\tClassAttrs: attrs,\n\t\tRate: rate,\n\t\tCeil: ceil,\n\t\tBuffer: buffer,\n\t\tCbuffer: cbuffer,\n\t\tLevel: 0,\n\t\tPrio: cattrs.Prio,\n\t\tQuantum: cattrs.Quantum,\n\t}\n}\n\n// ClassDel will delete a class from the system.\n// Equivalent to: `tc class del $class`\nfunc ClassDel(class Class) error {\n\treturn pkgHandle.ClassDel(class)\n}\n\n// ClassDel will delete a class from the system.\n// Equivalent to: `tc class del $class`\nfunc (h *Handle) ClassDel(class Class) error {\n\treturn h.classModify(unix.RTM_DELTCLASS, 0, class)\n}\n\n// ClassChange will change a class in place\n// Equivalent to: `tc class change $class`\n// The parent and handle MUST NOT be changed.\nfunc ClassChange(class Class) error {\n\treturn pkgHandle.ClassChange(class)\n}\n\n// ClassChange will change a class in place\n// Equivalent to: `tc class change $class`\n// The parent and handle MUST NOT be changed.\nfunc (h *Handle) ClassChange(class Class) error {\n\treturn h.classModify(unix.RTM_NEWTCLASS, 0, class)\n}\n\n// ClassReplace will replace a class to the system.\n// quivalent to: `tc class replace $class`\n// The handle MAY be changed.\n// If a class already exist with this parent/handle pair, the class is changed.\n// If a class does not already exist with this parent/handle, a new class is created.\nfunc ClassReplace(class Class) error {\n\treturn pkgHandle.ClassReplace(class)\n}\n\n// ClassReplace will replace a class to the system.\n// quivalent to: `tc class replace $class`\n// The handle MAY be changed.\n// If a class already exist with this parent/handle pair, the class is changed.\n// If a class does not already exist with this parent/handle, a new class is created.\nfunc (h *Handle) ClassReplace(class Class) error {\n\treturn h.classModify(unix.RTM_NEWTCLASS, unix.NLM_F_CREATE, class)\n}\n\n// ClassAdd will add a class to the system.\n// Equivalent to: `tc class add $class`\nfunc ClassAdd(class Class) error {\n\treturn pkgHandle.ClassAdd(class)\n}\n\n// ClassAdd will add a class to the system.\n// Equivalent to: `tc class add $class`\nfunc (h *Handle) ClassAdd(class Class) error {\n\treturn h.classModify(\n\t\tunix.RTM_NEWTCLASS,\n\t\tunix.NLM_F_CREATE|unix.NLM_F_EXCL,\n\t\tclass,\n\t)\n}\n\nfunc (h *Handle) classModify(cmd, flags int, class Class) error {\n\treq := h.newNetlinkRequest(cmd, flags|unix.NLM_F_ACK)\n\tbase := class.Attrs()\n\tmsg := &nl.TcMsg{\n\t\tFamily: nl.FAMILY_ALL,\n\t\tIfindex: int32(base.LinkIndex),\n\t\tHandle: base.Handle,\n\t\tParent: base.Parent,\n\t}\n\treq.AddData(msg)\n\n\tif cmd != unix.RTM_DELTCLASS {\n\t\tif err := classPayload(req, class); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\nfunc classPayload(req *nl.NetlinkRequest, class Class) error {\n\treq.AddData(nl.NewRtAttr(nl.TCA_KIND, nl.ZeroTerminated(class.Type())))\n\n\toptions := nl.NewRtAttr(nl.TCA_OPTIONS, nil)\n\tswitch class.Type() {\n\tcase \"htb\":\n\t\thtb := class.(*HtbClass)\n\t\topt := nl.TcHtbCopt{}\n\t\topt.Buffer = htb.Buffer\n\t\topt.Cbuffer = htb.Cbuffer\n\t\topt.Quantum = htb.Quantum\n\t\topt.Level = htb.Level\n\t\topt.Prio = htb.Prio\n\t\t// TODO: Handle Debug properly. For now default to 0\n\t\t/* Calculate {R,C}Tab and set Rate and Ceil */\n\t\tcellLog := -1\n\t\tccellLog := -1\n\t\tlinklayer := nl.LINKLAYER_ETHERNET\n\t\tmtu := 1600\n\t\tvar rtab [256]uint32\n\t\tvar ctab [256]uint32\n\t\ttcrate := nl.TcRateSpec{Rate: uint32(htb.Rate)}\n\t\tif CalcRtable(&tcrate, rtab[:], cellLog, uint32(mtu), linklayer) < 0 {\n\t\t\treturn errors.New(\"HTB: failed to calculate rate table\")\n\t\t}\n\t\topt.Rate = tcrate\n\t\ttcceil := nl.TcRateSpec{Rate: uint32(htb.Ceil)}\n\t\tif CalcRtable(&tcceil, ctab[:], ccellLog, uint32(mtu), linklayer) < 0 {\n\t\t\treturn errors.New(\"HTB: failed to calculate ceil rate table\")\n\t\t}\n\t\topt.Ceil = tcceil\n\t\toptions.AddRtAttr(nl.TCA_HTB_PARMS, opt.Serialize())\n\t\toptions.AddRtAttr(nl.TCA_HTB_RTAB, SerializeRtab(rtab))\n\t\toptions.AddRtAttr(nl.TCA_HTB_CTAB, SerializeRtab(ctab))\n\t\tif htb.Rate >= uint64(1<<32) {\n\t\t\toptions.AddRtAttr(nl.TCA_HTB_RATE64, nl.Uint64Attr(htb.Rate))\n\t\t}\n\t\tif htb.Ceil >= uint64(1<<32) {\n\t\t\toptions.AddRtAttr(nl.TCA_HTB_CEIL64, nl.Uint64Attr(htb.Ceil))\n\t\t}\n\tcase \"hfsc\":\n\t\thfsc := class.(*HfscClass)\n\t\topt := nl.HfscCopt{}\n\t\trm1, rd, rm2 := hfsc.Rsc.Attrs()\n\t\topt.Rsc.Set(rm1/8, rd, rm2/8)\n\t\tfm1, fd, fm2 := hfsc.Fsc.Attrs()\n\t\topt.Fsc.Set(fm1/8, fd, fm2/8)\n\t\tum1, ud, um2 := hfsc.Usc.Attrs()\n\t\topt.Usc.Set(um1/8, ud, um2/8)\n\t\tnl.NewRtAttrChild(options, nl.TCA_HFSC_RSC, nl.SerializeHfscCurve(&opt.Rsc))\n\t\tnl.NewRtAttrChild(options, nl.TCA_HFSC_FSC, nl.SerializeHfscCurve(&opt.Fsc))\n\t\tnl.NewRtAttrChild(options, nl.TCA_HFSC_USC, nl.SerializeHfscCurve(&opt.Usc))\n\t}\n\treq.AddData(options)\n\treturn nil\n}\n\n// ClassList gets a list of classes in the system.\n// Equivalent to: `tc class show`.\n// Generally returns nothing if link and parent are not specified.\nfunc ClassList(link Link, parent uint32) ([]Class, error) {\n\treturn pkgHandle.ClassList(link, parent)\n}\n\n// ClassList gets a list of classes in the system.\n// Equivalent to: `tc class show`.\n// Generally returns nothing if link and parent are not specified.\nfunc (h *Handle) ClassList(link Link, parent uint32) ([]Class, error) {\n\treq := h.newNetlinkRequest(unix.RTM_GETTCLASS, unix.NLM_F_DUMP)\n\tmsg := &nl.TcMsg{\n\t\tFamily: nl.FAMILY_ALL,\n\t\tParent: parent,\n\t}\n\tif link != nil {\n\t\tbase := link.Attrs()\n\t\th.ensureIndex(base)\n\t\tmsg.Ifindex = int32(base.Index)\n\t}\n\treq.AddData(msg)\n\n\tmsgs, err := req.Execute(unix.NETLINK_ROUTE, unix.RTM_NEWTCLASS)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tvar res []Class\n\tfor _, m := range msgs {\n\t\tmsg := nl.DeserializeTcMsg(m)\n\n\t\tattrs, err := nl.ParseRouteAttr(m[msg.Len():])\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\n\t\tbase := ClassAttrs{\n\t\t\tLinkIndex: int(msg.Ifindex),\n\t\t\tHandle: msg.Handle,\n\t\t\tParent: msg.Parent,\n\t\t\tStatistics: nil,\n\t\t}\n\n\t\tvar class Class\n\t\tclassType := \"\"\n\t\tfor _, attr := range attrs {\n\t\t\tswitch attr.Attr.Type {\n\t\t\tcase nl.TCA_KIND:\n\t\t\t\tclassType = string(attr.Value[:len(attr.Value)-1])\n\t\t\t\tswitch classType {\n\t\t\t\tcase \"htb\":\n\t\t\t\t\tclass = &HtbClass{}\n\t\t\t\tcase \"hfsc\":\n\t\t\t\t\tclass = &HfscClass{}\n\t\t\t\tdefault:\n\t\t\t\t\tclass = &GenericClass{ClassType: classType}\n\t\t\t\t}\n\t\t\tcase nl.TCA_OPTIONS:\n\t\t\t\tswitch classType {\n\t\t\t\tcase \"htb\":\n\t\t\t\t\tdata, err := nl.ParseRouteAttr(attr.Value)\n\t\t\t\t\tif err != nil {\n\t\t\t\t\t\treturn nil, err\n\t\t\t\t\t}\n\t\t\t\t\t_, err = parseHtbClassData(class, data)\n\t\t\t\t\tif err != nil {\n\t\t\t\t\t\treturn nil, err\n\t\t\t\t\t}\n\t\t\t\tcase \"hfsc\":\n\t\t\t\t\tdata, err := nl.ParseRouteAttr(attr.Value)\n\t\t\t\t\tif err != nil {\n\t\t\t\t\t\treturn nil, err\n\t\t\t\t\t}\n\t\t\t\t\t_, err = parseHfscClassData(class, data)\n\t\t\t\t\tif err != nil {\n\t\t\t\t\t\treturn nil, err\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t// For backward compatibility.\n\t\t\tcase nl.TCA_STATS:\n\t\t\t\tbase.Statistics, err = parseTcStats(attr.Value)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn nil, err\n\t\t\t\t}\n\t\t\tcase nl.TCA_STATS2:\n\t\t\t\tbase.Statistics, err = parseTcStats2(attr.Value)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn nil, err\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t*class.Attrs() = base\n\t\tres = append(res, class)\n\t}\n\n\treturn res, nil\n}\n\nfunc parseHtbClassData(class Class, data []syscall.NetlinkRouteAttr) (bool, error) {\n\thtb := class.(*HtbClass)\n\tdetailed := false\n\tfor _, datum := range data {\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.TCA_HTB_PARMS:\n\t\t\topt := nl.DeserializeTcHtbCopt(datum.Value)\n\t\t\thtb.Rate = uint64(opt.Rate.Rate)\n\t\t\thtb.Ceil = uint64(opt.Ceil.Rate)\n\t\t\thtb.Buffer = opt.Buffer\n\t\t\thtb.Cbuffer = opt.Cbuffer\n\t\t\thtb.Quantum = opt.Quantum\n\t\t\thtb.Level = opt.Level\n\t\t\thtb.Prio = opt.Prio\n\t\tcase nl.TCA_HTB_RATE64:\n\t\t\thtb.Rate = native.Uint64(datum.Value[0:8])\n\t\tcase nl.TCA_HTB_CEIL64:\n\t\t\thtb.Ceil = native.Uint64(datum.Value[0:8])\n\t\t}\n\t}\n\treturn detailed, nil\n}\n\nfunc parseHfscClassData(class Class, data []syscall.NetlinkRouteAttr) (bool, error) {\n\thfsc := class.(*HfscClass)\n\tdetailed := false\n\tfor _, datum := range data {\n\t\tm1, d, m2 := nl.DeserializeHfscCurve(datum.Value).Attrs()\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.TCA_HFSC_RSC:\n\t\t\thfsc.Rsc = ServiceCurve{m1: m1 * 8, d: d, m2: m2 * 8}\n\t\tcase nl.TCA_HFSC_FSC:\n\t\t\thfsc.Fsc = ServiceCurve{m1: m1 * 8, d: d, m2: m2 * 8}\n\t\tcase nl.TCA_HFSC_USC:\n\t\t\thfsc.Usc = ServiceCurve{m1: m1 * 8, d: d, m2: m2 * 8}\n\t\t}\n\t}\n\treturn detailed, nil\n}\n\nfunc parseTcStats(data []byte) (*ClassStatistics, error) {\n\tbuf := &bytes.Buffer{}\n\tbuf.Write(data)\n\ttcStats := &tcStats{}\n\tif err := binary.Read(buf, native, tcStats); err != nil {\n\t\treturn nil, err\n\t}\n\n\tstats := NewClassStatistics()\n\tstats.Basic.Bytes = tcStats.Bytes\n\tstats.Basic.Packets = tcStats.Packets\n\tstats.Queue.Qlen = tcStats.Qlen\n\tstats.Queue.Backlog = tcStats.Backlog\n\tstats.Queue.Drops = tcStats.Drops\n\tstats.Queue.Overlimits = tcStats.Overlimits\n\tstats.RateEst.Bps = tcStats.Bps\n\tstats.RateEst.Pps = tcStats.Pps\n\n\treturn stats, nil\n}\n\nfunc parseGnetStats(data []byte, gnetStats interface{}) error {\n\tbuf := &bytes.Buffer{}\n\tbuf.Write(data)\n\treturn binary.Read(buf, native, gnetStats)\n}\n\nfunc parseTcStats2(data []byte) (*ClassStatistics, error) {\n\trtAttrs, err := nl.ParseRouteAttr(data)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tstats := NewClassStatistics()\n\tfor _, datum := range rtAttrs {\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.TCA_STATS_BASIC:\n\t\t\tif err := parseGnetStats(datum.Value, stats.Basic); err != nil {\n\t\t\t\treturn nil, fmt.Errorf(\"Failed to parse ClassStatistics.Basic with: %v\\n%s\",\n\t\t\t\t\terr, hex.Dump(datum.Value))\n\t\t\t}\n\t\tcase nl.TCA_STATS_QUEUE:\n\t\t\tif err := parseGnetStats(datum.Value, stats.Queue); err != nil {\n\t\t\t\treturn nil, fmt.Errorf(\"Failed to parse ClassStatistics.Queue with: %v\\n%s\",\n\t\t\t\t\terr, hex.Dump(datum.Value))\n\t\t\t}\n\t\tcase nl.TCA_STATS_RATE_EST:\n\t\t\tif err := parseGnetStats(datum.Value, stats.RateEst); err != nil {\n\t\t\t\treturn nil, fmt.Errorf(\"Failed to parse ClassStatistics.RateEst with: %v\\n%s\",\n\t\t\t\t\terr, hex.Dump(datum.Value))\n\t\t\t}\n\t\t}\n\t}\n\n\treturn stats, nil\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/conntrack_linux.go", "content": "package netlink\n\nimport (\n\t\"bytes\"\n\t\"encoding/binary\"\n\t\"errors\"\n\t\"fmt\"\n\t\"net\"\n\n\t\"github.com/vishvananda/netlink/nl\"\n\t\"golang.org/x/sys/unix\"\n)\n\n// ConntrackTableType Conntrack table for the netlink operation\ntype ConntrackTableType uint8\n\nconst (\n\t// ConntrackTable Conntrack table\n\t// https://github.com/torvalds/linux/blob/master/include/uapi/linux/netfilter/nfnetlink.h -> #define NFNL_SUBSYS_CTNETLINK\t\t 1\n\tConntrackTable = 1\n\t// ConntrackExpectTable Conntrack expect table\n\t// https://github.com/torvalds/linux/blob/master/include/uapi/linux/netfilter/nfnetlink.h -> #define NFNL_SUBSYS_CTNETLINK_EXP 2\n\tConntrackExpectTable = 2\n)\n\nconst (\n\t// backward compatibility with golang 1.6 which does not have io.SeekCurrent\n\tseekCurrent = 1\n)\n\n// InetFamily Family type\ntype InetFamily uint8\n\n// -L [table] [options] List conntrack or expectation table\n// -G [table] parameters Get conntrack or expectation\n\n// -I [table] parameters Create a conntrack or expectation\n// -U [table] parameters Update a conntrack\n// -E [table] [options] Show events\n\n// -C [table] Show counter\n// -S Show statistics\n\n// ConntrackTableList returns the flow list of a table of a specific family\n// conntrack -L [table] [options] List conntrack or expectation table\nfunc ConntrackTableList(table ConntrackTableType, family InetFamily) ([]*ConntrackFlow, error) {\n\treturn pkgHandle.ConntrackTableList(table, family)\n}\n\n// ConntrackTableFlush flushes all the flows of a specified table\n// conntrack -F [table] Flush table\n// The flush operation applies to all the family types\nfunc ConntrackTableFlush(table ConntrackTableType) error {\n\treturn pkgHandle.ConntrackTableFlush(table)\n}\n\n// ConntrackDeleteFilter deletes entries on the specified table on the base of the filter\n// conntrack -D [table] parameters Delete conntrack or expectation\nfunc ConntrackDeleteFilter(table ConntrackTableType, family InetFamily, filter CustomConntrackFilter) (uint, error) {\n\treturn pkgHandle.ConntrackDeleteFilter(table, family, filter)\n}\n\n// ConntrackTableList returns the flow list of a table of a specific family using the netlink handle passed\n// conntrack -L [table] [options] List conntrack or expectation table\nfunc (h *Handle) ConntrackTableList(table ConntrackTableType, family InetFamily) ([]*ConntrackFlow, error) {\n\tres, err := h.dumpConntrackTable(table, family)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\t// Deserialize all the flows\n\tvar result []*ConntrackFlow\n\tfor _, dataRaw := range res {\n\t\tresult = append(result, parseRawData(dataRaw))\n\t}\n\n\treturn result, nil\n}\n\n// ConntrackTableFlush flushes all the flows of a specified table using the netlink handle passed\n// conntrack -F [table] Flush table\n// The flush operation applies to all the family types\nfunc (h *Handle) ConntrackTableFlush(table ConntrackTableType) error {\n\treq := h.newConntrackRequest(table, unix.AF_INET, nl.IPCTNL_MSG_CT_DELETE, unix.NLM_F_ACK)\n\t_, err := req.Execute(unix.NETLINK_NETFILTER, 0)\n\treturn err\n}\n\n// ConntrackDeleteFilter deletes entries on the specified table on the base of the filter using the netlink handle passed\n// conntrack -D [table] parameters Delete conntrack or expectation\nfunc (h *Handle) ConntrackDeleteFilter(table ConntrackTableType, family InetFamily, filter CustomConntrackFilter) (uint, error) {\n\tres, err := h.dumpConntrackTable(table, family)\n\tif err != nil {\n\t\treturn 0, err\n\t}\n\n\tvar matched uint\n\tfor _, dataRaw := range res {\n\t\tflow := parseRawData(dataRaw)\n\t\tif match := filter.MatchConntrackFlow(flow); match {\n\t\t\treq2 := h.newConntrackRequest(table, family, nl.IPCTNL_MSG_CT_DELETE, unix.NLM_F_ACK)\n\t\t\t// skip the first 4 byte that are the netfilter header, the newConntrackRequest is adding it already\n\t\t\treq2.AddRawData(dataRaw[4:])\n\t\t\treq2.Execute(unix.NETLINK_NETFILTER, 0)\n\t\t\tmatched++\n\t\t}\n\t}\n\n\treturn matched, nil\n}\n\nfunc (h *Handle) newConntrackRequest(table ConntrackTableType, family InetFamily, operation, flags int) *nl.NetlinkRequest {\n\t// Create the Netlink request object\n\treq := h.newNetlinkRequest((int(table)<<8)|operation, flags)\n\t// Add the netfilter header\n\tmsg := &nl.Nfgenmsg{\n\t\tNfgenFamily: uint8(family),\n\t\tVersion: nl.NFNETLINK_V0,\n\t\tResId: 0,\n\t}\n\treq.AddData(msg)\n\treturn req\n}\n\nfunc (h *Handle) dumpConntrackTable(table ConntrackTableType, family InetFamily) ([][]byte, error) {\n\treq := h.newConntrackRequest(table, family, nl.IPCTNL_MSG_CT_GET, unix.NLM_F_DUMP)\n\treturn req.Execute(unix.NETLINK_NETFILTER, 0)\n}\n\n// The full conntrack flow structure is very complicated and can be found in the file:\n// http://git.netfilter.org/libnetfilter_conntrack/tree/include/internal/object.h\n// For the time being, the structure below allows to parse and extract the base information of a flow\ntype ipTuple struct {\n\tBytes uint64\n\tDstIP net.IP\n\tDstPort uint16\n\tPackets uint64\n\tProtocol uint8\n\tSrcIP net.IP\n\tSrcPort uint16\n}\n\ntype ConntrackFlow struct {\n\tFamilyType uint8\n\tForward ipTuple\n\tReverse ipTuple\n\tMark uint32\n}\n\nfunc (s *ConntrackFlow) String() string {\n\t// conntrack cmd output:\n\t// udp 17 src=127.0.0.1 dst=127.0.0.1 sport=4001 dport=1234 packets=5 bytes=532 [UNREPLIED] src=127.0.0.1 dst=127.0.0.1 sport=1234 dport=4001 packets=10 bytes=1078 mark=0\n\treturn fmt.Sprintf(\"%s\\t%d src=%s dst=%s sport=%d dport=%d packets=%d bytes=%d\\tsrc=%s dst=%s sport=%d dport=%d packets=%d bytes=%d mark=%d\",\n\t\tnl.L4ProtoMap[s.Forward.Protocol], s.Forward.Protocol,\n\t\ts.Forward.SrcIP.String(), s.Forward.DstIP.String(), s.Forward.SrcPort, s.Forward.DstPort, s.Forward.Packets, s.Forward.Bytes,\n\t\ts.Reverse.SrcIP.String(), s.Reverse.DstIP.String(), s.Reverse.SrcPort, s.Reverse.DstPort, s.Reverse.Packets, s.Reverse.Bytes,\n\t\ts.Mark)\n}\n\n// This method parse the ip tuple structure\n// The message structure is the following:\n// \n// \n// \n// \n// \nfunc parseIpTuple(reader *bytes.Reader, tpl *ipTuple) uint8 {\n\tfor i := 0; i < 2; i++ {\n\t\t_, t, _, v := parseNfAttrTLV(reader)\n\t\tswitch t {\n\t\tcase nl.CTA_IP_V4_SRC, nl.CTA_IP_V6_SRC:\n\t\t\ttpl.SrcIP = v\n\t\tcase nl.CTA_IP_V4_DST, nl.CTA_IP_V6_DST:\n\t\t\ttpl.DstIP = v\n\t\t}\n\t}\n\t// Skip the next 4 bytes nl.NLA_F_NESTED|nl.CTA_TUPLE_PROTO\n\treader.Seek(4, seekCurrent)\n\t_, t, _, v := parseNfAttrTLV(reader)\n\tif t == nl.CTA_PROTO_NUM {\n\t\ttpl.Protocol = uint8(v[0])\n\t}\n\t// Skip some padding 3 bytes\n\treader.Seek(3, seekCurrent)\n\tfor i := 0; i < 2; i++ {\n\t\t_, t, _ := parseNfAttrTL(reader)\n\t\tswitch t {\n\t\tcase nl.CTA_PROTO_SRC_PORT:\n\t\t\tparseBERaw16(reader, &tpl.SrcPort)\n\t\tcase nl.CTA_PROTO_DST_PORT:\n\t\t\tparseBERaw16(reader, &tpl.DstPort)\n\t\t}\n\t\t// Skip some padding 2 byte\n\t\treader.Seek(2, seekCurrent)\n\t}\n\treturn tpl.Protocol\n}\n\nfunc parseNfAttrTLV(r *bytes.Reader) (isNested bool, attrType, len uint16, value []byte) {\n\tisNested, attrType, len = parseNfAttrTL(r)\n\n\tvalue = make([]byte, len)\n\tbinary.Read(r, binary.BigEndian, &value)\n\treturn isNested, attrType, len, value\n}\n\nfunc parseNfAttrTL(r *bytes.Reader) (isNested bool, attrType, len uint16) {\n\tbinary.Read(r, nl.NativeEndian(), &len)\n\tlen -= nl.SizeofNfattr\n\n\tbinary.Read(r, nl.NativeEndian(), &attrType)\n\tisNested = (attrType & nl.NLA_F_NESTED) == nl.NLA_F_NESTED\n\tattrType = attrType & (nl.NLA_F_NESTED - 1)\n\n\treturn isNested, attrType, len\n}\n\nfunc parseBERaw16(r *bytes.Reader, v *uint16) {\n\tbinary.Read(r, binary.BigEndian, v)\n}\n\nfunc parseBERaw32(r *bytes.Reader, v *uint32) {\n\tbinary.Read(r, binary.BigEndian, v)\n}\n\nfunc parseBERaw64(r *bytes.Reader, v *uint64) {\n\tbinary.Read(r, binary.BigEndian, v)\n}\n\nfunc parseByteAndPacketCounters(r *bytes.Reader) (bytes, packets uint64) {\n\tfor i := 0; i < 2; i++ {\n\t\tswitch _, t, _ := parseNfAttrTL(r); t {\n\t\tcase nl.CTA_COUNTERS_BYTES:\n\t\t\tparseBERaw64(r, &bytes)\n\t\tcase nl.CTA_COUNTERS_PACKETS:\n\t\t\tparseBERaw64(r, &packets)\n\t\tdefault:\n\t\t\treturn\n\t\t}\n\t}\n\treturn\n}\n\nfunc parseConnectionMark(r *bytes.Reader) (mark uint32) {\n\tparseBERaw32(r, &mark)\n\treturn\n}\n\nfunc parseRawData(data []byte) *ConntrackFlow {\n\ts := &ConntrackFlow{}\n\t// First there is the Nfgenmsg header\n\t// consume only the family field\n\treader := bytes.NewReader(data)\n\tbinary.Read(reader, nl.NativeEndian(), &s.FamilyType)\n\n\t// skip rest of the Netfilter header\n\treader.Seek(3, seekCurrent)\n\t// The message structure is the following:\n\t// 4 bytes\n\t// 4 bytes\n\t// flow information of the forward flow\n\t// 4 bytes\n\t// 4 bytes\n\t// flow information of the reverse flow\n\tfor reader.Len() > 0 {\n\t\tif nested, t, l := parseNfAttrTL(reader); nested {\n\t\t\tswitch t {\n\t\t\tcase nl.CTA_TUPLE_ORIG:\n\t\t\t\tif nested, t, _ = parseNfAttrTL(reader); nested && t == nl.CTA_TUPLE_IP {\n\t\t\t\t\tparseIpTuple(reader, &s.Forward)\n\t\t\t\t}\n\t\t\tcase nl.CTA_TUPLE_REPLY:\n\t\t\t\tif nested, t, _ = parseNfAttrTL(reader); nested && t == nl.CTA_TUPLE_IP {\n\t\t\t\t\tparseIpTuple(reader, &s.Reverse)\n\t\t\t\t} else {\n\t\t\t\t\t// Header not recognized skip it\n\t\t\t\t\treader.Seek(int64(l), seekCurrent)\n\t\t\t\t}\n\t\t\tcase nl.CTA_COUNTERS_ORIG:\n\t\t\t\ts.Forward.Bytes, s.Forward.Packets = parseByteAndPacketCounters(reader)\n\t\t\tcase nl.CTA_COUNTERS_REPLY:\n\t\t\t\ts.Reverse.Bytes, s.Reverse.Packets = parseByteAndPacketCounters(reader)\n\t\t\t}\n\t\t} else {\n\t\t\tswitch t {\n\t\t\tcase nl.CTA_MARK:\n\t\t\t\ts.Mark = parseConnectionMark(reader)\n\t\t\t}\n\t\t}\n\t}\n\treturn s\n}\n\n// Conntrack parameters and options:\n// -n, --src-nat ip source NAT ip\n// -g, --dst-nat ip destination NAT ip\n// -j, --any-nat ip source or destination NAT ip\n// -m, --mark mark Set mark\n// -c, --secmark secmark Set selinux secmark\n// -e, --event-mask eventmask Event mask, eg. NEW,DESTROY\n// -z, --zero Zero counters while listing\n// -o, --output type[,...] Output format, eg. xml\n// -l, --label label[,...] conntrack labels\n\n// Common parameters and options:\n// -s, --src, --orig-src ip Source address from original direction\n// -d, --dst, --orig-dst ip Destination address from original direction\n// -r, --reply-src ip Source address from reply direction\n// -q, --reply-dst ip Destination address from reply direction\n// -p, --protonum proto Layer 4 Protocol, eg. 'tcp'\n// -f, --family proto Layer 3 Protocol, eg. 'ipv6'\n// -t, --timeout timeout Set timeout\n// -u, --status status Set status, eg. ASSURED\n// -w, --zone value Set conntrack zone\n// --orig-zone value Set zone for original direction\n// --reply-zone value Set zone for reply direction\n// -b, --buffer-size Netlink socket buffer size\n// --mask-src ip Source mask address\n// --mask-dst ip Destination mask address\n\n// Layer 4 Protocol common parameters and options:\n// TCP, UDP, SCTP, UDPLite and DCCP\n// --sport, --orig-port-src port Source port in original direction\n// --dport, --orig-port-dst port Destination port in original direction\n\n// Filter types\ntype ConntrackFilterType uint8\n\nconst (\n\tConntrackOrigSrcIP = iota // -orig-src ip Source address from original direction\n\tConntrackOrigDstIP // -orig-dst ip Destination address from original direction\n\tConntrackReplySrcIP // --reply-src ip Reply Source IP\n\tConntrackReplyDstIP // --reply-dst ip Reply Destination IP\n\tConntrackReplyAnyIP // Match source or destination reply IP\n\tConntrackOrigSrcPort // --orig-port-src port Source port in original direction\n\tConntrackOrigDstPort // --orig-port-dst port Destination port in original direction\n\tConntrackNatSrcIP = ConntrackReplySrcIP // deprecated use instead ConntrackReplySrcIP\n\tConntrackNatDstIP = ConntrackReplyDstIP // deprecated use instead ConntrackReplyDstIP\n\tConntrackNatAnyIP = ConntrackReplyAnyIP // deprecated use instead ConntrackReplyAnyIP\n)\n\ntype CustomConntrackFilter interface {\n\t// MatchConntrackFlow applies the filter to the flow and returns true if the flow matches\n\t// the filter or false otherwise\n\tMatchConntrackFlow(flow *ConntrackFlow) bool\n}\n\ntype ConntrackFilter struct {\n\tipNetFilter map[ConntrackFilterType]*net.IPNet\n\tportFilter map[ConntrackFilterType]uint16\n\tprotoFilter uint8\n}\n\n// AddIPNet adds a IP subnet to the conntrack filter\nfunc (f *ConntrackFilter) AddIPNet(tp ConntrackFilterType, ipNet *net.IPNet) error {\n\tif ipNet == nil {\n\t\treturn fmt.Errorf(\"Filter attribute empty\")\n\t}\n\tif f.ipNetFilter == nil {\n\t\tf.ipNetFilter = make(map[ConntrackFilterType]*net.IPNet)\n\t}\n\tif _, ok := f.ipNetFilter[tp]; ok {\n\t\treturn errors.New(\"Filter attribute already present\")\n\t}\n\tf.ipNetFilter[tp] = ipNet\n\treturn nil\n}\n\n// AddIP adds an IP to the conntrack filter\nfunc (f *ConntrackFilter) AddIP(tp ConntrackFilterType, ip net.IP) error {\n\tif ip == nil {\n\t\treturn fmt.Errorf(\"Filter attribute empty\")\n\t}\n\treturn f.AddIPNet(tp, NewIPNet(ip))\n}\n\n// AddPort adds a Port to the conntrack filter if the Layer 4 protocol allows it\nfunc (f *ConntrackFilter) AddPort(tp ConntrackFilterType, port uint16) error {\n\tswitch f.protoFilter {\n\t// TCP, UDP, DCCP, SCTP, UDPLite\n\tcase 6, 17, 33, 132, 136:\n\tdefault:\n\t\treturn fmt.Errorf(\"Filter attribute not available without a valid Layer 4 protocol: %d\", f.protoFilter)\n\t}\n\n\tif f.portFilter == nil {\n\t\tf.portFilter = make(map[ConntrackFilterType]uint16)\n\t}\n\tif _, ok := f.portFilter[tp]; ok {\n\t\treturn errors.New(\"Filter attribute already present\")\n\t}\n\tf.portFilter[tp] = port\n\treturn nil\n}\n\n// AddProtocol adds the Layer 4 protocol to the conntrack filter\nfunc (f *ConntrackFilter) AddProtocol(proto uint8) error {\n\tif f.protoFilter != 0 {\n\t\treturn errors.New(\"Filter attribute already present\")\n\t}\n\tf.protoFilter = proto\n\treturn nil\n}\n\n// MatchConntrackFlow applies the filter to the flow and returns true if the flow matches the filter\n// false otherwise\nfunc (f *ConntrackFilter) MatchConntrackFlow(flow *ConntrackFlow) bool {\n\tif len(f.ipNetFilter) == 0 && len(f.portFilter) == 0 && f.protoFilter == 0 {\n\t\t// empty filter always not match\n\t\treturn false\n\t}\n\n\t// -p, --protonum proto Layer 4 Protocol, eg. 'tcp'\n\tif f.protoFilter != 0 && flow.Forward.Protocol != f.protoFilter {\n\t\t// different Layer 4 protocol always not match\n\t\treturn false\n\t}\n\n\tmatch := true\n\n\t// IP conntrack filter\n\tif len(f.ipNetFilter) > 0 {\n\t\t// -orig-src ip Source address from original direction\n\t\tif elem, found := f.ipNetFilter[ConntrackOrigSrcIP]; found {\n\t\t\tmatch = match && elem.Contains(flow.Forward.SrcIP)\n\t\t}\n\n\t\t// -orig-dst ip Destination address from original direction\n\t\tif elem, found := f.ipNetFilter[ConntrackOrigDstIP]; match && found {\n\t\t\tmatch = match && elem.Contains(flow.Forward.DstIP)\n\t\t}\n\n\t\t// -src-nat ip Source NAT ip\n\t\tif elem, found := f.ipNetFilter[ConntrackReplySrcIP]; match && found {\n\t\t\tmatch = match && elem.Contains(flow.Reverse.SrcIP)\n\t\t}\n\n\t\t// -dst-nat ip Destination NAT ip\n\t\tif elem, found := f.ipNetFilter[ConntrackReplyDstIP]; match && found {\n\t\t\tmatch = match && elem.Contains(flow.Reverse.DstIP)\n\t\t}\n\n\t\t// Match source or destination reply IP\n\t\tif elem, found := f.ipNetFilter[ConntrackReplyAnyIP]; match && found {\n\t\t\tmatch = match && (elem.Contains(flow.Reverse.SrcIP) || elem.Contains(flow.Reverse.DstIP))\n\t\t}\n\t}\n\n\t// Layer 4 Port filter\n\tif len(f.portFilter) > 0 {\n\t\t// -orig-port-src port\tSource port from original direction\n\t\tif elem, found := f.portFilter[ConntrackOrigSrcPort]; match && found {\n\t\t\tmatch = match && elem == flow.Forward.SrcPort\n\t\t}\n\n\t\t// -orig-port-dst port\tDestination port from original direction\n\t\tif elem, found := f.portFilter[ConntrackOrigDstPort]; match && found {\n\t\t\tmatch = match && elem == flow.Forward.DstPort\n\t\t}\n\t}\n\n\treturn match\n}\n\nvar _ CustomConntrackFilter = (*ConntrackFilter)(nil)\n" }, { "path": "vendor/github.com/vishvananda/netlink/conntrack_unspecified.go", "content": "// +build !linux\n\npackage netlink\n\n// ConntrackTableType Conntrack table for the netlink operation\ntype ConntrackTableType uint8\n\n// InetFamily Family type\ntype InetFamily uint8\n\n// ConntrackFlow placeholder\ntype ConntrackFlow struct{}\n\n// ConntrackFilter placeholder\ntype ConntrackFilter struct{}\n\n// ConntrackTableList returns the flow list of a table of a specific family\n// conntrack -L [table] [options] List conntrack or expectation table\nfunc ConntrackTableList(table ConntrackTableType, family InetFamily) ([]*ConntrackFlow, error) {\n\treturn nil, ErrNotImplemented\n}\n\n// ConntrackTableFlush flushes all the flows of a specified table\n// conntrack -F [table] Flush table\n// The flush operation applies to all the family types\nfunc ConntrackTableFlush(table ConntrackTableType) error {\n\treturn ErrNotImplemented\n}\n\n// ConntrackDeleteFilter deletes entries on the specified table on the base of the filter\n// conntrack -D [table] parameters Delete conntrack or expectation\nfunc ConntrackDeleteFilter(table ConntrackTableType, family InetFamily, filter *ConntrackFilter) (uint, error) {\n\treturn 0, ErrNotImplemented\n}\n\n// ConntrackTableList returns the flow list of a table of a specific family using the netlink handle passed\n// conntrack -L [table] [options] List conntrack or expectation table\nfunc (h *Handle) ConntrackTableList(table ConntrackTableType, family InetFamily) ([]*ConntrackFlow, error) {\n\treturn nil, ErrNotImplemented\n}\n\n// ConntrackTableFlush flushes all the flows of a specified table using the netlink handle passed\n// conntrack -F [table] Flush table\n// The flush operation applies to all the family types\nfunc (h *Handle) ConntrackTableFlush(table ConntrackTableType) error {\n\treturn ErrNotImplemented\n}\n\n// ConntrackDeleteFilter deletes entries on the specified table on the base of the filter using the netlink handle passed\n// conntrack -D [table] parameters Delete conntrack or expectation\nfunc (h *Handle) ConntrackDeleteFilter(table ConntrackTableType, family InetFamily, filter *ConntrackFilter) (uint, error) {\n\treturn 0, ErrNotImplemented\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/devlink_linux.go", "content": "package netlink\n\nimport (\n\t\"fmt\"\n\t\"github.com/vishvananda/netlink/nl\"\n\t\"golang.org/x/sys/unix\"\n\t\"net\"\n\t\"syscall\"\n)\n\n// DevlinkDevEswitchAttr represents device's eswitch attributes\ntype DevlinkDevEswitchAttr struct {\n\tMode string\n\tInlineMode string\n\tEncapMode string\n}\n\n// DevlinkDevAttrs represents device attributes\ntype DevlinkDevAttrs struct {\n\tEswitch DevlinkDevEswitchAttr\n}\n\n// DevlinkDevice represents device and its attributes\ntype DevlinkDevice struct {\n\tBusName string\n\tDeviceName string\n\tAttrs DevlinkDevAttrs\n}\n\n// DevlinkPortFn represents port function and its attributes\ntype DevlinkPortFn struct {\n\tHwAddr net.HardwareAddr\n\tState uint8\n\tOpState uint8\n}\n\n// DevlinkPortFnSetAttrs represents attributes to set\ntype DevlinkPortFnSetAttrs struct {\n\tFnAttrs DevlinkPortFn\n\tHwAddrValid bool\n\tStateValid bool\n}\n\n// DevlinkPort represents port and its attributes\ntype DevlinkPort struct {\n\tBusName string\n\tDeviceName string\n\tPortIndex uint32\n\tPortType uint16\n\tNetdeviceName string\n\tNetdevIfIndex uint32\n\tRdmaDeviceName string\n\tPortFlavour uint16\n\tFn *DevlinkPortFn\n}\n\ntype DevLinkPortAddAttrs struct {\n\tController uint32\n\tSfNumber uint32\n\tPortIndex uint32\n\tPfNumber uint16\n\tSfNumberValid bool\n\tPortIndexValid bool\n\tControllerValid bool\n}\n\nfunc parseDevLinkDeviceList(msgs [][]byte) ([]*DevlinkDevice, error) {\n\tdevices := make([]*DevlinkDevice, 0, len(msgs))\n\tfor _, m := range msgs {\n\t\tattrs, err := nl.ParseRouteAttr(m[nl.SizeofGenlmsg:])\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tdev := &DevlinkDevice{}\n\t\tif err = dev.parseAttributes(attrs); err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tdevices = append(devices, dev)\n\t}\n\treturn devices, nil\n}\n\nfunc eswitchStringToMode(modeName string) (uint16, error) {\n\tif modeName == \"legacy\" {\n\t\treturn nl.DEVLINK_ESWITCH_MODE_LEGACY, nil\n\t} else if modeName == \"switchdev\" {\n\t\treturn nl.DEVLINK_ESWITCH_MODE_SWITCHDEV, nil\n\t} else {\n\t\treturn 0xffff, fmt.Errorf(\"invalid switchdev mode\")\n\t}\n}\n\nfunc parseEswitchMode(mode uint16) string {\n\tvar eswitchMode = map[uint16]string{\n\t\tnl.DEVLINK_ESWITCH_MODE_LEGACY: \"legacy\",\n\t\tnl.DEVLINK_ESWITCH_MODE_SWITCHDEV: \"switchdev\",\n\t}\n\tif eswitchMode[mode] == \"\" {\n\t\treturn \"unknown\"\n\t} else {\n\t\treturn eswitchMode[mode]\n\t}\n}\n\nfunc parseEswitchInlineMode(inlinemode uint8) string {\n\tvar eswitchInlineMode = map[uint8]string{\n\t\tnl.DEVLINK_ESWITCH_INLINE_MODE_NONE: \"none\",\n\t\tnl.DEVLINK_ESWITCH_INLINE_MODE_LINK: \"link\",\n\t\tnl.DEVLINK_ESWITCH_INLINE_MODE_NETWORK: \"network\",\n\t\tnl.DEVLINK_ESWITCH_INLINE_MODE_TRANSPORT: \"transport\",\n\t}\n\tif eswitchInlineMode[inlinemode] == \"\" {\n\t\treturn \"unknown\"\n\t} else {\n\t\treturn eswitchInlineMode[inlinemode]\n\t}\n}\n\nfunc parseEswitchEncapMode(encapmode uint8) string {\n\tvar eswitchEncapMode = map[uint8]string{\n\t\tnl.DEVLINK_ESWITCH_ENCAP_MODE_NONE: \"disable\",\n\t\tnl.DEVLINK_ESWITCH_ENCAP_MODE_BASIC: \"enable\",\n\t}\n\tif eswitchEncapMode[encapmode] == \"\" {\n\t\treturn \"unknown\"\n\t} else {\n\t\treturn eswitchEncapMode[encapmode]\n\t}\n}\n\nfunc (d *DevlinkDevice) parseAttributes(attrs []syscall.NetlinkRouteAttr) error {\n\tfor _, a := range attrs {\n\t\tswitch a.Attr.Type {\n\t\tcase nl.DEVLINK_ATTR_BUS_NAME:\n\t\t\td.BusName = string(a.Value[:len(a.Value)-1])\n\t\tcase nl.DEVLINK_ATTR_DEV_NAME:\n\t\t\td.DeviceName = string(a.Value[:len(a.Value)-1])\n\t\tcase nl.DEVLINK_ATTR_ESWITCH_MODE:\n\t\t\td.Attrs.Eswitch.Mode = parseEswitchMode(native.Uint16(a.Value))\n\t\tcase nl.DEVLINK_ATTR_ESWITCH_INLINE_MODE:\n\t\t\td.Attrs.Eswitch.InlineMode = parseEswitchInlineMode(uint8(a.Value[0]))\n\t\tcase nl.DEVLINK_ATTR_ESWITCH_ENCAP_MODE:\n\t\t\td.Attrs.Eswitch.EncapMode = parseEswitchEncapMode(uint8(a.Value[0]))\n\t\t}\n\t}\n\treturn nil\n}\n\nfunc (dev *DevlinkDevice) parseEswitchAttrs(msgs [][]byte) {\n\tm := msgs[0]\n\tattrs, err := nl.ParseRouteAttr(m[nl.SizeofGenlmsg:])\n\tif err != nil {\n\t\treturn\n\t}\n\tdev.parseAttributes(attrs)\n}\n\nfunc (h *Handle) getEswitchAttrs(family *GenlFamily, dev *DevlinkDevice) {\n\tmsg := &nl.Genlmsg{\n\t\tCommand: nl.DEVLINK_CMD_ESWITCH_GET,\n\t\tVersion: nl.GENL_DEVLINK_VERSION,\n\t}\n\treq := h.newNetlinkRequest(int(family.ID), unix.NLM_F_REQUEST|unix.NLM_F_ACK)\n\treq.AddData(msg)\n\n\tb := make([]byte, len(dev.BusName))\n\tcopy(b, dev.BusName)\n\tdata := nl.NewRtAttr(nl.DEVLINK_ATTR_BUS_NAME, b)\n\treq.AddData(data)\n\n\tb = make([]byte, len(dev.DeviceName))\n\tcopy(b, dev.DeviceName)\n\tdata = nl.NewRtAttr(nl.DEVLINK_ATTR_DEV_NAME, b)\n\treq.AddData(data)\n\n\tmsgs, err := req.Execute(unix.NETLINK_GENERIC, 0)\n\tif err != nil {\n\t\treturn\n\t}\n\tdev.parseEswitchAttrs(msgs)\n}\n\n// DevLinkGetDeviceList provides a pointer to devlink devices and nil error,\n// otherwise returns an error code.\nfunc (h *Handle) DevLinkGetDeviceList() ([]*DevlinkDevice, error) {\n\tf, err := h.GenlFamilyGet(nl.GENL_DEVLINK_NAME)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tmsg := &nl.Genlmsg{\n\t\tCommand: nl.DEVLINK_CMD_GET,\n\t\tVersion: nl.GENL_DEVLINK_VERSION,\n\t}\n\treq := h.newNetlinkRequest(int(f.ID),\n\t\tunix.NLM_F_REQUEST|unix.NLM_F_ACK|unix.NLM_F_DUMP)\n\treq.AddData(msg)\n\tmsgs, err := req.Execute(unix.NETLINK_GENERIC, 0)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tdevices, err := parseDevLinkDeviceList(msgs)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tfor _, d := range devices {\n\t\th.getEswitchAttrs(f, d)\n\t}\n\treturn devices, nil\n}\n\n// DevLinkGetDeviceList provides a pointer to devlink devices and nil error,\n// otherwise returns an error code.\nfunc DevLinkGetDeviceList() ([]*DevlinkDevice, error) {\n\treturn pkgHandle.DevLinkGetDeviceList()\n}\n\nfunc parseDevlinkDevice(msgs [][]byte) (*DevlinkDevice, error) {\n\tm := msgs[0]\n\tattrs, err := nl.ParseRouteAttr(m[nl.SizeofGenlmsg:])\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tdev := &DevlinkDevice{}\n\tif err = dev.parseAttributes(attrs); err != nil {\n\t\treturn nil, err\n\t}\n\treturn dev, nil\n}\n\nfunc (h *Handle) createCmdReq(cmd uint8, bus string, device string) (*GenlFamily, *nl.NetlinkRequest, error) {\n\tf, err := h.GenlFamilyGet(nl.GENL_DEVLINK_NAME)\n\tif err != nil {\n\t\treturn nil, nil, err\n\t}\n\n\tmsg := &nl.Genlmsg{\n\t\tCommand: cmd,\n\t\tVersion: nl.GENL_DEVLINK_VERSION,\n\t}\n\treq := h.newNetlinkRequest(int(f.ID),\n\t\tunix.NLM_F_REQUEST|unix.NLM_F_ACK)\n\treq.AddData(msg)\n\n\tb := make([]byte, len(bus)+1)\n\tcopy(b, bus)\n\tdata := nl.NewRtAttr(nl.DEVLINK_ATTR_BUS_NAME, b)\n\treq.AddData(data)\n\n\tb = make([]byte, len(device)+1)\n\tcopy(b, device)\n\tdata = nl.NewRtAttr(nl.DEVLINK_ATTR_DEV_NAME, b)\n\treq.AddData(data)\n\n\treturn f, req, nil\n}\n\n// DevlinkGetDeviceByName provides a pointer to devlink device and nil error,\n// otherwise returns an error code.\nfunc (h *Handle) DevLinkGetDeviceByName(Bus string, Device string) (*DevlinkDevice, error) {\n\tf, req, err := h.createCmdReq(nl.DEVLINK_CMD_GET, Bus, Device)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\trespmsg, err := req.Execute(unix.NETLINK_GENERIC, 0)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tdev, err := parseDevlinkDevice(respmsg)\n\tif err == nil {\n\t\th.getEswitchAttrs(f, dev)\n\t}\n\treturn dev, err\n}\n\n// DevlinkGetDeviceByName provides a pointer to devlink device and nil error,\n// otherwise returns an error code.\nfunc DevLinkGetDeviceByName(Bus string, Device string) (*DevlinkDevice, error) {\n\treturn pkgHandle.DevLinkGetDeviceByName(Bus, Device)\n}\n\n// DevLinkSetEswitchMode sets eswitch mode if able to set successfully or\n// returns an error code.\n// Equivalent to: `devlink dev eswitch set $dev mode switchdev`\n// Equivalent to: `devlink dev eswitch set $dev mode legacy`\nfunc (h *Handle) DevLinkSetEswitchMode(Dev *DevlinkDevice, NewMode string) error {\n\tmode, err := eswitchStringToMode(NewMode)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\t_, req, err := h.createCmdReq(nl.DEVLINK_CMD_ESWITCH_SET, Dev.BusName, Dev.DeviceName)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\treq.AddData(nl.NewRtAttr(nl.DEVLINK_ATTR_ESWITCH_MODE, nl.Uint16Attr(mode)))\n\n\t_, err = req.Execute(unix.NETLINK_GENERIC, 0)\n\treturn err\n}\n\n// DevLinkSetEswitchMode sets eswitch mode if able to set successfully or\n// returns an error code.\n// Equivalent to: `devlink dev eswitch set $dev mode switchdev`\n// Equivalent to: `devlink dev eswitch set $dev mode legacy`\nfunc DevLinkSetEswitchMode(Dev *DevlinkDevice, NewMode string) error {\n\treturn pkgHandle.DevLinkSetEswitchMode(Dev, NewMode)\n}\n\nfunc (port *DevlinkPort) parseAttributes(attrs []syscall.NetlinkRouteAttr) error {\n\tfor _, a := range attrs {\n\t\tswitch a.Attr.Type {\n\t\tcase nl.DEVLINK_ATTR_BUS_NAME:\n\t\t\tport.BusName = string(a.Value[:len(a.Value)-1])\n\t\tcase nl.DEVLINK_ATTR_DEV_NAME:\n\t\t\tport.DeviceName = string(a.Value[:len(a.Value)-1])\n\t\tcase nl.DEVLINK_ATTR_PORT_INDEX:\n\t\t\tport.PortIndex = native.Uint32(a.Value)\n\t\tcase nl.DEVLINK_ATTR_PORT_TYPE:\n\t\t\tport.PortType = native.Uint16(a.Value)\n\t\tcase nl.DEVLINK_ATTR_PORT_NETDEV_NAME:\n\t\t\tport.NetdeviceName = string(a.Value[:len(a.Value)-1])\n\t\tcase nl.DEVLINK_ATTR_PORT_NETDEV_IFINDEX:\n\t\t\tport.NetdevIfIndex = native.Uint32(a.Value)\n\t\tcase nl.DEVLINK_ATTR_PORT_IBDEV_NAME:\n\t\t\tport.RdmaDeviceName = string(a.Value[:len(a.Value)-1])\n\t\tcase nl.DEVLINK_ATTR_PORT_FLAVOUR:\n\t\t\tport.PortFlavour = native.Uint16(a.Value)\n\t\tcase nl.DEVLINK_ATTR_PORT_FUNCTION:\n\t\t\tport.Fn = &DevlinkPortFn{}\n\t\t\tfor nested := range nl.ParseAttributes(a.Value) {\n\t\t\t\tswitch nested.Type {\n\t\t\t\tcase nl.DEVLINK_PORT_FUNCTION_ATTR_HW_ADDR:\n\t\t\t\t\tport.Fn.HwAddr = nested.Value[:]\n\t\t\t\tcase nl.DEVLINK_PORT_FN_ATTR_STATE:\n\t\t\t\t\tport.Fn.State = uint8(nested.Value[0])\n\t\t\t\tcase nl.DEVLINK_PORT_FN_ATTR_OPSTATE:\n\t\t\t\t\tport.Fn.OpState = uint8(nested.Value[0])\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn nil\n}\n\nfunc parseDevLinkAllPortList(msgs [][]byte) ([]*DevlinkPort, error) {\n\tports := make([]*DevlinkPort, 0, len(msgs))\n\tfor _, m := range msgs {\n\t\tattrs, err := nl.ParseRouteAttr(m[nl.SizeofGenlmsg:])\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tport := &DevlinkPort{}\n\t\tif err = port.parseAttributes(attrs); err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tports = append(ports, port)\n\t}\n\treturn ports, nil\n}\n\n// DevLinkGetPortList provides a pointer to devlink ports and nil error,\n// otherwise returns an error code.\nfunc (h *Handle) DevLinkGetAllPortList() ([]*DevlinkPort, error) {\n\tf, err := h.GenlFamilyGet(nl.GENL_DEVLINK_NAME)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tmsg := &nl.Genlmsg{\n\t\tCommand: nl.DEVLINK_CMD_PORT_GET,\n\t\tVersion: nl.GENL_DEVLINK_VERSION,\n\t}\n\treq := h.newNetlinkRequest(int(f.ID),\n\t\tunix.NLM_F_REQUEST|unix.NLM_F_ACK|unix.NLM_F_DUMP)\n\treq.AddData(msg)\n\tmsgs, err := req.Execute(unix.NETLINK_GENERIC, 0)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tports, err := parseDevLinkAllPortList(msgs)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn ports, nil\n}\n\n// DevLinkGetPortList provides a pointer to devlink ports and nil error,\n// otherwise returns an error code.\nfunc DevLinkGetAllPortList() ([]*DevlinkPort, error) {\n\treturn pkgHandle.DevLinkGetAllPortList()\n}\n\nfunc parseDevlinkPortMsg(msgs [][]byte) (*DevlinkPort, error) {\n\tm := msgs[0]\n\tattrs, err := nl.ParseRouteAttr(m[nl.SizeofGenlmsg:])\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tport := &DevlinkPort{}\n\tif err = port.parseAttributes(attrs); err != nil {\n\t\treturn nil, err\n\t}\n\treturn port, nil\n}\n\n// DevLinkGetPortByIndexprovides a pointer to devlink device and nil error,\n// otherwise returns an error code.\nfunc (h *Handle) DevLinkGetPortByIndex(Bus string, Device string, PortIndex uint32) (*DevlinkPort, error) {\n\n\t_, req, err := h.createCmdReq(nl.DEVLINK_CMD_PORT_GET, Bus, Device)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\treq.AddData(nl.NewRtAttr(nl.DEVLINK_ATTR_PORT_INDEX, nl.Uint32Attr(PortIndex)))\n\n\trespmsg, err := req.Execute(unix.NETLINK_GENERIC, 0)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tport, err := parseDevlinkPortMsg(respmsg)\n\treturn port, err\n}\n\n// DevLinkGetPortByIndex provides a pointer to devlink portand nil error,\n// otherwise returns an error code.\nfunc DevLinkGetPortByIndex(Bus string, Device string, PortIndex uint32) (*DevlinkPort, error) {\n\treturn pkgHandle.DevLinkGetPortByIndex(Bus, Device, PortIndex)\n}\n\n// DevLinkPortAdd adds a devlink port and returns a port on success\n// otherwise returns nil port and an error code.\nfunc (h *Handle) DevLinkPortAdd(Bus string, Device string, Flavour uint16, Attrs DevLinkPortAddAttrs) (*DevlinkPort, error) {\n\t_, req, err := h.createCmdReq(nl.DEVLINK_CMD_PORT_NEW, Bus, Device)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\treq.AddData(nl.NewRtAttr(nl.DEVLINK_ATTR_PORT_FLAVOUR, nl.Uint16Attr(Flavour)))\n\n\treq.AddData(nl.NewRtAttr(nl.DEVLINK_ATTR_PORT_PCI_PF_NUMBER, nl.Uint16Attr(Attrs.PfNumber)))\n\tif Flavour == nl.DEVLINK_PORT_FLAVOUR_PCI_SF && Attrs.SfNumberValid {\n\t\treq.AddData(nl.NewRtAttr(nl.DEVLINK_ATTR_PORT_PCI_SF_NUMBER, nl.Uint32Attr(Attrs.SfNumber)))\n\t}\n\tif Attrs.PortIndexValid {\n\t\treq.AddData(nl.NewRtAttr(nl.DEVLINK_ATTR_PORT_INDEX, nl.Uint32Attr(Attrs.PortIndex)))\n\t}\n\tif Attrs.ControllerValid {\n\t\treq.AddData(nl.NewRtAttr(nl.DEVLINK_ATTR_PORT_CONTROLLER_NUMBER, nl.Uint32Attr(Attrs.Controller)))\n\t}\n\trespmsg, err := req.Execute(unix.NETLINK_GENERIC, 0)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tport, err := parseDevlinkPortMsg(respmsg)\n\treturn port, err\n}\n\n// DevLinkPortAdd adds a devlink port and returns a port on success\n// otherwise returns nil port and an error code.\nfunc DevLinkPortAdd(Bus string, Device string, Flavour uint16, Attrs DevLinkPortAddAttrs) (*DevlinkPort, error) {\n\treturn pkgHandle.DevLinkPortAdd(Bus, Device, Flavour, Attrs)\n}\n\n// DevLinkPortDel deletes a devlink port and returns success or error code.\nfunc (h *Handle) DevLinkPortDel(Bus string, Device string, PortIndex uint32) error {\n\t_, req, err := h.createCmdReq(nl.DEVLINK_CMD_PORT_DEL, Bus, Device)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\treq.AddData(nl.NewRtAttr(nl.DEVLINK_ATTR_PORT_INDEX, nl.Uint32Attr(PortIndex)))\n\t_, err = req.Execute(unix.NETLINK_GENERIC, 0)\n\treturn err\n}\n\n// DevLinkPortDel deletes a devlink port and returns success or error code.\nfunc DevLinkPortDel(Bus string, Device string, PortIndex uint32) error {\n\treturn pkgHandle.DevLinkPortDel(Bus, Device, PortIndex)\n}\n\n// DevlinkPortFnSet sets one or more port function attributes specified by the attribute mask.\n// It returns 0 on success or error code.\nfunc (h *Handle) DevlinkPortFnSet(Bus string, Device string, PortIndex uint32, FnAttrs DevlinkPortFnSetAttrs) error {\n\t_, req, err := h.createCmdReq(nl.DEVLINK_CMD_PORT_SET, Bus, Device)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\treq.AddData(nl.NewRtAttr(nl.DEVLINK_ATTR_PORT_INDEX, nl.Uint32Attr(PortIndex)))\n\n\tfnAttr := nl.NewRtAttr(nl.DEVLINK_ATTR_PORT_FUNCTION|unix.NLA_F_NESTED, nil)\n\n\tif FnAttrs.HwAddrValid == true {\n\t\tfnAttr.AddRtAttr(nl.DEVLINK_PORT_FUNCTION_ATTR_HW_ADDR, []byte(FnAttrs.FnAttrs.HwAddr))\n\t}\n\n\tif FnAttrs.StateValid == true {\n\t\tfnAttr.AddRtAttr(nl.DEVLINK_PORT_FN_ATTR_STATE, nl.Uint8Attr(FnAttrs.FnAttrs.State))\n\t}\n\treq.AddData(fnAttr)\n\n\t_, err = req.Execute(unix.NETLINK_GENERIC, 0)\n\treturn err\n}\n\n// DevlinkPortFnSet sets one or more port function attributes specified by the attribute mask.\n// It returns 0 on success or error code.\nfunc DevlinkPortFnSet(Bus string, Device string, PortIndex uint32, FnAttrs DevlinkPortFnSetAttrs) error {\n\treturn pkgHandle.DevlinkPortFnSet(Bus, Device, PortIndex, FnAttrs)\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/filter.go", "content": "package netlink\n\nimport (\n\t\"fmt\"\n\t\"net\"\n)\n\ntype Filter interface {\n\tAttrs() *FilterAttrs\n\tType() string\n}\n\n// FilterAttrs represents a netlink filter. A filter is associated with a link,\n// has a handle and a parent. The root filter of a device should have a\n// parent == HANDLE_ROOT.\ntype FilterAttrs struct {\n\tLinkIndex int\n\tHandle uint32\n\tParent uint32\n\tPriority uint16 // lower is higher priority\n\tProtocol uint16 // unix.ETH_P_*\n}\n\nfunc (q FilterAttrs) String() string {\n\treturn fmt.Sprintf(\"{LinkIndex: %d, Handle: %s, Parent: %s, Priority: %d, Protocol: %d}\", q.LinkIndex, HandleStr(q.Handle), HandleStr(q.Parent), q.Priority, q.Protocol)\n}\n\ntype TcAct int32\n\nconst (\n\tTC_ACT_UNSPEC TcAct = -1\n\tTC_ACT_OK TcAct = 0\n\tTC_ACT_RECLASSIFY TcAct = 1\n\tTC_ACT_SHOT TcAct = 2\n\tTC_ACT_PIPE TcAct = 3\n\tTC_ACT_STOLEN TcAct = 4\n\tTC_ACT_QUEUED TcAct = 5\n\tTC_ACT_REPEAT TcAct = 6\n\tTC_ACT_REDIRECT TcAct = 7\n\tTC_ACT_JUMP TcAct = 0x10000000\n)\n\nfunc (a TcAct) String() string {\n\tswitch a {\n\tcase TC_ACT_UNSPEC:\n\t\treturn \"unspec\"\n\tcase TC_ACT_OK:\n\t\treturn \"ok\"\n\tcase TC_ACT_RECLASSIFY:\n\t\treturn \"reclassify\"\n\tcase TC_ACT_SHOT:\n\t\treturn \"shot\"\n\tcase TC_ACT_PIPE:\n\t\treturn \"pipe\"\n\tcase TC_ACT_STOLEN:\n\t\treturn \"stolen\"\n\tcase TC_ACT_QUEUED:\n\t\treturn \"queued\"\n\tcase TC_ACT_REPEAT:\n\t\treturn \"repeat\"\n\tcase TC_ACT_REDIRECT:\n\t\treturn \"redirect\"\n\tcase TC_ACT_JUMP:\n\t\treturn \"jump\"\n\t}\n\treturn fmt.Sprintf(\"0x%x\", int32(a))\n}\n\ntype TcPolAct int32\n\nconst (\n\tTC_POLICE_UNSPEC TcPolAct = TcPolAct(TC_ACT_UNSPEC)\n\tTC_POLICE_OK TcPolAct = TcPolAct(TC_ACT_OK)\n\tTC_POLICE_RECLASSIFY TcPolAct = TcPolAct(TC_ACT_RECLASSIFY)\n\tTC_POLICE_SHOT TcPolAct = TcPolAct(TC_ACT_SHOT)\n\tTC_POLICE_PIPE TcPolAct = TcPolAct(TC_ACT_PIPE)\n)\n\nfunc (a TcPolAct) String() string {\n\tswitch a {\n\tcase TC_POLICE_UNSPEC:\n\t\treturn \"unspec\"\n\tcase TC_POLICE_OK:\n\t\treturn \"ok\"\n\tcase TC_POLICE_RECLASSIFY:\n\t\treturn \"reclassify\"\n\tcase TC_POLICE_SHOT:\n\t\treturn \"shot\"\n\tcase TC_POLICE_PIPE:\n\t\treturn \"pipe\"\n\t}\n\treturn fmt.Sprintf(\"0x%x\", int32(a))\n}\n\ntype ActionAttrs struct {\n\tIndex int\n\tCapab int\n\tAction TcAct\n\tRefcnt int\n\tBindcnt int\n}\n\nfunc (q ActionAttrs) String() string {\n\treturn fmt.Sprintf(\"{Index: %d, Capab: %x, Action: %s, Refcnt: %d, Bindcnt: %d}\", q.Index, q.Capab, q.Action.String(), q.Refcnt, q.Bindcnt)\n}\n\n// Action represents an action in any supported filter.\ntype Action interface {\n\tAttrs() *ActionAttrs\n\tType() string\n}\n\ntype GenericAction struct {\n\tActionAttrs\n}\n\nfunc (action *GenericAction) Type() string {\n\treturn \"generic\"\n}\n\nfunc (action *GenericAction) Attrs() *ActionAttrs {\n\treturn &action.ActionAttrs\n}\n\ntype BpfAction struct {\n\tActionAttrs\n\tFd int\n\tName string\n}\n\nfunc (action *BpfAction) Type() string {\n\treturn \"bpf\"\n}\n\nfunc (action *BpfAction) Attrs() *ActionAttrs {\n\treturn &action.ActionAttrs\n}\n\ntype ConnmarkAction struct {\n\tActionAttrs\n\tZone uint16\n}\n\nfunc (action *ConnmarkAction) Type() string {\n\treturn \"connmark\"\n}\n\nfunc (action *ConnmarkAction) Attrs() *ActionAttrs {\n\treturn &action.ActionAttrs\n}\n\nfunc NewConnmarkAction() *ConnmarkAction {\n\treturn &ConnmarkAction{\n\t\tActionAttrs: ActionAttrs{\n\t\t\tAction: TC_ACT_PIPE,\n\t\t},\n\t}\n}\n\ntype MirredAct uint8\n\nfunc (a MirredAct) String() string {\n\tswitch a {\n\tcase TCA_EGRESS_REDIR:\n\t\treturn \"egress redir\"\n\tcase TCA_EGRESS_MIRROR:\n\t\treturn \"egress mirror\"\n\tcase TCA_INGRESS_REDIR:\n\t\treturn \"ingress redir\"\n\tcase TCA_INGRESS_MIRROR:\n\t\treturn \"ingress mirror\"\n\t}\n\treturn \"unknown\"\n}\n\nconst (\n\tTCA_EGRESS_REDIR MirredAct = 1 /* packet redirect to EGRESS*/\n\tTCA_EGRESS_MIRROR MirredAct = 2 /* mirror packet to EGRESS */\n\tTCA_INGRESS_REDIR MirredAct = 3 /* packet redirect to INGRESS*/\n\tTCA_INGRESS_MIRROR MirredAct = 4 /* mirror packet to INGRESS */\n)\n\ntype MirredAction struct {\n\tActionAttrs\n\tMirredAction MirredAct\n\tIfindex int\n}\n\nfunc (action *MirredAction) Type() string {\n\treturn \"mirred\"\n}\n\nfunc (action *MirredAction) Attrs() *ActionAttrs {\n\treturn &action.ActionAttrs\n}\n\nfunc NewMirredAction(redirIndex int) *MirredAction {\n\treturn &MirredAction{\n\t\tActionAttrs: ActionAttrs{\n\t\t\tAction: TC_ACT_STOLEN,\n\t\t},\n\t\tMirredAction: TCA_EGRESS_REDIR,\n\t\tIfindex: redirIndex,\n\t}\n}\n\ntype TunnelKeyAct int8\n\nconst (\n\tTCA_TUNNEL_KEY_SET TunnelKeyAct = 1 // set tunnel key\n\tTCA_TUNNEL_KEY_UNSET TunnelKeyAct = 2 // unset tunnel key\n)\n\ntype TunnelKeyAction struct {\n\tActionAttrs\n\tAction TunnelKeyAct\n\tSrcAddr net.IP\n\tDstAddr net.IP\n\tKeyID uint32\n\tDestPort uint16\n}\n\nfunc (action *TunnelKeyAction) Type() string {\n\treturn \"tunnel_key\"\n}\n\nfunc (action *TunnelKeyAction) Attrs() *ActionAttrs {\n\treturn &action.ActionAttrs\n}\n\nfunc NewTunnelKeyAction() *TunnelKeyAction {\n\treturn &TunnelKeyAction{\n\t\tActionAttrs: ActionAttrs{\n\t\t\tAction: TC_ACT_PIPE,\n\t\t},\n\t}\n}\n\ntype SkbEditAction struct {\n\tActionAttrs\n\tQueueMapping *uint16\n\tPType *uint16\n\tPriority *uint32\n\tMark *uint32\n}\n\nfunc (action *SkbEditAction) Type() string {\n\treturn \"skbedit\"\n}\n\nfunc (action *SkbEditAction) Attrs() *ActionAttrs {\n\treturn &action.ActionAttrs\n}\n\nfunc NewSkbEditAction() *SkbEditAction {\n\treturn &SkbEditAction{\n\t\tActionAttrs: ActionAttrs{\n\t\t\tAction: TC_ACT_PIPE,\n\t\t},\n\t}\n}\n\n// MatchAll filters match all packets\ntype MatchAll struct {\n\tFilterAttrs\n\tClassId uint32\n\tActions []Action\n}\n\nfunc (filter *MatchAll) Attrs() *FilterAttrs {\n\treturn &filter.FilterAttrs\n}\n\nfunc (filter *MatchAll) Type() string {\n\treturn \"matchall\"\n}\n\ntype FilterFwAttrs struct {\n\tClassId uint32\n\tInDev string\n\tMask uint32\n\tIndex uint32\n\tBuffer uint32\n\tMtu uint32\n\tMpu uint16\n\tRate uint32\n\tAvRate uint32\n\tPeakRate uint32\n\tAction TcPolAct\n\tOverhead uint16\n\tLinkLayer int\n}\n\ntype BpfFilter struct {\n\tFilterAttrs\n\tClassId uint32\n\tFd int\n\tName string\n\tDirectAction bool\n\tId int\n\tTag string\n}\n\nfunc (filter *BpfFilter) Type() string {\n\treturn \"bpf\"\n}\n\nfunc (filter *BpfFilter) Attrs() *FilterAttrs {\n\treturn &filter.FilterAttrs\n}\n\n// GenericFilter filters represent types that are not currently understood\n// by this netlink library.\ntype GenericFilter struct {\n\tFilterAttrs\n\tFilterType string\n}\n\nfunc (filter *GenericFilter) Attrs() *FilterAttrs {\n\treturn &filter.FilterAttrs\n}\n\nfunc (filter *GenericFilter) Type() string {\n\treturn filter.FilterType\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/filter_linux.go", "content": "package netlink\n\nimport (\n\t\"bytes\"\n\t\"encoding/binary\"\n\t\"encoding/hex\"\n\t\"errors\"\n\t\"fmt\"\n\t\"syscall\"\n\n\t\"github.com/vishvananda/netlink/nl\"\n\t\"golang.org/x/sys/unix\"\n)\n\n// Constants used in TcU32Sel.Flags.\nconst (\n\tTC_U32_TERMINAL = nl.TC_U32_TERMINAL\n\tTC_U32_OFFSET = nl.TC_U32_OFFSET\n\tTC_U32_VAROFFSET = nl.TC_U32_VAROFFSET\n\tTC_U32_EAT = nl.TC_U32_EAT\n)\n\n// Sel of the U32 filters that contains multiple TcU32Key. This is the type\n// alias and the frontend representation of nl.TcU32Sel. It is serialized into\n// canonical nl.TcU32Sel with the appropriate endianness.\ntype TcU32Sel = nl.TcU32Sel\n\n// TcU32Key contained of Sel in the U32 filters. This is the type alias and the\n// frontend representation of nl.TcU32Key. It is serialized into chanonical\n// nl.TcU32Sel with the appropriate endianness.\ntype TcU32Key = nl.TcU32Key\n\n// U32 filters on many packet related properties\ntype U32 struct {\n\tFilterAttrs\n\tClassId uint32\n\tDivisor uint32 // Divisor MUST be power of 2.\n\tHash uint32\n\tLink uint32\n\tRedirIndex int\n\tSel *TcU32Sel\n\tActions []Action\n}\n\nfunc (filter *U32) Attrs() *FilterAttrs {\n\treturn &filter.FilterAttrs\n}\n\nfunc (filter *U32) Type() string {\n\treturn \"u32\"\n}\n\n// Fw filter filters on firewall marks\n// NOTE: this is in filter_linux because it refers to nl.TcPolice which\n// is defined in nl/tc_linux.go\ntype Fw struct {\n\tFilterAttrs\n\tClassId uint32\n\t// TODO remove nl type from interface\n\tPolice nl.TcPolice\n\tInDev string\n\t// TODO Action\n\tMask uint32\n\tAvRate uint32\n\tRtab [256]uint32\n\tPtab [256]uint32\n}\n\nfunc NewFw(attrs FilterAttrs, fattrs FilterFwAttrs) (*Fw, error) {\n\tvar rtab [256]uint32\n\tvar ptab [256]uint32\n\trcellLog := -1\n\tpcellLog := -1\n\tavrate := fattrs.AvRate / 8\n\tpolice := nl.TcPolice{}\n\tpolice.Rate.Rate = fattrs.Rate / 8\n\tpolice.PeakRate.Rate = fattrs.PeakRate / 8\n\tbuffer := fattrs.Buffer\n\tlinklayer := nl.LINKLAYER_ETHERNET\n\n\tif fattrs.LinkLayer != nl.LINKLAYER_UNSPEC {\n\t\tlinklayer = fattrs.LinkLayer\n\t}\n\n\tpolice.Action = int32(fattrs.Action)\n\tif police.Rate.Rate != 0 {\n\t\tpolice.Rate.Mpu = fattrs.Mpu\n\t\tpolice.Rate.Overhead = fattrs.Overhead\n\t\tif CalcRtable(&police.Rate, rtab[:], rcellLog, fattrs.Mtu, linklayer) < 0 {\n\t\t\treturn nil, errors.New(\"TBF: failed to calculate rate table\")\n\t\t}\n\t\tpolice.Burst = Xmittime(uint64(police.Rate.Rate), uint32(buffer))\n\t}\n\tpolice.Mtu = fattrs.Mtu\n\tif police.PeakRate.Rate != 0 {\n\t\tpolice.PeakRate.Mpu = fattrs.Mpu\n\t\tpolice.PeakRate.Overhead = fattrs.Overhead\n\t\tif CalcRtable(&police.PeakRate, ptab[:], pcellLog, fattrs.Mtu, linklayer) < 0 {\n\t\t\treturn nil, errors.New(\"POLICE: failed to calculate peak rate table\")\n\t\t}\n\t}\n\n\treturn &Fw{\n\t\tFilterAttrs: attrs,\n\t\tClassId: fattrs.ClassId,\n\t\tInDev: fattrs.InDev,\n\t\tMask: fattrs.Mask,\n\t\tPolice: police,\n\t\tAvRate: avrate,\n\t\tRtab: rtab,\n\t\tPtab: ptab,\n\t}, nil\n}\n\nfunc (filter *Fw) Attrs() *FilterAttrs {\n\treturn &filter.FilterAttrs\n}\n\nfunc (filter *Fw) Type() string {\n\treturn \"fw\"\n}\n\n// FilterDel will delete a filter from the system.\n// Equivalent to: `tc filter del $filter`\nfunc FilterDel(filter Filter) error {\n\treturn pkgHandle.FilterDel(filter)\n}\n\n// FilterDel will delete a filter from the system.\n// Equivalent to: `tc filter del $filter`\nfunc (h *Handle) FilterDel(filter Filter) error {\n\treq := h.newNetlinkRequest(unix.RTM_DELTFILTER, unix.NLM_F_ACK)\n\tbase := filter.Attrs()\n\tmsg := &nl.TcMsg{\n\t\tFamily: nl.FAMILY_ALL,\n\t\tIfindex: int32(base.LinkIndex),\n\t\tHandle: base.Handle,\n\t\tParent: base.Parent,\n\t\tInfo: MakeHandle(base.Priority, nl.Swap16(base.Protocol)),\n\t}\n\treq.AddData(msg)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// FilterAdd will add a filter to the system.\n// Equivalent to: `tc filter add $filter`\nfunc FilterAdd(filter Filter) error {\n\treturn pkgHandle.FilterAdd(filter)\n}\n\n// FilterAdd will add a filter to the system.\n// Equivalent to: `tc filter add $filter`\nfunc (h *Handle) FilterAdd(filter Filter) error {\n\treturn h.filterModify(filter, unix.NLM_F_CREATE|unix.NLM_F_EXCL)\n}\n\n// FilterReplace will replace a filter.\n// Equivalent to: `tc filter replace $filter`\nfunc FilterReplace(filter Filter) error {\n\treturn pkgHandle.FilterReplace(filter)\n}\n\n// FilterReplace will replace a filter.\n// Equivalent to: `tc filter replace $filter`\nfunc (h *Handle) FilterReplace(filter Filter) error {\n\treturn h.filterModify(filter, unix.NLM_F_CREATE)\n}\n\nfunc (h *Handle) filterModify(filter Filter, flags int) error {\n\treq := h.newNetlinkRequest(unix.RTM_NEWTFILTER, flags|unix.NLM_F_ACK)\n\tbase := filter.Attrs()\n\tmsg := &nl.TcMsg{\n\t\tFamily: nl.FAMILY_ALL,\n\t\tIfindex: int32(base.LinkIndex),\n\t\tHandle: base.Handle,\n\t\tParent: base.Parent,\n\t\tInfo: MakeHandle(base.Priority, nl.Swap16(base.Protocol)),\n\t}\n\treq.AddData(msg)\n\treq.AddData(nl.NewRtAttr(nl.TCA_KIND, nl.ZeroTerminated(filter.Type())))\n\n\toptions := nl.NewRtAttr(nl.TCA_OPTIONS, nil)\n\n\tswitch filter := filter.(type) {\n\tcase *U32:\n\t\tsel := filter.Sel\n\t\tif sel == nil {\n\t\t\t// match all\n\t\t\tsel = &nl.TcU32Sel{\n\t\t\t\tNkeys: 1,\n\t\t\t\tFlags: nl.TC_U32_TERMINAL,\n\t\t\t}\n\t\t\tsel.Keys = append(sel.Keys, nl.TcU32Key{})\n\t\t}\n\n\t\tif native != networkOrder {\n\t\t\t// Copy TcU32Sel.\n\t\t\tcSel := *sel\n\t\t\tkeys := make([]nl.TcU32Key, cap(sel.Keys))\n\t\t\tcopy(keys, sel.Keys)\n\t\t\tcSel.Keys = keys\n\t\t\tsel = &cSel\n\n\t\t\t// Handle the endianness of attributes\n\t\t\tsel.Offmask = native.Uint16(htons(sel.Offmask))\n\t\t\tsel.Hmask = native.Uint32(htonl(sel.Hmask))\n\t\t\tfor i, key := range sel.Keys {\n\t\t\t\tsel.Keys[i].Mask = native.Uint32(htonl(key.Mask))\n\t\t\t\tsel.Keys[i].Val = native.Uint32(htonl(key.Val))\n\t\t\t}\n\t\t}\n\t\tsel.Nkeys = uint8(len(sel.Keys))\n\t\toptions.AddRtAttr(nl.TCA_U32_SEL, sel.Serialize())\n\t\tif filter.ClassId != 0 {\n\t\t\toptions.AddRtAttr(nl.TCA_U32_CLASSID, nl.Uint32Attr(filter.ClassId))\n\t\t}\n\t\tif filter.Divisor != 0 {\n\t\t\tif (filter.Divisor-1)&filter.Divisor != 0 {\n\t\t\t\treturn fmt.Errorf(\"illegal divisor %d. Must be a power of 2\", filter.Divisor)\n\t\t\t}\n\t\t\toptions.AddRtAttr(nl.TCA_U32_DIVISOR, nl.Uint32Attr(filter.Divisor))\n\t\t}\n\t\tif filter.Hash != 0 {\n\t\t\toptions.AddRtAttr(nl.TCA_U32_HASH, nl.Uint32Attr(filter.Hash))\n\t\t}\n\t\tif filter.Link != 0 {\n\t\t\toptions.AddRtAttr(nl.TCA_U32_LINK, nl.Uint32Attr(filter.Link))\n\t\t}\n\t\tactionsAttr := options.AddRtAttr(nl.TCA_U32_ACT, nil)\n\t\t// backwards compatibility\n\t\tif filter.RedirIndex != 0 {\n\t\t\tfilter.Actions = append([]Action{NewMirredAction(filter.RedirIndex)}, filter.Actions...)\n\t\t}\n\t\tif err := EncodeActions(actionsAttr, filter.Actions); err != nil {\n\t\t\treturn err\n\t\t}\n\tcase *Fw:\n\t\tif filter.Mask != 0 {\n\t\t\tb := make([]byte, 4)\n\t\t\tnative.PutUint32(b, filter.Mask)\n\t\t\toptions.AddRtAttr(nl.TCA_FW_MASK, b)\n\t\t}\n\t\tif filter.InDev != \"\" {\n\t\t\toptions.AddRtAttr(nl.TCA_FW_INDEV, nl.ZeroTerminated(filter.InDev))\n\t\t}\n\t\tif (filter.Police != nl.TcPolice{}) {\n\n\t\t\tpolice := options.AddRtAttr(nl.TCA_FW_POLICE, nil)\n\t\t\tpolice.AddRtAttr(nl.TCA_POLICE_TBF, filter.Police.Serialize())\n\t\t\tif (filter.Police.Rate != nl.TcRateSpec{}) {\n\t\t\t\tpayload := SerializeRtab(filter.Rtab)\n\t\t\t\tpolice.AddRtAttr(nl.TCA_POLICE_RATE, payload)\n\t\t\t}\n\t\t\tif (filter.Police.PeakRate != nl.TcRateSpec{}) {\n\t\t\t\tpayload := SerializeRtab(filter.Ptab)\n\t\t\t\tpolice.AddRtAttr(nl.TCA_POLICE_PEAKRATE, payload)\n\t\t\t}\n\t\t}\n\t\tif filter.ClassId != 0 {\n\t\t\tb := make([]byte, 4)\n\t\t\tnative.PutUint32(b, filter.ClassId)\n\t\t\toptions.AddRtAttr(nl.TCA_FW_CLASSID, b)\n\t\t}\n\tcase *BpfFilter:\n\t\tvar bpfFlags uint32\n\t\tif filter.ClassId != 0 {\n\t\t\toptions.AddRtAttr(nl.TCA_BPF_CLASSID, nl.Uint32Attr(filter.ClassId))\n\t\t}\n\t\tif filter.Fd >= 0 {\n\t\t\toptions.AddRtAttr(nl.TCA_BPF_FD, nl.Uint32Attr((uint32(filter.Fd))))\n\t\t}\n\t\tif filter.Name != \"\" {\n\t\t\toptions.AddRtAttr(nl.TCA_BPF_NAME, nl.ZeroTerminated(filter.Name))\n\t\t}\n\t\tif filter.DirectAction {\n\t\t\tbpfFlags |= nl.TCA_BPF_FLAG_ACT_DIRECT\n\t\t}\n\t\toptions.AddRtAttr(nl.TCA_BPF_FLAGS, nl.Uint32Attr(bpfFlags))\n\tcase *MatchAll:\n\t\tactionsAttr := options.AddRtAttr(nl.TCA_MATCHALL_ACT, nil)\n\t\tif err := EncodeActions(actionsAttr, filter.Actions); err != nil {\n\t\t\treturn err\n\t\t}\n\t\tif filter.ClassId != 0 {\n\t\t\toptions.AddRtAttr(nl.TCA_MATCHALL_CLASSID, nl.Uint32Attr(filter.ClassId))\n\t\t}\n\t}\n\n\treq.AddData(options)\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// FilterList gets a list of filters in the system.\n// Equivalent to: `tc filter show`.\n// Generally returns nothing if link and parent are not specified.\nfunc FilterList(link Link, parent uint32) ([]Filter, error) {\n\treturn pkgHandle.FilterList(link, parent)\n}\n\n// FilterList gets a list of filters in the system.\n// Equivalent to: `tc filter show`.\n// Generally returns nothing if link and parent are not specified.\nfunc (h *Handle) FilterList(link Link, parent uint32) ([]Filter, error) {\n\treq := h.newNetlinkRequest(unix.RTM_GETTFILTER, unix.NLM_F_DUMP)\n\tmsg := &nl.TcMsg{\n\t\tFamily: nl.FAMILY_ALL,\n\t\tParent: parent,\n\t}\n\tif link != nil {\n\t\tbase := link.Attrs()\n\t\th.ensureIndex(base)\n\t\tmsg.Ifindex = int32(base.Index)\n\t}\n\treq.AddData(msg)\n\n\tmsgs, err := req.Execute(unix.NETLINK_ROUTE, unix.RTM_NEWTFILTER)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tvar res []Filter\n\tfor _, m := range msgs {\n\t\tmsg := nl.DeserializeTcMsg(m)\n\n\t\tattrs, err := nl.ParseRouteAttr(m[msg.Len():])\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\n\t\tbase := FilterAttrs{\n\t\t\tLinkIndex: int(msg.Ifindex),\n\t\t\tHandle: msg.Handle,\n\t\t\tParent: msg.Parent,\n\t\t}\n\t\tbase.Priority, base.Protocol = MajorMinor(msg.Info)\n\t\tbase.Protocol = nl.Swap16(base.Protocol)\n\n\t\tvar filter Filter\n\t\tfilterType := \"\"\n\t\tdetailed := false\n\t\tfor _, attr := range attrs {\n\t\t\tswitch attr.Attr.Type {\n\t\t\tcase nl.TCA_KIND:\n\t\t\t\tfilterType = string(attr.Value[:len(attr.Value)-1])\n\t\t\t\tswitch filterType {\n\t\t\t\tcase \"u32\":\n\t\t\t\t\tfilter = &U32{}\n\t\t\t\tcase \"fw\":\n\t\t\t\t\tfilter = &Fw{}\n\t\t\t\tcase \"bpf\":\n\t\t\t\t\tfilter = &BpfFilter{}\n\t\t\t\tcase \"matchall\":\n\t\t\t\t\tfilter = &MatchAll{}\n\t\t\t\tdefault:\n\t\t\t\t\tfilter = &GenericFilter{FilterType: filterType}\n\t\t\t\t}\n\t\t\tcase nl.TCA_OPTIONS:\n\t\t\t\tdata, err := nl.ParseRouteAttr(attr.Value)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn nil, err\n\t\t\t\t}\n\t\t\t\tswitch filterType {\n\t\t\t\tcase \"u32\":\n\t\t\t\t\tdetailed, err = parseU32Data(filter, data)\n\t\t\t\t\tif err != nil {\n\t\t\t\t\t\treturn nil, err\n\t\t\t\t\t}\n\t\t\t\tcase \"fw\":\n\t\t\t\t\tdetailed, err = parseFwData(filter, data)\n\t\t\t\t\tif err != nil {\n\t\t\t\t\t\treturn nil, err\n\t\t\t\t\t}\n\t\t\t\tcase \"bpf\":\n\t\t\t\t\tdetailed, err = parseBpfData(filter, data)\n\t\t\t\t\tif err != nil {\n\t\t\t\t\t\treturn nil, err\n\t\t\t\t\t}\n\t\t\t\tcase \"matchall\":\n\t\t\t\t\tdetailed, err = parseMatchAllData(filter, data)\n\t\t\t\t\tif err != nil {\n\t\t\t\t\t\treturn nil, err\n\t\t\t\t\t}\n\t\t\t\tdefault:\n\t\t\t\t\tdetailed = true\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// only return the detailed version of the filter\n\t\tif detailed {\n\t\t\t*filter.Attrs() = base\n\t\t\tres = append(res, filter)\n\t\t}\n\t}\n\n\treturn res, nil\n}\n\nfunc toTcGen(attrs *ActionAttrs, tcgen *nl.TcGen) {\n\ttcgen.Index = uint32(attrs.Index)\n\ttcgen.Capab = uint32(attrs.Capab)\n\ttcgen.Action = int32(attrs.Action)\n\ttcgen.Refcnt = int32(attrs.Refcnt)\n\ttcgen.Bindcnt = int32(attrs.Bindcnt)\n}\n\nfunc toAttrs(tcgen *nl.TcGen, attrs *ActionAttrs) {\n\tattrs.Index = int(tcgen.Index)\n\tattrs.Capab = int(tcgen.Capab)\n\tattrs.Action = TcAct(tcgen.Action)\n\tattrs.Refcnt = int(tcgen.Refcnt)\n\tattrs.Bindcnt = int(tcgen.Bindcnt)\n}\n\nfunc EncodeActions(attr *nl.RtAttr, actions []Action) error {\n\ttabIndex := int(nl.TCA_ACT_TAB)\n\n\tfor _, action := range actions {\n\t\tswitch action := action.(type) {\n\t\tdefault:\n\t\t\treturn fmt.Errorf(\"unknown action type %s\", action.Type())\n\t\tcase *MirredAction:\n\t\t\ttable := attr.AddRtAttr(tabIndex, nil)\n\t\t\ttabIndex++\n\t\t\ttable.AddRtAttr(nl.TCA_ACT_KIND, nl.ZeroTerminated(\"mirred\"))\n\t\t\taopts := table.AddRtAttr(nl.TCA_ACT_OPTIONS, nil)\n\t\t\tmirred := nl.TcMirred{\n\t\t\t\tEaction: int32(action.MirredAction),\n\t\t\t\tIfindex: uint32(action.Ifindex),\n\t\t\t}\n\t\t\ttoTcGen(action.Attrs(), &mirred.TcGen)\n\t\t\taopts.AddRtAttr(nl.TCA_MIRRED_PARMS, mirred.Serialize())\n\t\tcase *TunnelKeyAction:\n\t\t\ttable := attr.AddRtAttr(tabIndex, nil)\n\t\t\ttabIndex++\n\t\t\ttable.AddRtAttr(nl.TCA_ACT_KIND, nl.ZeroTerminated(\"tunnel_key\"))\n\t\t\taopts := table.AddRtAttr(nl.TCA_ACT_OPTIONS, nil)\n\t\t\ttun := nl.TcTunnelKey{\n\t\t\t\tAction: int32(action.Action),\n\t\t\t}\n\t\t\ttoTcGen(action.Attrs(), &tun.TcGen)\n\t\t\taopts.AddRtAttr(nl.TCA_TUNNEL_KEY_PARMS, tun.Serialize())\n\t\t\tif action.Action == TCA_TUNNEL_KEY_SET {\n\t\t\t\taopts.AddRtAttr(nl.TCA_TUNNEL_KEY_ENC_KEY_ID, htonl(action.KeyID))\n\t\t\t\tif v4 := action.SrcAddr.To4(); v4 != nil {\n\t\t\t\t\taopts.AddRtAttr(nl.TCA_TUNNEL_KEY_ENC_IPV4_SRC, v4[:])\n\t\t\t\t} else if v6 := action.SrcAddr.To16(); v6 != nil {\n\t\t\t\t\taopts.AddRtAttr(nl.TCA_TUNNEL_KEY_ENC_IPV6_SRC, v6[:])\n\t\t\t\t} else {\n\t\t\t\t\treturn fmt.Errorf(\"invalid src addr %s for tunnel_key action\", action.SrcAddr)\n\t\t\t\t}\n\t\t\t\tif v4 := action.DstAddr.To4(); v4 != nil {\n\t\t\t\t\taopts.AddRtAttr(nl.TCA_TUNNEL_KEY_ENC_IPV4_DST, v4[:])\n\t\t\t\t} else if v6 := action.DstAddr.To16(); v6 != nil {\n\t\t\t\t\taopts.AddRtAttr(nl.TCA_TUNNEL_KEY_ENC_IPV6_DST, v6[:])\n\t\t\t\t} else {\n\t\t\t\t\treturn fmt.Errorf(\"invalid dst addr %s for tunnel_key action\", action.DstAddr)\n\t\t\t\t}\n\t\t\t\tif action.DestPort != 0 {\n\t\t\t\t\taopts.AddRtAttr(nl.TCA_TUNNEL_KEY_ENC_DST_PORT, htons(action.DestPort))\n\t\t\t\t}\n\t\t\t}\n\t\tcase *SkbEditAction:\n\t\t\ttable := attr.AddRtAttr(tabIndex, nil)\n\t\t\ttabIndex++\n\t\t\ttable.AddRtAttr(nl.TCA_ACT_KIND, nl.ZeroTerminated(\"skbedit\"))\n\t\t\taopts := table.AddRtAttr(nl.TCA_ACT_OPTIONS, nil)\n\t\t\tskbedit := nl.TcSkbEdit{}\n\t\t\ttoTcGen(action.Attrs(), &skbedit.TcGen)\n\t\t\taopts.AddRtAttr(nl.TCA_SKBEDIT_PARMS, skbedit.Serialize())\n\t\t\tif action.QueueMapping != nil {\n\t\t\t\taopts.AddRtAttr(nl.TCA_SKBEDIT_QUEUE_MAPPING, nl.Uint16Attr(*action.QueueMapping))\n\t\t\t}\n\t\t\tif action.Priority != nil {\n\t\t\t\taopts.AddRtAttr(nl.TCA_SKBEDIT_PRIORITY, nl.Uint32Attr(*action.Priority))\n\t\t\t}\n\t\t\tif action.PType != nil {\n\t\t\t\taopts.AddRtAttr(nl.TCA_SKBEDIT_PTYPE, nl.Uint16Attr(*action.PType))\n\t\t\t}\n\t\t\tif action.Mark != nil {\n\t\t\t\taopts.AddRtAttr(nl.TCA_SKBEDIT_MARK, nl.Uint32Attr(*action.Mark))\n\t\t\t}\n\t\tcase *ConnmarkAction:\n\t\t\ttable := attr.AddRtAttr(tabIndex, nil)\n\t\t\ttabIndex++\n\t\t\ttable.AddRtAttr(nl.TCA_ACT_KIND, nl.ZeroTerminated(\"connmark\"))\n\t\t\taopts := table.AddRtAttr(nl.TCA_ACT_OPTIONS, nil)\n\t\t\tconnmark := nl.TcConnmark{\n\t\t\t\tZone: action.Zone,\n\t\t\t}\n\t\t\ttoTcGen(action.Attrs(), &connmark.TcGen)\n\t\t\taopts.AddRtAttr(nl.TCA_CONNMARK_PARMS, connmark.Serialize())\n\t\tcase *BpfAction:\n\t\t\ttable := attr.AddRtAttr(tabIndex, nil)\n\t\t\ttabIndex++\n\t\t\ttable.AddRtAttr(nl.TCA_ACT_KIND, nl.ZeroTerminated(\"bpf\"))\n\t\t\taopts := table.AddRtAttr(nl.TCA_ACT_OPTIONS, nil)\n\t\t\tgen := nl.TcGen{}\n\t\t\ttoTcGen(action.Attrs(), &gen)\n\t\t\taopts.AddRtAttr(nl.TCA_ACT_BPF_PARMS, gen.Serialize())\n\t\t\taopts.AddRtAttr(nl.TCA_ACT_BPF_FD, nl.Uint32Attr(uint32(action.Fd)))\n\t\t\taopts.AddRtAttr(nl.TCA_ACT_BPF_NAME, nl.ZeroTerminated(action.Name))\n\t\tcase *GenericAction:\n\t\t\ttable := attr.AddRtAttr(tabIndex, nil)\n\t\t\ttabIndex++\n\t\t\ttable.AddRtAttr(nl.TCA_ACT_KIND, nl.ZeroTerminated(\"gact\"))\n\t\t\taopts := table.AddRtAttr(nl.TCA_ACT_OPTIONS, nil)\n\t\t\tgen := nl.TcGen{}\n\t\t\ttoTcGen(action.Attrs(), &gen)\n\t\t\taopts.AddRtAttr(nl.TCA_GACT_PARMS, gen.Serialize())\n\t\t}\n\t}\n\treturn nil\n}\n\nfunc parseActions(tables []syscall.NetlinkRouteAttr) ([]Action, error) {\n\tvar actions []Action\n\tfor _, table := range tables {\n\t\tvar action Action\n\t\tvar actionType string\n\t\taattrs, err := nl.ParseRouteAttr(table.Value)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\tnextattr:\n\t\tfor _, aattr := range aattrs {\n\t\t\tswitch aattr.Attr.Type {\n\t\t\tcase nl.TCA_KIND:\n\t\t\t\tactionType = string(aattr.Value[:len(aattr.Value)-1])\n\t\t\t\t// only parse if the action is mirred or bpf\n\t\t\t\tswitch actionType {\n\t\t\t\tcase \"mirred\":\n\t\t\t\t\taction = &MirredAction{}\n\t\t\t\tcase \"bpf\":\n\t\t\t\t\taction = &BpfAction{}\n\t\t\t\tcase \"connmark\":\n\t\t\t\t\taction = &ConnmarkAction{}\n\t\t\t\tcase \"gact\":\n\t\t\t\t\taction = &GenericAction{}\n\t\t\t\tcase \"tunnel_key\":\n\t\t\t\t\taction = &TunnelKeyAction{}\n\t\t\t\tcase \"skbedit\":\n\t\t\t\t\taction = &SkbEditAction{}\n\t\t\t\tdefault:\n\t\t\t\t\tbreak nextattr\n\t\t\t\t}\n\t\t\tcase nl.TCA_OPTIONS:\n\t\t\t\tadata, err := nl.ParseRouteAttr(aattr.Value)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn nil, err\n\t\t\t\t}\n\t\t\t\tfor _, adatum := range adata {\n\t\t\t\t\tswitch actionType {\n\t\t\t\t\tcase \"mirred\":\n\t\t\t\t\t\tswitch adatum.Attr.Type {\n\t\t\t\t\t\tcase nl.TCA_MIRRED_PARMS:\n\t\t\t\t\t\t\tmirred := *nl.DeserializeTcMirred(adatum.Value)\n\t\t\t\t\t\t\taction.(*MirredAction).ActionAttrs = ActionAttrs{}\n\t\t\t\t\t\t\ttoAttrs(&mirred.TcGen, action.Attrs())\n\t\t\t\t\t\t\taction.(*MirredAction).Ifindex = int(mirred.Ifindex)\n\t\t\t\t\t\t\taction.(*MirredAction).MirredAction = MirredAct(mirred.Eaction)\n\t\t\t\t\t\t}\n\t\t\t\t\tcase \"tunnel_key\":\n\t\t\t\t\t\tswitch adatum.Attr.Type {\n\t\t\t\t\t\tcase nl.TCA_TUNNEL_KEY_PARMS:\n\t\t\t\t\t\t\ttun := *nl.DeserializeTunnelKey(adatum.Value)\n\t\t\t\t\t\t\taction.(*TunnelKeyAction).ActionAttrs = ActionAttrs{}\n\t\t\t\t\t\t\ttoAttrs(&tun.TcGen, action.Attrs())\n\t\t\t\t\t\t\taction.(*TunnelKeyAction).Action = TunnelKeyAct(tun.Action)\n\t\t\t\t\t\tcase nl.TCA_TUNNEL_KEY_ENC_KEY_ID:\n\t\t\t\t\t\t\taction.(*TunnelKeyAction).KeyID = networkOrder.Uint32(adatum.Value[0:4])\n\t\t\t\t\t\tcase nl.TCA_TUNNEL_KEY_ENC_IPV6_SRC, nl.TCA_TUNNEL_KEY_ENC_IPV4_SRC:\n\t\t\t\t\t\t\taction.(*TunnelKeyAction).SrcAddr = adatum.Value[:]\n\t\t\t\t\t\tcase nl.TCA_TUNNEL_KEY_ENC_IPV6_DST, nl.TCA_TUNNEL_KEY_ENC_IPV4_DST:\n\t\t\t\t\t\t\taction.(*TunnelKeyAction).DstAddr = adatum.Value[:]\n\t\t\t\t\t\tcase nl.TCA_TUNNEL_KEY_ENC_DST_PORT:\n\t\t\t\t\t\t\taction.(*TunnelKeyAction).DestPort = ntohs(adatum.Value)\n\t\t\t\t\t\t}\n\t\t\t\t\tcase \"skbedit\":\n\t\t\t\t\t\tswitch adatum.Attr.Type {\n\t\t\t\t\t\tcase nl.TCA_SKBEDIT_PARMS:\n\t\t\t\t\t\t\tskbedit := *nl.DeserializeSkbEdit(adatum.Value)\n\t\t\t\t\t\t\taction.(*SkbEditAction).ActionAttrs = ActionAttrs{}\n\t\t\t\t\t\t\ttoAttrs(&skbedit.TcGen, action.Attrs())\n\t\t\t\t\t\tcase nl.TCA_SKBEDIT_MARK:\n\t\t\t\t\t\t\tmark := native.Uint32(adatum.Value[0:4])\n\t\t\t\t\t\t\taction.(*SkbEditAction).Mark = &mark\n\t\t\t\t\t\tcase nl.TCA_SKBEDIT_PRIORITY:\n\t\t\t\t\t\t\tpriority := native.Uint32(adatum.Value[0:4])\n\t\t\t\t\t\t\taction.(*SkbEditAction).Priority = &priority\n\t\t\t\t\t\tcase nl.TCA_SKBEDIT_PTYPE:\n\t\t\t\t\t\t\tptype := native.Uint16(adatum.Value[0:2])\n\t\t\t\t\t\t\taction.(*SkbEditAction).PType = &ptype\n\t\t\t\t\t\tcase nl.TCA_SKBEDIT_QUEUE_MAPPING:\n\t\t\t\t\t\t\tmapping := native.Uint16(adatum.Value[0:2])\n\t\t\t\t\t\t\taction.(*SkbEditAction).QueueMapping = &mapping\n\t\t\t\t\t\t}\n\t\t\t\t\tcase \"bpf\":\n\t\t\t\t\t\tswitch adatum.Attr.Type {\n\t\t\t\t\t\tcase nl.TCA_ACT_BPF_PARMS:\n\t\t\t\t\t\t\tgen := *nl.DeserializeTcGen(adatum.Value)\n\t\t\t\t\t\t\ttoAttrs(&gen, action.Attrs())\n\t\t\t\t\t\tcase nl.TCA_ACT_BPF_FD:\n\t\t\t\t\t\t\taction.(*BpfAction).Fd = int(native.Uint32(adatum.Value[0:4]))\n\t\t\t\t\t\tcase nl.TCA_ACT_BPF_NAME:\n\t\t\t\t\t\t\taction.(*BpfAction).Name = string(adatum.Value[:len(adatum.Value)-1])\n\t\t\t\t\t\t}\n\t\t\t\t\tcase \"connmark\":\n\t\t\t\t\t\tswitch adatum.Attr.Type {\n\t\t\t\t\t\tcase nl.TCA_CONNMARK_PARMS:\n\t\t\t\t\t\t\tconnmark := *nl.DeserializeTcConnmark(adatum.Value)\n\t\t\t\t\t\t\taction.(*ConnmarkAction).ActionAttrs = ActionAttrs{}\n\t\t\t\t\t\t\ttoAttrs(&connmark.TcGen, action.Attrs())\n\t\t\t\t\t\t\taction.(*ConnmarkAction).Zone = connmark.Zone\n\t\t\t\t\t\t}\n\t\t\t\t\tcase \"gact\":\n\t\t\t\t\t\tswitch adatum.Attr.Type {\n\t\t\t\t\t\tcase nl.TCA_GACT_PARMS:\n\t\t\t\t\t\t\tgen := *nl.DeserializeTcGen(adatum.Value)\n\t\t\t\t\t\t\ttoAttrs(&gen, action.Attrs())\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tactions = append(actions, action)\n\t}\n\treturn actions, nil\n}\n\nfunc parseU32Data(filter Filter, data []syscall.NetlinkRouteAttr) (bool, error) {\n\tu32 := filter.(*U32)\n\tdetailed := false\n\tfor _, datum := range data {\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.TCA_U32_SEL:\n\t\t\tdetailed = true\n\t\t\tsel := nl.DeserializeTcU32Sel(datum.Value)\n\t\t\tu32.Sel = sel\n\t\t\tif native != networkOrder {\n\t\t\t\t// Handle the endianness of attributes\n\t\t\t\tu32.Sel.Offmask = native.Uint16(htons(sel.Offmask))\n\t\t\t\tu32.Sel.Hmask = native.Uint32(htonl(sel.Hmask))\n\t\t\t\tfor i, key := range u32.Sel.Keys {\n\t\t\t\t\tu32.Sel.Keys[i].Mask = native.Uint32(htonl(key.Mask))\n\t\t\t\t\tu32.Sel.Keys[i].Val = native.Uint32(htonl(key.Val))\n\t\t\t\t}\n\t\t\t}\n\t\tcase nl.TCA_U32_ACT:\n\t\t\ttables, err := nl.ParseRouteAttr(datum.Value)\n\t\t\tif err != nil {\n\t\t\t\treturn detailed, err\n\t\t\t}\n\t\t\tu32.Actions, err = parseActions(tables)\n\t\t\tif err != nil {\n\t\t\t\treturn detailed, err\n\t\t\t}\n\t\t\tfor _, action := range u32.Actions {\n\t\t\t\tif action, ok := action.(*MirredAction); ok {\n\t\t\t\t\tu32.RedirIndex = int(action.Ifindex)\n\t\t\t\t}\n\t\t\t}\n\t\tcase nl.TCA_U32_CLASSID:\n\t\t\tu32.ClassId = native.Uint32(datum.Value)\n\t\tcase nl.TCA_U32_DIVISOR:\n\t\t\tu32.Divisor = native.Uint32(datum.Value)\n\t\tcase nl.TCA_U32_HASH:\n\t\t\tu32.Hash = native.Uint32(datum.Value)\n\t\tcase nl.TCA_U32_LINK:\n\t\t\tu32.Link = native.Uint32(datum.Value)\n\t\t}\n\t}\n\treturn detailed, nil\n}\n\nfunc parseFwData(filter Filter, data []syscall.NetlinkRouteAttr) (bool, error) {\n\tfw := filter.(*Fw)\n\tdetailed := true\n\tfor _, datum := range data {\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.TCA_FW_MASK:\n\t\t\tfw.Mask = native.Uint32(datum.Value[0:4])\n\t\tcase nl.TCA_FW_CLASSID:\n\t\t\tfw.ClassId = native.Uint32(datum.Value[0:4])\n\t\tcase nl.TCA_FW_INDEV:\n\t\t\tfw.InDev = string(datum.Value[:len(datum.Value)-1])\n\t\tcase nl.TCA_FW_POLICE:\n\t\t\tadata, _ := nl.ParseRouteAttr(datum.Value)\n\t\t\tfor _, aattr := range adata {\n\t\t\t\tswitch aattr.Attr.Type {\n\t\t\t\tcase nl.TCA_POLICE_TBF:\n\t\t\t\t\tfw.Police = *nl.DeserializeTcPolice(aattr.Value)\n\t\t\t\tcase nl.TCA_POLICE_RATE:\n\t\t\t\t\tfw.Rtab = DeserializeRtab(aattr.Value)\n\t\t\t\tcase nl.TCA_POLICE_PEAKRATE:\n\t\t\t\t\tfw.Ptab = DeserializeRtab(aattr.Value)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn detailed, nil\n}\n\nfunc parseBpfData(filter Filter, data []syscall.NetlinkRouteAttr) (bool, error) {\n\tbpf := filter.(*BpfFilter)\n\tdetailed := true\n\tfor _, datum := range data {\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.TCA_BPF_FD:\n\t\t\tbpf.Fd = int(native.Uint32(datum.Value[0:4]))\n\t\tcase nl.TCA_BPF_NAME:\n\t\t\tbpf.Name = string(datum.Value[:len(datum.Value)-1])\n\t\tcase nl.TCA_BPF_CLASSID:\n\t\t\tbpf.ClassId = native.Uint32(datum.Value[0:4])\n\t\tcase nl.TCA_BPF_FLAGS:\n\t\t\tflags := native.Uint32(datum.Value[0:4])\n\t\t\tif (flags & nl.TCA_BPF_FLAG_ACT_DIRECT) != 0 {\n\t\t\t\tbpf.DirectAction = true\n\t\t\t}\n\t\tcase nl.TCA_BPF_ID:\n\t\t\tbpf.Id = int(native.Uint32(datum.Value[0:4]))\n\t\tcase nl.TCA_BPF_TAG:\n\t\t\tbpf.Tag = hex.EncodeToString(datum.Value[:len(datum.Value)-1])\n\t\t}\n\t}\n\treturn detailed, nil\n}\n\nfunc parseMatchAllData(filter Filter, data []syscall.NetlinkRouteAttr) (bool, error) {\n\tmatchall := filter.(*MatchAll)\n\tdetailed := true\n\tfor _, datum := range data {\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.TCA_MATCHALL_CLASSID:\n\t\t\tmatchall.ClassId = native.Uint32(datum.Value[0:4])\n\t\tcase nl.TCA_MATCHALL_ACT:\n\t\t\ttables, err := nl.ParseRouteAttr(datum.Value)\n\t\t\tif err != nil {\n\t\t\t\treturn detailed, err\n\t\t\t}\n\t\t\tmatchall.Actions, err = parseActions(tables)\n\t\t\tif err != nil {\n\t\t\t\treturn detailed, err\n\t\t\t}\n\t\t}\n\t}\n\treturn detailed, nil\n}\n\nfunc AlignToAtm(size uint) uint {\n\tvar linksize, cells int\n\tcells = int(size / nl.ATM_CELL_PAYLOAD)\n\tif (size % nl.ATM_CELL_PAYLOAD) > 0 {\n\t\tcells++\n\t}\n\tlinksize = cells * nl.ATM_CELL_SIZE\n\treturn uint(linksize)\n}\n\nfunc AdjustSize(sz uint, mpu uint, linklayer int) uint {\n\tif sz < mpu {\n\t\tsz = mpu\n\t}\n\tswitch linklayer {\n\tcase nl.LINKLAYER_ATM:\n\t\treturn AlignToAtm(sz)\n\tdefault:\n\t\treturn sz\n\t}\n}\n\nfunc CalcRtable(rate *nl.TcRateSpec, rtab []uint32, cellLog int, mtu uint32, linklayer int) int {\n\tbps := rate.Rate\n\tmpu := rate.Mpu\n\tvar sz uint\n\tif mtu == 0 {\n\t\tmtu = 2047\n\t}\n\tif cellLog < 0 {\n\t\tcellLog = 0\n\t\tfor (mtu >> uint(cellLog)) > 255 {\n\t\t\tcellLog++\n\t\t}\n\t}\n\tfor i := 0; i < 256; i++ {\n\t\tsz = AdjustSize(uint((i+1)<= nl.IPSET_ERR_PRIVATE {\n\t\t\terr = nl.IPSetError(uintptr(errno))\n\t\t}\n\t}\n\treturn\n}\n\nfunc ipsetUnserialize(msgs [][]byte) (result IPSetResult) {\n\tfor _, msg := range msgs {\n\t\tresult.unserialize(msg)\n\t}\n\treturn result\n}\n\nfunc (result *IPSetResult) unserialize(msg []byte) {\n\tresult.Nfgenmsg = nl.DeserializeNfgenmsg(msg)\n\n\tfor attr := range nl.ParseAttributes(msg[4:]) {\n\t\tswitch attr.Type {\n\t\tcase nl.IPSET_ATTR_PROTOCOL:\n\t\t\tresult.Protocol = attr.Value[0]\n\t\tcase nl.IPSET_ATTR_SETNAME:\n\t\t\tresult.SetName = nl.BytesToString(attr.Value)\n\t\tcase nl.IPSET_ATTR_COMMENT:\n\t\t\tresult.Comment = nl.BytesToString(attr.Value)\n\t\tcase nl.IPSET_ATTR_TYPENAME:\n\t\t\tresult.TypeName = nl.BytesToString(attr.Value)\n\t\tcase nl.IPSET_ATTR_REVISION:\n\t\t\tresult.Revision = attr.Value[0]\n\t\tcase nl.IPSET_ATTR_FAMILY:\n\t\t\tresult.Family = attr.Value[0]\n\t\tcase nl.IPSET_ATTR_FLAGS:\n\t\t\tresult.Flags = attr.Value[0]\n\t\tcase nl.IPSET_ATTR_DATA | nl.NLA_F_NESTED:\n\t\t\tresult.parseAttrData(attr.Value)\n\t\tcase nl.IPSET_ATTR_ADT | nl.NLA_F_NESTED:\n\t\t\tresult.parseAttrADT(attr.Value)\n\t\tcase nl.IPSET_ATTR_PROTOCOL_MIN:\n\t\t\tresult.ProtocolMinVersion = attr.Value[0]\n\t\tdefault:\n\t\t\tlog.Printf(\"unknown ipset attribute from kernel: %+v %v\", attr, attr.Type&nl.NLA_TYPE_MASK)\n\t\t}\n\t}\n}\n\nfunc (result *IPSetResult) parseAttrData(data []byte) {\n\tfor attr := range nl.ParseAttributes(data) {\n\t\tswitch attr.Type {\n\t\tcase nl.IPSET_ATTR_HASHSIZE | nl.NLA_F_NET_BYTEORDER:\n\t\t\tresult.HashSize = attr.Uint32()\n\t\tcase nl.IPSET_ATTR_MAXELEM | nl.NLA_F_NET_BYTEORDER:\n\t\t\tresult.MaxElements = attr.Uint32()\n\t\tcase nl.IPSET_ATTR_TIMEOUT | nl.NLA_F_NET_BYTEORDER:\n\t\t\tval := attr.Uint32()\n\t\t\tresult.Timeout = &val\n\t\tcase nl.IPSET_ATTR_ELEMENTS | nl.NLA_F_NET_BYTEORDER:\n\t\t\tresult.NumEntries = attr.Uint32()\n\t\tcase nl.IPSET_ATTR_REFERENCES | nl.NLA_F_NET_BYTEORDER:\n\t\t\tresult.References = attr.Uint32()\n\t\tcase nl.IPSET_ATTR_MEMSIZE | nl.NLA_F_NET_BYTEORDER:\n\t\t\tresult.SizeInMemory = attr.Uint32()\n\t\tcase nl.IPSET_ATTR_CADT_FLAGS | nl.NLA_F_NET_BYTEORDER:\n\t\t\tresult.CadtFlags = attr.Uint32()\n\t\tcase nl.IPSET_ATTR_IP | nl.NLA_F_NESTED:\n\t\t\tfor nested := range nl.ParseAttributes(attr.Value) {\n\t\t\t\tswitch nested.Type {\n\t\t\t\tcase nl.IPSET_ATTR_IP | nl.NLA_F_NET_BYTEORDER:\n\t\t\t\t\tresult.Entries = append(result.Entries, IPSetEntry{IP: nested.Value})\n\t\t\t\t}\n\t\t\t}\n\t\tcase nl.IPSET_ATTR_CADT_LINENO | nl.NLA_F_NET_BYTEORDER:\n\t\t\tresult.LineNo = attr.Uint32()\n\t\tcase nl.IPSET_ATTR_COMMENT:\n\t\t\tresult.Comment = nl.BytesToString(attr.Value)\n\t\tdefault:\n\t\t\tlog.Printf(\"unknown ipset data attribute from kernel: %+v %v\", attr, attr.Type&nl.NLA_TYPE_MASK)\n\t\t}\n\t}\n}\n\nfunc (result *IPSetResult) parseAttrADT(data []byte) {\n\tfor attr := range nl.ParseAttributes(data) {\n\t\tswitch attr.Type {\n\t\tcase nl.IPSET_ATTR_DATA | nl.NLA_F_NESTED:\n\t\t\tresult.Entries = append(result.Entries, parseIPSetEntry(attr.Value))\n\t\tdefault:\n\t\t\tlog.Printf(\"unknown ADT attribute from kernel: %+v %v\", attr, attr.Type&nl.NLA_TYPE_MASK)\n\t\t}\n\t}\n}\n\nfunc parseIPSetEntry(data []byte) (entry IPSetEntry) {\n\tfor attr := range nl.ParseAttributes(data) {\n\t\tswitch attr.Type {\n\t\tcase nl.IPSET_ATTR_TIMEOUT | nl.NLA_F_NET_BYTEORDER:\n\t\t\tval := attr.Uint32()\n\t\t\tentry.Timeout = &val\n\t\tcase nl.IPSET_ATTR_BYTES | nl.NLA_F_NET_BYTEORDER:\n\t\t\tval := attr.Uint64()\n\t\t\tentry.Bytes = &val\n\t\tcase nl.IPSET_ATTR_PACKETS | nl.NLA_F_NET_BYTEORDER:\n\t\t\tval := attr.Uint64()\n\t\t\tentry.Packets = &val\n\t\tcase nl.IPSET_ATTR_ETHER:\n\t\t\tentry.MAC = net.HardwareAddr(attr.Value)\n\t\tcase nl.IPSET_ATTR_IP:\n\t\t\tentry.IP = net.IP(attr.Value)\n\t\tcase nl.IPSET_ATTR_COMMENT:\n\t\t\tentry.Comment = nl.BytesToString(attr.Value)\n\t\tcase nl.IPSET_ATTR_IP | nl.NLA_F_NESTED:\n\t\t\tfor attr := range nl.ParseAttributes(attr.Value) {\n\t\t\t\tswitch attr.Type {\n\t\t\t\tcase nl.IPSET_ATTR_IP:\n\t\t\t\t\tentry.IP = net.IP(attr.Value)\n\t\t\t\tdefault:\n\t\t\t\t\tlog.Printf(\"unknown nested ADT attribute from kernel: %+v\", attr)\n\t\t\t\t}\n\t\t\t}\n\t\tdefault:\n\t\t\tlog.Printf(\"unknown ADT attribute from kernel: %+v\", attr)\n\t\t}\n\t}\n\treturn\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/link.go", "content": "package netlink\n\nimport (\n\t\"fmt\"\n\t\"net\"\n\t\"os\"\n\t\"strconv\"\n)\n\n// Link represents a link device from netlink. Shared link attributes\n// like name may be retrieved using the Attrs() method. Unique data\n// can be retrieved by casting the object to the proper type.\ntype Link interface {\n\tAttrs() *LinkAttrs\n\tType() string\n}\n\ntype (\n\tNsPid int\n\tNsFd int\n)\n\n// LinkAttrs represents data shared by most link types\ntype LinkAttrs struct {\n\tIndex int\n\tMTU int\n\tTxQLen int // Transmit Queue Length\n\tName string\n\tHardwareAddr net.HardwareAddr\n\tFlags net.Flags\n\tRawFlags uint32\n\tParentIndex int // index of the parent link device\n\tMasterIndex int // must be the index of a bridge\n\tNamespace interface{} // nil | NsPid | NsFd\n\tAlias string\n\tStatistics *LinkStatistics\n\tPromisc int\n\tAllmulti int\n\tMulti int\n\tXdp *LinkXdp\n\tEncapType string\n\tProtinfo *Protinfo\n\tOperState LinkOperState\n\tPhysSwitchID int\n\tNetNsID int\n\tNumTxQueues int\n\tNumRxQueues int\n\tGSOMaxSize uint32\n\tGSOMaxSegs uint32\n\tVfs []VfInfo // virtual functions available on link\n\tGroup uint32\n\tSlave LinkSlave\n}\n\n// LinkSlave represents a slave device.\ntype LinkSlave interface {\n\tSlaveType() string\n}\n\n// VfInfo represents configuration of virtual function\ntype VfInfo struct {\n\tID int\n\tMac net.HardwareAddr\n\tVlan int\n\tQos int\n\tTxRate int // IFLA_VF_TX_RATE Max TxRate\n\tSpoofchk bool\n\tLinkState uint32\n\tMaxTxRate uint32 // IFLA_VF_RATE Max TxRate\n\tMinTxRate uint32 // IFLA_VF_RATE Min TxRate\n\tRxPackets uint64\n\tTxPackets uint64\n\tRxBytes uint64\n\tTxBytes uint64\n\tMulticast uint64\n\tBroadcast uint64\n\tRxDropped uint64\n\tTxDropped uint64\n\n\tRssQuery uint32\n\tTrust uint32\n}\n\n// LinkOperState represents the values of the IFLA_OPERSTATE link\n// attribute, which contains the RFC2863 state of the interface.\ntype LinkOperState uint8\n\nconst (\n\tOperUnknown = iota // Status can't be determined.\n\tOperNotPresent // Some component is missing.\n\tOperDown // Down.\n\tOperLowerLayerDown // Down due to state of lower layer.\n\tOperTesting // In some test mode.\n\tOperDormant // Not up but pending an external event.\n\tOperUp // Up, ready to send packets.\n)\n\nfunc (s LinkOperState) String() string {\n\tswitch s {\n\tcase OperNotPresent:\n\t\treturn \"not-present\"\n\tcase OperDown:\n\t\treturn \"down\"\n\tcase OperLowerLayerDown:\n\t\treturn \"lower-layer-down\"\n\tcase OperTesting:\n\t\treturn \"testing\"\n\tcase OperDormant:\n\t\treturn \"dormant\"\n\tcase OperUp:\n\t\treturn \"up\"\n\tdefault:\n\t\treturn \"unknown\"\n\t}\n}\n\n// NewLinkAttrs returns LinkAttrs structure filled with default values\nfunc NewLinkAttrs() LinkAttrs {\n\treturn LinkAttrs{\n\t\tNetNsID: -1,\n\t\tTxQLen: -1,\n\t}\n}\n\ntype LinkStatistics LinkStatistics64\n\n/*\nRef: struct rtnl_link_stats {...}\n*/\ntype LinkStatistics32 struct {\n\tRxPackets uint32\n\tTxPackets uint32\n\tRxBytes uint32\n\tTxBytes uint32\n\tRxErrors uint32\n\tTxErrors uint32\n\tRxDropped uint32\n\tTxDropped uint32\n\tMulticast uint32\n\tCollisions uint32\n\tRxLengthErrors uint32\n\tRxOverErrors uint32\n\tRxCrcErrors uint32\n\tRxFrameErrors uint32\n\tRxFifoErrors uint32\n\tRxMissedErrors uint32\n\tTxAbortedErrors uint32\n\tTxCarrierErrors uint32\n\tTxFifoErrors uint32\n\tTxHeartbeatErrors uint32\n\tTxWindowErrors uint32\n\tRxCompressed uint32\n\tTxCompressed uint32\n}\n\nfunc (s32 LinkStatistics32) to64() *LinkStatistics64 {\n\treturn &LinkStatistics64{\n\t\tRxPackets: uint64(s32.RxPackets),\n\t\tTxPackets: uint64(s32.TxPackets),\n\t\tRxBytes: uint64(s32.RxBytes),\n\t\tTxBytes: uint64(s32.TxBytes),\n\t\tRxErrors: uint64(s32.RxErrors),\n\t\tTxErrors: uint64(s32.TxErrors),\n\t\tRxDropped: uint64(s32.RxDropped),\n\t\tTxDropped: uint64(s32.TxDropped),\n\t\tMulticast: uint64(s32.Multicast),\n\t\tCollisions: uint64(s32.Collisions),\n\t\tRxLengthErrors: uint64(s32.RxLengthErrors),\n\t\tRxOverErrors: uint64(s32.RxOverErrors),\n\t\tRxCrcErrors: uint64(s32.RxCrcErrors),\n\t\tRxFrameErrors: uint64(s32.RxFrameErrors),\n\t\tRxFifoErrors: uint64(s32.RxFifoErrors),\n\t\tRxMissedErrors: uint64(s32.RxMissedErrors),\n\t\tTxAbortedErrors: uint64(s32.TxAbortedErrors),\n\t\tTxCarrierErrors: uint64(s32.TxCarrierErrors),\n\t\tTxFifoErrors: uint64(s32.TxFifoErrors),\n\t\tTxHeartbeatErrors: uint64(s32.TxHeartbeatErrors),\n\t\tTxWindowErrors: uint64(s32.TxWindowErrors),\n\t\tRxCompressed: uint64(s32.RxCompressed),\n\t\tTxCompressed: uint64(s32.TxCompressed),\n\t}\n}\n\n/*\nRef: struct rtnl_link_stats64 {...}\n*/\ntype LinkStatistics64 struct {\n\tRxPackets uint64\n\tTxPackets uint64\n\tRxBytes uint64\n\tTxBytes uint64\n\tRxErrors uint64\n\tTxErrors uint64\n\tRxDropped uint64\n\tTxDropped uint64\n\tMulticast uint64\n\tCollisions uint64\n\tRxLengthErrors uint64\n\tRxOverErrors uint64\n\tRxCrcErrors uint64\n\tRxFrameErrors uint64\n\tRxFifoErrors uint64\n\tRxMissedErrors uint64\n\tTxAbortedErrors uint64\n\tTxCarrierErrors uint64\n\tTxFifoErrors uint64\n\tTxHeartbeatErrors uint64\n\tTxWindowErrors uint64\n\tRxCompressed uint64\n\tTxCompressed uint64\n}\n\ntype LinkXdp struct {\n\tFd int\n\tAttached bool\n\tAttachMode uint32\n\tFlags uint32\n\tProgId uint32\n}\n\n// Device links cannot be created via netlink. These links\n// are links created by udev like 'lo' and 'etho0'\ntype Device struct {\n\tLinkAttrs\n}\n\nfunc (device *Device) Attrs() *LinkAttrs {\n\treturn &device.LinkAttrs\n}\n\nfunc (device *Device) Type() string {\n\treturn \"device\"\n}\n\n// Dummy links are dummy ethernet devices\ntype Dummy struct {\n\tLinkAttrs\n}\n\nfunc (dummy *Dummy) Attrs() *LinkAttrs {\n\treturn &dummy.LinkAttrs\n}\n\nfunc (dummy *Dummy) Type() string {\n\treturn \"dummy\"\n}\n\n// Ifb links are advanced dummy devices for packet filtering\ntype Ifb struct {\n\tLinkAttrs\n}\n\nfunc (ifb *Ifb) Attrs() *LinkAttrs {\n\treturn &ifb.LinkAttrs\n}\n\nfunc (ifb *Ifb) Type() string {\n\treturn \"ifb\"\n}\n\n// Bridge links are simple linux bridges\ntype Bridge struct {\n\tLinkAttrs\n\tMulticastSnooping *bool\n\tAgeingTime *uint32\n\tHelloTime *uint32\n\tVlanFiltering *bool\n}\n\nfunc (bridge *Bridge) Attrs() *LinkAttrs {\n\treturn &bridge.LinkAttrs\n}\n\nfunc (bridge *Bridge) Type() string {\n\treturn \"bridge\"\n}\n\n// Vlan links have ParentIndex set in their Attrs()\ntype Vlan struct {\n\tLinkAttrs\n\tVlanId int\n\tVlanProtocol VlanProtocol\n}\n\nfunc (vlan *Vlan) Attrs() *LinkAttrs {\n\treturn &vlan.LinkAttrs\n}\n\nfunc (vlan *Vlan) Type() string {\n\treturn \"vlan\"\n}\n\ntype MacvlanMode uint16\n\nconst (\n\tMACVLAN_MODE_DEFAULT MacvlanMode = iota\n\tMACVLAN_MODE_PRIVATE\n\tMACVLAN_MODE_VEPA\n\tMACVLAN_MODE_BRIDGE\n\tMACVLAN_MODE_PASSTHRU\n\tMACVLAN_MODE_SOURCE\n)\n\n// Macvlan links have ParentIndex set in their Attrs()\ntype Macvlan struct {\n\tLinkAttrs\n\tMode MacvlanMode\n\n\t// MACAddrs is only populated for Macvlan SOURCE links\n\tMACAddrs []net.HardwareAddr\n}\n\nfunc (macvlan *Macvlan) Attrs() *LinkAttrs {\n\treturn &macvlan.LinkAttrs\n}\n\nfunc (macvlan *Macvlan) Type() string {\n\treturn \"macvlan\"\n}\n\n// Macvtap - macvtap is a virtual interfaces based on macvlan\ntype Macvtap struct {\n\tMacvlan\n}\n\nfunc (macvtap Macvtap) Type() string {\n\treturn \"macvtap\"\n}\n\ntype TuntapMode uint16\ntype TuntapFlag uint16\n\n// Tuntap links created via /dev/tun/tap, but can be destroyed via netlink\ntype Tuntap struct {\n\tLinkAttrs\n\tMode TuntapMode\n\tFlags TuntapFlag\n\tNonPersist bool\n\tQueues int\n\tFds []*os.File\n\tOwner uint32\n\tGroup uint32\n}\n\nfunc (tuntap *Tuntap) Attrs() *LinkAttrs {\n\treturn &tuntap.LinkAttrs\n}\n\nfunc (tuntap *Tuntap) Type() string {\n\treturn \"tuntap\"\n}\n\n// Veth devices must specify PeerName on create\ntype Veth struct {\n\tLinkAttrs\n\tPeerName string // veth on create only\n\tPeerHardwareAddr net.HardwareAddr\n\tPeerNamespace interface{}\n}\n\nfunc (veth *Veth) Attrs() *LinkAttrs {\n\treturn &veth.LinkAttrs\n}\n\nfunc (veth *Veth) Type() string {\n\treturn \"veth\"\n}\n\n// Wireguard represent links of type \"wireguard\", see https://www.wireguard.com/\ntype Wireguard struct {\n\tLinkAttrs\n}\n\nfunc (wg *Wireguard) Attrs() *LinkAttrs {\n\treturn &wg.LinkAttrs\n}\n\nfunc (wg *Wireguard) Type() string {\n\treturn \"wireguard\"\n}\n\n// GenericLink links represent types that are not currently understood\n// by this netlink library.\ntype GenericLink struct {\n\tLinkAttrs\n\tLinkType string\n}\n\nfunc (generic *GenericLink) Attrs() *LinkAttrs {\n\treturn &generic.LinkAttrs\n}\n\nfunc (generic *GenericLink) Type() string {\n\treturn generic.LinkType\n}\n\ntype Vxlan struct {\n\tLinkAttrs\n\tVxlanId int\n\tVtepDevIndex int\n\tSrcAddr net.IP\n\tGroup net.IP\n\tTTL int\n\tTOS int\n\tLearning bool\n\tProxy bool\n\tRSC bool\n\tL2miss bool\n\tL3miss bool\n\tUDPCSum bool\n\tUDP6ZeroCSumTx bool\n\tUDP6ZeroCSumRx bool\n\tNoAge bool\n\tGBP bool\n\tFlowBased bool\n\tAge int\n\tLimit int\n\tPort int\n\tPortLow int\n\tPortHigh int\n}\n\nfunc (vxlan *Vxlan) Attrs() *LinkAttrs {\n\treturn &vxlan.LinkAttrs\n}\n\nfunc (vxlan *Vxlan) Type() string {\n\treturn \"vxlan\"\n}\n\ntype IPVlanMode uint16\n\nconst (\n\tIPVLAN_MODE_L2 IPVlanMode = iota\n\tIPVLAN_MODE_L3\n\tIPVLAN_MODE_L3S\n\tIPVLAN_MODE_MAX\n)\n\ntype IPVlanFlag uint16\n\nconst (\n\tIPVLAN_FLAG_BRIDGE IPVlanFlag = iota\n\tIPVLAN_FLAG_PRIVATE\n\tIPVLAN_FLAG_VEPA\n)\n\ntype IPVlan struct {\n\tLinkAttrs\n\tMode IPVlanMode\n\tFlag IPVlanFlag\n}\n\nfunc (ipvlan *IPVlan) Attrs() *LinkAttrs {\n\treturn &ipvlan.LinkAttrs\n}\n\nfunc (ipvlan *IPVlan) Type() string {\n\treturn \"ipvlan\"\n}\n\n// IPVtap - IPVtap is a virtual interfaces based on ipvlan\ntype IPVtap struct {\n\tIPVlan\n}\n\nfunc (ipvtap *IPVtap) Attrs() *LinkAttrs {\n\treturn &ipvtap.LinkAttrs\n}\n\nfunc (ipvtap IPVtap) Type() string {\n\treturn \"ipvtap\"\n}\n\n// VlanProtocol type\ntype VlanProtocol int\n\nfunc (p VlanProtocol) String() string {\n\ts, ok := VlanProtocolToString[p]\n\tif !ok {\n\t\treturn fmt.Sprintf(\"VlanProtocol(%d)\", p)\n\t}\n\treturn s\n}\n\n// StringToVlanProtocol returns vlan protocol, or unknown is the s is invalid.\nfunc StringToVlanProtocol(s string) VlanProtocol {\n\tmode, ok := StringToVlanProtocolMap[s]\n\tif !ok {\n\t\treturn VLAN_PROTOCOL_UNKNOWN\n\t}\n\treturn mode\n}\n\n// VlanProtocol possible values\nconst (\n\tVLAN_PROTOCOL_UNKNOWN VlanProtocol = 0\n\tVLAN_PROTOCOL_8021Q VlanProtocol = 0x8100\n\tVLAN_PROTOCOL_8021AD VlanProtocol = 0x88A8\n)\n\nvar VlanProtocolToString = map[VlanProtocol]string{\n\tVLAN_PROTOCOL_8021Q: \"802.1q\",\n\tVLAN_PROTOCOL_8021AD: \"802.1ad\",\n}\n\nvar StringToVlanProtocolMap = map[string]VlanProtocol{\n\t\"802.1q\": VLAN_PROTOCOL_8021Q,\n\t\"802.1ad\": VLAN_PROTOCOL_8021AD,\n}\n\n// BondMode type\ntype BondMode int\n\nfunc (b BondMode) String() string {\n\ts, ok := bondModeToString[b]\n\tif !ok {\n\t\treturn fmt.Sprintf(\"BondMode(%d)\", b)\n\t}\n\treturn s\n}\n\n// StringToBondMode returns bond mode, or unknown is the s is invalid.\nfunc StringToBondMode(s string) BondMode {\n\tmode, ok := StringToBondModeMap[s]\n\tif !ok {\n\t\treturn BOND_MODE_UNKNOWN\n\t}\n\treturn mode\n}\n\n// Possible BondMode\nconst (\n\tBOND_MODE_BALANCE_RR BondMode = iota\n\tBOND_MODE_ACTIVE_BACKUP\n\tBOND_MODE_BALANCE_XOR\n\tBOND_MODE_BROADCAST\n\tBOND_MODE_802_3AD\n\tBOND_MODE_BALANCE_TLB\n\tBOND_MODE_BALANCE_ALB\n\tBOND_MODE_UNKNOWN\n)\n\nvar bondModeToString = map[BondMode]string{\n\tBOND_MODE_BALANCE_RR: \"balance-rr\",\n\tBOND_MODE_ACTIVE_BACKUP: \"active-backup\",\n\tBOND_MODE_BALANCE_XOR: \"balance-xor\",\n\tBOND_MODE_BROADCAST: \"broadcast\",\n\tBOND_MODE_802_3AD: \"802.3ad\",\n\tBOND_MODE_BALANCE_TLB: \"balance-tlb\",\n\tBOND_MODE_BALANCE_ALB: \"balance-alb\",\n}\nvar StringToBondModeMap = map[string]BondMode{\n\t\"balance-rr\": BOND_MODE_BALANCE_RR,\n\t\"active-backup\": BOND_MODE_ACTIVE_BACKUP,\n\t\"balance-xor\": BOND_MODE_BALANCE_XOR,\n\t\"broadcast\": BOND_MODE_BROADCAST,\n\t\"802.3ad\": BOND_MODE_802_3AD,\n\t\"balance-tlb\": BOND_MODE_BALANCE_TLB,\n\t\"balance-alb\": BOND_MODE_BALANCE_ALB,\n}\n\n// BondArpValidate type\ntype BondArpValidate int\n\n// Possible BondArpValidate value\nconst (\n\tBOND_ARP_VALIDATE_NONE BondArpValidate = iota\n\tBOND_ARP_VALIDATE_ACTIVE\n\tBOND_ARP_VALIDATE_BACKUP\n\tBOND_ARP_VALIDATE_ALL\n)\n\nvar bondArpValidateToString = map[BondArpValidate]string{\n\tBOND_ARP_VALIDATE_NONE: \"none\",\n\tBOND_ARP_VALIDATE_ACTIVE: \"active\",\n\tBOND_ARP_VALIDATE_BACKUP: \"backup\",\n\tBOND_ARP_VALIDATE_ALL: \"none\",\n}\nvar StringToBondArpValidateMap = map[string]BondArpValidate{\n\t\"none\": BOND_ARP_VALIDATE_NONE,\n\t\"active\": BOND_ARP_VALIDATE_ACTIVE,\n\t\"backup\": BOND_ARP_VALIDATE_BACKUP,\n\t\"all\": BOND_ARP_VALIDATE_ALL,\n}\n\nfunc (b BondArpValidate) String() string {\n\ts, ok := bondArpValidateToString[b]\n\tif !ok {\n\t\treturn fmt.Sprintf(\"BondArpValidate(%d)\", b)\n\t}\n\treturn s\n}\n\n// BondPrimaryReselect type\ntype BondPrimaryReselect int\n\n// Possible BondPrimaryReselect value\nconst (\n\tBOND_PRIMARY_RESELECT_ALWAYS BondPrimaryReselect = iota\n\tBOND_PRIMARY_RESELECT_BETTER\n\tBOND_PRIMARY_RESELECT_FAILURE\n)\n\nvar bondPrimaryReselectToString = map[BondPrimaryReselect]string{\n\tBOND_PRIMARY_RESELECT_ALWAYS: \"always\",\n\tBOND_PRIMARY_RESELECT_BETTER: \"better\",\n\tBOND_PRIMARY_RESELECT_FAILURE: \"failure\",\n}\nvar StringToBondPrimaryReselectMap = map[string]BondPrimaryReselect{\n\t\"always\": BOND_PRIMARY_RESELECT_ALWAYS,\n\t\"better\": BOND_PRIMARY_RESELECT_BETTER,\n\t\"failure\": BOND_PRIMARY_RESELECT_FAILURE,\n}\n\nfunc (b BondPrimaryReselect) String() string {\n\ts, ok := bondPrimaryReselectToString[b]\n\tif !ok {\n\t\treturn fmt.Sprintf(\"BondPrimaryReselect(%d)\", b)\n\t}\n\treturn s\n}\n\n// BondArpAllTargets type\ntype BondArpAllTargets int\n\n// Possible BondArpAllTargets value\nconst (\n\tBOND_ARP_ALL_TARGETS_ANY BondArpAllTargets = iota\n\tBOND_ARP_ALL_TARGETS_ALL\n)\n\nvar bondArpAllTargetsToString = map[BondArpAllTargets]string{\n\tBOND_ARP_ALL_TARGETS_ANY: \"any\",\n\tBOND_ARP_ALL_TARGETS_ALL: \"all\",\n}\nvar StringToBondArpAllTargetsMap = map[string]BondArpAllTargets{\n\t\"any\": BOND_ARP_ALL_TARGETS_ANY,\n\t\"all\": BOND_ARP_ALL_TARGETS_ALL,\n}\n\nfunc (b BondArpAllTargets) String() string {\n\ts, ok := bondArpAllTargetsToString[b]\n\tif !ok {\n\t\treturn fmt.Sprintf(\"BondArpAllTargets(%d)\", b)\n\t}\n\treturn s\n}\n\n// BondFailOverMac type\ntype BondFailOverMac int\n\n// Possible BondFailOverMac value\nconst (\n\tBOND_FAIL_OVER_MAC_NONE BondFailOverMac = iota\n\tBOND_FAIL_OVER_MAC_ACTIVE\n\tBOND_FAIL_OVER_MAC_FOLLOW\n)\n\nvar bondFailOverMacToString = map[BondFailOverMac]string{\n\tBOND_FAIL_OVER_MAC_NONE: \"none\",\n\tBOND_FAIL_OVER_MAC_ACTIVE: \"active\",\n\tBOND_FAIL_OVER_MAC_FOLLOW: \"follow\",\n}\nvar StringToBondFailOverMacMap = map[string]BondFailOverMac{\n\t\"none\": BOND_FAIL_OVER_MAC_NONE,\n\t\"active\": BOND_FAIL_OVER_MAC_ACTIVE,\n\t\"follow\": BOND_FAIL_OVER_MAC_FOLLOW,\n}\n\nfunc (b BondFailOverMac) String() string {\n\ts, ok := bondFailOverMacToString[b]\n\tif !ok {\n\t\treturn fmt.Sprintf(\"BondFailOverMac(%d)\", b)\n\t}\n\treturn s\n}\n\n// BondXmitHashPolicy type\ntype BondXmitHashPolicy int\n\nfunc (b BondXmitHashPolicy) String() string {\n\ts, ok := bondXmitHashPolicyToString[b]\n\tif !ok {\n\t\treturn fmt.Sprintf(\"XmitHashPolicy(%d)\", b)\n\t}\n\treturn s\n}\n\n// StringToBondXmitHashPolicy returns bond lacp arte, or unknown is the s is invalid.\nfunc StringToBondXmitHashPolicy(s string) BondXmitHashPolicy {\n\tlacp, ok := StringToBondXmitHashPolicyMap[s]\n\tif !ok {\n\t\treturn BOND_XMIT_HASH_POLICY_UNKNOWN\n\t}\n\treturn lacp\n}\n\n// Possible BondXmitHashPolicy value\nconst (\n\tBOND_XMIT_HASH_POLICY_LAYER2 BondXmitHashPolicy = iota\n\tBOND_XMIT_HASH_POLICY_LAYER3_4\n\tBOND_XMIT_HASH_POLICY_LAYER2_3\n\tBOND_XMIT_HASH_POLICY_ENCAP2_3\n\tBOND_XMIT_HASH_POLICY_ENCAP3_4\n\tBOND_XMIT_HASH_POLICY_UNKNOWN\n)\n\nvar bondXmitHashPolicyToString = map[BondXmitHashPolicy]string{\n\tBOND_XMIT_HASH_POLICY_LAYER2: \"layer2\",\n\tBOND_XMIT_HASH_POLICY_LAYER3_4: \"layer3+4\",\n\tBOND_XMIT_HASH_POLICY_LAYER2_3: \"layer2+3\",\n\tBOND_XMIT_HASH_POLICY_ENCAP2_3: \"encap2+3\",\n\tBOND_XMIT_HASH_POLICY_ENCAP3_4: \"encap3+4\",\n}\nvar StringToBondXmitHashPolicyMap = map[string]BondXmitHashPolicy{\n\t\"layer2\": BOND_XMIT_HASH_POLICY_LAYER2,\n\t\"layer3+4\": BOND_XMIT_HASH_POLICY_LAYER3_4,\n\t\"layer2+3\": BOND_XMIT_HASH_POLICY_LAYER2_3,\n\t\"encap2+3\": BOND_XMIT_HASH_POLICY_ENCAP2_3,\n\t\"encap3+4\": BOND_XMIT_HASH_POLICY_ENCAP3_4,\n}\n\n// BondLacpRate type\ntype BondLacpRate int\n\nfunc (b BondLacpRate) String() string {\n\ts, ok := bondLacpRateToString[b]\n\tif !ok {\n\t\treturn fmt.Sprintf(\"LacpRate(%d)\", b)\n\t}\n\treturn s\n}\n\n// StringToBondLacpRate returns bond lacp arte, or unknown is the s is invalid.\nfunc StringToBondLacpRate(s string) BondLacpRate {\n\tlacp, ok := StringToBondLacpRateMap[s]\n\tif !ok {\n\t\treturn BOND_LACP_RATE_UNKNOWN\n\t}\n\treturn lacp\n}\n\n// Possible BondLacpRate value\nconst (\n\tBOND_LACP_RATE_SLOW BondLacpRate = iota\n\tBOND_LACP_RATE_FAST\n\tBOND_LACP_RATE_UNKNOWN\n)\n\nvar bondLacpRateToString = map[BondLacpRate]string{\n\tBOND_LACP_RATE_SLOW: \"slow\",\n\tBOND_LACP_RATE_FAST: \"fast\",\n}\nvar StringToBondLacpRateMap = map[string]BondLacpRate{\n\t\"slow\": BOND_LACP_RATE_SLOW,\n\t\"fast\": BOND_LACP_RATE_FAST,\n}\n\n// BondAdSelect type\ntype BondAdSelect int\n\n// Possible BondAdSelect value\nconst (\n\tBOND_AD_SELECT_STABLE BondAdSelect = iota\n\tBOND_AD_SELECT_BANDWIDTH\n\tBOND_AD_SELECT_COUNT\n)\n\nvar bondAdSelectToString = map[BondAdSelect]string{\n\tBOND_AD_SELECT_STABLE: \"stable\",\n\tBOND_AD_SELECT_BANDWIDTH: \"bandwidth\",\n\tBOND_AD_SELECT_COUNT: \"count\",\n}\nvar StringToBondAdSelectMap = map[string]BondAdSelect{\n\t\"stable\": BOND_AD_SELECT_STABLE,\n\t\"bandwidth\": BOND_AD_SELECT_BANDWIDTH,\n\t\"count\": BOND_AD_SELECT_COUNT,\n}\n\nfunc (b BondAdSelect) String() string {\n\ts, ok := bondAdSelectToString[b]\n\tif !ok {\n\t\treturn fmt.Sprintf(\"BondAdSelect(%d)\", b)\n\t}\n\treturn s\n}\n\n// BondAdInfo represents ad info for bond\ntype BondAdInfo struct {\n\tAggregatorId int\n\tNumPorts int\n\tActorKey int\n\tPartnerKey int\n\tPartnerMac net.HardwareAddr\n}\n\n// Bond representation\ntype Bond struct {\n\tLinkAttrs\n\tMode BondMode\n\tActiveSlave int\n\tMiimon int\n\tUpDelay int\n\tDownDelay int\n\tUseCarrier int\n\tArpInterval int\n\tArpIpTargets []net.IP\n\tArpValidate BondArpValidate\n\tArpAllTargets BondArpAllTargets\n\tPrimary int\n\tPrimaryReselect BondPrimaryReselect\n\tFailOverMac BondFailOverMac\n\tXmitHashPolicy BondXmitHashPolicy\n\tResendIgmp int\n\tNumPeerNotif int\n\tAllSlavesActive int\n\tMinLinks int\n\tLpInterval int\n\tPacketsPerSlave int\n\tLacpRate BondLacpRate\n\tAdSelect BondAdSelect\n\t// looking at iproute tool AdInfo can only be retrived. It can't be set.\n\tAdInfo *BondAdInfo\n\tAdActorSysPrio int\n\tAdUserPortKey int\n\tAdActorSystem net.HardwareAddr\n\tTlbDynamicLb int\n}\n\nfunc NewLinkBond(atr LinkAttrs) *Bond {\n\treturn &Bond{\n\t\tLinkAttrs: atr,\n\t\tMode: -1,\n\t\tActiveSlave: -1,\n\t\tMiimon: -1,\n\t\tUpDelay: -1,\n\t\tDownDelay: -1,\n\t\tUseCarrier: -1,\n\t\tArpInterval: -1,\n\t\tArpIpTargets: nil,\n\t\tArpValidate: -1,\n\t\tArpAllTargets: -1,\n\t\tPrimary: -1,\n\t\tPrimaryReselect: -1,\n\t\tFailOverMac: -1,\n\t\tXmitHashPolicy: -1,\n\t\tResendIgmp: -1,\n\t\tNumPeerNotif: -1,\n\t\tAllSlavesActive: -1,\n\t\tMinLinks: -1,\n\t\tLpInterval: -1,\n\t\tPacketsPerSlave: -1,\n\t\tLacpRate: -1,\n\t\tAdSelect: -1,\n\t\tAdActorSysPrio: -1,\n\t\tAdUserPortKey: -1,\n\t\tAdActorSystem: nil,\n\t\tTlbDynamicLb: -1,\n\t}\n}\n\n// Flag mask for bond options. Bond.Flagmask must be set to on for option to work.\nconst (\n\tBOND_MODE_MASK uint64 = 1 << (1 + iota)\n\tBOND_ACTIVE_SLAVE_MASK\n\tBOND_MIIMON_MASK\n\tBOND_UPDELAY_MASK\n\tBOND_DOWNDELAY_MASK\n\tBOND_USE_CARRIER_MASK\n\tBOND_ARP_INTERVAL_MASK\n\tBOND_ARP_VALIDATE_MASK\n\tBOND_ARP_ALL_TARGETS_MASK\n\tBOND_PRIMARY_MASK\n\tBOND_PRIMARY_RESELECT_MASK\n\tBOND_FAIL_OVER_MAC_MASK\n\tBOND_XMIT_HASH_POLICY_MASK\n\tBOND_RESEND_IGMP_MASK\n\tBOND_NUM_PEER_NOTIF_MASK\n\tBOND_ALL_SLAVES_ACTIVE_MASK\n\tBOND_MIN_LINKS_MASK\n\tBOND_LP_INTERVAL_MASK\n\tBOND_PACKETS_PER_SLAVE_MASK\n\tBOND_LACP_RATE_MASK\n\tBOND_AD_SELECT_MASK\n)\n\n// Attrs implementation.\nfunc (bond *Bond) Attrs() *LinkAttrs {\n\treturn &bond.LinkAttrs\n}\n\n// Type implementation fro Vxlan.\nfunc (bond *Bond) Type() string {\n\treturn \"bond\"\n}\n\n// BondSlaveState represents the values of the IFLA_BOND_SLAVE_STATE bond slave\n// attribute, which contains the state of the bond slave.\ntype BondSlaveState uint8\n\nconst (\n\t//BondStateActive Link is active.\n\tBondStateActive BondSlaveState = iota\n\t//BondStateBackup Link is backup.\n\tBondStateBackup\n)\n\nfunc (s BondSlaveState) String() string {\n\tswitch s {\n\tcase BondStateActive:\n\t\treturn \"ACTIVE\"\n\tcase BondStateBackup:\n\t\treturn \"BACKUP\"\n\tdefault:\n\t\treturn strconv.Itoa(int(s))\n\t}\n}\n\n// BondSlaveMiiStatus represents the values of the IFLA_BOND_SLAVE_MII_STATUS bond slave\n// attribute, which contains the status of MII link monitoring\ntype BondSlaveMiiStatus uint8\n\nconst (\n\t//BondLinkUp link is up and running.\n\tBondLinkUp BondSlaveMiiStatus = iota\n\t//BondLinkFail link has just gone down.\n\tBondLinkFail\n\t//BondLinkDown link has been down for too long time.\n\tBondLinkDown\n\t//BondLinkBack link is going back.\n\tBondLinkBack\n)\n\nfunc (s BondSlaveMiiStatus) String() string {\n\tswitch s {\n\tcase BondLinkUp:\n\t\treturn \"UP\"\n\tcase BondLinkFail:\n\t\treturn \"GOING_DOWN\"\n\tcase BondLinkDown:\n\t\treturn \"DOWN\"\n\tcase BondLinkBack:\n\t\treturn \"GOING_BACK\"\n\tdefault:\n\t\treturn strconv.Itoa(int(s))\n\t}\n}\n\ntype BondSlave struct {\n\tState BondSlaveState\n\tMiiStatus BondSlaveMiiStatus\n\tLinkFailureCount uint32\n\tPermHardwareAddr net.HardwareAddr\n\tQueueId uint16\n\tAggregatorId uint16\n\tAdActorOperPortState uint8\n\tAdPartnerOperPortState uint16\n}\n\nfunc (b *BondSlave) SlaveType() string {\n\treturn \"bond\"\n}\n\ntype VrfSlave struct {\n\tTable uint32\n}\n\nfunc (v *VrfSlave) SlaveType() string {\n\treturn \"vrf\"\n}\n\n// Geneve devices must specify RemoteIP and ID (VNI) on create\n// https://github.com/torvalds/linux/blob/47ec5303d73ea344e84f46660fff693c57641386/drivers/net/geneve.c#L1209-L1223\ntype Geneve struct {\n\tLinkAttrs\n\tID uint32 // vni\n\tRemote net.IP\n\tTtl uint8\n\tTos uint8\n\tDport uint16\n\tUdpCsum uint8\n\tUdpZeroCsum6Tx uint8\n\tUdpZeroCsum6Rx uint8\n\tLink uint32\n\tFlowBased bool\n}\n\nfunc (geneve *Geneve) Attrs() *LinkAttrs {\n\treturn &geneve.LinkAttrs\n}\n\nfunc (geneve *Geneve) Type() string {\n\treturn \"geneve\"\n}\n\n// Gretap devices must specify LocalIP and RemoteIP on create\ntype Gretap struct {\n\tLinkAttrs\n\tIKey uint32\n\tOKey uint32\n\tEncapSport uint16\n\tEncapDport uint16\n\tLocal net.IP\n\tRemote net.IP\n\tIFlags uint16\n\tOFlags uint16\n\tPMtuDisc uint8\n\tTtl uint8\n\tTos uint8\n\tEncapType uint16\n\tEncapFlags uint16\n\tLink uint32\n\tFlowBased bool\n}\n\nfunc (gretap *Gretap) Attrs() *LinkAttrs {\n\treturn &gretap.LinkAttrs\n}\n\nfunc (gretap *Gretap) Type() string {\n\tif gretap.Local.To4() == nil {\n\t\treturn \"ip6gretap\"\n\t}\n\treturn \"gretap\"\n}\n\ntype Iptun struct {\n\tLinkAttrs\n\tTtl uint8\n\tTos uint8\n\tPMtuDisc uint8\n\tLink uint32\n\tLocal net.IP\n\tRemote net.IP\n\tEncapSport uint16\n\tEncapDport uint16\n\tEncapType uint16\n\tEncapFlags uint16\n\tFlowBased bool\n}\n\nfunc (iptun *Iptun) Attrs() *LinkAttrs {\n\treturn &iptun.LinkAttrs\n}\n\nfunc (iptun *Iptun) Type() string {\n\treturn \"ipip\"\n}\n\ntype Ip6tnl struct {\n\tLinkAttrs\n\tLink uint32\n\tLocal net.IP\n\tRemote net.IP\n\tTtl uint8\n\tTos uint8\n\tFlags uint32\n\tProto uint8\n\tFlowInfo uint32\n\tEncapLimit uint8\n\tEncapType uint16\n\tEncapFlags uint16\n\tEncapSport uint16\n\tEncapDport uint16\n}\n\nfunc (ip6tnl *Ip6tnl) Attrs() *LinkAttrs {\n\treturn &ip6tnl.LinkAttrs\n}\n\nfunc (ip6tnl *Ip6tnl) Type() string {\n\treturn \"ip6tnl\"\n}\n\ntype Sittun struct {\n\tLinkAttrs\n\tLink uint32\n\tTtl uint8\n\tTos uint8\n\tPMtuDisc uint8\n\tProto uint8\n\tLocal net.IP\n\tRemote net.IP\n\tEncapLimit uint8\n\tEncapType uint16\n\tEncapFlags uint16\n\tEncapSport uint16\n\tEncapDport uint16\n}\n\nfunc (sittun *Sittun) Attrs() *LinkAttrs {\n\treturn &sittun.LinkAttrs\n}\n\nfunc (sittun *Sittun) Type() string {\n\treturn \"sit\"\n}\n\ntype Vti struct {\n\tLinkAttrs\n\tIKey uint32\n\tOKey uint32\n\tLink uint32\n\tLocal net.IP\n\tRemote net.IP\n}\n\nfunc (vti *Vti) Attrs() *LinkAttrs {\n\treturn &vti.LinkAttrs\n}\n\nfunc (vti *Vti) Type() string {\n\tif vti.Local.To4() == nil {\n\t\treturn \"vti6\"\n\t}\n\treturn \"vti\"\n}\n\ntype Gretun struct {\n\tLinkAttrs\n\tLink uint32\n\tIFlags uint16\n\tOFlags uint16\n\tIKey uint32\n\tOKey uint32\n\tLocal net.IP\n\tRemote net.IP\n\tTtl uint8\n\tTos uint8\n\tPMtuDisc uint8\n\tEncapType uint16\n\tEncapFlags uint16\n\tEncapSport uint16\n\tEncapDport uint16\n}\n\nfunc (gretun *Gretun) Attrs() *LinkAttrs {\n\treturn &gretun.LinkAttrs\n}\n\nfunc (gretun *Gretun) Type() string {\n\tif gretun.Local.To4() == nil {\n\t\treturn \"ip6gre\"\n\t}\n\treturn \"gre\"\n}\n\ntype Vrf struct {\n\tLinkAttrs\n\tTable uint32\n}\n\nfunc (vrf *Vrf) Attrs() *LinkAttrs {\n\treturn &vrf.LinkAttrs\n}\n\nfunc (vrf *Vrf) Type() string {\n\treturn \"vrf\"\n}\n\ntype GTP struct {\n\tLinkAttrs\n\tFD0 int\n\tFD1 int\n\tRole int\n\tPDPHashsize int\n}\n\nfunc (gtp *GTP) Attrs() *LinkAttrs {\n\treturn >p.LinkAttrs\n}\n\nfunc (gtp *GTP) Type() string {\n\treturn \"gtp\"\n}\n\n// Virtual XFRM Interfaces\n//\tNamed \"xfrmi\" to prevent confusion with XFRM objects\ntype Xfrmi struct {\n\tLinkAttrs\n\tIfid uint32\n}\n\nfunc (xfrm *Xfrmi) Attrs() *LinkAttrs {\n\treturn &xfrm.LinkAttrs\n}\n\nfunc (xfrm *Xfrmi) Type() string {\n\treturn \"xfrm\"\n}\n\n// IPoIB interface\n\ntype IPoIBMode uint16\n\nfunc (m *IPoIBMode) String() string {\n\tstr, ok := iPoIBModeToString[*m]\n\tif !ok {\n\t\treturn fmt.Sprintf(\"mode(%d)\", *m)\n\t}\n\treturn str\n}\n\nconst (\n\tIPOIB_MODE_DATAGRAM = iota\n\tIPOIB_MODE_CONNECTED\n)\n\nvar iPoIBModeToString = map[IPoIBMode]string{\n\tIPOIB_MODE_DATAGRAM: \"datagram\",\n\tIPOIB_MODE_CONNECTED: \"connected\",\n}\n\nvar StringToIPoIBMode = map[string]IPoIBMode{\n\t\"datagram\": IPOIB_MODE_DATAGRAM,\n\t\"connected\": IPOIB_MODE_CONNECTED,\n}\n\nconst (\n\tCAN_STATE_ERROR_ACTIVE = iota\n\tCAN_STATE_ERROR_WARNING\n\tCAN_STATE_ERROR_PASSIVE\n\tCAN_STATE_BUS_OFF\n\tCAN_STATE_STOPPED\n\tCAN_STATE_SLEEPING\n)\n\ntype Can struct {\n\tLinkAttrs\n\n\tBitRate uint32\n\tSamplePoint uint32\n\tTimeQuanta uint32\n\tPropagationSegment uint32\n\tPhaseSegment1 uint32\n\tPhaseSegment2 uint32\n\tSyncJumpWidth uint32\n\tBitRatePreScaler uint32\n\n\tName string\n\tTimeSegment1Min uint32\n\tTimeSegment1Max uint32\n\tTimeSegment2Min uint32\n\tTimeSegment2Max uint32\n\tSyncJumpWidthMax uint32\n\tBitRatePreScalerMin uint32\n\tBitRatePreScalerMax uint32\n\tBitRatePreScalerInc uint32\n\n\tClockFrequency uint32\n\n\tState uint32\n\n\tMask uint32\n\tFlags uint32\n\n\tTxError uint16\n\tRxError uint16\n\n\tRestartMs uint32\n}\n\nfunc (can *Can) Attrs() *LinkAttrs {\n\treturn &can.LinkAttrs\n}\n\nfunc (can *Can) Type() string {\n\treturn \"can\"\n}\n\ntype IPoIB struct {\n\tLinkAttrs\n\tPkey uint16\n\tMode IPoIBMode\n\tUmcast uint16\n}\n\nfunc (ipoib *IPoIB) Attrs() *LinkAttrs {\n\treturn &ipoib.LinkAttrs\n}\n\nfunc (ipoib *IPoIB) Type() string {\n\treturn \"ipoib\"\n}\n\n// iproute2 supported devices;\n// vlan | veth | vcan | dummy | ifb | macvlan | macvtap |\n// bridge | bond | ipoib | ip6tnl | ipip | sit | vxlan |\n// gre | gretap | ip6gre | ip6gretap | vti | vti6 | nlmon |\n// bond_slave | ipvlan | xfrm\n\n// LinkNotFoundError wraps the various not found errors when\n// getting/reading links. This is intended for better error\n// handling by dependent code so that \"not found error\" can\n// be distinguished from other errors\ntype LinkNotFoundError struct {\n\terror\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/link_linux.go", "content": "package netlink\n\nimport (\n\t\"bytes\"\n\t\"encoding/binary\"\n\t\"fmt\"\n\t\"io/ioutil\"\n\t\"net\"\n\t\"os\"\n\t\"strconv\"\n\t\"strings\"\n\t\"syscall\"\n\t\"unsafe\"\n\n\t\"github.com/vishvananda/netlink/nl\"\n\t\"github.com/vishvananda/netns\"\n\t\"golang.org/x/sys/unix\"\n)\n\nconst (\n\tSizeofLinkStats32 = 0x5c\n\tSizeofLinkStats64 = 0xb8\n)\n\nconst (\n\tTUNTAP_MODE_TUN TuntapMode = unix.IFF_TUN\n\tTUNTAP_MODE_TAP TuntapMode = unix.IFF_TAP\n\tTUNTAP_DEFAULTS TuntapFlag = unix.IFF_TUN_EXCL | unix.IFF_ONE_QUEUE\n\tTUNTAP_VNET_HDR TuntapFlag = unix.IFF_VNET_HDR\n\tTUNTAP_TUN_EXCL TuntapFlag = unix.IFF_TUN_EXCL\n\tTUNTAP_NO_PI TuntapFlag = unix.IFF_NO_PI\n\tTUNTAP_ONE_QUEUE TuntapFlag = unix.IFF_ONE_QUEUE\n\tTUNTAP_MULTI_QUEUE TuntapFlag = unix.IFF_MULTI_QUEUE\n\tTUNTAP_MULTI_QUEUE_DEFAULTS TuntapFlag = TUNTAP_MULTI_QUEUE | TUNTAP_NO_PI\n)\n\nvar StringToTuntapModeMap = map[string]TuntapMode{\n\t\"tun\": TUNTAP_MODE_TUN,\n\t\"tap\": TUNTAP_MODE_TAP,\n}\n\nfunc (ttm TuntapMode) String() string {\n\tswitch ttm {\n\tcase TUNTAP_MODE_TUN:\n\t\treturn \"tun\"\n\tcase TUNTAP_MODE_TAP:\n\t\treturn \"tap\"\n\t}\n\treturn \"unknown\"\n}\n\nconst (\n\tVF_LINK_STATE_AUTO uint32 = 0\n\tVF_LINK_STATE_ENABLE uint32 = 1\n\tVF_LINK_STATE_DISABLE uint32 = 2\n)\n\nvar lookupByDump = false\n\nvar macvlanModes = [...]uint32{\n\t0,\n\tnl.MACVLAN_MODE_PRIVATE,\n\tnl.MACVLAN_MODE_VEPA,\n\tnl.MACVLAN_MODE_BRIDGE,\n\tnl.MACVLAN_MODE_PASSTHRU,\n\tnl.MACVLAN_MODE_SOURCE,\n}\n\nfunc ensureIndex(link *LinkAttrs) {\n\tif link != nil && link.Index == 0 {\n\t\tnewlink, _ := LinkByName(link.Name)\n\t\tif newlink != nil {\n\t\t\tlink.Index = newlink.Attrs().Index\n\t\t}\n\t}\n}\n\nfunc (h *Handle) ensureIndex(link *LinkAttrs) {\n\tif link != nil && link.Index == 0 {\n\t\tnewlink, _ := h.LinkByName(link.Name)\n\t\tif newlink != nil {\n\t\t\tlink.Index = newlink.Attrs().Index\n\t\t}\n\t}\n}\n\nfunc (h *Handle) LinkSetARPOff(link Link) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_SETLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Change |= unix.IFF_NOARP\n\tmsg.Flags |= unix.IFF_NOARP\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\nfunc LinkSetARPOff(link Link) error {\n\treturn pkgHandle.LinkSetARPOff(link)\n}\n\nfunc (h *Handle) LinkSetARPOn(link Link) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_SETLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Change |= unix.IFF_NOARP\n\tmsg.Flags &= ^uint32(unix.IFF_NOARP)\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\nfunc LinkSetARPOn(link Link) error {\n\treturn pkgHandle.LinkSetARPOn(link)\n}\n\nfunc (h *Handle) SetPromiscOn(link Link) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_SETLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Change = unix.IFF_PROMISC\n\tmsg.Flags = unix.IFF_PROMISC\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// LinkSetAllmulticastOn enables the reception of all hardware multicast packets for the link device.\n// Equivalent to: `ip link set $link allmulticast on`\nfunc LinkSetAllmulticastOn(link Link) error {\n\treturn pkgHandle.LinkSetAllmulticastOn(link)\n}\n\n// LinkSetAllmulticastOn enables the reception of all hardware multicast packets for the link device.\n// Equivalent to: `ip link set $link allmulticast on`\nfunc (h *Handle) LinkSetAllmulticastOn(link Link) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_NEWLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Change = unix.IFF_ALLMULTI\n\tmsg.Flags = unix.IFF_ALLMULTI\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// LinkSetAllmulticastOff disables the reception of all hardware multicast packets for the link device.\n// Equivalent to: `ip link set $link allmulticast off`\nfunc LinkSetAllmulticastOff(link Link) error {\n\treturn pkgHandle.LinkSetAllmulticastOff(link)\n}\n\n// LinkSetAllmulticastOff disables the reception of all hardware multicast packets for the link device.\n// Equivalent to: `ip link set $link allmulticast off`\nfunc (h *Handle) LinkSetAllmulticastOff(link Link) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_NEWLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Change = unix.IFF_ALLMULTI\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// LinkSetMulticastOn enables the reception of multicast packets for the link device.\n// Equivalent to: `ip link set $link multicast on`\nfunc LinkSetMulticastOn(link Link) error {\n\treturn pkgHandle.LinkSetMulticastOn(link)\n}\n\n// LinkSetMulticastOn enables the reception of multicast packets for the link device.\n// Equivalent to: `ip link set $link multicast on`\nfunc (h *Handle) LinkSetMulticastOn(link Link) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_NEWLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Change = unix.IFF_MULTICAST\n\tmsg.Flags = unix.IFF_MULTICAST\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// LinkSetAllmulticastOff disables the reception of multicast packets for the link device.\n// Equivalent to: `ip link set $link multicast off`\nfunc LinkSetMulticastOff(link Link) error {\n\treturn pkgHandle.LinkSetMulticastOff(link)\n}\n\n// LinkSetAllmulticastOff disables the reception of multicast packets for the link device.\n// Equivalent to: `ip link set $link multicast off`\nfunc (h *Handle) LinkSetMulticastOff(link Link) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_NEWLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Change = unix.IFF_MULTICAST\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\nfunc MacvlanMACAddrAdd(link Link, addr net.HardwareAddr) error {\n\treturn pkgHandle.MacvlanMACAddrAdd(link, addr)\n}\n\nfunc (h *Handle) MacvlanMACAddrAdd(link Link, addr net.HardwareAddr) error {\n\treturn h.macvlanMACAddrChange(link, []net.HardwareAddr{addr}, nl.MACVLAN_MACADDR_ADD)\n}\n\nfunc MacvlanMACAddrDel(link Link, addr net.HardwareAddr) error {\n\treturn pkgHandle.MacvlanMACAddrDel(link, addr)\n}\n\nfunc (h *Handle) MacvlanMACAddrDel(link Link, addr net.HardwareAddr) error {\n\treturn h.macvlanMACAddrChange(link, []net.HardwareAddr{addr}, nl.MACVLAN_MACADDR_DEL)\n}\n\nfunc MacvlanMACAddrFlush(link Link) error {\n\treturn pkgHandle.MacvlanMACAddrFlush(link)\n}\n\nfunc (h *Handle) MacvlanMACAddrFlush(link Link) error {\n\treturn h.macvlanMACAddrChange(link, nil, nl.MACVLAN_MACADDR_FLUSH)\n}\n\nfunc MacvlanMACAddrSet(link Link, addrs []net.HardwareAddr) error {\n\treturn pkgHandle.MacvlanMACAddrSet(link, addrs)\n}\n\nfunc (h *Handle) MacvlanMACAddrSet(link Link, addrs []net.HardwareAddr) error {\n\treturn h.macvlanMACAddrChange(link, addrs, nl.MACVLAN_MACADDR_SET)\n}\n\nfunc (h *Handle) macvlanMACAddrChange(link Link, addrs []net.HardwareAddr, mode uint32) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_NEWLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\tlinkInfo := nl.NewRtAttr(unix.IFLA_LINKINFO, nil)\n\tlinkInfo.AddRtAttr(nl.IFLA_INFO_KIND, nl.NonZeroTerminated(link.Type()))\n\tinner := linkInfo.AddRtAttr(nl.IFLA_INFO_DATA, nil)\n\n\t// IFLA_MACVLAN_MACADDR_MODE = mode\n\tb := make([]byte, 4)\n\tnative.PutUint32(b, mode)\n\tinner.AddRtAttr(nl.IFLA_MACVLAN_MACADDR_MODE, b)\n\n\t// populate message with MAC addrs, if necessary\n\tswitch mode {\n\tcase nl.MACVLAN_MACADDR_ADD, nl.MACVLAN_MACADDR_DEL:\n\t\tif len(addrs) == 1 {\n\t\t\tinner.AddRtAttr(nl.IFLA_MACVLAN_MACADDR, []byte(addrs[0]))\n\t\t}\n\tcase nl.MACVLAN_MACADDR_SET:\n\t\tmad := inner.AddRtAttr(nl.IFLA_MACVLAN_MACADDR_DATA, nil)\n\t\tfor _, addr := range addrs {\n\t\t\tmad.AddRtAttr(nl.IFLA_MACVLAN_MACADDR, []byte(addr))\n\t\t}\n\t}\n\n\treq.AddData(linkInfo)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// LinkSetMacvlanMode sets the mode of a macvlan or macvtap link device.\n// Note that passthrough mode cannot be set to and from and will fail.\n// Equivalent to: `ip link set $link type (macvlan|macvtap) mode $mode\nfunc LinkSetMacvlanMode(link Link, mode MacvlanMode) error {\n\treturn pkgHandle.LinkSetMacvlanMode(link, mode)\n}\n\n// LinkSetMacvlanMode sets the mode of the macvlan or macvtap link device.\n// Note that passthrough mode cannot be set to and from and will fail.\n// Equivalent to: `ip link set $link type (macvlan|macvtap) mode $mode\nfunc (h *Handle) LinkSetMacvlanMode(link Link, mode MacvlanMode) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_NEWLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\tlinkInfo := nl.NewRtAttr(unix.IFLA_LINKINFO, nil)\n\tlinkInfo.AddRtAttr(nl.IFLA_INFO_KIND, nl.NonZeroTerminated(link.Type()))\n\n\tdata := linkInfo.AddRtAttr(nl.IFLA_INFO_DATA, nil)\n\tdata.AddRtAttr(nl.IFLA_MACVLAN_MODE, nl.Uint32Attr(macvlanModes[mode]))\n\n\treq.AddData(linkInfo)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\nfunc BridgeSetMcastSnoop(link Link, on bool) error {\n\treturn pkgHandle.BridgeSetMcastSnoop(link, on)\n}\n\nfunc (h *Handle) BridgeSetMcastSnoop(link Link, on bool) error {\n\tbridge := link.(*Bridge)\n\tbridge.MulticastSnooping = &on\n\treturn h.linkModify(bridge, unix.NLM_F_ACK)\n}\n\nfunc BridgeSetVlanFiltering(link Link, on bool) error {\n\treturn pkgHandle.BridgeSetVlanFiltering(link, on)\n}\n\nfunc (h *Handle) BridgeSetVlanFiltering(link Link, on bool) error {\n\tbridge := link.(*Bridge)\n\tbridge.VlanFiltering = &on\n\treturn h.linkModify(bridge, unix.NLM_F_ACK)\n}\n\nfunc SetPromiscOn(link Link) error {\n\treturn pkgHandle.SetPromiscOn(link)\n}\n\nfunc (h *Handle) SetPromiscOff(link Link) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_SETLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Change = unix.IFF_PROMISC\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\nfunc SetPromiscOff(link Link) error {\n\treturn pkgHandle.SetPromiscOff(link)\n}\n\n// LinkSetUp enables the link device.\n// Equivalent to: `ip link set $link up`\nfunc LinkSetUp(link Link) error {\n\treturn pkgHandle.LinkSetUp(link)\n}\n\n// LinkSetUp enables the link device.\n// Equivalent to: `ip link set $link up`\nfunc (h *Handle) LinkSetUp(link Link) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_NEWLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Change = unix.IFF_UP\n\tmsg.Flags = unix.IFF_UP\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// LinkSetDown disables link device.\n// Equivalent to: `ip link set $link down`\nfunc LinkSetDown(link Link) error {\n\treturn pkgHandle.LinkSetDown(link)\n}\n\n// LinkSetDown disables link device.\n// Equivalent to: `ip link set $link down`\nfunc (h *Handle) LinkSetDown(link Link) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_NEWLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Change = unix.IFF_UP\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// LinkSetMTU sets the mtu of the link device.\n// Equivalent to: `ip link set $link mtu $mtu`\nfunc LinkSetMTU(link Link, mtu int) error {\n\treturn pkgHandle.LinkSetMTU(link, mtu)\n}\n\n// LinkSetMTU sets the mtu of the link device.\n// Equivalent to: `ip link set $link mtu $mtu`\nfunc (h *Handle) LinkSetMTU(link Link, mtu int) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_SETLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\tb := make([]byte, 4)\n\tnative.PutUint32(b, uint32(mtu))\n\n\tdata := nl.NewRtAttr(unix.IFLA_MTU, b)\n\treq.AddData(data)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// LinkSetName sets the name of the link device.\n// Equivalent to: `ip link set $link name $name`\nfunc LinkSetName(link Link, name string) error {\n\treturn pkgHandle.LinkSetName(link, name)\n}\n\n// LinkSetName sets the name of the link device.\n// Equivalent to: `ip link set $link name $name`\nfunc (h *Handle) LinkSetName(link Link, name string) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_SETLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\tdata := nl.NewRtAttr(unix.IFLA_IFNAME, []byte(name))\n\treq.AddData(data)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// LinkSetAlias sets the alias of the link device.\n// Equivalent to: `ip link set dev $link alias $name`\nfunc LinkSetAlias(link Link, name string) error {\n\treturn pkgHandle.LinkSetAlias(link, name)\n}\n\n// LinkSetAlias sets the alias of the link device.\n// Equivalent to: `ip link set dev $link alias $name`\nfunc (h *Handle) LinkSetAlias(link Link, name string) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_SETLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\tdata := nl.NewRtAttr(unix.IFLA_IFALIAS, []byte(name))\n\treq.AddData(data)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// LinkSetHardwareAddr sets the hardware address of the link device.\n// Equivalent to: `ip link set $link address $hwaddr`\nfunc LinkSetHardwareAddr(link Link, hwaddr net.HardwareAddr) error {\n\treturn pkgHandle.LinkSetHardwareAddr(link, hwaddr)\n}\n\n// LinkSetHardwareAddr sets the hardware address of the link device.\n// Equivalent to: `ip link set $link address $hwaddr`\nfunc (h *Handle) LinkSetHardwareAddr(link Link, hwaddr net.HardwareAddr) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_SETLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\tdata := nl.NewRtAttr(unix.IFLA_ADDRESS, []byte(hwaddr))\n\treq.AddData(data)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// LinkSetVfHardwareAddr sets the hardware address of a vf for the link.\n// Equivalent to: `ip link set $link vf $vf mac $hwaddr`\nfunc LinkSetVfHardwareAddr(link Link, vf int, hwaddr net.HardwareAddr) error {\n\treturn pkgHandle.LinkSetVfHardwareAddr(link, vf, hwaddr)\n}\n\n// LinkSetVfHardwareAddr sets the hardware address of a vf for the link.\n// Equivalent to: `ip link set $link vf $vf mac $hwaddr`\nfunc (h *Handle) LinkSetVfHardwareAddr(link Link, vf int, hwaddr net.HardwareAddr) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_SETLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\tdata := nl.NewRtAttr(unix.IFLA_VFINFO_LIST, nil)\n\tinfo := data.AddRtAttr(nl.IFLA_VF_INFO, nil)\n\tvfmsg := nl.VfMac{\n\t\tVf: uint32(vf),\n\t}\n\tcopy(vfmsg.Mac[:], []byte(hwaddr))\n\tinfo.AddRtAttr(nl.IFLA_VF_MAC, vfmsg.Serialize())\n\treq.AddData(data)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// LinkSetVfVlan sets the vlan of a vf for the link.\n// Equivalent to: `ip link set $link vf $vf vlan $vlan`\nfunc LinkSetVfVlan(link Link, vf, vlan int) error {\n\treturn pkgHandle.LinkSetVfVlan(link, vf, vlan)\n}\n\n// LinkSetVfVlan sets the vlan of a vf for the link.\n// Equivalent to: `ip link set $link vf $vf vlan $vlan`\nfunc (h *Handle) LinkSetVfVlan(link Link, vf, vlan int) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_SETLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\tdata := nl.NewRtAttr(unix.IFLA_VFINFO_LIST, nil)\n\tinfo := data.AddRtAttr(nl.IFLA_VF_INFO, nil)\n\tvfmsg := nl.VfVlan{\n\t\tVf: uint32(vf),\n\t\tVlan: uint32(vlan),\n\t}\n\tinfo.AddRtAttr(nl.IFLA_VF_VLAN, vfmsg.Serialize())\n\treq.AddData(data)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// LinkSetVfVlanQos sets the vlan and qos priority of a vf for the link.\n// Equivalent to: `ip link set $link vf $vf vlan $vlan qos $qos`\nfunc LinkSetVfVlanQos(link Link, vf, vlan, qos int) error {\n\treturn pkgHandle.LinkSetVfVlanQos(link, vf, vlan, qos)\n}\n\n// LinkSetVfVlanQos sets the vlan and qos priority of a vf for the link.\n// Equivalent to: `ip link set $link vf $vf vlan $vlan qos $qos`\nfunc (h *Handle) LinkSetVfVlanQos(link Link, vf, vlan, qos int) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_SETLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\tdata := nl.NewRtAttr(unix.IFLA_VFINFO_LIST, nil)\n\tinfo := nl.NewRtAttrChild(data, nl.IFLA_VF_INFO, nil)\n\tvfmsg := nl.VfVlan{\n\t\tVf: uint32(vf),\n\t\tVlan: uint32(vlan),\n\t\tQos: uint32(qos),\n\t}\n\tnl.NewRtAttrChild(info, nl.IFLA_VF_VLAN, vfmsg.Serialize())\n\treq.AddData(data)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// LinkSetVfTxRate sets the tx rate of a vf for the link.\n// Equivalent to: `ip link set $link vf $vf rate $rate`\nfunc LinkSetVfTxRate(link Link, vf, rate int) error {\n\treturn pkgHandle.LinkSetVfTxRate(link, vf, rate)\n}\n\n// LinkSetVfTxRate sets the tx rate of a vf for the link.\n// Equivalent to: `ip link set $link vf $vf rate $rate`\nfunc (h *Handle) LinkSetVfTxRate(link Link, vf, rate int) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_SETLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\tdata := nl.NewRtAttr(unix.IFLA_VFINFO_LIST, nil)\n\tinfo := data.AddRtAttr(nl.IFLA_VF_INFO, nil)\n\tvfmsg := nl.VfTxRate{\n\t\tVf: uint32(vf),\n\t\tRate: uint32(rate),\n\t}\n\tinfo.AddRtAttr(nl.IFLA_VF_TX_RATE, vfmsg.Serialize())\n\treq.AddData(data)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// LinkSetVfRate sets the min and max tx rate of a vf for the link.\n// Equivalent to: `ip link set $link vf $vf min_tx_rate $min_rate max_tx_rate $max_rate`\nfunc LinkSetVfRate(link Link, vf, minRate, maxRate int) error {\n\treturn pkgHandle.LinkSetVfRate(link, vf, minRate, maxRate)\n}\n\n// LinkSetVfRate sets the min and max tx rate of a vf for the link.\n// Equivalent to: `ip link set $link vf $vf min_tx_rate $min_rate max_tx_rate $max_rate`\nfunc (h *Handle) LinkSetVfRate(link Link, vf, minRate, maxRate int) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_SETLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\tdata := nl.NewRtAttr(unix.IFLA_VFINFO_LIST, nil)\n\tinfo := data.AddRtAttr(nl.IFLA_VF_INFO, nil)\n\tvfmsg := nl.VfRate{\n\t\tVf: uint32(vf),\n\t\tMinTxRate: uint32(minRate),\n\t\tMaxTxRate: uint32(maxRate),\n\t}\n\tinfo.AddRtAttr(nl.IFLA_VF_RATE, vfmsg.Serialize())\n\treq.AddData(data)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// LinkSetVfState enables/disables virtual link state on a vf.\n// Equivalent to: `ip link set $link vf $vf state $state`\nfunc LinkSetVfState(link Link, vf int, state uint32) error {\n\treturn pkgHandle.LinkSetVfState(link, vf, state)\n}\n\n// LinkSetVfState enables/disables virtual link state on a vf.\n// Equivalent to: `ip link set $link vf $vf state $state`\nfunc (h *Handle) LinkSetVfState(link Link, vf int, state uint32) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_SETLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\tdata := nl.NewRtAttr(unix.IFLA_VFINFO_LIST, nil)\n\tinfo := data.AddRtAttr(nl.IFLA_VF_INFO, nil)\n\tvfmsg := nl.VfLinkState{\n\t\tVf: uint32(vf),\n\t\tLinkState: state,\n\t}\n\tinfo.AddRtAttr(nl.IFLA_VF_LINK_STATE, vfmsg.Serialize())\n\treq.AddData(data)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// LinkSetVfSpoofchk enables/disables spoof check on a vf for the link.\n// Equivalent to: `ip link set $link vf $vf spoofchk $check`\nfunc LinkSetVfSpoofchk(link Link, vf int, check bool) error {\n\treturn pkgHandle.LinkSetVfSpoofchk(link, vf, check)\n}\n\n// LinkSetVfSpoofchk enables/disables spoof check on a vf for the link.\n// Equivalent to: `ip link set $link vf $vf spoofchk $check`\nfunc (h *Handle) LinkSetVfSpoofchk(link Link, vf int, check bool) error {\n\tvar setting uint32\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_SETLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\tdata := nl.NewRtAttr(unix.IFLA_VFINFO_LIST, nil)\n\tinfo := data.AddRtAttr(nl.IFLA_VF_INFO, nil)\n\tif check {\n\t\tsetting = 1\n\t}\n\tvfmsg := nl.VfSpoofchk{\n\t\tVf: uint32(vf),\n\t\tSetting: setting,\n\t}\n\tinfo.AddRtAttr(nl.IFLA_VF_SPOOFCHK, vfmsg.Serialize())\n\treq.AddData(data)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// LinkSetVfTrust enables/disables trust state on a vf for the link.\n// Equivalent to: `ip link set $link vf $vf trust $state`\nfunc LinkSetVfTrust(link Link, vf int, state bool) error {\n\treturn pkgHandle.LinkSetVfTrust(link, vf, state)\n}\n\n// LinkSetVfTrust enables/disables trust state on a vf for the link.\n// Equivalent to: `ip link set $link vf $vf trust $state`\nfunc (h *Handle) LinkSetVfTrust(link Link, vf int, state bool) error {\n\tvar setting uint32\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_SETLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\tdata := nl.NewRtAttr(unix.IFLA_VFINFO_LIST, nil)\n\tinfo := data.AddRtAttr(nl.IFLA_VF_INFO, nil)\n\tif state {\n\t\tsetting = 1\n\t}\n\tvfmsg := nl.VfTrust{\n\t\tVf: uint32(vf),\n\t\tSetting: setting,\n\t}\n\tinfo.AddRtAttr(nl.IFLA_VF_TRUST, vfmsg.Serialize())\n\treq.AddData(data)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// LinkSetVfNodeGUID sets the node GUID of a vf for the link.\n// Equivalent to: `ip link set dev $link vf $vf node_guid $nodeguid`\nfunc LinkSetVfNodeGUID(link Link, vf int, nodeguid net.HardwareAddr) error {\n\treturn pkgHandle.LinkSetVfGUID(link, vf, nodeguid, nl.IFLA_VF_IB_NODE_GUID)\n}\n\n// LinkSetVfPortGUID sets the port GUID of a vf for the link.\n// Equivalent to: `ip link set dev $link vf $vf port_guid $portguid`\nfunc LinkSetVfPortGUID(link Link, vf int, portguid net.HardwareAddr) error {\n\treturn pkgHandle.LinkSetVfGUID(link, vf, portguid, nl.IFLA_VF_IB_PORT_GUID)\n}\n\n// LinkSetVfGUID sets the node or port GUID of a vf for the link.\nfunc (h *Handle) LinkSetVfGUID(link Link, vf int, vfGuid net.HardwareAddr, guidType int) error {\n\tvar err error\n\tvar guid uint64\n\n\tbuf := bytes.NewBuffer(vfGuid)\n\terr = binary.Read(buf, binary.BigEndian, &guid)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_SETLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\tdata := nl.NewRtAttr(unix.IFLA_VFINFO_LIST, nil)\n\tinfo := data.AddRtAttr(nl.IFLA_VF_INFO, nil)\n\tvfmsg := nl.VfGUID{\n\t\tVf: uint32(vf),\n\t\tGUID: guid,\n\t}\n\tinfo.AddRtAttr(guidType, vfmsg.Serialize())\n\treq.AddData(data)\n\n\t_, err = req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// LinkSetMaster sets the master of the link device.\n// Equivalent to: `ip link set $link master $master`\nfunc LinkSetMaster(link Link, master Link) error {\n\treturn pkgHandle.LinkSetMaster(link, master)\n}\n\n// LinkSetMaster sets the master of the link device.\n// Equivalent to: `ip link set $link master $master`\nfunc (h *Handle) LinkSetMaster(link Link, master Link) error {\n\tindex := 0\n\tif master != nil {\n\t\tmasterBase := master.Attrs()\n\t\th.ensureIndex(masterBase)\n\t\tindex = masterBase.Index\n\t}\n\tif index <= 0 {\n\t\treturn fmt.Errorf(\"Device does not exist\")\n\t}\n\treturn h.LinkSetMasterByIndex(link, index)\n}\n\n// LinkSetNoMaster removes the master of the link device.\n// Equivalent to: `ip link set $link nomaster`\nfunc LinkSetNoMaster(link Link) error {\n\treturn pkgHandle.LinkSetNoMaster(link)\n}\n\n// LinkSetNoMaster removes the master of the link device.\n// Equivalent to: `ip link set $link nomaster`\nfunc (h *Handle) LinkSetNoMaster(link Link) error {\n\treturn h.LinkSetMasterByIndex(link, 0)\n}\n\n// LinkSetMasterByIndex sets the master of the link device.\n// Equivalent to: `ip link set $link master $master`\nfunc LinkSetMasterByIndex(link Link, masterIndex int) error {\n\treturn pkgHandle.LinkSetMasterByIndex(link, masterIndex)\n}\n\n// LinkSetMasterByIndex sets the master of the link device.\n// Equivalent to: `ip link set $link master $master`\nfunc (h *Handle) LinkSetMasterByIndex(link Link, masterIndex int) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_SETLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\tb := make([]byte, 4)\n\tnative.PutUint32(b, uint32(masterIndex))\n\n\tdata := nl.NewRtAttr(unix.IFLA_MASTER, b)\n\treq.AddData(data)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// LinkSetNsPid puts the device into a new network namespace. The\n// pid must be a pid of a running process.\n// Equivalent to: `ip link set $link netns $pid`\nfunc LinkSetNsPid(link Link, nspid int) error {\n\treturn pkgHandle.LinkSetNsPid(link, nspid)\n}\n\n// LinkSetNsPid puts the device into a new network namespace. The\n// pid must be a pid of a running process.\n// Equivalent to: `ip link set $link netns $pid`\nfunc (h *Handle) LinkSetNsPid(link Link, nspid int) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_SETLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\tb := make([]byte, 4)\n\tnative.PutUint32(b, uint32(nspid))\n\n\tdata := nl.NewRtAttr(unix.IFLA_NET_NS_PID, b)\n\treq.AddData(data)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// LinkSetNsFd puts the device into a new network namespace. The\n// fd must be an open file descriptor to a network namespace.\n// Similar to: `ip link set $link netns $ns`\nfunc LinkSetNsFd(link Link, fd int) error {\n\treturn pkgHandle.LinkSetNsFd(link, fd)\n}\n\n// LinkSetNsFd puts the device into a new network namespace. The\n// fd must be an open file descriptor to a network namespace.\n// Similar to: `ip link set $link netns $ns`\nfunc (h *Handle) LinkSetNsFd(link Link, fd int) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_SETLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\tb := make([]byte, 4)\n\tnative.PutUint32(b, uint32(fd))\n\n\tdata := nl.NewRtAttr(unix.IFLA_NET_NS_FD, b)\n\treq.AddData(data)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// LinkSetXdpFd adds a bpf function to the driver. The fd must be a bpf\n// program loaded with bpf(type=BPF_PROG_TYPE_XDP)\nfunc LinkSetXdpFd(link Link, fd int) error {\n\treturn LinkSetXdpFdWithFlags(link, fd, 0)\n}\n\n// LinkSetXdpFdWithFlags adds a bpf function to the driver with the given\n// options. The fd must be a bpf program loaded with bpf(type=BPF_PROG_TYPE_XDP)\nfunc LinkSetXdpFdWithFlags(link Link, fd, flags int) error {\n\tbase := link.Attrs()\n\tensureIndex(base)\n\treq := nl.NewNetlinkRequest(unix.RTM_SETLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\taddXdpAttrs(&LinkXdp{Fd: fd, Flags: uint32(flags)}, req)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\nfunc boolAttr(val bool) []byte {\n\tvar v uint8\n\tif val {\n\t\tv = 1\n\t}\n\treturn nl.Uint8Attr(v)\n}\n\ntype vxlanPortRange struct {\n\tLo, Hi uint16\n}\n\nfunc addVxlanAttrs(vxlan *Vxlan, linkInfo *nl.RtAttr) {\n\tdata := linkInfo.AddRtAttr(nl.IFLA_INFO_DATA, nil)\n\n\tif vxlan.FlowBased {\n\t\tvxlan.VxlanId = 0\n\t}\n\n\tdata.AddRtAttr(nl.IFLA_VXLAN_ID, nl.Uint32Attr(uint32(vxlan.VxlanId)))\n\n\tif vxlan.VtepDevIndex != 0 {\n\t\tdata.AddRtAttr(nl.IFLA_VXLAN_LINK, nl.Uint32Attr(uint32(vxlan.VtepDevIndex)))\n\t}\n\tif vxlan.SrcAddr != nil {\n\t\tip := vxlan.SrcAddr.To4()\n\t\tif ip != nil {\n\t\t\tdata.AddRtAttr(nl.IFLA_VXLAN_LOCAL, []byte(ip))\n\t\t} else {\n\t\t\tip = vxlan.SrcAddr.To16()\n\t\t\tif ip != nil {\n\t\t\t\tdata.AddRtAttr(nl.IFLA_VXLAN_LOCAL6, []byte(ip))\n\t\t\t}\n\t\t}\n\t}\n\tif vxlan.Group != nil {\n\t\tgroup := vxlan.Group.To4()\n\t\tif group != nil {\n\t\t\tdata.AddRtAttr(nl.IFLA_VXLAN_GROUP, []byte(group))\n\t\t} else {\n\t\t\tgroup = vxlan.Group.To16()\n\t\t\tif group != nil {\n\t\t\t\tdata.AddRtAttr(nl.IFLA_VXLAN_GROUP6, []byte(group))\n\t\t\t}\n\t\t}\n\t}\n\n\tdata.AddRtAttr(nl.IFLA_VXLAN_TTL, nl.Uint8Attr(uint8(vxlan.TTL)))\n\tdata.AddRtAttr(nl.IFLA_VXLAN_TOS, nl.Uint8Attr(uint8(vxlan.TOS)))\n\tdata.AddRtAttr(nl.IFLA_VXLAN_LEARNING, boolAttr(vxlan.Learning))\n\tdata.AddRtAttr(nl.IFLA_VXLAN_PROXY, boolAttr(vxlan.Proxy))\n\tdata.AddRtAttr(nl.IFLA_VXLAN_RSC, boolAttr(vxlan.RSC))\n\tdata.AddRtAttr(nl.IFLA_VXLAN_L2MISS, boolAttr(vxlan.L2miss))\n\tdata.AddRtAttr(nl.IFLA_VXLAN_L3MISS, boolAttr(vxlan.L3miss))\n\tdata.AddRtAttr(nl.IFLA_VXLAN_UDP_ZERO_CSUM6_TX, boolAttr(vxlan.UDP6ZeroCSumTx))\n\tdata.AddRtAttr(nl.IFLA_VXLAN_UDP_ZERO_CSUM6_RX, boolAttr(vxlan.UDP6ZeroCSumRx))\n\n\tif vxlan.UDPCSum {\n\t\tdata.AddRtAttr(nl.IFLA_VXLAN_UDP_CSUM, boolAttr(vxlan.UDPCSum))\n\t}\n\tif vxlan.GBP {\n\t\tdata.AddRtAttr(nl.IFLA_VXLAN_GBP, []byte{})\n\t}\n\tif vxlan.FlowBased {\n\t\tdata.AddRtAttr(nl.IFLA_VXLAN_FLOWBASED, boolAttr(vxlan.FlowBased))\n\t}\n\tif vxlan.NoAge {\n\t\tdata.AddRtAttr(nl.IFLA_VXLAN_AGEING, nl.Uint32Attr(0))\n\t} else if vxlan.Age > 0 {\n\t\tdata.AddRtAttr(nl.IFLA_VXLAN_AGEING, nl.Uint32Attr(uint32(vxlan.Age)))\n\t}\n\tif vxlan.Limit > 0 {\n\t\tdata.AddRtAttr(nl.IFLA_VXLAN_LIMIT, nl.Uint32Attr(uint32(vxlan.Limit)))\n\t}\n\tif vxlan.Port > 0 {\n\t\tdata.AddRtAttr(nl.IFLA_VXLAN_PORT, htons(uint16(vxlan.Port)))\n\t}\n\tif vxlan.PortLow > 0 || vxlan.PortHigh > 0 {\n\t\tpr := vxlanPortRange{uint16(vxlan.PortLow), uint16(vxlan.PortHigh)}\n\n\t\tbuf := new(bytes.Buffer)\n\t\tbinary.Write(buf, binary.BigEndian, &pr)\n\n\t\tdata.AddRtAttr(nl.IFLA_VXLAN_PORT_RANGE, buf.Bytes())\n\t}\n}\n\nfunc addBondAttrs(bond *Bond, linkInfo *nl.RtAttr) {\n\tdata := linkInfo.AddRtAttr(nl.IFLA_INFO_DATA, nil)\n\tif bond.Mode >= 0 {\n\t\tdata.AddRtAttr(nl.IFLA_BOND_MODE, nl.Uint8Attr(uint8(bond.Mode)))\n\t}\n\tif bond.ActiveSlave >= 0 {\n\t\tdata.AddRtAttr(nl.IFLA_BOND_ACTIVE_SLAVE, nl.Uint32Attr(uint32(bond.ActiveSlave)))\n\t}\n\tif bond.Miimon >= 0 {\n\t\tdata.AddRtAttr(nl.IFLA_BOND_MIIMON, nl.Uint32Attr(uint32(bond.Miimon)))\n\t}\n\tif bond.UpDelay >= 0 {\n\t\tdata.AddRtAttr(nl.IFLA_BOND_UPDELAY, nl.Uint32Attr(uint32(bond.UpDelay)))\n\t}\n\tif bond.DownDelay >= 0 {\n\t\tdata.AddRtAttr(nl.IFLA_BOND_DOWNDELAY, nl.Uint32Attr(uint32(bond.DownDelay)))\n\t}\n\tif bond.UseCarrier >= 0 {\n\t\tdata.AddRtAttr(nl.IFLA_BOND_USE_CARRIER, nl.Uint8Attr(uint8(bond.UseCarrier)))\n\t}\n\tif bond.ArpInterval >= 0 {\n\t\tdata.AddRtAttr(nl.IFLA_BOND_ARP_INTERVAL, nl.Uint32Attr(uint32(bond.ArpInterval)))\n\t}\n\tif bond.ArpIpTargets != nil {\n\t\tmsg := data.AddRtAttr(nl.IFLA_BOND_ARP_IP_TARGET, nil)\n\t\tfor i := range bond.ArpIpTargets {\n\t\t\tip := bond.ArpIpTargets[i].To4()\n\t\t\tif ip != nil {\n\t\t\t\tmsg.AddRtAttr(i, []byte(ip))\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tip = bond.ArpIpTargets[i].To16()\n\t\t\tif ip != nil {\n\t\t\t\tmsg.AddRtAttr(i, []byte(ip))\n\t\t\t}\n\t\t}\n\t}\n\tif bond.ArpValidate >= 0 {\n\t\tdata.AddRtAttr(nl.IFLA_BOND_ARP_VALIDATE, nl.Uint32Attr(uint32(bond.ArpValidate)))\n\t}\n\tif bond.ArpAllTargets >= 0 {\n\t\tdata.AddRtAttr(nl.IFLA_BOND_ARP_ALL_TARGETS, nl.Uint32Attr(uint32(bond.ArpAllTargets)))\n\t}\n\tif bond.Primary >= 0 {\n\t\tdata.AddRtAttr(nl.IFLA_BOND_PRIMARY, nl.Uint32Attr(uint32(bond.Primary)))\n\t}\n\tif bond.PrimaryReselect >= 0 {\n\t\tdata.AddRtAttr(nl.IFLA_BOND_PRIMARY_RESELECT, nl.Uint8Attr(uint8(bond.PrimaryReselect)))\n\t}\n\tif bond.FailOverMac >= 0 {\n\t\tdata.AddRtAttr(nl.IFLA_BOND_FAIL_OVER_MAC, nl.Uint8Attr(uint8(bond.FailOverMac)))\n\t}\n\tif bond.XmitHashPolicy >= 0 {\n\t\tdata.AddRtAttr(nl.IFLA_BOND_XMIT_HASH_POLICY, nl.Uint8Attr(uint8(bond.XmitHashPolicy)))\n\t}\n\tif bond.ResendIgmp >= 0 {\n\t\tdata.AddRtAttr(nl.IFLA_BOND_RESEND_IGMP, nl.Uint32Attr(uint32(bond.ResendIgmp)))\n\t}\n\tif bond.NumPeerNotif >= 0 {\n\t\tdata.AddRtAttr(nl.IFLA_BOND_NUM_PEER_NOTIF, nl.Uint8Attr(uint8(bond.NumPeerNotif)))\n\t}\n\tif bond.AllSlavesActive >= 0 {\n\t\tdata.AddRtAttr(nl.IFLA_BOND_ALL_SLAVES_ACTIVE, nl.Uint8Attr(uint8(bond.AllSlavesActive)))\n\t}\n\tif bond.MinLinks >= 0 {\n\t\tdata.AddRtAttr(nl.IFLA_BOND_MIN_LINKS, nl.Uint32Attr(uint32(bond.MinLinks)))\n\t}\n\tif bond.LpInterval >= 0 {\n\t\tdata.AddRtAttr(nl.IFLA_BOND_LP_INTERVAL, nl.Uint32Attr(uint32(bond.LpInterval)))\n\t}\n\tif bond.PacketsPerSlave >= 0 {\n\t\tdata.AddRtAttr(nl.IFLA_BOND_PACKETS_PER_SLAVE, nl.Uint32Attr(uint32(bond.PacketsPerSlave)))\n\t}\n\tif bond.LacpRate >= 0 {\n\t\tdata.AddRtAttr(nl.IFLA_BOND_AD_LACP_RATE, nl.Uint8Attr(uint8(bond.LacpRate)))\n\t}\n\tif bond.AdSelect >= 0 {\n\t\tdata.AddRtAttr(nl.IFLA_BOND_AD_SELECT, nl.Uint8Attr(uint8(bond.AdSelect)))\n\t}\n\tif bond.AdActorSysPrio >= 0 {\n\t\tdata.AddRtAttr(nl.IFLA_BOND_AD_ACTOR_SYS_PRIO, nl.Uint16Attr(uint16(bond.AdActorSysPrio)))\n\t}\n\tif bond.AdUserPortKey >= 0 {\n\t\tdata.AddRtAttr(nl.IFLA_BOND_AD_USER_PORT_KEY, nl.Uint16Attr(uint16(bond.AdUserPortKey)))\n\t}\n\tif bond.AdActorSystem != nil {\n\t\tdata.AddRtAttr(nl.IFLA_BOND_AD_ACTOR_SYSTEM, []byte(bond.AdActorSystem))\n\t}\n\tif bond.TlbDynamicLb >= 0 {\n\t\tdata.AddRtAttr(nl.IFLA_BOND_TLB_DYNAMIC_LB, nl.Uint8Attr(uint8(bond.TlbDynamicLb)))\n\t}\n}\n\nfunc cleanupFds(fds []*os.File) {\n\tfor _, f := range fds {\n\t\tf.Close()\n\t}\n}\n\n// LinkAdd adds a new link device. The type and features of the device\n// are taken from the parameters in the link object.\n// Equivalent to: `ip link add $link`\nfunc LinkAdd(link Link) error {\n\treturn pkgHandle.LinkAdd(link)\n}\n\n// LinkAdd adds a new link device. The type and features of the device\n// are taken from the parameters in the link object.\n// Equivalent to: `ip link add $link`\nfunc (h *Handle) LinkAdd(link Link) error {\n\treturn h.linkModify(link, unix.NLM_F_CREATE|unix.NLM_F_EXCL|unix.NLM_F_ACK)\n}\n\nfunc (h *Handle) LinkModify(link Link) error {\n\treturn h.linkModify(link, unix.NLM_F_REQUEST|unix.NLM_F_ACK)\n}\n\nfunc (h *Handle) linkModify(link Link, flags int) error {\n\t// TODO: support extra data for macvlan\n\tbase := link.Attrs()\n\n\t// if tuntap, then the name can be empty, OS will provide a name\n\ttuntap, isTuntap := link.(*Tuntap)\n\n\tif base.Name == \"\" && !isTuntap {\n\t\treturn fmt.Errorf(\"LinkAttrs.Name cannot be empty\")\n\t}\n\n\tif isTuntap {\n\t\tif tuntap.Mode < unix.IFF_TUN || tuntap.Mode > unix.IFF_TAP {\n\t\t\treturn fmt.Errorf(\"Tuntap.Mode %v unknown\", tuntap.Mode)\n\t\t}\n\n\t\tqueues := tuntap.Queues\n\n\t\tvar fds []*os.File\n\t\tvar req ifReq\n\t\tcopy(req.Name[:15], base.Name)\n\n\t\treq.Flags = uint16(tuntap.Flags)\n\n\t\tif queues == 0 { //Legacy compatibility\n\t\t\tqueues = 1\n\t\t\tif tuntap.Flags == 0 {\n\t\t\t\treq.Flags = uint16(TUNTAP_DEFAULTS)\n\t\t\t}\n\t\t} else {\n\t\t\t// For best peformance set Flags to TUNTAP_MULTI_QUEUE_DEFAULTS | TUNTAP_VNET_HDR\n\t\t\t// when a) KVM has support for this ABI and\n\t\t\t// b) the value of the flag is queryable using the TUNGETIFF ioctl\n\t\t\tif tuntap.Flags == 0 {\n\t\t\t\treq.Flags = uint16(TUNTAP_MULTI_QUEUE_DEFAULTS)\n\t\t\t}\n\t\t}\n\n\t\treq.Flags |= uint16(tuntap.Mode)\n\t\tconst TUN = \"/dev/net/tun\"\n\t\tfor i := 0; i < queues; i++ {\n\t\t\tlocalReq := req\n\t\t\tfd, err := unix.Open(TUN, os.O_RDWR|syscall.O_CLOEXEC, 0)\n\t\t\tif err != nil {\n\t\t\t\tcleanupFds(fds)\n\t\t\t\treturn err\n\t\t\t}\n\n\t\t\t_, _, errno := unix.Syscall(unix.SYS_IOCTL, uintptr(fd), uintptr(unix.TUNSETIFF), uintptr(unsafe.Pointer(&localReq)))\n\t\t\tif errno != 0 {\n\t\t\t\t// close the new fd\n\t\t\t\tunix.Close(fd)\n\t\t\t\t// and the already opened ones\n\t\t\t\tcleanupFds(fds)\n\t\t\t\treturn fmt.Errorf(\"Tuntap IOCTL TUNSETIFF failed [%d], errno %v\", i, errno)\n\t\t\t}\n\n\t\t\t_, _, errno = syscall.Syscall(syscall.SYS_IOCTL, uintptr(fd), syscall.TUNSETOWNER, uintptr(tuntap.Owner))\n\t\t\tif errno != 0 {\n\t\t\t\tcleanupFds(fds)\n\t\t\t\treturn fmt.Errorf(\"Tuntap IOCTL TUNSETOWNER failed [%d], errno %v\", i, errno)\n\t\t\t}\n\n\t\t\t_, _, errno = syscall.Syscall(syscall.SYS_IOCTL, uintptr(fd), syscall.TUNSETGROUP, uintptr(tuntap.Group))\n\t\t\tif errno != 0 {\n\t\t\t\tcleanupFds(fds)\n\t\t\t\treturn fmt.Errorf(\"Tuntap IOCTL TUNSETGROUP failed [%d], errno %v\", i, errno)\n\t\t\t}\n\n\t\t\t// Set the tun device to non-blocking before use. The below comment\n\t\t\t// taken from:\n\t\t\t//\n\t\t\t// https://github.com/mistsys/tuntap/commit/161418c25003bbee77d085a34af64d189df62bea\n\t\t\t//\n\t\t\t// Note there is a complication because in go, if a device node is\n\t\t\t// opened, go sets it to use nonblocking I/O. However a /dev/net/tun\n\t\t\t// doesn't work with epoll until after the TUNSETIFF ioctl has been\n\t\t\t// done. So we open the unix fd directly, do the ioctl, then put the\n\t\t\t// fd in nonblocking mode, an then finally wrap it in a os.File,\n\t\t\t// which will see the nonblocking mode and add the fd to the\n\t\t\t// pollable set, so later on when we Read() from it blocked the\n\t\t\t// calling thread in the kernel.\n\t\t\t//\n\t\t\t// See\n\t\t\t// https://github.com/golang/go/issues/30426\n\t\t\t// which got exposed in go 1.13 by the fix to\n\t\t\t// https://github.com/golang/go/issues/30624\n\t\t\terr = unix.SetNonblock(fd, true)\n\t\t\tif err != nil {\n\t\t\t\tcleanupFds(fds)\n\t\t\t\treturn fmt.Errorf(\"Tuntap set to non-blocking failed [%d], err %v\", i, err)\n\t\t\t}\n\n\t\t\t// create the file from the file descriptor and store it\n\t\t\tfile := os.NewFile(uintptr(fd), TUN)\n\t\t\tfds = append(fds, file)\n\n\t\t\t// 1) we only care for the name of the first tap in the multi queue set\n\t\t\t// 2) if the original name was empty, the localReq has now the actual name\n\t\t\t//\n\t\t\t// In addition:\n\t\t\t// This ensures that the link name is always identical to what the kernel returns.\n\t\t\t// Not only in case of an empty name, but also when using name templates.\n\t\t\t// e.g. when the provided name is \"tap%d\", the kernel replaces %d with the next available number.\n\t\t\tif i == 0 {\n\t\t\t\tlink.Attrs().Name = strings.Trim(string(localReq.Name[:]), \"\\x00\")\n\t\t\t}\n\n\t\t}\n\n\t\t// only persist interface if NonPersist is NOT set\n\t\tif !tuntap.NonPersist {\n\t\t\t_, _, errno := unix.Syscall(unix.SYS_IOCTL, fds[0].Fd(), uintptr(unix.TUNSETPERSIST), 1)\n\t\t\tif errno != 0 {\n\t\t\t\tcleanupFds(fds)\n\t\t\t\treturn fmt.Errorf(\"Tuntap IOCTL TUNSETPERSIST failed, errno %v\", errno)\n\t\t\t}\n\t\t}\n\n\t\th.ensureIndex(base)\n\n\t\t// can't set master during create, so set it afterwards\n\t\tif base.MasterIndex != 0 {\n\t\t\t// TODO: verify MasterIndex is actually a bridge?\n\t\t\terr := h.LinkSetMasterByIndex(link, base.MasterIndex)\n\t\t\tif err != nil {\n\t\t\t\t// un-persist (e.g. allow the interface to be removed) the tuntap\n\t\t\t\t// should not hurt if not set prior, condition might be not needed\n\t\t\t\tif !tuntap.NonPersist {\n\t\t\t\t\t_, _, _ = unix.Syscall(unix.SYS_IOCTL, fds[0].Fd(), uintptr(unix.TUNSETPERSIST), 0)\n\t\t\t\t}\n\t\t\t\tcleanupFds(fds)\n\t\t\t\treturn err\n\t\t\t}\n\t\t}\n\n\t\tif tuntap.Queues == 0 {\n\t\t\tcleanupFds(fds)\n\t\t} else {\n\t\t\ttuntap.Fds = fds\n\t\t}\n\n\t\treturn nil\n\t}\n\n\treq := h.newNetlinkRequest(unix.RTM_NEWLINK, flags)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\t// TODO: make it shorter\n\tif base.Flags&net.FlagUp != 0 {\n\t\tmsg.Change = unix.IFF_UP\n\t\tmsg.Flags = unix.IFF_UP\n\t}\n\tif base.Flags&net.FlagBroadcast != 0 {\n\t\tmsg.Change |= unix.IFF_BROADCAST\n\t\tmsg.Flags |= unix.IFF_BROADCAST\n\t}\n\tif base.Flags&net.FlagLoopback != 0 {\n\t\tmsg.Change |= unix.IFF_LOOPBACK\n\t\tmsg.Flags |= unix.IFF_LOOPBACK\n\t}\n\tif base.Flags&net.FlagPointToPoint != 0 {\n\t\tmsg.Change |= unix.IFF_POINTOPOINT\n\t\tmsg.Flags |= unix.IFF_POINTOPOINT\n\t}\n\tif base.Flags&net.FlagMulticast != 0 {\n\t\tmsg.Change |= unix.IFF_MULTICAST\n\t\tmsg.Flags |= unix.IFF_MULTICAST\n\t}\n\tif base.Index != 0 {\n\t\tmsg.Index = int32(base.Index)\n\t}\n\n\treq.AddData(msg)\n\n\tif base.ParentIndex != 0 {\n\t\tb := make([]byte, 4)\n\t\tnative.PutUint32(b, uint32(base.ParentIndex))\n\t\tdata := nl.NewRtAttr(unix.IFLA_LINK, b)\n\t\treq.AddData(data)\n\t} else if link.Type() == \"ipvlan\" || link.Type() == \"ipoib\" {\n\t\treturn fmt.Errorf(\"Can't create %s link without ParentIndex\", link.Type())\n\t}\n\n\tnameData := nl.NewRtAttr(unix.IFLA_IFNAME, nl.ZeroTerminated(base.Name))\n\treq.AddData(nameData)\n\n\tif base.Alias != \"\" {\n\t\talias := nl.NewRtAttr(unix.IFLA_IFALIAS, []byte(base.Alias))\n\t\treq.AddData(alias)\n\t}\n\n\tif base.MTU > 0 {\n\t\tmtu := nl.NewRtAttr(unix.IFLA_MTU, nl.Uint32Attr(uint32(base.MTU)))\n\t\treq.AddData(mtu)\n\t}\n\n\tif base.TxQLen >= 0 {\n\t\tqlen := nl.NewRtAttr(unix.IFLA_TXQLEN, nl.Uint32Attr(uint32(base.TxQLen)))\n\t\treq.AddData(qlen)\n\t}\n\n\tif base.HardwareAddr != nil {\n\t\thwaddr := nl.NewRtAttr(unix.IFLA_ADDRESS, []byte(base.HardwareAddr))\n\t\treq.AddData(hwaddr)\n\t}\n\n\tif base.NumTxQueues > 0 {\n\t\ttxqueues := nl.NewRtAttr(unix.IFLA_NUM_TX_QUEUES, nl.Uint32Attr(uint32(base.NumTxQueues)))\n\t\treq.AddData(txqueues)\n\t}\n\n\tif base.NumRxQueues > 0 {\n\t\trxqueues := nl.NewRtAttr(unix.IFLA_NUM_RX_QUEUES, nl.Uint32Attr(uint32(base.NumRxQueues)))\n\t\treq.AddData(rxqueues)\n\t}\n\n\tif base.GSOMaxSegs > 0 {\n\t\tgsoAttr := nl.NewRtAttr(unix.IFLA_GSO_MAX_SEGS, nl.Uint32Attr(base.GSOMaxSegs))\n\t\treq.AddData(gsoAttr)\n\t}\n\n\tif base.GSOMaxSize > 0 {\n\t\tgsoAttr := nl.NewRtAttr(unix.IFLA_GSO_MAX_SIZE, nl.Uint32Attr(base.GSOMaxSize))\n\t\treq.AddData(gsoAttr)\n\t}\n\n\tif base.Group > 0 {\n\t\tgroupAttr := nl.NewRtAttr(unix.IFLA_GROUP, nl.Uint32Attr(base.Group))\n\t\treq.AddData(groupAttr)\n\t}\n\n\tif base.Namespace != nil {\n\t\tvar attr *nl.RtAttr\n\t\tswitch ns := base.Namespace.(type) {\n\t\tcase NsPid:\n\t\t\tval := nl.Uint32Attr(uint32(ns))\n\t\t\tattr = nl.NewRtAttr(unix.IFLA_NET_NS_PID, val)\n\t\tcase NsFd:\n\t\t\tval := nl.Uint32Attr(uint32(ns))\n\t\t\tattr = nl.NewRtAttr(unix.IFLA_NET_NS_FD, val)\n\t\t}\n\n\t\treq.AddData(attr)\n\t}\n\n\tif base.Xdp != nil {\n\t\taddXdpAttrs(base.Xdp, req)\n\t}\n\n\tlinkInfo := nl.NewRtAttr(unix.IFLA_LINKINFO, nil)\n\tlinkInfo.AddRtAttr(nl.IFLA_INFO_KIND, nl.NonZeroTerminated(link.Type()))\n\n\tswitch link := link.(type) {\n\tcase *Vlan:\n\t\tb := make([]byte, 2)\n\t\tnative.PutUint16(b, uint16(link.VlanId))\n\t\tdata := linkInfo.AddRtAttr(nl.IFLA_INFO_DATA, nil)\n\t\tdata.AddRtAttr(nl.IFLA_VLAN_ID, b)\n\n\t\tif link.VlanProtocol != VLAN_PROTOCOL_UNKNOWN {\n\t\t\tdata.AddRtAttr(nl.IFLA_VLAN_PROTOCOL, htons(uint16(link.VlanProtocol)))\n\t\t}\n\tcase *Veth:\n\t\tdata := linkInfo.AddRtAttr(nl.IFLA_INFO_DATA, nil)\n\t\tpeer := data.AddRtAttr(nl.VETH_INFO_PEER, nil)\n\t\tnl.NewIfInfomsgChild(peer, unix.AF_UNSPEC)\n\t\tpeer.AddRtAttr(unix.IFLA_IFNAME, nl.ZeroTerminated(link.PeerName))\n\t\tif base.TxQLen >= 0 {\n\t\t\tpeer.AddRtAttr(unix.IFLA_TXQLEN, nl.Uint32Attr(uint32(base.TxQLen)))\n\t\t}\n\t\tif base.NumTxQueues > 0 {\n\t\t\tpeer.AddRtAttr(unix.IFLA_NUM_TX_QUEUES, nl.Uint32Attr(uint32(base.NumTxQueues)))\n\t\t}\n\t\tif base.NumRxQueues > 0 {\n\t\t\tpeer.AddRtAttr(unix.IFLA_NUM_RX_QUEUES, nl.Uint32Attr(uint32(base.NumRxQueues)))\n\t\t}\n\t\tif base.MTU > 0 {\n\t\t\tpeer.AddRtAttr(unix.IFLA_MTU, nl.Uint32Attr(uint32(base.MTU)))\n\t\t}\n\t\tif link.PeerHardwareAddr != nil {\n\t\t\tpeer.AddRtAttr(unix.IFLA_ADDRESS, []byte(link.PeerHardwareAddr))\n\t\t}\n\t\tif link.PeerNamespace != nil {\n\t\t\tswitch ns := link.PeerNamespace.(type) {\n\t\t\tcase NsPid:\n\t\t\t\tval := nl.Uint32Attr(uint32(ns))\n\t\t\t\tpeer.AddRtAttr(unix.IFLA_NET_NS_PID, val)\n\t\t\tcase NsFd:\n\t\t\t\tval := nl.Uint32Attr(uint32(ns))\n\t\t\t\tpeer.AddRtAttr(unix.IFLA_NET_NS_FD, val)\n\t\t\t}\n\t\t}\n\tcase *Vxlan:\n\t\taddVxlanAttrs(link, linkInfo)\n\tcase *Bond:\n\t\taddBondAttrs(link, linkInfo)\n\tcase *IPVlan:\n\t\tdata := linkInfo.AddRtAttr(nl.IFLA_INFO_DATA, nil)\n\t\tdata.AddRtAttr(nl.IFLA_IPVLAN_MODE, nl.Uint16Attr(uint16(link.Mode)))\n\t\tdata.AddRtAttr(nl.IFLA_IPVLAN_FLAG, nl.Uint16Attr(uint16(link.Flag)))\n\tcase *IPVtap:\n\t\tdata := linkInfo.AddRtAttr(nl.IFLA_INFO_DATA, nil)\n\t\tdata.AddRtAttr(nl.IFLA_IPVLAN_MODE, nl.Uint16Attr(uint16(link.Mode)))\n\t\tdata.AddRtAttr(nl.IFLA_IPVLAN_FLAG, nl.Uint16Attr(uint16(link.Flag)))\n\tcase *Macvlan:\n\t\tif link.Mode != MACVLAN_MODE_DEFAULT {\n\t\t\tdata := linkInfo.AddRtAttr(nl.IFLA_INFO_DATA, nil)\n\t\t\tdata.AddRtAttr(nl.IFLA_MACVLAN_MODE, nl.Uint32Attr(macvlanModes[link.Mode]))\n\t\t}\n\tcase *Macvtap:\n\t\tif link.Mode != MACVLAN_MODE_DEFAULT {\n\t\t\tdata := linkInfo.AddRtAttr(nl.IFLA_INFO_DATA, nil)\n\t\t\tdata.AddRtAttr(nl.IFLA_MACVLAN_MODE, nl.Uint32Attr(macvlanModes[link.Mode]))\n\t\t}\n\tcase *Geneve:\n\t\taddGeneveAttrs(link, linkInfo)\n\tcase *Gretap:\n\t\taddGretapAttrs(link, linkInfo)\n\tcase *Iptun:\n\t\taddIptunAttrs(link, linkInfo)\n\tcase *Ip6tnl:\n\t\taddIp6tnlAttrs(link, linkInfo)\n\tcase *Sittun:\n\t\taddSittunAttrs(link, linkInfo)\n\tcase *Gretun:\n\t\taddGretunAttrs(link, linkInfo)\n\tcase *Vti:\n\t\taddVtiAttrs(link, linkInfo)\n\tcase *Vrf:\n\t\taddVrfAttrs(link, linkInfo)\n\tcase *Bridge:\n\t\taddBridgeAttrs(link, linkInfo)\n\tcase *GTP:\n\t\taddGTPAttrs(link, linkInfo)\n\tcase *Xfrmi:\n\t\taddXfrmiAttrs(link, linkInfo)\n\tcase *IPoIB:\n\t\taddIPoIBAttrs(link, linkInfo)\n\t}\n\n\treq.AddData(linkInfo)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\th.ensureIndex(base)\n\n\t// can't set master during create, so set it afterwards\n\tif base.MasterIndex != 0 {\n\t\t// TODO: verify MasterIndex is actually a bridge?\n\t\treturn h.LinkSetMasterByIndex(link, base.MasterIndex)\n\t}\n\treturn nil\n}\n\n// LinkDel deletes link device. Either Index or Name must be set in\n// the link object for it to be deleted. The other values are ignored.\n// Equivalent to: `ip link del $link`\nfunc LinkDel(link Link) error {\n\treturn pkgHandle.LinkDel(link)\n}\n\n// LinkDel deletes link device. Either Index or Name must be set in\n// the link object for it to be deleted. The other values are ignored.\n// Equivalent to: `ip link del $link`\nfunc (h *Handle) LinkDel(link Link) error {\n\tbase := link.Attrs()\n\n\th.ensureIndex(base)\n\n\treq := h.newNetlinkRequest(unix.RTM_DELLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\nfunc (h *Handle) linkByNameDump(name string) (Link, error) {\n\tlinks, err := h.LinkList()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tfor _, link := range links {\n\t\tif link.Attrs().Name == name {\n\t\t\treturn link, nil\n\t\t}\n\t}\n\treturn nil, LinkNotFoundError{fmt.Errorf(\"Link %s not found\", name)}\n}\n\nfunc (h *Handle) linkByAliasDump(alias string) (Link, error) {\n\tlinks, err := h.LinkList()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tfor _, link := range links {\n\t\tif link.Attrs().Alias == alias {\n\t\t\treturn link, nil\n\t\t}\n\t}\n\treturn nil, LinkNotFoundError{fmt.Errorf(\"Link alias %s not found\", alias)}\n}\n\n// LinkByName finds a link by name and returns a pointer to the object.\nfunc LinkByName(name string) (Link, error) {\n\treturn pkgHandle.LinkByName(name)\n}\n\n// LinkByName finds a link by name and returns a pointer to the object.\nfunc (h *Handle) LinkByName(name string) (Link, error) {\n\tif h.lookupByDump {\n\t\treturn h.linkByNameDump(name)\n\t}\n\n\treq := h.newNetlinkRequest(unix.RTM_GETLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\treq.AddData(msg)\n\n\tattr := nl.NewRtAttr(unix.IFLA_EXT_MASK, nl.Uint32Attr(nl.RTEXT_FILTER_VF))\n\treq.AddData(attr)\n\n\tnameData := nl.NewRtAttr(unix.IFLA_IFNAME, nl.ZeroTerminated(name))\n\treq.AddData(nameData)\n\n\tlink, err := execGetLink(req)\n\tif err == unix.EINVAL {\n\t\t// older kernels don't support looking up via IFLA_IFNAME\n\t\t// so fall back to dumping all links\n\t\th.lookupByDump = true\n\t\treturn h.linkByNameDump(name)\n\t}\n\n\treturn link, err\n}\n\n// LinkByAlias finds a link by its alias and returns a pointer to the object.\n// If there are multiple links with the alias it returns the first one\nfunc LinkByAlias(alias string) (Link, error) {\n\treturn pkgHandle.LinkByAlias(alias)\n}\n\n// LinkByAlias finds a link by its alias and returns a pointer to the object.\n// If there are multiple links with the alias it returns the first one\nfunc (h *Handle) LinkByAlias(alias string) (Link, error) {\n\tif h.lookupByDump {\n\t\treturn h.linkByAliasDump(alias)\n\t}\n\n\treq := h.newNetlinkRequest(unix.RTM_GETLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\treq.AddData(msg)\n\n\tattr := nl.NewRtAttr(unix.IFLA_EXT_MASK, nl.Uint32Attr(nl.RTEXT_FILTER_VF))\n\treq.AddData(attr)\n\n\tnameData := nl.NewRtAttr(unix.IFLA_IFALIAS, nl.ZeroTerminated(alias))\n\treq.AddData(nameData)\n\n\tlink, err := execGetLink(req)\n\tif err == unix.EINVAL {\n\t\t// older kernels don't support looking up via IFLA_IFALIAS\n\t\t// so fall back to dumping all links\n\t\th.lookupByDump = true\n\t\treturn h.linkByAliasDump(alias)\n\t}\n\n\treturn link, err\n}\n\n// LinkByIndex finds a link by index and returns a pointer to the object.\nfunc LinkByIndex(index int) (Link, error) {\n\treturn pkgHandle.LinkByIndex(index)\n}\n\n// LinkByIndex finds a link by index and returns a pointer to the object.\nfunc (h *Handle) LinkByIndex(index int) (Link, error) {\n\treq := h.newNetlinkRequest(unix.RTM_GETLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Index = int32(index)\n\treq.AddData(msg)\n\tattr := nl.NewRtAttr(unix.IFLA_EXT_MASK, nl.Uint32Attr(nl.RTEXT_FILTER_VF))\n\treq.AddData(attr)\n\n\treturn execGetLink(req)\n}\n\nfunc execGetLink(req *nl.NetlinkRequest) (Link, error) {\n\tmsgs, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\tif err != nil {\n\t\tif errno, ok := err.(syscall.Errno); ok {\n\t\t\tif errno == unix.ENODEV {\n\t\t\t\treturn nil, LinkNotFoundError{fmt.Errorf(\"Link not found\")}\n\t\t\t}\n\t\t}\n\t\treturn nil, err\n\t}\n\n\tswitch {\n\tcase len(msgs) == 0:\n\t\treturn nil, LinkNotFoundError{fmt.Errorf(\"Link not found\")}\n\n\tcase len(msgs) == 1:\n\t\treturn LinkDeserialize(nil, msgs[0])\n\n\tdefault:\n\t\treturn nil, fmt.Errorf(\"More than one link found\")\n\t}\n}\n\n// LinkDeserialize deserializes a raw message received from netlink into\n// a link object.\nfunc LinkDeserialize(hdr *unix.NlMsghdr, m []byte) (Link, error) {\n\tmsg := nl.DeserializeIfInfomsg(m)\n\n\tattrs, err := nl.ParseRouteAttr(m[msg.Len():])\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tbase := NewLinkAttrs()\n\tbase.Index = int(msg.Index)\n\tbase.RawFlags = msg.Flags\n\tbase.Flags = linkFlags(msg.Flags)\n\tbase.EncapType = msg.EncapType()\n\tif msg.Flags&unix.IFF_PROMISC != 0 {\n\t\tbase.Promisc = 1\n\t}\n\tif msg.Flags&unix.IFF_ALLMULTI != 0 {\n\t\tbase.Allmulti = 1\n\t}\n\tif msg.Flags&unix.IFF_MULTICAST != 0 {\n\t\tbase.Multi = 1\n\t}\n\n\tvar (\n\t\tlink Link\n\t\tstats32 *LinkStatistics32\n\t\tstats64 *LinkStatistics64\n\t\tlinkType string\n\t\tlinkSlave LinkSlave\n\t\tslaveType string\n\t)\n\tfor _, attr := range attrs {\n\t\tswitch attr.Attr.Type {\n\t\tcase unix.IFLA_LINKINFO:\n\t\t\tinfos, err := nl.ParseRouteAttr(attr.Value)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\tfor _, info := range infos {\n\t\t\t\tswitch info.Attr.Type {\n\t\t\t\tcase nl.IFLA_INFO_KIND:\n\t\t\t\t\tlinkType = string(info.Value[:len(info.Value)-1])\n\t\t\t\t\tswitch linkType {\n\t\t\t\t\tcase \"dummy\":\n\t\t\t\t\t\tlink = &Dummy{}\n\t\t\t\t\tcase \"ifb\":\n\t\t\t\t\t\tlink = &Ifb{}\n\t\t\t\t\tcase \"bridge\":\n\t\t\t\t\t\tlink = &Bridge{}\n\t\t\t\t\tcase \"vlan\":\n\t\t\t\t\t\tlink = &Vlan{}\n\t\t\t\t\tcase \"veth\":\n\t\t\t\t\t\tlink = &Veth{}\n\t\t\t\t\tcase \"wireguard\":\n\t\t\t\t\t\tlink = &Wireguard{}\n\t\t\t\t\tcase \"vxlan\":\n\t\t\t\t\t\tlink = &Vxlan{}\n\t\t\t\t\tcase \"bond\":\n\t\t\t\t\t\tlink = &Bond{}\n\t\t\t\t\tcase \"ipvlan\":\n\t\t\t\t\t\tlink = &IPVlan{}\n\t\t\t\t\tcase \"ipvtap\":\n\t\t\t\t\t\tlink = &IPVtap{}\n\t\t\t\t\tcase \"macvlan\":\n\t\t\t\t\t\tlink = &Macvlan{}\n\t\t\t\t\tcase \"macvtap\":\n\t\t\t\t\t\tlink = &Macvtap{}\n\t\t\t\t\tcase \"geneve\":\n\t\t\t\t\t\tlink = &Geneve{}\n\t\t\t\t\tcase \"gretap\":\n\t\t\t\t\t\tlink = &Gretap{}\n\t\t\t\t\tcase \"ip6gretap\":\n\t\t\t\t\t\tlink = &Gretap{}\n\t\t\t\t\tcase \"ipip\":\n\t\t\t\t\t\tlink = &Iptun{}\n\t\t\t\t\tcase \"ip6tnl\":\n\t\t\t\t\t\tlink = &Ip6tnl{}\n\t\t\t\t\tcase \"sit\":\n\t\t\t\t\t\tlink = &Sittun{}\n\t\t\t\t\tcase \"gre\":\n\t\t\t\t\t\tlink = &Gretun{}\n\t\t\t\t\tcase \"ip6gre\":\n\t\t\t\t\t\tlink = &Gretun{}\n\t\t\t\t\tcase \"vti\", \"vti6\":\n\t\t\t\t\t\tlink = &Vti{}\n\t\t\t\t\tcase \"vrf\":\n\t\t\t\t\t\tlink = &Vrf{}\n\t\t\t\t\tcase \"gtp\":\n\t\t\t\t\t\tlink = >P{}\n\t\t\t\t\tcase \"xfrm\":\n\t\t\t\t\t\tlink = &Xfrmi{}\n\t\t\t\t\tcase \"tun\":\n\t\t\t\t\t\tlink = &Tuntap{}\n\t\t\t\t\tcase \"ipoib\":\n\t\t\t\t\t\tlink = &IPoIB{}\n\t\t\t\t\tcase \"can\":\n\t\t\t\t\t\tlink = &Can{}\n\t\t\t\t\tdefault:\n\t\t\t\t\t\tlink = &GenericLink{LinkType: linkType}\n\t\t\t\t\t}\n\t\t\t\tcase nl.IFLA_INFO_DATA:\n\t\t\t\t\tdata, err := nl.ParseRouteAttr(info.Value)\n\t\t\t\t\tif err != nil {\n\t\t\t\t\t\treturn nil, err\n\t\t\t\t\t}\n\t\t\t\t\tswitch linkType {\n\t\t\t\t\tcase \"vlan\":\n\t\t\t\t\t\tparseVlanData(link, data)\n\t\t\t\t\tcase \"vxlan\":\n\t\t\t\t\t\tparseVxlanData(link, data)\n\t\t\t\t\tcase \"bond\":\n\t\t\t\t\t\tparseBondData(link, data)\n\t\t\t\t\tcase \"ipvlan\":\n\t\t\t\t\t\tparseIPVlanData(link, data)\n\t\t\t\t\tcase \"ipvtap\":\n\t\t\t\t\t\tparseIPVtapData(link, data)\n\t\t\t\t\tcase \"macvlan\":\n\t\t\t\t\t\tparseMacvlanData(link, data)\n\t\t\t\t\tcase \"macvtap\":\n\t\t\t\t\t\tparseMacvtapData(link, data)\n\t\t\t\t\tcase \"geneve\":\n\t\t\t\t\t\tparseGeneveData(link, data)\n\t\t\t\t\tcase \"gretap\":\n\t\t\t\t\t\tparseGretapData(link, data)\n\t\t\t\t\tcase \"ip6gretap\":\n\t\t\t\t\t\tparseGretapData(link, data)\n\t\t\t\t\tcase \"ipip\":\n\t\t\t\t\t\tparseIptunData(link, data)\n\t\t\t\t\tcase \"ip6tnl\":\n\t\t\t\t\t\tparseIp6tnlData(link, data)\n\t\t\t\t\tcase \"sit\":\n\t\t\t\t\t\tparseSittunData(link, data)\n\t\t\t\t\tcase \"gre\":\n\t\t\t\t\t\tparseGretunData(link, data)\n\t\t\t\t\tcase \"ip6gre\":\n\t\t\t\t\t\tparseGretunData(link, data)\n\t\t\t\t\tcase \"vti\", \"vti6\":\n\t\t\t\t\t\tparseVtiData(link, data)\n\t\t\t\t\tcase \"vrf\":\n\t\t\t\t\t\tparseVrfData(link, data)\n\t\t\t\t\tcase \"bridge\":\n\t\t\t\t\t\tparseBridgeData(link, data)\n\t\t\t\t\tcase \"gtp\":\n\t\t\t\t\t\tparseGTPData(link, data)\n\t\t\t\t\tcase \"xfrm\":\n\t\t\t\t\t\tparseXfrmiData(link, data)\n\t\t\t\t\tcase \"tun\":\n\t\t\t\t\t\tparseTuntapData(link, data)\n\t\t\t\t\tcase \"ipoib\":\n\t\t\t\t\t\tparseIPoIBData(link, data)\n\t\t\t\t\tcase \"can\":\n\t\t\t\t\t\tparseCanData(link, data)\n\t\t\t\t\t}\n\t\t\t\tcase nl.IFLA_INFO_SLAVE_KIND:\n\t\t\t\t\tslaveType = string(info.Value[:len(info.Value)-1])\n\t\t\t\t\tswitch slaveType {\n\t\t\t\t\tcase \"bond\":\n\t\t\t\t\t\tlinkSlave = &BondSlave{}\n\t\t\t\t\tcase \"vrf\":\n\t\t\t\t\t\tlinkSlave = &VrfSlave{}\n\t\t\t\t\t}\n\n\t\t\t\tcase nl.IFLA_INFO_SLAVE_DATA:\n\t\t\t\t\tswitch slaveType {\n\t\t\t\t\tcase \"bond\":\n\t\t\t\t\t\tdata, err := nl.ParseRouteAttr(info.Value)\n\t\t\t\t\t\tif err != nil {\n\t\t\t\t\t\t\treturn nil, err\n\t\t\t\t\t\t}\n\t\t\t\t\t\tparseBondSlaveData(linkSlave, data)\n\t\t\t\t\tcase \"vrf\":\n\t\t\t\t\t\tdata, err := nl.ParseRouteAttr(info.Value)\n\t\t\t\t\t\tif err != nil {\n\t\t\t\t\t\t\treturn nil, err\n\t\t\t\t\t\t}\n\t\t\t\t\t\tparseVrfSlaveData(linkSlave, data)\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\tcase unix.IFLA_ADDRESS:\n\t\t\tvar nonzero bool\n\t\t\tfor _, b := range attr.Value {\n\t\t\t\tif b != 0 {\n\t\t\t\t\tnonzero = true\n\t\t\t\t}\n\t\t\t}\n\t\t\tif nonzero {\n\t\t\t\tbase.HardwareAddr = attr.Value[:]\n\t\t\t}\n\t\tcase unix.IFLA_IFNAME:\n\t\t\tbase.Name = string(attr.Value[:len(attr.Value)-1])\n\t\tcase unix.IFLA_MTU:\n\t\t\tbase.MTU = int(native.Uint32(attr.Value[0:4]))\n\t\tcase unix.IFLA_LINK:\n\t\t\tbase.ParentIndex = int(native.Uint32(attr.Value[0:4]))\n\t\tcase unix.IFLA_MASTER:\n\t\t\tbase.MasterIndex = int(native.Uint32(attr.Value[0:4]))\n\t\tcase unix.IFLA_TXQLEN:\n\t\t\tbase.TxQLen = int(native.Uint32(attr.Value[0:4]))\n\t\tcase unix.IFLA_IFALIAS:\n\t\t\tbase.Alias = string(attr.Value[:len(attr.Value)-1])\n\t\tcase unix.IFLA_STATS:\n\t\t\tstats32 = new(LinkStatistics32)\n\t\t\tif err := binary.Read(bytes.NewBuffer(attr.Value[:]), nl.NativeEndian(), stats32); err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\tcase unix.IFLA_STATS64:\n\t\t\tstats64 = new(LinkStatistics64)\n\t\t\tif err := binary.Read(bytes.NewBuffer(attr.Value[:]), nl.NativeEndian(), stats64); err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\tcase unix.IFLA_XDP:\n\t\t\txdp, err := parseLinkXdp(attr.Value[:])\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\tbase.Xdp = xdp\n\t\tcase unix.IFLA_PROTINFO | unix.NLA_F_NESTED:\n\t\t\tif hdr != nil && hdr.Type == unix.RTM_NEWLINK &&\n\t\t\t\tmsg.Family == unix.AF_BRIDGE {\n\t\t\t\tattrs, err := nl.ParseRouteAttr(attr.Value[:])\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn nil, err\n\t\t\t\t}\n\t\t\t\tprotinfo := parseProtinfo(attrs)\n\t\t\t\tbase.Protinfo = &protinfo\n\t\t\t}\n\t\tcase unix.IFLA_OPERSTATE:\n\t\t\tbase.OperState = LinkOperState(uint8(attr.Value[0]))\n\t\tcase unix.IFLA_PHYS_SWITCH_ID:\n\t\t\tbase.PhysSwitchID = int(native.Uint32(attr.Value[0:4]))\n\t\tcase unix.IFLA_LINK_NETNSID:\n\t\t\tbase.NetNsID = int(native.Uint32(attr.Value[0:4]))\n\t\tcase unix.IFLA_GSO_MAX_SIZE:\n\t\t\tbase.GSOMaxSize = native.Uint32(attr.Value[0:4])\n\t\tcase unix.IFLA_GSO_MAX_SEGS:\n\t\t\tbase.GSOMaxSegs = native.Uint32(attr.Value[0:4])\n\t\tcase unix.IFLA_VFINFO_LIST:\n\t\t\tdata, err := nl.ParseRouteAttr(attr.Value)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\tvfs, err := parseVfInfoList(data)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\tbase.Vfs = vfs\n\t\tcase unix.IFLA_NUM_TX_QUEUES:\n\t\t\tbase.NumTxQueues = int(native.Uint32(attr.Value[0:4]))\n\t\tcase unix.IFLA_NUM_RX_QUEUES:\n\t\t\tbase.NumRxQueues = int(native.Uint32(attr.Value[0:4]))\n\t\tcase unix.IFLA_GROUP:\n\t\t\tbase.Group = native.Uint32(attr.Value[0:4])\n\t\t}\n\t}\n\n\tif stats64 != nil {\n\t\tbase.Statistics = (*LinkStatistics)(stats64)\n\t} else if stats32 != nil {\n\t\tbase.Statistics = (*LinkStatistics)(stats32.to64())\n\t}\n\n\t// Links that don't have IFLA_INFO_KIND are hardware devices\n\tif link == nil {\n\t\tlink = &Device{}\n\t}\n\t*link.Attrs() = base\n\tlink.Attrs().Slave = linkSlave\n\n\t// If the tuntap attributes are not updated by netlink due to\n\t// an older driver, use sysfs\n\tif link != nil && linkType == \"tun\" {\n\t\ttuntap := link.(*Tuntap)\n\n\t\tif tuntap.Mode == 0 {\n\t\t\tifname := tuntap.Attrs().Name\n\t\t\tif flags, err := readSysPropAsInt64(ifname, \"tun_flags\"); err == nil {\n\n\t\t\t\tif flags&unix.IFF_TUN != 0 {\n\t\t\t\t\ttuntap.Mode = unix.IFF_TUN\n\t\t\t\t} else if flags&unix.IFF_TAP != 0 {\n\t\t\t\t\ttuntap.Mode = unix.IFF_TAP\n\t\t\t\t}\n\n\t\t\t\ttuntap.NonPersist = false\n\t\t\t\tif flags&unix.IFF_PERSIST == 0 {\n\t\t\t\t\ttuntap.NonPersist = true\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// The sysfs interface for owner/group returns -1 for root user, instead of returning 0.\n\t\t\t// So explicitly check for negative value, before assigning the owner uid/gid.\n\t\t\tif owner, err := readSysPropAsInt64(ifname, \"owner\"); err == nil && owner > 0 {\n\t\t\t\ttuntap.Owner = uint32(owner)\n\t\t\t}\n\n\t\t\tif group, err := readSysPropAsInt64(ifname, \"group\"); err == nil && group > 0 {\n\t\t\t\ttuntap.Group = uint32(group)\n\t\t\t}\n\t\t}\n\t}\n\n\treturn link, nil\n}\n\nfunc readSysPropAsInt64(ifname, prop string) (int64, error) {\n\tfname := fmt.Sprintf(\"/sys/class/net/%s/%s\", ifname, prop)\n\tcontents, err := ioutil.ReadFile(fname)\n\tif err != nil {\n\t\treturn 0, err\n\t}\n\n\tnum, err := strconv.ParseInt(strings.TrimSpace(string(contents)), 0, 64)\n\tif err == nil {\n\t\treturn num, nil\n\t}\n\n\treturn 0, err\n}\n\n// LinkList gets a list of link devices.\n// Equivalent to: `ip link show`\nfunc LinkList() ([]Link, error) {\n\treturn pkgHandle.LinkList()\n}\n\n// LinkList gets a list of link devices.\n// Equivalent to: `ip link show`\nfunc (h *Handle) LinkList() ([]Link, error) {\n\t// NOTE(vish): This duplicates functionality in net/iface_linux.go, but we need\n\t// to get the message ourselves to parse link type.\n\treq := h.newNetlinkRequest(unix.RTM_GETLINK, unix.NLM_F_DUMP)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\treq.AddData(msg)\n\tattr := nl.NewRtAttr(unix.IFLA_EXT_MASK, nl.Uint32Attr(nl.RTEXT_FILTER_VF))\n\treq.AddData(attr)\n\n\tmsgs, err := req.Execute(unix.NETLINK_ROUTE, unix.RTM_NEWLINK)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tvar res []Link\n\tfor _, m := range msgs {\n\t\tlink, err := LinkDeserialize(nil, m)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tres = append(res, link)\n\t}\n\n\treturn res, nil\n}\n\n// LinkUpdate is used to pass information back from LinkSubscribe()\ntype LinkUpdate struct {\n\tnl.IfInfomsg\n\tHeader unix.NlMsghdr\n\tLink\n}\n\n// LinkSubscribe takes a chan down which notifications will be sent\n// when links change. Close the 'done' chan to stop subscription.\nfunc LinkSubscribe(ch chan<- LinkUpdate, done <-chan struct{}) error {\n\treturn linkSubscribeAt(netns.None(), netns.None(), ch, done, nil, false)\n}\n\n// LinkSubscribeAt works like LinkSubscribe plus it allows the caller\n// to choose the network namespace in which to subscribe (ns).\nfunc LinkSubscribeAt(ns netns.NsHandle, ch chan<- LinkUpdate, done <-chan struct{}) error {\n\treturn linkSubscribeAt(ns, netns.None(), ch, done, nil, false)\n}\n\n// LinkSubscribeOptions contains a set of options to use with\n// LinkSubscribeWithOptions.\ntype LinkSubscribeOptions struct {\n\tNamespace *netns.NsHandle\n\tErrorCallback func(error)\n\tListExisting bool\n}\n\n// LinkSubscribeWithOptions work like LinkSubscribe but enable to\n// provide additional options to modify the behavior. Currently, the\n// namespace can be provided as well as an error callback.\nfunc LinkSubscribeWithOptions(ch chan<- LinkUpdate, done <-chan struct{}, options LinkSubscribeOptions) error {\n\tif options.Namespace == nil {\n\t\tnone := netns.None()\n\t\toptions.Namespace = &none\n\t}\n\treturn linkSubscribeAt(*options.Namespace, netns.None(), ch, done, options.ErrorCallback, options.ListExisting)\n}\n\nfunc linkSubscribeAt(newNs, curNs netns.NsHandle, ch chan<- LinkUpdate, done <-chan struct{}, cberr func(error), listExisting bool) error {\n\ts, err := nl.SubscribeAt(newNs, curNs, unix.NETLINK_ROUTE, unix.RTNLGRP_LINK)\n\tif err != nil {\n\t\treturn err\n\t}\n\tif done != nil {\n\t\tgo func() {\n\t\t\t<-done\n\t\t\ts.Close()\n\t\t}()\n\t}\n\tif listExisting {\n\t\treq := pkgHandle.newNetlinkRequest(unix.RTM_GETLINK,\n\t\t\tunix.NLM_F_DUMP)\n\t\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\t\treq.AddData(msg)\n\t\tif err := s.Send(req); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\tgo func() {\n\t\tdefer close(ch)\n\t\tfor {\n\t\t\tmsgs, from, err := s.Receive()\n\t\t\tif err != nil {\n\t\t\t\tif cberr != nil {\n\t\t\t\t\tcberr(fmt.Errorf(\"Receive failed: %v\",\n\t\t\t\t\t\terr))\n\t\t\t\t}\n\t\t\t\treturn\n\t\t\t}\n\t\t\tif from.Pid != nl.PidKernel {\n\t\t\t\tif cberr != nil {\n\t\t\t\t\tcberr(fmt.Errorf(\"Wrong sender portid %d, expected %d\", from.Pid, nl.PidKernel))\n\t\t\t\t}\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tfor _, m := range msgs {\n\t\t\t\tif m.Header.Type == unix.NLMSG_DONE {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tif m.Header.Type == unix.NLMSG_ERROR {\n\t\t\t\t\terror := int32(native.Uint32(m.Data[0:4]))\n\t\t\t\t\tif error == 0 {\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\t\t\t\t\tif cberr != nil {\n\t\t\t\t\t\tcberr(fmt.Errorf(\"error message: %v\",\n\t\t\t\t\t\t\tsyscall.Errno(-error)))\n\t\t\t\t\t}\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tifmsg := nl.DeserializeIfInfomsg(m.Data)\n\t\t\t\theader := unix.NlMsghdr(m.Header)\n\t\t\t\tlink, err := LinkDeserialize(&header, m.Data)\n\t\t\t\tif err != nil {\n\t\t\t\t\tif cberr != nil {\n\t\t\t\t\t\tcberr(err)\n\t\t\t\t\t}\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tch <- LinkUpdate{IfInfomsg: *ifmsg, Header: header, Link: link}\n\t\t\t}\n\t\t}\n\t}()\n\n\treturn nil\n}\n\nfunc LinkSetHairpin(link Link, mode bool) error {\n\treturn pkgHandle.LinkSetHairpin(link, mode)\n}\n\nfunc (h *Handle) LinkSetHairpin(link Link, mode bool) error {\n\treturn h.setProtinfoAttr(link, mode, nl.IFLA_BRPORT_MODE)\n}\n\nfunc LinkSetGuard(link Link, mode bool) error {\n\treturn pkgHandle.LinkSetGuard(link, mode)\n}\n\nfunc (h *Handle) LinkSetGuard(link Link, mode bool) error {\n\treturn h.setProtinfoAttr(link, mode, nl.IFLA_BRPORT_GUARD)\n}\n\nfunc LinkSetFastLeave(link Link, mode bool) error {\n\treturn pkgHandle.LinkSetFastLeave(link, mode)\n}\n\nfunc (h *Handle) LinkSetFastLeave(link Link, mode bool) error {\n\treturn h.setProtinfoAttr(link, mode, nl.IFLA_BRPORT_FAST_LEAVE)\n}\n\nfunc LinkSetLearning(link Link, mode bool) error {\n\treturn pkgHandle.LinkSetLearning(link, mode)\n}\n\nfunc (h *Handle) LinkSetLearning(link Link, mode bool) error {\n\treturn h.setProtinfoAttr(link, mode, nl.IFLA_BRPORT_LEARNING)\n}\n\nfunc LinkSetRootBlock(link Link, mode bool) error {\n\treturn pkgHandle.LinkSetRootBlock(link, mode)\n}\n\nfunc (h *Handle) LinkSetRootBlock(link Link, mode bool) error {\n\treturn h.setProtinfoAttr(link, mode, nl.IFLA_BRPORT_PROTECT)\n}\n\nfunc LinkSetFlood(link Link, mode bool) error {\n\treturn pkgHandle.LinkSetFlood(link, mode)\n}\n\nfunc (h *Handle) LinkSetFlood(link Link, mode bool) error {\n\treturn h.setProtinfoAttr(link, mode, nl.IFLA_BRPORT_UNICAST_FLOOD)\n}\n\nfunc LinkSetBrProxyArp(link Link, mode bool) error {\n\treturn pkgHandle.LinkSetBrProxyArp(link, mode)\n}\n\nfunc (h *Handle) LinkSetBrProxyArp(link Link, mode bool) error {\n\treturn h.setProtinfoAttr(link, mode, nl.IFLA_BRPORT_PROXYARP)\n}\n\nfunc LinkSetBrProxyArpWiFi(link Link, mode bool) error {\n\treturn pkgHandle.LinkSetBrProxyArpWiFi(link, mode)\n}\n\nfunc (h *Handle) LinkSetBrProxyArpWiFi(link Link, mode bool) error {\n\treturn h.setProtinfoAttr(link, mode, nl.IFLA_BRPORT_PROXYARP_WIFI)\n}\n\nfunc (h *Handle) setProtinfoAttr(link Link, mode bool, attr int) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_SETLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_BRIDGE)\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\tbr := nl.NewRtAttr(unix.IFLA_PROTINFO|unix.NLA_F_NESTED, nil)\n\tbr.AddRtAttr(attr, boolToByte(mode))\n\treq.AddData(br)\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\tif err != nil {\n\t\treturn err\n\t}\n\treturn nil\n}\n\n// LinkSetTxQLen sets the transaction queue length for the link.\n// Equivalent to: `ip link set $link txqlen $qlen`\nfunc LinkSetTxQLen(link Link, qlen int) error {\n\treturn pkgHandle.LinkSetTxQLen(link, qlen)\n}\n\n// LinkSetTxQLen sets the transaction queue length for the link.\n// Equivalent to: `ip link set $link txqlen $qlen`\nfunc (h *Handle) LinkSetTxQLen(link Link, qlen int) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_SETLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\tb := make([]byte, 4)\n\tnative.PutUint32(b, uint32(qlen))\n\n\tdata := nl.NewRtAttr(unix.IFLA_TXQLEN, b)\n\treq.AddData(data)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// LinkSetGroup sets the link group id which can be used to perform mass actions\n// with iproute2 as well use it as a reference in nft filters.\n// Equivalent to: `ip link set $link group $id`\nfunc LinkSetGroup(link Link, group int) error {\n\treturn pkgHandle.LinkSetGroup(link, group)\n}\n\n// LinkSetGroup sets the link group id which can be used to perform mass actions\n// with iproute2 as well use it as a reference in nft filters.\n// Equivalent to: `ip link set $link group $id`\nfunc (h *Handle) LinkSetGroup(link Link, group int) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_SETLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\tb := make([]byte, 4)\n\tnative.PutUint32(b, uint32(group))\n\n\tdata := nl.NewRtAttr(unix.IFLA_GROUP, b)\n\treq.AddData(data)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\nfunc parseVlanData(link Link, data []syscall.NetlinkRouteAttr) {\n\tvlan := link.(*Vlan)\n\tfor _, datum := range data {\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.IFLA_VLAN_ID:\n\t\t\tvlan.VlanId = int(native.Uint16(datum.Value[0:2]))\n\t\tcase nl.IFLA_VLAN_PROTOCOL:\n\t\t\tvlan.VlanProtocol = VlanProtocol(int(ntohs(datum.Value[0:2])))\n\t\t}\n\t}\n}\n\nfunc parseVxlanData(link Link, data []syscall.NetlinkRouteAttr) {\n\tvxlan := link.(*Vxlan)\n\tfor _, datum := range data {\n\t\t// NOTE(vish): Apparently some messages can be sent with no value.\n\t\t// We special case GBP here to not change existing\n\t\t// functionality. It appears that GBP sends a datum.Value\n\t\t// of null.\n\t\tif len(datum.Value) == 0 && datum.Attr.Type != nl.IFLA_VXLAN_GBP {\n\t\t\tcontinue\n\t\t}\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.IFLA_VXLAN_ID:\n\t\t\tvxlan.VxlanId = int(native.Uint32(datum.Value[0:4]))\n\t\tcase nl.IFLA_VXLAN_LINK:\n\t\t\tvxlan.VtepDevIndex = int(native.Uint32(datum.Value[0:4]))\n\t\tcase nl.IFLA_VXLAN_LOCAL:\n\t\t\tvxlan.SrcAddr = net.IP(datum.Value[0:4])\n\t\tcase nl.IFLA_VXLAN_LOCAL6:\n\t\t\tvxlan.SrcAddr = net.IP(datum.Value[0:16])\n\t\tcase nl.IFLA_VXLAN_GROUP:\n\t\t\tvxlan.Group = net.IP(datum.Value[0:4])\n\t\tcase nl.IFLA_VXLAN_GROUP6:\n\t\t\tvxlan.Group = net.IP(datum.Value[0:16])\n\t\tcase nl.IFLA_VXLAN_TTL:\n\t\t\tvxlan.TTL = int(datum.Value[0])\n\t\tcase nl.IFLA_VXLAN_TOS:\n\t\t\tvxlan.TOS = int(datum.Value[0])\n\t\tcase nl.IFLA_VXLAN_LEARNING:\n\t\t\tvxlan.Learning = int8(datum.Value[0]) != 0\n\t\tcase nl.IFLA_VXLAN_PROXY:\n\t\t\tvxlan.Proxy = int8(datum.Value[0]) != 0\n\t\tcase nl.IFLA_VXLAN_RSC:\n\t\t\tvxlan.RSC = int8(datum.Value[0]) != 0\n\t\tcase nl.IFLA_VXLAN_L2MISS:\n\t\t\tvxlan.L2miss = int8(datum.Value[0]) != 0\n\t\tcase nl.IFLA_VXLAN_L3MISS:\n\t\t\tvxlan.L3miss = int8(datum.Value[0]) != 0\n\t\tcase nl.IFLA_VXLAN_UDP_CSUM:\n\t\t\tvxlan.UDPCSum = int8(datum.Value[0]) != 0\n\t\tcase nl.IFLA_VXLAN_UDP_ZERO_CSUM6_TX:\n\t\t\tvxlan.UDP6ZeroCSumTx = int8(datum.Value[0]) != 0\n\t\tcase nl.IFLA_VXLAN_UDP_ZERO_CSUM6_RX:\n\t\t\tvxlan.UDP6ZeroCSumRx = int8(datum.Value[0]) != 0\n\t\tcase nl.IFLA_VXLAN_GBP:\n\t\t\tvxlan.GBP = true\n\t\tcase nl.IFLA_VXLAN_FLOWBASED:\n\t\t\tvxlan.FlowBased = int8(datum.Value[0]) != 0\n\t\tcase nl.IFLA_VXLAN_AGEING:\n\t\t\tvxlan.Age = int(native.Uint32(datum.Value[0:4]))\n\t\t\tvxlan.NoAge = vxlan.Age == 0\n\t\tcase nl.IFLA_VXLAN_LIMIT:\n\t\t\tvxlan.Limit = int(native.Uint32(datum.Value[0:4]))\n\t\tcase nl.IFLA_VXLAN_PORT:\n\t\t\tvxlan.Port = int(ntohs(datum.Value[0:2]))\n\t\tcase nl.IFLA_VXLAN_PORT_RANGE:\n\t\t\tbuf := bytes.NewBuffer(datum.Value[0:4])\n\t\t\tvar pr vxlanPortRange\n\t\t\tif binary.Read(buf, binary.BigEndian, &pr) != nil {\n\t\t\t\tvxlan.PortLow = int(pr.Lo)\n\t\t\t\tvxlan.PortHigh = int(pr.Hi)\n\t\t\t}\n\t\t}\n\t}\n}\n\nfunc parseBondData(link Link, data []syscall.NetlinkRouteAttr) {\n\tbond := link.(*Bond)\n\tfor i := range data {\n\t\tswitch data[i].Attr.Type {\n\t\tcase nl.IFLA_BOND_MODE:\n\t\t\tbond.Mode = BondMode(data[i].Value[0])\n\t\tcase nl.IFLA_BOND_ACTIVE_SLAVE:\n\t\t\tbond.ActiveSlave = int(native.Uint32(data[i].Value[0:4]))\n\t\tcase nl.IFLA_BOND_MIIMON:\n\t\t\tbond.Miimon = int(native.Uint32(data[i].Value[0:4]))\n\t\tcase nl.IFLA_BOND_UPDELAY:\n\t\t\tbond.UpDelay = int(native.Uint32(data[i].Value[0:4]))\n\t\tcase nl.IFLA_BOND_DOWNDELAY:\n\t\t\tbond.DownDelay = int(native.Uint32(data[i].Value[0:4]))\n\t\tcase nl.IFLA_BOND_USE_CARRIER:\n\t\t\tbond.UseCarrier = int(data[i].Value[0])\n\t\tcase nl.IFLA_BOND_ARP_INTERVAL:\n\t\t\tbond.ArpInterval = int(native.Uint32(data[i].Value[0:4]))\n\t\tcase nl.IFLA_BOND_ARP_IP_TARGET:\n\t\t\tbond.ArpIpTargets = parseBondArpIpTargets(data[i].Value)\n\t\tcase nl.IFLA_BOND_ARP_VALIDATE:\n\t\t\tbond.ArpValidate = BondArpValidate(native.Uint32(data[i].Value[0:4]))\n\t\tcase nl.IFLA_BOND_ARP_ALL_TARGETS:\n\t\t\tbond.ArpAllTargets = BondArpAllTargets(native.Uint32(data[i].Value[0:4]))\n\t\tcase nl.IFLA_BOND_PRIMARY:\n\t\t\tbond.Primary = int(native.Uint32(data[i].Value[0:4]))\n\t\tcase nl.IFLA_BOND_PRIMARY_RESELECT:\n\t\t\tbond.PrimaryReselect = BondPrimaryReselect(data[i].Value[0])\n\t\tcase nl.IFLA_BOND_FAIL_OVER_MAC:\n\t\t\tbond.FailOverMac = BondFailOverMac(data[i].Value[0])\n\t\tcase nl.IFLA_BOND_XMIT_HASH_POLICY:\n\t\t\tbond.XmitHashPolicy = BondXmitHashPolicy(data[i].Value[0])\n\t\tcase nl.IFLA_BOND_RESEND_IGMP:\n\t\t\tbond.ResendIgmp = int(native.Uint32(data[i].Value[0:4]))\n\t\tcase nl.IFLA_BOND_NUM_PEER_NOTIF:\n\t\t\tbond.NumPeerNotif = int(data[i].Value[0])\n\t\tcase nl.IFLA_BOND_ALL_SLAVES_ACTIVE:\n\t\t\tbond.AllSlavesActive = int(data[i].Value[0])\n\t\tcase nl.IFLA_BOND_MIN_LINKS:\n\t\t\tbond.MinLinks = int(native.Uint32(data[i].Value[0:4]))\n\t\tcase nl.IFLA_BOND_LP_INTERVAL:\n\t\t\tbond.LpInterval = int(native.Uint32(data[i].Value[0:4]))\n\t\tcase nl.IFLA_BOND_PACKETS_PER_SLAVE:\n\t\t\tbond.PacketsPerSlave = int(native.Uint32(data[i].Value[0:4]))\n\t\tcase nl.IFLA_BOND_AD_LACP_RATE:\n\t\t\tbond.LacpRate = BondLacpRate(data[i].Value[0])\n\t\tcase nl.IFLA_BOND_AD_SELECT:\n\t\t\tbond.AdSelect = BondAdSelect(data[i].Value[0])\n\t\tcase nl.IFLA_BOND_AD_INFO:\n\t\t\t// TODO: implement\n\t\tcase nl.IFLA_BOND_AD_ACTOR_SYS_PRIO:\n\t\t\tbond.AdActorSysPrio = int(native.Uint16(data[i].Value[0:2]))\n\t\tcase nl.IFLA_BOND_AD_USER_PORT_KEY:\n\t\t\tbond.AdUserPortKey = int(native.Uint16(data[i].Value[0:2]))\n\t\tcase nl.IFLA_BOND_AD_ACTOR_SYSTEM:\n\t\t\tbond.AdActorSystem = net.HardwareAddr(data[i].Value[0:6])\n\t\tcase nl.IFLA_BOND_TLB_DYNAMIC_LB:\n\t\t\tbond.TlbDynamicLb = int(data[i].Value[0])\n\t\t}\n\t}\n}\n\nfunc parseBondArpIpTargets(value []byte) []net.IP {\n\tdata, err := nl.ParseRouteAttr(value)\n\tif err != nil {\n\t\treturn nil\n\t}\n\n\ttargets := []net.IP{}\n\tfor i := range data {\n\t\ttarget := net.IP(data[i].Value)\n\t\tif ip := target.To4(); ip != nil {\n\t\t\ttargets = append(targets, ip)\n\t\t\tcontinue\n\t\t}\n\t\tif ip := target.To16(); ip != nil {\n\t\t\ttargets = append(targets, ip)\n\t\t}\n\t}\n\n\treturn targets\n}\n\nfunc addBondSlaveAttrs(bondSlave *BondSlave, linkInfo *nl.RtAttr) {\n\tdata := linkInfo.AddRtAttr(nl.IFLA_INFO_SLAVE_DATA, nil)\n\n\tdata.AddRtAttr(nl.IFLA_BOND_SLAVE_STATE, nl.Uint8Attr(uint8(bondSlave.State)))\n\tdata.AddRtAttr(nl.IFLA_BOND_SLAVE_MII_STATUS, nl.Uint8Attr(uint8(bondSlave.MiiStatus)))\n\tdata.AddRtAttr(nl.IFLA_BOND_SLAVE_LINK_FAILURE_COUNT, nl.Uint32Attr(bondSlave.LinkFailureCount))\n\tdata.AddRtAttr(nl.IFLA_BOND_SLAVE_QUEUE_ID, nl.Uint16Attr(bondSlave.QueueId))\n\tdata.AddRtAttr(nl.IFLA_BOND_SLAVE_AD_AGGREGATOR_ID, nl.Uint16Attr(bondSlave.AggregatorId))\n\tdata.AddRtAttr(nl.IFLA_BOND_SLAVE_AD_ACTOR_OPER_PORT_STATE, nl.Uint8Attr(bondSlave.AdActorOperPortState))\n\tdata.AddRtAttr(nl.IFLA_BOND_SLAVE_AD_PARTNER_OPER_PORT_STATE, nl.Uint16Attr(bondSlave.AdPartnerOperPortState))\n\n\tif mac := bondSlave.PermHardwareAddr; mac != nil {\n\t\tdata.AddRtAttr(nl.IFLA_BOND_SLAVE_PERM_HWADDR, []byte(mac))\n\t}\n}\n\nfunc parseBondSlaveData(slave LinkSlave, data []syscall.NetlinkRouteAttr) {\n\tbondSlave := slave.(*BondSlave)\n\tfor i := range data {\n\t\tswitch data[i].Attr.Type {\n\t\tcase nl.IFLA_BOND_SLAVE_STATE:\n\t\t\tbondSlave.State = BondSlaveState(data[i].Value[0])\n\t\tcase nl.IFLA_BOND_SLAVE_MII_STATUS:\n\t\t\tbondSlave.MiiStatus = BondSlaveMiiStatus(data[i].Value[0])\n\t\tcase nl.IFLA_BOND_SLAVE_LINK_FAILURE_COUNT:\n\t\t\tbondSlave.LinkFailureCount = native.Uint32(data[i].Value[0:4])\n\t\tcase nl.IFLA_BOND_SLAVE_PERM_HWADDR:\n\t\t\tbondSlave.PermHardwareAddr = net.HardwareAddr(data[i].Value[0:6])\n\t\tcase nl.IFLA_BOND_SLAVE_QUEUE_ID:\n\t\t\tbondSlave.QueueId = native.Uint16(data[i].Value[0:2])\n\t\tcase nl.IFLA_BOND_SLAVE_AD_AGGREGATOR_ID:\n\t\t\tbondSlave.AggregatorId = native.Uint16(data[i].Value[0:2])\n\t\tcase nl.IFLA_BOND_SLAVE_AD_ACTOR_OPER_PORT_STATE:\n\t\t\tbondSlave.AdActorOperPortState = uint8(data[i].Value[0])\n\t\tcase nl.IFLA_BOND_SLAVE_AD_PARTNER_OPER_PORT_STATE:\n\t\t\tbondSlave.AdPartnerOperPortState = native.Uint16(data[i].Value[0:2])\n\t\t}\n\t}\n}\n\nfunc parseVrfSlaveData(slave LinkSlave, data []syscall.NetlinkRouteAttr) {\n\tvrfSlave := slave.(*VrfSlave)\n\tfor i := range data {\n\t\tswitch data[i].Attr.Type {\n\t\tcase nl.IFLA_BOND_SLAVE_STATE:\n\t\t\tvrfSlave.Table = native.Uint32(data[i].Value[0:4])\n\t\t}\n\t}\n}\n\nfunc parseIPVlanData(link Link, data []syscall.NetlinkRouteAttr) {\n\tipv := link.(*IPVlan)\n\tfor _, datum := range data {\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.IFLA_IPVLAN_MODE:\n\t\t\tipv.Mode = IPVlanMode(native.Uint32(datum.Value[0:4]))\n\t\tcase nl.IFLA_IPVLAN_FLAG:\n\t\t\tipv.Flag = IPVlanFlag(native.Uint32(datum.Value[0:4]))\n\t\t}\n\t}\n}\n\nfunc parseIPVtapData(link Link, data []syscall.NetlinkRouteAttr) {\n\tipv := link.(*IPVtap)\n\tfor _, datum := range data {\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.IFLA_IPVLAN_MODE:\n\t\t\tipv.Mode = IPVlanMode(native.Uint32(datum.Value[0:4]))\n\t\tcase nl.IFLA_IPVLAN_FLAG:\n\t\t\tipv.Flag = IPVlanFlag(native.Uint32(datum.Value[0:4]))\n\t\t}\n\t}\n}\n\nfunc parseMacvtapData(link Link, data []syscall.NetlinkRouteAttr) {\n\tmacv := link.(*Macvtap)\n\tparseMacvlanData(&macv.Macvlan, data)\n}\n\nfunc parseMacvlanData(link Link, data []syscall.NetlinkRouteAttr) {\n\tmacv := link.(*Macvlan)\n\tfor _, datum := range data {\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.IFLA_MACVLAN_MODE:\n\t\t\tswitch native.Uint32(datum.Value[0:4]) {\n\t\t\tcase nl.MACVLAN_MODE_PRIVATE:\n\t\t\t\tmacv.Mode = MACVLAN_MODE_PRIVATE\n\t\t\tcase nl.MACVLAN_MODE_VEPA:\n\t\t\t\tmacv.Mode = MACVLAN_MODE_VEPA\n\t\t\tcase nl.MACVLAN_MODE_BRIDGE:\n\t\t\t\tmacv.Mode = MACVLAN_MODE_BRIDGE\n\t\t\tcase nl.MACVLAN_MODE_PASSTHRU:\n\t\t\t\tmacv.Mode = MACVLAN_MODE_PASSTHRU\n\t\t\tcase nl.MACVLAN_MODE_SOURCE:\n\t\t\t\tmacv.Mode = MACVLAN_MODE_SOURCE\n\t\t\t}\n\t\tcase nl.IFLA_MACVLAN_MACADDR_COUNT:\n\t\t\tmacv.MACAddrs = make([]net.HardwareAddr, 0, int(native.Uint32(datum.Value[0:4])))\n\t\tcase nl.IFLA_MACVLAN_MACADDR_DATA:\n\t\t\tmacs, err := nl.ParseRouteAttr(datum.Value[:])\n\t\t\tif err != nil {\n\t\t\t\tpanic(fmt.Sprintf(\"failed to ParseRouteAttr for IFLA_MACVLAN_MACADDR_DATA: %v\", err))\n\t\t\t}\n\t\t\tfor _, macDatum := range macs {\n\t\t\t\tmacv.MACAddrs = append(macv.MACAddrs, net.HardwareAddr(macDatum.Value[0:6]))\n\t\t\t}\n\t\t}\n\t}\n}\n\n// copied from pkg/net_linux.go\nfunc linkFlags(rawFlags uint32) net.Flags {\n\tvar f net.Flags\n\tif rawFlags&unix.IFF_UP != 0 {\n\t\tf |= net.FlagUp\n\t}\n\tif rawFlags&unix.IFF_BROADCAST != 0 {\n\t\tf |= net.FlagBroadcast\n\t}\n\tif rawFlags&unix.IFF_LOOPBACK != 0 {\n\t\tf |= net.FlagLoopback\n\t}\n\tif rawFlags&unix.IFF_POINTOPOINT != 0 {\n\t\tf |= net.FlagPointToPoint\n\t}\n\tif rawFlags&unix.IFF_MULTICAST != 0 {\n\t\tf |= net.FlagMulticast\n\t}\n\treturn f\n}\n\nfunc addGeneveAttrs(geneve *Geneve, linkInfo *nl.RtAttr) {\n\tdata := linkInfo.AddRtAttr(nl.IFLA_INFO_DATA, nil)\n\n\tif geneve.FlowBased {\n\t\t// In flow based mode, no other attributes need to be configured\n\t\tlinkInfo.AddRtAttr(nl.IFLA_GENEVE_COLLECT_METADATA, boolAttr(geneve.FlowBased))\n\t\treturn\n\t}\n\n\tif ip := geneve.Remote; ip != nil {\n\t\tif ip4 := ip.To4(); ip4 != nil {\n\t\t\tdata.AddRtAttr(nl.IFLA_GENEVE_REMOTE, ip.To4())\n\t\t} else {\n\t\t\tdata.AddRtAttr(nl.IFLA_GENEVE_REMOTE6, []byte(ip))\n\t\t}\n\t}\n\n\tif geneve.ID != 0 {\n\t\tdata.AddRtAttr(nl.IFLA_GENEVE_ID, nl.Uint32Attr(geneve.ID))\n\t}\n\n\tif geneve.Dport != 0 {\n\t\tdata.AddRtAttr(nl.IFLA_GENEVE_PORT, htons(geneve.Dport))\n\t}\n\n\tif geneve.Ttl != 0 {\n\t\tdata.AddRtAttr(nl.IFLA_GENEVE_TTL, nl.Uint8Attr(geneve.Ttl))\n\t}\n\n\tif geneve.Tos != 0 {\n\t\tdata.AddRtAttr(nl.IFLA_GENEVE_TOS, nl.Uint8Attr(geneve.Tos))\n\t}\n}\n\nfunc parseGeneveData(link Link, data []syscall.NetlinkRouteAttr) {\n\tgeneve := link.(*Geneve)\n\tfor _, datum := range data {\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.IFLA_GENEVE_ID:\n\t\t\tgeneve.ID = native.Uint32(datum.Value[0:4])\n\t\tcase nl.IFLA_GENEVE_REMOTE, nl.IFLA_GENEVE_REMOTE6:\n\t\t\tgeneve.Remote = datum.Value\n\t\tcase nl.IFLA_GENEVE_PORT:\n\t\t\tgeneve.Dport = ntohs(datum.Value[0:2])\n\t\tcase nl.IFLA_GENEVE_TTL:\n\t\t\tgeneve.Ttl = uint8(datum.Value[0])\n\t\tcase nl.IFLA_GENEVE_TOS:\n\t\t\tgeneve.Tos = uint8(datum.Value[0])\n\t\t}\n\t}\n}\n\nfunc addGretapAttrs(gretap *Gretap, linkInfo *nl.RtAttr) {\n\tdata := linkInfo.AddRtAttr(nl.IFLA_INFO_DATA, nil)\n\n\tif gretap.FlowBased {\n\t\t// In flow based mode, no other attributes need to be configured\n\t\tdata.AddRtAttr(nl.IFLA_GRE_COLLECT_METADATA, boolAttr(gretap.FlowBased))\n\t\treturn\n\t}\n\n\tif ip := gretap.Local; ip != nil {\n\t\tif ip.To4() != nil {\n\t\t\tip = ip.To4()\n\t\t}\n\t\tdata.AddRtAttr(nl.IFLA_GRE_LOCAL, []byte(ip))\n\t}\n\n\tif ip := gretap.Remote; ip != nil {\n\t\tif ip.To4() != nil {\n\t\t\tip = ip.To4()\n\t\t}\n\t\tdata.AddRtAttr(nl.IFLA_GRE_REMOTE, []byte(ip))\n\t}\n\n\tif gretap.IKey != 0 {\n\t\tdata.AddRtAttr(nl.IFLA_GRE_IKEY, htonl(gretap.IKey))\n\t\tgretap.IFlags |= uint16(nl.GRE_KEY)\n\t}\n\n\tif gretap.OKey != 0 {\n\t\tdata.AddRtAttr(nl.IFLA_GRE_OKEY, htonl(gretap.OKey))\n\t\tgretap.OFlags |= uint16(nl.GRE_KEY)\n\t}\n\n\tdata.AddRtAttr(nl.IFLA_GRE_IFLAGS, htons(gretap.IFlags))\n\tdata.AddRtAttr(nl.IFLA_GRE_OFLAGS, htons(gretap.OFlags))\n\n\tif gretap.Link != 0 {\n\t\tdata.AddRtAttr(nl.IFLA_GRE_LINK, nl.Uint32Attr(gretap.Link))\n\t}\n\n\tdata.AddRtAttr(nl.IFLA_GRE_PMTUDISC, nl.Uint8Attr(gretap.PMtuDisc))\n\tdata.AddRtAttr(nl.IFLA_GRE_TTL, nl.Uint8Attr(gretap.Ttl))\n\tdata.AddRtAttr(nl.IFLA_GRE_TOS, nl.Uint8Attr(gretap.Tos))\n\tdata.AddRtAttr(nl.IFLA_GRE_ENCAP_TYPE, nl.Uint16Attr(gretap.EncapType))\n\tdata.AddRtAttr(nl.IFLA_GRE_ENCAP_FLAGS, nl.Uint16Attr(gretap.EncapFlags))\n\tdata.AddRtAttr(nl.IFLA_GRE_ENCAP_SPORT, htons(gretap.EncapSport))\n\tdata.AddRtAttr(nl.IFLA_GRE_ENCAP_DPORT, htons(gretap.EncapDport))\n}\n\nfunc parseGretapData(link Link, data []syscall.NetlinkRouteAttr) {\n\tgre := link.(*Gretap)\n\tfor _, datum := range data {\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.IFLA_GRE_OKEY:\n\t\t\tgre.IKey = ntohl(datum.Value[0:4])\n\t\tcase nl.IFLA_GRE_IKEY:\n\t\t\tgre.OKey = ntohl(datum.Value[0:4])\n\t\tcase nl.IFLA_GRE_LOCAL:\n\t\t\tgre.Local = net.IP(datum.Value)\n\t\tcase nl.IFLA_GRE_REMOTE:\n\t\t\tgre.Remote = net.IP(datum.Value)\n\t\tcase nl.IFLA_GRE_ENCAP_SPORT:\n\t\t\tgre.EncapSport = ntohs(datum.Value[0:2])\n\t\tcase nl.IFLA_GRE_ENCAP_DPORT:\n\t\t\tgre.EncapDport = ntohs(datum.Value[0:2])\n\t\tcase nl.IFLA_GRE_IFLAGS:\n\t\t\tgre.IFlags = ntohs(datum.Value[0:2])\n\t\tcase nl.IFLA_GRE_OFLAGS:\n\t\t\tgre.OFlags = ntohs(datum.Value[0:2])\n\t\tcase nl.IFLA_GRE_TTL:\n\t\t\tgre.Ttl = uint8(datum.Value[0])\n\t\tcase nl.IFLA_GRE_TOS:\n\t\t\tgre.Tos = uint8(datum.Value[0])\n\t\tcase nl.IFLA_GRE_PMTUDISC:\n\t\t\tgre.PMtuDisc = uint8(datum.Value[0])\n\t\tcase nl.IFLA_GRE_ENCAP_TYPE:\n\t\t\tgre.EncapType = native.Uint16(datum.Value[0:2])\n\t\tcase nl.IFLA_GRE_ENCAP_FLAGS:\n\t\t\tgre.EncapFlags = native.Uint16(datum.Value[0:2])\n\t\tcase nl.IFLA_GRE_COLLECT_METADATA:\n\t\t\tgre.FlowBased = true\n\t\t}\n\t}\n}\n\nfunc addGretunAttrs(gre *Gretun, linkInfo *nl.RtAttr) {\n\tdata := linkInfo.AddRtAttr(nl.IFLA_INFO_DATA, nil)\n\n\tif ip := gre.Local; ip != nil {\n\t\tif ip.To4() != nil {\n\t\t\tip = ip.To4()\n\t\t}\n\t\tdata.AddRtAttr(nl.IFLA_GRE_LOCAL, []byte(ip))\n\t}\n\n\tif ip := gre.Remote; ip != nil {\n\t\tif ip.To4() != nil {\n\t\t\tip = ip.To4()\n\t\t}\n\t\tdata.AddRtAttr(nl.IFLA_GRE_REMOTE, []byte(ip))\n\t}\n\n\tif gre.IKey != 0 {\n\t\tdata.AddRtAttr(nl.IFLA_GRE_IKEY, htonl(gre.IKey))\n\t\tgre.IFlags |= uint16(nl.GRE_KEY)\n\t}\n\n\tif gre.OKey != 0 {\n\t\tdata.AddRtAttr(nl.IFLA_GRE_OKEY, htonl(gre.OKey))\n\t\tgre.OFlags |= uint16(nl.GRE_KEY)\n\t}\n\n\tdata.AddRtAttr(nl.IFLA_GRE_IFLAGS, htons(gre.IFlags))\n\tdata.AddRtAttr(nl.IFLA_GRE_OFLAGS, htons(gre.OFlags))\n\n\tif gre.Link != 0 {\n\t\tdata.AddRtAttr(nl.IFLA_GRE_LINK, nl.Uint32Attr(gre.Link))\n\t}\n\n\tdata.AddRtAttr(nl.IFLA_GRE_PMTUDISC, nl.Uint8Attr(gre.PMtuDisc))\n\tdata.AddRtAttr(nl.IFLA_GRE_TTL, nl.Uint8Attr(gre.Ttl))\n\tdata.AddRtAttr(nl.IFLA_GRE_TOS, nl.Uint8Attr(gre.Tos))\n\tdata.AddRtAttr(nl.IFLA_GRE_ENCAP_TYPE, nl.Uint16Attr(gre.EncapType))\n\tdata.AddRtAttr(nl.IFLA_GRE_ENCAP_FLAGS, nl.Uint16Attr(gre.EncapFlags))\n\tdata.AddRtAttr(nl.IFLA_GRE_ENCAP_SPORT, htons(gre.EncapSport))\n\tdata.AddRtAttr(nl.IFLA_GRE_ENCAP_DPORT, htons(gre.EncapDport))\n}\n\nfunc parseGretunData(link Link, data []syscall.NetlinkRouteAttr) {\n\tgre := link.(*Gretun)\n\tfor _, datum := range data {\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.IFLA_GRE_IKEY:\n\t\t\tgre.IKey = ntohl(datum.Value[0:4])\n\t\tcase nl.IFLA_GRE_OKEY:\n\t\t\tgre.OKey = ntohl(datum.Value[0:4])\n\t\tcase nl.IFLA_GRE_LOCAL:\n\t\t\tgre.Local = net.IP(datum.Value)\n\t\tcase nl.IFLA_GRE_REMOTE:\n\t\t\tgre.Remote = net.IP(datum.Value)\n\t\tcase nl.IFLA_GRE_IFLAGS:\n\t\t\tgre.IFlags = ntohs(datum.Value[0:2])\n\t\tcase nl.IFLA_GRE_OFLAGS:\n\t\t\tgre.OFlags = ntohs(datum.Value[0:2])\n\t\tcase nl.IFLA_GRE_TTL:\n\t\t\tgre.Ttl = uint8(datum.Value[0])\n\t\tcase nl.IFLA_GRE_TOS:\n\t\t\tgre.Tos = uint8(datum.Value[0])\n\t\tcase nl.IFLA_GRE_PMTUDISC:\n\t\t\tgre.PMtuDisc = uint8(datum.Value[0])\n\t\tcase nl.IFLA_GRE_ENCAP_TYPE:\n\t\t\tgre.EncapType = native.Uint16(datum.Value[0:2])\n\t\tcase nl.IFLA_GRE_ENCAP_FLAGS:\n\t\t\tgre.EncapFlags = native.Uint16(datum.Value[0:2])\n\t\tcase nl.IFLA_GRE_ENCAP_SPORT:\n\t\t\tgre.EncapSport = ntohs(datum.Value[0:2])\n\t\tcase nl.IFLA_GRE_ENCAP_DPORT:\n\t\t\tgre.EncapDport = ntohs(datum.Value[0:2])\n\t\t}\n\t}\n}\n\nfunc addXdpAttrs(xdp *LinkXdp, req *nl.NetlinkRequest) {\n\tattrs := nl.NewRtAttr(unix.IFLA_XDP|unix.NLA_F_NESTED, nil)\n\tb := make([]byte, 4)\n\tnative.PutUint32(b, uint32(xdp.Fd))\n\tattrs.AddRtAttr(nl.IFLA_XDP_FD, b)\n\tif xdp.Flags != 0 {\n\t\tb := make([]byte, 4)\n\t\tnative.PutUint32(b, xdp.Flags)\n\t\tattrs.AddRtAttr(nl.IFLA_XDP_FLAGS, b)\n\t}\n\treq.AddData(attrs)\n}\n\nfunc parseLinkXdp(data []byte) (*LinkXdp, error) {\n\tattrs, err := nl.ParseRouteAttr(data)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\txdp := &LinkXdp{}\n\tfor _, attr := range attrs {\n\t\tswitch attr.Attr.Type {\n\t\tcase nl.IFLA_XDP_FD:\n\t\t\txdp.Fd = int(native.Uint32(attr.Value[0:4]))\n\t\tcase nl.IFLA_XDP_ATTACHED:\n\t\t\txdp.AttachMode = uint32(attr.Value[0])\n\t\t\txdp.Attached = xdp.AttachMode != 0\n\t\tcase nl.IFLA_XDP_FLAGS:\n\t\t\txdp.Flags = native.Uint32(attr.Value[0:4])\n\t\tcase nl.IFLA_XDP_PROG_ID:\n\t\t\txdp.ProgId = native.Uint32(attr.Value[0:4])\n\t\t}\n\t}\n\treturn xdp, nil\n}\n\nfunc addIptunAttrs(iptun *Iptun, linkInfo *nl.RtAttr) {\n\tif iptun.FlowBased {\n\t\t// In flow based mode, no other attributes need to be configured\n\t\tlinkInfo.AddRtAttr(nl.IFLA_IPTUN_COLLECT_METADATA, boolAttr(iptun.FlowBased))\n\t\treturn\n\t}\n\n\tdata := linkInfo.AddRtAttr(nl.IFLA_INFO_DATA, nil)\n\n\tip := iptun.Local.To4()\n\tif ip != nil {\n\t\tdata.AddRtAttr(nl.IFLA_IPTUN_LOCAL, []byte(ip))\n\t}\n\n\tip = iptun.Remote.To4()\n\tif ip != nil {\n\t\tdata.AddRtAttr(nl.IFLA_IPTUN_REMOTE, []byte(ip))\n\t}\n\n\tif iptun.Link != 0 {\n\t\tdata.AddRtAttr(nl.IFLA_IPTUN_LINK, nl.Uint32Attr(iptun.Link))\n\t}\n\tdata.AddRtAttr(nl.IFLA_IPTUN_PMTUDISC, nl.Uint8Attr(iptun.PMtuDisc))\n\tdata.AddRtAttr(nl.IFLA_IPTUN_TTL, nl.Uint8Attr(iptun.Ttl))\n\tdata.AddRtAttr(nl.IFLA_IPTUN_TOS, nl.Uint8Attr(iptun.Tos))\n\tdata.AddRtAttr(nl.IFLA_IPTUN_ENCAP_TYPE, nl.Uint16Attr(iptun.EncapType))\n\tdata.AddRtAttr(nl.IFLA_IPTUN_ENCAP_FLAGS, nl.Uint16Attr(iptun.EncapFlags))\n\tdata.AddRtAttr(nl.IFLA_IPTUN_ENCAP_SPORT, htons(iptun.EncapSport))\n\tdata.AddRtAttr(nl.IFLA_IPTUN_ENCAP_DPORT, htons(iptun.EncapDport))\n}\n\nfunc parseIptunData(link Link, data []syscall.NetlinkRouteAttr) {\n\tiptun := link.(*Iptun)\n\tfor _, datum := range data {\n\t\t// NOTE: same with vxlan, ip tunnel may also has null datum.Value\n\t\tif len(datum.Value) == 0 {\n\t\t\tcontinue\n\t\t}\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.IFLA_IPTUN_LOCAL:\n\t\t\tiptun.Local = net.IP(datum.Value[0:4])\n\t\tcase nl.IFLA_IPTUN_REMOTE:\n\t\t\tiptun.Remote = net.IP(datum.Value[0:4])\n\t\tcase nl.IFLA_IPTUN_TTL:\n\t\t\tiptun.Ttl = uint8(datum.Value[0])\n\t\tcase nl.IFLA_IPTUN_TOS:\n\t\t\tiptun.Tos = uint8(datum.Value[0])\n\t\tcase nl.IFLA_IPTUN_PMTUDISC:\n\t\t\tiptun.PMtuDisc = uint8(datum.Value[0])\n\t\tcase nl.IFLA_IPTUN_ENCAP_SPORT:\n\t\t\tiptun.EncapSport = ntohs(datum.Value[0:2])\n\t\tcase nl.IFLA_IPTUN_ENCAP_DPORT:\n\t\t\tiptun.EncapDport = ntohs(datum.Value[0:2])\n\t\tcase nl.IFLA_IPTUN_ENCAP_TYPE:\n\t\t\tiptun.EncapType = native.Uint16(datum.Value[0:2])\n\t\tcase nl.IFLA_IPTUN_ENCAP_FLAGS:\n\t\t\tiptun.EncapFlags = native.Uint16(datum.Value[0:2])\n\t\tcase nl.IFLA_IPTUN_COLLECT_METADATA:\n\t\t\tiptun.FlowBased = true\n\t\t}\n\t}\n}\n\nfunc addIp6tnlAttrs(ip6tnl *Ip6tnl, linkInfo *nl.RtAttr) {\n\tdata := linkInfo.AddRtAttr(nl.IFLA_INFO_DATA, nil)\n\n\tif ip6tnl.Link != 0 {\n\t\tdata.AddRtAttr(nl.IFLA_IPTUN_LINK, nl.Uint32Attr(ip6tnl.Link))\n\t}\n\n\tip := ip6tnl.Local.To16()\n\tif ip != nil {\n\t\tdata.AddRtAttr(nl.IFLA_IPTUN_LOCAL, []byte(ip))\n\t}\n\n\tip = ip6tnl.Remote.To16()\n\tif ip != nil {\n\t\tdata.AddRtAttr(nl.IFLA_IPTUN_REMOTE, []byte(ip))\n\t}\n\n\tdata.AddRtAttr(nl.IFLA_IPTUN_TTL, nl.Uint8Attr(ip6tnl.Ttl))\n\tdata.AddRtAttr(nl.IFLA_IPTUN_TOS, nl.Uint8Attr(ip6tnl.Tos))\n\tdata.AddRtAttr(nl.IFLA_IPTUN_FLAGS, nl.Uint32Attr(ip6tnl.Flags))\n\tdata.AddRtAttr(nl.IFLA_IPTUN_PROTO, nl.Uint8Attr(ip6tnl.Proto))\n\tdata.AddRtAttr(nl.IFLA_IPTUN_FLOWINFO, nl.Uint32Attr(ip6tnl.FlowInfo))\n\tdata.AddRtAttr(nl.IFLA_IPTUN_ENCAP_LIMIT, nl.Uint8Attr(ip6tnl.EncapLimit))\n\tdata.AddRtAttr(nl.IFLA_IPTUN_ENCAP_TYPE, nl.Uint16Attr(ip6tnl.EncapType))\n\tdata.AddRtAttr(nl.IFLA_IPTUN_ENCAP_FLAGS, nl.Uint16Attr(ip6tnl.EncapFlags))\n\tdata.AddRtAttr(nl.IFLA_IPTUN_ENCAP_SPORT, htons(ip6tnl.EncapSport))\n\tdata.AddRtAttr(nl.IFLA_IPTUN_ENCAP_DPORT, htons(ip6tnl.EncapDport))\n}\n\nfunc parseIp6tnlData(link Link, data []syscall.NetlinkRouteAttr) {\n\tip6tnl := link.(*Ip6tnl)\n\tfor _, datum := range data {\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.IFLA_IPTUN_LOCAL:\n\t\t\tip6tnl.Local = net.IP(datum.Value[:16])\n\t\tcase nl.IFLA_IPTUN_REMOTE:\n\t\t\tip6tnl.Remote = net.IP(datum.Value[:16])\n\t\tcase nl.IFLA_IPTUN_TTL:\n\t\t\tip6tnl.Ttl = datum.Value[0]\n\t\tcase nl.IFLA_IPTUN_TOS:\n\t\t\tip6tnl.Tos = datum.Value[0]\n\t\tcase nl.IFLA_IPTUN_FLAGS:\n\t\t\tip6tnl.Flags = native.Uint32(datum.Value[:4])\n\t\tcase nl.IFLA_IPTUN_PROTO:\n\t\t\tip6tnl.Proto = datum.Value[0]\n\t\tcase nl.IFLA_IPTUN_FLOWINFO:\n\t\t\tip6tnl.FlowInfo = native.Uint32(datum.Value[:4])\n\t\tcase nl.IFLA_IPTUN_ENCAP_LIMIT:\n\t\t\tip6tnl.EncapLimit = datum.Value[0]\n\t\tcase nl.IFLA_IPTUN_ENCAP_TYPE:\n\t\t\tip6tnl.EncapType = native.Uint16(datum.Value[0:2])\n\t\tcase nl.IFLA_IPTUN_ENCAP_FLAGS:\n\t\t\tip6tnl.EncapFlags = native.Uint16(datum.Value[0:2])\n\t\tcase nl.IFLA_IPTUN_ENCAP_SPORT:\n\t\t\tip6tnl.EncapSport = ntohs(datum.Value[0:2])\n\t\tcase nl.IFLA_IPTUN_ENCAP_DPORT:\n\t\t\tip6tnl.EncapDport = ntohs(datum.Value[0:2])\n\t\t}\n\t}\n}\n\nfunc addSittunAttrs(sittun *Sittun, linkInfo *nl.RtAttr) {\n\tdata := linkInfo.AddRtAttr(nl.IFLA_INFO_DATA, nil)\n\n\tif sittun.Link != 0 {\n\t\tdata.AddRtAttr(nl.IFLA_IPTUN_LINK, nl.Uint32Attr(sittun.Link))\n\t}\n\n\tip := sittun.Local.To4()\n\tif ip != nil {\n\t\tdata.AddRtAttr(nl.IFLA_IPTUN_LOCAL, []byte(ip))\n\t}\n\n\tip = sittun.Remote.To4()\n\tif ip != nil {\n\t\tdata.AddRtAttr(nl.IFLA_IPTUN_REMOTE, []byte(ip))\n\t}\n\n\tif sittun.Ttl > 0 {\n\t\t// Would otherwise fail on 3.10 kernel\n\t\tdata.AddRtAttr(nl.IFLA_IPTUN_TTL, nl.Uint8Attr(sittun.Ttl))\n\t}\n\n\tdata.AddRtAttr(nl.IFLA_IPTUN_PROTO, nl.Uint8Attr(sittun.Proto))\n\tdata.AddRtAttr(nl.IFLA_IPTUN_TOS, nl.Uint8Attr(sittun.Tos))\n\tdata.AddRtAttr(nl.IFLA_IPTUN_PMTUDISC, nl.Uint8Attr(sittun.PMtuDisc))\n\tdata.AddRtAttr(nl.IFLA_IPTUN_ENCAP_LIMIT, nl.Uint8Attr(sittun.EncapLimit))\n\tdata.AddRtAttr(nl.IFLA_IPTUN_ENCAP_TYPE, nl.Uint16Attr(sittun.EncapType))\n\tdata.AddRtAttr(nl.IFLA_IPTUN_ENCAP_FLAGS, nl.Uint16Attr(sittun.EncapFlags))\n\tdata.AddRtAttr(nl.IFLA_IPTUN_ENCAP_SPORT, htons(sittun.EncapSport))\n\tdata.AddRtAttr(nl.IFLA_IPTUN_ENCAP_DPORT, htons(sittun.EncapDport))\n}\n\nfunc parseSittunData(link Link, data []syscall.NetlinkRouteAttr) {\n\tsittun := link.(*Sittun)\n\tfor _, datum := range data {\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.IFLA_IPTUN_LOCAL:\n\t\t\tsittun.Local = net.IP(datum.Value[0:4])\n\t\tcase nl.IFLA_IPTUN_REMOTE:\n\t\t\tsittun.Remote = net.IP(datum.Value[0:4])\n\t\tcase nl.IFLA_IPTUN_TTL:\n\t\t\tsittun.Ttl = datum.Value[0]\n\t\tcase nl.IFLA_IPTUN_TOS:\n\t\t\tsittun.Tos = datum.Value[0]\n\t\tcase nl.IFLA_IPTUN_PMTUDISC:\n\t\t\tsittun.PMtuDisc = datum.Value[0]\n\t\tcase nl.IFLA_IPTUN_PROTO:\n\t\t\tsittun.Proto = datum.Value[0]\n\t\tcase nl.IFLA_IPTUN_ENCAP_TYPE:\n\t\t\tsittun.EncapType = native.Uint16(datum.Value[0:2])\n\t\tcase nl.IFLA_IPTUN_ENCAP_FLAGS:\n\t\t\tsittun.EncapFlags = native.Uint16(datum.Value[0:2])\n\t\tcase nl.IFLA_IPTUN_ENCAP_SPORT:\n\t\t\tsittun.EncapSport = ntohs(datum.Value[0:2])\n\t\tcase nl.IFLA_IPTUN_ENCAP_DPORT:\n\t\t\tsittun.EncapDport = ntohs(datum.Value[0:2])\n\t\t}\n\t}\n}\n\nfunc addVtiAttrs(vti *Vti, linkInfo *nl.RtAttr) {\n\tdata := linkInfo.AddRtAttr(nl.IFLA_INFO_DATA, nil)\n\n\tfamily := FAMILY_V4\n\tif vti.Local.To4() == nil {\n\t\tfamily = FAMILY_V6\n\t}\n\n\tvar ip net.IP\n\n\tif family == FAMILY_V4 {\n\t\tip = vti.Local.To4()\n\t} else {\n\t\tip = vti.Local\n\t}\n\tif ip != nil {\n\t\tdata.AddRtAttr(nl.IFLA_VTI_LOCAL, []byte(ip))\n\t}\n\n\tif family == FAMILY_V4 {\n\t\tip = vti.Remote.To4()\n\t} else {\n\t\tip = vti.Remote\n\t}\n\tif ip != nil {\n\t\tdata.AddRtAttr(nl.IFLA_VTI_REMOTE, []byte(ip))\n\t}\n\n\tif vti.Link != 0 {\n\t\tdata.AddRtAttr(nl.IFLA_VTI_LINK, nl.Uint32Attr(vti.Link))\n\t}\n\n\tdata.AddRtAttr(nl.IFLA_VTI_IKEY, htonl(vti.IKey))\n\tdata.AddRtAttr(nl.IFLA_VTI_OKEY, htonl(vti.OKey))\n}\n\nfunc parseVtiData(link Link, data []syscall.NetlinkRouteAttr) {\n\tvti := link.(*Vti)\n\tfor _, datum := range data {\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.IFLA_VTI_LOCAL:\n\t\t\tvti.Local = net.IP(datum.Value)\n\t\tcase nl.IFLA_VTI_REMOTE:\n\t\t\tvti.Remote = net.IP(datum.Value)\n\t\tcase nl.IFLA_VTI_IKEY:\n\t\t\tvti.IKey = ntohl(datum.Value[0:4])\n\t\tcase nl.IFLA_VTI_OKEY:\n\t\t\tvti.OKey = ntohl(datum.Value[0:4])\n\t\t}\n\t}\n}\n\nfunc addVrfAttrs(vrf *Vrf, linkInfo *nl.RtAttr) {\n\tdata := linkInfo.AddRtAttr(nl.IFLA_INFO_DATA, nil)\n\tb := make([]byte, 4)\n\tnative.PutUint32(b, uint32(vrf.Table))\n\tdata.AddRtAttr(nl.IFLA_VRF_TABLE, b)\n}\n\nfunc parseVrfData(link Link, data []syscall.NetlinkRouteAttr) {\n\tvrf := link.(*Vrf)\n\tfor _, datum := range data {\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.IFLA_VRF_TABLE:\n\t\t\tvrf.Table = native.Uint32(datum.Value[0:4])\n\t\t}\n\t}\n}\n\nfunc addBridgeAttrs(bridge *Bridge, linkInfo *nl.RtAttr) {\n\tdata := linkInfo.AddRtAttr(nl.IFLA_INFO_DATA, nil)\n\tif bridge.MulticastSnooping != nil {\n\t\tdata.AddRtAttr(nl.IFLA_BR_MCAST_SNOOPING, boolToByte(*bridge.MulticastSnooping))\n\t}\n\tif bridge.AgeingTime != nil {\n\t\tdata.AddRtAttr(nl.IFLA_BR_AGEING_TIME, nl.Uint32Attr(*bridge.AgeingTime))\n\t}\n\tif bridge.HelloTime != nil {\n\t\tdata.AddRtAttr(nl.IFLA_BR_HELLO_TIME, nl.Uint32Attr(*bridge.HelloTime))\n\t}\n\tif bridge.VlanFiltering != nil {\n\t\tdata.AddRtAttr(nl.IFLA_BR_VLAN_FILTERING, boolToByte(*bridge.VlanFiltering))\n\t}\n}\n\nfunc parseBridgeData(bridge Link, data []syscall.NetlinkRouteAttr) {\n\tbr := bridge.(*Bridge)\n\tfor _, datum := range data {\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.IFLA_BR_AGEING_TIME:\n\t\t\tageingTime := native.Uint32(datum.Value[0:4])\n\t\t\tbr.AgeingTime = &ageingTime\n\t\tcase nl.IFLA_BR_HELLO_TIME:\n\t\t\thelloTime := native.Uint32(datum.Value[0:4])\n\t\t\tbr.HelloTime = &helloTime\n\t\tcase nl.IFLA_BR_MCAST_SNOOPING:\n\t\t\tmcastSnooping := datum.Value[0] == 1\n\t\t\tbr.MulticastSnooping = &mcastSnooping\n\t\tcase nl.IFLA_BR_VLAN_FILTERING:\n\t\t\tvlanFiltering := datum.Value[0] == 1\n\t\t\tbr.VlanFiltering = &vlanFiltering\n\t\t}\n\t}\n}\n\nfunc addGTPAttrs(gtp *GTP, linkInfo *nl.RtAttr) {\n\tdata := linkInfo.AddRtAttr(nl.IFLA_INFO_DATA, nil)\n\tdata.AddRtAttr(nl.IFLA_GTP_FD0, nl.Uint32Attr(uint32(gtp.FD0)))\n\tdata.AddRtAttr(nl.IFLA_GTP_FD1, nl.Uint32Attr(uint32(gtp.FD1)))\n\tdata.AddRtAttr(nl.IFLA_GTP_PDP_HASHSIZE, nl.Uint32Attr(131072))\n\tif gtp.Role != nl.GTP_ROLE_GGSN {\n\t\tdata.AddRtAttr(nl.IFLA_GTP_ROLE, nl.Uint32Attr(uint32(gtp.Role)))\n\t}\n}\n\nfunc parseGTPData(link Link, data []syscall.NetlinkRouteAttr) {\n\tgtp := link.(*GTP)\n\tfor _, datum := range data {\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.IFLA_GTP_FD0:\n\t\t\tgtp.FD0 = int(native.Uint32(datum.Value))\n\t\tcase nl.IFLA_GTP_FD1:\n\t\t\tgtp.FD1 = int(native.Uint32(datum.Value))\n\t\tcase nl.IFLA_GTP_PDP_HASHSIZE:\n\t\t\tgtp.PDPHashsize = int(native.Uint32(datum.Value))\n\t\tcase nl.IFLA_GTP_ROLE:\n\t\t\tgtp.Role = int(native.Uint32(datum.Value))\n\t\t}\n\t}\n}\n\nfunc parseVfInfoList(data []syscall.NetlinkRouteAttr) ([]VfInfo, error) {\n\tvar vfs []VfInfo\n\n\tfor i, element := range data {\n\t\tif element.Attr.Type != nl.IFLA_VF_INFO {\n\t\t\treturn nil, fmt.Errorf(\"Incorrect element type in vf info list: %d\", element.Attr.Type)\n\t\t}\n\t\tvfAttrs, err := nl.ParseRouteAttr(element.Value)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tvfs = append(vfs, parseVfInfo(vfAttrs, i))\n\t}\n\treturn vfs, nil\n}\n\nfunc parseVfInfo(data []syscall.NetlinkRouteAttr, id int) VfInfo {\n\tvf := VfInfo{ID: id}\n\tfor _, element := range data {\n\t\tswitch element.Attr.Type {\n\t\tcase nl.IFLA_VF_MAC:\n\t\t\tmac := nl.DeserializeVfMac(element.Value[:])\n\t\t\tvf.Mac = mac.Mac[:6]\n\t\tcase nl.IFLA_VF_VLAN:\n\t\t\tvl := nl.DeserializeVfVlan(element.Value[:])\n\t\t\tvf.Vlan = int(vl.Vlan)\n\t\t\tvf.Qos = int(vl.Qos)\n\t\tcase nl.IFLA_VF_TX_RATE:\n\t\t\ttxr := nl.DeserializeVfTxRate(element.Value[:])\n\t\t\tvf.TxRate = int(txr.Rate)\n\t\tcase nl.IFLA_VF_SPOOFCHK:\n\t\t\tsp := nl.DeserializeVfSpoofchk(element.Value[:])\n\t\t\tvf.Spoofchk = sp.Setting != 0\n\t\tcase nl.IFLA_VF_LINK_STATE:\n\t\t\tls := nl.DeserializeVfLinkState(element.Value[:])\n\t\t\tvf.LinkState = ls.LinkState\n\t\tcase nl.IFLA_VF_RATE:\n\t\t\tvfr := nl.DeserializeVfRate(element.Value[:])\n\t\t\tvf.MaxTxRate = vfr.MaxTxRate\n\t\t\tvf.MinTxRate = vfr.MinTxRate\n\t\tcase nl.IFLA_VF_STATS:\n\t\t\tvfstats := nl.DeserializeVfStats(element.Value[:])\n\t\t\tvf.RxPackets = vfstats.RxPackets\n\t\t\tvf.TxPackets = vfstats.TxPackets\n\t\t\tvf.RxBytes = vfstats.RxBytes\n\t\t\tvf.TxBytes = vfstats.TxBytes\n\t\t\tvf.Multicast = vfstats.Multicast\n\t\t\tvf.Broadcast = vfstats.Broadcast\n\t\t\tvf.RxDropped = vfstats.RxDropped\n\t\t\tvf.TxDropped = vfstats.TxDropped\n\n\t\tcase nl.IFLA_VF_RSS_QUERY_EN:\n\t\t\tresult := nl.DeserializeVfRssQueryEn(element.Value)\n\t\t\tvf.RssQuery = result.Setting\n\n\t\tcase nl.IFLA_VF_TRUST:\n\t\t\tresult := nl.DeserializeVfTrust(element.Value)\n\t\t\tvf.Trust = result.Setting\n\t\t}\n\t}\n\treturn vf\n}\n\nfunc addXfrmiAttrs(xfrmi *Xfrmi, linkInfo *nl.RtAttr) {\n\tdata := linkInfo.AddRtAttr(nl.IFLA_INFO_DATA, nil)\n\tdata.AddRtAttr(nl.IFLA_XFRM_LINK, nl.Uint32Attr(uint32(xfrmi.ParentIndex)))\n\tdata.AddRtAttr(nl.IFLA_XFRM_IF_ID, nl.Uint32Attr(xfrmi.Ifid))\n\n}\n\nfunc parseXfrmiData(link Link, data []syscall.NetlinkRouteAttr) {\n\txfrmi := link.(*Xfrmi)\n\tfor _, datum := range data {\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.IFLA_XFRM_LINK:\n\t\t\txfrmi.ParentIndex = int(native.Uint32(datum.Value))\n\t\tcase nl.IFLA_XFRM_IF_ID:\n\t\t\txfrmi.Ifid = native.Uint32(datum.Value)\n\t\t}\n\t}\n}\n\n// LinkSetBondSlave add slave to bond link via ioctl interface.\nfunc LinkSetBondSlave(link Link, master *Bond) error {\n\tfd, err := getSocketUDP()\n\tif err != nil {\n\t\treturn err\n\t}\n\tdefer syscall.Close(fd)\n\n\tifreq := newIocltSlaveReq(link.Attrs().Name, master.Attrs().Name)\n\n\t_, _, errno := syscall.Syscall(syscall.SYS_IOCTL, uintptr(fd), unix.SIOCBONDENSLAVE, uintptr(unsafe.Pointer(ifreq)))\n\tif errno != 0 {\n\t\treturn fmt.Errorf(\"Failed to enslave %q to %q, errno=%v\", link.Attrs().Name, master.Attrs().Name, errno)\n\t}\n\treturn nil\n}\n\n// LinkSetBondSlaveQueueId modify bond slave queue-id.\nfunc (h *Handle) LinkSetBondSlaveQueueId(link Link, queueId uint16) error {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\treq := h.newNetlinkRequest(unix.RTM_SETLINK, unix.NLM_F_ACK)\n\n\tmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\tmsg.Index = int32(base.Index)\n\treq.AddData(msg)\n\n\tlinkInfo := nl.NewRtAttr(unix.IFLA_LINKINFO, nil)\n\tdata := linkInfo.AddRtAttr(nl.IFLA_INFO_SLAVE_DATA, nil)\n\tdata.AddRtAttr(nl.IFLA_BOND_SLAVE_QUEUE_ID, nl.Uint16Attr(queueId))\n\n\treq.AddData(linkInfo)\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// LinkSetBondSlaveQueueId modify bond slave queue-id.\nfunc LinkSetBondSlaveQueueId(link Link, queueId uint16) error {\n\treturn pkgHandle.LinkSetBondSlaveQueueId(link, queueId)\n}\n\nfunc vethStatsSerialize(stats ethtoolStats) ([]byte, error) {\n\tstatsSize := int(unsafe.Sizeof(stats)) + int(stats.nStats)*int(unsafe.Sizeof(uint64(0)))\n\tb := make([]byte, 0, statsSize)\n\tbuf := bytes.NewBuffer(b)\n\terr := binary.Write(buf, nl.NativeEndian(), stats)\n\treturn buf.Bytes()[:statsSize], err\n}\n\ntype vethEthtoolStats struct {\n\tCmd uint32\n\tNStats uint32\n\tPeer uint64\n\t// Newer kernels have XDP stats in here, but we only care\n\t// to extract the peer ifindex here.\n}\n\nfunc vethStatsDeserialize(b []byte) (vethEthtoolStats, error) {\n\tvar stats = vethEthtoolStats{}\n\terr := binary.Read(bytes.NewReader(b), nl.NativeEndian(), &stats)\n\treturn stats, err\n}\n\n// VethPeerIndex get veth peer index.\nfunc VethPeerIndex(link *Veth) (int, error) {\n\tfd, err := getSocketUDP()\n\tif err != nil {\n\t\treturn -1, err\n\t}\n\tdefer syscall.Close(fd)\n\n\tifreq, sSet := newIocltStringSetReq(link.Name)\n\t_, _, errno := syscall.Syscall(syscall.SYS_IOCTL, uintptr(fd), SIOCETHTOOL, uintptr(unsafe.Pointer(ifreq)))\n\tif errno != 0 {\n\t\treturn -1, fmt.Errorf(\"SIOCETHTOOL request for %q failed, errno=%v\", link.Attrs().Name, errno)\n\t}\n\n\tstats := ethtoolStats{\n\t\tcmd: ETHTOOL_GSTATS,\n\t\tnStats: sSet.data[0],\n\t}\n\n\tbuffer, err := vethStatsSerialize(stats)\n\tif err != nil {\n\t\treturn -1, err\n\t}\n\n\tifreq.Data = uintptr(unsafe.Pointer(&buffer[0]))\n\t_, _, errno = syscall.Syscall(syscall.SYS_IOCTL, uintptr(fd), SIOCETHTOOL, uintptr(unsafe.Pointer(ifreq)))\n\tif errno != 0 {\n\t\treturn -1, fmt.Errorf(\"SIOCETHTOOL request for %q failed, errno=%v\", link.Attrs().Name, errno)\n\t}\n\n\tvstats, err := vethStatsDeserialize(buffer)\n\tif err != nil {\n\t\treturn -1, err\n\t}\n\n\treturn int(vstats.Peer), nil\n}\n\nfunc parseTuntapData(link Link, data []syscall.NetlinkRouteAttr) {\n\ttuntap := link.(*Tuntap)\n\tfor _, datum := range data {\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.IFLA_TUN_OWNER:\n\t\t\ttuntap.Owner = native.Uint32(datum.Value)\n\t\tcase nl.IFLA_TUN_GROUP:\n\t\t\ttuntap.Group = native.Uint32(datum.Value)\n\t\tcase nl.IFLA_TUN_TYPE:\n\t\t\ttuntap.Mode = TuntapMode(uint8(datum.Value[0]))\n\t\tcase nl.IFLA_TUN_PERSIST:\n\t\t\ttuntap.NonPersist = false\n\t\t\tif uint8(datum.Value[0]) == 0 {\n\t\t\t\ttuntap.NonPersist = true\n\t\t\t}\n\t\t}\n\t}\n}\n\nfunc parseIPoIBData(link Link, data []syscall.NetlinkRouteAttr) {\n\tipoib := link.(*IPoIB)\n\tfor _, datum := range data {\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.IFLA_IPOIB_PKEY:\n\t\t\tipoib.Pkey = uint16(native.Uint16(datum.Value))\n\t\tcase nl.IFLA_IPOIB_MODE:\n\t\t\tipoib.Mode = IPoIBMode(native.Uint16(datum.Value))\n\t\tcase nl.IFLA_IPOIB_UMCAST:\n\t\t\tipoib.Umcast = uint16(native.Uint16(datum.Value))\n\t\t}\n\t}\n}\n\nfunc parseCanData(link Link, data []syscall.NetlinkRouteAttr) {\n\tcan := link.(*Can)\n\tfor _, datum := range data {\n\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.IFLA_CAN_BITTIMING:\n\t\t\tcan.BitRate = native.Uint32(datum.Value)\n\t\t\tcan.SamplePoint = native.Uint32(datum.Value[4:])\n\t\t\tcan.TimeQuanta = native.Uint32(datum.Value[8:])\n\t\t\tcan.PropagationSegment = native.Uint32(datum.Value[12:])\n\t\t\tcan.PhaseSegment1 = native.Uint32(datum.Value[16:])\n\t\t\tcan.PhaseSegment2 = native.Uint32(datum.Value[20:])\n\t\t\tcan.SyncJumpWidth = native.Uint32(datum.Value[24:])\n\t\t\tcan.BitRatePreScaler = native.Uint32(datum.Value[28:])\n\t\tcase nl.IFLA_CAN_BITTIMING_CONST:\n\t\t\tcan.Name = string(datum.Value[:16])\n\t\t\tcan.TimeSegment1Min = native.Uint32(datum.Value[16:])\n\t\t\tcan.TimeSegment1Max = native.Uint32(datum.Value[20:])\n\t\t\tcan.TimeSegment2Min = native.Uint32(datum.Value[24:])\n\t\t\tcan.TimeSegment2Max = native.Uint32(datum.Value[28:])\n\t\t\tcan.SyncJumpWidthMax = native.Uint32(datum.Value[32:])\n\t\t\tcan.BitRatePreScalerMin = native.Uint32(datum.Value[36:])\n\t\t\tcan.BitRatePreScalerMax = native.Uint32(datum.Value[40:])\n\t\t\tcan.BitRatePreScalerInc = native.Uint32(datum.Value[44:])\n\t\tcase nl.IFLA_CAN_CLOCK:\n\t\t\tcan.ClockFrequency = native.Uint32(datum.Value)\n\t\tcase nl.IFLA_CAN_STATE:\n\t\t\tcan.State = native.Uint32(datum.Value)\n\t\tcase nl.IFLA_CAN_CTRLMODE:\n\t\t\tcan.Mask = native.Uint32(datum.Value)\n\t\t\tcan.Flags = native.Uint32(datum.Value[4:])\n\t\tcase nl.IFLA_CAN_BERR_COUNTER:\n\t\t\tcan.TxError = native.Uint16(datum.Value)\n\t\t\tcan.RxError = native.Uint16(datum.Value[2:])\n\t\tcase nl.IFLA_CAN_RESTART_MS:\n\t\t\tcan.RestartMs = native.Uint32(datum.Value)\n\t\tcase nl.IFLA_CAN_DATA_BITTIMING_CONST:\n\t\tcase nl.IFLA_CAN_RESTART:\n\t\tcase nl.IFLA_CAN_DATA_BITTIMING:\n\t\tcase nl.IFLA_CAN_TERMINATION:\n\t\tcase nl.IFLA_CAN_TERMINATION_CONST:\n\t\tcase nl.IFLA_CAN_BITRATE_CONST:\n\t\tcase nl.IFLA_CAN_DATA_BITRATE_CONST:\n\t\tcase nl.IFLA_CAN_BITRATE_MAX:\n\t\t}\n\t}\n}\n\nfunc addIPoIBAttrs(ipoib *IPoIB, linkInfo *nl.RtAttr) {\n\tdata := linkInfo.AddRtAttr(nl.IFLA_INFO_DATA, nil)\n\tdata.AddRtAttr(nl.IFLA_IPOIB_PKEY, nl.Uint16Attr(uint16(ipoib.Pkey)))\n\tdata.AddRtAttr(nl.IFLA_IPOIB_MODE, nl.Uint16Attr(uint16(ipoib.Mode)))\n\tdata.AddRtAttr(nl.IFLA_IPOIB_UMCAST, nl.Uint16Attr(uint16(ipoib.Umcast)))\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/link_tuntap_linux.go", "content": "package netlink\n\n// ideally golang.org/x/sys/unix would define IfReq but it only has\n// IFNAMSIZ, hence this minimalistic implementation\nconst (\n\tSizeOfIfReq = 40\n\tIFNAMSIZ = 16\n)\n\ntype ifReq struct {\n\tName [IFNAMSIZ]byte\n\tFlags uint16\n\tpad [SizeOfIfReq - IFNAMSIZ - 2]byte\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/neigh.go", "content": "package netlink\n\nimport (\n\t\"fmt\"\n\t\"net\"\n)\n\n// Neigh represents a link layer neighbor from netlink.\ntype Neigh struct {\n\tLinkIndex int\n\tFamily int\n\tState int\n\tType int\n\tFlags int\n\tIP net.IP\n\tHardwareAddr net.HardwareAddr\n\tLLIPAddr net.IP //Used in the case of NHRP\n\tVlan int\n\tVNI int\n\tMasterIndex int\n}\n\n// String returns $ip/$hwaddr $label\nfunc (neigh *Neigh) String() string {\n\treturn fmt.Sprintf(\"%s %s\", neigh.IP, neigh.HardwareAddr)\n}\n\n// NeighUpdate is sent when a neighbor changes - type is RTM_NEWNEIGH or RTM_DELNEIGH.\ntype NeighUpdate struct {\n\tType uint16\n\tNeigh\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/neigh_linux.go", "content": "package netlink\n\nimport (\n\t\"fmt\"\n\t\"net\"\n\t\"syscall\"\n\t\"unsafe\"\n\n\t\"github.com/vishvananda/netlink/nl\"\n\t\"github.com/vishvananda/netns\"\n\t\"golang.org/x/sys/unix\"\n)\n\nconst (\n\tNDA_UNSPEC = iota\n\tNDA_DST\n\tNDA_LLADDR\n\tNDA_CACHEINFO\n\tNDA_PROBES\n\tNDA_VLAN\n\tNDA_PORT\n\tNDA_VNI\n\tNDA_IFINDEX\n\tNDA_MASTER\n\tNDA_LINK_NETNSID\n\tNDA_SRC_VNI\n\tNDA_MAX = NDA_SRC_VNI\n)\n\n// Neighbor Cache Entry States.\nconst (\n\tNUD_NONE = 0x00\n\tNUD_INCOMPLETE = 0x01\n\tNUD_REACHABLE = 0x02\n\tNUD_STALE = 0x04\n\tNUD_DELAY = 0x08\n\tNUD_PROBE = 0x10\n\tNUD_FAILED = 0x20\n\tNUD_NOARP = 0x40\n\tNUD_PERMANENT = 0x80\n)\n\n// Neighbor Flags\nconst (\n\tNTF_USE = 0x01\n\tNTF_SELF = 0x02\n\tNTF_MASTER = 0x04\n\tNTF_PROXY = 0x08\n\tNTF_EXT_LEARNED = 0x10\n\tNTF_ROUTER = 0x80\n)\n\n// Ndmsg is for adding, removing or receiving information about a neighbor table entry\ntype Ndmsg struct {\n\tFamily uint8\n\tIndex uint32\n\tState uint16\n\tFlags uint8\n\tType uint8\n}\n\nfunc deserializeNdmsg(b []byte) *Ndmsg {\n\tvar dummy Ndmsg\n\treturn (*Ndmsg)(unsafe.Pointer(&b[0:unsafe.Sizeof(dummy)][0]))\n}\n\nfunc (msg *Ndmsg) Serialize() []byte {\n\treturn (*(*[unsafe.Sizeof(*msg)]byte)(unsafe.Pointer(msg)))[:]\n}\n\nfunc (msg *Ndmsg) Len() int {\n\treturn int(unsafe.Sizeof(*msg))\n}\n\n// NeighAdd will add an IP to MAC mapping to the ARP table\n// Equivalent to: `ip neigh add ....`\nfunc NeighAdd(neigh *Neigh) error {\n\treturn pkgHandle.NeighAdd(neigh)\n}\n\n// NeighAdd will add an IP to MAC mapping to the ARP table\n// Equivalent to: `ip neigh add ....`\nfunc (h *Handle) NeighAdd(neigh *Neigh) error {\n\treturn h.neighAdd(neigh, unix.NLM_F_CREATE|unix.NLM_F_EXCL)\n}\n\n// NeighSet will add or replace an IP to MAC mapping to the ARP table\n// Equivalent to: `ip neigh replace....`\nfunc NeighSet(neigh *Neigh) error {\n\treturn pkgHandle.NeighSet(neigh)\n}\n\n// NeighSet will add or replace an IP to MAC mapping to the ARP table\n// Equivalent to: `ip neigh replace....`\nfunc (h *Handle) NeighSet(neigh *Neigh) error {\n\treturn h.neighAdd(neigh, unix.NLM_F_CREATE|unix.NLM_F_REPLACE)\n}\n\n// NeighAppend will append an entry to FDB\n// Equivalent to: `bridge fdb append...`\nfunc NeighAppend(neigh *Neigh) error {\n\treturn pkgHandle.NeighAppend(neigh)\n}\n\n// NeighAppend will append an entry to FDB\n// Equivalent to: `bridge fdb append...`\nfunc (h *Handle) NeighAppend(neigh *Neigh) error {\n\treturn h.neighAdd(neigh, unix.NLM_F_CREATE|unix.NLM_F_APPEND)\n}\n\n// NeighAppend will append an entry to FDB\n// Equivalent to: `bridge fdb append...`\nfunc neighAdd(neigh *Neigh, mode int) error {\n\treturn pkgHandle.neighAdd(neigh, mode)\n}\n\n// NeighAppend will append an entry to FDB\n// Equivalent to: `bridge fdb append...`\nfunc (h *Handle) neighAdd(neigh *Neigh, mode int) error {\n\treq := h.newNetlinkRequest(unix.RTM_NEWNEIGH, mode|unix.NLM_F_ACK)\n\treturn neighHandle(neigh, req)\n}\n\n// NeighDel will delete an IP address from a link device.\n// Equivalent to: `ip addr del $addr dev $link`\nfunc NeighDel(neigh *Neigh) error {\n\treturn pkgHandle.NeighDel(neigh)\n}\n\n// NeighDel will delete an IP address from a link device.\n// Equivalent to: `ip addr del $addr dev $link`\nfunc (h *Handle) NeighDel(neigh *Neigh) error {\n\treq := h.newNetlinkRequest(unix.RTM_DELNEIGH, unix.NLM_F_ACK)\n\treturn neighHandle(neigh, req)\n}\n\nfunc neighHandle(neigh *Neigh, req *nl.NetlinkRequest) error {\n\tvar family int\n\n\tif neigh.Family > 0 {\n\t\tfamily = neigh.Family\n\t} else {\n\t\tfamily = nl.GetIPFamily(neigh.IP)\n\t}\n\n\tmsg := Ndmsg{\n\t\tFamily: uint8(family),\n\t\tIndex: uint32(neigh.LinkIndex),\n\t\tState: uint16(neigh.State),\n\t\tType: uint8(neigh.Type),\n\t\tFlags: uint8(neigh.Flags),\n\t}\n\treq.AddData(&msg)\n\n\tipData := neigh.IP.To4()\n\tif ipData == nil {\n\t\tipData = neigh.IP.To16()\n\t}\n\n\tdstData := nl.NewRtAttr(NDA_DST, ipData)\n\treq.AddData(dstData)\n\n\tif neigh.LLIPAddr != nil {\n\t\tllIPData := nl.NewRtAttr(NDA_LLADDR, neigh.LLIPAddr.To4())\n\t\treq.AddData(llIPData)\n\t} else if neigh.Flags != NTF_PROXY || neigh.HardwareAddr != nil {\n\t\thwData := nl.NewRtAttr(NDA_LLADDR, []byte(neigh.HardwareAddr))\n\t\treq.AddData(hwData)\n\t}\n\n\tif neigh.Vlan != 0 {\n\t\tvlanData := nl.NewRtAttr(NDA_VLAN, nl.Uint16Attr(uint16(neigh.Vlan)))\n\t\treq.AddData(vlanData)\n\t}\n\n\tif neigh.VNI != 0 {\n\t\tvniData := nl.NewRtAttr(NDA_VNI, nl.Uint32Attr(uint32(neigh.VNI)))\n\t\treq.AddData(vniData)\n\t}\n\n\tif neigh.MasterIndex != 0 {\n\t\tmasterData := nl.NewRtAttr(NDA_MASTER, nl.Uint32Attr(uint32(neigh.MasterIndex)))\n\t\treq.AddData(masterData)\n\t}\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// NeighList returns a list of IP-MAC mappings in the system (ARP table).\n// Equivalent to: `ip neighbor show`.\n// The list can be filtered by link and ip family.\nfunc NeighList(linkIndex, family int) ([]Neigh, error) {\n\treturn pkgHandle.NeighList(linkIndex, family)\n}\n\n// NeighProxyList returns a list of neighbor proxies in the system.\n// Equivalent to: `ip neighbor show proxy`.\n// The list can be filtered by link and ip family.\nfunc NeighProxyList(linkIndex, family int) ([]Neigh, error) {\n\treturn pkgHandle.NeighProxyList(linkIndex, family)\n}\n\n// NeighList returns a list of IP-MAC mappings in the system (ARP table).\n// Equivalent to: `ip neighbor show`.\n// The list can be filtered by link and ip family.\nfunc (h *Handle) NeighList(linkIndex, family int) ([]Neigh, error) {\n\treturn h.NeighListExecute(Ndmsg{\n\t\tFamily: uint8(family),\n\t\tIndex: uint32(linkIndex),\n\t})\n}\n\n// NeighProxyList returns a list of neighbor proxies in the system.\n// Equivalent to: `ip neighbor show proxy`.\n// The list can be filtered by link, ip family.\nfunc (h *Handle) NeighProxyList(linkIndex, family int) ([]Neigh, error) {\n\treturn h.NeighListExecute(Ndmsg{\n\t\tFamily: uint8(family),\n\t\tIndex: uint32(linkIndex),\n\t\tFlags: NTF_PROXY,\n\t})\n}\n\n// NeighListExecute returns a list of neighbour entries filtered by link, ip family, flag and state.\nfunc NeighListExecute(msg Ndmsg) ([]Neigh, error) {\n\treturn pkgHandle.NeighListExecute(msg)\n}\n\n// NeighListExecute returns a list of neighbour entries filtered by link, ip family, flag and state.\nfunc (h *Handle) NeighListExecute(msg Ndmsg) ([]Neigh, error) {\n\treq := h.newNetlinkRequest(unix.RTM_GETNEIGH, unix.NLM_F_DUMP)\n\treq.AddData(&msg)\n\n\tmsgs, err := req.Execute(unix.NETLINK_ROUTE, unix.RTM_NEWNEIGH)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tvar res []Neigh\n\tfor _, m := range msgs {\n\t\tndm := deserializeNdmsg(m)\n\t\tif msg.Index != 0 && ndm.Index != msg.Index {\n\t\t\t// Ignore messages from other interfaces\n\t\t\tcontinue\n\t\t}\n\t\tif msg.Family != 0 && ndm.Family != msg.Family {\n\t\t\tcontinue\n\t\t}\n\t\tif msg.State != 0 && ndm.State != msg.State {\n\t\t\tcontinue\n\t\t}\n\t\tif msg.Type != 0 && ndm.Type != msg.Type {\n\t\t\tcontinue\n\t\t}\n\t\tif msg.Flags != 0 && ndm.Flags != msg.Flags {\n\t\t\tcontinue\n\t\t}\n\n\t\tneigh, err := NeighDeserialize(m)\n\t\tif err != nil {\n\t\t\tcontinue\n\t\t}\n\n\t\tres = append(res, *neigh)\n\t}\n\n\treturn res, nil\n}\n\nfunc NeighDeserialize(m []byte) (*Neigh, error) {\n\tmsg := deserializeNdmsg(m)\n\n\tneigh := Neigh{\n\t\tLinkIndex: int(msg.Index),\n\t\tFamily: int(msg.Family),\n\t\tState: int(msg.State),\n\t\tType: int(msg.Type),\n\t\tFlags: int(msg.Flags),\n\t}\n\n\tattrs, err := nl.ParseRouteAttr(m[msg.Len():])\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tfor _, attr := range attrs {\n\t\tswitch attr.Attr.Type {\n\t\tcase NDA_DST:\n\t\t\tneigh.IP = net.IP(attr.Value)\n\t\tcase NDA_LLADDR:\n\t\t\t// BUG: Is this a bug in the netlink library?\n\t\t\t// #define RTA_LENGTH(len) (RTA_ALIGN(sizeof(struct rtattr)) + (len))\n\t\t\t// #define RTA_PAYLOAD(rta) ((int)((rta)->rta_len) - RTA_LENGTH(0))\n\t\t\tattrLen := attr.Attr.Len - unix.SizeofRtAttr\n\t\t\tif attrLen == 4 {\n\t\t\t\tneigh.LLIPAddr = net.IP(attr.Value)\n\t\t\t} else if attrLen == 16 {\n\t\t\t\t// Can be IPv6 or FireWire HWAddr\n\t\t\t\tlink, err := LinkByIndex(neigh.LinkIndex)\n\t\t\t\tif err == nil && link.Attrs().EncapType == \"tunnel6\" {\n\t\t\t\t\tneigh.IP = net.IP(attr.Value)\n\t\t\t\t} else {\n\t\t\t\t\tneigh.HardwareAddr = net.HardwareAddr(attr.Value)\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tneigh.HardwareAddr = net.HardwareAddr(attr.Value)\n\t\t\t}\n\t\tcase NDA_VLAN:\n\t\t\tneigh.Vlan = int(native.Uint16(attr.Value[0:2]))\n\t\tcase NDA_VNI:\n\t\t\tneigh.VNI = int(native.Uint32(attr.Value[0:4]))\n\t\tcase NDA_MASTER:\n\t\t\tneigh.MasterIndex = int(native.Uint32(attr.Value[0:4]))\n\t\t}\n\t}\n\n\treturn &neigh, nil\n}\n\n// NeighSubscribe takes a chan down which notifications will be sent\n// when neighbors are added or deleted. Close the 'done' chan to stop subscription.\nfunc NeighSubscribe(ch chan<- NeighUpdate, done <-chan struct{}) error {\n\treturn neighSubscribeAt(netns.None(), netns.None(), ch, done, nil, false)\n}\n\n// NeighSubscribeAt works like NeighSubscribe plus it allows the caller\n// to choose the network namespace in which to subscribe (ns).\nfunc NeighSubscribeAt(ns netns.NsHandle, ch chan<- NeighUpdate, done <-chan struct{}) error {\n\treturn neighSubscribeAt(ns, netns.None(), ch, done, nil, false)\n}\n\n// NeighSubscribeOptions contains a set of options to use with\n// NeighSubscribeWithOptions.\ntype NeighSubscribeOptions struct {\n\tNamespace *netns.NsHandle\n\tErrorCallback func(error)\n\tListExisting bool\n}\n\n// NeighSubscribeWithOptions work like NeighSubscribe but enable to\n// provide additional options to modify the behavior. Currently, the\n// namespace can be provided as well as an error callback.\nfunc NeighSubscribeWithOptions(ch chan<- NeighUpdate, done <-chan struct{}, options NeighSubscribeOptions) error {\n\tif options.Namespace == nil {\n\t\tnone := netns.None()\n\t\toptions.Namespace = &none\n\t}\n\treturn neighSubscribeAt(*options.Namespace, netns.None(), ch, done, options.ErrorCallback, options.ListExisting)\n}\n\nfunc neighSubscribeAt(newNs, curNs netns.NsHandle, ch chan<- NeighUpdate, done <-chan struct{}, cberr func(error), listExisting bool) error {\n\ts, err := nl.SubscribeAt(newNs, curNs, unix.NETLINK_ROUTE, unix.RTNLGRP_NEIGH)\n\tmakeRequest := func(family int) error {\n\t\treq := pkgHandle.newNetlinkRequest(unix.RTM_GETNEIGH,\n\t\t\tunix.NLM_F_DUMP)\n\t\tinfmsg := nl.NewIfInfomsg(family)\n\t\treq.AddData(infmsg)\n\t\tif err := s.Send(req); err != nil {\n\t\t\treturn err\n\t\t}\n\t\treturn nil\n\t}\n\tif err != nil {\n\t\treturn err\n\t}\n\tif done != nil {\n\t\tgo func() {\n\t\t\t<-done\n\t\t\ts.Close()\n\t\t}()\n\t}\n\tif listExisting {\n\t\tif err := makeRequest(unix.AF_UNSPEC); err != nil {\n\t\t\treturn err\n\t\t}\n\t\t// We have to wait for NLMSG_DONE before making AF_BRIDGE request\n\t}\n\tgo func() {\n\t\tdefer close(ch)\n\t\tfor {\n\t\t\tmsgs, from, err := s.Receive()\n\t\t\tif err != nil {\n\t\t\t\tif cberr != nil {\n\t\t\t\t\tcberr(err)\n\t\t\t\t}\n\t\t\t\treturn\n\t\t\t}\n\t\t\tif from.Pid != nl.PidKernel {\n\t\t\t\tif cberr != nil {\n\t\t\t\t\tcberr(fmt.Errorf(\"Wrong sender portid %d, expected %d\", from.Pid, nl.PidKernel))\n\t\t\t\t}\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tfor _, m := range msgs {\n\t\t\t\tif m.Header.Type == unix.NLMSG_DONE {\n\t\t\t\t\tif listExisting {\n\t\t\t\t\t\t// This will be called after handling AF_UNSPEC\n\t\t\t\t\t\t// list request, we have to wait for NLMSG_DONE\n\t\t\t\t\t\t// before making another request\n\t\t\t\t\t\tif err := makeRequest(unix.AF_BRIDGE); err != nil {\n\t\t\t\t\t\t\tif cberr != nil {\n\t\t\t\t\t\t\t\tcberr(err)\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\treturn\n\t\t\t\t\t\t}\n\t\t\t\t\t\tlistExisting = false\n\t\t\t\t\t}\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tif m.Header.Type == unix.NLMSG_ERROR {\n\t\t\t\t\terror := int32(native.Uint32(m.Data[0:4]))\n\t\t\t\t\tif error == 0 {\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\t\t\t\t\tif cberr != nil {\n\t\t\t\t\t\tcberr(syscall.Errno(-error))\n\t\t\t\t\t}\n\t\t\t\t\treturn\n\t\t\t\t}\n\t\t\t\tneigh, err := NeighDeserialize(m.Data)\n\t\t\t\tif err != nil {\n\t\t\t\t\tif cberr != nil {\n\t\t\t\t\t\tcberr(err)\n\t\t\t\t\t}\n\t\t\t\t\treturn\n\t\t\t\t}\n\t\t\t\tch <- NeighUpdate{Type: m.Header.Type, Neigh: *neigh}\n\t\t\t}\n\t\t}\n\t}()\n\n\treturn nil\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/netlink.go", "content": "// Package netlink provides a simple library for netlink. Netlink is\n// the interface a user-space program in linux uses to communicate with\n// the kernel. It can be used to add and remove interfaces, set up ip\n// addresses and routes, and confiugre ipsec. Netlink communication\n// requires elevated privileges, so in most cases this code needs to\n// be run as root. The low level primitives for netlink are contained\n// in the nl subpackage. This package attempts to provide a high-level\n// interface that is loosly modeled on the iproute2 cli.\npackage netlink\n\nimport (\n\t\"errors\"\n\t\"net\"\n)\n\nvar (\n\t// ErrNotImplemented is returned when a requested feature is not implemented.\n\tErrNotImplemented = errors.New(\"not implemented\")\n)\n\n// ParseIPNet parses a string in ip/net format and returns a net.IPNet.\n// This is valuable because addresses in netlink are often IPNets and\n// ParseCIDR returns an IPNet with the IP part set to the base IP of the\n// range.\nfunc ParseIPNet(s string) (*net.IPNet, error) {\n\tip, ipNet, err := net.ParseCIDR(s)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tipNet.IP = ip\n\treturn ipNet, nil\n}\n\n// NewIPNet generates an IPNet from an ip address using a netmask of 32 or 128.\nfunc NewIPNet(ip net.IP) *net.IPNet {\n\tif ip.To4() != nil {\n\t\treturn &net.IPNet{IP: ip, Mask: net.CIDRMask(32, 32)}\n\t}\n\treturn &net.IPNet{IP: ip, Mask: net.CIDRMask(128, 128)}\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/netlink_linux.go", "content": "package netlink\n\nimport \"github.com/vishvananda/netlink/nl\"\n\n// Family type definitions\nconst (\n\tFAMILY_ALL = nl.FAMILY_ALL\n\tFAMILY_V4 = nl.FAMILY_V4\n\tFAMILY_V6 = nl.FAMILY_V6\n\tFAMILY_MPLS = nl.FAMILY_MPLS\n)\n" }, { "path": "vendor/github.com/vishvananda/netlink/netlink_unspecified.go", "content": "// +build !linux\n\npackage netlink\n\nimport \"net\"\n\nfunc LinkSetUp(link Link) error {\n\treturn ErrNotImplemented\n}\n\nfunc LinkSetDown(link Link) error {\n\treturn ErrNotImplemented\n}\n\nfunc LinkSetMTU(link Link, mtu int) error {\n\treturn ErrNotImplemented\n}\n\nfunc LinkSetMaster(link Link, master Link) error {\n\treturn ErrNotImplemented\n}\n\nfunc LinkSetNsPid(link Link, nspid int) error {\n\treturn ErrNotImplemented\n}\n\nfunc LinkSetNsFd(link Link, fd int) error {\n\treturn ErrNotImplemented\n}\n\nfunc LinkSetName(link Link, name string) error {\n\treturn ErrNotImplemented\n}\n\nfunc LinkSetAlias(link Link, name string) error {\n\treturn ErrNotImplemented\n}\n\nfunc LinkSetHardwareAddr(link Link, hwaddr net.HardwareAddr) error {\n\treturn ErrNotImplemented\n}\n\nfunc LinkSetVfHardwareAddr(link Link, vf int, hwaddr net.HardwareAddr) error {\n\treturn ErrNotImplemented\n}\n\nfunc LinkSetVfVlan(link Link, vf, vlan int) error {\n\treturn ErrNotImplemented\n}\n\nfunc LinkSetVfVlanQos(link Link, vf, vlan, qos int) error {\n\treturn ErrNotImplemented\n}\n\nfunc LinkSetVfTxRate(link Link, vf, rate int) error {\n\treturn ErrNotImplemented\n}\n\nfunc LinkSetVfRate(link Link, vf, minRate, maxRate int) error {\n\treturn ErrNotImplemented\n}\n\nfunc LinkSetNoMaster(link Link) error {\n\treturn ErrNotImplemented\n}\n\nfunc LinkSetMasterByIndex(link Link, masterIndex int) error {\n\treturn ErrNotImplemented\n}\n\nfunc LinkSetXdpFd(link Link, fd int) error {\n\treturn ErrNotImplemented\n}\n\nfunc LinkSetXdpFdWithFlags(link Link, fd, flags int) error {\n\treturn ErrNotImplemented\n}\n\nfunc LinkSetARPOff(link Link) error {\n\treturn ErrNotImplemented\n}\n\nfunc LinkSetARPOn(link Link) error {\n\treturn ErrNotImplemented\n}\n\nfunc LinkByName(name string) (Link, error) {\n\treturn nil, ErrNotImplemented\n}\n\nfunc LinkByAlias(alias string) (Link, error) {\n\treturn nil, ErrNotImplemented\n}\n\nfunc LinkByIndex(index int) (Link, error) {\n\treturn nil, ErrNotImplemented\n}\n\nfunc LinkSetHairpin(link Link, mode bool) error {\n\treturn ErrNotImplemented\n}\n\nfunc LinkSetGuard(link Link, mode bool) error {\n\treturn ErrNotImplemented\n}\n\nfunc LinkSetFastLeave(link Link, mode bool) error {\n\treturn ErrNotImplemented\n}\n\nfunc LinkSetLearning(link Link, mode bool) error {\n\treturn ErrNotImplemented\n}\n\nfunc LinkSetRootBlock(link Link, mode bool) error {\n\treturn ErrNotImplemented\n}\n\nfunc LinkSetFlood(link Link, mode bool) error {\n\treturn ErrNotImplemented\n}\n\nfunc LinkSetTxQLen(link Link, qlen int) error {\n\treturn ErrNotImplemented\n}\n\nfunc LinkAdd(link Link) error {\n\treturn ErrNotImplemented\n}\n\nfunc LinkDel(link Link) error {\n\treturn ErrNotImplemented\n}\n\nfunc SetHairpin(link Link, mode bool) error {\n\treturn ErrNotImplemented\n}\n\nfunc SetGuard(link Link, mode bool) error {\n\treturn ErrNotImplemented\n}\n\nfunc SetFastLeave(link Link, mode bool) error {\n\treturn ErrNotImplemented\n}\n\nfunc SetLearning(link Link, mode bool) error {\n\treturn ErrNotImplemented\n}\n\nfunc SetRootBlock(link Link, mode bool) error {\n\treturn ErrNotImplemented\n}\n\nfunc SetFlood(link Link, mode bool) error {\n\treturn ErrNotImplemented\n}\n\nfunc LinkList() ([]Link, error) {\n\treturn nil, ErrNotImplemented\n}\n\nfunc AddrAdd(link Link, addr *Addr) error {\n\treturn ErrNotImplemented\n}\n\nfunc AddrReplace(link Link, addr *Addr) error {\n\treturn ErrNotImplemented\n}\n\nfunc AddrDel(link Link, addr *Addr) error {\n\treturn ErrNotImplemented\n}\n\nfunc AddrList(link Link, family int) ([]Addr, error) {\n\treturn nil, ErrNotImplemented\n}\n\nfunc RouteAdd(route *Route) error {\n\treturn ErrNotImplemented\n}\n\nfunc RouteDel(route *Route) error {\n\treturn ErrNotImplemented\n}\n\nfunc RouteList(link Link, family int) ([]Route, error) {\n\treturn nil, ErrNotImplemented\n}\n\nfunc XfrmPolicyAdd(policy *XfrmPolicy) error {\n\treturn ErrNotImplemented\n}\n\nfunc XfrmPolicyDel(policy *XfrmPolicy) error {\n\treturn ErrNotImplemented\n}\n\nfunc XfrmPolicyList(family int) ([]XfrmPolicy, error) {\n\treturn nil, ErrNotImplemented\n}\n\nfunc XfrmStateAdd(policy *XfrmState) error {\n\treturn ErrNotImplemented\n}\n\nfunc XfrmStateDel(policy *XfrmState) error {\n\treturn ErrNotImplemented\n}\n\nfunc XfrmStateList(family int) ([]XfrmState, error) {\n\treturn nil, ErrNotImplemented\n}\n\nfunc NeighAdd(neigh *Neigh) error {\n\treturn ErrNotImplemented\n}\n\nfunc NeighSet(neigh *Neigh) error {\n\treturn ErrNotImplemented\n}\n\nfunc NeighAppend(neigh *Neigh) error {\n\treturn ErrNotImplemented\n}\n\nfunc NeighDel(neigh *Neigh) error {\n\treturn ErrNotImplemented\n}\n\nfunc NeighList(linkIndex, family int) ([]Neigh, error) {\n\treturn nil, ErrNotImplemented\n}\n\nfunc NeighDeserialize(m []byte) (*Neigh, error) {\n\treturn nil, ErrNotImplemented\n}\n\nfunc SocketGet(local, remote net.Addr) (*Socket, error) {\n\treturn nil, ErrNotImplemented\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/netns_linux.go", "content": "package netlink\n\n// Network namespace ID functions\n//\n// The kernel has a weird concept called the network namespace ID.\n// This is different from the file reference in proc (and any bind-mounted\n// namespaces, etc.)\n//\n// Instead, namespaces can be assigned a numeric ID at any time. Once set,\n// the ID is fixed. The ID can either be set manually by the user, or\n// automatically, triggered by certain kernel actions. The most common kernel\n// action that triggers namespace ID creation is moving one end of a veth pair\n// in to that namespace.\n\nimport (\n\t\"fmt\"\n\n\t\"github.com/vishvananda/netlink/nl\"\n\t\"golang.org/x/sys/unix\"\n)\n\n// These can be replaced by the values from sys/unix when it is next released.\nconst (\n\t_ = iota\n\tNETNSA_NSID\n\tNETNSA_PID\n\tNETNSA_FD\n)\n\n// GetNetNsIdByPid looks up the network namespace ID for a given pid (really thread id).\n// Returns -1 if the namespace does not have an ID set.\nfunc (h *Handle) GetNetNsIdByPid(pid int) (int, error) {\n\treturn h.getNetNsId(NETNSA_PID, uint32(pid))\n}\n\n// GetNetNsIdByPid looks up the network namespace ID for a given pid (really thread id).\n// Returns -1 if the namespace does not have an ID set.\nfunc GetNetNsIdByPid(pid int) (int, error) {\n\treturn pkgHandle.GetNetNsIdByPid(pid)\n}\n\n// SetNetNSIdByPid sets the ID of the network namespace for a given pid (really thread id).\n// The ID can only be set for namespaces without an ID already set.\nfunc (h *Handle) SetNetNsIdByPid(pid, nsid int) error {\n\treturn h.setNetNsId(NETNSA_PID, uint32(pid), uint32(nsid))\n}\n\n// SetNetNSIdByPid sets the ID of the network namespace for a given pid (really thread id).\n// The ID can only be set for namespaces without an ID already set.\nfunc SetNetNsIdByPid(pid, nsid int) error {\n\treturn pkgHandle.SetNetNsIdByPid(pid, nsid)\n}\n\n// GetNetNsIdByFd looks up the network namespace ID for a given fd.\n// fd must be an open file descriptor to a namespace file.\n// Returns -1 if the namespace does not have an ID set.\nfunc (h *Handle) GetNetNsIdByFd(fd int) (int, error) {\n\treturn h.getNetNsId(NETNSA_FD, uint32(fd))\n}\n\n// GetNetNsIdByFd looks up the network namespace ID for a given fd.\n// fd must be an open file descriptor to a namespace file.\n// Returns -1 if the namespace does not have an ID set.\nfunc GetNetNsIdByFd(fd int) (int, error) {\n\treturn pkgHandle.GetNetNsIdByFd(fd)\n}\n\n// SetNetNSIdByFd sets the ID of the network namespace for a given fd.\n// fd must be an open file descriptor to a namespace file.\n// The ID can only be set for namespaces without an ID already set.\nfunc (h *Handle) SetNetNsIdByFd(fd, nsid int) error {\n\treturn h.setNetNsId(NETNSA_FD, uint32(fd), uint32(nsid))\n}\n\n// SetNetNSIdByFd sets the ID of the network namespace for a given fd.\n// fd must be an open file descriptor to a namespace file.\n// The ID can only be set for namespaces without an ID already set.\nfunc SetNetNsIdByFd(fd, nsid int) error {\n\treturn pkgHandle.SetNetNsIdByFd(fd, nsid)\n}\n\n// getNetNsId requests the netnsid for a given type-val pair\n// type should be either NETNSA_PID or NETNSA_FD\nfunc (h *Handle) getNetNsId(attrType int, val uint32) (int, error) {\n\treq := h.newNetlinkRequest(unix.RTM_GETNSID, unix.NLM_F_REQUEST)\n\n\trtgen := nl.NewRtGenMsg()\n\treq.AddData(rtgen)\n\n\tb := make([]byte, 4, 4)\n\tnative.PutUint32(b, val)\n\tattr := nl.NewRtAttr(attrType, b)\n\treq.AddData(attr)\n\n\tmsgs, err := req.Execute(unix.NETLINK_ROUTE, unix.RTM_NEWNSID)\n\n\tif err != nil {\n\t\treturn 0, err\n\t}\n\n\tfor _, m := range msgs {\n\t\tmsg := nl.DeserializeRtGenMsg(m)\n\n\t\tattrs, err := nl.ParseRouteAttr(m[msg.Len():])\n\t\tif err != nil {\n\t\t\treturn 0, err\n\t\t}\n\n\t\tfor _, attr := range attrs {\n\t\t\tswitch attr.Attr.Type {\n\t\t\tcase NETNSA_NSID:\n\t\t\t\treturn int(int32(native.Uint32(attr.Value))), nil\n\t\t\t}\n\t\t}\n\t}\n\n\treturn 0, fmt.Errorf(\"unexpected empty result\")\n}\n\n// setNetNsId sets the netnsid for a given type-val pair\n// type should be either NETNSA_PID or NETNSA_FD\n// The ID can only be set for namespaces without an ID already set\nfunc (h *Handle) setNetNsId(attrType int, val uint32, newnsid uint32) error {\n\treq := h.newNetlinkRequest(unix.RTM_NEWNSID, unix.NLM_F_REQUEST|unix.NLM_F_ACK)\n\n\trtgen := nl.NewRtGenMsg()\n\treq.AddData(rtgen)\n\n\tb := make([]byte, 4, 4)\n\tnative.PutUint32(b, val)\n\tattr := nl.NewRtAttr(attrType, b)\n\treq.AddData(attr)\n\n\tb1 := make([]byte, 4, 4)\n\tnative.PutUint32(b1, newnsid)\n\tattr1 := nl.NewRtAttr(NETNSA_NSID, b1)\n\treq.AddData(attr1)\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, unix.RTM_NEWNSID)\n\treturn err\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/netns_unspecified.go", "content": "// +build !linux\n\npackage netlink\n\nfunc GetNetNsIdByPid(pid int) (int, error) {\n\treturn 0, ErrNotImplemented\n}\n\nfunc SetNetNsIdByPid(pid, nsid int) error {\n\treturn ErrNotImplemented\n}\n\nfunc GetNetNsIdByFd(fd int) (int, error) {\n\treturn 0, ErrNotImplemented\n}\n\nfunc SetNetNsIdByFd(fd, nsid int) error {\n\treturn ErrNotImplemented\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/nl/addr_linux.go", "content": "package nl\n\nimport (\n\t\"unsafe\"\n\n\t\"golang.org/x/sys/unix\"\n)\n\ntype IfAddrmsg struct {\n\tunix.IfAddrmsg\n}\n\nfunc NewIfAddrmsg(family int) *IfAddrmsg {\n\treturn &IfAddrmsg{\n\t\tIfAddrmsg: unix.IfAddrmsg{\n\t\t\tFamily: uint8(family),\n\t\t},\n\t}\n}\n\n// struct ifaddrmsg {\n// __u8 ifa_family;\n// __u8 ifa_prefixlen; /* The prefix length */\n// __u8 ifa_flags; /* Flags */\n// __u8 ifa_scope; /* Address scope */\n// __u32 ifa_index; /* Link index */\n// };\n\n// type IfAddrmsg struct {\n// \tFamily uint8\n// \tPrefixlen uint8\n// \tFlags uint8\n// \tScope uint8\n// \tIndex uint32\n// }\n// SizeofIfAddrmsg = 0x8\n\nfunc DeserializeIfAddrmsg(b []byte) *IfAddrmsg {\n\treturn (*IfAddrmsg)(unsafe.Pointer(&b[0:unix.SizeofIfAddrmsg][0]))\n}\n\nfunc (msg *IfAddrmsg) Serialize() []byte {\n\treturn (*(*[unix.SizeofIfAddrmsg]byte)(unsafe.Pointer(msg)))[:]\n}\n\nfunc (msg *IfAddrmsg) Len() int {\n\treturn unix.SizeofIfAddrmsg\n}\n\n// struct ifa_cacheinfo {\n// \t__u32\tifa_prefered;\n// \t__u32\tifa_valid;\n// \t__u32\tcstamp; /* created timestamp, hundredths of seconds */\n// \t__u32\ttstamp; /* updated timestamp, hundredths of seconds */\n// };\n\ntype IfaCacheInfo struct {\n\tunix.IfaCacheinfo\n}\n\nfunc (msg *IfaCacheInfo) Len() int {\n\treturn unix.SizeofIfaCacheinfo\n}\n\nfunc DeserializeIfaCacheInfo(b []byte) *IfaCacheInfo {\n\treturn (*IfaCacheInfo)(unsafe.Pointer(&b[0:unix.SizeofIfaCacheinfo][0]))\n}\n\nfunc (msg *IfaCacheInfo) Serialize() []byte {\n\treturn (*(*[unix.SizeofIfaCacheinfo]byte)(unsafe.Pointer(msg)))[:]\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/nl/bridge_linux.go", "content": "package nl\n\nimport (\n\t\"fmt\"\n\t\"unsafe\"\n)\n\nconst (\n\tSizeofBridgeVlanInfo = 0x04\n)\n\n/* Bridge Flags */\nconst (\n\tBRIDGE_FLAGS_MASTER = iota + 1 /* Bridge command to/from master */\n\tBRIDGE_FLAGS_SELF /* Bridge command to/from lowerdev */\n)\n\n/* Bridge management nested attributes\n * [IFLA_AF_SPEC] = {\n * [IFLA_BRIDGE_FLAGS]\n * [IFLA_BRIDGE_MODE]\n * [IFLA_BRIDGE_VLAN_INFO]\n * }\n */\nconst (\n\tIFLA_BRIDGE_FLAGS = iota\n\tIFLA_BRIDGE_MODE\n\tIFLA_BRIDGE_VLAN_INFO\n)\n\nconst (\n\tBRIDGE_VLAN_INFO_MASTER = 1 << iota\n\tBRIDGE_VLAN_INFO_PVID\n\tBRIDGE_VLAN_INFO_UNTAGGED\n\tBRIDGE_VLAN_INFO_RANGE_BEGIN\n\tBRIDGE_VLAN_INFO_RANGE_END\n)\n\n// struct bridge_vlan_info {\n// __u16 flags;\n// __u16 vid;\n// };\n\ntype BridgeVlanInfo struct {\n\tFlags uint16\n\tVid uint16\n}\n\nfunc (b *BridgeVlanInfo) Serialize() []byte {\n\treturn (*(*[SizeofBridgeVlanInfo]byte)(unsafe.Pointer(b)))[:]\n}\n\nfunc DeserializeBridgeVlanInfo(b []byte) *BridgeVlanInfo {\n\treturn (*BridgeVlanInfo)(unsafe.Pointer(&b[0:SizeofBridgeVlanInfo][0]))\n}\n\nfunc (b *BridgeVlanInfo) PortVID() bool {\n\treturn b.Flags&BRIDGE_VLAN_INFO_PVID > 0\n}\n\nfunc (b *BridgeVlanInfo) EngressUntag() bool {\n\treturn b.Flags&BRIDGE_VLAN_INFO_UNTAGGED > 0\n}\n\nfunc (b *BridgeVlanInfo) String() string {\n\treturn fmt.Sprintf(\"%+v\", *b)\n}\n\n/* New extended info filters for IFLA_EXT_MASK */\nconst (\n\tRTEXT_FILTER_VF = 1 << iota\n\tRTEXT_FILTER_BRVLAN\n\tRTEXT_FILTER_BRVLAN_COMPRESSED\n)\n" }, { "path": "vendor/github.com/vishvananda/netlink/nl/conntrack_linux.go", "content": "package nl\n\nimport \"unsafe\"\n\n// Track the message sizes for the correct serialization/deserialization\nconst (\n\tSizeofNfgenmsg = 4\n\tSizeofNfattr = 4\n\tSizeofNfConntrack = 376\n\tSizeofNfctTupleHead = 52\n)\n\nvar L4ProtoMap = map[uint8]string{\n\t6: \"tcp\",\n\t17: \"udp\",\n}\n\n// All the following constants are coming from:\n// https://github.com/torvalds/linux/blob/master/include/uapi/linux/netfilter/nfnetlink_conntrack.h\n\n// enum cntl_msg_types {\n// \tIPCTNL_MSG_CT_NEW,\n// \tIPCTNL_MSG_CT_GET,\n// \tIPCTNL_MSG_CT_DELETE,\n// \tIPCTNL_MSG_CT_GET_CTRZERO,\n// \tIPCTNL_MSG_CT_GET_STATS_CPU,\n// \tIPCTNL_MSG_CT_GET_STATS,\n// \tIPCTNL_MSG_CT_GET_DYING,\n// \tIPCTNL_MSG_CT_GET_UNCONFIRMED,\n//\n// \tIPCTNL_MSG_MAX\n// };\nconst (\n\tIPCTNL_MSG_CT_GET = 1\n\tIPCTNL_MSG_CT_DELETE = 2\n)\n\n// #define NFNETLINK_V0\t0\nconst (\n\tNFNETLINK_V0 = 0\n)\n\nconst (\n\tNLA_F_NESTED uint16 = (1 << 15) // #define NLA_F_NESTED (1 << 15)\n\tNLA_F_NET_BYTEORDER uint16 = (1 << 14) // #define NLA_F_NESTED (1 << 14)\n\tNLA_TYPE_MASK = ^(NLA_F_NESTED | NLA_F_NET_BYTEORDER)\n)\n\n// enum ctattr_type {\n// \tCTA_UNSPEC,\n// \tCTA_TUPLE_ORIG,\n// \tCTA_TUPLE_REPLY,\n// \tCTA_STATUS,\n// \tCTA_PROTOINFO,\n// \tCTA_HELP,\n// \tCTA_NAT_SRC,\n// #define CTA_NAT\tCTA_NAT_SRC\t/* backwards compatibility */\n// \tCTA_TIMEOUT,\n// \tCTA_MARK,\n// \tCTA_COUNTERS_ORIG,\n// \tCTA_COUNTERS_REPLY,\n// \tCTA_USE,\n// \tCTA_ID,\n// \tCTA_NAT_DST,\n// \tCTA_TUPLE_MASTER,\n// \tCTA_SEQ_ADJ_ORIG,\n// \tCTA_NAT_SEQ_ADJ_ORIG\t= CTA_SEQ_ADJ_ORIG,\n// \tCTA_SEQ_ADJ_REPLY,\n// \tCTA_NAT_SEQ_ADJ_REPLY\t= CTA_SEQ_ADJ_REPLY,\n// \tCTA_SECMARK,\t\t/* obsolete */\n// \tCTA_ZONE,\n// \tCTA_SECCTX,\n// \tCTA_TIMESTAMP,\n// \tCTA_MARK_MASK,\n// \tCTA_LABELS,\n// \tCTA_LABELS_MASK,\n// \t__CTA_MAX\n// };\nconst (\n\tCTA_TUPLE_ORIG = 1\n\tCTA_TUPLE_REPLY = 2\n\tCTA_STATUS = 3\n\tCTA_PROTOINFO = 4\n\tCTA_TIMEOUT = 7\n\tCTA_MARK = 8\n\tCTA_COUNTERS_ORIG = 9\n\tCTA_COUNTERS_REPLY = 10\n\tCTA_USE = 11\n\tCTA_ID = 12\n\tCTA_TIMESTAMP = 20\n)\n\n// enum ctattr_tuple {\n// \tCTA_TUPLE_UNSPEC,\n// \tCTA_TUPLE_IP,\n// \tCTA_TUPLE_PROTO,\n// \tCTA_TUPLE_ZONE,\n// \t__CTA_TUPLE_MAX\n// };\n// #define CTA_TUPLE_MAX (__CTA_TUPLE_MAX - 1)\nconst (\n\tCTA_TUPLE_IP = 1\n\tCTA_TUPLE_PROTO = 2\n)\n\n// enum ctattr_ip {\n// \tCTA_IP_UNSPEC,\n// \tCTA_IP_V4_SRC,\n// \tCTA_IP_V4_DST,\n// \tCTA_IP_V6_SRC,\n// \tCTA_IP_V6_DST,\n// \t__CTA_IP_MAX\n// };\n// #define CTA_IP_MAX (__CTA_IP_MAX - 1)\nconst (\n\tCTA_IP_V4_SRC = 1\n\tCTA_IP_V4_DST = 2\n\tCTA_IP_V6_SRC = 3\n\tCTA_IP_V6_DST = 4\n)\n\n// enum ctattr_l4proto {\n// \tCTA_PROTO_UNSPEC,\n// \tCTA_PROTO_NUM,\n// \tCTA_PROTO_SRC_PORT,\n// \tCTA_PROTO_DST_PORT,\n// \tCTA_PROTO_ICMP_ID,\n// \tCTA_PROTO_ICMP_TYPE,\n// \tCTA_PROTO_ICMP_CODE,\n// \tCTA_PROTO_ICMPV6_ID,\n// \tCTA_PROTO_ICMPV6_TYPE,\n// \tCTA_PROTO_ICMPV6_CODE,\n// \t__CTA_PROTO_MAX\n// };\n// #define CTA_PROTO_MAX (__CTA_PROTO_MAX - 1)\nconst (\n\tCTA_PROTO_NUM = 1\n\tCTA_PROTO_SRC_PORT = 2\n\tCTA_PROTO_DST_PORT = 3\n)\n\n// enum ctattr_protoinfo {\n// \tCTA_PROTOINFO_UNSPEC,\n// \tCTA_PROTOINFO_TCP,\n// \tCTA_PROTOINFO_DCCP,\n// \tCTA_PROTOINFO_SCTP,\n// \t__CTA_PROTOINFO_MAX\n// };\n// #define CTA_PROTOINFO_MAX (__CTA_PROTOINFO_MAX - 1)\nconst (\n\tCTA_PROTOINFO_TCP = 1\n)\n\n// enum ctattr_protoinfo_tcp {\n// \tCTA_PROTOINFO_TCP_UNSPEC,\n// \tCTA_PROTOINFO_TCP_STATE,\n// \tCTA_PROTOINFO_TCP_WSCALE_ORIGINAL,\n// \tCTA_PROTOINFO_TCP_WSCALE_REPLY,\n// \tCTA_PROTOINFO_TCP_FLAGS_ORIGINAL,\n// \tCTA_PROTOINFO_TCP_FLAGS_REPLY,\n// \t__CTA_PROTOINFO_TCP_MAX\n// };\n// #define CTA_PROTOINFO_TCP_MAX (__CTA_PROTOINFO_TCP_MAX - 1)\nconst (\n\tCTA_PROTOINFO_TCP_STATE = 1\n\tCTA_PROTOINFO_TCP_WSCALE_ORIGINAL = 2\n\tCTA_PROTOINFO_TCP_WSCALE_REPLY = 3\n\tCTA_PROTOINFO_TCP_FLAGS_ORIGINAL = 4\n\tCTA_PROTOINFO_TCP_FLAGS_REPLY = 5\n)\n\n// enum ctattr_counters {\n// \tCTA_COUNTERS_UNSPEC,\n// \tCTA_COUNTERS_PACKETS,\t\t/* 64bit counters */\n// \tCTA_COUNTERS_BYTES,\t\t/* 64bit counters */\n// \tCTA_COUNTERS32_PACKETS,\t\t/* old 32bit counters, unused */\n// \tCTA_COUNTERS32_BYTES,\t\t/* old 32bit counters, unused */\n// \tCTA_COUNTERS_PAD,\n// \t__CTA_COUNTERS_M\n// };\n// #define CTA_COUNTERS_MAX (__CTA_COUNTERS_MAX - 1)\nconst (\n\tCTA_COUNTERS_PACKETS = 1\n\tCTA_COUNTERS_BYTES = 2\n)\n\n// enum CTA TIMESTAMP TLVs\n// CTA_TIMESTAMP_START /* 64bit value */\n// CTA_TIMESTAMP_STOP /* 64bit value */\nconst (\n\tCTA_TIMESTAMP_START = 1\n\tCTA_TIMESTAMP_STOP = 2\n)\n\n// /* General form of address family dependent message.\n// */\n// struct nfgenmsg {\n// \t__u8 nfgen_family;\t\t/* AF_xxx */\n// \t__u8 version;\t\t/* nfnetlink version */\n// \t__be16 res_id;\t\t/* resource id */\n// };\ntype Nfgenmsg struct {\n\tNfgenFamily uint8\n\tVersion uint8\n\tResId uint16 // big endian\n}\n\nfunc (msg *Nfgenmsg) Len() int {\n\treturn SizeofNfgenmsg\n}\n\nfunc DeserializeNfgenmsg(b []byte) *Nfgenmsg {\n\treturn (*Nfgenmsg)(unsafe.Pointer(&b[0:SizeofNfgenmsg][0]))\n}\n\nfunc (msg *Nfgenmsg) Serialize() []byte {\n\treturn (*(*[SizeofNfgenmsg]byte)(unsafe.Pointer(msg)))[:]\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/nl/devlink_linux.go", "content": "package nl\n\n// All the following constants are coming from:\n// https://github.com/torvalds/linux/blob/master/include/uapi/linux/devlink.h\n\nconst (\n\tGENL_DEVLINK_VERSION = 1\n\tGENL_DEVLINK_NAME = \"devlink\"\n)\n\nconst (\n\tDEVLINK_CMD_GET = 1\n\tDEVLINK_CMD_PORT_GET = 5\n\tDEVLINK_CMD_PORT_SET = 6\n\tDEVLINK_CMD_PORT_NEW = 7\n\tDEVLINK_CMD_PORT_DEL = 8\n\tDEVLINK_CMD_ESWITCH_GET = 29\n\tDEVLINK_CMD_ESWITCH_SET = 30\n)\n\nconst (\n\tDEVLINK_ATTR_BUS_NAME = 1\n\tDEVLINK_ATTR_DEV_NAME = 2\n\tDEVLINK_ATTR_PORT_INDEX = 3\n\tDEVLINK_ATTR_PORT_TYPE = 4\n\tDEVLINK_ATTR_PORT_NETDEV_IFINDEX = 6\n\tDEVLINK_ATTR_PORT_NETDEV_NAME = 7\n\tDEVLINK_ATTR_PORT_IBDEV_NAME = 8\n\tDEVLINK_ATTR_ESWITCH_MODE = 25\n\tDEVLINK_ATTR_ESWITCH_INLINE_MODE = 26\n\tDEVLINK_ATTR_ESWITCH_ENCAP_MODE = 62\n\tDEVLINK_ATTR_PORT_FLAVOUR = 77\n\tDEVLINK_ATTR_PORT_PCI_PF_NUMBER = 127\n\tDEVLINK_ATTR_PORT_FUNCTION = 145\n\tDEVLINK_ATTR_PORT_CONTROLLER_NUMBER = 150\n\tDEVLINK_ATTR_PORT_PCI_SF_NUMBER = 164\n)\n\nconst (\n\tDEVLINK_ESWITCH_MODE_LEGACY = 0\n\tDEVLINK_ESWITCH_MODE_SWITCHDEV = 1\n)\n\nconst (\n\tDEVLINK_ESWITCH_INLINE_MODE_NONE = 0\n\tDEVLINK_ESWITCH_INLINE_MODE_LINK = 1\n\tDEVLINK_ESWITCH_INLINE_MODE_NETWORK = 2\n\tDEVLINK_ESWITCH_INLINE_MODE_TRANSPORT = 3\n)\n\nconst (\n\tDEVLINK_ESWITCH_ENCAP_MODE_NONE = 0\n\tDEVLINK_ESWITCH_ENCAP_MODE_BASIC = 1\n)\n\nconst (\n\tDEVLINK_PORT_FLAVOUR_PHYSICAL = 0\n\tDEVLINK_PORT_FLAVOUR_CPU = 1\n\tDEVLINK_PORT_FLAVOUR_DSA = 2\n\tDEVLINK_PORT_FLAVOUR_PCI_PF = 3\n\tDEVLINK_PORT_FLAVOUR_PCI_VF = 4\n\tDEVLINK_PORT_FLAVOUR_VIRTUAL = 5\n\tDEVLINK_PORT_FLAVOUR_UNUSED = 6\n\tDEVLINK_PORT_FLAVOUR_PCI_SF = 7\n)\n\nconst (\n\tDEVLINK_PORT_TYPE_NOTSET = 0\n\tDEVLINK_PORT_TYPE_AUTO = 1\n\tDEVLINK_PORT_TYPE_ETH = 2\n\tDEVLINK_PORT_TYPE_IB = 3\n)\n\nconst (\n\tDEVLINK_PORT_FUNCTION_ATTR_HW_ADDR = 1\n\tDEVLINK_PORT_FN_ATTR_STATE = 2\n\tDEVLINK_PORT_FN_ATTR_OPSTATE = 3\n)\n\nconst (\n\tDEVLINK_PORT_FN_STATE_INACTIVE = 0\n\tDEVLINK_PORT_FN_STATE_ACTIVE = 1\n)\n\nconst (\n\tDEVLINK_PORT_FN_OPSTATE_DETACHED = 0\n\tDEVLINK_PORT_FN_OPSTATE_ATTACHED = 1\n)\n" }, { "path": "vendor/github.com/vishvananda/netlink/nl/genetlink_linux.go", "content": "package nl\n\nimport (\n\t\"unsafe\"\n)\n\nconst SizeofGenlmsg = 4\n\nconst (\n\tGENL_ID_CTRL = 0x10\n\tGENL_CTRL_VERSION = 2\n\tGENL_CTRL_NAME = \"nlctrl\"\n)\n\nconst (\n\tGENL_CTRL_CMD_GETFAMILY = 3\n)\n\nconst (\n\tGENL_CTRL_ATTR_UNSPEC = iota\n\tGENL_CTRL_ATTR_FAMILY_ID\n\tGENL_CTRL_ATTR_FAMILY_NAME\n\tGENL_CTRL_ATTR_VERSION\n\tGENL_CTRL_ATTR_HDRSIZE\n\tGENL_CTRL_ATTR_MAXATTR\n\tGENL_CTRL_ATTR_OPS\n\tGENL_CTRL_ATTR_MCAST_GROUPS\n)\n\nconst (\n\tGENL_CTRL_ATTR_OP_UNSPEC = iota\n\tGENL_CTRL_ATTR_OP_ID\n\tGENL_CTRL_ATTR_OP_FLAGS\n)\n\nconst (\n\tGENL_ADMIN_PERM = 1 << iota\n\tGENL_CMD_CAP_DO\n\tGENL_CMD_CAP_DUMP\n\tGENL_CMD_CAP_HASPOL\n)\n\nconst (\n\tGENL_CTRL_ATTR_MCAST_GRP_UNSPEC = iota\n\tGENL_CTRL_ATTR_MCAST_GRP_NAME\n\tGENL_CTRL_ATTR_MCAST_GRP_ID\n)\n\nconst (\n\tGENL_GTP_VERSION = 0\n\tGENL_GTP_NAME = \"gtp\"\n)\n\nconst (\n\tGENL_GTP_CMD_NEWPDP = iota\n\tGENL_GTP_CMD_DELPDP\n\tGENL_GTP_CMD_GETPDP\n)\n\nconst (\n\tGENL_GTP_ATTR_UNSPEC = iota\n\tGENL_GTP_ATTR_LINK\n\tGENL_GTP_ATTR_VERSION\n\tGENL_GTP_ATTR_TID\n\tGENL_GTP_ATTR_PEER_ADDRESS\n\tGENL_GTP_ATTR_MS_ADDRESS\n\tGENL_GTP_ATTR_FLOW\n\tGENL_GTP_ATTR_NET_NS_FD\n\tGENL_GTP_ATTR_I_TEI\n\tGENL_GTP_ATTR_O_TEI\n\tGENL_GTP_ATTR_PAD\n)\n\ntype Genlmsg struct {\n\tCommand uint8\n\tVersion uint8\n}\n\nfunc (msg *Genlmsg) Len() int {\n\treturn SizeofGenlmsg\n}\n\nfunc DeserializeGenlmsg(b []byte) *Genlmsg {\n\treturn (*Genlmsg)(unsafe.Pointer(&b[0:SizeofGenlmsg][0]))\n}\n\nfunc (msg *Genlmsg) Serialize() []byte {\n\treturn (*(*[SizeofGenlmsg]byte)(unsafe.Pointer(msg)))[:]\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/nl/ipset_linux.go", "content": "package nl\n\nimport (\n\t\"strconv\"\n\n\t\"golang.org/x/sys/unix\"\n)\n\nconst (\n\t/* The protocol version */\n\tIPSET_PROTOCOL = 6\n\n\t/* The max length of strings including NUL: set and type identifiers */\n\tIPSET_MAXNAMELEN = 32\n\n\t/* The maximum permissible comment length we will accept over netlink */\n\tIPSET_MAX_COMMENT_SIZE = 255\n)\n\nconst (\n\t_ = iota\n\tIPSET_CMD_PROTOCOL /* 1: Return protocol version */\n\tIPSET_CMD_CREATE /* 2: Create a new (empty) set */\n\tIPSET_CMD_DESTROY /* 3: Destroy a (empty) set */\n\tIPSET_CMD_FLUSH /* 4: Remove all elements from a set */\n\tIPSET_CMD_RENAME /* 5: Rename a set */\n\tIPSET_CMD_SWAP /* 6: Swap two sets */\n\tIPSET_CMD_LIST /* 7: List sets */\n\tIPSET_CMD_SAVE /* 8: Save sets */\n\tIPSET_CMD_ADD /* 9: Add an element to a set */\n\tIPSET_CMD_DEL /* 10: Delete an element from a set */\n\tIPSET_CMD_TEST /* 11: Test an element in a set */\n\tIPSET_CMD_HEADER /* 12: Get set header data only */\n\tIPSET_CMD_TYPE /* 13: Get set type */\n)\n\n/* Attributes at command level */\nconst (\n\t_ = iota\n\tIPSET_ATTR_PROTOCOL /* 1: Protocol version */\n\tIPSET_ATTR_SETNAME /* 2: Name of the set */\n\tIPSET_ATTR_TYPENAME /* 3: Typename */\n\tIPSET_ATTR_REVISION /* 4: Settype revision */\n\tIPSET_ATTR_FAMILY /* 5: Settype family */\n\tIPSET_ATTR_FLAGS /* 6: Flags at command level */\n\tIPSET_ATTR_DATA /* 7: Nested attributes */\n\tIPSET_ATTR_ADT /* 8: Multiple data containers */\n\tIPSET_ATTR_LINENO /* 9: Restore lineno */\n\tIPSET_ATTR_PROTOCOL_MIN /* 10: Minimal supported version number */\n\n\tIPSET_ATTR_SETNAME2 = IPSET_ATTR_TYPENAME /* Setname at rename/swap */\n\tIPSET_ATTR_REVISION_MIN = IPSET_ATTR_PROTOCOL_MIN /* type rev min */\n)\n\n/* CADT specific attributes */\nconst (\n\tIPSET_ATTR_IP = 1\n\tIPSET_ATTR_IP_FROM = 1\n\tIPSET_ATTR_IP_TO = 2\n\tIPSET_ATTR_CIDR = 3\n\tIPSET_ATTR_PORT = 4\n\tIPSET_ATTR_PORT_FROM = 4\n\tIPSET_ATTR_PORT_TO = 5\n\tIPSET_ATTR_TIMEOUT = 6\n\tIPSET_ATTR_PROTO = 7\n\tIPSET_ATTR_CADT_FLAGS = 8\n\tIPSET_ATTR_CADT_LINENO = IPSET_ATTR_LINENO /* 9 */\n\tIPSET_ATTR_MARK = 10\n\tIPSET_ATTR_MARKMASK = 11\n\n\t/* Reserve empty slots */\n\tIPSET_ATTR_CADT_MAX = 16\n\n\t/* Create-only specific attributes */\n\tIPSET_ATTR_GC = 3 + iota\n\tIPSET_ATTR_HASHSIZE\n\tIPSET_ATTR_MAXELEM\n\tIPSET_ATTR_NETMASK\n\tIPSET_ATTR_PROBES\n\tIPSET_ATTR_RESIZE\n\tIPSET_ATTR_SIZE\n\n\t/* Kernel-only */\n\tIPSET_ATTR_ELEMENTS\n\tIPSET_ATTR_REFERENCES\n\tIPSET_ATTR_MEMSIZE\n\n\tSET_ATTR_CREATE_MAX\n)\n\n/* ADT specific attributes */\nconst (\n\tIPSET_ATTR_ETHER = IPSET_ATTR_CADT_MAX + iota + 1\n\tIPSET_ATTR_NAME\n\tIPSET_ATTR_NAMEREF\n\tIPSET_ATTR_IP2\n\tIPSET_ATTR_CIDR2\n\tIPSET_ATTR_IP2_TO\n\tIPSET_ATTR_IFACE\n\tIPSET_ATTR_BYTES\n\tIPSET_ATTR_PACKETS\n\tIPSET_ATTR_COMMENT\n\tIPSET_ATTR_SKBMARK\n\tIPSET_ATTR_SKBPRIO\n\tIPSET_ATTR_SKBQUEUE\n)\n\n/* Flags at CADT attribute level, upper half of cmdattrs */\nconst (\n\tIPSET_FLAG_BIT_BEFORE = 0\n\tIPSET_FLAG_BEFORE = (1 << IPSET_FLAG_BIT_BEFORE)\n\tIPSET_FLAG_BIT_PHYSDEV = 1\n\tIPSET_FLAG_PHYSDEV = (1 << IPSET_FLAG_BIT_PHYSDEV)\n\tIPSET_FLAG_BIT_NOMATCH = 2\n\tIPSET_FLAG_NOMATCH = (1 << IPSET_FLAG_BIT_NOMATCH)\n\tIPSET_FLAG_BIT_WITH_COUNTERS = 3\n\tIPSET_FLAG_WITH_COUNTERS = (1 << IPSET_FLAG_BIT_WITH_COUNTERS)\n\tIPSET_FLAG_BIT_WITH_COMMENT = 4\n\tIPSET_FLAG_WITH_COMMENT = (1 << IPSET_FLAG_BIT_WITH_COMMENT)\n\tIPSET_FLAG_BIT_WITH_FORCEADD = 5\n\tIPSET_FLAG_WITH_FORCEADD = (1 << IPSET_FLAG_BIT_WITH_FORCEADD)\n\tIPSET_FLAG_BIT_WITH_SKBINFO = 6\n\tIPSET_FLAG_WITH_SKBINFO = (1 << IPSET_FLAG_BIT_WITH_SKBINFO)\n\tIPSET_FLAG_CADT_MAX = 15\n)\n\nconst (\n\tIPSET_ERR_PRIVATE = 4096 + iota\n\tIPSET_ERR_PROTOCOL\n\tIPSET_ERR_FIND_TYPE\n\tIPSET_ERR_MAX_SETS\n\tIPSET_ERR_BUSY\n\tIPSET_ERR_EXIST_SETNAME2\n\tIPSET_ERR_TYPE_MISMATCH\n\tIPSET_ERR_EXIST\n\tIPSET_ERR_INVALID_CIDR\n\tIPSET_ERR_INVALID_NETMASK\n\tIPSET_ERR_INVALID_FAMILY\n\tIPSET_ERR_TIMEOUT\n\tIPSET_ERR_REFERENCED\n\tIPSET_ERR_IPADDR_IPV4\n\tIPSET_ERR_IPADDR_IPV6\n\tIPSET_ERR_COUNTER\n\tIPSET_ERR_COMMENT\n\tIPSET_ERR_INVALID_MARKMASK\n\tIPSET_ERR_SKBINFO\n\n\t/* Type specific error codes */\n\tIPSET_ERR_TYPE_SPECIFIC = 4352\n)\n\ntype IPSetError uintptr\n\nfunc (e IPSetError) Error() string {\n\tswitch int(e) {\n\tcase IPSET_ERR_PRIVATE:\n\t\treturn \"private\"\n\tcase IPSET_ERR_PROTOCOL:\n\t\treturn \"invalid protocol\"\n\tcase IPSET_ERR_FIND_TYPE:\n\t\treturn \"invalid type\"\n\tcase IPSET_ERR_MAX_SETS:\n\t\treturn \"max sets reached\"\n\tcase IPSET_ERR_BUSY:\n\t\treturn \"busy\"\n\tcase IPSET_ERR_EXIST_SETNAME2:\n\t\treturn \"exist_setname2\"\n\tcase IPSET_ERR_TYPE_MISMATCH:\n\t\treturn \"type mismatch\"\n\tcase IPSET_ERR_EXIST:\n\t\treturn \"exist\"\n\tcase IPSET_ERR_INVALID_CIDR:\n\t\treturn \"invalid cidr\"\n\tcase IPSET_ERR_INVALID_NETMASK:\n\t\treturn \"invalid netmask\"\n\tcase IPSET_ERR_INVALID_FAMILY:\n\t\treturn \"invalid family\"\n\tcase IPSET_ERR_TIMEOUT:\n\t\treturn \"timeout\"\n\tcase IPSET_ERR_REFERENCED:\n\t\treturn \"referenced\"\n\tcase IPSET_ERR_IPADDR_IPV4:\n\t\treturn \"invalid ipv4 address\"\n\tcase IPSET_ERR_IPADDR_IPV6:\n\t\treturn \"invalid ipv6 address\"\n\tcase IPSET_ERR_COUNTER:\n\t\treturn \"invalid counter\"\n\tcase IPSET_ERR_COMMENT:\n\t\treturn \"invalid comment\"\n\tcase IPSET_ERR_INVALID_MARKMASK:\n\t\treturn \"invalid markmask\"\n\tcase IPSET_ERR_SKBINFO:\n\t\treturn \"skbinfo\"\n\tdefault:\n\t\treturn \"errno \" + strconv.Itoa(int(e))\n\t}\n}\n\nfunc GetIpsetFlags(cmd int) int {\n\tswitch cmd {\n\tcase IPSET_CMD_CREATE:\n\t\treturn unix.NLM_F_REQUEST | unix.NLM_F_ACK | unix.NLM_F_CREATE\n\tcase IPSET_CMD_DESTROY,\n\t\tIPSET_CMD_FLUSH,\n\t\tIPSET_CMD_RENAME,\n\t\tIPSET_CMD_SWAP,\n\t\tIPSET_CMD_TEST:\n\t\treturn unix.NLM_F_REQUEST | unix.NLM_F_ACK\n\tcase IPSET_CMD_LIST,\n\t\tIPSET_CMD_SAVE:\n\t\treturn unix.NLM_F_REQUEST | unix.NLM_F_ACK | unix.NLM_F_ROOT | unix.NLM_F_MATCH | unix.NLM_F_DUMP\n\tcase IPSET_CMD_ADD,\n\t\tIPSET_CMD_DEL:\n\t\treturn unix.NLM_F_REQUEST | unix.NLM_F_ACK\n\tcase IPSET_CMD_HEADER,\n\t\tIPSET_CMD_TYPE,\n\t\tIPSET_CMD_PROTOCOL:\n\t\treturn unix.NLM_F_REQUEST\n\tdefault:\n\t\treturn 0\n\t}\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/nl/link_linux.go", "content": "package nl\n\nimport (\n\t\"bytes\"\n\t\"encoding/binary\"\n\t\"unsafe\"\n)\n\nconst (\n\tDEFAULT_CHANGE = 0xFFFFFFFF\n)\n\nconst (\n\tIFLA_INFO_UNSPEC = iota\n\tIFLA_INFO_KIND\n\tIFLA_INFO_DATA\n\tIFLA_INFO_XSTATS\n\tIFLA_INFO_SLAVE_KIND\n\tIFLA_INFO_SLAVE_DATA\n\tIFLA_INFO_MAX = IFLA_INFO_SLAVE_DATA\n)\n\nconst (\n\tIFLA_VLAN_UNSPEC = iota\n\tIFLA_VLAN_ID\n\tIFLA_VLAN_FLAGS\n\tIFLA_VLAN_EGRESS_QOS\n\tIFLA_VLAN_INGRESS_QOS\n\tIFLA_VLAN_PROTOCOL\n\tIFLA_VLAN_MAX = IFLA_VLAN_PROTOCOL\n)\n\nconst (\n\tVETH_INFO_UNSPEC = iota\n\tVETH_INFO_PEER\n\tVETH_INFO_MAX = VETH_INFO_PEER\n)\n\nconst (\n\tIFLA_VXLAN_UNSPEC = iota\n\tIFLA_VXLAN_ID\n\tIFLA_VXLAN_GROUP\n\tIFLA_VXLAN_LINK\n\tIFLA_VXLAN_LOCAL\n\tIFLA_VXLAN_TTL\n\tIFLA_VXLAN_TOS\n\tIFLA_VXLAN_LEARNING\n\tIFLA_VXLAN_AGEING\n\tIFLA_VXLAN_LIMIT\n\tIFLA_VXLAN_PORT_RANGE\n\tIFLA_VXLAN_PROXY\n\tIFLA_VXLAN_RSC\n\tIFLA_VXLAN_L2MISS\n\tIFLA_VXLAN_L3MISS\n\tIFLA_VXLAN_PORT\n\tIFLA_VXLAN_GROUP6\n\tIFLA_VXLAN_LOCAL6\n\tIFLA_VXLAN_UDP_CSUM\n\tIFLA_VXLAN_UDP_ZERO_CSUM6_TX\n\tIFLA_VXLAN_UDP_ZERO_CSUM6_RX\n\tIFLA_VXLAN_REMCSUM_TX\n\tIFLA_VXLAN_REMCSUM_RX\n\tIFLA_VXLAN_GBP\n\tIFLA_VXLAN_REMCSUM_NOPARTIAL\n\tIFLA_VXLAN_FLOWBASED\n\tIFLA_VXLAN_MAX = IFLA_VXLAN_FLOWBASED\n)\n\nconst (\n\tBRIDGE_MODE_UNSPEC = iota\n\tBRIDGE_MODE_HAIRPIN\n)\n\nconst (\n\tIFLA_BRPORT_UNSPEC = iota\n\tIFLA_BRPORT_STATE\n\tIFLA_BRPORT_PRIORITY\n\tIFLA_BRPORT_COST\n\tIFLA_BRPORT_MODE\n\tIFLA_BRPORT_GUARD\n\tIFLA_BRPORT_PROTECT\n\tIFLA_BRPORT_FAST_LEAVE\n\tIFLA_BRPORT_LEARNING\n\tIFLA_BRPORT_UNICAST_FLOOD\n\tIFLA_BRPORT_PROXYARP\n\tIFLA_BRPORT_LEARNING_SYNC\n\tIFLA_BRPORT_PROXYARP_WIFI\n\tIFLA_BRPORT_MAX = IFLA_BRPORT_PROXYARP_WIFI\n)\n\nconst (\n\tIFLA_IPVLAN_UNSPEC = iota\n\tIFLA_IPVLAN_MODE\n\tIFLA_IPVLAN_FLAG\n\tIFLA_IPVLAN_MAX = IFLA_IPVLAN_FLAG\n)\n\nconst (\n\tIFLA_MACVLAN_UNSPEC = iota\n\tIFLA_MACVLAN_MODE\n\tIFLA_MACVLAN_FLAGS\n\tIFLA_MACVLAN_MACADDR_MODE\n\tIFLA_MACVLAN_MACADDR\n\tIFLA_MACVLAN_MACADDR_DATA\n\tIFLA_MACVLAN_MACADDR_COUNT\n\tIFLA_MACVLAN_MAX = IFLA_MACVLAN_FLAGS\n)\n\nconst (\n\tMACVLAN_MODE_PRIVATE = 1\n\tMACVLAN_MODE_VEPA = 2\n\tMACVLAN_MODE_BRIDGE = 4\n\tMACVLAN_MODE_PASSTHRU = 8\n\tMACVLAN_MODE_SOURCE = 16\n)\n\nconst (\n\tMACVLAN_MACADDR_ADD = iota\n\tMACVLAN_MACADDR_DEL\n\tMACVLAN_MACADDR_FLUSH\n\tMACVLAN_MACADDR_SET\n)\n\nconst (\n\tIFLA_BOND_UNSPEC = iota\n\tIFLA_BOND_MODE\n\tIFLA_BOND_ACTIVE_SLAVE\n\tIFLA_BOND_MIIMON\n\tIFLA_BOND_UPDELAY\n\tIFLA_BOND_DOWNDELAY\n\tIFLA_BOND_USE_CARRIER\n\tIFLA_BOND_ARP_INTERVAL\n\tIFLA_BOND_ARP_IP_TARGET\n\tIFLA_BOND_ARP_VALIDATE\n\tIFLA_BOND_ARP_ALL_TARGETS\n\tIFLA_BOND_PRIMARY\n\tIFLA_BOND_PRIMARY_RESELECT\n\tIFLA_BOND_FAIL_OVER_MAC\n\tIFLA_BOND_XMIT_HASH_POLICY\n\tIFLA_BOND_RESEND_IGMP\n\tIFLA_BOND_NUM_PEER_NOTIF\n\tIFLA_BOND_ALL_SLAVES_ACTIVE\n\tIFLA_BOND_MIN_LINKS\n\tIFLA_BOND_LP_INTERVAL\n\tIFLA_BOND_PACKETS_PER_SLAVE\n\tIFLA_BOND_AD_LACP_RATE\n\tIFLA_BOND_AD_SELECT\n\tIFLA_BOND_AD_INFO\n\tIFLA_BOND_AD_ACTOR_SYS_PRIO\n\tIFLA_BOND_AD_USER_PORT_KEY\n\tIFLA_BOND_AD_ACTOR_SYSTEM\n\tIFLA_BOND_TLB_DYNAMIC_LB\n)\n\nconst (\n\tIFLA_BOND_AD_INFO_UNSPEC = iota\n\tIFLA_BOND_AD_INFO_AGGREGATOR\n\tIFLA_BOND_AD_INFO_NUM_PORTS\n\tIFLA_BOND_AD_INFO_ACTOR_KEY\n\tIFLA_BOND_AD_INFO_PARTNER_KEY\n\tIFLA_BOND_AD_INFO_PARTNER_MAC\n)\n\nconst (\n\tIFLA_BOND_SLAVE_UNSPEC = iota\n\tIFLA_BOND_SLAVE_STATE\n\tIFLA_BOND_SLAVE_MII_STATUS\n\tIFLA_BOND_SLAVE_LINK_FAILURE_COUNT\n\tIFLA_BOND_SLAVE_PERM_HWADDR\n\tIFLA_BOND_SLAVE_QUEUE_ID\n\tIFLA_BOND_SLAVE_AD_AGGREGATOR_ID\n\tIFLA_BOND_SLAVE_AD_ACTOR_OPER_PORT_STATE\n\tIFLA_BOND_SLAVE_AD_PARTNER_OPER_PORT_STATE\n)\n\nconst (\n\tIFLA_GENEVE_UNSPEC = iota\n\tIFLA_GENEVE_ID // vni\n\tIFLA_GENEVE_REMOTE\n\tIFLA_GENEVE_TTL\n\tIFLA_GENEVE_TOS\n\tIFLA_GENEVE_PORT // destination port\n\tIFLA_GENEVE_COLLECT_METADATA\n\tIFLA_GENEVE_REMOTE6\n\tIFLA_GENEVE_UDP_CSUM\n\tIFLA_GENEVE_UDP_ZERO_CSUM6_TX\n\tIFLA_GENEVE_UDP_ZERO_CSUM6_RX\n\tIFLA_GENEVE_LABEL\n\tIFLA_GENEVE_MAX = IFLA_GENEVE_LABEL\n)\n\nconst (\n\tIFLA_GRE_UNSPEC = iota\n\tIFLA_GRE_LINK\n\tIFLA_GRE_IFLAGS\n\tIFLA_GRE_OFLAGS\n\tIFLA_GRE_IKEY\n\tIFLA_GRE_OKEY\n\tIFLA_GRE_LOCAL\n\tIFLA_GRE_REMOTE\n\tIFLA_GRE_TTL\n\tIFLA_GRE_TOS\n\tIFLA_GRE_PMTUDISC\n\tIFLA_GRE_ENCAP_LIMIT\n\tIFLA_GRE_FLOWINFO\n\tIFLA_GRE_FLAGS\n\tIFLA_GRE_ENCAP_TYPE\n\tIFLA_GRE_ENCAP_FLAGS\n\tIFLA_GRE_ENCAP_SPORT\n\tIFLA_GRE_ENCAP_DPORT\n\tIFLA_GRE_COLLECT_METADATA\n\tIFLA_GRE_MAX = IFLA_GRE_COLLECT_METADATA\n)\n\nconst (\n\tGRE_CSUM = 0x8000\n\tGRE_ROUTING = 0x4000\n\tGRE_KEY = 0x2000\n\tGRE_SEQ = 0x1000\n\tGRE_STRICT = 0x0800\n\tGRE_REC = 0x0700\n\tGRE_FLAGS = 0x00F8\n\tGRE_VERSION = 0x0007\n)\n\nconst (\n\tIFLA_VF_INFO_UNSPEC = iota\n\tIFLA_VF_INFO\n\tIFLA_VF_INFO_MAX = IFLA_VF_INFO\n)\n\nconst (\n\tIFLA_VF_UNSPEC = iota\n\tIFLA_VF_MAC /* Hardware queue specific attributes */\n\tIFLA_VF_VLAN\n\tIFLA_VF_TX_RATE /* Max TX Bandwidth Allocation */\n\tIFLA_VF_SPOOFCHK /* Spoof Checking on/off switch */\n\tIFLA_VF_LINK_STATE /* link state enable/disable/auto switch */\n\tIFLA_VF_RATE /* Min and Max TX Bandwidth Allocation */\n\tIFLA_VF_RSS_QUERY_EN /* RSS Redirection Table and Hash Key query\n\t * on/off switch\n\t */\n\tIFLA_VF_STATS /* network device statistics */\n\tIFLA_VF_TRUST /* Trust state of VF */\n\tIFLA_VF_IB_NODE_GUID /* VF Infiniband node GUID */\n\tIFLA_VF_IB_PORT_GUID /* VF Infiniband port GUID */\n\tIFLA_VF_MAX = IFLA_VF_IB_PORT_GUID\n)\n\nconst (\n\tIFLA_VF_LINK_STATE_AUTO = iota /* link state of the uplink */\n\tIFLA_VF_LINK_STATE_ENABLE /* link always up */\n\tIFLA_VF_LINK_STATE_DISABLE /* link always down */\n\tIFLA_VF_LINK_STATE_MAX = IFLA_VF_LINK_STATE_DISABLE\n)\n\nconst (\n\tIFLA_VF_STATS_RX_PACKETS = iota\n\tIFLA_VF_STATS_TX_PACKETS\n\tIFLA_VF_STATS_RX_BYTES\n\tIFLA_VF_STATS_TX_BYTES\n\tIFLA_VF_STATS_BROADCAST\n\tIFLA_VF_STATS_MULTICAST\n\tIFLA_VF_STATS_RX_DROPPED\n\tIFLA_VF_STATS_TX_DROPPED\n\tIFLA_VF_STATS_MAX = IFLA_VF_STATS_TX_DROPPED\n)\n\nconst (\n\tSizeofVfMac = 0x24\n\tSizeofVfVlan = 0x0c\n\tSizeofVfTxRate = 0x08\n\tSizeofVfRate = 0x0c\n\tSizeofVfSpoofchk = 0x08\n\tSizeofVfLinkState = 0x08\n\tSizeofVfRssQueryEn = 0x08\n\tSizeofVfTrust = 0x08\n\tSizeofVfGUID = 0x10\n)\n\n// struct ifla_vf_mac {\n// __u32 vf;\n// __u8 mac[32]; /* MAX_ADDR_LEN */\n// };\n\ntype VfMac struct {\n\tVf uint32\n\tMac [32]byte\n}\n\nfunc (msg *VfMac) Len() int {\n\treturn SizeofVfMac\n}\n\nfunc DeserializeVfMac(b []byte) *VfMac {\n\treturn (*VfMac)(unsafe.Pointer(&b[0:SizeofVfMac][0]))\n}\n\nfunc (msg *VfMac) Serialize() []byte {\n\treturn (*(*[SizeofVfMac]byte)(unsafe.Pointer(msg)))[:]\n}\n\n// struct ifla_vf_vlan {\n// __u32 vf;\n// __u32 vlan; /* 0 - 4095, 0 disables VLAN filter */\n// __u32 qos;\n// };\n\ntype VfVlan struct {\n\tVf uint32\n\tVlan uint32\n\tQos uint32\n}\n\nfunc (msg *VfVlan) Len() int {\n\treturn SizeofVfVlan\n}\n\nfunc DeserializeVfVlan(b []byte) *VfVlan {\n\treturn (*VfVlan)(unsafe.Pointer(&b[0:SizeofVfVlan][0]))\n}\n\nfunc (msg *VfVlan) Serialize() []byte {\n\treturn (*(*[SizeofVfVlan]byte)(unsafe.Pointer(msg)))[:]\n}\n\n// struct ifla_vf_tx_rate {\n// __u32 vf;\n// __u32 rate; /* Max TX bandwidth in Mbps, 0 disables throttling */\n// };\n\ntype VfTxRate struct {\n\tVf uint32\n\tRate uint32\n}\n\nfunc (msg *VfTxRate) Len() int {\n\treturn SizeofVfTxRate\n}\n\nfunc DeserializeVfTxRate(b []byte) *VfTxRate {\n\treturn (*VfTxRate)(unsafe.Pointer(&b[0:SizeofVfTxRate][0]))\n}\n\nfunc (msg *VfTxRate) Serialize() []byte {\n\treturn (*(*[SizeofVfTxRate]byte)(unsafe.Pointer(msg)))[:]\n}\n\n//struct ifla_vf_stats {\n//\t__u64 rx_packets;\n//\t__u64 tx_packets;\n//\t__u64 rx_bytes;\n//\t__u64 tx_bytes;\n//\t__u64 broadcast;\n//\t__u64 multicast;\n//};\n\ntype VfStats struct {\n\tRxPackets uint64\n\tTxPackets uint64\n\tRxBytes uint64\n\tTxBytes uint64\n\tMulticast uint64\n\tBroadcast uint64\n\tRxDropped uint64\n\tTxDropped uint64\n}\n\nfunc DeserializeVfStats(b []byte) VfStats {\n\tvar vfstat VfStats\n\tstats, err := ParseRouteAttr(b)\n\tif err != nil {\n\t\treturn vfstat\n\t}\n\tvar valueVar uint64\n\tfor _, stat := range stats {\n\t\tif err := binary.Read(bytes.NewBuffer(stat.Value), NativeEndian(), &valueVar); err != nil {\n\t\t\tbreak\n\t\t}\n\t\tswitch stat.Attr.Type {\n\t\tcase IFLA_VF_STATS_RX_PACKETS:\n\t\t\tvfstat.RxPackets = valueVar\n\t\tcase IFLA_VF_STATS_TX_PACKETS:\n\t\t\tvfstat.TxPackets = valueVar\n\t\tcase IFLA_VF_STATS_RX_BYTES:\n\t\t\tvfstat.RxBytes = valueVar\n\t\tcase IFLA_VF_STATS_TX_BYTES:\n\t\t\tvfstat.TxBytes = valueVar\n\t\tcase IFLA_VF_STATS_MULTICAST:\n\t\t\tvfstat.Multicast = valueVar\n\t\tcase IFLA_VF_STATS_BROADCAST:\n\t\t\tvfstat.Broadcast = valueVar\n\t\tcase IFLA_VF_STATS_RX_DROPPED:\n\t\t\tvfstat.RxDropped = valueVar\n\t\tcase IFLA_VF_STATS_TX_DROPPED:\n\t\t\tvfstat.TxDropped = valueVar\n\t\t}\n\t}\n\treturn vfstat\n}\n\n// struct ifla_vf_rate {\n// __u32 vf;\n// __u32 min_tx_rate; /* Min Bandwidth in Mbps */\n// __u32 max_tx_rate; /* Max Bandwidth in Mbps */\n// };\n\ntype VfRate struct {\n\tVf uint32\n\tMinTxRate uint32\n\tMaxTxRate uint32\n}\n\nfunc (msg *VfRate) Len() int {\n\treturn SizeofVfRate\n}\n\nfunc DeserializeVfRate(b []byte) *VfRate {\n\treturn (*VfRate)(unsafe.Pointer(&b[0:SizeofVfRate][0]))\n}\n\nfunc (msg *VfRate) Serialize() []byte {\n\treturn (*(*[SizeofVfRate]byte)(unsafe.Pointer(msg)))[:]\n}\n\n// struct ifla_vf_spoofchk {\n// __u32 vf;\n// __u32 setting;\n// };\n\ntype VfSpoofchk struct {\n\tVf uint32\n\tSetting uint32\n}\n\nfunc (msg *VfSpoofchk) Len() int {\n\treturn SizeofVfSpoofchk\n}\n\nfunc DeserializeVfSpoofchk(b []byte) *VfSpoofchk {\n\treturn (*VfSpoofchk)(unsafe.Pointer(&b[0:SizeofVfSpoofchk][0]))\n}\n\nfunc (msg *VfSpoofchk) Serialize() []byte {\n\treturn (*(*[SizeofVfSpoofchk]byte)(unsafe.Pointer(msg)))[:]\n}\n\n// struct ifla_vf_link_state {\n// __u32 vf;\n// __u32 link_state;\n// };\n\ntype VfLinkState struct {\n\tVf uint32\n\tLinkState uint32\n}\n\nfunc (msg *VfLinkState) Len() int {\n\treturn SizeofVfLinkState\n}\n\nfunc DeserializeVfLinkState(b []byte) *VfLinkState {\n\treturn (*VfLinkState)(unsafe.Pointer(&b[0:SizeofVfLinkState][0]))\n}\n\nfunc (msg *VfLinkState) Serialize() []byte {\n\treturn (*(*[SizeofVfLinkState]byte)(unsafe.Pointer(msg)))[:]\n}\n\n// struct ifla_vf_rss_query_en {\n// __u32 vf;\n// __u32 setting;\n// };\n\ntype VfRssQueryEn struct {\n\tVf uint32\n\tSetting uint32\n}\n\nfunc (msg *VfRssQueryEn) Len() int {\n\treturn SizeofVfRssQueryEn\n}\n\nfunc DeserializeVfRssQueryEn(b []byte) *VfRssQueryEn {\n\treturn (*VfRssQueryEn)(unsafe.Pointer(&b[0:SizeofVfRssQueryEn][0]))\n}\n\nfunc (msg *VfRssQueryEn) Serialize() []byte {\n\treturn (*(*[SizeofVfRssQueryEn]byte)(unsafe.Pointer(msg)))[:]\n}\n\n// struct ifla_vf_trust {\n// __u32 vf;\n// __u32 setting;\n// };\n\ntype VfTrust struct {\n\tVf uint32\n\tSetting uint32\n}\n\nfunc (msg *VfTrust) Len() int {\n\treturn SizeofVfTrust\n}\n\nfunc DeserializeVfTrust(b []byte) *VfTrust {\n\treturn (*VfTrust)(unsafe.Pointer(&b[0:SizeofVfTrust][0]))\n}\n\nfunc (msg *VfTrust) Serialize() []byte {\n\treturn (*(*[SizeofVfTrust]byte)(unsafe.Pointer(msg)))[:]\n}\n\n// struct ifla_vf_guid {\n// __u32 vf;\n// __u32 rsvd;\n// __u64 guid;\n// };\n\ntype VfGUID struct {\n\tVf uint32\n\tRsvd uint32\n\tGUID uint64\n}\n\nfunc (msg *VfGUID) Len() int {\n\treturn SizeofVfGUID\n}\n\nfunc DeserializeVfGUID(b []byte) *VfGUID {\n\treturn (*VfGUID)(unsafe.Pointer(&b[0:SizeofVfGUID][0]))\n}\n\nfunc (msg *VfGUID) Serialize() []byte {\n\treturn (*(*[SizeofVfGUID]byte)(unsafe.Pointer(msg)))[:]\n}\n\nconst (\n\tXDP_FLAGS_UPDATE_IF_NOEXIST = 1 << iota\n\tXDP_FLAGS_SKB_MODE\n\tXDP_FLAGS_DRV_MODE\n\tXDP_FLAGS_MASK = XDP_FLAGS_UPDATE_IF_NOEXIST | XDP_FLAGS_SKB_MODE | XDP_FLAGS_DRV_MODE\n)\n\nconst (\n\tIFLA_XDP_UNSPEC = iota\n\tIFLA_XDP_FD /* fd of xdp program to attach, or -1 to remove */\n\tIFLA_XDP_ATTACHED /* read-only bool indicating if prog is attached */\n\tIFLA_XDP_FLAGS /* xdp prog related flags */\n\tIFLA_XDP_PROG_ID /* xdp prog id */\n\tIFLA_XDP_MAX = IFLA_XDP_PROG_ID\n)\n\n// XDP program attach mode (used as dump value for IFLA_XDP_ATTACHED)\nconst (\n\tXDP_ATTACHED_NONE = iota\n\tXDP_ATTACHED_DRV\n\tXDP_ATTACHED_SKB\n\tXDP_ATTACHED_HW\n)\n\nconst (\n\tIFLA_IPTUN_UNSPEC = iota\n\tIFLA_IPTUN_LINK\n\tIFLA_IPTUN_LOCAL\n\tIFLA_IPTUN_REMOTE\n\tIFLA_IPTUN_TTL\n\tIFLA_IPTUN_TOS\n\tIFLA_IPTUN_ENCAP_LIMIT\n\tIFLA_IPTUN_FLOWINFO\n\tIFLA_IPTUN_FLAGS\n\tIFLA_IPTUN_PROTO\n\tIFLA_IPTUN_PMTUDISC\n\tIFLA_IPTUN_6RD_PREFIX\n\tIFLA_IPTUN_6RD_RELAY_PREFIX\n\tIFLA_IPTUN_6RD_PREFIXLEN\n\tIFLA_IPTUN_6RD_RELAY_PREFIXLEN\n\tIFLA_IPTUN_ENCAP_TYPE\n\tIFLA_IPTUN_ENCAP_FLAGS\n\tIFLA_IPTUN_ENCAP_SPORT\n\tIFLA_IPTUN_ENCAP_DPORT\n\tIFLA_IPTUN_COLLECT_METADATA\n\tIFLA_IPTUN_MAX = IFLA_IPTUN_COLLECT_METADATA\n)\n\nconst (\n\tIFLA_VTI_UNSPEC = iota\n\tIFLA_VTI_LINK\n\tIFLA_VTI_IKEY\n\tIFLA_VTI_OKEY\n\tIFLA_VTI_LOCAL\n\tIFLA_VTI_REMOTE\n\tIFLA_VTI_MAX = IFLA_VTI_REMOTE\n)\n\nconst (\n\tIFLA_VRF_UNSPEC = iota\n\tIFLA_VRF_TABLE\n)\n\nconst (\n\tIFLA_BR_UNSPEC = iota\n\tIFLA_BR_FORWARD_DELAY\n\tIFLA_BR_HELLO_TIME\n\tIFLA_BR_MAX_AGE\n\tIFLA_BR_AGEING_TIME\n\tIFLA_BR_STP_STATE\n\tIFLA_BR_PRIORITY\n\tIFLA_BR_VLAN_FILTERING\n\tIFLA_BR_VLAN_PROTOCOL\n\tIFLA_BR_GROUP_FWD_MASK\n\tIFLA_BR_ROOT_ID\n\tIFLA_BR_BRIDGE_ID\n\tIFLA_BR_ROOT_PORT\n\tIFLA_BR_ROOT_PATH_COST\n\tIFLA_BR_TOPOLOGY_CHANGE\n\tIFLA_BR_TOPOLOGY_CHANGE_DETECTED\n\tIFLA_BR_HELLO_TIMER\n\tIFLA_BR_TCN_TIMER\n\tIFLA_BR_TOPOLOGY_CHANGE_TIMER\n\tIFLA_BR_GC_TIMER\n\tIFLA_BR_GROUP_ADDR\n\tIFLA_BR_FDB_FLUSH\n\tIFLA_BR_MCAST_ROUTER\n\tIFLA_BR_MCAST_SNOOPING\n\tIFLA_BR_MCAST_QUERY_USE_IFADDR\n\tIFLA_BR_MCAST_QUERIER\n\tIFLA_BR_MCAST_HASH_ELASTICITY\n\tIFLA_BR_MCAST_HASH_MAX\n\tIFLA_BR_MCAST_LAST_MEMBER_CNT\n\tIFLA_BR_MCAST_STARTUP_QUERY_CNT\n\tIFLA_BR_MCAST_LAST_MEMBER_INTVL\n\tIFLA_BR_MCAST_MEMBERSHIP_INTVL\n\tIFLA_BR_MCAST_QUERIER_INTVL\n\tIFLA_BR_MCAST_QUERY_INTVL\n\tIFLA_BR_MCAST_QUERY_RESPONSE_INTVL\n\tIFLA_BR_MCAST_STARTUP_QUERY_INTVL\n\tIFLA_BR_NF_CALL_IPTABLES\n\tIFLA_BR_NF_CALL_IP6TABLES\n\tIFLA_BR_NF_CALL_ARPTABLES\n\tIFLA_BR_VLAN_DEFAULT_PVID\n\tIFLA_BR_PAD\n\tIFLA_BR_VLAN_STATS_ENABLED\n\tIFLA_BR_MCAST_STATS_ENABLED\n\tIFLA_BR_MCAST_IGMP_VERSION\n\tIFLA_BR_MCAST_MLD_VERSION\n\tIFLA_BR_MAX = IFLA_BR_MCAST_MLD_VERSION\n)\n\nconst (\n\tIFLA_GTP_UNSPEC = iota\n\tIFLA_GTP_FD0\n\tIFLA_GTP_FD1\n\tIFLA_GTP_PDP_HASHSIZE\n\tIFLA_GTP_ROLE\n)\n\nconst (\n\tGTP_ROLE_GGSN = iota\n\tGTP_ROLE_SGSN\n)\n\nconst (\n\tIFLA_XFRM_UNSPEC = iota\n\tIFLA_XFRM_LINK\n\tIFLA_XFRM_IF_ID\n\n\tIFLA_XFRM_MAX = iota - 1\n)\n\nconst (\n\tIFLA_TUN_UNSPEC = iota\n\tIFLA_TUN_OWNER\n\tIFLA_TUN_GROUP\n\tIFLA_TUN_TYPE\n\tIFLA_TUN_PI\n\tIFLA_TUN_VNET_HDR\n\tIFLA_TUN_PERSIST\n\tIFLA_TUN_MULTI_QUEUE\n\tIFLA_TUN_NUM_QUEUES\n\tIFLA_TUN_NUM_DISABLED_QUEUES\n\tIFLA_TUN_MAX = IFLA_TUN_NUM_DISABLED_QUEUES\n)\n\nconst (\n\tIFLA_IPOIB_UNSPEC = iota\n\tIFLA_IPOIB_PKEY\n\tIFLA_IPOIB_MODE\n\tIFLA_IPOIB_UMCAST\n\tIFLA_IPOIB_MAX = IFLA_IPOIB_UMCAST\n)\n\nconst (\n\tIFLA_CAN_UNSPEC = iota\n\tIFLA_CAN_BITTIMING\n\tIFLA_CAN_BITTIMING_CONST\n\tIFLA_CAN_CLOCK\n\tIFLA_CAN_STATE\n\tIFLA_CAN_CTRLMODE\n\tIFLA_CAN_RESTART_MS\n\tIFLA_CAN_RESTART\n\tIFLA_CAN_BERR_COUNTER\n\tIFLA_CAN_DATA_BITTIMING\n\tIFLA_CAN_DATA_BITTIMING_CONST\n\tIFLA_CAN_TERMINATION\n\tIFLA_CAN_TERMINATION_CONST\n\tIFLA_CAN_BITRATE_CONST\n\tIFLA_CAN_DATA_BITRATE_CONST\n\tIFLA_CAN_BITRATE_MAX\n\tIFLA_CAN_MAX = IFLA_CAN_BITRATE_MAX\n)\n" }, { "path": "vendor/github.com/vishvananda/netlink/nl/lwt_linux.go", "content": "package nl\n\nconst (\n\tLWT_BPF_PROG_UNSPEC = iota\n\tLWT_BPF_PROG_FD\n\tLWT_BPF_PROG_NAME\n\t__LWT_BPF_PROG_MAX\n)\n\nconst (\n\tLWT_BPF_PROG_MAX = __LWT_BPF_PROG_MAX - 1\n)\n\nconst (\n\tLWT_BPF_UNSPEC = iota\n\tLWT_BPF_IN\n\tLWT_BPF_OUT\n\tLWT_BPF_XMIT\n\tLWT_BPF_XMIT_HEADROOM\n\t__LWT_BPF_MAX\n)\n\nconst (\n\tLWT_BPF_MAX = __LWT_BPF_MAX - 1\n)\n\nconst (\n\tLWT_BPF_MAX_HEADROOM = 256\n)\n" }, { "path": "vendor/github.com/vishvananda/netlink/nl/mpls_linux.go", "content": "package nl\n\nimport \"encoding/binary\"\n\nconst (\n\tMPLS_LS_LABEL_SHIFT = 12\n\tMPLS_LS_S_SHIFT = 8\n)\n\nfunc EncodeMPLSStack(labels ...int) []byte {\n\tb := make([]byte, 4*len(labels))\n\tfor idx, label := range labels {\n\t\tl := label << MPLS_LS_LABEL_SHIFT\n\t\tif idx == len(labels)-1 {\n\t\t\tl |= 1 << MPLS_LS_S_SHIFT\n\t\t}\n\t\tbinary.BigEndian.PutUint32(b[idx*4:], uint32(l))\n\t}\n\treturn b\n}\n\nfunc DecodeMPLSStack(buf []byte) []int {\n\tif len(buf)%4 != 0 {\n\t\treturn nil\n\t}\n\tstack := make([]int, 0, len(buf)/4)\n\tfor len(buf) > 0 {\n\t\tl := binary.BigEndian.Uint32(buf[:4])\n\t\tbuf = buf[4:]\n\t\tstack = append(stack, int(l)>>MPLS_LS_LABEL_SHIFT)\n\t\tif (l>>MPLS_LS_S_SHIFT)&1 > 0 {\n\t\t\tbreak\n\t\t}\n\t}\n\treturn stack\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/nl/nl_linux.go", "content": "// Package nl has low level primitives for making Netlink calls.\npackage nl\n\nimport (\n\t\"bytes\"\n\t\"encoding/binary\"\n\t\"fmt\"\n\t\"net\"\n\t\"runtime\"\n\t\"sync\"\n\t\"sync/atomic\"\n\t\"syscall\"\n\t\"unsafe\"\n\n\t\"github.com/vishvananda/netns\"\n\t\"golang.org/x/sys/unix\"\n)\n\nconst (\n\t// Family type definitions\n\tFAMILY_ALL = unix.AF_UNSPEC\n\tFAMILY_V4 = unix.AF_INET\n\tFAMILY_V6 = unix.AF_INET6\n\tFAMILY_MPLS = unix.AF_MPLS\n\t// Arbitrary set value (greater than default 4k) to allow receiving\n\t// from kernel more verbose messages e.g. for statistics,\n\t// tc rules or filters, or other more memory requiring data.\n\tRECEIVE_BUFFER_SIZE = 65536\n\t// Kernel netlink pid\n\tPidKernel uint32 = 0\n)\n\n// SupportedNlFamilies contains the list of netlink families this netlink package supports\nvar SupportedNlFamilies = []int{unix.NETLINK_ROUTE, unix.NETLINK_XFRM, unix.NETLINK_NETFILTER}\n\nvar nextSeqNr uint32\n\n// Default netlink socket timeout, 60s\nvar SocketTimeoutTv = unix.Timeval{Sec: 60, Usec: 0}\n\n// GetIPFamily returns the family type of a net.IP.\nfunc GetIPFamily(ip net.IP) int {\n\tif len(ip) <= net.IPv4len {\n\t\treturn FAMILY_V4\n\t}\n\tif ip.To4() != nil {\n\t\treturn FAMILY_V4\n\t}\n\treturn FAMILY_V6\n}\n\nvar nativeEndian binary.ByteOrder\n\n// NativeEndian gets native endianness for the system\nfunc NativeEndian() binary.ByteOrder {\n\tif nativeEndian == nil {\n\t\tvar x uint32 = 0x01020304\n\t\tif *(*byte)(unsafe.Pointer(&x)) == 0x01 {\n\t\t\tnativeEndian = binary.BigEndian\n\t\t} else {\n\t\t\tnativeEndian = binary.LittleEndian\n\t\t}\n\t}\n\treturn nativeEndian\n}\n\n// Byte swap a 16 bit value if we aren't big endian\nfunc Swap16(i uint16) uint16 {\n\tif NativeEndian() == binary.BigEndian {\n\t\treturn i\n\t}\n\treturn (i&0xff00)>>8 | (i&0xff)<<8\n}\n\n// Byte swap a 32 bit value if aren't big endian\nfunc Swap32(i uint32) uint32 {\n\tif NativeEndian() == binary.BigEndian {\n\t\treturn i\n\t}\n\treturn (i&0xff000000)>>24 | (i&0xff0000)>>8 | (i&0xff00)<<8 | (i&0xff)<<24\n}\n\ntype NetlinkRequestData interface {\n\tLen() int\n\tSerialize() []byte\n}\n\n// IfInfomsg is related to links, but it is used for list requests as well\ntype IfInfomsg struct {\n\tunix.IfInfomsg\n}\n\n// Create an IfInfomsg with family specified\nfunc NewIfInfomsg(family int) *IfInfomsg {\n\treturn &IfInfomsg{\n\t\tIfInfomsg: unix.IfInfomsg{\n\t\t\tFamily: uint8(family),\n\t\t},\n\t}\n}\n\nfunc DeserializeIfInfomsg(b []byte) *IfInfomsg {\n\treturn (*IfInfomsg)(unsafe.Pointer(&b[0:unix.SizeofIfInfomsg][0]))\n}\n\nfunc (msg *IfInfomsg) Serialize() []byte {\n\treturn (*(*[unix.SizeofIfInfomsg]byte)(unsafe.Pointer(msg)))[:]\n}\n\nfunc (msg *IfInfomsg) Len() int {\n\treturn unix.SizeofIfInfomsg\n}\n\nfunc (msg *IfInfomsg) EncapType() string {\n\tswitch msg.Type {\n\tcase 0:\n\t\treturn \"generic\"\n\tcase unix.ARPHRD_ETHER:\n\t\treturn \"ether\"\n\tcase unix.ARPHRD_EETHER:\n\t\treturn \"eether\"\n\tcase unix.ARPHRD_AX25:\n\t\treturn \"ax25\"\n\tcase unix.ARPHRD_PRONET:\n\t\treturn \"pronet\"\n\tcase unix.ARPHRD_CHAOS:\n\t\treturn \"chaos\"\n\tcase unix.ARPHRD_IEEE802:\n\t\treturn \"ieee802\"\n\tcase unix.ARPHRD_ARCNET:\n\t\treturn \"arcnet\"\n\tcase unix.ARPHRD_APPLETLK:\n\t\treturn \"atalk\"\n\tcase unix.ARPHRD_DLCI:\n\t\treturn \"dlci\"\n\tcase unix.ARPHRD_ATM:\n\t\treturn \"atm\"\n\tcase unix.ARPHRD_METRICOM:\n\t\treturn \"metricom\"\n\tcase unix.ARPHRD_IEEE1394:\n\t\treturn \"ieee1394\"\n\tcase unix.ARPHRD_INFINIBAND:\n\t\treturn \"infiniband\"\n\tcase unix.ARPHRD_SLIP:\n\t\treturn \"slip\"\n\tcase unix.ARPHRD_CSLIP:\n\t\treturn \"cslip\"\n\tcase unix.ARPHRD_SLIP6:\n\t\treturn \"slip6\"\n\tcase unix.ARPHRD_CSLIP6:\n\t\treturn \"cslip6\"\n\tcase unix.ARPHRD_RSRVD:\n\t\treturn \"rsrvd\"\n\tcase unix.ARPHRD_ADAPT:\n\t\treturn \"adapt\"\n\tcase unix.ARPHRD_ROSE:\n\t\treturn \"rose\"\n\tcase unix.ARPHRD_X25:\n\t\treturn \"x25\"\n\tcase unix.ARPHRD_HWX25:\n\t\treturn \"hwx25\"\n\tcase unix.ARPHRD_PPP:\n\t\treturn \"ppp\"\n\tcase unix.ARPHRD_HDLC:\n\t\treturn \"hdlc\"\n\tcase unix.ARPHRD_LAPB:\n\t\treturn \"lapb\"\n\tcase unix.ARPHRD_DDCMP:\n\t\treturn \"ddcmp\"\n\tcase unix.ARPHRD_RAWHDLC:\n\t\treturn \"rawhdlc\"\n\tcase unix.ARPHRD_TUNNEL:\n\t\treturn \"ipip\"\n\tcase unix.ARPHRD_TUNNEL6:\n\t\treturn \"tunnel6\"\n\tcase unix.ARPHRD_FRAD:\n\t\treturn \"frad\"\n\tcase unix.ARPHRD_SKIP:\n\t\treturn \"skip\"\n\tcase unix.ARPHRD_LOOPBACK:\n\t\treturn \"loopback\"\n\tcase unix.ARPHRD_LOCALTLK:\n\t\treturn \"ltalk\"\n\tcase unix.ARPHRD_FDDI:\n\t\treturn \"fddi\"\n\tcase unix.ARPHRD_BIF:\n\t\treturn \"bif\"\n\tcase unix.ARPHRD_SIT:\n\t\treturn \"sit\"\n\tcase unix.ARPHRD_IPDDP:\n\t\treturn \"ip/ddp\"\n\tcase unix.ARPHRD_IPGRE:\n\t\treturn \"gre\"\n\tcase unix.ARPHRD_PIMREG:\n\t\treturn \"pimreg\"\n\tcase unix.ARPHRD_HIPPI:\n\t\treturn \"hippi\"\n\tcase unix.ARPHRD_ASH:\n\t\treturn \"ash\"\n\tcase unix.ARPHRD_ECONET:\n\t\treturn \"econet\"\n\tcase unix.ARPHRD_IRDA:\n\t\treturn \"irda\"\n\tcase unix.ARPHRD_FCPP:\n\t\treturn \"fcpp\"\n\tcase unix.ARPHRD_FCAL:\n\t\treturn \"fcal\"\n\tcase unix.ARPHRD_FCPL:\n\t\treturn \"fcpl\"\n\tcase unix.ARPHRD_FCFABRIC:\n\t\treturn \"fcfb0\"\n\tcase unix.ARPHRD_FCFABRIC + 1:\n\t\treturn \"fcfb1\"\n\tcase unix.ARPHRD_FCFABRIC + 2:\n\t\treturn \"fcfb2\"\n\tcase unix.ARPHRD_FCFABRIC + 3:\n\t\treturn \"fcfb3\"\n\tcase unix.ARPHRD_FCFABRIC + 4:\n\t\treturn \"fcfb4\"\n\tcase unix.ARPHRD_FCFABRIC + 5:\n\t\treturn \"fcfb5\"\n\tcase unix.ARPHRD_FCFABRIC + 6:\n\t\treturn \"fcfb6\"\n\tcase unix.ARPHRD_FCFABRIC + 7:\n\t\treturn \"fcfb7\"\n\tcase unix.ARPHRD_FCFABRIC + 8:\n\t\treturn \"fcfb8\"\n\tcase unix.ARPHRD_FCFABRIC + 9:\n\t\treturn \"fcfb9\"\n\tcase unix.ARPHRD_FCFABRIC + 10:\n\t\treturn \"fcfb10\"\n\tcase unix.ARPHRD_FCFABRIC + 11:\n\t\treturn \"fcfb11\"\n\tcase unix.ARPHRD_FCFABRIC + 12:\n\t\treturn \"fcfb12\"\n\tcase unix.ARPHRD_IEEE802_TR:\n\t\treturn \"tr\"\n\tcase unix.ARPHRD_IEEE80211:\n\t\treturn \"ieee802.11\"\n\tcase unix.ARPHRD_IEEE80211_PRISM:\n\t\treturn \"ieee802.11/prism\"\n\tcase unix.ARPHRD_IEEE80211_RADIOTAP:\n\t\treturn \"ieee802.11/radiotap\"\n\tcase unix.ARPHRD_IEEE802154:\n\t\treturn \"ieee802.15.4\"\n\n\tcase 65534:\n\t\treturn \"none\"\n\tcase 65535:\n\t\treturn \"void\"\n\t}\n\treturn fmt.Sprintf(\"unknown%d\", msg.Type)\n}\n\nfunc rtaAlignOf(attrlen int) int {\n\treturn (attrlen + unix.RTA_ALIGNTO - 1) & ^(unix.RTA_ALIGNTO - 1)\n}\n\nfunc NewIfInfomsgChild(parent *RtAttr, family int) *IfInfomsg {\n\tmsg := NewIfInfomsg(family)\n\tparent.children = append(parent.children, msg)\n\treturn msg\n}\n\ntype Uint32Attribute struct {\n\tType uint16\n\tValue uint32\n}\n\nfunc (a *Uint32Attribute) Serialize() []byte {\n\tnative := NativeEndian()\n\tbuf := make([]byte, rtaAlignOf(8))\n\tnative.PutUint16(buf[0:2], 8)\n\tnative.PutUint16(buf[2:4], a.Type)\n\n\tif a.Type&NLA_F_NET_BYTEORDER != 0 {\n\t\tbinary.BigEndian.PutUint32(buf[4:], a.Value)\n\t} else {\n\t\tnative.PutUint32(buf[4:], a.Value)\n\t}\n\treturn buf\n}\n\nfunc (a *Uint32Attribute) Len() int {\n\treturn 8\n}\n\n// Extend RtAttr to handle data and children\ntype RtAttr struct {\n\tunix.RtAttr\n\tData []byte\n\tchildren []NetlinkRequestData\n}\n\n// Create a new Extended RtAttr object\nfunc NewRtAttr(attrType int, data []byte) *RtAttr {\n\treturn &RtAttr{\n\t\tRtAttr: unix.RtAttr{\n\t\t\tType: uint16(attrType),\n\t\t},\n\t\tchildren: []NetlinkRequestData{},\n\t\tData: data,\n\t}\n}\n\n// NewRtAttrChild adds an RtAttr as a child to the parent and returns the new attribute\n//\n// Deprecated: Use AddRtAttr() on the parent object\nfunc NewRtAttrChild(parent *RtAttr, attrType int, data []byte) *RtAttr {\n\treturn parent.AddRtAttr(attrType, data)\n}\n\n// AddRtAttr adds an RtAttr as a child and returns the new attribute\nfunc (a *RtAttr) AddRtAttr(attrType int, data []byte) *RtAttr {\n\tattr := NewRtAttr(attrType, data)\n\ta.children = append(a.children, attr)\n\treturn attr\n}\n\n// AddChild adds an existing NetlinkRequestData as a child.\nfunc (a *RtAttr) AddChild(attr NetlinkRequestData) {\n\ta.children = append(a.children, attr)\n}\n\nfunc (a *RtAttr) Len() int {\n\tif len(a.children) == 0 {\n\t\treturn (unix.SizeofRtAttr + len(a.Data))\n\t}\n\n\tl := 0\n\tfor _, child := range a.children {\n\t\tl += rtaAlignOf(child.Len())\n\t}\n\tl += unix.SizeofRtAttr\n\treturn rtaAlignOf(l + len(a.Data))\n}\n\n// Serialize the RtAttr into a byte array\n// This can't just unsafe.cast because it must iterate through children.\nfunc (a *RtAttr) Serialize() []byte {\n\tnative := NativeEndian()\n\n\tlength := a.Len()\n\tbuf := make([]byte, rtaAlignOf(length))\n\n\tnext := 4\n\tif a.Data != nil {\n\t\tcopy(buf[next:], a.Data)\n\t\tnext += rtaAlignOf(len(a.Data))\n\t}\n\tif len(a.children) > 0 {\n\t\tfor _, child := range a.children {\n\t\t\tchildBuf := child.Serialize()\n\t\t\tcopy(buf[next:], childBuf)\n\t\t\tnext += rtaAlignOf(len(childBuf))\n\t\t}\n\t}\n\n\tif l := uint16(length); l != 0 {\n\t\tnative.PutUint16(buf[0:2], l)\n\t}\n\tnative.PutUint16(buf[2:4], a.Type)\n\treturn buf\n}\n\ntype NetlinkRequest struct {\n\tunix.NlMsghdr\n\tData []NetlinkRequestData\n\tRawData []byte\n\tSockets map[int]*SocketHandle\n}\n\n// Serialize the Netlink Request into a byte array\nfunc (req *NetlinkRequest) Serialize() []byte {\n\tlength := unix.SizeofNlMsghdr\n\tdataBytes := make([][]byte, len(req.Data))\n\tfor i, data := range req.Data {\n\t\tdataBytes[i] = data.Serialize()\n\t\tlength = length + len(dataBytes[i])\n\t}\n\tlength += len(req.RawData)\n\n\treq.Len = uint32(length)\n\tb := make([]byte, length)\n\thdr := (*(*[unix.SizeofNlMsghdr]byte)(unsafe.Pointer(req)))[:]\n\tnext := unix.SizeofNlMsghdr\n\tcopy(b[0:next], hdr)\n\tfor _, data := range dataBytes {\n\t\tfor _, dataByte := range data {\n\t\t\tb[next] = dataByte\n\t\t\tnext = next + 1\n\t\t}\n\t}\n\t// Add the raw data if any\n\tif len(req.RawData) > 0 {\n\t\tcopy(b[next:length], req.RawData)\n\t}\n\treturn b\n}\n\nfunc (req *NetlinkRequest) AddData(data NetlinkRequestData) {\n\treq.Data = append(req.Data, data)\n}\n\n// AddRawData adds raw bytes to the end of the NetlinkRequest object during serialization\nfunc (req *NetlinkRequest) AddRawData(data []byte) {\n\treq.RawData = append(req.RawData, data...)\n}\n\n// Execute the request against a the given sockType.\n// Returns a list of netlink messages in serialized format, optionally filtered\n// by resType.\nfunc (req *NetlinkRequest) Execute(sockType int, resType uint16) ([][]byte, error) {\n\tvar (\n\t\ts *NetlinkSocket\n\t\terr error\n\t)\n\n\tif req.Sockets != nil {\n\t\tif sh, ok := req.Sockets[sockType]; ok {\n\t\t\ts = sh.Socket\n\t\t\treq.Seq = atomic.AddUint32(&sh.Seq, 1)\n\t\t}\n\t}\n\tsharedSocket := s != nil\n\n\tif s == nil {\n\t\ts, err = getNetlinkSocket(sockType)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\n\t\tif err := s.SetSendTimeout(&SocketTimeoutTv); err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tif err := s.SetReceiveTimeout(&SocketTimeoutTv); err != nil {\n\t\t\treturn nil, err\n\t\t}\n\n\t\tdefer s.Close()\n\t} else {\n\t\ts.Lock()\n\t\tdefer s.Unlock()\n\t}\n\n\tif err := s.Send(req); err != nil {\n\t\treturn nil, err\n\t}\n\n\tpid, err := s.GetPid()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tvar res [][]byte\n\ndone:\n\tfor {\n\t\tmsgs, from, err := s.Receive()\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tif from.Pid != PidKernel {\n\t\t\treturn nil, fmt.Errorf(\"Wrong sender portid %d, expected %d\", from.Pid, PidKernel)\n\t\t}\n\t\tfor _, m := range msgs {\n\t\t\tif m.Header.Seq != req.Seq {\n\t\t\t\tif sharedSocket {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\treturn nil, fmt.Errorf(\"Wrong Seq nr %d, expected %d\", m.Header.Seq, req.Seq)\n\t\t\t}\n\t\t\tif m.Header.Pid != pid {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif m.Header.Type == unix.NLMSG_DONE || m.Header.Type == unix.NLMSG_ERROR {\n\t\t\t\tnative := NativeEndian()\n\t\t\t\terror := int32(native.Uint32(m.Data[0:4]))\n\t\t\t\tif error == 0 {\n\t\t\t\t\tbreak done\n\t\t\t\t}\n\t\t\t\treturn nil, syscall.Errno(-error)\n\t\t\t}\n\t\t\tif resType != 0 && m.Header.Type != resType {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tres = append(res, m.Data)\n\t\t\tif m.Header.Flags&unix.NLM_F_MULTI == 0 {\n\t\t\t\tbreak done\n\t\t\t}\n\t\t}\n\t}\n\treturn res, nil\n}\n\n// Create a new netlink request from proto and flags\n// Note the Len value will be inaccurate once data is added until\n// the message is serialized\nfunc NewNetlinkRequest(proto, flags int) *NetlinkRequest {\n\treturn &NetlinkRequest{\n\t\tNlMsghdr: unix.NlMsghdr{\n\t\t\tLen: uint32(unix.SizeofNlMsghdr),\n\t\t\tType: uint16(proto),\n\t\t\tFlags: unix.NLM_F_REQUEST | uint16(flags),\n\t\t\tSeq: atomic.AddUint32(&nextSeqNr, 1),\n\t\t},\n\t}\n}\n\ntype NetlinkSocket struct {\n\tfd int32\n\tlsa unix.SockaddrNetlink\n\tsync.Mutex\n}\n\nfunc getNetlinkSocket(protocol int) (*NetlinkSocket, error) {\n\tfd, err := unix.Socket(unix.AF_NETLINK, unix.SOCK_RAW|unix.SOCK_CLOEXEC, protocol)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\ts := &NetlinkSocket{\n\t\tfd: int32(fd),\n\t}\n\ts.lsa.Family = unix.AF_NETLINK\n\tif err := unix.Bind(fd, &s.lsa); err != nil {\n\t\tunix.Close(fd)\n\t\treturn nil, err\n\t}\n\n\treturn s, nil\n}\n\n// GetNetlinkSocketAt opens a netlink socket in the network namespace newNs\n// and positions the thread back into the network namespace specified by curNs,\n// when done. If curNs is close, the function derives the current namespace and\n// moves back into it when done. If newNs is close, the socket will be opened\n// in the current network namespace.\nfunc GetNetlinkSocketAt(newNs, curNs netns.NsHandle, protocol int) (*NetlinkSocket, error) {\n\tc, err := executeInNetns(newNs, curNs)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tdefer c()\n\treturn getNetlinkSocket(protocol)\n}\n\n// executeInNetns sets execution of the code following this call to the\n// network namespace newNs, then moves the thread back to curNs if open,\n// otherwise to the current netns at the time the function was invoked\n// In case of success, the caller is expected to execute the returned function\n// at the end of the code that needs to be executed in the network namespace.\n// Example:\n// func jobAt(...) error {\n// d, err := executeInNetns(...)\n// if err != nil { return err}\n// defer d()\n// < code which needs to be executed in specific netns>\n// }\n// TODO: his function probably belongs to netns pkg.\nfunc executeInNetns(newNs, curNs netns.NsHandle) (func(), error) {\n\tvar (\n\t\terr error\n\t\tmoveBack func(netns.NsHandle) error\n\t\tcloseNs func() error\n\t\tunlockThd func()\n\t)\n\trestore := func() {\n\t\t// order matters\n\t\tif moveBack != nil {\n\t\t\tmoveBack(curNs)\n\t\t}\n\t\tif closeNs != nil {\n\t\t\tcloseNs()\n\t\t}\n\t\tif unlockThd != nil {\n\t\t\tunlockThd()\n\t\t}\n\t}\n\tif newNs.IsOpen() {\n\t\truntime.LockOSThread()\n\t\tunlockThd = runtime.UnlockOSThread\n\t\tif !curNs.IsOpen() {\n\t\t\tif curNs, err = netns.Get(); err != nil {\n\t\t\t\trestore()\n\t\t\t\treturn nil, fmt.Errorf(\"could not get current namespace while creating netlink socket: %v\", err)\n\t\t\t}\n\t\t\tcloseNs = curNs.Close\n\t\t}\n\t\tif err := netns.Set(newNs); err != nil {\n\t\t\trestore()\n\t\t\treturn nil, fmt.Errorf(\"failed to set into network namespace %d while creating netlink socket: %v\", newNs, err)\n\t\t}\n\t\tmoveBack = netns.Set\n\t}\n\treturn restore, nil\n}\n\n// Create a netlink socket with a given protocol (e.g. NETLINK_ROUTE)\n// and subscribe it to multicast groups passed in variable argument list.\n// Returns the netlink socket on which Receive() method can be called\n// to retrieve the messages from the kernel.\nfunc Subscribe(protocol int, groups ...uint) (*NetlinkSocket, error) {\n\tfd, err := unix.Socket(unix.AF_NETLINK, unix.SOCK_RAW, protocol)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\ts := &NetlinkSocket{\n\t\tfd: int32(fd),\n\t}\n\ts.lsa.Family = unix.AF_NETLINK\n\n\tfor _, g := range groups {\n\t\ts.lsa.Groups |= (1 << (g - 1))\n\t}\n\n\tif err := unix.Bind(fd, &s.lsa); err != nil {\n\t\tunix.Close(fd)\n\t\treturn nil, err\n\t}\n\n\treturn s, nil\n}\n\n// SubscribeAt works like Subscribe plus let's the caller choose the network\n// namespace in which the socket would be opened (newNs). Then control goes back\n// to curNs if open, otherwise to the netns at the time this function was called.\nfunc SubscribeAt(newNs, curNs netns.NsHandle, protocol int, groups ...uint) (*NetlinkSocket, error) {\n\tc, err := executeInNetns(newNs, curNs)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tdefer c()\n\treturn Subscribe(protocol, groups...)\n}\n\nfunc (s *NetlinkSocket) Close() {\n\tfd := int(atomic.SwapInt32(&s.fd, -1))\n\tunix.Close(fd)\n}\n\nfunc (s *NetlinkSocket) GetFd() int {\n\treturn int(atomic.LoadInt32(&s.fd))\n}\n\nfunc (s *NetlinkSocket) Send(request *NetlinkRequest) error {\n\tfd := int(atomic.LoadInt32(&s.fd))\n\tif fd < 0 {\n\t\treturn fmt.Errorf(\"Send called on a closed socket\")\n\t}\n\tif err := unix.Sendto(fd, request.Serialize(), 0, &s.lsa); err != nil {\n\t\treturn err\n\t}\n\treturn nil\n}\n\nfunc (s *NetlinkSocket) Receive() ([]syscall.NetlinkMessage, *unix.SockaddrNetlink, error) {\n\tfd := int(atomic.LoadInt32(&s.fd))\n\tif fd < 0 {\n\t\treturn nil, nil, fmt.Errorf(\"Receive called on a closed socket\")\n\t}\n\tvar fromAddr *unix.SockaddrNetlink\n\tvar rb [RECEIVE_BUFFER_SIZE]byte\n\tnr, from, err := unix.Recvfrom(fd, rb[:], 0)\n\tif err != nil {\n\t\treturn nil, nil, err\n\t}\n\tfromAddr, ok := from.(*unix.SockaddrNetlink)\n\tif !ok {\n\t\treturn nil, nil, fmt.Errorf(\"Error converting to netlink sockaddr\")\n\t}\n\tif nr < unix.NLMSG_HDRLEN {\n\t\treturn nil, nil, fmt.Errorf(\"Got short response from netlink\")\n\t}\n\trb2 := make([]byte, nr)\n\tcopy(rb2, rb[:nr])\n\tnl, err := syscall.ParseNetlinkMessage(rb2)\n\tif err != nil {\n\t\treturn nil, nil, err\n\t}\n\treturn nl, fromAddr, nil\n}\n\n// SetSendTimeout allows to set a send timeout on the socket\nfunc (s *NetlinkSocket) SetSendTimeout(timeout *unix.Timeval) error {\n\t// Set a send timeout of SOCKET_SEND_TIMEOUT, this will allow the Send to periodically unblock and avoid that a routine\n\t// remains stuck on a send on a closed fd\n\treturn unix.SetsockoptTimeval(int(s.fd), unix.SOL_SOCKET, unix.SO_SNDTIMEO, timeout)\n}\n\n// SetReceiveTimeout allows to set a receive timeout on the socket\nfunc (s *NetlinkSocket) SetReceiveTimeout(timeout *unix.Timeval) error {\n\t// Set a read timeout of SOCKET_READ_TIMEOUT, this will allow the Read to periodically unblock and avoid that a routine\n\t// remains stuck on a recvmsg on a closed fd\n\treturn unix.SetsockoptTimeval(int(s.fd), unix.SOL_SOCKET, unix.SO_RCVTIMEO, timeout)\n}\n\nfunc (s *NetlinkSocket) GetPid() (uint32, error) {\n\tfd := int(atomic.LoadInt32(&s.fd))\n\tlsa, err := unix.Getsockname(fd)\n\tif err != nil {\n\t\treturn 0, err\n\t}\n\tswitch v := lsa.(type) {\n\tcase *unix.SockaddrNetlink:\n\t\treturn v.Pid, nil\n\t}\n\treturn 0, fmt.Errorf(\"Wrong socket type\")\n}\n\nfunc ZeroTerminated(s string) []byte {\n\tbytes := make([]byte, len(s)+1)\n\tfor i := 0; i < len(s); i++ {\n\t\tbytes[i] = s[i]\n\t}\n\tbytes[len(s)] = 0\n\treturn bytes\n}\n\nfunc NonZeroTerminated(s string) []byte {\n\tbytes := make([]byte, len(s))\n\tfor i := 0; i < len(s); i++ {\n\t\tbytes[i] = s[i]\n\t}\n\treturn bytes\n}\n\nfunc BytesToString(b []byte) string {\n\tn := bytes.Index(b, []byte{0})\n\treturn string(b[:n])\n}\n\nfunc Uint8Attr(v uint8) []byte {\n\treturn []byte{byte(v)}\n}\n\nfunc Uint16Attr(v uint16) []byte {\n\tnative := NativeEndian()\n\tbytes := make([]byte, 2)\n\tnative.PutUint16(bytes, v)\n\treturn bytes\n}\n\nfunc Uint32Attr(v uint32) []byte {\n\tnative := NativeEndian()\n\tbytes := make([]byte, 4)\n\tnative.PutUint32(bytes, v)\n\treturn bytes\n}\n\nfunc Uint64Attr(v uint64) []byte {\n\tnative := NativeEndian()\n\tbytes := make([]byte, 8)\n\tnative.PutUint64(bytes, v)\n\treturn bytes\n}\n\nfunc ParseRouteAttr(b []byte) ([]syscall.NetlinkRouteAttr, error) {\n\tvar attrs []syscall.NetlinkRouteAttr\n\tfor len(b) >= unix.SizeofRtAttr {\n\t\ta, vbuf, alen, err := netlinkRouteAttrAndValue(b)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tra := syscall.NetlinkRouteAttr{Attr: syscall.RtAttr(*a), Value: vbuf[:int(a.Len)-unix.SizeofRtAttr]}\n\t\tattrs = append(attrs, ra)\n\t\tb = b[alen:]\n\t}\n\treturn attrs, nil\n}\n\nfunc netlinkRouteAttrAndValue(b []byte) (*unix.RtAttr, []byte, int, error) {\n\ta := (*unix.RtAttr)(unsafe.Pointer(&b[0]))\n\tif int(a.Len) < unix.SizeofRtAttr || int(a.Len) > len(b) {\n\t\treturn nil, nil, 0, unix.EINVAL\n\t}\n\treturn a, b[unix.SizeofRtAttr:], rtaAlignOf(int(a.Len)), nil\n}\n\n// SocketHandle contains the netlink socket and the associated\n// sequence counter for a specific netlink family\ntype SocketHandle struct {\n\tSeq uint32\n\tSocket *NetlinkSocket\n}\n\n// Close closes the netlink socket\nfunc (sh *SocketHandle) Close() {\n\tif sh.Socket != nil {\n\t\tsh.Socket.Close()\n\t}\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/nl/nl_unspecified.go", "content": "// +build !linux\n\npackage nl\n\nimport \"encoding/binary\"\n\nvar SupportedNlFamilies = []int{}\n\nfunc NativeEndian() binary.ByteOrder {\n\treturn nil\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/nl/parse_attr_linux.go", "content": "package nl\n\nimport (\n\t\"encoding/binary\"\n\t\"fmt\"\n\t\"log\"\n)\n\ntype Attribute struct {\n\tType uint16\n\tValue []byte\n}\n\nfunc ParseAttributes(data []byte) <-chan Attribute {\n\tnative := NativeEndian()\n\tresult := make(chan Attribute)\n\n\tgo func() {\n\t\ti := 0\n\t\tfor i+4 < len(data) {\n\t\t\tlength := int(native.Uint16(data[i : i+2]))\n\t\t\tattrType := native.Uint16(data[i+2 : i+4])\n\n\t\t\tif length < 4 {\n\t\t\t\tlog.Printf(\"attribute 0x%02x has invalid length of %d bytes\", attrType, length)\n\t\t\t\tbreak\n\t\t\t}\n\n\t\t\tif len(data) < i+length {\n\t\t\t\tlog.Printf(\"attribute 0x%02x of length %d is truncated, only %d bytes remaining\", attrType, length, len(data)-i)\n\t\t\t\tbreak\n\t\t\t}\n\n\t\t\tresult <- Attribute{\n\t\t\t\tType: attrType,\n\t\t\t\tValue: data[i+4 : i+length],\n\t\t\t}\n\t\t\ti += rtaAlignOf(length)\n\t\t}\n\t\tclose(result)\n\t}()\n\n\treturn result\n}\n\nfunc PrintAttributes(data []byte) {\n\tprintAttributes(data, 0)\n}\n\nfunc printAttributes(data []byte, level int) {\n\tfor attr := range ParseAttributes(data) {\n\t\tfor i := 0; i < level; i++ {\n\t\t\tprint(\"> \")\n\t\t}\n\t\tnested := attr.Type&NLA_F_NESTED != 0\n\t\tfmt.Printf(\"type=%d nested=%v len=%v %v\\n\", attr.Type&NLA_TYPE_MASK, nested, len(attr.Value), attr.Value)\n\t\tif nested {\n\t\t\tprintAttributes(attr.Value, level+1)\n\t\t}\n\t}\n}\n\n// Uint32 returns the uint32 value respecting the NET_BYTEORDER flag\nfunc (attr *Attribute) Uint32() uint32 {\n\tif attr.Type&NLA_F_NET_BYTEORDER != 0 {\n\t\treturn binary.BigEndian.Uint32(attr.Value)\n\t} else {\n\t\treturn NativeEndian().Uint32(attr.Value)\n\t}\n}\n\n// Uint64 returns the uint64 value respecting the NET_BYTEORDER flag\nfunc (attr *Attribute) Uint64() uint64 {\n\tif attr.Type&NLA_F_NET_BYTEORDER != 0 {\n\t\treturn binary.BigEndian.Uint64(attr.Value)\n\t} else {\n\t\treturn NativeEndian().Uint64(attr.Value)\n\t}\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/nl/rdma_link_linux.go", "content": "package nl\n\nconst (\n\tRDMA_NL_GET_CLIENT_SHIFT = 10\n)\n\nconst (\n\tRDMA_NL_NLDEV = 5\n)\n\nconst (\n\tRDMA_NLDEV_CMD_GET = 1\n\tRDMA_NLDEV_CMD_SET = 2\n\tRDMA_NLDEV_CMD_SYS_GET = 6\n\tRDMA_NLDEV_CMD_SYS_SET = 7\n)\n\nconst (\n\tRDMA_NLDEV_ATTR_DEV_INDEX = 1\n\tRDMA_NLDEV_ATTR_DEV_NAME = 2\n\tRDMA_NLDEV_ATTR_PORT_INDEX = 3\n\tRDMA_NLDEV_ATTR_CAP_FLAGS = 4\n\tRDMA_NLDEV_ATTR_FW_VERSION = 5\n\tRDMA_NLDEV_ATTR_NODE_GUID = 6\n\tRDMA_NLDEV_ATTR_SYS_IMAGE_GUID = 7\n\tRDMA_NLDEV_ATTR_SUBNET_PREFIX = 8\n\tRDMA_NLDEV_ATTR_LID = 9\n\tRDMA_NLDEV_ATTR_SM_LID = 10\n\tRDMA_NLDEV_ATTR_LMC = 11\n\tRDMA_NLDEV_ATTR_PORT_STATE = 12\n\tRDMA_NLDEV_ATTR_PORT_PHYS_STATE = 13\n\tRDMA_NLDEV_ATTR_DEV_NODE_TYPE = 14\n\tRDMA_NLDEV_SYS_ATTR_NETNS_MODE = 66\n\tRDMA_NLDEV_NET_NS_FD = 68\n)\n" }, { "path": "vendor/github.com/vishvananda/netlink/nl/route_linux.go", "content": "package nl\n\nimport (\n\t\"unsafe\"\n\n\t\"golang.org/x/sys/unix\"\n)\n\ntype RtMsg struct {\n\tunix.RtMsg\n}\n\nfunc NewRtMsg() *RtMsg {\n\treturn &RtMsg{\n\t\tRtMsg: unix.RtMsg{\n\t\t\tTable: unix.RT_TABLE_MAIN,\n\t\t\tScope: unix.RT_SCOPE_UNIVERSE,\n\t\t\tProtocol: unix.RTPROT_BOOT,\n\t\t\tType: unix.RTN_UNICAST,\n\t\t},\n\t}\n}\n\nfunc NewRtDelMsg() *RtMsg {\n\treturn &RtMsg{\n\t\tRtMsg: unix.RtMsg{\n\t\t\tTable: unix.RT_TABLE_MAIN,\n\t\t\tScope: unix.RT_SCOPE_NOWHERE,\n\t\t},\n\t}\n}\n\nfunc (msg *RtMsg) Len() int {\n\treturn unix.SizeofRtMsg\n}\n\nfunc DeserializeRtMsg(b []byte) *RtMsg {\n\treturn (*RtMsg)(unsafe.Pointer(&b[0:unix.SizeofRtMsg][0]))\n}\n\nfunc (msg *RtMsg) Serialize() []byte {\n\treturn (*(*[unix.SizeofRtMsg]byte)(unsafe.Pointer(msg)))[:]\n}\n\ntype RtNexthop struct {\n\tunix.RtNexthop\n\tChildren []NetlinkRequestData\n}\n\nfunc DeserializeRtNexthop(b []byte) *RtNexthop {\n\treturn (*RtNexthop)(unsafe.Pointer(&b[0:unix.SizeofRtNexthop][0]))\n}\n\nfunc (msg *RtNexthop) Len() int {\n\tif len(msg.Children) == 0 {\n\t\treturn unix.SizeofRtNexthop\n\t}\n\n\tl := 0\n\tfor _, child := range msg.Children {\n\t\tl += rtaAlignOf(child.Len())\n\t}\n\tl += unix.SizeofRtNexthop\n\treturn rtaAlignOf(l)\n}\n\nfunc (msg *RtNexthop) Serialize() []byte {\n\tlength := msg.Len()\n\tmsg.RtNexthop.Len = uint16(length)\n\tbuf := make([]byte, length)\n\tcopy(buf, (*(*[unix.SizeofRtNexthop]byte)(unsafe.Pointer(msg)))[:])\n\tnext := rtaAlignOf(unix.SizeofRtNexthop)\n\tif len(msg.Children) > 0 {\n\t\tfor _, child := range msg.Children {\n\t\t\tchildBuf := child.Serialize()\n\t\t\tcopy(buf[next:], childBuf)\n\t\t\tnext += rtaAlignOf(len(childBuf))\n\t\t}\n\t}\n\treturn buf\n}\n\ntype RtGenMsg struct {\n\tunix.RtGenmsg\n}\n\nfunc NewRtGenMsg() *RtGenMsg {\n\treturn &RtGenMsg{\n\t\tRtGenmsg: unix.RtGenmsg{\n\t\t\tFamily: unix.AF_UNSPEC,\n\t\t},\n\t}\n}\n\nfunc (msg *RtGenMsg) Len() int {\n\treturn rtaAlignOf(unix.SizeofRtGenmsg)\n}\n\nfunc DeserializeRtGenMsg(b []byte) *RtGenMsg {\n\treturn &RtGenMsg{RtGenmsg: unix.RtGenmsg{Family: b[0]}}\n}\n\nfunc (msg *RtGenMsg) Serialize() []byte {\n\tout := make([]byte, msg.Len())\n\tout[0] = msg.Family\n\treturn out\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/nl/seg6_linux.go", "content": "package nl\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"net\"\n)\n\ntype IPv6SrHdr struct {\n\tnextHdr uint8\n\thdrLen uint8\n\troutingType uint8\n\tsegmentsLeft uint8\n\tfirstSegment uint8\n\tflags uint8\n\treserved uint16\n\n\tSegments []net.IP\n}\n\nfunc (s1 *IPv6SrHdr) Equal(s2 IPv6SrHdr) bool {\n\tif len(s1.Segments) != len(s2.Segments) {\n\t\treturn false\n\t}\n\tfor i := range s1.Segments {\n\t\tif s1.Segments[i].Equal(s2.Segments[i]) != true {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn s1.nextHdr == s2.nextHdr &&\n\t\ts1.hdrLen == s2.hdrLen &&\n\t\ts1.routingType == s2.routingType &&\n\t\ts1.segmentsLeft == s2.segmentsLeft &&\n\t\ts1.firstSegment == s2.firstSegment &&\n\t\ts1.flags == s2.flags\n\t// reserved doesn't need to be identical.\n}\n\n// seg6 encap mode\nconst (\n\tSEG6_IPTUN_MODE_INLINE = iota\n\tSEG6_IPTUN_MODE_ENCAP\n)\n\n// number of nested RTATTR\n// from include/uapi/linux/seg6_iptunnel.h\nconst (\n\tSEG6_IPTUNNEL_UNSPEC = iota\n\tSEG6_IPTUNNEL_SRH\n\t__SEG6_IPTUNNEL_MAX\n)\nconst (\n\tSEG6_IPTUNNEL_MAX = __SEG6_IPTUNNEL_MAX - 1\n)\n\nfunc EncodeSEG6Encap(mode int, segments []net.IP) ([]byte, error) {\n\tnsegs := len(segments) // nsegs: number of segments\n\tif nsegs == 0 {\n\t\treturn nil, errors.New(\"EncodeSEG6Encap: No Segment in srh\")\n\t}\n\tb := make([]byte, 12, 12+len(segments)*16)\n\tnative := NativeEndian()\n\tnative.PutUint32(b, uint32(mode))\n\tb[4] = 0 // srh.nextHdr (0 when calling netlink)\n\tb[5] = uint8(16 * nsegs >> 3) // srh.hdrLen (in 8-octets unit)\n\tb[6] = IPV6_SRCRT_TYPE_4 // srh.routingType (assigned by IANA)\n\tb[7] = uint8(nsegs - 1) // srh.segmentsLeft\n\tb[8] = uint8(nsegs - 1) // srh.firstSegment\n\tb[9] = 0 // srh.flags (SR6_FLAG1_HMAC for srh_hmac)\n\t// srh.reserved: Defined as \"Tag\" in draft-ietf-6man-segment-routing-header-07\n\tnative.PutUint16(b[10:], 0) // srh.reserved\n\tfor _, netIP := range segments {\n\t\tb = append(b, netIP...) // srh.Segments\n\t}\n\treturn b, nil\n}\n\nfunc DecodeSEG6Encap(buf []byte) (int, []net.IP, error) {\n\tnative := NativeEndian()\n\tmode := int(native.Uint32(buf))\n\tsrh := IPv6SrHdr{\n\t\tnextHdr: buf[4],\n\t\thdrLen: buf[5],\n\t\troutingType: buf[6],\n\t\tsegmentsLeft: buf[7],\n\t\tfirstSegment: buf[8],\n\t\tflags: buf[9],\n\t\treserved: native.Uint16(buf[10:12]),\n\t}\n\tbuf = buf[12:]\n\tif len(buf)%16 != 0 {\n\t\terr := fmt.Errorf(\"DecodeSEG6Encap: error parsing Segment List (buf len: %d)\\n\", len(buf))\n\t\treturn mode, nil, err\n\t}\n\tfor len(buf) > 0 {\n\t\tsrh.Segments = append(srh.Segments, net.IP(buf[:16]))\n\t\tbuf = buf[16:]\n\t}\n\treturn mode, srh.Segments, nil\n}\n\nfunc DecodeSEG6Srh(buf []byte) ([]net.IP, error) {\n\tnative := NativeEndian()\n\tsrh := IPv6SrHdr{\n\t\tnextHdr: buf[0],\n\t\thdrLen: buf[1],\n\t\troutingType: buf[2],\n\t\tsegmentsLeft: buf[3],\n\t\tfirstSegment: buf[4],\n\t\tflags: buf[5],\n\t\treserved: native.Uint16(buf[6:8]),\n\t}\n\tbuf = buf[8:]\n\tif len(buf)%16 != 0 {\n\t\terr := fmt.Errorf(\"DecodeSEG6Srh: error parsing Segment List (buf len: %d)\", len(buf))\n\t\treturn nil, err\n\t}\n\tfor len(buf) > 0 {\n\t\tsrh.Segments = append(srh.Segments, net.IP(buf[:16]))\n\t\tbuf = buf[16:]\n\t}\n\treturn srh.Segments, nil\n}\nfunc EncodeSEG6Srh(segments []net.IP) ([]byte, error) {\n\tnsegs := len(segments) // nsegs: number of segments\n\tif nsegs == 0 {\n\t\treturn nil, errors.New(\"EncodeSEG6Srh: No Segments\")\n\t}\n\tb := make([]byte, 8, 8+len(segments)*16)\n\tnative := NativeEndian()\n\tb[0] = 0 // srh.nextHdr (0 when calling netlink)\n\tb[1] = uint8(16 * nsegs >> 3) // srh.hdrLen (in 8-octets unit)\n\tb[2] = IPV6_SRCRT_TYPE_4 // srh.routingType (assigned by IANA)\n\tb[3] = uint8(nsegs - 1) // srh.segmentsLeft\n\tb[4] = uint8(nsegs - 1) // srh.firstSegment\n\tb[5] = 0 // srh.flags (SR6_FLAG1_HMAC for srh_hmac)\n\t// srh.reserved: Defined as \"Tag\" in draft-ietf-6man-segment-routing-header-07\n\tnative.PutUint16(b[6:], 0) // srh.reserved\n\tfor _, netIP := range segments {\n\t\tb = append(b, netIP...) // srh.Segments\n\t}\n\treturn b, nil\n}\n\n// Helper functions\nfunc SEG6EncapModeString(mode int) string {\n\tswitch mode {\n\tcase SEG6_IPTUN_MODE_INLINE:\n\t\treturn \"inline\"\n\tcase SEG6_IPTUN_MODE_ENCAP:\n\t\treturn \"encap\"\n\t}\n\treturn \"unknown\"\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/nl/seg6local_linux.go", "content": "package nl\n\nimport ()\n\n// seg6local parameters\nconst (\n\tSEG6_LOCAL_UNSPEC = iota\n\tSEG6_LOCAL_ACTION\n\tSEG6_LOCAL_SRH\n\tSEG6_LOCAL_TABLE\n\tSEG6_LOCAL_NH4\n\tSEG6_LOCAL_NH6\n\tSEG6_LOCAL_IIF\n\tSEG6_LOCAL_OIF\n\t__SEG6_LOCAL_MAX\n)\nconst (\n\tSEG6_LOCAL_MAX = __SEG6_LOCAL_MAX\n)\n\n// seg6local actions\nconst (\n\tSEG6_LOCAL_ACTION_END = iota + 1 // 1\n\tSEG6_LOCAL_ACTION_END_X // 2\n\tSEG6_LOCAL_ACTION_END_T // 3\n\tSEG6_LOCAL_ACTION_END_DX2 // 4\n\tSEG6_LOCAL_ACTION_END_DX6 // 5\n\tSEG6_LOCAL_ACTION_END_DX4 // 6\n\tSEG6_LOCAL_ACTION_END_DT6 // 7\n\tSEG6_LOCAL_ACTION_END_DT4 // 8\n\tSEG6_LOCAL_ACTION_END_B6 // 9\n\tSEG6_LOCAL_ACTION_END_B6_ENCAPS // 10\n\tSEG6_LOCAL_ACTION_END_BM // 11\n\tSEG6_LOCAL_ACTION_END_S // 12\n\tSEG6_LOCAL_ACTION_END_AS // 13\n\tSEG6_LOCAL_ACTION_END_AM // 14\n\t__SEG6_LOCAL_ACTION_MAX\n)\nconst (\n\tSEG6_LOCAL_ACTION_MAX = __SEG6_LOCAL_ACTION_MAX - 1\n)\n\n// Helper functions\nfunc SEG6LocalActionString(action int) string {\n\tswitch action {\n\tcase SEG6_LOCAL_ACTION_END:\n\t\treturn \"End\"\n\tcase SEG6_LOCAL_ACTION_END_X:\n\t\treturn \"End.X\"\n\tcase SEG6_LOCAL_ACTION_END_T:\n\t\treturn \"End.T\"\n\tcase SEG6_LOCAL_ACTION_END_DX2:\n\t\treturn \"End.DX2\"\n\tcase SEG6_LOCAL_ACTION_END_DX6:\n\t\treturn \"End.DX6\"\n\tcase SEG6_LOCAL_ACTION_END_DX4:\n\t\treturn \"End.DX4\"\n\tcase SEG6_LOCAL_ACTION_END_DT6:\n\t\treturn \"End.DT6\"\n\tcase SEG6_LOCAL_ACTION_END_DT4:\n\t\treturn \"End.DT4\"\n\tcase SEG6_LOCAL_ACTION_END_B6:\n\t\treturn \"End.B6\"\n\tcase SEG6_LOCAL_ACTION_END_B6_ENCAPS:\n\t\treturn \"End.B6.Encaps\"\n\tcase SEG6_LOCAL_ACTION_END_BM:\n\t\treturn \"End.BM\"\n\tcase SEG6_LOCAL_ACTION_END_S:\n\t\treturn \"End.S\"\n\tcase SEG6_LOCAL_ACTION_END_AS:\n\t\treturn \"End.AS\"\n\tcase SEG6_LOCAL_ACTION_END_AM:\n\t\treturn \"End.AM\"\n\t}\n\treturn \"unknown\"\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/nl/syscall.go", "content": "package nl\n\n// syscall package lack of rule atributes type.\n// Thus there are defined below\nconst (\n\tFRA_UNSPEC = iota\n\tFRA_DST /* destination address */\n\tFRA_SRC /* source address */\n\tFRA_IIFNAME /* interface name */\n\tFRA_GOTO /* target to jump to (FR_ACT_GOTO) */\n\tFRA_UNUSED2\n\tFRA_PRIORITY /* priority/preference */\n\tFRA_UNUSED3\n\tFRA_UNUSED4\n\tFRA_UNUSED5\n\tFRA_FWMARK /* mark */\n\tFRA_FLOW /* flow/class id */\n\tFRA_TUN_ID\n\tFRA_SUPPRESS_IFGROUP\n\tFRA_SUPPRESS_PREFIXLEN\n\tFRA_TABLE /* Extended table id */\n\tFRA_FWMASK /* mask for netfilter mark */\n\tFRA_OIFNAME\n\tFRA_PAD\n\tFRA_L3MDEV /* iif or oif is l3mdev goto its table */\n\tFRA_UID_RANGE /* UID range */\n\tFRA_PROTOCOL /* Originator of the rule */\n\tFRA_IP_PROTO /* ip proto */\n\tFRA_SPORT_RANGE /* sport */\n\tFRA_DPORT_RANGE /* dport */\n)\n\n// ip rule netlink request types\nconst (\n\tFR_ACT_UNSPEC = iota\n\tFR_ACT_TO_TBL /* Pass to fixed table */\n\tFR_ACT_GOTO /* Jump to another rule */\n\tFR_ACT_NOP /* No operation */\n\tFR_ACT_RES3\n\tFR_ACT_RES4\n\tFR_ACT_BLACKHOLE /* Drop without notification */\n\tFR_ACT_UNREACHABLE /* Drop with ENETUNREACH */\n\tFR_ACT_PROHIBIT /* Drop with EACCES */\n)\n\n// socket diags related\nconst (\n\tSOCK_DIAG_BY_FAMILY = 20 /* linux.sock_diag.h */\n\tTCPDIAG_NOCOOKIE = 0xFFFFFFFF /* TCPDIAG_NOCOOKIE in net/ipv4/tcp_diag.h*/\n)\n\n// RTA_ENCAP subtype\nconst (\n\tMPLS_IPTUNNEL_UNSPEC = iota\n\tMPLS_IPTUNNEL_DST\n)\n\n// light weight tunnel encap types\nconst (\n\tLWTUNNEL_ENCAP_NONE = iota\n\tLWTUNNEL_ENCAP_MPLS\n\tLWTUNNEL_ENCAP_IP\n\tLWTUNNEL_ENCAP_ILA\n\tLWTUNNEL_ENCAP_IP6\n\tLWTUNNEL_ENCAP_SEG6\n\tLWTUNNEL_ENCAP_BPF\n\tLWTUNNEL_ENCAP_SEG6_LOCAL\n)\n\n// routing header types\nconst (\n\tIPV6_SRCRT_STRICT = 0x01 // Deprecated; will be removed\n\tIPV6_SRCRT_TYPE_0 = 0 // Deprecated; will be removed\n\tIPV6_SRCRT_TYPE_2 = 2 // IPv6 type 2 Routing Header\n\tIPV6_SRCRT_TYPE_4 = 4 // Segment Routing with IPv6\n)\n" }, { "path": "vendor/github.com/vishvananda/netlink/nl/tc_linux.go", "content": "package nl\n\nimport (\n\t\"encoding/binary\"\n\t\"unsafe\"\n)\n\n// LinkLayer\nconst (\n\tLINKLAYER_UNSPEC = iota\n\tLINKLAYER_ETHERNET\n\tLINKLAYER_ATM\n)\n\n// ATM\nconst (\n\tATM_CELL_PAYLOAD = 48\n\tATM_CELL_SIZE = 53\n)\n\nconst TC_LINKLAYER_MASK = 0x0F\n\n// Police\nconst (\n\tTCA_POLICE_UNSPEC = iota\n\tTCA_POLICE_TBF\n\tTCA_POLICE_RATE\n\tTCA_POLICE_PEAKRATE\n\tTCA_POLICE_AVRATE\n\tTCA_POLICE_RESULT\n\tTCA_POLICE_MAX = TCA_POLICE_RESULT\n)\n\n// Message types\nconst (\n\tTCA_UNSPEC = iota\n\tTCA_KIND\n\tTCA_OPTIONS\n\tTCA_STATS\n\tTCA_XSTATS\n\tTCA_RATE\n\tTCA_FCNT\n\tTCA_STATS2\n\tTCA_STAB\n\tTCA_MAX = TCA_STAB\n)\n\nconst (\n\tTCA_ACT_TAB = 1\n\tTCAA_MAX = 1\n)\n\nconst (\n\tTCA_ACT_UNSPEC = iota\n\tTCA_ACT_KIND\n\tTCA_ACT_OPTIONS\n\tTCA_ACT_INDEX\n\tTCA_ACT_STATS\n\tTCA_ACT_MAX\n)\n\nconst (\n\tTCA_PRIO_UNSPEC = iota\n\tTCA_PRIO_MQ\n\tTCA_PRIO_MAX = TCA_PRIO_MQ\n)\n\nconst (\n\tTCA_STATS_UNSPEC = iota\n\tTCA_STATS_BASIC\n\tTCA_STATS_RATE_EST\n\tTCA_STATS_QUEUE\n\tTCA_STATS_APP\n\tTCA_STATS_MAX = TCA_STATS_APP\n)\n\nconst (\n\tSizeofTcMsg = 0x14\n\tSizeofTcActionMsg = 0x04\n\tSizeofTcPrioMap = 0x14\n\tSizeofTcRateSpec = 0x0c\n\tSizeofTcNetemQopt = 0x18\n\tSizeofTcNetemCorr = 0x0c\n\tSizeofTcNetemReorder = 0x08\n\tSizeofTcNetemCorrupt = 0x08\n\tSizeofTcTbfQopt = 2*SizeofTcRateSpec + 0x0c\n\tSizeofTcHtbCopt = 2*SizeofTcRateSpec + 0x14\n\tSizeofTcHtbGlob = 0x14\n\tSizeofTcU32Key = 0x10\n\tSizeofTcU32Sel = 0x10 // without keys\n\tSizeofTcGen = 0x14\n\tSizeofTcConnmark = SizeofTcGen + 0x04\n\tSizeofTcMirred = SizeofTcGen + 0x08\n\tSizeofTcTunnelKey = SizeofTcGen + 0x04\n\tSizeofTcSkbEdit = SizeofTcGen\n\tSizeofTcPolice = 2*SizeofTcRateSpec + 0x20\n\tSizeofTcSfqQopt = 0x0b\n\tSizeofTcSfqRedStats = 0x18\n\tSizeofTcSfqQoptV1 = SizeofTcSfqQopt + SizeofTcSfqRedStats + 0x1c\n)\n\n// struct tcmsg {\n// unsigned char tcm_family;\n// unsigned char tcm__pad1;\n// unsigned short tcm__pad2;\n// int tcm_ifindex;\n// __u32 tcm_handle;\n// __u32 tcm_parent;\n// __u32 tcm_info;\n// };\n\ntype TcMsg struct {\n\tFamily uint8\n\tPad [3]byte\n\tIfindex int32\n\tHandle uint32\n\tParent uint32\n\tInfo uint32\n}\n\nfunc (msg *TcMsg) Len() int {\n\treturn SizeofTcMsg\n}\n\nfunc DeserializeTcMsg(b []byte) *TcMsg {\n\treturn (*TcMsg)(unsafe.Pointer(&b[0:SizeofTcMsg][0]))\n}\n\nfunc (x *TcMsg) Serialize() []byte {\n\treturn (*(*[SizeofTcMsg]byte)(unsafe.Pointer(x)))[:]\n}\n\n// struct tcamsg {\n// unsigned char tca_family;\n// unsigned char tca__pad1;\n// unsigned short tca__pad2;\n// };\n\ntype TcActionMsg struct {\n\tFamily uint8\n\tPad [3]byte\n}\n\nfunc (msg *TcActionMsg) Len() int {\n\treturn SizeofTcActionMsg\n}\n\nfunc DeserializeTcActionMsg(b []byte) *TcActionMsg {\n\treturn (*TcActionMsg)(unsafe.Pointer(&b[0:SizeofTcActionMsg][0]))\n}\n\nfunc (x *TcActionMsg) Serialize() []byte {\n\treturn (*(*[SizeofTcActionMsg]byte)(unsafe.Pointer(x)))[:]\n}\n\nconst (\n\tTC_PRIO_MAX = 15\n)\n\n// struct tc_prio_qopt {\n// \tint bands; /* Number of bands */\n// \t__u8 priomap[TC_PRIO_MAX+1]; /* Map: logical priority -> PRIO band */\n// };\n\ntype TcPrioMap struct {\n\tBands int32\n\tPriomap [TC_PRIO_MAX + 1]uint8\n}\n\nfunc (msg *TcPrioMap) Len() int {\n\treturn SizeofTcPrioMap\n}\n\nfunc DeserializeTcPrioMap(b []byte) *TcPrioMap {\n\treturn (*TcPrioMap)(unsafe.Pointer(&b[0:SizeofTcPrioMap][0]))\n}\n\nfunc (x *TcPrioMap) Serialize() []byte {\n\treturn (*(*[SizeofTcPrioMap]byte)(unsafe.Pointer(x)))[:]\n}\n\nconst (\n\tTCA_TBF_UNSPEC = iota\n\tTCA_TBF_PARMS\n\tTCA_TBF_RTAB\n\tTCA_TBF_PTAB\n\tTCA_TBF_RATE64\n\tTCA_TBF_PRATE64\n\tTCA_TBF_BURST\n\tTCA_TBF_PBURST\n\tTCA_TBF_MAX = TCA_TBF_PBURST\n)\n\n// struct tc_ratespec {\n// unsigned char cell_log;\n// __u8 linklayer; /* lower 4 bits */\n// unsigned short overhead;\n// short cell_align;\n// unsigned short mpu;\n// __u32 rate;\n// };\n\ntype TcRateSpec struct {\n\tCellLog uint8\n\tLinklayer uint8\n\tOverhead uint16\n\tCellAlign int16\n\tMpu uint16\n\tRate uint32\n}\n\nfunc (msg *TcRateSpec) Len() int {\n\treturn SizeofTcRateSpec\n}\n\nfunc DeserializeTcRateSpec(b []byte) *TcRateSpec {\n\treturn (*TcRateSpec)(unsafe.Pointer(&b[0:SizeofTcRateSpec][0]))\n}\n\nfunc (x *TcRateSpec) Serialize() []byte {\n\treturn (*(*[SizeofTcRateSpec]byte)(unsafe.Pointer(x)))[:]\n}\n\n/**\n* NETEM\n */\n\nconst (\n\tTCA_NETEM_UNSPEC = iota\n\tTCA_NETEM_CORR\n\tTCA_NETEM_DELAY_DIST\n\tTCA_NETEM_REORDER\n\tTCA_NETEM_CORRUPT\n\tTCA_NETEM_LOSS\n\tTCA_NETEM_RATE\n\tTCA_NETEM_ECN\n\tTCA_NETEM_RATE64\n\tTCA_NETEM_MAX = TCA_NETEM_RATE64\n)\n\n// struct tc_netem_qopt {\n//\t__u32\tlatency;\t/* added delay (us) */\n//\t__u32 limit;\t\t/* fifo limit (packets) */\n//\t__u32\tloss;\t\t/* random packet loss (0=none ~0=100%) */\n//\t__u32\tgap;\t\t/* re-ordering gap (0 for none) */\n//\t__u32 duplicate;\t/* random packet dup (0=none ~0=100%) */\n// \t__u32\tjitter;\t\t/* random jitter in latency (us) */\n// };\n\ntype TcNetemQopt struct {\n\tLatency uint32\n\tLimit uint32\n\tLoss uint32\n\tGap uint32\n\tDuplicate uint32\n\tJitter uint32\n}\n\nfunc (msg *TcNetemQopt) Len() int {\n\treturn SizeofTcNetemQopt\n}\n\nfunc DeserializeTcNetemQopt(b []byte) *TcNetemQopt {\n\treturn (*TcNetemQopt)(unsafe.Pointer(&b[0:SizeofTcNetemQopt][0]))\n}\n\nfunc (x *TcNetemQopt) Serialize() []byte {\n\treturn (*(*[SizeofTcNetemQopt]byte)(unsafe.Pointer(x)))[:]\n}\n\n// struct tc_netem_corr {\n// __u32 delay_corr; /* delay correlation */\n// __u32 loss_corr; /* packet loss correlation */\n// __u32 dup_corr; /* duplicate correlation */\n// };\n\ntype TcNetemCorr struct {\n\tDelayCorr uint32\n\tLossCorr uint32\n\tDupCorr uint32\n}\n\nfunc (msg *TcNetemCorr) Len() int {\n\treturn SizeofTcNetemCorr\n}\n\nfunc DeserializeTcNetemCorr(b []byte) *TcNetemCorr {\n\treturn (*TcNetemCorr)(unsafe.Pointer(&b[0:SizeofTcNetemCorr][0]))\n}\n\nfunc (x *TcNetemCorr) Serialize() []byte {\n\treturn (*(*[SizeofTcNetemCorr]byte)(unsafe.Pointer(x)))[:]\n}\n\n// struct tc_netem_reorder {\n// __u32 probability;\n// __u32 correlation;\n// };\n\ntype TcNetemReorder struct {\n\tProbability uint32\n\tCorrelation uint32\n}\n\nfunc (msg *TcNetemReorder) Len() int {\n\treturn SizeofTcNetemReorder\n}\n\nfunc DeserializeTcNetemReorder(b []byte) *TcNetemReorder {\n\treturn (*TcNetemReorder)(unsafe.Pointer(&b[0:SizeofTcNetemReorder][0]))\n}\n\nfunc (x *TcNetemReorder) Serialize() []byte {\n\treturn (*(*[SizeofTcNetemReorder]byte)(unsafe.Pointer(x)))[:]\n}\n\n// struct tc_netem_corrupt {\n// __u32 probability;\n// __u32 correlation;\n// };\n\ntype TcNetemCorrupt struct {\n\tProbability uint32\n\tCorrelation uint32\n}\n\nfunc (msg *TcNetemCorrupt) Len() int {\n\treturn SizeofTcNetemCorrupt\n}\n\nfunc DeserializeTcNetemCorrupt(b []byte) *TcNetemCorrupt {\n\treturn (*TcNetemCorrupt)(unsafe.Pointer(&b[0:SizeofTcNetemCorrupt][0]))\n}\n\nfunc (x *TcNetemCorrupt) Serialize() []byte {\n\treturn (*(*[SizeofTcNetemCorrupt]byte)(unsafe.Pointer(x)))[:]\n}\n\n// struct tc_tbf_qopt {\n// struct tc_ratespec rate;\n// struct tc_ratespec peakrate;\n// __u32 limit;\n// __u32 buffer;\n// __u32 mtu;\n// };\n\ntype TcTbfQopt struct {\n\tRate TcRateSpec\n\tPeakrate TcRateSpec\n\tLimit uint32\n\tBuffer uint32\n\tMtu uint32\n}\n\nfunc (msg *TcTbfQopt) Len() int {\n\treturn SizeofTcTbfQopt\n}\n\nfunc DeserializeTcTbfQopt(b []byte) *TcTbfQopt {\n\treturn (*TcTbfQopt)(unsafe.Pointer(&b[0:SizeofTcTbfQopt][0]))\n}\n\nfunc (x *TcTbfQopt) Serialize() []byte {\n\treturn (*(*[SizeofTcTbfQopt]byte)(unsafe.Pointer(x)))[:]\n}\n\nconst (\n\tTCA_HTB_UNSPEC = iota\n\tTCA_HTB_PARMS\n\tTCA_HTB_INIT\n\tTCA_HTB_CTAB\n\tTCA_HTB_RTAB\n\tTCA_HTB_DIRECT_QLEN\n\tTCA_HTB_RATE64\n\tTCA_HTB_CEIL64\n\tTCA_HTB_MAX = TCA_HTB_CEIL64\n)\n\n//struct tc_htb_opt {\n//\tstruct tc_ratespec\trate;\n//\tstruct tc_ratespec\tceil;\n//\t__u32\tbuffer;\n//\t__u32\tcbuffer;\n//\t__u32\tquantum;\n//\t__u32\tlevel;\t\t/* out only */\n//\t__u32\tprio;\n//};\n\ntype TcHtbCopt struct {\n\tRate TcRateSpec\n\tCeil TcRateSpec\n\tBuffer uint32\n\tCbuffer uint32\n\tQuantum uint32\n\tLevel uint32\n\tPrio uint32\n}\n\nfunc (msg *TcHtbCopt) Len() int {\n\treturn SizeofTcHtbCopt\n}\n\nfunc DeserializeTcHtbCopt(b []byte) *TcHtbCopt {\n\treturn (*TcHtbCopt)(unsafe.Pointer(&b[0:SizeofTcHtbCopt][0]))\n}\n\nfunc (x *TcHtbCopt) Serialize() []byte {\n\treturn (*(*[SizeofTcHtbCopt]byte)(unsafe.Pointer(x)))[:]\n}\n\ntype TcHtbGlob struct {\n\tVersion uint32\n\tRate2Quantum uint32\n\tDefcls uint32\n\tDebug uint32\n\tDirectPkts uint32\n}\n\nfunc (msg *TcHtbGlob) Len() int {\n\treturn SizeofTcHtbGlob\n}\n\nfunc DeserializeTcHtbGlob(b []byte) *TcHtbGlob {\n\treturn (*TcHtbGlob)(unsafe.Pointer(&b[0:SizeofTcHtbGlob][0]))\n}\n\nfunc (x *TcHtbGlob) Serialize() []byte {\n\treturn (*(*[SizeofTcHtbGlob]byte)(unsafe.Pointer(x)))[:]\n}\n\n// HFSC\n\ntype Curve struct {\n\tm1 uint32\n\td uint32\n\tm2 uint32\n}\n\ntype HfscCopt struct {\n\tRsc Curve\n\tFsc Curve\n\tUsc Curve\n}\n\nfunc (c *Curve) Attrs() (uint32, uint32, uint32) {\n\treturn c.m1, c.d, c.m2\n}\n\nfunc (c *Curve) Set(m1 uint32, d uint32, m2 uint32) {\n\tc.m1 = m1\n\tc.d = d\n\tc.m2 = m2\n}\n\nfunc DeserializeHfscCurve(b []byte) *Curve {\n\treturn &Curve{\n\t\tm1: binary.LittleEndian.Uint32(b[0:4]),\n\t\td: binary.LittleEndian.Uint32(b[4:8]),\n\t\tm2: binary.LittleEndian.Uint32(b[8:12]),\n\t}\n}\n\nfunc SerializeHfscCurve(c *Curve) (b []byte) {\n\tt := make([]byte, binary.MaxVarintLen32)\n\tbinary.LittleEndian.PutUint32(t, c.m1)\n\tb = append(b, t[:4]...)\n\tbinary.LittleEndian.PutUint32(t, c.d)\n\tb = append(b, t[:4]...)\n\tbinary.LittleEndian.PutUint32(t, c.m2)\n\tb = append(b, t[:4]...)\n\treturn b\n}\n\ntype TcHfscOpt struct {\n\tDefcls uint16\n}\n\nfunc (x *TcHfscOpt) Serialize() []byte {\n\treturn (*(*[2]byte)(unsafe.Pointer(x)))[:]\n}\n\nconst (\n\tTCA_U32_UNSPEC = iota\n\tTCA_U32_CLASSID\n\tTCA_U32_HASH\n\tTCA_U32_LINK\n\tTCA_U32_DIVISOR\n\tTCA_U32_SEL\n\tTCA_U32_POLICE\n\tTCA_U32_ACT\n\tTCA_U32_INDEV\n\tTCA_U32_PCNT\n\tTCA_U32_MARK\n\tTCA_U32_MAX = TCA_U32_MARK\n)\n\n// struct tc_u32_key {\n// __be32 mask;\n// __be32 val;\n// int off;\n// int offmask;\n// };\n\ntype TcU32Key struct {\n\tMask uint32 // big endian\n\tVal uint32 // big endian\n\tOff int32\n\tOffMask int32\n}\n\nfunc (msg *TcU32Key) Len() int {\n\treturn SizeofTcU32Key\n}\n\nfunc DeserializeTcU32Key(b []byte) *TcU32Key {\n\treturn (*TcU32Key)(unsafe.Pointer(&b[0:SizeofTcU32Key][0]))\n}\n\nfunc (x *TcU32Key) Serialize() []byte {\n\treturn (*(*[SizeofTcU32Key]byte)(unsafe.Pointer(x)))[:]\n}\n\n// struct tc_u32_sel {\n// unsigned char flags;\n// unsigned char offshift;\n// unsigned char nkeys;\n//\n// __be16 offmask;\n// __u16 off;\n// short offoff;\n//\n// short hoff;\n// __be32 hmask;\n// struct tc_u32_key keys[0];\n// };\n\nconst (\n\tTC_U32_TERMINAL = 1 << iota\n\tTC_U32_OFFSET = 1 << iota\n\tTC_U32_VAROFFSET = 1 << iota\n\tTC_U32_EAT = 1 << iota\n)\n\ntype TcU32Sel struct {\n\tFlags uint8\n\tOffshift uint8\n\tNkeys uint8\n\tPad uint8\n\tOffmask uint16 // big endian\n\tOff uint16\n\tOffoff int16\n\tHoff int16\n\tHmask uint32 // big endian\n\tKeys []TcU32Key\n}\n\nfunc (msg *TcU32Sel) Len() int {\n\treturn SizeofTcU32Sel + int(msg.Nkeys)*SizeofTcU32Key\n}\n\nfunc DeserializeTcU32Sel(b []byte) *TcU32Sel {\n\tx := &TcU32Sel{}\n\tcopy((*(*[SizeofTcU32Sel]byte)(unsafe.Pointer(x)))[:], b)\n\tnext := SizeofTcU32Sel\n\tvar i uint8\n\tfor i = 0; i < x.Nkeys; i++ {\n\t\tx.Keys = append(x.Keys, *DeserializeTcU32Key(b[next:]))\n\t\tnext += SizeofTcU32Key\n\t}\n\treturn x\n}\n\nfunc (x *TcU32Sel) Serialize() []byte {\n\t// This can't just unsafe.cast because it must iterate through keys.\n\tbuf := make([]byte, x.Len())\n\tcopy(buf, (*(*[SizeofTcU32Sel]byte)(unsafe.Pointer(x)))[:])\n\tnext := SizeofTcU32Sel\n\tfor _, key := range x.Keys {\n\t\tkeyBuf := key.Serialize()\n\t\tcopy(buf[next:], keyBuf)\n\t\tnext += SizeofTcU32Key\n\t}\n\treturn buf\n}\n\ntype TcGen struct {\n\tIndex uint32\n\tCapab uint32\n\tAction int32\n\tRefcnt int32\n\tBindcnt int32\n}\n\nfunc (msg *TcGen) Len() int {\n\treturn SizeofTcGen\n}\n\nfunc DeserializeTcGen(b []byte) *TcGen {\n\treturn (*TcGen)(unsafe.Pointer(&b[0:SizeofTcGen][0]))\n}\n\nfunc (x *TcGen) Serialize() []byte {\n\treturn (*(*[SizeofTcGen]byte)(unsafe.Pointer(x)))[:]\n}\n\n// #define tc_gen \\\n// __u32 index; \\\n// __u32 capab; \\\n// int action; \\\n// int refcnt; \\\n// int bindcnt\n\nconst (\n\tTCA_ACT_GACT = 5\n)\n\nconst (\n\tTCA_GACT_UNSPEC = iota\n\tTCA_GACT_TM\n\tTCA_GACT_PARMS\n\tTCA_GACT_PROB\n\tTCA_GACT_MAX = TCA_GACT_PROB\n)\n\ntype TcGact TcGen\n\nconst (\n\tTCA_ACT_BPF = 13\n)\n\nconst (\n\tTCA_ACT_BPF_UNSPEC = iota\n\tTCA_ACT_BPF_TM\n\tTCA_ACT_BPF_PARMS\n\tTCA_ACT_BPF_OPS_LEN\n\tTCA_ACT_BPF_OPS\n\tTCA_ACT_BPF_FD\n\tTCA_ACT_BPF_NAME\n\tTCA_ACT_BPF_MAX = TCA_ACT_BPF_NAME\n)\n\nconst (\n\tTCA_BPF_FLAG_ACT_DIRECT uint32 = 1 << iota\n)\n\nconst (\n\tTCA_BPF_UNSPEC = iota\n\tTCA_BPF_ACT\n\tTCA_BPF_POLICE\n\tTCA_BPF_CLASSID\n\tTCA_BPF_OPS_LEN\n\tTCA_BPF_OPS\n\tTCA_BPF_FD\n\tTCA_BPF_NAME\n\tTCA_BPF_FLAGS\n\tTCA_BPF_FLAGS_GEN\n\tTCA_BPF_TAG\n\tTCA_BPF_ID\n\tTCA_BPF_MAX = TCA_BPF_ID\n)\n\ntype TcBpf TcGen\n\nconst (\n\tTCA_ACT_CONNMARK = 14\n)\n\nconst (\n\tTCA_CONNMARK_UNSPEC = iota\n\tTCA_CONNMARK_PARMS\n\tTCA_CONNMARK_TM\n\tTCA_CONNMARK_MAX = TCA_CONNMARK_TM\n)\n\n// struct tc_connmark {\n// tc_gen;\n// __u16 zone;\n// };\n\ntype TcConnmark struct {\n\tTcGen\n\tZone uint16\n}\n\nfunc (msg *TcConnmark) Len() int {\n\treturn SizeofTcConnmark\n}\n\nfunc DeserializeTcConnmark(b []byte) *TcConnmark {\n\treturn (*TcConnmark)(unsafe.Pointer(&b[0:SizeofTcConnmark][0]))\n}\n\nfunc (x *TcConnmark) Serialize() []byte {\n\treturn (*(*[SizeofTcConnmark]byte)(unsafe.Pointer(x)))[:]\n}\n\nconst (\n\tTCA_ACT_MIRRED = 8\n)\n\nconst (\n\tTCA_MIRRED_UNSPEC = iota\n\tTCA_MIRRED_TM\n\tTCA_MIRRED_PARMS\n\tTCA_MIRRED_MAX = TCA_MIRRED_PARMS\n)\n\n// struct tc_mirred {\n// \ttc_gen;\n// \tint eaction; /* one of IN/EGRESS_MIRROR/REDIR */\n// \t__u32 ifindex; /* ifindex of egress port */\n// };\n\ntype TcMirred struct {\n\tTcGen\n\tEaction int32\n\tIfindex uint32\n}\n\nfunc (msg *TcMirred) Len() int {\n\treturn SizeofTcMirred\n}\n\nfunc DeserializeTcMirred(b []byte) *TcMirred {\n\treturn (*TcMirred)(unsafe.Pointer(&b[0:SizeofTcMirred][0]))\n}\n\nfunc (x *TcMirred) Serialize() []byte {\n\treturn (*(*[SizeofTcMirred]byte)(unsafe.Pointer(x)))[:]\n}\n\nconst (\n\tTCA_TUNNEL_KEY_UNSPEC = iota\n\tTCA_TUNNEL_KEY_TM\n\tTCA_TUNNEL_KEY_PARMS\n\tTCA_TUNNEL_KEY_ENC_IPV4_SRC\n\tTCA_TUNNEL_KEY_ENC_IPV4_DST\n\tTCA_TUNNEL_KEY_ENC_IPV6_SRC\n\tTCA_TUNNEL_KEY_ENC_IPV6_DST\n\tTCA_TUNNEL_KEY_ENC_KEY_ID\n\tTCA_TUNNEL_KEY_PAD\n\tTCA_TUNNEL_KEY_ENC_DST_PORT\n\tTCA_TUNNEL_KEY_NO_CSUM\n\tTCA_TUNNEL_KEY_ENC_OPTS\n\tTCA_TUNNEL_KEY_ENC_TOS\n\tTCA_TUNNEL_KEY_ENC_TTL\n\tTCA_TUNNEL_KEY_MAX\n)\n\ntype TcTunnelKey struct {\n\tTcGen\n\tAction int32\n}\n\nfunc (x *TcTunnelKey) Len() int {\n\treturn SizeofTcTunnelKey\n}\n\nfunc DeserializeTunnelKey(b []byte) *TcTunnelKey {\n\treturn (*TcTunnelKey)(unsafe.Pointer(&b[0:SizeofTcTunnelKey][0]))\n}\n\nfunc (x *TcTunnelKey) Serialize() []byte {\n\treturn (*(*[SizeofTcTunnelKey]byte)(unsafe.Pointer(x)))[:]\n}\n\nconst (\n\tTCA_SKBEDIT_UNSPEC = iota\n\tTCA_SKBEDIT_TM\n\tTCA_SKBEDIT_PARMS\n\tTCA_SKBEDIT_PRIORITY\n\tTCA_SKBEDIT_QUEUE_MAPPING\n\tTCA_SKBEDIT_MARK\n\tTCA_SKBEDIT_PAD\n\tTCA_SKBEDIT_PTYPE\n\tTCA_SKBEDIT_MAX = TCA_SKBEDIT_MARK\n)\n\ntype TcSkbEdit struct {\n\tTcGen\n}\n\nfunc (x *TcSkbEdit) Len() int {\n\treturn SizeofTcSkbEdit\n}\n\nfunc DeserializeSkbEdit(b []byte) *TcSkbEdit {\n\treturn (*TcSkbEdit)(unsafe.Pointer(&b[0:SizeofTcSkbEdit][0]))\n}\n\nfunc (x *TcSkbEdit) Serialize() []byte {\n\treturn (*(*[SizeofTcSkbEdit]byte)(unsafe.Pointer(x)))[:]\n}\n\n// struct tc_police {\n// \t__u32\t\t\tindex;\n// \tint\t\t\taction;\n// \t__u32\t\t\tlimit;\n// \t__u32\t\t\tburst;\n// \t__u32\t\t\tmtu;\n// \tstruct tc_ratespec\trate;\n// \tstruct tc_ratespec\tpeakrate;\n// \tint\t\t\t\trefcnt;\n// \tint\t\t\t\tbindcnt;\n// \t__u32\t\t\tcapab;\n// };\n\ntype TcPolice struct {\n\tIndex uint32\n\tAction int32\n\tLimit uint32\n\tBurst uint32\n\tMtu uint32\n\tRate TcRateSpec\n\tPeakRate TcRateSpec\n\tRefcnt int32\n\tBindcnt int32\n\tCapab uint32\n}\n\nfunc (msg *TcPolice) Len() int {\n\treturn SizeofTcPolice\n}\n\nfunc DeserializeTcPolice(b []byte) *TcPolice {\n\treturn (*TcPolice)(unsafe.Pointer(&b[0:SizeofTcPolice][0]))\n}\n\nfunc (x *TcPolice) Serialize() []byte {\n\treturn (*(*[SizeofTcPolice]byte)(unsafe.Pointer(x)))[:]\n}\n\nconst (\n\tTCA_FW_UNSPEC = iota\n\tTCA_FW_CLASSID\n\tTCA_FW_POLICE\n\tTCA_FW_INDEV\n\tTCA_FW_ACT\n\tTCA_FW_MASK\n\tTCA_FW_MAX = TCA_FW_MASK\n)\n\nconst (\n\tTCA_MATCHALL_UNSPEC = iota\n\tTCA_MATCHALL_CLASSID\n\tTCA_MATCHALL_ACT\n\tTCA_MATCHALL_FLAGS\n)\n\nconst (\n\tTCA_FQ_UNSPEC = iota\n\tTCA_FQ_PLIMIT // limit of total number of packets in queue\n\tTCA_FQ_FLOW_PLIMIT // limit of packets per flow\n\tTCA_FQ_QUANTUM // RR quantum\n\tTCA_FQ_INITIAL_QUANTUM // RR quantum for new flow\n\tTCA_FQ_RATE_ENABLE // enable/disable rate limiting\n\tTCA_FQ_FLOW_DEFAULT_RATE // obsolete do not use\n\tTCA_FQ_FLOW_MAX_RATE // per flow max rate\n\tTCA_FQ_BUCKETS_LOG // log2(number of buckets)\n\tTCA_FQ_FLOW_REFILL_DELAY // flow credit refill delay in usec\n\tTCA_FQ_ORPHAN_MASK // mask applied to orphaned skb hashes\n\tTCA_FQ_LOW_RATE_THRESHOLD // per packet delay under this rate\n)\n\nconst (\n\tTCA_FQ_CODEL_UNSPEC = iota\n\tTCA_FQ_CODEL_TARGET\n\tTCA_FQ_CODEL_LIMIT\n\tTCA_FQ_CODEL_INTERVAL\n\tTCA_FQ_CODEL_ECN\n\tTCA_FQ_CODEL_FLOWS\n\tTCA_FQ_CODEL_QUANTUM\n\tTCA_FQ_CODEL_CE_THRESHOLD\n\tTCA_FQ_CODEL_DROP_BATCH_SIZE\n\tTCA_FQ_CODEL_MEMORY_LIMIT\n)\n\nconst (\n\tTCA_HFSC_UNSPEC = iota\n\tTCA_HFSC_RSC\n\tTCA_HFSC_FSC\n\tTCA_HFSC_USC\n)\n\n// struct tc_sfq_qopt {\n// \tunsigned\tquantum;\t/* Bytes per round allocated to flow */\n// \tint\t\tperturb_period;\t/* Period of hash perturbation */\n// \t__u32\t\tlimit;\t\t/* Maximal packets in queue */\n// \tunsigned\tdivisor;\t/* Hash divisor */\n// \tunsigned\tflows;\t\t/* Maximal number of flows */\n// };\n\ntype TcSfqQopt struct {\n\tQuantum uint8\n\tPerturb int32\n\tLimit uint32\n\tDivisor uint8\n\tFlows uint8\n}\n\nfunc (x *TcSfqQopt) Len() int {\n\treturn SizeofTcSfqQopt\n}\n\nfunc DeserializeTcSfqQopt(b []byte) *TcSfqQopt {\n\treturn (*TcSfqQopt)(unsafe.Pointer(&b[0:SizeofTcSfqQopt][0]))\n}\n\nfunc (x *TcSfqQopt) Serialize() []byte {\n\treturn (*(*[SizeofTcSfqQopt]byte)(unsafe.Pointer(x)))[:]\n}\n\n// struct tc_sfqred_stats {\n// \t__u32 prob_drop; /* Early drops, below max threshold */\n// \t__u32 forced_drop;\t/* Early drops, after max threshold */\n// \t__u32 prob_mark; /* Marked packets, below max threshold */\n// \t__u32 forced_mark; /* Marked packets, after max threshold */\n// \t__u32 prob_mark_head; /* Marked packets, below max threshold */\n// \t__u32 forced_mark_head;/* Marked packets, after max threshold */\n// };\ntype TcSfqRedStats struct {\n\tProbDrop uint32\n\tForcedDrop uint32\n\tProbMark uint32\n\tForcedMark uint32\n\tProbMarkHead uint32\n\tForcedMarkHead uint32\n}\n\nfunc (x *TcSfqRedStats) Len() int {\n\treturn SizeofTcSfqRedStats\n}\n\nfunc DeserializeTcSfqRedStats(b []byte) *TcSfqRedStats {\n\treturn (*TcSfqRedStats)(unsafe.Pointer(&b[0:SizeofTcSfqRedStats][0]))\n}\n\nfunc (x *TcSfqRedStats) Serialize() []byte {\n\treturn (*(*[SizeofTcSfqRedStats]byte)(unsafe.Pointer(x)))[:]\n}\n\n// struct tc_sfq_qopt_v1 {\n// \tstruct tc_sfq_qopt v0;\n// \tunsigned int\tdepth;\t\t/* max number of packets per flow */\n// \tunsigned int\theaddrop;\n// /* SFQRED parameters */\n// \t__u32\t\tlimit;\t\t/* HARD maximal flow queue length (bytes) */\n// \t__u32\t\tqth_min;\t/* Min average length threshold (bytes) */\n// \t__u32\t\tqth_max;\t/* Max average length threshold (bytes) */\n// \tunsigned char Wlog;\t\t/* log(W)\t\t*/\n// \tunsigned char Plog;\t\t/* log(P_max/(qth_max-qth_min))\t*/\n// \tunsigned char Scell_log;\t/* cell size for idle damping */\n// \tunsigned char\tflags;\n// \t__u32\t\tmax_P;\t\t/* probability, high resolution */\n// /* SFQRED stats */\n// \tstruct tc_sfqred_stats stats;\n// };\ntype TcSfqQoptV1 struct {\n\tTcSfqQopt\n\tDepth uint32\n\tHeadDrop uint32\n\tLimit uint32\n\tQthMin uint32\n\tQthMax uint32\n\tWlog byte\n\tPlog byte\n\tScellLog byte\n\tFlags byte\n\tMaxP uint32\n\tTcSfqRedStats\n}\n\nfunc (x *TcSfqQoptV1) Len() int {\n\treturn SizeofTcSfqQoptV1\n}\n\nfunc DeserializeTcSfqQoptV1(b []byte) *TcSfqQoptV1 {\n\treturn (*TcSfqQoptV1)(unsafe.Pointer(&b[0:SizeofTcSfqQoptV1][0]))\n}\n\nfunc (x *TcSfqQoptV1) Serialize() []byte {\n\treturn (*(*[SizeofTcSfqQoptV1]byte)(unsafe.Pointer(x)))[:]\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/nl/xfrm_linux.go", "content": "package nl\n\nimport (\n\t\"bytes\"\n\t\"net\"\n\t\"unsafe\"\n)\n\n// Infinity for packet and byte counts\nconst (\n\tXFRM_INF = ^uint64(0)\n)\n\ntype XfrmMsgType uint8\n\ntype XfrmMsg interface {\n\tType() XfrmMsgType\n}\n\n// Message Types\nconst (\n\tXFRM_MSG_BASE XfrmMsgType = 0x10\n\tXFRM_MSG_NEWSA = 0x10\n\tXFRM_MSG_DELSA = 0x11\n\tXFRM_MSG_GETSA = 0x12\n\tXFRM_MSG_NEWPOLICY = 0x13\n\tXFRM_MSG_DELPOLICY = 0x14\n\tXFRM_MSG_GETPOLICY = 0x15\n\tXFRM_MSG_ALLOCSPI = 0x16\n\tXFRM_MSG_ACQUIRE = 0x17\n\tXFRM_MSG_EXPIRE = 0x18\n\tXFRM_MSG_UPDPOLICY = 0x19\n\tXFRM_MSG_UPDSA = 0x1a\n\tXFRM_MSG_POLEXPIRE = 0x1b\n\tXFRM_MSG_FLUSHSA = 0x1c\n\tXFRM_MSG_FLUSHPOLICY = 0x1d\n\tXFRM_MSG_NEWAE = 0x1e\n\tXFRM_MSG_GETAE = 0x1f\n\tXFRM_MSG_REPORT = 0x20\n\tXFRM_MSG_MIGRATE = 0x21\n\tXFRM_MSG_NEWSADINFO = 0x22\n\tXFRM_MSG_GETSADINFO = 0x23\n\tXFRM_MSG_NEWSPDINFO = 0x24\n\tXFRM_MSG_GETSPDINFO = 0x25\n\tXFRM_MSG_MAPPING = 0x26\n\tXFRM_MSG_MAX = 0x26\n\tXFRM_NR_MSGTYPES = 0x17\n)\n\n// Attribute types\nconst (\n\t/* Netlink message attributes. */\n\tXFRMA_UNSPEC = iota\n\tXFRMA_ALG_AUTH /* struct xfrm_algo */\n\tXFRMA_ALG_CRYPT /* struct xfrm_algo */\n\tXFRMA_ALG_COMP /* struct xfrm_algo */\n\tXFRMA_ENCAP /* struct xfrm_algo + struct xfrm_encap_tmpl */\n\tXFRMA_TMPL /* 1 or more struct xfrm_user_tmpl */\n\tXFRMA_SA /* struct xfrm_usersa_info */\n\tXFRMA_POLICY /* struct xfrm_userpolicy_info */\n\tXFRMA_SEC_CTX /* struct xfrm_sec_ctx */\n\tXFRMA_LTIME_VAL\n\tXFRMA_REPLAY_VAL\n\tXFRMA_REPLAY_THRESH\n\tXFRMA_ETIMER_THRESH\n\tXFRMA_SRCADDR /* xfrm_address_t */\n\tXFRMA_COADDR /* xfrm_address_t */\n\tXFRMA_LASTUSED /* unsigned long */\n\tXFRMA_POLICY_TYPE /* struct xfrm_userpolicy_type */\n\tXFRMA_MIGRATE\n\tXFRMA_ALG_AEAD /* struct xfrm_algo_aead */\n\tXFRMA_KMADDRESS /* struct xfrm_user_kmaddress */\n\tXFRMA_ALG_AUTH_TRUNC /* struct xfrm_algo_auth */\n\tXFRMA_MARK /* struct xfrm_mark */\n\tXFRMA_TFCPAD /* __u32 */\n\tXFRMA_REPLAY_ESN_VAL /* struct xfrm_replay_esn */\n\tXFRMA_SA_EXTRA_FLAGS /* __u32 */\n\tXFRMA_PROTO /* __u8 */\n\tXFRMA_ADDRESS_FILTER /* struct xfrm_address_filter */\n\tXFRMA_PAD\n\tXFRMA_OFFLOAD_DEV /* struct xfrm_state_offload */\n\tXFRMA_SET_MARK /* __u32 */\n\tXFRMA_SET_MARK_MASK /* __u32 */\n\tXFRMA_IF_ID /* __u32 */\n\n\tXFRMA_MAX = iota - 1\n)\n\nconst XFRMA_OUTPUT_MARK = XFRMA_SET_MARK\n\nconst (\n\tSizeofXfrmAddress = 0x10\n\tSizeofXfrmSelector = 0x38\n\tSizeofXfrmLifetimeCfg = 0x40\n\tSizeofXfrmLifetimeCur = 0x20\n\tSizeofXfrmId = 0x18\n\tSizeofXfrmMark = 0x08\n)\n\n// Netlink groups\nconst (\n\tXFRMNLGRP_NONE = 0x0\n\tXFRMNLGRP_ACQUIRE = 0x1\n\tXFRMNLGRP_EXPIRE = 0x2\n\tXFRMNLGRP_SA = 0x3\n\tXFRMNLGRP_POLICY = 0x4\n\tXFRMNLGRP_AEVENTS = 0x5\n\tXFRMNLGRP_REPORT = 0x6\n\tXFRMNLGRP_MIGRATE = 0x7\n\tXFRMNLGRP_MAPPING = 0x8\n\t__XFRMNLGRP_MAX = 0x9\n)\n\n// typedef union {\n// __be32 a4;\n// __be32 a6[4];\n// } xfrm_address_t;\n\ntype XfrmAddress [SizeofXfrmAddress]byte\n\nfunc (x *XfrmAddress) ToIP() net.IP {\n\tvar empty = [12]byte{}\n\tip := make(net.IP, net.IPv6len)\n\tif bytes.Equal(x[4:16], empty[:]) {\n\t\tip[10] = 0xff\n\t\tip[11] = 0xff\n\t\tcopy(ip[12:16], x[0:4])\n\t} else {\n\t\tcopy(ip[:], x[:])\n\t}\n\treturn ip\n}\n\nfunc (x *XfrmAddress) ToIPNet(prefixlen uint8) *net.IPNet {\n\tip := x.ToIP()\n\tif GetIPFamily(ip) == FAMILY_V4 {\n\t\treturn &net.IPNet{IP: ip, Mask: net.CIDRMask(int(prefixlen), 32)}\n\t}\n\treturn &net.IPNet{IP: ip, Mask: net.CIDRMask(int(prefixlen), 128)}\n}\n\nfunc (x *XfrmAddress) FromIP(ip net.IP) {\n\tvar empty = [16]byte{}\n\tif len(ip) < net.IPv4len {\n\t\tcopy(x[4:16], empty[:])\n\t} else if GetIPFamily(ip) == FAMILY_V4 {\n\t\tcopy(x[0:4], ip.To4()[0:4])\n\t\tcopy(x[4:16], empty[:12])\n\t} else {\n\t\tcopy(x[0:16], ip.To16()[0:16])\n\t}\n}\n\nfunc DeserializeXfrmAddress(b []byte) *XfrmAddress {\n\treturn (*XfrmAddress)(unsafe.Pointer(&b[0:SizeofXfrmAddress][0]))\n}\n\nfunc (x *XfrmAddress) Serialize() []byte {\n\treturn (*(*[SizeofXfrmAddress]byte)(unsafe.Pointer(x)))[:]\n}\n\n// struct xfrm_selector {\n// xfrm_address_t daddr;\n// xfrm_address_t saddr;\n// __be16 dport;\n// __be16 dport_mask;\n// __be16 sport;\n// __be16 sport_mask;\n// __u16 family;\n// __u8 prefixlen_d;\n// __u8 prefixlen_s;\n// __u8 proto;\n// int ifindex;\n// __kernel_uid32_t user;\n// };\n\ntype XfrmSelector struct {\n\tDaddr XfrmAddress\n\tSaddr XfrmAddress\n\tDport uint16 // big endian\n\tDportMask uint16 // big endian\n\tSport uint16 // big endian\n\tSportMask uint16 // big endian\n\tFamily uint16\n\tPrefixlenD uint8\n\tPrefixlenS uint8\n\tProto uint8\n\tPad [3]byte\n\tIfindex int32\n\tUser uint32\n}\n\nfunc (msg *XfrmSelector) Len() int {\n\treturn SizeofXfrmSelector\n}\n\nfunc DeserializeXfrmSelector(b []byte) *XfrmSelector {\n\treturn (*XfrmSelector)(unsafe.Pointer(&b[0:SizeofXfrmSelector][0]))\n}\n\nfunc (msg *XfrmSelector) Serialize() []byte {\n\treturn (*(*[SizeofXfrmSelector]byte)(unsafe.Pointer(msg)))[:]\n}\n\n// struct xfrm_lifetime_cfg {\n// __u64 soft_byte_limit;\n// __u64 hard_byte_limit;\n// __u64 soft_packet_limit;\n// __u64 hard_packet_limit;\n// __u64 soft_add_expires_seconds;\n// __u64 hard_add_expires_seconds;\n// __u64 soft_use_expires_seconds;\n// __u64 hard_use_expires_seconds;\n// };\n//\n\ntype XfrmLifetimeCfg struct {\n\tSoftByteLimit uint64\n\tHardByteLimit uint64\n\tSoftPacketLimit uint64\n\tHardPacketLimit uint64\n\tSoftAddExpiresSeconds uint64\n\tHardAddExpiresSeconds uint64\n\tSoftUseExpiresSeconds uint64\n\tHardUseExpiresSeconds uint64\n}\n\nfunc (msg *XfrmLifetimeCfg) Len() int {\n\treturn SizeofXfrmLifetimeCfg\n}\n\nfunc DeserializeXfrmLifetimeCfg(b []byte) *XfrmLifetimeCfg {\n\treturn (*XfrmLifetimeCfg)(unsafe.Pointer(&b[0:SizeofXfrmLifetimeCfg][0]))\n}\n\nfunc (msg *XfrmLifetimeCfg) Serialize() []byte {\n\treturn (*(*[SizeofXfrmLifetimeCfg]byte)(unsafe.Pointer(msg)))[:]\n}\n\n// struct xfrm_lifetime_cur {\n// __u64 bytes;\n// __u64 packets;\n// __u64 add_time;\n// __u64 use_time;\n// };\n\ntype XfrmLifetimeCur struct {\n\tBytes uint64\n\tPackets uint64\n\tAddTime uint64\n\tUseTime uint64\n}\n\nfunc (msg *XfrmLifetimeCur) Len() int {\n\treturn SizeofXfrmLifetimeCur\n}\n\nfunc DeserializeXfrmLifetimeCur(b []byte) *XfrmLifetimeCur {\n\treturn (*XfrmLifetimeCur)(unsafe.Pointer(&b[0:SizeofXfrmLifetimeCur][0]))\n}\n\nfunc (msg *XfrmLifetimeCur) Serialize() []byte {\n\treturn (*(*[SizeofXfrmLifetimeCur]byte)(unsafe.Pointer(msg)))[:]\n}\n\n// struct xfrm_id {\n// xfrm_address_t daddr;\n// __be32 spi;\n// __u8 proto;\n// };\n\ntype XfrmId struct {\n\tDaddr XfrmAddress\n\tSpi uint32 // big endian\n\tProto uint8\n\tPad [3]byte\n}\n\nfunc (msg *XfrmId) Len() int {\n\treturn SizeofXfrmId\n}\n\nfunc DeserializeXfrmId(b []byte) *XfrmId {\n\treturn (*XfrmId)(unsafe.Pointer(&b[0:SizeofXfrmId][0]))\n}\n\nfunc (msg *XfrmId) Serialize() []byte {\n\treturn (*(*[SizeofXfrmId]byte)(unsafe.Pointer(msg)))[:]\n}\n\ntype XfrmMark struct {\n\tValue uint32\n\tMask uint32\n}\n\nfunc (msg *XfrmMark) Len() int {\n\treturn SizeofXfrmMark\n}\n\nfunc DeserializeXfrmMark(b []byte) *XfrmMark {\n\treturn (*XfrmMark)(unsafe.Pointer(&b[0:SizeofXfrmMark][0]))\n}\n\nfunc (msg *XfrmMark) Serialize() []byte {\n\treturn (*(*[SizeofXfrmMark]byte)(unsafe.Pointer(msg)))[:]\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/nl/xfrm_monitor_linux.go", "content": "package nl\n\nimport (\n\t\"unsafe\"\n)\n\nconst (\n\tSizeofXfrmUserExpire = 0xe8\n)\n\n// struct xfrm_user_expire {\n// \tstruct xfrm_usersa_info\t\tstate;\n// \t__u8\t\t\t\thard;\n// };\n\ntype XfrmUserExpire struct {\n\tXfrmUsersaInfo XfrmUsersaInfo\n\tHard uint8\n\tPad [7]byte\n}\n\nfunc (msg *XfrmUserExpire) Len() int {\n\treturn SizeofXfrmUserExpire\n}\n\nfunc DeserializeXfrmUserExpire(b []byte) *XfrmUserExpire {\n\treturn (*XfrmUserExpire)(unsafe.Pointer(&b[0:SizeofXfrmUserExpire][0]))\n}\n\nfunc (msg *XfrmUserExpire) Serialize() []byte {\n\treturn (*(*[SizeofXfrmUserExpire]byte)(unsafe.Pointer(msg)))[:]\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/nl/xfrm_policy_linux.go", "content": "package nl\n\nimport (\n\t\"unsafe\"\n)\n\nconst (\n\tSizeofXfrmUserpolicyId = 0x40\n\tSizeofXfrmUserpolicyInfo = 0xa8\n\tSizeofXfrmUserTmpl = 0x40\n)\n\n// struct xfrm_userpolicy_id {\n// struct xfrm_selector sel;\n// __u32 index;\n// __u8 dir;\n// };\n//\n\ntype XfrmUserpolicyId struct {\n\tSel XfrmSelector\n\tIndex uint32\n\tDir uint8\n\tPad [3]byte\n}\n\nfunc (msg *XfrmUserpolicyId) Len() int {\n\treturn SizeofXfrmUserpolicyId\n}\n\nfunc DeserializeXfrmUserpolicyId(b []byte) *XfrmUserpolicyId {\n\treturn (*XfrmUserpolicyId)(unsafe.Pointer(&b[0:SizeofXfrmUserpolicyId][0]))\n}\n\nfunc (msg *XfrmUserpolicyId) Serialize() []byte {\n\treturn (*(*[SizeofXfrmUserpolicyId]byte)(unsafe.Pointer(msg)))[:]\n}\n\n// struct xfrm_userpolicy_info {\n// struct xfrm_selector sel;\n// struct xfrm_lifetime_cfg lft;\n// struct xfrm_lifetime_cur curlft;\n// __u32 priority;\n// __u32 index;\n// __u8 dir;\n// __u8 action;\n// #define XFRM_POLICY_ALLOW 0\n// #define XFRM_POLICY_BLOCK 1\n// __u8 flags;\n// #define XFRM_POLICY_LOCALOK 1 /* Allow user to override global policy */\n// /* Automatically expand selector to include matching ICMP payloads. */\n// #define XFRM_POLICY_ICMP 2\n// __u8 share;\n// };\n\ntype XfrmUserpolicyInfo struct {\n\tSel XfrmSelector\n\tLft XfrmLifetimeCfg\n\tCurlft XfrmLifetimeCur\n\tPriority uint32\n\tIndex uint32\n\tDir uint8\n\tAction uint8\n\tFlags uint8\n\tShare uint8\n\tPad [4]byte\n}\n\nfunc (msg *XfrmUserpolicyInfo) Len() int {\n\treturn SizeofXfrmUserpolicyInfo\n}\n\nfunc DeserializeXfrmUserpolicyInfo(b []byte) *XfrmUserpolicyInfo {\n\treturn (*XfrmUserpolicyInfo)(unsafe.Pointer(&b[0:SizeofXfrmUserpolicyInfo][0]))\n}\n\nfunc (msg *XfrmUserpolicyInfo) Serialize() []byte {\n\treturn (*(*[SizeofXfrmUserpolicyInfo]byte)(unsafe.Pointer(msg)))[:]\n}\n\n// struct xfrm_user_tmpl {\n// struct xfrm_id id;\n// __u16 family;\n// xfrm_address_t saddr;\n// __u32 reqid;\n// __u8 mode;\n// __u8 share;\n// __u8 optional;\n// __u32 aalgos;\n// __u32 ealgos;\n// __u32 calgos;\n// }\n\ntype XfrmUserTmpl struct {\n\tXfrmId XfrmId\n\tFamily uint16\n\tPad1 [2]byte\n\tSaddr XfrmAddress\n\tReqid uint32\n\tMode uint8\n\tShare uint8\n\tOptional uint8\n\tPad2 byte\n\tAalgos uint32\n\tEalgos uint32\n\tCalgos uint32\n}\n\nfunc (msg *XfrmUserTmpl) Len() int {\n\treturn SizeofXfrmUserTmpl\n}\n\nfunc DeserializeXfrmUserTmpl(b []byte) *XfrmUserTmpl {\n\treturn (*XfrmUserTmpl)(unsafe.Pointer(&b[0:SizeofXfrmUserTmpl][0]))\n}\n\nfunc (msg *XfrmUserTmpl) Serialize() []byte {\n\treturn (*(*[SizeofXfrmUserTmpl]byte)(unsafe.Pointer(msg)))[:]\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/nl/xfrm_state_linux.go", "content": "package nl\n\nimport (\n\t\"unsafe\"\n)\n\nconst (\n\tSizeofXfrmUsersaId = 0x18\n\tSizeofXfrmStats = 0x0c\n\tSizeofXfrmUsersaInfo = 0xe0\n\tSizeofXfrmUserSpiInfo = 0xe8\n\tSizeofXfrmAlgo = 0x44\n\tSizeofXfrmAlgoAuth = 0x48\n\tSizeofXfrmAlgoAEAD = 0x48\n\tSizeofXfrmEncapTmpl = 0x18\n\tSizeofXfrmUsersaFlush = 0x1\n\tSizeofXfrmReplayStateEsn = 0x18\n)\n\nconst (\n\tXFRM_STATE_NOECN = 1\n\tXFRM_STATE_DECAP_DSCP = 2\n\tXFRM_STATE_NOPMTUDISC = 4\n\tXFRM_STATE_WILDRECV = 8\n\tXFRM_STATE_ICMP = 16\n\tXFRM_STATE_AF_UNSPEC = 32\n\tXFRM_STATE_ALIGN4 = 64\n\tXFRM_STATE_ESN = 128\n)\n\n// struct xfrm_usersa_id {\n// xfrm_address_t daddr;\n// __be32 spi;\n// __u16 family;\n// __u8 proto;\n// };\n\ntype XfrmUsersaId struct {\n\tDaddr XfrmAddress\n\tSpi uint32 // big endian\n\tFamily uint16\n\tProto uint8\n\tPad byte\n}\n\nfunc (msg *XfrmUsersaId) Len() int {\n\treturn SizeofXfrmUsersaId\n}\n\nfunc DeserializeXfrmUsersaId(b []byte) *XfrmUsersaId {\n\treturn (*XfrmUsersaId)(unsafe.Pointer(&b[0:SizeofXfrmUsersaId][0]))\n}\n\nfunc (msg *XfrmUsersaId) Serialize() []byte {\n\treturn (*(*[SizeofXfrmUsersaId]byte)(unsafe.Pointer(msg)))[:]\n}\n\n// struct xfrm_stats {\n// __u32 replay_window;\n// __u32 replay;\n// __u32 integrity_failed;\n// };\n\ntype XfrmStats struct {\n\tReplayWindow uint32\n\tReplay uint32\n\tIntegrityFailed uint32\n}\n\nfunc (msg *XfrmStats) Len() int {\n\treturn SizeofXfrmStats\n}\n\nfunc DeserializeXfrmStats(b []byte) *XfrmStats {\n\treturn (*XfrmStats)(unsafe.Pointer(&b[0:SizeofXfrmStats][0]))\n}\n\nfunc (msg *XfrmStats) Serialize() []byte {\n\treturn (*(*[SizeofXfrmStats]byte)(unsafe.Pointer(msg)))[:]\n}\n\n// struct xfrm_usersa_info {\n// struct xfrm_selector sel;\n// struct xfrm_id id;\n// xfrm_address_t saddr;\n// struct xfrm_lifetime_cfg lft;\n// struct xfrm_lifetime_cur curlft;\n// struct xfrm_stats stats;\n// __u32 seq;\n// __u32 reqid;\n// __u16 family;\n// __u8 mode; /* XFRM_MODE_xxx */\n// __u8 replay_window;\n// __u8 flags;\n// #define XFRM_STATE_NOECN 1\n// #define XFRM_STATE_DECAP_DSCP 2\n// #define XFRM_STATE_NOPMTUDISC 4\n// #define XFRM_STATE_WILDRECV 8\n// #define XFRM_STATE_ICMP 16\n// #define XFRM_STATE_AF_UNSPEC 32\n// #define XFRM_STATE_ALIGN4 64\n// #define XFRM_STATE_ESN 128\n// };\n//\n// #define XFRM_SA_XFLAG_DONT_ENCAP_DSCP 1\n//\n\ntype XfrmUsersaInfo struct {\n\tSel XfrmSelector\n\tId XfrmId\n\tSaddr XfrmAddress\n\tLft XfrmLifetimeCfg\n\tCurlft XfrmLifetimeCur\n\tStats XfrmStats\n\tSeq uint32\n\tReqid uint32\n\tFamily uint16\n\tMode uint8\n\tReplayWindow uint8\n\tFlags uint8\n\tPad [7]byte\n}\n\nfunc (msg *XfrmUsersaInfo) Len() int {\n\treturn SizeofXfrmUsersaInfo\n}\n\nfunc DeserializeXfrmUsersaInfo(b []byte) *XfrmUsersaInfo {\n\treturn (*XfrmUsersaInfo)(unsafe.Pointer(&b[0:SizeofXfrmUsersaInfo][0]))\n}\n\nfunc (msg *XfrmUsersaInfo) Serialize() []byte {\n\treturn (*(*[SizeofXfrmUsersaInfo]byte)(unsafe.Pointer(msg)))[:]\n}\n\n// struct xfrm_userspi_info {\n// \tstruct xfrm_usersa_info\t\tinfo;\n// \t__u32\t\t\t\tmin;\n// \t__u32\t\t\t\tmax;\n// };\n\ntype XfrmUserSpiInfo struct {\n\tXfrmUsersaInfo XfrmUsersaInfo\n\tMin uint32\n\tMax uint32\n}\n\nfunc (msg *XfrmUserSpiInfo) Len() int {\n\treturn SizeofXfrmUserSpiInfo\n}\n\nfunc DeserializeXfrmUserSpiInfo(b []byte) *XfrmUserSpiInfo {\n\treturn (*XfrmUserSpiInfo)(unsafe.Pointer(&b[0:SizeofXfrmUserSpiInfo][0]))\n}\n\nfunc (msg *XfrmUserSpiInfo) Serialize() []byte {\n\treturn (*(*[SizeofXfrmUserSpiInfo]byte)(unsafe.Pointer(msg)))[:]\n}\n\n// struct xfrm_algo {\n// char alg_name[64];\n// unsigned int alg_key_len; /* in bits */\n// char alg_key[0];\n// };\n\ntype XfrmAlgo struct {\n\tAlgName [64]byte\n\tAlgKeyLen uint32\n\tAlgKey []byte\n}\n\nfunc (msg *XfrmAlgo) Len() int {\n\treturn SizeofXfrmAlgo + int(msg.AlgKeyLen/8)\n}\n\nfunc DeserializeXfrmAlgo(b []byte) *XfrmAlgo {\n\tret := XfrmAlgo{}\n\tcopy(ret.AlgName[:], b[0:64])\n\tret.AlgKeyLen = *(*uint32)(unsafe.Pointer(&b[64]))\n\tret.AlgKey = b[68:ret.Len()]\n\treturn &ret\n}\n\nfunc (msg *XfrmAlgo) Serialize() []byte {\n\tb := make([]byte, msg.Len())\n\tcopy(b[0:64], msg.AlgName[:])\n\tcopy(b[64:68], (*(*[4]byte)(unsafe.Pointer(&msg.AlgKeyLen)))[:])\n\tcopy(b[68:msg.Len()], msg.AlgKey[:])\n\treturn b\n}\n\n// struct xfrm_algo_auth {\n// char alg_name[64];\n// unsigned int alg_key_len; /* in bits */\n// unsigned int alg_trunc_len; /* in bits */\n// char alg_key[0];\n// };\n\ntype XfrmAlgoAuth struct {\n\tAlgName [64]byte\n\tAlgKeyLen uint32\n\tAlgTruncLen uint32\n\tAlgKey []byte\n}\n\nfunc (msg *XfrmAlgoAuth) Len() int {\n\treturn SizeofXfrmAlgoAuth + int(msg.AlgKeyLen/8)\n}\n\nfunc DeserializeXfrmAlgoAuth(b []byte) *XfrmAlgoAuth {\n\tret := XfrmAlgoAuth{}\n\tcopy(ret.AlgName[:], b[0:64])\n\tret.AlgKeyLen = *(*uint32)(unsafe.Pointer(&b[64]))\n\tret.AlgTruncLen = *(*uint32)(unsafe.Pointer(&b[68]))\n\tret.AlgKey = b[72:ret.Len()]\n\treturn &ret\n}\n\nfunc (msg *XfrmAlgoAuth) Serialize() []byte {\n\tb := make([]byte, msg.Len())\n\tcopy(b[0:64], msg.AlgName[:])\n\tcopy(b[64:68], (*(*[4]byte)(unsafe.Pointer(&msg.AlgKeyLen)))[:])\n\tcopy(b[68:72], (*(*[4]byte)(unsafe.Pointer(&msg.AlgTruncLen)))[:])\n\tcopy(b[72:msg.Len()], msg.AlgKey[:])\n\treturn b\n}\n\n// struct xfrm_algo_aead {\n// char alg_name[64];\n// unsigned int alg_key_len; /* in bits */\n// unsigned int alg_icv_len; /* in bits */\n// char alg_key[0];\n// }\n\ntype XfrmAlgoAEAD struct {\n\tAlgName [64]byte\n\tAlgKeyLen uint32\n\tAlgICVLen uint32\n\tAlgKey []byte\n}\n\nfunc (msg *XfrmAlgoAEAD) Len() int {\n\treturn SizeofXfrmAlgoAEAD + int(msg.AlgKeyLen/8)\n}\n\nfunc DeserializeXfrmAlgoAEAD(b []byte) *XfrmAlgoAEAD {\n\tret := XfrmAlgoAEAD{}\n\tcopy(ret.AlgName[:], b[0:64])\n\tret.AlgKeyLen = *(*uint32)(unsafe.Pointer(&b[64]))\n\tret.AlgICVLen = *(*uint32)(unsafe.Pointer(&b[68]))\n\tret.AlgKey = b[72:ret.Len()]\n\treturn &ret\n}\n\nfunc (msg *XfrmAlgoAEAD) Serialize() []byte {\n\tb := make([]byte, msg.Len())\n\tcopy(b[0:64], msg.AlgName[:])\n\tcopy(b[64:68], (*(*[4]byte)(unsafe.Pointer(&msg.AlgKeyLen)))[:])\n\tcopy(b[68:72], (*(*[4]byte)(unsafe.Pointer(&msg.AlgICVLen)))[:])\n\tcopy(b[72:msg.Len()], msg.AlgKey[:])\n\treturn b\n}\n\n// struct xfrm_encap_tmpl {\n// __u16 encap_type;\n// __be16 encap_sport;\n// __be16 encap_dport;\n// xfrm_address_t encap_oa;\n// };\n\ntype XfrmEncapTmpl struct {\n\tEncapType uint16\n\tEncapSport uint16 // big endian\n\tEncapDport uint16 // big endian\n\tPad [2]byte\n\tEncapOa XfrmAddress\n}\n\nfunc (msg *XfrmEncapTmpl) Len() int {\n\treturn SizeofXfrmEncapTmpl\n}\n\nfunc DeserializeXfrmEncapTmpl(b []byte) *XfrmEncapTmpl {\n\treturn (*XfrmEncapTmpl)(unsafe.Pointer(&b[0:SizeofXfrmEncapTmpl][0]))\n}\n\nfunc (msg *XfrmEncapTmpl) Serialize() []byte {\n\treturn (*(*[SizeofXfrmEncapTmpl]byte)(unsafe.Pointer(msg)))[:]\n}\n\n// struct xfrm_usersa_flush {\n// __u8 proto;\n// };\n\ntype XfrmUsersaFlush struct {\n\tProto uint8\n}\n\nfunc (msg *XfrmUsersaFlush) Len() int {\n\treturn SizeofXfrmUsersaFlush\n}\n\nfunc DeserializeXfrmUsersaFlush(b []byte) *XfrmUsersaFlush {\n\treturn (*XfrmUsersaFlush)(unsafe.Pointer(&b[0:SizeofXfrmUsersaFlush][0]))\n}\n\nfunc (msg *XfrmUsersaFlush) Serialize() []byte {\n\treturn (*(*[SizeofXfrmUsersaFlush]byte)(unsafe.Pointer(msg)))[:]\n}\n\n// struct xfrm_replay_state_esn {\n// unsigned int bmp_len;\n// __u32 oseq;\n// __u32 seq;\n// __u32 oseq_hi;\n// __u32 seq_hi;\n// __u32 replay_window;\n// __u32 bmp[0];\n// };\n\ntype XfrmReplayStateEsn struct {\n\tBmpLen uint32\n\tOSeq uint32\n\tSeq uint32\n\tOSeqHi uint32\n\tSeqHi uint32\n\tReplayWindow uint32\n\tBmp []uint32\n}\n\nfunc (msg *XfrmReplayStateEsn) Serialize() []byte {\n\t// We deliberately do not pass Bmp, as it gets set by the kernel.\n\treturn (*(*[SizeofXfrmReplayStateEsn]byte)(unsafe.Pointer(msg)))[:]\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/order.go", "content": "package netlink\n\nimport (\n\t\"encoding/binary\"\n\n\t\"github.com/vishvananda/netlink/nl\"\n)\n\nvar (\n\tnative = nl.NativeEndian()\n\tnetworkOrder = binary.BigEndian\n)\n\nfunc htonl(val uint32) []byte {\n\tbytes := make([]byte, 4)\n\tbinary.BigEndian.PutUint32(bytes, val)\n\treturn bytes\n}\n\nfunc htons(val uint16) []byte {\n\tbytes := make([]byte, 2)\n\tbinary.BigEndian.PutUint16(bytes, val)\n\treturn bytes\n}\n\nfunc ntohl(buf []byte) uint32 {\n\treturn binary.BigEndian.Uint32(buf)\n}\n\nfunc ntohs(buf []byte) uint16 {\n\treturn binary.BigEndian.Uint16(buf)\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/protinfo.go", "content": "package netlink\n\nimport (\n\t\"strings\"\n)\n\n// Protinfo represents bridge flags from netlink.\ntype Protinfo struct {\n\tHairpin bool\n\tGuard bool\n\tFastLeave bool\n\tRootBlock bool\n\tLearning bool\n\tFlood bool\n\tProxyArp bool\n\tProxyArpWiFi bool\n}\n\n// String returns a list of enabled flags\nfunc (prot *Protinfo) String() string {\n\tif prot == nil {\n\t\treturn \"\"\n\t}\n\n\tvar boolStrings []string\n\tif prot.Hairpin {\n\t\tboolStrings = append(boolStrings, \"Hairpin\")\n\t}\n\tif prot.Guard {\n\t\tboolStrings = append(boolStrings, \"Guard\")\n\t}\n\tif prot.FastLeave {\n\t\tboolStrings = append(boolStrings, \"FastLeave\")\n\t}\n\tif prot.RootBlock {\n\t\tboolStrings = append(boolStrings, \"RootBlock\")\n\t}\n\tif prot.Learning {\n\t\tboolStrings = append(boolStrings, \"Learning\")\n\t}\n\tif prot.Flood {\n\t\tboolStrings = append(boolStrings, \"Flood\")\n\t}\n\tif prot.ProxyArp {\n\t\tboolStrings = append(boolStrings, \"ProxyArp\")\n\t}\n\tif prot.ProxyArpWiFi {\n\t\tboolStrings = append(boolStrings, \"ProxyArpWiFi\")\n\t}\n\treturn strings.Join(boolStrings, \" \")\n}\n\nfunc boolToByte(x bool) []byte {\n\tif x {\n\t\treturn []byte{1}\n\t}\n\treturn []byte{0}\n}\n\nfunc byteToBool(x byte) bool {\n\treturn uint8(x) != 0\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/protinfo_linux.go", "content": "package netlink\n\nimport (\n\t\"fmt\"\n\t\"syscall\"\n\n\t\"github.com/vishvananda/netlink/nl\"\n\t\"golang.org/x/sys/unix\"\n)\n\nfunc LinkGetProtinfo(link Link) (Protinfo, error) {\n\treturn pkgHandle.LinkGetProtinfo(link)\n}\n\nfunc (h *Handle) LinkGetProtinfo(link Link) (Protinfo, error) {\n\tbase := link.Attrs()\n\th.ensureIndex(base)\n\tvar pi Protinfo\n\treq := h.newNetlinkRequest(unix.RTM_GETLINK, unix.NLM_F_DUMP)\n\tmsg := nl.NewIfInfomsg(unix.AF_BRIDGE)\n\treq.AddData(msg)\n\tmsgs, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\tif err != nil {\n\t\treturn pi, err\n\t}\n\n\tfor _, m := range msgs {\n\t\tans := nl.DeserializeIfInfomsg(m)\n\t\tif int(ans.Index) != base.Index {\n\t\t\tcontinue\n\t\t}\n\t\tattrs, err := nl.ParseRouteAttr(m[ans.Len():])\n\t\tif err != nil {\n\t\t\treturn pi, err\n\t\t}\n\t\tfor _, attr := range attrs {\n\t\t\tif attr.Attr.Type != unix.IFLA_PROTINFO|unix.NLA_F_NESTED {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tinfos, err := nl.ParseRouteAttr(attr.Value)\n\t\t\tif err != nil {\n\t\t\t\treturn pi, err\n\t\t\t}\n\t\t\tpi = parseProtinfo(infos)\n\n\t\t\treturn pi, nil\n\t\t}\n\t}\n\treturn pi, fmt.Errorf(\"Device with index %d not found\", base.Index)\n}\n\nfunc parseProtinfo(infos []syscall.NetlinkRouteAttr) (pi Protinfo) {\n\tfor _, info := range infos {\n\t\tswitch info.Attr.Type {\n\t\tcase nl.IFLA_BRPORT_MODE:\n\t\t\tpi.Hairpin = byteToBool(info.Value[0])\n\t\tcase nl.IFLA_BRPORT_GUARD:\n\t\t\tpi.Guard = byteToBool(info.Value[0])\n\t\tcase nl.IFLA_BRPORT_FAST_LEAVE:\n\t\t\tpi.FastLeave = byteToBool(info.Value[0])\n\t\tcase nl.IFLA_BRPORT_PROTECT:\n\t\t\tpi.RootBlock = byteToBool(info.Value[0])\n\t\tcase nl.IFLA_BRPORT_LEARNING:\n\t\t\tpi.Learning = byteToBool(info.Value[0])\n\t\tcase nl.IFLA_BRPORT_UNICAST_FLOOD:\n\t\t\tpi.Flood = byteToBool(info.Value[0])\n\t\tcase nl.IFLA_BRPORT_PROXYARP:\n\t\t\tpi.ProxyArp = byteToBool(info.Value[0])\n\t\tcase nl.IFLA_BRPORT_PROXYARP_WIFI:\n\t\t\tpi.ProxyArpWiFi = byteToBool(info.Value[0])\n\t\t}\n\t}\n\treturn\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/qdisc.go", "content": "package netlink\n\nimport (\n\t\"fmt\"\n\t\"math\"\n)\n\nconst (\n\tHANDLE_NONE = 0\n\tHANDLE_INGRESS = 0xFFFFFFF1\n\tHANDLE_CLSACT = HANDLE_INGRESS\n\tHANDLE_ROOT = 0xFFFFFFFF\n\tPRIORITY_MAP_LEN = 16\n)\nconst (\n\tHANDLE_MIN_INGRESS = 0xFFFFFFF2\n\tHANDLE_MIN_EGRESS = 0xFFFFFFF3\n)\n\ntype Qdisc interface {\n\tAttrs() *QdiscAttrs\n\tType() string\n}\n\n// QdiscAttrs represents a netlink qdisc. A qdisc is associated with a link,\n// has a handle, a parent and a refcnt. The root qdisc of a device should\n// have parent == HANDLE_ROOT.\ntype QdiscAttrs struct {\n\tLinkIndex int\n\tHandle uint32\n\tParent uint32\n\tRefcnt uint32 // read only\n}\n\nfunc (q QdiscAttrs) String() string {\n\treturn fmt.Sprintf(\"{LinkIndex: %d, Handle: %s, Parent: %s, Refcnt: %d}\", q.LinkIndex, HandleStr(q.Handle), HandleStr(q.Parent), q.Refcnt)\n}\n\nfunc MakeHandle(major, minor uint16) uint32 {\n\treturn (uint32(major) << 16) | uint32(minor)\n}\n\nfunc MajorMinor(handle uint32) (uint16, uint16) {\n\treturn uint16((handle & 0xFFFF0000) >> 16), uint16(handle & 0x0000FFFFF)\n}\n\nfunc HandleStr(handle uint32) string {\n\tswitch handle {\n\tcase HANDLE_NONE:\n\t\treturn \"none\"\n\tcase HANDLE_INGRESS:\n\t\treturn \"ingress\"\n\tcase HANDLE_ROOT:\n\t\treturn \"root\"\n\tdefault:\n\t\tmajor, minor := MajorMinor(handle)\n\t\treturn fmt.Sprintf(\"%x:%x\", major, minor)\n\t}\n}\n\nfunc Percentage2u32(percentage float32) uint32 {\n\t// FIXME this is most likely not the best way to convert from % to uint32\n\tif percentage == 100 {\n\t\treturn math.MaxUint32\n\t}\n\treturn uint32(math.MaxUint32 * (percentage / 100))\n}\n\n// PfifoFast is the default qdisc created by the kernel if one has not\n// been defined for the interface\ntype PfifoFast struct {\n\tQdiscAttrs\n\tBands uint8\n\tPriorityMap [PRIORITY_MAP_LEN]uint8\n}\n\nfunc (qdisc *PfifoFast) Attrs() *QdiscAttrs {\n\treturn &qdisc.QdiscAttrs\n}\n\nfunc (qdisc *PfifoFast) Type() string {\n\treturn \"pfifo_fast\"\n}\n\n// Prio is a basic qdisc that works just like PfifoFast\ntype Prio struct {\n\tQdiscAttrs\n\tBands uint8\n\tPriorityMap [PRIORITY_MAP_LEN]uint8\n}\n\nfunc NewPrio(attrs QdiscAttrs) *Prio {\n\treturn &Prio{\n\t\tQdiscAttrs: attrs,\n\t\tBands: 3,\n\t\tPriorityMap: [PRIORITY_MAP_LEN]uint8{1, 2, 2, 2, 1, 2, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1},\n\t}\n}\n\nfunc (qdisc *Prio) Attrs() *QdiscAttrs {\n\treturn &qdisc.QdiscAttrs\n}\n\nfunc (qdisc *Prio) Type() string {\n\treturn \"prio\"\n}\n\n// Htb is a classful qdisc that rate limits based on tokens\ntype Htb struct {\n\tQdiscAttrs\n\tVersion uint32\n\tRate2Quantum uint32\n\tDefcls uint32\n\tDebug uint32\n\tDirectPkts uint32\n}\n\nfunc NewHtb(attrs QdiscAttrs) *Htb {\n\treturn &Htb{\n\t\tQdiscAttrs: attrs,\n\t\tVersion: 3,\n\t\tDefcls: 0,\n\t\tRate2Quantum: 10,\n\t\tDebug: 0,\n\t\tDirectPkts: 0,\n\t}\n}\n\nfunc (qdisc *Htb) Attrs() *QdiscAttrs {\n\treturn &qdisc.QdiscAttrs\n}\n\nfunc (qdisc *Htb) Type() string {\n\treturn \"htb\"\n}\n\n// Netem is a classless qdisc that rate limits based on tokens\n\ntype NetemQdiscAttrs struct {\n\tLatency uint32 // in us\n\tDelayCorr float32 // in %\n\tLimit uint32\n\tLoss float32 // in %\n\tLossCorr float32 // in %\n\tGap uint32\n\tDuplicate float32 // in %\n\tDuplicateCorr float32 // in %\n\tJitter uint32 // in us\n\tReorderProb float32 // in %\n\tReorderCorr float32 // in %\n\tCorruptProb float32 // in %\n\tCorruptCorr float32 // in %\n}\n\nfunc (q NetemQdiscAttrs) String() string {\n\treturn fmt.Sprintf(\n\t\t\"{Latency: %d, Limit: %d, Loss: %f, Gap: %d, Duplicate: %f, Jitter: %d}\",\n\t\tq.Latency, q.Limit, q.Loss, q.Gap, q.Duplicate, q.Jitter,\n\t)\n}\n\ntype Netem struct {\n\tQdiscAttrs\n\tLatency uint32\n\tDelayCorr uint32\n\tLimit uint32\n\tLoss uint32\n\tLossCorr uint32\n\tGap uint32\n\tDuplicate uint32\n\tDuplicateCorr uint32\n\tJitter uint32\n\tReorderProb uint32\n\tReorderCorr uint32\n\tCorruptProb uint32\n\tCorruptCorr uint32\n}\n\nfunc (netem *Netem) String() string {\n\treturn fmt.Sprintf(\n\t\t\"{Latency: %v, Limit: %v, Loss: %v, Gap: %v, Duplicate: %v, Jitter: %v}\",\n\t\tnetem.Latency, netem.Limit, netem.Loss, netem.Gap, netem.Duplicate, netem.Jitter,\n\t)\n}\n\nfunc (qdisc *Netem) Attrs() *QdiscAttrs {\n\treturn &qdisc.QdiscAttrs\n}\n\nfunc (qdisc *Netem) Type() string {\n\treturn \"netem\"\n}\n\n// Tbf is a classless qdisc that rate limits based on tokens\ntype Tbf struct {\n\tQdiscAttrs\n\tRate uint64\n\tLimit uint32\n\tBuffer uint32\n\tPeakrate uint64\n\tMinburst uint32\n\t// TODO: handle other settings\n}\n\nfunc (qdisc *Tbf) Attrs() *QdiscAttrs {\n\treturn &qdisc.QdiscAttrs\n}\n\nfunc (qdisc *Tbf) Type() string {\n\treturn \"tbf\"\n}\n\n// Ingress is a qdisc for adding ingress filters\ntype Ingress struct {\n\tQdiscAttrs\n}\n\nfunc (qdisc *Ingress) Attrs() *QdiscAttrs {\n\treturn &qdisc.QdiscAttrs\n}\n\nfunc (qdisc *Ingress) Type() string {\n\treturn \"ingress\"\n}\n\n// GenericQdisc qdiscs represent types that are not currently understood\n// by this netlink library.\ntype GenericQdisc struct {\n\tQdiscAttrs\n\tQdiscType string\n}\n\nfunc (qdisc *GenericQdisc) Attrs() *QdiscAttrs {\n\treturn &qdisc.QdiscAttrs\n}\n\nfunc (qdisc *GenericQdisc) Type() string {\n\treturn qdisc.QdiscType\n}\n\ntype Hfsc struct {\n\tQdiscAttrs\n\tDefcls uint16\n}\n\nfunc NewHfsc(attrs QdiscAttrs) *Hfsc {\n\treturn &Hfsc{\n\t\tQdiscAttrs: attrs,\n\t\tDefcls: 1,\n\t}\n}\n\nfunc (hfsc *Hfsc) Attrs() *QdiscAttrs {\n\treturn &hfsc.QdiscAttrs\n}\n\nfunc (hfsc *Hfsc) Type() string {\n\treturn \"hfsc\"\n}\n\nfunc (hfsc *Hfsc) String() string {\n\treturn fmt.Sprintf(\n\t\t\"{%v -- default: %d}\",\n\t\thfsc.Attrs(), hfsc.Defcls,\n\t)\n}\n\n// Fq is a classless packet scheduler meant to be mostly used for locally generated traffic.\ntype Fq struct {\n\tQdiscAttrs\n\tPacketLimit uint32\n\tFlowPacketLimit uint32\n\t// In bytes\n\tQuantum uint32\n\tInitialQuantum uint32\n\t// called RateEnable under the hood\n\tPacing uint32\n\tFlowDefaultRate uint32\n\tFlowMaxRate uint32\n\t// called BucketsLog under the hood\n\tBuckets uint32\n\tFlowRefillDelay uint32\n\tLowRateThreshold uint32\n}\n\nfunc (fq *Fq) String() string {\n\treturn fmt.Sprintf(\n\t\t\"{PacketLimit: %v, FlowPacketLimit: %v, Quantum: %v, InitialQuantum: %v, Pacing: %v, FlowDefaultRate: %v, FlowMaxRate: %v, Buckets: %v, FlowRefillDelay: %v, LowRateThreshold: %v}\",\n\t\tfq.PacketLimit, fq.FlowPacketLimit, fq.Quantum, fq.InitialQuantum, fq.Pacing, fq.FlowDefaultRate, fq.FlowMaxRate, fq.Buckets, fq.FlowRefillDelay, fq.LowRateThreshold,\n\t)\n}\n\nfunc NewFq(attrs QdiscAttrs) *Fq {\n\treturn &Fq{\n\t\tQdiscAttrs: attrs,\n\t\tPacing: 1,\n\t}\n}\n\nfunc (qdisc *Fq) Attrs() *QdiscAttrs {\n\treturn &qdisc.QdiscAttrs\n}\n\nfunc (qdisc *Fq) Type() string {\n\treturn \"fq\"\n}\n\n// FQ_Codel (Fair Queuing Controlled Delay) is queuing discipline that combines Fair Queuing with the CoDel AQM scheme.\ntype FqCodel struct {\n\tQdiscAttrs\n\tTarget uint32\n\tLimit uint32\n\tInterval uint32\n\tECN uint32\n\tFlows uint32\n\tQuantum uint32\n\tCEThreshold uint32\n\tDropBatchSize uint32\n\tMemoryLimit uint32\n}\n\nfunc (fqcodel *FqCodel) String() string {\n\treturn fmt.Sprintf(\n\t\t\"{%v -- Target: %v, Limit: %v, Interval: %v, ECM: %v, Flows: %v, Quantum: %v}\",\n\t\tfqcodel.Attrs(), fqcodel.Target, fqcodel.Limit, fqcodel.Interval, fqcodel.ECN, fqcodel.Flows, fqcodel.Quantum,\n\t)\n}\n\nfunc NewFqCodel(attrs QdiscAttrs) *FqCodel {\n\treturn &FqCodel{\n\t\tQdiscAttrs: attrs,\n\t\tECN: 1,\n\t}\n}\n\nfunc (qdisc *FqCodel) Attrs() *QdiscAttrs {\n\treturn &qdisc.QdiscAttrs\n}\n\nfunc (qdisc *FqCodel) Type() string {\n\treturn \"fq_codel\"\n}\n\ntype Sfq struct {\n\tQdiscAttrs\n\t// TODO: Only the simplified options for SFQ are handled here. Support for the extended one can be added later.\n\tQuantum uint8\n\tPerturb uint8\n\tLimit uint32\n\tDivisor uint8\n}\n\nfunc (sfq *Sfq) String() string {\n\treturn fmt.Sprintf(\n\t\t\"{%v -- Quantum: %v, Perturb: %v, Limit: %v, Divisor: %v}\",\n\t\tsfq.Attrs(), sfq.Quantum, sfq.Perturb, sfq.Limit, sfq.Divisor,\n\t)\n}\n\nfunc (qdisc *Sfq) Attrs() *QdiscAttrs {\n\treturn &qdisc.QdiscAttrs\n}\n\nfunc (qdisc *Sfq) Type() string {\n\treturn \"sfq\"\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/qdisc_linux.go", "content": "package netlink\n\nimport (\n\t\"fmt\"\n\t\"io/ioutil\"\n\t\"strconv\"\n\t\"strings\"\n\t\"syscall\"\n\n\t\"github.com/vishvananda/netlink/nl\"\n\t\"golang.org/x/sys/unix\"\n)\n\n// NOTE function is here because it uses other linux functions\nfunc NewNetem(attrs QdiscAttrs, nattrs NetemQdiscAttrs) *Netem {\n\tvar limit uint32 = 1000\n\tvar lossCorr, delayCorr, duplicateCorr uint32\n\tvar reorderProb, reorderCorr uint32\n\tvar corruptProb, corruptCorr uint32\n\n\tlatency := nattrs.Latency\n\tloss := Percentage2u32(nattrs.Loss)\n\tgap := nattrs.Gap\n\tduplicate := Percentage2u32(nattrs.Duplicate)\n\tjitter := nattrs.Jitter\n\n\t// Correlation\n\tif latency > 0 && jitter > 0 {\n\t\tdelayCorr = Percentage2u32(nattrs.DelayCorr)\n\t}\n\tif loss > 0 {\n\t\tlossCorr = Percentage2u32(nattrs.LossCorr)\n\t}\n\tif duplicate > 0 {\n\t\tduplicateCorr = Percentage2u32(nattrs.DuplicateCorr)\n\t}\n\t// FIXME should validate values(like loss/duplicate are percentages...)\n\tlatency = time2Tick(latency)\n\n\tif nattrs.Limit != 0 {\n\t\tlimit = nattrs.Limit\n\t}\n\t// Jitter is only value if latency is > 0\n\tif latency > 0 {\n\t\tjitter = time2Tick(jitter)\n\t}\n\n\treorderProb = Percentage2u32(nattrs.ReorderProb)\n\treorderCorr = Percentage2u32(nattrs.ReorderCorr)\n\n\tif reorderProb > 0 {\n\t\t// ERROR if lantency == 0\n\t\tif gap == 0 {\n\t\t\tgap = 1\n\t\t}\n\t}\n\n\tcorruptProb = Percentage2u32(nattrs.CorruptProb)\n\tcorruptCorr = Percentage2u32(nattrs.CorruptCorr)\n\n\treturn &Netem{\n\t\tQdiscAttrs: attrs,\n\t\tLatency: latency,\n\t\tDelayCorr: delayCorr,\n\t\tLimit: limit,\n\t\tLoss: loss,\n\t\tLossCorr: lossCorr,\n\t\tGap: gap,\n\t\tDuplicate: duplicate,\n\t\tDuplicateCorr: duplicateCorr,\n\t\tJitter: jitter,\n\t\tReorderProb: reorderProb,\n\t\tReorderCorr: reorderCorr,\n\t\tCorruptProb: corruptProb,\n\t\tCorruptCorr: corruptCorr,\n\t}\n}\n\n// QdiscDel will delete a qdisc from the system.\n// Equivalent to: `tc qdisc del $qdisc`\nfunc QdiscDel(qdisc Qdisc) error {\n\treturn pkgHandle.QdiscDel(qdisc)\n}\n\n// QdiscDel will delete a qdisc from the system.\n// Equivalent to: `tc qdisc del $qdisc`\nfunc (h *Handle) QdiscDel(qdisc Qdisc) error {\n\treturn h.qdiscModify(unix.RTM_DELQDISC, 0, qdisc)\n}\n\n// QdiscChange will change a qdisc in place\n// Equivalent to: `tc qdisc change $qdisc`\n// The parent and handle MUST NOT be changed.\nfunc QdiscChange(qdisc Qdisc) error {\n\treturn pkgHandle.QdiscChange(qdisc)\n}\n\n// QdiscChange will change a qdisc in place\n// Equivalent to: `tc qdisc change $qdisc`\n// The parent and handle MUST NOT be changed.\nfunc (h *Handle) QdiscChange(qdisc Qdisc) error {\n\treturn h.qdiscModify(unix.RTM_NEWQDISC, 0, qdisc)\n}\n\n// QdiscReplace will replace a qdisc to the system.\n// Equivalent to: `tc qdisc replace $qdisc`\n// The handle MUST change.\nfunc QdiscReplace(qdisc Qdisc) error {\n\treturn pkgHandle.QdiscReplace(qdisc)\n}\n\n// QdiscReplace will replace a qdisc to the system.\n// Equivalent to: `tc qdisc replace $qdisc`\n// The handle MUST change.\nfunc (h *Handle) QdiscReplace(qdisc Qdisc) error {\n\treturn h.qdiscModify(\n\t\tunix.RTM_NEWQDISC,\n\t\tunix.NLM_F_CREATE|unix.NLM_F_REPLACE,\n\t\tqdisc)\n}\n\n// QdiscAdd will add a qdisc to the system.\n// Equivalent to: `tc qdisc add $qdisc`\nfunc QdiscAdd(qdisc Qdisc) error {\n\treturn pkgHandle.QdiscAdd(qdisc)\n}\n\n// QdiscAdd will add a qdisc to the system.\n// Equivalent to: `tc qdisc add $qdisc`\nfunc (h *Handle) QdiscAdd(qdisc Qdisc) error {\n\treturn h.qdiscModify(\n\t\tunix.RTM_NEWQDISC,\n\t\tunix.NLM_F_CREATE|unix.NLM_F_EXCL,\n\t\tqdisc)\n}\n\nfunc (h *Handle) qdiscModify(cmd, flags int, qdisc Qdisc) error {\n\treq := h.newNetlinkRequest(cmd, flags|unix.NLM_F_ACK)\n\tbase := qdisc.Attrs()\n\tmsg := &nl.TcMsg{\n\t\tFamily: nl.FAMILY_ALL,\n\t\tIfindex: int32(base.LinkIndex),\n\t\tHandle: base.Handle,\n\t\tParent: base.Parent,\n\t}\n\treq.AddData(msg)\n\n\t// When deleting don't bother building the rest of the netlink payload\n\tif cmd != unix.RTM_DELQDISC {\n\t\tif err := qdiscPayload(req, qdisc); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\nfunc qdiscPayload(req *nl.NetlinkRequest, qdisc Qdisc) error {\n\n\treq.AddData(nl.NewRtAttr(nl.TCA_KIND, nl.ZeroTerminated(qdisc.Type())))\n\n\toptions := nl.NewRtAttr(nl.TCA_OPTIONS, nil)\n\n\tswitch qdisc := qdisc.(type) {\n\tcase *Prio:\n\t\ttcmap := nl.TcPrioMap{\n\t\t\tBands: int32(qdisc.Bands),\n\t\t\tPriomap: qdisc.PriorityMap,\n\t\t}\n\t\toptions = nl.NewRtAttr(nl.TCA_OPTIONS, tcmap.Serialize())\n\tcase *Tbf:\n\t\topt := nl.TcTbfQopt{}\n\t\topt.Rate.Rate = uint32(qdisc.Rate)\n\t\topt.Peakrate.Rate = uint32(qdisc.Peakrate)\n\t\topt.Limit = qdisc.Limit\n\t\topt.Buffer = qdisc.Buffer\n\t\toptions.AddRtAttr(nl.TCA_TBF_PARMS, opt.Serialize())\n\t\tif qdisc.Rate >= uint64(1<<32) {\n\t\t\toptions.AddRtAttr(nl.TCA_TBF_RATE64, nl.Uint64Attr(qdisc.Rate))\n\t\t}\n\t\tif qdisc.Peakrate >= uint64(1<<32) {\n\t\t\toptions.AddRtAttr(nl.TCA_TBF_PRATE64, nl.Uint64Attr(qdisc.Peakrate))\n\t\t}\n\t\tif qdisc.Peakrate > 0 {\n\t\t\toptions.AddRtAttr(nl.TCA_TBF_PBURST, nl.Uint32Attr(qdisc.Minburst))\n\t\t}\n\tcase *Htb:\n\t\topt := nl.TcHtbGlob{}\n\t\topt.Version = qdisc.Version\n\t\topt.Rate2Quantum = qdisc.Rate2Quantum\n\t\topt.Defcls = qdisc.Defcls\n\t\t// TODO: Handle Debug properly. For now default to 0\n\t\topt.Debug = qdisc.Debug\n\t\topt.DirectPkts = qdisc.DirectPkts\n\t\toptions.AddRtAttr(nl.TCA_HTB_INIT, opt.Serialize())\n\t\t// options.AddRtAttr(nl.TCA_HTB_DIRECT_QLEN, opt.Serialize())\n\tcase *Hfsc:\n\t\topt := nl.TcHfscOpt{}\n\t\topt.Defcls = qdisc.Defcls\n\t\toptions = nl.NewRtAttr(nl.TCA_OPTIONS, opt.Serialize())\n\tcase *Netem:\n\t\topt := nl.TcNetemQopt{}\n\t\topt.Latency = qdisc.Latency\n\t\topt.Limit = qdisc.Limit\n\t\topt.Loss = qdisc.Loss\n\t\topt.Gap = qdisc.Gap\n\t\topt.Duplicate = qdisc.Duplicate\n\t\topt.Jitter = qdisc.Jitter\n\t\toptions = nl.NewRtAttr(nl.TCA_OPTIONS, opt.Serialize())\n\t\t// Correlation\n\t\tcorr := nl.TcNetemCorr{}\n\t\tcorr.DelayCorr = qdisc.DelayCorr\n\t\tcorr.LossCorr = qdisc.LossCorr\n\t\tcorr.DupCorr = qdisc.DuplicateCorr\n\n\t\tif corr.DelayCorr > 0 || corr.LossCorr > 0 || corr.DupCorr > 0 {\n\t\t\toptions.AddRtAttr(nl.TCA_NETEM_CORR, corr.Serialize())\n\t\t}\n\t\t// Corruption\n\t\tcorruption := nl.TcNetemCorrupt{}\n\t\tcorruption.Probability = qdisc.CorruptProb\n\t\tcorruption.Correlation = qdisc.CorruptCorr\n\t\tif corruption.Probability > 0 {\n\t\t\toptions.AddRtAttr(nl.TCA_NETEM_CORRUPT, corruption.Serialize())\n\t\t}\n\t\t// Reorder\n\t\treorder := nl.TcNetemReorder{}\n\t\treorder.Probability = qdisc.ReorderProb\n\t\treorder.Correlation = qdisc.ReorderCorr\n\t\tif reorder.Probability > 0 {\n\t\t\toptions.AddRtAttr(nl.TCA_NETEM_REORDER, reorder.Serialize())\n\t\t}\n\tcase *Ingress:\n\t\t// ingress filters must use the proper handle\n\t\tif qdisc.Attrs().Parent != HANDLE_INGRESS {\n\t\t\treturn fmt.Errorf(\"Ingress filters must set Parent to HANDLE_INGRESS\")\n\t\t}\n\tcase *FqCodel:\n\t\toptions.AddRtAttr(nl.TCA_FQ_CODEL_ECN, nl.Uint32Attr((uint32(qdisc.ECN))))\n\t\tif qdisc.Limit > 0 {\n\t\t\toptions.AddRtAttr(nl.TCA_FQ_CODEL_LIMIT, nl.Uint32Attr((uint32(qdisc.Limit))))\n\t\t}\n\t\tif qdisc.Interval > 0 {\n\t\t\toptions.AddRtAttr(nl.TCA_FQ_CODEL_INTERVAL, nl.Uint32Attr((uint32(qdisc.Interval))))\n\t\t}\n\t\tif qdisc.Flows > 0 {\n\t\t\toptions.AddRtAttr(nl.TCA_FQ_CODEL_FLOWS, nl.Uint32Attr((uint32(qdisc.Flows))))\n\t\t}\n\t\tif qdisc.Quantum > 0 {\n\t\t\toptions.AddRtAttr(nl.TCA_FQ_CODEL_QUANTUM, nl.Uint32Attr((uint32(qdisc.Quantum))))\n\t\t}\n\t\tif qdisc.CEThreshold > 0 {\n\t\t\toptions.AddRtAttr(nl.TCA_FQ_CODEL_CE_THRESHOLD, nl.Uint32Attr(qdisc.CEThreshold))\n\t\t}\n\t\tif qdisc.DropBatchSize > 0 {\n\t\t\toptions.AddRtAttr(nl.TCA_FQ_CODEL_DROP_BATCH_SIZE, nl.Uint32Attr(qdisc.DropBatchSize))\n\t\t}\n\t\tif qdisc.MemoryLimit > 0 {\n\t\t\toptions.AddRtAttr(nl.TCA_FQ_CODEL_MEMORY_LIMIT, nl.Uint32Attr(qdisc.MemoryLimit))\n\t\t}\n\tcase *Fq:\n\t\toptions.AddRtAttr(nl.TCA_FQ_RATE_ENABLE, nl.Uint32Attr((uint32(qdisc.Pacing))))\n\n\t\tif qdisc.Buckets > 0 {\n\t\t\toptions.AddRtAttr(nl.TCA_FQ_BUCKETS_LOG, nl.Uint32Attr((uint32(qdisc.Buckets))))\n\t\t}\n\t\tif qdisc.LowRateThreshold > 0 {\n\t\t\toptions.AddRtAttr(nl.TCA_FQ_LOW_RATE_THRESHOLD, nl.Uint32Attr((uint32(qdisc.LowRateThreshold))))\n\t\t}\n\t\tif qdisc.Quantum > 0 {\n\t\t\toptions.AddRtAttr(nl.TCA_FQ_QUANTUM, nl.Uint32Attr((uint32(qdisc.Quantum))))\n\t\t}\n\t\tif qdisc.InitialQuantum > 0 {\n\t\t\toptions.AddRtAttr(nl.TCA_FQ_INITIAL_QUANTUM, nl.Uint32Attr((uint32(qdisc.InitialQuantum))))\n\t\t}\n\t\tif qdisc.FlowRefillDelay > 0 {\n\t\t\toptions.AddRtAttr(nl.TCA_FQ_FLOW_REFILL_DELAY, nl.Uint32Attr((uint32(qdisc.FlowRefillDelay))))\n\t\t}\n\t\tif qdisc.FlowPacketLimit > 0 {\n\t\t\toptions.AddRtAttr(nl.TCA_FQ_FLOW_PLIMIT, nl.Uint32Attr((uint32(qdisc.FlowPacketLimit))))\n\t\t}\n\t\tif qdisc.FlowMaxRate > 0 {\n\t\t\toptions.AddRtAttr(nl.TCA_FQ_FLOW_MAX_RATE, nl.Uint32Attr((uint32(qdisc.FlowMaxRate))))\n\t\t}\n\t\tif qdisc.FlowDefaultRate > 0 {\n\t\t\toptions.AddRtAttr(nl.TCA_FQ_FLOW_DEFAULT_RATE, nl.Uint32Attr((uint32(qdisc.FlowDefaultRate))))\n\t\t}\n\tcase *Sfq:\n\t\topt := nl.TcSfqQoptV1{}\n\t\topt.TcSfqQopt.Quantum = qdisc.Quantum\n\t\topt.TcSfqQopt.Perturb = int32(qdisc.Perturb)\n\t\topt.TcSfqQopt.Limit = qdisc.Limit\n\t\topt.TcSfqQopt.Divisor = qdisc.Divisor\n\n\t\toptions = nl.NewRtAttr(nl.TCA_OPTIONS, opt.Serialize())\n\tdefault:\n\t\toptions = nil\n\t}\n\n\tif options != nil {\n\t\treq.AddData(options)\n\t}\n\treturn nil\n}\n\n// QdiscList gets a list of qdiscs in the system.\n// Equivalent to: `tc qdisc show`.\n// The list can be filtered by link.\nfunc QdiscList(link Link) ([]Qdisc, error) {\n\treturn pkgHandle.QdiscList(link)\n}\n\n// QdiscList gets a list of qdiscs in the system.\n// Equivalent to: `tc qdisc show`.\n// The list can be filtered by link.\nfunc (h *Handle) QdiscList(link Link) ([]Qdisc, error) {\n\treq := h.newNetlinkRequest(unix.RTM_GETQDISC, unix.NLM_F_DUMP)\n\tindex := int32(0)\n\tif link != nil {\n\t\tbase := link.Attrs()\n\t\th.ensureIndex(base)\n\t\tindex = int32(base.Index)\n\t}\n\tmsg := &nl.TcMsg{\n\t\tFamily: nl.FAMILY_ALL,\n\t\tIfindex: index,\n\t}\n\treq.AddData(msg)\n\n\tmsgs, err := req.Execute(unix.NETLINK_ROUTE, unix.RTM_NEWQDISC)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tvar res []Qdisc\n\tfor _, m := range msgs {\n\t\tmsg := nl.DeserializeTcMsg(m)\n\n\t\tattrs, err := nl.ParseRouteAttr(m[msg.Len():])\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\n\t\t// skip qdiscs from other interfaces\n\t\tif link != nil && msg.Ifindex != index {\n\t\t\tcontinue\n\t\t}\n\n\t\tbase := QdiscAttrs{\n\t\t\tLinkIndex: int(msg.Ifindex),\n\t\t\tHandle: msg.Handle,\n\t\t\tParent: msg.Parent,\n\t\t\tRefcnt: msg.Info,\n\t\t}\n\t\tvar qdisc Qdisc\n\t\tqdiscType := \"\"\n\t\tfor _, attr := range attrs {\n\t\t\tswitch attr.Attr.Type {\n\t\t\tcase nl.TCA_KIND:\n\t\t\t\tqdiscType = string(attr.Value[:len(attr.Value)-1])\n\t\t\t\tswitch qdiscType {\n\t\t\t\tcase \"pfifo_fast\":\n\t\t\t\t\tqdisc = &PfifoFast{}\n\t\t\t\tcase \"prio\":\n\t\t\t\t\tqdisc = &Prio{}\n\t\t\t\tcase \"tbf\":\n\t\t\t\t\tqdisc = &Tbf{}\n\t\t\t\tcase \"ingress\":\n\t\t\t\t\tqdisc = &Ingress{}\n\t\t\t\tcase \"htb\":\n\t\t\t\t\tqdisc = &Htb{}\n\t\t\t\tcase \"fq\":\n\t\t\t\t\tqdisc = &Fq{}\n\t\t\t\tcase \"hfsc\":\n\t\t\t\t\tqdisc = &Hfsc{}\n\t\t\t\tcase \"fq_codel\":\n\t\t\t\t\tqdisc = &FqCodel{}\n\t\t\t\tcase \"netem\":\n\t\t\t\t\tqdisc = &Netem{}\n\t\t\t\tcase \"sfq\":\n\t\t\t\t\tqdisc = &Sfq{}\n\t\t\t\tdefault:\n\t\t\t\t\tqdisc = &GenericQdisc{QdiscType: qdiscType}\n\t\t\t\t}\n\t\t\tcase nl.TCA_OPTIONS:\n\t\t\t\tswitch qdiscType {\n\t\t\t\tcase \"pfifo_fast\":\n\t\t\t\t\t// pfifo returns TcPrioMap directly without wrapping it in rtattr\n\t\t\t\t\tif err := parsePfifoFastData(qdisc, attr.Value); err != nil {\n\t\t\t\t\t\treturn nil, err\n\t\t\t\t\t}\n\t\t\t\tcase \"prio\":\n\t\t\t\t\t// prio returns TcPrioMap directly without wrapping it in rtattr\n\t\t\t\t\tif err := parsePrioData(qdisc, attr.Value); err != nil {\n\t\t\t\t\t\treturn nil, err\n\t\t\t\t\t}\n\t\t\t\tcase \"tbf\":\n\t\t\t\t\tdata, err := nl.ParseRouteAttr(attr.Value)\n\t\t\t\t\tif err != nil {\n\t\t\t\t\t\treturn nil, err\n\t\t\t\t\t}\n\t\t\t\t\tif err := parseTbfData(qdisc, data); err != nil {\n\t\t\t\t\t\treturn nil, err\n\t\t\t\t\t}\n\t\t\t\tcase \"hfsc\":\n\t\t\t\t\tif err := parseHfscData(qdisc, attr.Value); err != nil {\n\t\t\t\t\t\treturn nil, err\n\t\t\t\t\t}\n\t\t\t\tcase \"htb\":\n\t\t\t\t\tdata, err := nl.ParseRouteAttr(attr.Value)\n\t\t\t\t\tif err != nil {\n\t\t\t\t\t\treturn nil, err\n\t\t\t\t\t}\n\t\t\t\t\tif err := parseHtbData(qdisc, data); err != nil {\n\t\t\t\t\t\treturn nil, err\n\t\t\t\t\t}\n\t\t\t\tcase \"fq\":\n\t\t\t\t\tdata, err := nl.ParseRouteAttr(attr.Value)\n\t\t\t\t\tif err != nil {\n\t\t\t\t\t\treturn nil, err\n\t\t\t\t\t}\n\t\t\t\t\tif err := parseFqData(qdisc, data); err != nil {\n\t\t\t\t\t\treturn nil, err\n\t\t\t\t\t}\n\t\t\t\tcase \"fq_codel\":\n\t\t\t\t\tdata, err := nl.ParseRouteAttr(attr.Value)\n\t\t\t\t\tif err != nil {\n\t\t\t\t\t\treturn nil, err\n\t\t\t\t\t}\n\t\t\t\t\tif err := parseFqCodelData(qdisc, data); err != nil {\n\t\t\t\t\t\treturn nil, err\n\t\t\t\t\t}\n\t\t\t\tcase \"netem\":\n\t\t\t\t\tif err := parseNetemData(qdisc, attr.Value); err != nil {\n\t\t\t\t\t\treturn nil, err\n\t\t\t\t\t}\n\t\t\t\tcase \"sfq\":\n\t\t\t\t\tif err := parseSfqData(qdisc, attr.Value); err != nil {\n\t\t\t\t\t\treturn nil, err\n\t\t\t\t\t}\n\n\t\t\t\t\t// no options for ingress\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t*qdisc.Attrs() = base\n\t\tres = append(res, qdisc)\n\t}\n\n\treturn res, nil\n}\n\nfunc parsePfifoFastData(qdisc Qdisc, value []byte) error {\n\tpfifo := qdisc.(*PfifoFast)\n\ttcmap := nl.DeserializeTcPrioMap(value)\n\tpfifo.PriorityMap = tcmap.Priomap\n\tpfifo.Bands = uint8(tcmap.Bands)\n\treturn nil\n}\n\nfunc parsePrioData(qdisc Qdisc, value []byte) error {\n\tprio := qdisc.(*Prio)\n\ttcmap := nl.DeserializeTcPrioMap(value)\n\tprio.PriorityMap = tcmap.Priomap\n\tprio.Bands = uint8(tcmap.Bands)\n\treturn nil\n}\n\nfunc parseHtbData(qdisc Qdisc, data []syscall.NetlinkRouteAttr) error {\n\thtb := qdisc.(*Htb)\n\tfor _, datum := range data {\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.TCA_HTB_INIT:\n\t\t\topt := nl.DeserializeTcHtbGlob(datum.Value)\n\t\t\thtb.Version = opt.Version\n\t\t\thtb.Rate2Quantum = opt.Rate2Quantum\n\t\t\thtb.Defcls = opt.Defcls\n\t\t\thtb.Debug = opt.Debug\n\t\t\thtb.DirectPkts = opt.DirectPkts\n\t\tcase nl.TCA_HTB_DIRECT_QLEN:\n\t\t\t// TODO\n\t\t\t//htb.DirectQlen = native.uint32(datum.Value)\n\t\t}\n\t}\n\treturn nil\n}\n\nfunc parseFqCodelData(qdisc Qdisc, data []syscall.NetlinkRouteAttr) error {\n\tfqCodel := qdisc.(*FqCodel)\n\tfor _, datum := range data {\n\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.TCA_FQ_CODEL_TARGET:\n\t\t\tfqCodel.Target = native.Uint32(datum.Value)\n\t\tcase nl.TCA_FQ_CODEL_LIMIT:\n\t\t\tfqCodel.Limit = native.Uint32(datum.Value)\n\t\tcase nl.TCA_FQ_CODEL_INTERVAL:\n\t\t\tfqCodel.Interval = native.Uint32(datum.Value)\n\t\tcase nl.TCA_FQ_CODEL_ECN:\n\t\t\tfqCodel.ECN = native.Uint32(datum.Value)\n\t\tcase nl.TCA_FQ_CODEL_FLOWS:\n\t\t\tfqCodel.Flows = native.Uint32(datum.Value)\n\t\tcase nl.TCA_FQ_CODEL_QUANTUM:\n\t\t\tfqCodel.Quantum = native.Uint32(datum.Value)\n\t\tcase nl.TCA_FQ_CODEL_CE_THRESHOLD:\n\t\t\tfqCodel.CEThreshold = native.Uint32(datum.Value)\n\t\tcase nl.TCA_FQ_CODEL_DROP_BATCH_SIZE:\n\t\t\tfqCodel.DropBatchSize = native.Uint32(datum.Value)\n\t\tcase nl.TCA_FQ_CODEL_MEMORY_LIMIT:\n\t\t\tfqCodel.MemoryLimit = native.Uint32(datum.Value)\n\t\t}\n\t}\n\treturn nil\n}\n\nfunc parseHfscData(qdisc Qdisc, data []byte) error {\n\tHfsc := qdisc.(*Hfsc)\n\tHfsc.Defcls = native.Uint16(data)\n\treturn nil\n}\n\nfunc parseFqData(qdisc Qdisc, data []syscall.NetlinkRouteAttr) error {\n\tfq := qdisc.(*Fq)\n\tfor _, datum := range data {\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.TCA_FQ_BUCKETS_LOG:\n\t\t\tfq.Buckets = native.Uint32(datum.Value)\n\t\tcase nl.TCA_FQ_LOW_RATE_THRESHOLD:\n\t\t\tfq.LowRateThreshold = native.Uint32(datum.Value)\n\t\tcase nl.TCA_FQ_QUANTUM:\n\t\t\tfq.Quantum = native.Uint32(datum.Value)\n\t\tcase nl.TCA_FQ_RATE_ENABLE:\n\t\t\tfq.Pacing = native.Uint32(datum.Value)\n\t\tcase nl.TCA_FQ_INITIAL_QUANTUM:\n\t\t\tfq.InitialQuantum = native.Uint32(datum.Value)\n\t\tcase nl.TCA_FQ_ORPHAN_MASK:\n\t\t\t// TODO\n\t\tcase nl.TCA_FQ_FLOW_REFILL_DELAY:\n\t\t\tfq.FlowRefillDelay = native.Uint32(datum.Value)\n\t\tcase nl.TCA_FQ_FLOW_PLIMIT:\n\t\t\tfq.FlowPacketLimit = native.Uint32(datum.Value)\n\t\tcase nl.TCA_FQ_PLIMIT:\n\t\t\tfq.PacketLimit = native.Uint32(datum.Value)\n\t\tcase nl.TCA_FQ_FLOW_MAX_RATE:\n\t\t\tfq.FlowMaxRate = native.Uint32(datum.Value)\n\t\tcase nl.TCA_FQ_FLOW_DEFAULT_RATE:\n\t\t\tfq.FlowDefaultRate = native.Uint32(datum.Value)\n\t\t}\n\t}\n\treturn nil\n}\n\nfunc parseNetemData(qdisc Qdisc, value []byte) error {\n\tnetem := qdisc.(*Netem)\n\topt := nl.DeserializeTcNetemQopt(value)\n\tnetem.Latency = opt.Latency\n\tnetem.Limit = opt.Limit\n\tnetem.Loss = opt.Loss\n\tnetem.Gap = opt.Gap\n\tnetem.Duplicate = opt.Duplicate\n\tnetem.Jitter = opt.Jitter\n\tdata, err := nl.ParseRouteAttr(value[nl.SizeofTcNetemQopt:])\n\tif err != nil {\n\t\treturn err\n\t}\n\tfor _, datum := range data {\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.TCA_NETEM_CORR:\n\t\t\topt := nl.DeserializeTcNetemCorr(datum.Value)\n\t\t\tnetem.DelayCorr = opt.DelayCorr\n\t\t\tnetem.LossCorr = opt.LossCorr\n\t\t\tnetem.DuplicateCorr = opt.DupCorr\n\t\tcase nl.TCA_NETEM_CORRUPT:\n\t\t\topt := nl.DeserializeTcNetemCorrupt(datum.Value)\n\t\t\tnetem.CorruptProb = opt.Probability\n\t\t\tnetem.CorruptCorr = opt.Correlation\n\t\tcase nl.TCA_NETEM_REORDER:\n\t\t\topt := nl.DeserializeTcNetemReorder(datum.Value)\n\t\t\tnetem.ReorderProb = opt.Probability\n\t\t\tnetem.ReorderCorr = opt.Correlation\n\t\t}\n\t}\n\treturn nil\n}\n\nfunc parseTbfData(qdisc Qdisc, data []syscall.NetlinkRouteAttr) error {\n\ttbf := qdisc.(*Tbf)\n\tfor _, datum := range data {\n\t\tswitch datum.Attr.Type {\n\t\tcase nl.TCA_TBF_PARMS:\n\t\t\topt := nl.DeserializeTcTbfQopt(datum.Value)\n\t\t\ttbf.Rate = uint64(opt.Rate.Rate)\n\t\t\ttbf.Peakrate = uint64(opt.Peakrate.Rate)\n\t\t\ttbf.Limit = opt.Limit\n\t\t\ttbf.Buffer = opt.Buffer\n\t\tcase nl.TCA_TBF_RATE64:\n\t\t\ttbf.Rate = native.Uint64(datum.Value[0:8])\n\t\tcase nl.TCA_TBF_PRATE64:\n\t\t\ttbf.Peakrate = native.Uint64(datum.Value[0:8])\n\t\tcase nl.TCA_TBF_PBURST:\n\t\t\ttbf.Minburst = native.Uint32(datum.Value[0:4])\n\t\t}\n\t}\n\treturn nil\n}\n\nfunc parseSfqData(qdisc Qdisc, value []byte) error {\n\tsfq := qdisc.(*Sfq)\n\topt := nl.DeserializeTcSfqQoptV1(value)\n\tsfq.Quantum = opt.TcSfqQopt.Quantum\n\tsfq.Perturb = uint8(opt.TcSfqQopt.Perturb)\n\tsfq.Limit = opt.TcSfqQopt.Limit\n\tsfq.Divisor = opt.TcSfqQopt.Divisor\n\n\treturn nil\n}\n\nconst (\n\tTIME_UNITS_PER_SEC = 1000000\n)\n\nvar (\n\ttickInUsec float64\n\tclockFactor float64\n\thz float64\n)\n\nfunc initClock() {\n\tdata, err := ioutil.ReadFile(\"/proc/net/psched\")\n\tif err != nil {\n\t\treturn\n\t}\n\tparts := strings.Split(strings.TrimSpace(string(data)), \" \")\n\tif len(parts) < 4 {\n\t\treturn\n\t}\n\tvar vals [4]uint64\n\tfor i := range vals {\n\t\tval, err := strconv.ParseUint(parts[i], 16, 32)\n\t\tif err != nil {\n\t\t\treturn\n\t\t}\n\t\tvals[i] = val\n\t}\n\t// compatibility\n\tif vals[2] == 1000000000 {\n\t\tvals[0] = vals[1]\n\t}\n\tclockFactor = float64(vals[2]) / TIME_UNITS_PER_SEC\n\ttickInUsec = float64(vals[0]) / float64(vals[1]) * clockFactor\n\tif vals[2] == 1000000 {\n\t\t// ref https://git.kernel.org/pub/scm/network/iproute2/iproute2.git/tree/lib/utils.c#n963\n\t\thz = float64(vals[3])\n\t} else {\n\t\thz = 100\n\t}\n}\n\nfunc TickInUsec() float64 {\n\tif tickInUsec == 0.0 {\n\t\tinitClock()\n\t}\n\treturn tickInUsec\n}\n\nfunc ClockFactor() float64 {\n\tif clockFactor == 0.0 {\n\t\tinitClock()\n\t}\n\treturn clockFactor\n}\n\nfunc Hz() float64 {\n\tif hz == 0.0 {\n\t\tinitClock()\n\t}\n\treturn hz\n}\n\nfunc time2Tick(time uint32) uint32 {\n\treturn uint32(float64(time) * TickInUsec())\n}\n\nfunc tick2Time(tick uint32) uint32 {\n\treturn uint32(float64(tick) / TickInUsec())\n}\n\nfunc time2Ktime(time uint32) uint32 {\n\treturn uint32(float64(time) * ClockFactor())\n}\n\nfunc ktime2Time(ktime uint32) uint32 {\n\treturn uint32(float64(ktime) / ClockFactor())\n}\n\nfunc burst(rate uint64, buffer uint32) uint32 {\n\treturn uint32(float64(rate) * float64(tick2Time(buffer)) / TIME_UNITS_PER_SEC)\n}\n\nfunc latency(rate uint64, limit, buffer uint32) float64 {\n\treturn TIME_UNITS_PER_SEC*(float64(limit)/float64(rate)) - float64(tick2Time(buffer))\n}\n\nfunc Xmittime(rate uint64, size uint32) uint32 {\n\t// https://git.kernel.org/pub/scm/network/iproute2/iproute2.git/tree/tc/tc_core.c#n62\n\treturn time2Tick(uint32(TIME_UNITS_PER_SEC * (float64(size) / float64(rate))))\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/rdma_link_linux.go", "content": "package netlink\n\nimport (\n\t\"bytes\"\n\t\"encoding/binary\"\n\t\"fmt\"\n\t\"net\"\n\n\t\"github.com/vishvananda/netlink/nl\"\n\t\"golang.org/x/sys/unix\"\n)\n\n// LinkAttrs represents data shared by most link types\ntype RdmaLinkAttrs struct {\n\tIndex uint32\n\tName string\n\tFirmwareVersion string\n\tNodeGuid string\n\tSysImageGuid string\n}\n\n// Link represents a rdma device from netlink.\ntype RdmaLink struct {\n\tAttrs RdmaLinkAttrs\n}\n\nfunc getProtoField(clientType int, op int) int {\n\treturn ((clientType << nl.RDMA_NL_GET_CLIENT_SHIFT) | op)\n}\n\nfunc uint64ToGuidString(guid uint64) string {\n\t//Convert to byte array\n\tsysGuidBytes := new(bytes.Buffer)\n\tbinary.Write(sysGuidBytes, binary.LittleEndian, guid)\n\n\t//Convert to HardwareAddr\n\tsysGuidNet := net.HardwareAddr(sysGuidBytes.Bytes())\n\n\t//Get the String\n\treturn sysGuidNet.String()\n}\n\nfunc executeOneGetRdmaLink(data []byte) (*RdmaLink, error) {\n\n\tlink := RdmaLink{}\n\n\treader := bytes.NewReader(data)\n\tfor reader.Len() >= 4 {\n\t\t_, attrType, len, value := parseNfAttrTLV(reader)\n\n\t\tswitch attrType {\n\t\tcase nl.RDMA_NLDEV_ATTR_DEV_INDEX:\n\t\t\tvar Index uint32\n\t\t\tr := bytes.NewReader(value)\n\t\t\tbinary.Read(r, nl.NativeEndian(), &Index)\n\t\t\tlink.Attrs.Index = Index\n\t\tcase nl.RDMA_NLDEV_ATTR_DEV_NAME:\n\t\t\tlink.Attrs.Name = string(value[0 : len-1])\n\t\tcase nl.RDMA_NLDEV_ATTR_FW_VERSION:\n\t\t\tlink.Attrs.FirmwareVersion = string(value[0 : len-1])\n\t\tcase nl.RDMA_NLDEV_ATTR_NODE_GUID:\n\t\t\tvar guid uint64\n\t\t\tr := bytes.NewReader(value)\n\t\t\tbinary.Read(r, nl.NativeEndian(), &guid)\n\t\t\tlink.Attrs.NodeGuid = uint64ToGuidString(guid)\n\t\tcase nl.RDMA_NLDEV_ATTR_SYS_IMAGE_GUID:\n\t\t\tvar sysGuid uint64\n\t\t\tr := bytes.NewReader(value)\n\t\t\tbinary.Read(r, nl.NativeEndian(), &sysGuid)\n\t\t\tlink.Attrs.SysImageGuid = uint64ToGuidString(sysGuid)\n\t\t}\n\t\tif (len % 4) != 0 {\n\t\t\t// Skip pad bytes\n\t\t\treader.Seek(int64(4-(len%4)), seekCurrent)\n\t\t}\n\t}\n\treturn &link, nil\n}\n\nfunc execRdmaSetLink(req *nl.NetlinkRequest) error {\n\n\t_, err := req.Execute(unix.NETLINK_RDMA, 0)\n\treturn err\n}\n\n// RdmaLinkList gets a list of RDMA link devices.\n// Equivalent to: `rdma dev show`\nfunc RdmaLinkList() ([]*RdmaLink, error) {\n\treturn pkgHandle.RdmaLinkList()\n}\n\n// RdmaLinkList gets a list of RDMA link devices.\n// Equivalent to: `rdma dev show`\nfunc (h *Handle) RdmaLinkList() ([]*RdmaLink, error) {\n\tproto := getProtoField(nl.RDMA_NL_NLDEV, nl.RDMA_NLDEV_CMD_GET)\n\treq := h.newNetlinkRequest(proto, unix.NLM_F_ACK|unix.NLM_F_DUMP)\n\n\tmsgs, err := req.Execute(unix.NETLINK_RDMA, 0)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tvar res []*RdmaLink\n\tfor _, m := range msgs {\n\t\tlink, err := executeOneGetRdmaLink(m)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tres = append(res, link)\n\t}\n\n\treturn res, nil\n}\n\n// RdmaLinkByName finds a link by name and returns a pointer to the object if\n// found and nil error, otherwise returns error code.\nfunc RdmaLinkByName(name string) (*RdmaLink, error) {\n\treturn pkgHandle.RdmaLinkByName(name)\n}\n\n// RdmaLinkByName finds a link by name and returns a pointer to the object if\n// found and nil error, otherwise returns error code.\nfunc (h *Handle) RdmaLinkByName(name string) (*RdmaLink, error) {\n\tlinks, err := h.RdmaLinkList()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tfor _, link := range links {\n\t\tif link.Attrs.Name == name {\n\t\t\treturn link, nil\n\t\t}\n\t}\n\treturn nil, fmt.Errorf(\"Rdma device %v not found\", name)\n}\n\n// RdmaLinkSetName sets the name of the rdma link device. Return nil on success\n// or error otherwise.\n// Equivalent to: `rdma dev set $old_devname name $name`\nfunc RdmaLinkSetName(link *RdmaLink, name string) error {\n\treturn pkgHandle.RdmaLinkSetName(link, name)\n}\n\n// RdmaLinkSetName sets the name of the rdma link device. Return nil on success\n// or error otherwise.\n// Equivalent to: `rdma dev set $old_devname name $name`\nfunc (h *Handle) RdmaLinkSetName(link *RdmaLink, name string) error {\n\tproto := getProtoField(nl.RDMA_NL_NLDEV, nl.RDMA_NLDEV_CMD_SET)\n\treq := h.newNetlinkRequest(proto, unix.NLM_F_ACK)\n\n\tb := make([]byte, 4)\n\tnative.PutUint32(b, uint32(link.Attrs.Index))\n\tdata := nl.NewRtAttr(nl.RDMA_NLDEV_ATTR_DEV_INDEX, b)\n\treq.AddData(data)\n\n\tb = make([]byte, len(name)+1)\n\tcopy(b, name)\n\tdata = nl.NewRtAttr(nl.RDMA_NLDEV_ATTR_DEV_NAME, b)\n\treq.AddData(data)\n\n\treturn execRdmaSetLink(req)\n}\n\nfunc netnsModeToString(mode uint8) string {\n\tswitch mode {\n\tcase 0:\n\t\treturn \"exclusive\"\n\tcase 1:\n\t\treturn \"shared\"\n\tdefault:\n\t\treturn \"unknown\"\n\t}\n}\n\nfunc executeOneGetRdmaNetnsMode(data []byte) (string, error) {\n\treader := bytes.NewReader(data)\n\tfor reader.Len() >= 4 {\n\t\t_, attrType, len, value := parseNfAttrTLV(reader)\n\n\t\tswitch attrType {\n\t\tcase nl.RDMA_NLDEV_SYS_ATTR_NETNS_MODE:\n\t\t\tvar mode uint8\n\t\t\tr := bytes.NewReader(value)\n\t\t\tbinary.Read(r, nl.NativeEndian(), &mode)\n\t\t\treturn netnsModeToString(mode), nil\n\t\t}\n\t\tif (len % 4) != 0 {\n\t\t\t// Skip pad bytes\n\t\t\treader.Seek(int64(4-(len%4)), seekCurrent)\n\t\t}\n\t}\n\treturn \"\", fmt.Errorf(\"Invalid netns mode\")\n}\n\n// RdmaSystemGetNetnsMode gets the net namespace mode for RDMA subsystem\n// Returns mode string and error status as nil on success or returns error\n// otherwise.\n// Equivalent to: `rdma system show netns'\nfunc RdmaSystemGetNetnsMode() (string, error) {\n\treturn pkgHandle.RdmaSystemGetNetnsMode()\n}\n\n// RdmaSystemGetNetnsMode gets the net namespace mode for RDMA subsystem\n// Returns mode string and error status as nil on success or returns error\n// otherwise.\n// Equivalent to: `rdma system show netns'\nfunc (h *Handle) RdmaSystemGetNetnsMode() (string, error) {\n\n\tproto := getProtoField(nl.RDMA_NL_NLDEV, nl.RDMA_NLDEV_CMD_SYS_GET)\n\treq := h.newNetlinkRequest(proto, unix.NLM_F_ACK)\n\n\tmsgs, err := req.Execute(unix.NETLINK_RDMA, 0)\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\tif len(msgs) == 0 {\n\t\treturn \"\", fmt.Errorf(\"No valid response from kernel\")\n\t}\n\treturn executeOneGetRdmaNetnsMode(msgs[0])\n}\n\nfunc netnsModeStringToUint8(mode string) (uint8, error) {\n\tswitch mode {\n\tcase \"exclusive\":\n\t\treturn 0, nil\n\tcase \"shared\":\n\t\treturn 1, nil\n\tdefault:\n\t\treturn 0, fmt.Errorf(\"Invalid mode; %q\", mode)\n\t}\n}\n\n// RdmaSystemSetNetnsMode sets the net namespace mode for RDMA subsystem\n// Returns nil on success or appropriate error code.\n// Equivalent to: `rdma system set netns { shared | exclusive }'\nfunc RdmaSystemSetNetnsMode(NewMode string) error {\n\treturn pkgHandle.RdmaSystemSetNetnsMode(NewMode)\n}\n\n// RdmaSystemSetNetnsMode sets the net namespace mode for RDMA subsystem\n// Returns nil on success or appropriate error code.\n// Equivalent to: `rdma system set netns { shared | exclusive }'\nfunc (h *Handle) RdmaSystemSetNetnsMode(NewMode string) error {\n\tvalue, err := netnsModeStringToUint8(NewMode)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tproto := getProtoField(nl.RDMA_NL_NLDEV, nl.RDMA_NLDEV_CMD_SYS_SET)\n\treq := h.newNetlinkRequest(proto, unix.NLM_F_ACK)\n\n\tdata := nl.NewRtAttr(nl.RDMA_NLDEV_SYS_ATTR_NETNS_MODE, []byte{value})\n\treq.AddData(data)\n\n\t_, err = req.Execute(unix.NETLINK_RDMA, 0)\n\treturn err\n}\n\n// RdmaLinkSetNsFd puts the RDMA device into a new network namespace. The\n// fd must be an open file descriptor to a network namespace.\n// Similar to: `rdma dev set $dev netns $ns`\nfunc RdmaLinkSetNsFd(link *RdmaLink, fd uint32) error {\n\treturn pkgHandle.RdmaLinkSetNsFd(link, fd)\n}\n\n// RdmaLinkSetNsFd puts the RDMA device into a new network namespace. The\n// fd must be an open file descriptor to a network namespace.\n// Similar to: `rdma dev set $dev netns $ns`\nfunc (h *Handle) RdmaLinkSetNsFd(link *RdmaLink, fd uint32) error {\n\tproto := getProtoField(nl.RDMA_NL_NLDEV, nl.RDMA_NLDEV_CMD_SET)\n\treq := h.newNetlinkRequest(proto, unix.NLM_F_ACK)\n\n\tdata := nl.NewRtAttr(nl.RDMA_NLDEV_ATTR_DEV_INDEX,\n\t\tnl.Uint32Attr(link.Attrs.Index))\n\treq.AddData(data)\n\n\tdata = nl.NewRtAttr(nl.RDMA_NLDEV_NET_NS_FD, nl.Uint32Attr(fd))\n\treq.AddData(data)\n\n\treturn execRdmaSetLink(req)\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/route.go", "content": "package netlink\n\nimport (\n\t\"fmt\"\n\t\"net\"\n\t\"strings\"\n)\n\n// Scope is an enum representing a route scope.\ntype Scope uint8\n\ntype NextHopFlag int\n\ntype Destination interface {\n\tFamily() int\n\tDecode([]byte) error\n\tEncode() ([]byte, error)\n\tString() string\n\tEqual(Destination) bool\n}\n\ntype Encap interface {\n\tType() int\n\tDecode([]byte) error\n\tEncode() ([]byte, error)\n\tString() string\n\tEqual(Encap) bool\n}\n\n//Protocol describe what was the originator of the route\ntype RouteProtocol int\n\n// Route represents a netlink route.\ntype Route struct {\n\tLinkIndex int\n\tILinkIndex int\n\tScope Scope\n\tDst *net.IPNet\n\tSrc net.IP\n\tGw net.IP\n\tMultiPath []*NexthopInfo\n\tProtocol RouteProtocol\n\tPriority int\n\tFamily int\n\tTable int\n\tType int\n\tTos int\n\tFlags int\n\tMPLSDst *int\n\tNewDst Destination\n\tEncap Encap\n\tVia Destination\n\tMTU int\n\tWindow int\n\tRtt int\n\tRttVar int\n\tSsthresh int\n\tCwnd int\n\tAdvMSS int\n\tReordering int\n\tHoplimit int\n\tInitCwnd int\n\tFeatures int\n\tRtoMin int\n\tInitRwnd int\n\tQuickACK int\n\tCongctl string\n\tFastOpenNoCookie int\n}\n\nfunc (r Route) String() string {\n\telems := []string{}\n\tif len(r.MultiPath) == 0 {\n\t\telems = append(elems, fmt.Sprintf(\"Ifindex: %d\", r.LinkIndex))\n\t}\n\tif r.MPLSDst != nil {\n\t\telems = append(elems, fmt.Sprintf(\"Dst: %d\", r.MPLSDst))\n\t} else {\n\t\telems = append(elems, fmt.Sprintf(\"Dst: %s\", r.Dst))\n\t}\n\tif r.NewDst != nil {\n\t\telems = append(elems, fmt.Sprintf(\"NewDst: %s\", r.NewDst))\n\t}\n\tif r.Encap != nil {\n\t\telems = append(elems, fmt.Sprintf(\"Encap: %s\", r.Encap))\n\t}\n\tif r.Via != nil {\n\t\telems = append(elems, fmt.Sprintf(\"Via: %s\", r.Via))\n\t}\n\telems = append(elems, fmt.Sprintf(\"Src: %s\", r.Src))\n\tif len(r.MultiPath) > 0 {\n\t\telems = append(elems, fmt.Sprintf(\"Gw: %s\", r.MultiPath))\n\t} else {\n\t\telems = append(elems, fmt.Sprintf(\"Gw: %s\", r.Gw))\n\t}\n\telems = append(elems, fmt.Sprintf(\"Flags: %s\", r.ListFlags()))\n\telems = append(elems, fmt.Sprintf(\"Table: %d\", r.Table))\n\treturn fmt.Sprintf(\"{%s}\", strings.Join(elems, \" \"))\n}\n\nfunc (r Route) Equal(x Route) bool {\n\treturn r.LinkIndex == x.LinkIndex &&\n\t\tr.ILinkIndex == x.ILinkIndex &&\n\t\tr.Scope == x.Scope &&\n\t\tipNetEqual(r.Dst, x.Dst) &&\n\t\tr.Src.Equal(x.Src) &&\n\t\tr.Gw.Equal(x.Gw) &&\n\t\tnexthopInfoSlice(r.MultiPath).Equal(x.MultiPath) &&\n\t\tr.Protocol == x.Protocol &&\n\t\tr.Priority == x.Priority &&\n\t\tr.Table == x.Table &&\n\t\tr.Type == x.Type &&\n\t\tr.Tos == x.Tos &&\n\t\tr.Hoplimit == x.Hoplimit &&\n\t\tr.Flags == x.Flags &&\n\t\t(r.MPLSDst == x.MPLSDst || (r.MPLSDst != nil && x.MPLSDst != nil && *r.MPLSDst == *x.MPLSDst)) &&\n\t\t(r.NewDst == x.NewDst || (r.NewDst != nil && r.NewDst.Equal(x.NewDst))) &&\n\t\t(r.Via == x.Via || (r.Via != nil && r.Via.Equal(x.Via))) &&\n\t\t(r.Encap == x.Encap || (r.Encap != nil && r.Encap.Equal(x.Encap)))\n}\n\nfunc (r *Route) SetFlag(flag NextHopFlag) {\n\tr.Flags |= int(flag)\n}\n\nfunc (r *Route) ClearFlag(flag NextHopFlag) {\n\tr.Flags &^= int(flag)\n}\n\ntype flagString struct {\n\tf NextHopFlag\n\ts string\n}\n\n// RouteUpdate is sent when a route changes - type is RTM_NEWROUTE or RTM_DELROUTE\ntype RouteUpdate struct {\n\tType uint16\n\tRoute\n}\n\ntype NexthopInfo struct {\n\tLinkIndex int\n\tHops int\n\tGw net.IP\n\tFlags int\n\tNewDst Destination\n\tEncap Encap\n\tVia Destination\n}\n\nfunc (n *NexthopInfo) String() string {\n\telems := []string{}\n\telems = append(elems, fmt.Sprintf(\"Ifindex: %d\", n.LinkIndex))\n\tif n.NewDst != nil {\n\t\telems = append(elems, fmt.Sprintf(\"NewDst: %s\", n.NewDst))\n\t}\n\tif n.Encap != nil {\n\t\telems = append(elems, fmt.Sprintf(\"Encap: %s\", n.Encap))\n\t}\n\tif n.Via != nil {\n\t\telems = append(elems, fmt.Sprintf(\"Via: %s\", n.Via))\n\t}\n\telems = append(elems, fmt.Sprintf(\"Weight: %d\", n.Hops+1))\n\telems = append(elems, fmt.Sprintf(\"Gw: %s\", n.Gw))\n\telems = append(elems, fmt.Sprintf(\"Flags: %s\", n.ListFlags()))\n\treturn fmt.Sprintf(\"{%s}\", strings.Join(elems, \" \"))\n}\n\nfunc (n NexthopInfo) Equal(x NexthopInfo) bool {\n\treturn n.LinkIndex == x.LinkIndex &&\n\t\tn.Hops == x.Hops &&\n\t\tn.Gw.Equal(x.Gw) &&\n\t\tn.Flags == x.Flags &&\n\t\t(n.NewDst == x.NewDst || (n.NewDst != nil && n.NewDst.Equal(x.NewDst))) &&\n\t\t(n.Encap == x.Encap || (n.Encap != nil && n.Encap.Equal(x.Encap)))\n}\n\ntype nexthopInfoSlice []*NexthopInfo\n\nfunc (n nexthopInfoSlice) Equal(x []*NexthopInfo) bool {\n\tif len(n) != len(x) {\n\t\treturn false\n\t}\n\tfor i := range n {\n\t\tif n[i] == nil || x[i] == nil {\n\t\t\treturn false\n\t\t}\n\t\tif !n[i].Equal(*x[i]) {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n\n// ipNetEqual returns true iff both IPNet are equal\nfunc ipNetEqual(ipn1 *net.IPNet, ipn2 *net.IPNet) bool {\n\tif ipn1 == ipn2 {\n\t\treturn true\n\t}\n\tif ipn1 == nil || ipn2 == nil {\n\t\treturn false\n\t}\n\tm1, _ := ipn1.Mask.Size()\n\tm2, _ := ipn2.Mask.Size()\n\treturn m1 == m2 && ipn1.IP.Equal(ipn2.IP)\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/route_linux.go", "content": "package netlink\n\nimport (\n\t\"bytes\"\n\t\"encoding/binary\"\n\t\"fmt\"\n\t\"net\"\n\t\"strconv\"\n\t\"strings\"\n\t\"syscall\"\n\n\t\"github.com/vishvananda/netlink/nl\"\n\t\"github.com/vishvananda/netns\"\n\t\"golang.org/x/sys/unix\"\n)\n\n// RtAttr is shared so it is in netlink_linux.go\n\nconst (\n\tSCOPE_UNIVERSE Scope = unix.RT_SCOPE_UNIVERSE\n\tSCOPE_SITE Scope = unix.RT_SCOPE_SITE\n\tSCOPE_LINK Scope = unix.RT_SCOPE_LINK\n\tSCOPE_HOST Scope = unix.RT_SCOPE_HOST\n\tSCOPE_NOWHERE Scope = unix.RT_SCOPE_NOWHERE\n)\n\nfunc (s Scope) String() string {\n\tswitch s {\n\tcase SCOPE_UNIVERSE:\n\t\treturn \"universe\"\n\tcase SCOPE_SITE:\n\t\treturn \"site\"\n\tcase SCOPE_LINK:\n\t\treturn \"link\"\n\tcase SCOPE_HOST:\n\t\treturn \"host\"\n\tcase SCOPE_NOWHERE:\n\t\treturn \"nowhere\"\n\tdefault:\n\t\treturn \"unknown\"\n\t}\n}\n\nconst (\n\tRT_FILTER_PROTOCOL uint64 = 1 << (1 + iota)\n\tRT_FILTER_SCOPE\n\tRT_FILTER_TYPE\n\tRT_FILTER_TOS\n\tRT_FILTER_IIF\n\tRT_FILTER_OIF\n\tRT_FILTER_DST\n\tRT_FILTER_SRC\n\tRT_FILTER_GW\n\tRT_FILTER_TABLE\n\tRT_FILTER_HOPLIMIT\n\tRT_FILTER_PRIORITY\n\tRT_FILTER_MARK\n\tRT_FILTER_MASK\n)\n\nconst (\n\tFLAG_ONLINK NextHopFlag = unix.RTNH_F_ONLINK\n\tFLAG_PERVASIVE NextHopFlag = unix.RTNH_F_PERVASIVE\n)\n\nvar testFlags = []flagString{\n\t{f: FLAG_ONLINK, s: \"onlink\"},\n\t{f: FLAG_PERVASIVE, s: \"pervasive\"},\n}\n\nfunc listFlags(flag int) []string {\n\tvar flags []string\n\tfor _, tf := range testFlags {\n\t\tif flag&int(tf.f) != 0 {\n\t\t\tflags = append(flags, tf.s)\n\t\t}\n\t}\n\treturn flags\n}\n\nfunc (r *Route) ListFlags() []string {\n\treturn listFlags(r.Flags)\n}\n\nfunc (n *NexthopInfo) ListFlags() []string {\n\treturn listFlags(n.Flags)\n}\n\ntype MPLSDestination struct {\n\tLabels []int\n}\n\nfunc (d *MPLSDestination) Family() int {\n\treturn nl.FAMILY_MPLS\n}\n\nfunc (d *MPLSDestination) Decode(buf []byte) error {\n\td.Labels = nl.DecodeMPLSStack(buf)\n\treturn nil\n}\n\nfunc (d *MPLSDestination) Encode() ([]byte, error) {\n\treturn nl.EncodeMPLSStack(d.Labels...), nil\n}\n\nfunc (d *MPLSDestination) String() string {\n\ts := make([]string, 0, len(d.Labels))\n\tfor _, l := range d.Labels {\n\t\ts = append(s, fmt.Sprintf(\"%d\", l))\n\t}\n\treturn strings.Join(s, \"/\")\n}\n\nfunc (d *MPLSDestination) Equal(x Destination) bool {\n\to, ok := x.(*MPLSDestination)\n\tif !ok {\n\t\treturn false\n\t}\n\tif d == nil && o == nil {\n\t\treturn true\n\t}\n\tif d == nil || o == nil {\n\t\treturn false\n\t}\n\tif d.Labels == nil && o.Labels == nil {\n\t\treturn true\n\t}\n\tif d.Labels == nil || o.Labels == nil {\n\t\treturn false\n\t}\n\tif len(d.Labels) != len(o.Labels) {\n\t\treturn false\n\t}\n\tfor i := range d.Labels {\n\t\tif d.Labels[i] != o.Labels[i] {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n\ntype MPLSEncap struct {\n\tLabels []int\n}\n\nfunc (e *MPLSEncap) Type() int {\n\treturn nl.LWTUNNEL_ENCAP_MPLS\n}\n\nfunc (e *MPLSEncap) Decode(buf []byte) error {\n\tif len(buf) < 4 {\n\t\treturn fmt.Errorf(\"lack of bytes\")\n\t}\n\tl := native.Uint16(buf)\n\tif len(buf) < int(l) {\n\t\treturn fmt.Errorf(\"lack of bytes\")\n\t}\n\tbuf = buf[:l]\n\ttyp := native.Uint16(buf[2:])\n\tif typ != nl.MPLS_IPTUNNEL_DST {\n\t\treturn fmt.Errorf(\"unknown MPLS Encap Type: %d\", typ)\n\t}\n\te.Labels = nl.DecodeMPLSStack(buf[4:])\n\treturn nil\n}\n\nfunc (e *MPLSEncap) Encode() ([]byte, error) {\n\ts := nl.EncodeMPLSStack(e.Labels...)\n\thdr := make([]byte, 4)\n\tnative.PutUint16(hdr, uint16(len(s)+4))\n\tnative.PutUint16(hdr[2:], nl.MPLS_IPTUNNEL_DST)\n\treturn append(hdr, s...), nil\n}\n\nfunc (e *MPLSEncap) String() string {\n\ts := make([]string, 0, len(e.Labels))\n\tfor _, l := range e.Labels {\n\t\ts = append(s, fmt.Sprintf(\"%d\", l))\n\t}\n\treturn strings.Join(s, \"/\")\n}\n\nfunc (e *MPLSEncap) Equal(x Encap) bool {\n\to, ok := x.(*MPLSEncap)\n\tif !ok {\n\t\treturn false\n\t}\n\tif e == nil && o == nil {\n\t\treturn true\n\t}\n\tif e == nil || o == nil {\n\t\treturn false\n\t}\n\tif e.Labels == nil && o.Labels == nil {\n\t\treturn true\n\t}\n\tif e.Labels == nil || o.Labels == nil {\n\t\treturn false\n\t}\n\tif len(e.Labels) != len(o.Labels) {\n\t\treturn false\n\t}\n\tfor i := range e.Labels {\n\t\tif e.Labels[i] != o.Labels[i] {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n\n// SEG6 definitions\ntype SEG6Encap struct {\n\tMode int\n\tSegments []net.IP\n}\n\nfunc (e *SEG6Encap) Type() int {\n\treturn nl.LWTUNNEL_ENCAP_SEG6\n}\nfunc (e *SEG6Encap) Decode(buf []byte) error {\n\tif len(buf) < 4 {\n\t\treturn fmt.Errorf(\"lack of bytes\")\n\t}\n\t// Get Length(l) & Type(typ) : 2 + 2 bytes\n\tl := native.Uint16(buf)\n\tif len(buf) < int(l) {\n\t\treturn fmt.Errorf(\"lack of bytes\")\n\t}\n\tbuf = buf[:l] // make sure buf size upper limit is Length\n\ttyp := native.Uint16(buf[2:])\n\t// LWTUNNEL_ENCAP_SEG6 has only one attr type SEG6_IPTUNNEL_SRH\n\tif typ != nl.SEG6_IPTUNNEL_SRH {\n\t\treturn fmt.Errorf(\"unknown SEG6 Type: %d\", typ)\n\t}\n\n\tvar err error\n\te.Mode, e.Segments, err = nl.DecodeSEG6Encap(buf[4:])\n\n\treturn err\n}\nfunc (e *SEG6Encap) Encode() ([]byte, error) {\n\ts, err := nl.EncodeSEG6Encap(e.Mode, e.Segments)\n\thdr := make([]byte, 4)\n\tnative.PutUint16(hdr, uint16(len(s)+4))\n\tnative.PutUint16(hdr[2:], nl.SEG6_IPTUNNEL_SRH)\n\treturn append(hdr, s...), err\n}\nfunc (e *SEG6Encap) String() string {\n\tsegs := make([]string, 0, len(e.Segments))\n\t// append segment backwards (from n to 0) since seg#0 is the last segment.\n\tfor i := len(e.Segments); i > 0; i-- {\n\t\tsegs = append(segs, fmt.Sprintf(\"%s\", e.Segments[i-1]))\n\t}\n\tstr := fmt.Sprintf(\"mode %s segs %d [ %s ]\", nl.SEG6EncapModeString(e.Mode),\n\t\tlen(e.Segments), strings.Join(segs, \" \"))\n\treturn str\n}\nfunc (e *SEG6Encap) Equal(x Encap) bool {\n\to, ok := x.(*SEG6Encap)\n\tif !ok {\n\t\treturn false\n\t}\n\tif e == o {\n\t\treturn true\n\t}\n\tif e == nil || o == nil {\n\t\treturn false\n\t}\n\tif e.Mode != o.Mode {\n\t\treturn false\n\t}\n\tif len(e.Segments) != len(o.Segments) {\n\t\treturn false\n\t}\n\tfor i := range e.Segments {\n\t\tif !e.Segments[i].Equal(o.Segments[i]) {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n\n// SEG6LocalEncap definitions\ntype SEG6LocalEncap struct {\n\tFlags [nl.SEG6_LOCAL_MAX]bool\n\tAction int\n\tSegments []net.IP // from SRH in seg6_local_lwt\n\tTable int // table id for End.T and End.DT6\n\tInAddr net.IP\n\tIn6Addr net.IP\n\tIif int\n\tOif int\n}\n\nfunc (e *SEG6LocalEncap) Type() int {\n\treturn nl.LWTUNNEL_ENCAP_SEG6_LOCAL\n}\nfunc (e *SEG6LocalEncap) Decode(buf []byte) error {\n\tattrs, err := nl.ParseRouteAttr(buf)\n\tif err != nil {\n\t\treturn err\n\t}\n\tfor _, attr := range attrs {\n\t\tswitch attr.Attr.Type {\n\t\tcase nl.SEG6_LOCAL_ACTION:\n\t\t\te.Action = int(native.Uint32(attr.Value[0:4]))\n\t\t\te.Flags[nl.SEG6_LOCAL_ACTION] = true\n\t\tcase nl.SEG6_LOCAL_SRH:\n\t\t\te.Segments, err = nl.DecodeSEG6Srh(attr.Value[:])\n\t\t\te.Flags[nl.SEG6_LOCAL_SRH] = true\n\t\tcase nl.SEG6_LOCAL_TABLE:\n\t\t\te.Table = int(native.Uint32(attr.Value[0:4]))\n\t\t\te.Flags[nl.SEG6_LOCAL_TABLE] = true\n\t\tcase nl.SEG6_LOCAL_NH4:\n\t\t\te.InAddr = net.IP(attr.Value[0:4])\n\t\t\te.Flags[nl.SEG6_LOCAL_NH4] = true\n\t\tcase nl.SEG6_LOCAL_NH6:\n\t\t\te.In6Addr = net.IP(attr.Value[0:16])\n\t\t\te.Flags[nl.SEG6_LOCAL_NH6] = true\n\t\tcase nl.SEG6_LOCAL_IIF:\n\t\t\te.Iif = int(native.Uint32(attr.Value[0:4]))\n\t\t\te.Flags[nl.SEG6_LOCAL_IIF] = true\n\t\tcase nl.SEG6_LOCAL_OIF:\n\t\t\te.Oif = int(native.Uint32(attr.Value[0:4]))\n\t\t\te.Flags[nl.SEG6_LOCAL_OIF] = true\n\t\t}\n\t}\n\treturn err\n}\nfunc (e *SEG6LocalEncap) Encode() ([]byte, error) {\n\tvar err error\n\tres := make([]byte, 8)\n\tnative.PutUint16(res, 8) // length\n\tnative.PutUint16(res[2:], nl.SEG6_LOCAL_ACTION)\n\tnative.PutUint32(res[4:], uint32(e.Action))\n\tif e.Flags[nl.SEG6_LOCAL_SRH] {\n\t\tsrh, err := nl.EncodeSEG6Srh(e.Segments)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tattr := make([]byte, 4)\n\t\tnative.PutUint16(attr, uint16(len(srh)+4))\n\t\tnative.PutUint16(attr[2:], nl.SEG6_LOCAL_SRH)\n\t\tattr = append(attr, srh...)\n\t\tres = append(res, attr...)\n\t}\n\tif e.Flags[nl.SEG6_LOCAL_TABLE] {\n\t\tattr := make([]byte, 8)\n\t\tnative.PutUint16(attr, 8)\n\t\tnative.PutUint16(attr[2:], nl.SEG6_LOCAL_TABLE)\n\t\tnative.PutUint32(attr[4:], uint32(e.Table))\n\t\tres = append(res, attr...)\n\t}\n\tif e.Flags[nl.SEG6_LOCAL_NH4] {\n\t\tattr := make([]byte, 4)\n\t\tnative.PutUint16(attr, 8)\n\t\tnative.PutUint16(attr[2:], nl.SEG6_LOCAL_NH4)\n\t\tipv4 := e.InAddr.To4()\n\t\tif ipv4 == nil {\n\t\t\terr = fmt.Errorf(\"SEG6_LOCAL_NH4 has invalid IPv4 address\")\n\t\t\treturn nil, err\n\t\t}\n\t\tattr = append(attr, ipv4...)\n\t\tres = append(res, attr...)\n\t}\n\tif e.Flags[nl.SEG6_LOCAL_NH6] {\n\t\tattr := make([]byte, 4)\n\t\tnative.PutUint16(attr, 20)\n\t\tnative.PutUint16(attr[2:], nl.SEG6_LOCAL_NH6)\n\t\tattr = append(attr, e.In6Addr...)\n\t\tres = append(res, attr...)\n\t}\n\tif e.Flags[nl.SEG6_LOCAL_IIF] {\n\t\tattr := make([]byte, 8)\n\t\tnative.PutUint16(attr, 8)\n\t\tnative.PutUint16(attr[2:], nl.SEG6_LOCAL_IIF)\n\t\tnative.PutUint32(attr[4:], uint32(e.Iif))\n\t\tres = append(res, attr...)\n\t}\n\tif e.Flags[nl.SEG6_LOCAL_OIF] {\n\t\tattr := make([]byte, 8)\n\t\tnative.PutUint16(attr, 8)\n\t\tnative.PutUint16(attr[2:], nl.SEG6_LOCAL_OIF)\n\t\tnative.PutUint32(attr[4:], uint32(e.Oif))\n\t\tres = append(res, attr...)\n\t}\n\treturn res, err\n}\nfunc (e *SEG6LocalEncap) String() string {\n\tstrs := make([]string, 0, nl.SEG6_LOCAL_MAX)\n\tstrs = append(strs, fmt.Sprintf(\"action %s\", nl.SEG6LocalActionString(e.Action)))\n\n\tif e.Flags[nl.SEG6_LOCAL_TABLE] {\n\t\tstrs = append(strs, fmt.Sprintf(\"table %d\", e.Table))\n\t}\n\tif e.Flags[nl.SEG6_LOCAL_NH4] {\n\t\tstrs = append(strs, fmt.Sprintf(\"nh4 %s\", e.InAddr))\n\t}\n\tif e.Flags[nl.SEG6_LOCAL_NH6] {\n\t\tstrs = append(strs, fmt.Sprintf(\"nh6 %s\", e.In6Addr))\n\t}\n\tif e.Flags[nl.SEG6_LOCAL_IIF] {\n\t\tlink, err := LinkByIndex(e.Iif)\n\t\tif err != nil {\n\t\t\tstrs = append(strs, fmt.Sprintf(\"iif %d\", e.Iif))\n\t\t} else {\n\t\t\tstrs = append(strs, fmt.Sprintf(\"iif %s\", link.Attrs().Name))\n\t\t}\n\t}\n\tif e.Flags[nl.SEG6_LOCAL_OIF] {\n\t\tlink, err := LinkByIndex(e.Oif)\n\t\tif err != nil {\n\t\t\tstrs = append(strs, fmt.Sprintf(\"oif %d\", e.Oif))\n\t\t} else {\n\t\t\tstrs = append(strs, fmt.Sprintf(\"oif %s\", link.Attrs().Name))\n\t\t}\n\t}\n\tif e.Flags[nl.SEG6_LOCAL_SRH] {\n\t\tsegs := make([]string, 0, len(e.Segments))\n\t\t//append segment backwards (from n to 0) since seg#0 is the last segment.\n\t\tfor i := len(e.Segments); i > 0; i-- {\n\t\t\tsegs = append(segs, fmt.Sprintf(\"%s\", e.Segments[i-1]))\n\t\t}\n\t\tstrs = append(strs, fmt.Sprintf(\"segs %d [ %s ]\", len(e.Segments), strings.Join(segs, \" \")))\n\t}\n\treturn strings.Join(strs, \" \")\n}\nfunc (e *SEG6LocalEncap) Equal(x Encap) bool {\n\to, ok := x.(*SEG6LocalEncap)\n\tif !ok {\n\t\treturn false\n\t}\n\tif e == o {\n\t\treturn true\n\t}\n\tif e == nil || o == nil {\n\t\treturn false\n\t}\n\t// compare all arrays first\n\tfor i := range e.Flags {\n\t\tif e.Flags[i] != o.Flags[i] {\n\t\t\treturn false\n\t\t}\n\t}\n\tif len(e.Segments) != len(o.Segments) {\n\t\treturn false\n\t}\n\tfor i := range e.Segments {\n\t\tif !e.Segments[i].Equal(o.Segments[i]) {\n\t\t\treturn false\n\t\t}\n\t}\n\t// compare values\n\tif !e.InAddr.Equal(o.InAddr) || !e.In6Addr.Equal(o.In6Addr) {\n\t\treturn false\n\t}\n\tif e.Action != o.Action || e.Table != o.Table || e.Iif != o.Iif || e.Oif != o.Oif {\n\t\treturn false\n\t}\n\treturn true\n}\n\n// Encap BPF definitions\ntype bpfObj struct {\n\tprogFd int\n\tprogName string\n}\ntype BpfEncap struct {\n\tprogs [nl.LWT_BPF_MAX]bpfObj\n\theadroom int\n}\n\n// SetProg adds a bpf function to the route via netlink RTA_ENCAP. The fd must be a bpf\n// program loaded with bpf(type=BPF_PROG_TYPE_LWT_*) matching the direction the program should\n// be applied to (LWT_BPF_IN, LWT_BPF_OUT, LWT_BPF_XMIT).\nfunc (e *BpfEncap) SetProg(mode, progFd int, progName string) error {\n\tif progFd <= 0 {\n\t\treturn fmt.Errorf(\"lwt bpf SetProg: invalid fd\")\n\t}\n\tif mode <= nl.LWT_BPF_UNSPEC || mode >= nl.LWT_BPF_XMIT_HEADROOM {\n\t\treturn fmt.Errorf(\"lwt bpf SetProg:invalid mode\")\n\t}\n\te.progs[mode].progFd = progFd\n\te.progs[mode].progName = fmt.Sprintf(\"%s[fd:%d]\", progName, progFd)\n\treturn nil\n}\n\n// SetXmitHeadroom sets the xmit headroom (LWT_BPF_MAX_HEADROOM) via netlink RTA_ENCAP.\n// maximum headroom is LWT_BPF_MAX_HEADROOM\nfunc (e *BpfEncap) SetXmitHeadroom(headroom int) error {\n\tif headroom > nl.LWT_BPF_MAX_HEADROOM || headroom < 0 {\n\t\treturn fmt.Errorf(\"invalid headroom size. range is 0 - %d\", nl.LWT_BPF_MAX_HEADROOM)\n\t}\n\te.headroom = headroom\n\treturn nil\n}\n\nfunc (e *BpfEncap) Type() int {\n\treturn nl.LWTUNNEL_ENCAP_BPF\n}\nfunc (e *BpfEncap) Decode(buf []byte) error {\n\tif len(buf) < 4 {\n\t\treturn fmt.Errorf(\"lwt bpf decode: lack of bytes\")\n\t}\n\tnative := nl.NativeEndian()\n\tattrs, err := nl.ParseRouteAttr(buf)\n\tif err != nil {\n\t\treturn fmt.Errorf(\"lwt bpf decode: failed parsing attribute. err: %v\", err)\n\t}\n\tfor _, attr := range attrs {\n\t\tif int(attr.Attr.Type) < 1 {\n\t\t\t// nl.LWT_BPF_UNSPEC\n\t\t\tcontinue\n\t\t}\n\t\tif int(attr.Attr.Type) > nl.LWT_BPF_MAX {\n\t\t\treturn fmt.Errorf(\"lwt bpf decode: received unknown attribute type: %d\", attr.Attr.Type)\n\t\t}\n\t\tswitch int(attr.Attr.Type) {\n\t\tcase nl.LWT_BPF_MAX_HEADROOM:\n\t\t\te.headroom = int(native.Uint32(attr.Value))\n\t\tdefault:\n\t\t\tbpfO := bpfObj{}\n\t\t\tparsedAttrs, err := nl.ParseRouteAttr(attr.Value)\n\t\t\tif err != nil {\n\t\t\t\treturn fmt.Errorf(\"lwt bpf decode: failed parsing route attribute\")\n\t\t\t}\n\t\t\tfor _, parsedAttr := range parsedAttrs {\n\t\t\t\tswitch int(parsedAttr.Attr.Type) {\n\t\t\t\tcase nl.LWT_BPF_PROG_FD:\n\t\t\t\t\tbpfO.progFd = int(native.Uint32(parsedAttr.Value))\n\t\t\t\tcase nl.LWT_BPF_PROG_NAME:\n\t\t\t\t\tbpfO.progName = fmt.Sprintf(\"%s\", parsedAttr.Value)\n\t\t\t\tdefault:\n\t\t\t\t\treturn fmt.Errorf(\"lwt bpf decode: received unknown attribute: type: %d, len: %d\", parsedAttr.Attr.Type, parsedAttr.Attr.Len)\n\t\t\t\t}\n\t\t\t}\n\t\t\te.progs[attr.Attr.Type] = bpfO\n\t\t}\n\t}\n\treturn nil\n}\n\nfunc (e *BpfEncap) Encode() ([]byte, error) {\n\tbuf := make([]byte, 0)\n\tnative = nl.NativeEndian()\n\tfor index, attr := range e.progs {\n\t\tnlMsg := nl.NewRtAttr(index, []byte{})\n\t\tif attr.progFd != 0 {\n\t\t\tnlMsg.AddRtAttr(nl.LWT_BPF_PROG_FD, nl.Uint32Attr(uint32(attr.progFd)))\n\t\t}\n\t\tif attr.progName != \"\" {\n\t\t\tnlMsg.AddRtAttr(nl.LWT_BPF_PROG_NAME, nl.ZeroTerminated(attr.progName))\n\t\t}\n\t\tif nlMsg.Len() > 4 {\n\t\t\tbuf = append(buf, nlMsg.Serialize()...)\n\t\t}\n\t}\n\tif len(buf) <= 4 {\n\t\treturn nil, fmt.Errorf(\"lwt bpf encode: bpf obj definitions returned empty buffer\")\n\t}\n\tif e.headroom > 0 {\n\t\thRoom := nl.NewRtAttr(nl.LWT_BPF_XMIT_HEADROOM, nl.Uint32Attr(uint32(e.headroom)))\n\t\tbuf = append(buf, hRoom.Serialize()...)\n\t}\n\treturn buf, nil\n}\n\nfunc (e *BpfEncap) String() string {\n\tprogs := make([]string, 0)\n\tfor index, obj := range e.progs {\n\t\tempty := bpfObj{}\n\t\tswitch index {\n\t\tcase nl.LWT_BPF_IN:\n\t\t\tif obj != empty {\n\t\t\t\tprogs = append(progs, fmt.Sprintf(\"in: %s\", obj.progName))\n\t\t\t}\n\t\tcase nl.LWT_BPF_OUT:\n\t\t\tif obj != empty {\n\t\t\t\tprogs = append(progs, fmt.Sprintf(\"out: %s\", obj.progName))\n\t\t\t}\n\t\tcase nl.LWT_BPF_XMIT:\n\t\t\tif obj != empty {\n\t\t\t\tprogs = append(progs, fmt.Sprintf(\"xmit: %s\", obj.progName))\n\t\t\t}\n\t\t}\n\t}\n\tif e.headroom > 0 {\n\t\tprogs = append(progs, fmt.Sprintf(\"xmit headroom: %d\", e.headroom))\n\t}\n\treturn strings.Join(progs, \" \")\n}\n\nfunc (e *BpfEncap) Equal(x Encap) bool {\n\to, ok := x.(*BpfEncap)\n\tif !ok {\n\t\treturn false\n\t}\n\tif e.headroom != o.headroom {\n\t\treturn false\n\t}\n\tfor i, _ := range o.progs {\n\t\tif o.progs[i] != e.progs[i] {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n\ntype Via struct {\n\tAddrFamily int\n\tAddr net.IP\n}\n\nfunc (v *Via) Equal(x Destination) bool {\n\to, ok := x.(*Via)\n\tif !ok {\n\t\treturn false\n\t}\n\tif v.AddrFamily == x.Family() && v.Addr.Equal(o.Addr) {\n\t\treturn true\n\t}\n\treturn false\n}\n\nfunc (v *Via) String() string {\n\treturn fmt.Sprintf(\"Family: %d, Address: %s\", v.AddrFamily, v.Addr.String())\n}\n\nfunc (v *Via) Family() int {\n\treturn v.AddrFamily\n}\n\nfunc (v *Via) Encode() ([]byte, error) {\n\tbuf := &bytes.Buffer{}\n\terr := binary.Write(buf, native, uint16(v.AddrFamily))\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\terr = binary.Write(buf, native, v.Addr)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn buf.Bytes(), nil\n}\n\nfunc (v *Via) Decode(b []byte) error {\n\tif len(b) < 6 {\n\t\treturn fmt.Errorf(\"decoding failed: buffer too small (%d bytes)\", len(b))\n\t}\n\tv.AddrFamily = int(native.Uint16(b[0:2]))\n\tif v.AddrFamily == nl.FAMILY_V4 {\n\t\tv.Addr = net.IP(b[2:6])\n\t\treturn nil\n\t} else if v.AddrFamily == nl.FAMILY_V6 {\n\t\tif len(b) < 18 {\n\t\t\treturn fmt.Errorf(\"decoding failed: buffer too small (%d bytes)\", len(b))\n\t\t}\n\t\tv.Addr = net.IP(b[2:])\n\t\treturn nil\n\t}\n\treturn fmt.Errorf(\"decoding failed: address family %d unknown\", v.AddrFamily)\n}\n\n// RouteAdd will add a route to the system.\n// Equivalent to: `ip route add $route`\nfunc RouteAdd(route *Route) error {\n\treturn pkgHandle.RouteAdd(route)\n}\n\n// RouteAdd will add a route to the system.\n// Equivalent to: `ip route add $route`\nfunc (h *Handle) RouteAdd(route *Route) error {\n\tflags := unix.NLM_F_CREATE | unix.NLM_F_EXCL | unix.NLM_F_ACK\n\treq := h.newNetlinkRequest(unix.RTM_NEWROUTE, flags)\n\treturn h.routeHandle(route, req, nl.NewRtMsg())\n}\n\n// RouteAppend will append a route to the system.\n// Equivalent to: `ip route append $route`\nfunc RouteAppend(route *Route) error {\n\treturn pkgHandle.RouteAppend(route)\n}\n\n// RouteAppend will append a route to the system.\n// Equivalent to: `ip route append $route`\nfunc (h *Handle) RouteAppend(route *Route) error {\n\tflags := unix.NLM_F_CREATE | unix.NLM_F_APPEND | unix.NLM_F_ACK\n\treq := h.newNetlinkRequest(unix.RTM_NEWROUTE, flags)\n\treturn h.routeHandle(route, req, nl.NewRtMsg())\n}\n\n// RouteAddEcmp will add a route to the system.\nfunc RouteAddEcmp(route *Route) error {\n\treturn pkgHandle.RouteAddEcmp(route)\n}\n\n// RouteAddEcmp will add a route to the system.\nfunc (h *Handle) RouteAddEcmp(route *Route) error {\n\tflags := unix.NLM_F_CREATE | unix.NLM_F_ACK\n\treq := h.newNetlinkRequest(unix.RTM_NEWROUTE, flags)\n\treturn h.routeHandle(route, req, nl.NewRtMsg())\n}\n\n// RouteReplace will add a route to the system.\n// Equivalent to: `ip route replace $route`\nfunc RouteReplace(route *Route) error {\n\treturn pkgHandle.RouteReplace(route)\n}\n\n// RouteReplace will add a route to the system.\n// Equivalent to: `ip route replace $route`\nfunc (h *Handle) RouteReplace(route *Route) error {\n\tflags := unix.NLM_F_CREATE | unix.NLM_F_REPLACE | unix.NLM_F_ACK\n\treq := h.newNetlinkRequest(unix.RTM_NEWROUTE, flags)\n\treturn h.routeHandle(route, req, nl.NewRtMsg())\n}\n\n// RouteDel will delete a route from the system.\n// Equivalent to: `ip route del $route`\nfunc RouteDel(route *Route) error {\n\treturn pkgHandle.RouteDel(route)\n}\n\n// RouteDel will delete a route from the system.\n// Equivalent to: `ip route del $route`\nfunc (h *Handle) RouteDel(route *Route) error {\n\treq := h.newNetlinkRequest(unix.RTM_DELROUTE, unix.NLM_F_ACK)\n\treturn h.routeHandle(route, req, nl.NewRtDelMsg())\n}\n\nfunc (h *Handle) routeHandle(route *Route, req *nl.NetlinkRequest, msg *nl.RtMsg) error {\n\tif (route.Dst == nil || route.Dst.IP == nil) && route.Src == nil && route.Gw == nil && route.MPLSDst == nil {\n\t\treturn fmt.Errorf(\"one of Dst.IP, Src, or Gw must not be nil\")\n\t}\n\n\tfamily := -1\n\tvar rtAttrs []*nl.RtAttr\n\n\tif route.Dst != nil && route.Dst.IP != nil {\n\t\tdstLen, _ := route.Dst.Mask.Size()\n\t\tmsg.Dst_len = uint8(dstLen)\n\t\tdstFamily := nl.GetIPFamily(route.Dst.IP)\n\t\tfamily = dstFamily\n\t\tvar dstData []byte\n\t\tif dstFamily == FAMILY_V4 {\n\t\t\tdstData = route.Dst.IP.To4()\n\t\t} else {\n\t\t\tdstData = route.Dst.IP.To16()\n\t\t}\n\t\trtAttrs = append(rtAttrs, nl.NewRtAttr(unix.RTA_DST, dstData))\n\t} else if route.MPLSDst != nil {\n\t\tfamily = nl.FAMILY_MPLS\n\t\tmsg.Dst_len = uint8(20)\n\t\tmsg.Type = unix.RTN_UNICAST\n\t\trtAttrs = append(rtAttrs, nl.NewRtAttr(unix.RTA_DST, nl.EncodeMPLSStack(*route.MPLSDst)))\n\t}\n\n\tif route.NewDst != nil {\n\t\tif family != -1 && family != route.NewDst.Family() {\n\t\t\treturn fmt.Errorf(\"new destination and destination are not the same address family\")\n\t\t}\n\t\tbuf, err := route.NewDst.Encode()\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\trtAttrs = append(rtAttrs, nl.NewRtAttr(unix.RTA_NEWDST, buf))\n\t}\n\n\tif route.Encap != nil {\n\t\tbuf := make([]byte, 2)\n\t\tnative.PutUint16(buf, uint16(route.Encap.Type()))\n\t\trtAttrs = append(rtAttrs, nl.NewRtAttr(unix.RTA_ENCAP_TYPE, buf))\n\t\tbuf, err := route.Encap.Encode()\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tswitch route.Encap.Type() {\n\t\tcase nl.LWTUNNEL_ENCAP_BPF:\n\t\t\trtAttrs = append(rtAttrs, nl.NewRtAttr(unix.RTA_ENCAP|unix.NLA_F_NESTED, buf))\n\t\tdefault:\n\t\t\trtAttrs = append(rtAttrs, nl.NewRtAttr(unix.RTA_ENCAP, buf))\n\t\t}\n\n\t}\n\n\tif route.Src != nil {\n\t\tsrcFamily := nl.GetIPFamily(route.Src)\n\t\tif family != -1 && family != srcFamily {\n\t\t\treturn fmt.Errorf(\"source and destination ip are not the same IP family\")\n\t\t}\n\t\tfamily = srcFamily\n\t\tvar srcData []byte\n\t\tif srcFamily == FAMILY_V4 {\n\t\t\tsrcData = route.Src.To4()\n\t\t} else {\n\t\t\tsrcData = route.Src.To16()\n\t\t}\n\t\t// The commonly used src ip for routes is actually PREFSRC\n\t\trtAttrs = append(rtAttrs, nl.NewRtAttr(unix.RTA_PREFSRC, srcData))\n\t}\n\n\tif route.Gw != nil {\n\t\tgwFamily := nl.GetIPFamily(route.Gw)\n\t\tif family != -1 && family != gwFamily {\n\t\t\treturn fmt.Errorf(\"gateway, source, and destination ip are not the same IP family\")\n\t\t}\n\t\tfamily = gwFamily\n\t\tvar gwData []byte\n\t\tif gwFamily == FAMILY_V4 {\n\t\t\tgwData = route.Gw.To4()\n\t\t} else {\n\t\t\tgwData = route.Gw.To16()\n\t\t}\n\t\trtAttrs = append(rtAttrs, nl.NewRtAttr(unix.RTA_GATEWAY, gwData))\n\t}\n\n\tif route.Via != nil {\n\t\tbuf, err := route.Via.Encode()\n\t\tif err != nil {\n\t\t\treturn fmt.Errorf(\"failed to encode RTA_VIA: %v\", err)\n\t\t}\n\t\trtAttrs = append(rtAttrs, nl.NewRtAttr(unix.RTA_VIA, buf))\n\t}\n\n\tif len(route.MultiPath) > 0 {\n\t\tbuf := []byte{}\n\t\tfor _, nh := range route.MultiPath {\n\t\t\trtnh := &nl.RtNexthop{\n\t\t\t\tRtNexthop: unix.RtNexthop{\n\t\t\t\t\tHops: uint8(nh.Hops),\n\t\t\t\t\tIfindex: int32(nh.LinkIndex),\n\t\t\t\t\tFlags: uint8(nh.Flags),\n\t\t\t\t},\n\t\t\t}\n\t\t\tchildren := []nl.NetlinkRequestData{}\n\t\t\tif nh.Gw != nil {\n\t\t\t\tgwFamily := nl.GetIPFamily(nh.Gw)\n\t\t\t\tif family != -1 && family != gwFamily {\n\t\t\t\t\treturn fmt.Errorf(\"gateway, source, and destination ip are not the same IP family\")\n\t\t\t\t}\n\t\t\t\tif gwFamily == FAMILY_V4 {\n\t\t\t\t\tchildren = append(children, nl.NewRtAttr(unix.RTA_GATEWAY, []byte(nh.Gw.To4())))\n\t\t\t\t} else {\n\t\t\t\t\tchildren = append(children, nl.NewRtAttr(unix.RTA_GATEWAY, []byte(nh.Gw.To16())))\n\t\t\t\t}\n\t\t\t}\n\t\t\tif nh.NewDst != nil {\n\t\t\t\tif family != -1 && family != nh.NewDst.Family() {\n\t\t\t\t\treturn fmt.Errorf(\"new destination and destination are not the same address family\")\n\t\t\t\t}\n\t\t\t\tbuf, err := nh.NewDst.Encode()\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t\tchildren = append(children, nl.NewRtAttr(unix.RTA_NEWDST, buf))\n\t\t\t}\n\t\t\tif nh.Encap != nil {\n\t\t\t\tbuf := make([]byte, 2)\n\t\t\t\tnative.PutUint16(buf, uint16(nh.Encap.Type()))\n\t\t\t\tchildren = append(children, nl.NewRtAttr(unix.RTA_ENCAP_TYPE, buf))\n\t\t\t\tbuf, err := nh.Encap.Encode()\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t\tchildren = append(children, nl.NewRtAttr(unix.RTA_ENCAP, buf))\n\t\t\t}\n\t\t\tif nh.Via != nil {\n\t\t\t\tbuf, err := nh.Via.Encode()\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn err\n\t\t\t\t}\n\t\t\t\tchildren = append(children, nl.NewRtAttr(unix.RTA_VIA, buf))\n\t\t\t}\n\t\t\trtnh.Children = children\n\t\t\tbuf = append(buf, rtnh.Serialize()...)\n\t\t}\n\t\trtAttrs = append(rtAttrs, nl.NewRtAttr(unix.RTA_MULTIPATH, buf))\n\t}\n\n\tif route.Table > 0 {\n\t\tif route.Table >= 256 {\n\t\t\tmsg.Table = unix.RT_TABLE_UNSPEC\n\t\t\tb := make([]byte, 4)\n\t\t\tnative.PutUint32(b, uint32(route.Table))\n\t\t\trtAttrs = append(rtAttrs, nl.NewRtAttr(unix.RTA_TABLE, b))\n\t\t} else {\n\t\t\tmsg.Table = uint8(route.Table)\n\t\t}\n\t}\n\n\tif route.Priority > 0 {\n\t\tb := make([]byte, 4)\n\t\tnative.PutUint32(b, uint32(route.Priority))\n\t\trtAttrs = append(rtAttrs, nl.NewRtAttr(unix.RTA_PRIORITY, b))\n\t}\n\tif route.Tos > 0 {\n\t\tmsg.Tos = uint8(route.Tos)\n\t}\n\tif route.Protocol > 0 {\n\t\tmsg.Protocol = uint8(route.Protocol)\n\t}\n\tif route.Type > 0 {\n\t\tmsg.Type = uint8(route.Type)\n\t}\n\n\tvar metrics []*nl.RtAttr\n\tif route.MTU > 0 {\n\t\tb := nl.Uint32Attr(uint32(route.MTU))\n\t\tmetrics = append(metrics, nl.NewRtAttr(unix.RTAX_MTU, b))\n\t}\n\tif route.Window > 0 {\n\t\tb := nl.Uint32Attr(uint32(route.Window))\n\t\tmetrics = append(metrics, nl.NewRtAttr(unix.RTAX_WINDOW, b))\n\t}\n\tif route.Rtt > 0 {\n\t\tb := nl.Uint32Attr(uint32(route.Rtt))\n\t\tmetrics = append(metrics, nl.NewRtAttr(unix.RTAX_RTT, b))\n\t}\n\tif route.RttVar > 0 {\n\t\tb := nl.Uint32Attr(uint32(route.RttVar))\n\t\tmetrics = append(metrics, nl.NewRtAttr(unix.RTAX_RTTVAR, b))\n\t}\n\tif route.Ssthresh > 0 {\n\t\tb := nl.Uint32Attr(uint32(route.Ssthresh))\n\t\tmetrics = append(metrics, nl.NewRtAttr(unix.RTAX_SSTHRESH, b))\n\t}\n\tif route.Cwnd > 0 {\n\t\tb := nl.Uint32Attr(uint32(route.Cwnd))\n\t\tmetrics = append(metrics, nl.NewRtAttr(unix.RTAX_CWND, b))\n\t}\n\tif route.AdvMSS > 0 {\n\t\tb := nl.Uint32Attr(uint32(route.AdvMSS))\n\t\tmetrics = append(metrics, nl.NewRtAttr(unix.RTAX_ADVMSS, b))\n\t}\n\tif route.Reordering > 0 {\n\t\tb := nl.Uint32Attr(uint32(route.Reordering))\n\t\tmetrics = append(metrics, nl.NewRtAttr(unix.RTAX_REORDERING, b))\n\t}\n\tif route.Hoplimit > 0 {\n\t\tb := nl.Uint32Attr(uint32(route.Hoplimit))\n\t\tmetrics = append(metrics, nl.NewRtAttr(unix.RTAX_HOPLIMIT, b))\n\t}\n\tif route.InitCwnd > 0 {\n\t\tb := nl.Uint32Attr(uint32(route.InitCwnd))\n\t\tmetrics = append(metrics, nl.NewRtAttr(unix.RTAX_INITCWND, b))\n\t}\n\tif route.Features > 0 {\n\t\tb := nl.Uint32Attr(uint32(route.Features))\n\t\tmetrics = append(metrics, nl.NewRtAttr(unix.RTAX_FEATURES, b))\n\t}\n\tif route.RtoMin > 0 {\n\t\tb := nl.Uint32Attr(uint32(route.RtoMin))\n\t\tmetrics = append(metrics, nl.NewRtAttr(unix.RTAX_RTO_MIN, b))\n\t}\n\tif route.InitRwnd > 0 {\n\t\tb := nl.Uint32Attr(uint32(route.InitRwnd))\n\t\tmetrics = append(metrics, nl.NewRtAttr(unix.RTAX_INITRWND, b))\n\t}\n\tif route.QuickACK > 0 {\n\t\tb := nl.Uint32Attr(uint32(route.QuickACK))\n\t\tmetrics = append(metrics, nl.NewRtAttr(unix.RTAX_QUICKACK, b))\n\t}\n\tif route.Congctl != \"\" {\n\t\tb := nl.ZeroTerminated(route.Congctl)\n\t\tmetrics = append(metrics, nl.NewRtAttr(unix.RTAX_CC_ALGO, b))\n\t}\n\tif route.FastOpenNoCookie > 0 {\n\t\tb := nl.Uint32Attr(uint32(route.FastOpenNoCookie))\n\t\tmetrics = append(metrics, nl.NewRtAttr(unix.RTAX_FASTOPEN_NO_COOKIE, b))\n\t}\n\n\tif metrics != nil {\n\t\tattr := nl.NewRtAttr(unix.RTA_METRICS, nil)\n\t\tfor _, metric := range metrics {\n\t\t\tattr.AddChild(metric)\n\t\t}\n\t\trtAttrs = append(rtAttrs, attr)\n\t}\n\n\tmsg.Flags = uint32(route.Flags)\n\tmsg.Scope = uint8(route.Scope)\n\tmsg.Family = uint8(family)\n\treq.AddData(msg)\n\tfor _, attr := range rtAttrs {\n\t\treq.AddData(attr)\n\t}\n\n\tb := make([]byte, 4)\n\tnative.PutUint32(b, uint32(route.LinkIndex))\n\n\treq.AddData(nl.NewRtAttr(unix.RTA_OIF, b))\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// RouteList gets a list of routes in the system.\n// Equivalent to: `ip route show`.\n// The list can be filtered by link and ip family.\nfunc RouteList(link Link, family int) ([]Route, error) {\n\treturn pkgHandle.RouteList(link, family)\n}\n\n// RouteList gets a list of routes in the system.\n// Equivalent to: `ip route show`.\n// The list can be filtered by link and ip family.\nfunc (h *Handle) RouteList(link Link, family int) ([]Route, error) {\n\tvar routeFilter *Route\n\tif link != nil {\n\t\trouteFilter = &Route{\n\t\t\tLinkIndex: link.Attrs().Index,\n\t\t}\n\t}\n\treturn h.RouteListFiltered(family, routeFilter, RT_FILTER_OIF)\n}\n\n// RouteListFiltered gets a list of routes in the system filtered with specified rules.\n// All rules must be defined in RouteFilter struct\nfunc RouteListFiltered(family int, filter *Route, filterMask uint64) ([]Route, error) {\n\treturn pkgHandle.RouteListFiltered(family, filter, filterMask)\n}\n\n// RouteListFiltered gets a list of routes in the system filtered with specified rules.\n// All rules must be defined in RouteFilter struct\nfunc (h *Handle) RouteListFiltered(family int, filter *Route, filterMask uint64) ([]Route, error) {\n\treq := h.newNetlinkRequest(unix.RTM_GETROUTE, unix.NLM_F_DUMP)\n\tinfmsg := nl.NewIfInfomsg(family)\n\treq.AddData(infmsg)\n\n\tmsgs, err := req.Execute(unix.NETLINK_ROUTE, unix.RTM_NEWROUTE)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tvar res []Route\n\tfor _, m := range msgs {\n\t\tmsg := nl.DeserializeRtMsg(m)\n\t\tif msg.Flags&unix.RTM_F_CLONED != 0 {\n\t\t\t// Ignore cloned routes\n\t\t\tcontinue\n\t\t}\n\t\tif msg.Table != unix.RT_TABLE_MAIN {\n\t\t\tif filter == nil || filter != nil && filterMask&RT_FILTER_TABLE == 0 {\n\t\t\t\t// Ignore non-main tables\n\t\t\t\tcontinue\n\t\t\t}\n\t\t}\n\t\troute, err := deserializeRoute(m)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tif filter != nil {\n\t\t\tswitch {\n\t\t\tcase filterMask&RT_FILTER_TABLE != 0 && filter.Table != unix.RT_TABLE_UNSPEC && route.Table != filter.Table:\n\t\t\t\tcontinue\n\t\t\tcase filterMask&RT_FILTER_PROTOCOL != 0 && route.Protocol != filter.Protocol:\n\t\t\t\tcontinue\n\t\t\tcase filterMask&RT_FILTER_SCOPE != 0 && route.Scope != filter.Scope:\n\t\t\t\tcontinue\n\t\t\tcase filterMask&RT_FILTER_TYPE != 0 && route.Type != filter.Type:\n\t\t\t\tcontinue\n\t\t\tcase filterMask&RT_FILTER_TOS != 0 && route.Tos != filter.Tos:\n\t\t\t\tcontinue\n\t\t\tcase filterMask&RT_FILTER_OIF != 0 && route.LinkIndex != filter.LinkIndex:\n\t\t\t\tcontinue\n\t\t\tcase filterMask&RT_FILTER_IIF != 0 && route.ILinkIndex != filter.ILinkIndex:\n\t\t\t\tcontinue\n\t\t\tcase filterMask&RT_FILTER_GW != 0 && !route.Gw.Equal(filter.Gw):\n\t\t\t\tcontinue\n\t\t\tcase filterMask&RT_FILTER_SRC != 0 && !route.Src.Equal(filter.Src):\n\t\t\t\tcontinue\n\t\t\tcase filterMask&RT_FILTER_DST != 0:\n\t\t\t\tif filter.MPLSDst == nil || route.MPLSDst == nil || (*filter.MPLSDst) != (*route.MPLSDst) {\n\t\t\t\t\tif !ipNetEqual(route.Dst, filter.Dst) {\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\tcase filterMask&RT_FILTER_HOPLIMIT != 0 && route.Hoplimit != filter.Hoplimit:\n\t\t\t\tcontinue\n\t\t\t}\n\t\t}\n\t\tres = append(res, route)\n\t}\n\treturn res, nil\n}\n\n// deserializeRoute decodes a binary netlink message into a Route struct\nfunc deserializeRoute(m []byte) (Route, error) {\n\tmsg := nl.DeserializeRtMsg(m)\n\tattrs, err := nl.ParseRouteAttr(m[msg.Len():])\n\tif err != nil {\n\t\treturn Route{}, err\n\t}\n\troute := Route{\n\t\tScope: Scope(msg.Scope),\n\t\tProtocol: RouteProtocol(int(msg.Protocol)),\n\t\tTable: int(msg.Table),\n\t\tType: int(msg.Type),\n\t\tTos: int(msg.Tos),\n\t\tFlags: int(msg.Flags),\n\t\tFamily: int(msg.Family),\n\t}\n\n\tvar encap, encapType syscall.NetlinkRouteAttr\n\tfor _, attr := range attrs {\n\t\tswitch attr.Attr.Type {\n\t\tcase unix.RTA_GATEWAY:\n\t\t\troute.Gw = net.IP(attr.Value)\n\t\tcase unix.RTA_PREFSRC:\n\t\t\troute.Src = net.IP(attr.Value)\n\t\tcase unix.RTA_DST:\n\t\t\tif msg.Family == nl.FAMILY_MPLS {\n\t\t\t\tstack := nl.DecodeMPLSStack(attr.Value)\n\t\t\t\tif len(stack) == 0 || len(stack) > 1 {\n\t\t\t\t\treturn route, fmt.Errorf(\"invalid MPLS RTA_DST\")\n\t\t\t\t}\n\t\t\t\troute.MPLSDst = &stack[0]\n\t\t\t} else {\n\t\t\t\troute.Dst = &net.IPNet{\n\t\t\t\t\tIP: attr.Value,\n\t\t\t\t\tMask: net.CIDRMask(int(msg.Dst_len), 8*len(attr.Value)),\n\t\t\t\t}\n\t\t\t}\n\t\tcase unix.RTA_OIF:\n\t\t\troute.LinkIndex = int(native.Uint32(attr.Value[0:4]))\n\t\tcase unix.RTA_IIF:\n\t\t\troute.ILinkIndex = int(native.Uint32(attr.Value[0:4]))\n\t\tcase unix.RTA_PRIORITY:\n\t\t\troute.Priority = int(native.Uint32(attr.Value[0:4]))\n\t\tcase unix.RTA_TABLE:\n\t\t\troute.Table = int(native.Uint32(attr.Value[0:4]))\n\t\tcase unix.RTA_MULTIPATH:\n\t\t\tparseRtNexthop := func(value []byte) (*NexthopInfo, []byte, error) {\n\t\t\t\tif len(value) < unix.SizeofRtNexthop {\n\t\t\t\t\treturn nil, nil, fmt.Errorf(\"lack of bytes\")\n\t\t\t\t}\n\t\t\t\tnh := nl.DeserializeRtNexthop(value)\n\t\t\t\tif len(value) < int(nh.RtNexthop.Len) {\n\t\t\t\t\treturn nil, nil, fmt.Errorf(\"lack of bytes\")\n\t\t\t\t}\n\t\t\t\tinfo := &NexthopInfo{\n\t\t\t\t\tLinkIndex: int(nh.RtNexthop.Ifindex),\n\t\t\t\t\tHops: int(nh.RtNexthop.Hops),\n\t\t\t\t\tFlags: int(nh.RtNexthop.Flags),\n\t\t\t\t}\n\t\t\t\tattrs, err := nl.ParseRouteAttr(value[unix.SizeofRtNexthop:int(nh.RtNexthop.Len)])\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn nil, nil, err\n\t\t\t\t}\n\t\t\t\tvar encap, encapType syscall.NetlinkRouteAttr\n\t\t\t\tfor _, attr := range attrs {\n\t\t\t\t\tswitch attr.Attr.Type {\n\t\t\t\t\tcase unix.RTA_GATEWAY:\n\t\t\t\t\t\tinfo.Gw = net.IP(attr.Value)\n\t\t\t\t\tcase unix.RTA_NEWDST:\n\t\t\t\t\t\tvar d Destination\n\t\t\t\t\t\tswitch msg.Family {\n\t\t\t\t\t\tcase nl.FAMILY_MPLS:\n\t\t\t\t\t\t\td = &MPLSDestination{}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif err := d.Decode(attr.Value); err != nil {\n\t\t\t\t\t\t\treturn nil, nil, err\n\t\t\t\t\t\t}\n\t\t\t\t\t\tinfo.NewDst = d\n\t\t\t\t\tcase unix.RTA_ENCAP_TYPE:\n\t\t\t\t\t\tencapType = attr\n\t\t\t\t\tcase unix.RTA_ENCAP:\n\t\t\t\t\t\tencap = attr\n\t\t\t\t\tcase unix.RTA_VIA:\n\t\t\t\t\t\td := &Via{}\n\t\t\t\t\t\tif err := d.Decode(attr.Value); err != nil {\n\t\t\t\t\t\t\treturn nil, nil, err\n\t\t\t\t\t\t}\n\t\t\t\t\t\tinfo.Via = d\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif len(encap.Value) != 0 && len(encapType.Value) != 0 {\n\t\t\t\t\ttyp := int(native.Uint16(encapType.Value[0:2]))\n\t\t\t\t\tvar e Encap\n\t\t\t\t\tswitch typ {\n\t\t\t\t\tcase nl.LWTUNNEL_ENCAP_MPLS:\n\t\t\t\t\t\te = &MPLSEncap{}\n\t\t\t\t\t\tif err := e.Decode(encap.Value); err != nil {\n\t\t\t\t\t\t\treturn nil, nil, err\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tinfo.Encap = e\n\t\t\t\t}\n\n\t\t\t\treturn info, value[int(nh.RtNexthop.Len):], nil\n\t\t\t}\n\t\t\trest := attr.Value\n\t\t\tfor len(rest) > 0 {\n\t\t\t\tinfo, buf, err := parseRtNexthop(rest)\n\t\t\t\tif err != nil {\n\t\t\t\t\treturn route, err\n\t\t\t\t}\n\t\t\t\troute.MultiPath = append(route.MultiPath, info)\n\t\t\t\trest = buf\n\t\t\t}\n\t\tcase unix.RTA_NEWDST:\n\t\t\tvar d Destination\n\t\t\tswitch msg.Family {\n\t\t\tcase nl.FAMILY_MPLS:\n\t\t\t\td = &MPLSDestination{}\n\t\t\t}\n\t\t\tif err := d.Decode(attr.Value); err != nil {\n\t\t\t\treturn route, err\n\t\t\t}\n\t\t\troute.NewDst = d\n\t\tcase unix.RTA_VIA:\n\t\t\tv := &Via{}\n\t\t\tif err := v.Decode(attr.Value); err != nil {\n\t\t\t\treturn route, err\n\t\t\t}\n\t\t\troute.Via = v\n\t\tcase unix.RTA_ENCAP_TYPE:\n\t\t\tencapType = attr\n\t\tcase unix.RTA_ENCAP:\n\t\t\tencap = attr\n\t\tcase unix.RTA_METRICS:\n\t\t\tmetrics, err := nl.ParseRouteAttr(attr.Value)\n\t\t\tif err != nil {\n\t\t\t\treturn route, err\n\t\t\t}\n\t\t\tfor _, metric := range metrics {\n\t\t\t\tswitch metric.Attr.Type {\n\t\t\t\tcase unix.RTAX_MTU:\n\t\t\t\t\troute.MTU = int(native.Uint32(metric.Value[0:4]))\n\t\t\t\tcase unix.RTAX_WINDOW:\n\t\t\t\t\troute.Window = int(native.Uint32(metric.Value[0:4]))\n\t\t\t\tcase unix.RTAX_RTT:\n\t\t\t\t\troute.Rtt = int(native.Uint32(metric.Value[0:4]))\n\t\t\t\tcase unix.RTAX_RTTVAR:\n\t\t\t\t\troute.RttVar = int(native.Uint32(metric.Value[0:4]))\n\t\t\t\tcase unix.RTAX_SSTHRESH:\n\t\t\t\t\troute.Ssthresh = int(native.Uint32(metric.Value[0:4]))\n\t\t\t\tcase unix.RTAX_CWND:\n\t\t\t\t\troute.Cwnd = int(native.Uint32(metric.Value[0:4]))\n\t\t\t\tcase unix.RTAX_ADVMSS:\n\t\t\t\t\troute.AdvMSS = int(native.Uint32(metric.Value[0:4]))\n\t\t\t\tcase unix.RTAX_REORDERING:\n\t\t\t\t\troute.Reordering = int(native.Uint32(metric.Value[0:4]))\n\t\t\t\tcase unix.RTAX_HOPLIMIT:\n\t\t\t\t\troute.Hoplimit = int(native.Uint32(metric.Value[0:4]))\n\t\t\t\tcase unix.RTAX_INITCWND:\n\t\t\t\t\troute.InitCwnd = int(native.Uint32(metric.Value[0:4]))\n\t\t\t\tcase unix.RTAX_FEATURES:\n\t\t\t\t\troute.Features = int(native.Uint32(metric.Value[0:4]))\n\t\t\t\tcase unix.RTAX_RTO_MIN:\n\t\t\t\t\troute.RtoMin = int(native.Uint32(metric.Value[0:4]))\n\t\t\t\tcase unix.RTAX_INITRWND:\n\t\t\t\t\troute.InitRwnd = int(native.Uint32(metric.Value[0:4]))\n\t\t\t\tcase unix.RTAX_QUICKACK:\n\t\t\t\t\troute.QuickACK = int(native.Uint32(metric.Value[0:4]))\n\t\t\t\tcase unix.RTAX_CC_ALGO:\n\t\t\t\t\troute.Congctl = nl.BytesToString(metric.Value)\n\t\t\t\tcase unix.RTAX_FASTOPEN_NO_COOKIE:\n\t\t\t\t\troute.FastOpenNoCookie = int(native.Uint32(metric.Value[0:4]))\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif len(encap.Value) != 0 && len(encapType.Value) != 0 {\n\t\ttyp := int(native.Uint16(encapType.Value[0:2]))\n\t\tvar e Encap\n\t\tswitch typ {\n\t\tcase nl.LWTUNNEL_ENCAP_MPLS:\n\t\t\te = &MPLSEncap{}\n\t\t\tif err := e.Decode(encap.Value); err != nil {\n\t\t\t\treturn route, err\n\t\t\t}\n\t\tcase nl.LWTUNNEL_ENCAP_SEG6:\n\t\t\te = &SEG6Encap{}\n\t\t\tif err := e.Decode(encap.Value); err != nil {\n\t\t\t\treturn route, err\n\t\t\t}\n\t\tcase nl.LWTUNNEL_ENCAP_SEG6_LOCAL:\n\t\t\te = &SEG6LocalEncap{}\n\t\t\tif err := e.Decode(encap.Value); err != nil {\n\t\t\t\treturn route, err\n\t\t\t}\n\t\tcase nl.LWTUNNEL_ENCAP_BPF:\n\t\t\te = &BpfEncap{}\n\t\t\tif err := e.Decode(encap.Value); err != nil {\n\t\t\t\treturn route, err\n\t\t\t}\n\t\t}\n\t\troute.Encap = e\n\t}\n\n\treturn route, nil\n}\n\n// RouteGetOptions contains a set of options to use with\n// RouteGetWithOptions\ntype RouteGetOptions struct {\n\tIif string\n\tVrfName string\n\tSrcAddr net.IP\n}\n\n// RouteGetWithOptions gets a route to a specific destination from the host system.\n// Equivalent to: 'ip route get <> vrf '.\nfunc RouteGetWithOptions(destination net.IP, options *RouteGetOptions) ([]Route, error) {\n\treturn pkgHandle.RouteGetWithOptions(destination, options)\n}\n\n// RouteGet gets a route to a specific destination from the host system.\n// Equivalent to: 'ip route get'.\nfunc RouteGet(destination net.IP) ([]Route, error) {\n\treturn pkgHandle.RouteGet(destination)\n}\n\n// RouteGetWithOptions gets a route to a specific destination from the host system.\n// Equivalent to: 'ip route get <> vrf '.\nfunc (h *Handle) RouteGetWithOptions(destination net.IP, options *RouteGetOptions) ([]Route, error) {\n\treq := h.newNetlinkRequest(unix.RTM_GETROUTE, unix.NLM_F_REQUEST)\n\tfamily := nl.GetIPFamily(destination)\n\tvar destinationData []byte\n\tvar bitlen uint8\n\tif family == FAMILY_V4 {\n\t\tdestinationData = destination.To4()\n\t\tbitlen = 32\n\t} else {\n\t\tdestinationData = destination.To16()\n\t\tbitlen = 128\n\t}\n\tmsg := &nl.RtMsg{}\n\tmsg.Family = uint8(family)\n\tmsg.Dst_len = bitlen\n\tif options != nil && options.SrcAddr != nil {\n\t\tmsg.Src_len = bitlen\n\t}\n\tmsg.Flags = unix.RTM_F_LOOKUP_TABLE\n\treq.AddData(msg)\n\n\trtaDst := nl.NewRtAttr(unix.RTA_DST, destinationData)\n\treq.AddData(rtaDst)\n\n\tif options != nil {\n\t\tif options.VrfName != \"\" {\n\t\t\tlink, err := LinkByName(options.VrfName)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\tb := make([]byte, 4)\n\t\t\tnative.PutUint32(b, uint32(link.Attrs().Index))\n\n\t\t\treq.AddData(nl.NewRtAttr(unix.RTA_OIF, b))\n\t\t}\n\n\t\tif len(options.Iif) > 0 {\n\t\t\tlink, err := LinkByName(options.Iif)\n\t\t\tif err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\n\t\t\tb := make([]byte, 4)\n\t\t\tnative.PutUint32(b, uint32(link.Attrs().Index))\n\n\t\t\treq.AddData(nl.NewRtAttr(unix.RTA_IIF, b))\n\t\t}\n\n\t\tif options.SrcAddr != nil {\n\t\t\tvar srcAddr []byte\n\t\t\tif family == FAMILY_V4 {\n\t\t\t\tsrcAddr = options.SrcAddr.To4()\n\t\t\t} else {\n\t\t\t\tsrcAddr = options.SrcAddr.To16()\n\t\t\t}\n\n\t\t\treq.AddData(nl.NewRtAttr(unix.RTA_SRC, srcAddr))\n\t\t}\n\t}\n\n\tmsgs, err := req.Execute(unix.NETLINK_ROUTE, unix.RTM_NEWROUTE)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tvar res []Route\n\tfor _, m := range msgs {\n\t\troute, err := deserializeRoute(m)\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\t\tres = append(res, route)\n\t}\n\treturn res, nil\n}\n\n// RouteGet gets a route to a specific destination from the host system.\n// Equivalent to: 'ip route get'.\nfunc (h *Handle) RouteGet(destination net.IP) ([]Route, error) {\n\treturn h.RouteGetWithOptions(destination, nil)\n}\n\n// RouteSubscribe takes a chan down which notifications will be sent\n// when routes are added or deleted. Close the 'done' chan to stop subscription.\nfunc RouteSubscribe(ch chan<- RouteUpdate, done <-chan struct{}) error {\n\treturn routeSubscribeAt(netns.None(), netns.None(), ch, done, nil, false)\n}\n\n// RouteSubscribeAt works like RouteSubscribe plus it allows the caller\n// to choose the network namespace in which to subscribe (ns).\nfunc RouteSubscribeAt(ns netns.NsHandle, ch chan<- RouteUpdate, done <-chan struct{}) error {\n\treturn routeSubscribeAt(ns, netns.None(), ch, done, nil, false)\n}\n\n// RouteSubscribeOptions contains a set of options to use with\n// RouteSubscribeWithOptions.\ntype RouteSubscribeOptions struct {\n\tNamespace *netns.NsHandle\n\tErrorCallback func(error)\n\tListExisting bool\n}\n\n// RouteSubscribeWithOptions work like RouteSubscribe but enable to\n// provide additional options to modify the behavior. Currently, the\n// namespace can be provided as well as an error callback.\nfunc RouteSubscribeWithOptions(ch chan<- RouteUpdate, done <-chan struct{}, options RouteSubscribeOptions) error {\n\tif options.Namespace == nil {\n\t\tnone := netns.None()\n\t\toptions.Namespace = &none\n\t}\n\treturn routeSubscribeAt(*options.Namespace, netns.None(), ch, done, options.ErrorCallback, options.ListExisting)\n}\n\nfunc routeSubscribeAt(newNs, curNs netns.NsHandle, ch chan<- RouteUpdate, done <-chan struct{}, cberr func(error), listExisting bool) error {\n\ts, err := nl.SubscribeAt(newNs, curNs, unix.NETLINK_ROUTE, unix.RTNLGRP_IPV4_ROUTE, unix.RTNLGRP_IPV6_ROUTE)\n\tif err != nil {\n\t\treturn err\n\t}\n\tif done != nil {\n\t\tgo func() {\n\t\t\t<-done\n\t\t\ts.Close()\n\t\t}()\n\t}\n\tif listExisting {\n\t\treq := pkgHandle.newNetlinkRequest(unix.RTM_GETROUTE,\n\t\t\tunix.NLM_F_DUMP)\n\t\tinfmsg := nl.NewIfInfomsg(unix.AF_UNSPEC)\n\t\treq.AddData(infmsg)\n\t\tif err := s.Send(req); err != nil {\n\t\t\treturn err\n\t\t}\n\t}\n\tgo func() {\n\t\tdefer close(ch)\n\t\tfor {\n\t\t\tmsgs, from, err := s.Receive()\n\t\t\tif err != nil {\n\t\t\t\tif cberr != nil {\n\t\t\t\t\tcberr(fmt.Errorf(\"Receive failed: %v\",\n\t\t\t\t\t\terr))\n\t\t\t\t}\n\t\t\t\treturn\n\t\t\t}\n\t\t\tif from.Pid != nl.PidKernel {\n\t\t\t\tif cberr != nil {\n\t\t\t\t\tcberr(fmt.Errorf(\"Wrong sender portid %d, expected %d\", from.Pid, nl.PidKernel))\n\t\t\t\t}\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tfor _, m := range msgs {\n\t\t\t\tif m.Header.Type == unix.NLMSG_DONE {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tif m.Header.Type == unix.NLMSG_ERROR {\n\t\t\t\t\terror := int32(native.Uint32(m.Data[0:4]))\n\t\t\t\t\tif error == 0 {\n\t\t\t\t\t\tcontinue\n\t\t\t\t\t}\n\t\t\t\t\tif cberr != nil {\n\t\t\t\t\t\tcberr(fmt.Errorf(\"error message: %v\",\n\t\t\t\t\t\t\tsyscall.Errno(-error)))\n\t\t\t\t\t}\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\troute, err := deserializeRoute(m.Data)\n\t\t\t\tif err != nil {\n\t\t\t\t\tif cberr != nil {\n\t\t\t\t\t\tcberr(err)\n\t\t\t\t\t}\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tch <- RouteUpdate{Type: m.Header.Type, Route: route}\n\t\t\t}\n\t\t}\n\t}()\n\n\treturn nil\n}\n\nfunc (p RouteProtocol) String() string {\n\tswitch int(p) {\n\tcase unix.RTPROT_BABEL:\n\t\treturn \"babel\"\n\tcase unix.RTPROT_BGP:\n\t\treturn \"bgp\"\n\tcase unix.RTPROT_BIRD:\n\t\treturn \"bird\"\n\tcase unix.RTPROT_BOOT:\n\t\treturn \"boot\"\n\tcase unix.RTPROT_DHCP:\n\t\treturn \"dhcp\"\n\tcase unix.RTPROT_DNROUTED:\n\t\treturn \"dnrouted\"\n\tcase unix.RTPROT_EIGRP:\n\t\treturn \"eigrp\"\n\tcase unix.RTPROT_GATED:\n\t\treturn \"gated\"\n\tcase unix.RTPROT_ISIS:\n\t\treturn \"isis\"\n\t//case unix.RTPROT_KEEPALIVED:\n\t//\treturn \"keepalived\"\n\tcase unix.RTPROT_KERNEL:\n\t\treturn \"kernel\"\n\tcase unix.RTPROT_MROUTED:\n\t\treturn \"mrouted\"\n\tcase unix.RTPROT_MRT:\n\t\treturn \"mrt\"\n\tcase unix.RTPROT_NTK:\n\t\treturn \"ntk\"\n\tcase unix.RTPROT_OSPF:\n\t\treturn \"ospf\"\n\tcase unix.RTPROT_RA:\n\t\treturn \"ra\"\n\tcase unix.RTPROT_REDIRECT:\n\t\treturn \"redirect\"\n\tcase unix.RTPROT_RIP:\n\t\treturn \"rip\"\n\tcase unix.RTPROT_STATIC:\n\t\treturn \"static\"\n\tcase unix.RTPROT_UNSPEC:\n\t\treturn \"unspec\"\n\tcase unix.RTPROT_XORP:\n\t\treturn \"xorp\"\n\tcase unix.RTPROT_ZEBRA:\n\t\treturn \"zebra\"\n\tdefault:\n\t\treturn strconv.Itoa(int(p))\n\t}\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/route_unspecified.go", "content": "// +build !linux\n\npackage netlink\n\nimport \"strconv\"\n\nfunc (r *Route) ListFlags() []string {\n\treturn []string{}\n}\n\nfunc (n *NexthopInfo) ListFlags() []string {\n\treturn []string{}\n}\n\nfunc (s Scope) String() string {\n\treturn \"unknown\"\n}\n\nfunc (p RouteProtocol) String() string {\n\treturn strconv.Itoa(int(p))\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/rule.go", "content": "package netlink\n\nimport (\n\t\"fmt\"\n\t\"net\"\n)\n\n// Rule represents a netlink rule.\ntype Rule struct {\n\tPriority int\n\tFamily int\n\tTable int\n\tMark int\n\tMask int\n\tTos uint\n\tTunID uint\n\tGoto int\n\tSrc *net.IPNet\n\tDst *net.IPNet\n\tFlow int\n\tIifName string\n\tOifName string\n\tSuppressIfgroup int\n\tSuppressPrefixlen int\n\tInvert bool\n\tDport *RulePortRange\n\tSport *RulePortRange\n}\n\nfunc (r Rule) String() string {\n\treturn fmt.Sprintf(\"ip rule %d: from %s table %d\", r.Priority, r.Src, r.Table)\n}\n\n// NewRule return empty rules.\nfunc NewRule() *Rule {\n\treturn &Rule{\n\t\tSuppressIfgroup: -1,\n\t\tSuppressPrefixlen: -1,\n\t\tPriority: -1,\n\t\tMark: -1,\n\t\tMask: -1,\n\t\tGoto: -1,\n\t\tFlow: -1,\n\t}\n}\n\n// NewRulePortRange creates rule sport/dport range.\nfunc NewRulePortRange(start, end uint16) *RulePortRange {\n\treturn &RulePortRange{Start: start, End: end}\n}\n\n// RulePortRange represents rule sport/dport range.\ntype RulePortRange struct {\n\tStart uint16\n\tEnd uint16\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/rule_linux.go", "content": "package netlink\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n\t\"net\"\n\n\t\"github.com/vishvananda/netlink/nl\"\n\t\"golang.org/x/sys/unix\"\n)\n\nconst FibRuleInvert = 0x2\n\n// RuleAdd adds a rule to the system.\n// Equivalent to: ip rule add\nfunc RuleAdd(rule *Rule) error {\n\treturn pkgHandle.RuleAdd(rule)\n}\n\n// RuleAdd adds a rule to the system.\n// Equivalent to: ip rule add\nfunc (h *Handle) RuleAdd(rule *Rule) error {\n\treq := h.newNetlinkRequest(unix.RTM_NEWRULE, unix.NLM_F_CREATE|unix.NLM_F_EXCL|unix.NLM_F_ACK)\n\treturn ruleHandle(rule, req)\n}\n\n// RuleDel deletes a rule from the system.\n// Equivalent to: ip rule del\nfunc RuleDel(rule *Rule) error {\n\treturn pkgHandle.RuleDel(rule)\n}\n\n// RuleDel deletes a rule from the system.\n// Equivalent to: ip rule del\nfunc (h *Handle) RuleDel(rule *Rule) error {\n\treq := h.newNetlinkRequest(unix.RTM_DELRULE, unix.NLM_F_ACK)\n\treturn ruleHandle(rule, req)\n}\n\nfunc ruleHandle(rule *Rule, req *nl.NetlinkRequest) error {\n\tmsg := nl.NewRtMsg()\n\tmsg.Family = unix.AF_INET\n\tmsg.Protocol = unix.RTPROT_BOOT\n\tmsg.Scope = unix.RT_SCOPE_UNIVERSE\n\tmsg.Table = unix.RT_TABLE_UNSPEC\n\tmsg.Type = unix.RTN_UNSPEC\n\tif req.NlMsghdr.Flags&unix.NLM_F_CREATE > 0 {\n\t\tmsg.Type = unix.RTN_UNICAST\n\t}\n\tif rule.Invert {\n\t\tmsg.Flags |= FibRuleInvert\n\t}\n\tif rule.Family != 0 {\n\t\tmsg.Family = uint8(rule.Family)\n\t}\n\tif rule.Table >= 0 && rule.Table < 256 {\n\t\tmsg.Table = uint8(rule.Table)\n\t}\n\tif rule.Tos != 0 {\n\t\tmsg.Tos = uint8(rule.Tos)\n\t}\n\n\tvar dstFamily uint8\n\tvar rtAttrs []*nl.RtAttr\n\tif rule.Dst != nil && rule.Dst.IP != nil {\n\t\tdstLen, _ := rule.Dst.Mask.Size()\n\t\tmsg.Dst_len = uint8(dstLen)\n\t\tmsg.Family = uint8(nl.GetIPFamily(rule.Dst.IP))\n\t\tdstFamily = msg.Family\n\t\tvar dstData []byte\n\t\tif msg.Family == unix.AF_INET {\n\t\t\tdstData = rule.Dst.IP.To4()\n\t\t} else {\n\t\t\tdstData = rule.Dst.IP.To16()\n\t\t}\n\t\trtAttrs = append(rtAttrs, nl.NewRtAttr(unix.RTA_DST, dstData))\n\t}\n\n\tif rule.Src != nil && rule.Src.IP != nil {\n\t\tmsg.Family = uint8(nl.GetIPFamily(rule.Src.IP))\n\t\tif dstFamily != 0 && dstFamily != msg.Family {\n\t\t\treturn fmt.Errorf(\"source and destination ip are not the same IP family\")\n\t\t}\n\t\tsrcLen, _ := rule.Src.Mask.Size()\n\t\tmsg.Src_len = uint8(srcLen)\n\t\tvar srcData []byte\n\t\tif msg.Family == unix.AF_INET {\n\t\t\tsrcData = rule.Src.IP.To4()\n\t\t} else {\n\t\t\tsrcData = rule.Src.IP.To16()\n\t\t}\n\t\trtAttrs = append(rtAttrs, nl.NewRtAttr(unix.RTA_SRC, srcData))\n\t}\n\n\treq.AddData(msg)\n\tfor i := range rtAttrs {\n\t\treq.AddData(rtAttrs[i])\n\t}\n\n\tif rule.Priority >= 0 {\n\t\tb := make([]byte, 4)\n\t\tnative.PutUint32(b, uint32(rule.Priority))\n\t\treq.AddData(nl.NewRtAttr(nl.FRA_PRIORITY, b))\n\t}\n\tif rule.Mark >= 0 {\n\t\tb := make([]byte, 4)\n\t\tnative.PutUint32(b, uint32(rule.Mark))\n\t\treq.AddData(nl.NewRtAttr(nl.FRA_FWMARK, b))\n\t}\n\tif rule.Mask >= 0 {\n\t\tb := make([]byte, 4)\n\t\tnative.PutUint32(b, uint32(rule.Mask))\n\t\treq.AddData(nl.NewRtAttr(nl.FRA_FWMASK, b))\n\t}\n\tif rule.Flow >= 0 {\n\t\tb := make([]byte, 4)\n\t\tnative.PutUint32(b, uint32(rule.Flow))\n\t\treq.AddData(nl.NewRtAttr(nl.FRA_FLOW, b))\n\t}\n\tif rule.TunID > 0 {\n\t\tb := make([]byte, 4)\n\t\tnative.PutUint32(b, uint32(rule.TunID))\n\t\treq.AddData(nl.NewRtAttr(nl.FRA_TUN_ID, b))\n\t}\n\tif rule.Table >= 256 {\n\t\tb := make([]byte, 4)\n\t\tnative.PutUint32(b, uint32(rule.Table))\n\t\treq.AddData(nl.NewRtAttr(nl.FRA_TABLE, b))\n\t}\n\tif msg.Table > 0 {\n\t\tif rule.SuppressPrefixlen >= 0 {\n\t\t\tb := make([]byte, 4)\n\t\t\tnative.PutUint32(b, uint32(rule.SuppressPrefixlen))\n\t\t\treq.AddData(nl.NewRtAttr(nl.FRA_SUPPRESS_PREFIXLEN, b))\n\t\t}\n\t\tif rule.SuppressIfgroup >= 0 {\n\t\t\tb := make([]byte, 4)\n\t\t\tnative.PutUint32(b, uint32(rule.SuppressIfgroup))\n\t\t\treq.AddData(nl.NewRtAttr(nl.FRA_SUPPRESS_IFGROUP, b))\n\t\t}\n\t}\n\tif rule.IifName != \"\" {\n\t\treq.AddData(nl.NewRtAttr(nl.FRA_IIFNAME, []byte(rule.IifName+\"\\x00\")))\n\t}\n\tif rule.OifName != \"\" {\n\t\treq.AddData(nl.NewRtAttr(nl.FRA_OIFNAME, []byte(rule.OifName+\"\\x00\")))\n\t}\n\tif rule.Goto >= 0 {\n\t\tmsg.Type = nl.FR_ACT_GOTO\n\t\tb := make([]byte, 4)\n\t\tnative.PutUint32(b, uint32(rule.Goto))\n\t\treq.AddData(nl.NewRtAttr(nl.FRA_GOTO, b))\n\t}\n\n\tif rule.Dport != nil {\n\t\tb := rule.Dport.toRtAttrData()\n\t\treq.AddData(nl.NewRtAttr(nl.FRA_DPORT_RANGE, b))\n\t}\n\n\tif rule.Sport != nil {\n\t\tb := rule.Sport.toRtAttrData()\n\t\treq.AddData(nl.NewRtAttr(nl.FRA_SPORT_RANGE, b))\n\t}\n\n\t_, err := req.Execute(unix.NETLINK_ROUTE, 0)\n\treturn err\n}\n\n// RuleList lists rules in the system.\n// Equivalent to: ip rule list\nfunc RuleList(family int) ([]Rule, error) {\n\treturn pkgHandle.RuleList(family)\n}\n\n// RuleList lists rules in the system.\n// Equivalent to: ip rule list\nfunc (h *Handle) RuleList(family int) ([]Rule, error) {\n\treturn h.RuleListFiltered(family, nil, 0)\n}\n\n// RuleListFiltered gets a list of rules in the system filtered by the\n// specified rule template `filter`.\n// Equivalent to: ip rule list\nfunc RuleListFiltered(family int, filter *Rule, filterMask uint64) ([]Rule, error) {\n\treturn pkgHandle.RuleListFiltered(family, filter, filterMask)\n}\n\n// RuleListFiltered lists rules in the system.\n// Equivalent to: ip rule list\nfunc (h *Handle) RuleListFiltered(family int, filter *Rule, filterMask uint64) ([]Rule, error) {\n\treq := h.newNetlinkRequest(unix.RTM_GETRULE, unix.NLM_F_DUMP|unix.NLM_F_REQUEST)\n\tmsg := nl.NewIfInfomsg(family)\n\treq.AddData(msg)\n\n\tmsgs, err := req.Execute(unix.NETLINK_ROUTE, unix.RTM_NEWRULE)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tvar res = make([]Rule, 0)\n\tfor i := range msgs {\n\t\tmsg := nl.DeserializeRtMsg(msgs[i])\n\t\tattrs, err := nl.ParseRouteAttr(msgs[i][msg.Len():])\n\t\tif err != nil {\n\t\t\treturn nil, err\n\t\t}\n\n\t\trule := NewRule()\n\n\t\trule.Invert = msg.Flags&FibRuleInvert > 0\n\t\trule.Tos = uint(msg.Tos)\n\n\t\tfor j := range attrs {\n\t\t\tswitch attrs[j].Attr.Type {\n\t\t\tcase unix.RTA_TABLE:\n\t\t\t\trule.Table = int(native.Uint32(attrs[j].Value[0:4]))\n\t\t\tcase nl.FRA_SRC:\n\t\t\t\trule.Src = &net.IPNet{\n\t\t\t\t\tIP: attrs[j].Value,\n\t\t\t\t\tMask: net.CIDRMask(int(msg.Src_len), 8*len(attrs[j].Value)),\n\t\t\t\t}\n\t\t\tcase nl.FRA_DST:\n\t\t\t\trule.Dst = &net.IPNet{\n\t\t\t\t\tIP: attrs[j].Value,\n\t\t\t\t\tMask: net.CIDRMask(int(msg.Dst_len), 8*len(attrs[j].Value)),\n\t\t\t\t}\n\t\t\tcase nl.FRA_FWMARK:\n\t\t\t\trule.Mark = int(native.Uint32(attrs[j].Value[0:4]))\n\t\t\tcase nl.FRA_FWMASK:\n\t\t\t\trule.Mask = int(native.Uint32(attrs[j].Value[0:4]))\n\t\t\tcase nl.FRA_TUN_ID:\n\t\t\t\trule.TunID = uint(native.Uint64(attrs[j].Value[0:8]))\n\t\t\tcase nl.FRA_IIFNAME:\n\t\t\t\trule.IifName = string(attrs[j].Value[:len(attrs[j].Value)-1])\n\t\t\tcase nl.FRA_OIFNAME:\n\t\t\t\trule.OifName = string(attrs[j].Value[:len(attrs[j].Value)-1])\n\t\t\tcase nl.FRA_SUPPRESS_PREFIXLEN:\n\t\t\t\ti := native.Uint32(attrs[j].Value[0:4])\n\t\t\t\tif i != 0xffffffff {\n\t\t\t\t\trule.SuppressPrefixlen = int(i)\n\t\t\t\t}\n\t\t\tcase nl.FRA_SUPPRESS_IFGROUP:\n\t\t\t\ti := native.Uint32(attrs[j].Value[0:4])\n\t\t\t\tif i != 0xffffffff {\n\t\t\t\t\trule.SuppressIfgroup = int(i)\n\t\t\t\t}\n\t\t\tcase nl.FRA_FLOW:\n\t\t\t\trule.Flow = int(native.Uint32(attrs[j].Value[0:4]))\n\t\t\tcase nl.FRA_GOTO:\n\t\t\t\trule.Goto = int(native.Uint32(attrs[j].Value[0:4]))\n\t\t\tcase nl.FRA_PRIORITY:\n\t\t\t\trule.Priority = int(native.Uint32(attrs[j].Value[0:4]))\n\t\t\tcase nl.FRA_DPORT_RANGE:\n\t\t\t\trule.Dport = NewRulePortRange(native.Uint16(attrs[j].Value[0:2]), native.Uint16(attrs[j].Value[2:4]))\n\t\t\tcase nl.FRA_SPORT_RANGE:\n\t\t\t\trule.Sport = NewRulePortRange(native.Uint16(attrs[j].Value[0:2]), native.Uint16(attrs[j].Value[2:4]))\n\t\t\t}\n\t\t}\n\n\t\tif filter != nil {\n\t\t\tswitch {\n\t\t\tcase filterMask&RT_FILTER_SRC != 0 &&\n\t\t\t\t(rule.Src == nil || rule.Src.String() != filter.Src.String()):\n\t\t\t\tcontinue\n\t\t\tcase filterMask&RT_FILTER_DST != 0 &&\n\t\t\t\t(rule.Dst == nil || rule.Dst.String() != filter.Dst.String()):\n\t\t\t\tcontinue\n\t\t\tcase filterMask&RT_FILTER_TABLE != 0 &&\n\t\t\t\tfilter.Table != unix.RT_TABLE_UNSPEC && rule.Table != filter.Table:\n\t\t\t\tcontinue\n\t\t\tcase filterMask&RT_FILTER_TOS != 0 && rule.Tos != filter.Tos:\n\t\t\t\tcontinue\n\t\t\tcase filterMask&RT_FILTER_PRIORITY != 0 && rule.Priority != filter.Priority:\n\t\t\t\tcontinue\n\t\t\tcase filterMask&RT_FILTER_MARK != 0 && rule.Mark != filter.Mark:\n\t\t\t\tcontinue\n\t\t\tcase filterMask&RT_FILTER_MASK != 0 && rule.Mask != filter.Mask:\n\t\t\t\tcontinue\n\t\t\t}\n\t\t}\n\n\t\tres = append(res, *rule)\n\t}\n\n\treturn res, nil\n}\n\nfunc (pr *RulePortRange) toRtAttrData() []byte {\n\tb := [][]byte{make([]byte, 2), make([]byte, 2)}\n\tnative.PutUint16(b[0], pr.Start)\n\tnative.PutUint16(b[1], pr.End)\n\treturn bytes.Join(b, []byte{})\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/socket.go", "content": "package netlink\n\nimport \"net\"\n\n// SocketID identifies a single socket.\ntype SocketID struct {\n\tSourcePort uint16\n\tDestinationPort uint16\n\tSource net.IP\n\tDestination net.IP\n\tInterface uint32\n\tCookie [2]uint32\n}\n\n// Socket represents a netlink socket.\ntype Socket struct {\n\tFamily uint8\n\tState uint8\n\tTimer uint8\n\tRetrans uint8\n\tID SocketID\n\tExpires uint32\n\tRQueue uint32\n\tWQueue uint32\n\tUID uint32\n\tINode uint32\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/socket_linux.go", "content": "package netlink\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"net\"\n\t\"syscall\"\n\n\t\"github.com/vishvananda/netlink/nl\"\n\t\"golang.org/x/sys/unix\"\n)\n\nconst (\n\tsizeofSocketID = 0x30\n\tsizeofSocketRequest = sizeofSocketID + 0x8\n\tsizeofSocket = sizeofSocketID + 0x18\n)\n\ntype socketRequest struct {\n\tFamily uint8\n\tProtocol uint8\n\tExt uint8\n\tpad uint8\n\tStates uint32\n\tID SocketID\n}\n\ntype writeBuffer struct {\n\tBytes []byte\n\tpos int\n}\n\nfunc (b *writeBuffer) Write(c byte) {\n\tb.Bytes[b.pos] = c\n\tb.pos++\n}\n\nfunc (b *writeBuffer) Next(n int) []byte {\n\ts := b.Bytes[b.pos : b.pos+n]\n\tb.pos += n\n\treturn s\n}\n\nfunc (r *socketRequest) Serialize() []byte {\n\tb := writeBuffer{Bytes: make([]byte, sizeofSocketRequest)}\n\tb.Write(r.Family)\n\tb.Write(r.Protocol)\n\tb.Write(r.Ext)\n\tb.Write(r.pad)\n\tnative.PutUint32(b.Next(4), r.States)\n\tnetworkOrder.PutUint16(b.Next(2), r.ID.SourcePort)\n\tnetworkOrder.PutUint16(b.Next(2), r.ID.DestinationPort)\n\tif r.Family == unix.AF_INET6 {\n\t\tcopy(b.Next(16), r.ID.Source)\n\t\tcopy(b.Next(16), r.ID.Destination)\n\t} else {\n\t\tcopy(b.Next(4), r.ID.Source.To4())\n\t\tb.Next(12)\n\t\tcopy(b.Next(4), r.ID.Destination.To4())\n\t\tb.Next(12)\n\t}\n\tnative.PutUint32(b.Next(4), r.ID.Interface)\n\tnative.PutUint32(b.Next(4), r.ID.Cookie[0])\n\tnative.PutUint32(b.Next(4), r.ID.Cookie[1])\n\treturn b.Bytes\n}\n\nfunc (r *socketRequest) Len() int { return sizeofSocketRequest }\n\ntype readBuffer struct {\n\tBytes []byte\n\tpos int\n}\n\nfunc (b *readBuffer) Read() byte {\n\tc := b.Bytes[b.pos]\n\tb.pos++\n\treturn c\n}\n\nfunc (b *readBuffer) Next(n int) []byte {\n\ts := b.Bytes[b.pos : b.pos+n]\n\tb.pos += n\n\treturn s\n}\n\nfunc (s *Socket) deserialize(b []byte) error {\n\tif len(b) < sizeofSocket {\n\t\treturn fmt.Errorf(\"socket data short read (%d); want %d\", len(b), sizeofSocket)\n\t}\n\trb := readBuffer{Bytes: b}\n\ts.Family = rb.Read()\n\ts.State = rb.Read()\n\ts.Timer = rb.Read()\n\ts.Retrans = rb.Read()\n\ts.ID.SourcePort = networkOrder.Uint16(rb.Next(2))\n\ts.ID.DestinationPort = networkOrder.Uint16(rb.Next(2))\n\tif s.Family == unix.AF_INET6 {\n\t\ts.ID.Source = net.IP(rb.Next(16))\n\t\ts.ID.Destination = net.IP(rb.Next(16))\n\t} else {\n\t\ts.ID.Source = net.IPv4(rb.Read(), rb.Read(), rb.Read(), rb.Read())\n\t\trb.Next(12)\n\t\ts.ID.Destination = net.IPv4(rb.Read(), rb.Read(), rb.Read(), rb.Read())\n\t\trb.Next(12)\n\t}\n\ts.ID.Interface = native.Uint32(rb.Next(4))\n\ts.ID.Cookie[0] = native.Uint32(rb.Next(4))\n\ts.ID.Cookie[1] = native.Uint32(rb.Next(4))\n\ts.Expires = native.Uint32(rb.Next(4))\n\ts.RQueue = native.Uint32(rb.Next(4))\n\ts.WQueue = native.Uint32(rb.Next(4))\n\ts.UID = native.Uint32(rb.Next(4))\n\ts.INode = native.Uint32(rb.Next(4))\n\treturn nil\n}\n\n// SocketGet returns the Socket identified by its local and remote addresses.\nfunc SocketGet(local, remote net.Addr) (*Socket, error) {\n\tlocalTCP, ok := local.(*net.TCPAddr)\n\tif !ok {\n\t\treturn nil, ErrNotImplemented\n\t}\n\tremoteTCP, ok := remote.(*net.TCPAddr)\n\tif !ok {\n\t\treturn nil, ErrNotImplemented\n\t}\n\tlocalIP := localTCP.IP.To4()\n\tif localIP == nil {\n\t\treturn nil, ErrNotImplemented\n\t}\n\tremoteIP := remoteTCP.IP.To4()\n\tif remoteIP == nil {\n\t\treturn nil, ErrNotImplemented\n\t}\n\n\ts, err := nl.Subscribe(unix.NETLINK_INET_DIAG)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tdefer s.Close()\n\treq := nl.NewNetlinkRequest(nl.SOCK_DIAG_BY_FAMILY, 0)\n\treq.AddData(&socketRequest{\n\t\tFamily: unix.AF_INET,\n\t\tProtocol: unix.IPPROTO_TCP,\n\t\tID: SocketID{\n\t\t\tSourcePort: uint16(localTCP.Port),\n\t\t\tDestinationPort: uint16(remoteTCP.Port),\n\t\t\tSource: localIP,\n\t\t\tDestination: remoteIP,\n\t\t\tCookie: [2]uint32{nl.TCPDIAG_NOCOOKIE, nl.TCPDIAG_NOCOOKIE},\n\t\t},\n\t})\n\ts.Send(req)\n\tmsgs, from, err := s.Receive()\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\tif from.Pid != nl.PidKernel {\n\t\treturn nil, fmt.Errorf(\"Wrong sender portid %d, expected %d\", from.Pid, nl.PidKernel)\n\t}\n\tif len(msgs) == 0 {\n\t\treturn nil, errors.New(\"no message nor error from netlink\")\n\t}\n\tif len(msgs) > 2 {\n\t\treturn nil, fmt.Errorf(\"multiple (%d) matching sockets\", len(msgs))\n\t}\n\tsock := &Socket{}\n\tif err := sock.deserialize(msgs[0].Data); err != nil {\n\t\treturn nil, err\n\t}\n\treturn sock, nil\n}\n\n// SocketDiagTCPInfo requests INET_DIAG_INFO for TCP protocol for specified family type and return with extension TCP info.\nfunc SocketDiagTCPInfo(family uint8) ([]*InetDiagTCPInfoResp, error) {\n\tvar result []*InetDiagTCPInfoResp\n\terr := socketDiagTCPExecutor(family, func(m syscall.NetlinkMessage) error {\n\t\tsockInfo := &Socket{}\n\t\tif err := sockInfo.deserialize(m.Data); err != nil {\n\t\t\treturn err\n\t\t}\n\t\tattrs, err := nl.ParseRouteAttr(m.Data[sizeofSocket:])\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\n\t\tres, err := attrsToInetDiagTCPInfoResp(attrs, sockInfo)\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\n\t\tresult = append(result, res)\n\t\treturn nil\n\t})\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn result, nil\n}\n\n// SocketDiagTCP requests INET_DIAG_INFO for TCP protocol for specified family type and return related socket.\nfunc SocketDiagTCP(family uint8) ([]*Socket, error) {\n\tvar result []*Socket\n\terr := socketDiagTCPExecutor(family, func(m syscall.NetlinkMessage) error {\n\t\tsockInfo := &Socket{}\n\t\tif err := sockInfo.deserialize(m.Data); err != nil {\n\t\t\treturn err\n\t\t}\n\t\tresult = append(result, sockInfo)\n\t\treturn nil\n\t})\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\treturn result, nil\n}\n\n// socketDiagTCPExecutor requests INET_DIAG_INFO for TCP protocol for specified family type.\nfunc socketDiagTCPExecutor(family uint8, receiver func(syscall.NetlinkMessage) error) error {\n\ts, err := nl.Subscribe(unix.NETLINK_INET_DIAG)\n\tif err != nil {\n\t\treturn err\n\t}\n\tdefer s.Close()\n\n\treq := nl.NewNetlinkRequest(nl.SOCK_DIAG_BY_FAMILY, unix.NLM_F_DUMP)\n\treq.AddData(&socketRequest{\n\t\tFamily: family,\n\t\tProtocol: unix.IPPROTO_TCP,\n\t\tExt: (1 << (INET_DIAG_VEGASINFO - 1)) | (1 << (INET_DIAG_INFO - 1)),\n\t\tStates: uint32(0xfff), // All TCP states\n\t})\n\ts.Send(req)\n\nloop:\n\tfor {\n\t\tmsgs, from, err := s.Receive()\n\t\tif err != nil {\n\t\t\treturn err\n\t\t}\n\t\tif from.Pid != nl.PidKernel {\n\t\t\treturn fmt.Errorf(\"Wrong sender portid %d, expected %d\", from.Pid, nl.PidKernel)\n\t\t}\n\t\tif len(msgs) == 0 {\n\t\t\treturn errors.New(\"no message nor error from netlink\")\n\t\t}\n\n\t\tfor _, m := range msgs {\n\t\t\tswitch m.Header.Type {\n\t\t\tcase unix.NLMSG_DONE:\n\t\t\t\tbreak loop\n\t\t\tcase unix.NLMSG_ERROR:\n\t\t\t\terror := int32(native.Uint32(m.Data[0:4]))\n\t\t\t\treturn syscall.Errno(-error)\n\t\t\t}\n\t\t\tif err := receiver(m); err != nil {\n\t\t\t\treturn err\n\t\t\t}\n\t\t}\n\t}\n\treturn nil\n}\n\nfunc attrsToInetDiagTCPInfoResp(attrs []syscall.NetlinkRouteAttr, sockInfo *Socket) (*InetDiagTCPInfoResp, error) {\n\tvar tcpInfo *TCPInfo\n\tvar tcpBBRInfo *TCPBBRInfo\n\tfor _, a := range attrs {\n\t\tif a.Attr.Type == INET_DIAG_INFO {\n\t\t\ttcpInfo = &TCPInfo{}\n\t\t\tif err := tcpInfo.deserialize(a.Value); err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\n\t\tif a.Attr.Type == INET_DIAG_BBRINFO {\n\t\t\ttcpBBRInfo = &TCPBBRInfo{}\n\t\t\tif err := tcpBBRInfo.deserialize(a.Value); err != nil {\n\t\t\t\treturn nil, err\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t}\n\n\treturn &InetDiagTCPInfoResp{\n\t\tInetDiagMsg: sockInfo,\n\t\tTCPInfo: tcpInfo,\n\t\tTCPBBRInfo: tcpBBRInfo,\n\t}, nil\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/tcp.go", "content": "package netlink\n\n// TCP States\nconst (\n\tTCP_ESTABLISHED = iota + 0x01\n\tTCP_SYN_SENT\n\tTCP_SYN_RECV\n\tTCP_FIN_WAIT1\n\tTCP_FIN_WAIT2\n\tTCP_TIME_WAIT\n\tTCP_CLOSE\n\tTCP_CLOSE_WAIT\n\tTCP_LAST_ACK\n\tTCP_LISTEN\n\tTCP_CLOSING\n\tTCP_NEW_SYN_REC\n\tTCP_MAX_STATES\n)\n\ntype TCPInfo struct {\n\tState uint8\n\tCa_state uint8\n\tRetransmits uint8\n\tProbes uint8\n\tBackoff uint8\n\tOptions uint8\n\tSnd_wscale uint8 // no uint4\n\tRcv_wscale uint8\n\tDelivery_rate_app_limited uint8\n\tFastopen_client_fail uint8\n\tRto uint32\n\tAto uint32\n\tSnd_mss uint32\n\tRcv_mss uint32\n\tUnacked uint32\n\tSacked uint32\n\tLost uint32\n\tRetrans uint32\n\tFackets uint32\n\tLast_data_sent uint32\n\tLast_ack_sent uint32\n\tLast_data_recv uint32\n\tLast_ack_recv uint32\n\tPmtu uint32\n\tRcv_ssthresh uint32\n\tRtt uint32\n\tRttvar uint32\n\tSnd_ssthresh uint32\n\tSnd_cwnd uint32\n\tAdvmss uint32\n\tReordering uint32\n\tRcv_rtt uint32\n\tRcv_space uint32\n\tTotal_retrans uint32\n\tPacing_rate uint64\n\tMax_pacing_rate uint64\n\tBytes_acked uint64 /* RFC4898 tcpEStatsAppHCThruOctetsAcked */\n\tBytes_received uint64 /* RFC4898 tcpEStatsAppHCThruOctetsReceived */\n\tSegs_out uint32 /* RFC4898 tcpEStatsPerfSegsOut */\n\tSegs_in uint32 /* RFC4898 tcpEStatsPerfSegsIn */\n\tNotsent_bytes uint32\n\tMin_rtt uint32\n\tData_segs_in uint32 /* RFC4898 tcpEStatsDataSegsIn */\n\tData_segs_out uint32 /* RFC4898 tcpEStatsDataSegsOut */\n\tDelivery_rate uint64\n\tBusy_time uint64 /* Time (usec) busy sending data */\n\tRwnd_limited uint64 /* Time (usec) limited by receive window */\n\tSndbuf_limited uint64 /* Time (usec) limited by send buffer */\n\tDelivered uint32\n\tDelivered_ce uint32\n\tBytes_sent uint64 /* RFC4898 tcpEStatsPerfHCDataOctetsOut */\n\tBytes_retrans uint64 /* RFC4898 tcpEStatsPerfOctetsRetrans */\n\tDsack_dups uint32 /* RFC4898 tcpEStatsStackDSACKDups */\n\tReord_seen uint32 /* reordering events seen */\n\tRcv_ooopack uint32 /* Out-of-order packets received */\n\tSnd_wnd uint32 /* peer's advertised receive window after * scaling (bytes) */\n}\n\ntype TCPBBRInfo struct {\n\tBBRBW uint64\n\tBBRMinRTT uint32\n\tBBRPacingGain uint32\n\tBBRCwndGain uint32\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/tcp_linux.go", "content": "package netlink\n\nimport (\n\t\"bytes\"\n\t\"errors\"\n\t\"io\"\n)\n\nconst (\n\ttcpBBRInfoLen = 20\n)\n\nfunc checkDeserErr(err error) error {\n\tif err == io.EOF {\n\t\treturn nil\n\t}\n\treturn err\n}\n\nfunc (t *TCPInfo) deserialize(b []byte) error {\n\tvar err error\n\trb := bytes.NewBuffer(b)\n\n\tt.State, err = rb.ReadByte()\n\tif err != nil {\n\t\treturn checkDeserErr(err)\n\t}\n\n\tt.Ca_state, err = rb.ReadByte()\n\tif err != nil {\n\t\treturn checkDeserErr(err)\n\t}\n\n\tt.Retransmits, err = rb.ReadByte()\n\tif err != nil {\n\t\treturn checkDeserErr(err)\n\t}\n\n\tt.Probes, err = rb.ReadByte()\n\tif err != nil {\n\t\treturn checkDeserErr(err)\n\t}\n\n\tt.Backoff, err = rb.ReadByte()\n\tif err != nil {\n\t\treturn checkDeserErr(err)\n\t}\n\tt.Options, err = rb.ReadByte()\n\tif err != nil {\n\t\treturn checkDeserErr(err)\n\t}\n\n\tscales, err := rb.ReadByte()\n\tif err != nil {\n\t\treturn checkDeserErr(err)\n\t}\n\tt.Snd_wscale = scales >> 4 // first 4 bits\n\tt.Rcv_wscale = scales & 0xf // last 4 bits\n\n\trateLimAndFastOpen, err := rb.ReadByte()\n\tif err != nil {\n\t\treturn checkDeserErr(err)\n\t}\n\tt.Delivery_rate_app_limited = rateLimAndFastOpen >> 7 // get first bit\n\tt.Fastopen_client_fail = rateLimAndFastOpen >> 5 & 3 // get next two bits\n\n\tnext := rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Rto = native.Uint32(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Ato = native.Uint32(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Snd_mss = native.Uint32(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Rcv_mss = native.Uint32(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Unacked = native.Uint32(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Sacked = native.Uint32(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Lost = native.Uint32(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Retrans = native.Uint32(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Fackets = native.Uint32(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Last_data_sent = native.Uint32(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Last_ack_sent = native.Uint32(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Last_data_recv = native.Uint32(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Last_ack_recv = native.Uint32(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Pmtu = native.Uint32(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Rcv_ssthresh = native.Uint32(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Rtt = native.Uint32(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Rttvar = native.Uint32(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Snd_ssthresh = native.Uint32(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Snd_cwnd = native.Uint32(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Advmss = native.Uint32(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Reordering = native.Uint32(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Rcv_rtt = native.Uint32(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Rcv_space = native.Uint32(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Total_retrans = native.Uint32(next)\n\n\tnext = rb.Next(8)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Pacing_rate = native.Uint64(next)\n\n\tnext = rb.Next(8)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Max_pacing_rate = native.Uint64(next)\n\n\tnext = rb.Next(8)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Bytes_acked = native.Uint64(next)\n\n\tnext = rb.Next(8)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Bytes_received = native.Uint64(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Segs_out = native.Uint32(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Segs_in = native.Uint32(next)\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Notsent_bytes = native.Uint32(next)\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Min_rtt = native.Uint32(next)\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Data_segs_in = native.Uint32(next)\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Data_segs_out = native.Uint32(next)\n\n\tnext = rb.Next(8)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Delivery_rate = native.Uint64(next)\n\n\tnext = rb.Next(8)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Busy_time = native.Uint64(next)\n\n\tnext = rb.Next(8)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Rwnd_limited = native.Uint64(next)\n\n\tnext = rb.Next(8)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Sndbuf_limited = native.Uint64(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Delivered = native.Uint32(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Delivered_ce = native.Uint32(next)\n\n\tnext = rb.Next(8)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Bytes_sent = native.Uint64(next)\n\n\tnext = rb.Next(8)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Bytes_retrans = native.Uint64(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Dsack_dups = native.Uint32(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Reord_seen = native.Uint32(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Rcv_ooopack = native.Uint32(next)\n\n\tnext = rb.Next(4)\n\tif len(next) == 0 {\n\t\treturn nil\n\t}\n\tt.Snd_wnd = native.Uint32(next)\n\treturn nil\n}\n\nfunc (t *TCPBBRInfo) deserialize(b []byte) error {\n\tif len(b) != tcpBBRInfoLen {\n\t\treturn errors.New(\"Invalid length\")\n\t}\n\n\trb := bytes.NewBuffer(b)\n\tt.BBRBW = native.Uint64(rb.Next(8))\n\tt.BBRMinRTT = native.Uint32(rb.Next(4))\n\tt.BBRPacingGain = native.Uint32(rb.Next(4))\n\tt.BBRCwndGain = native.Uint32(rb.Next(4))\n\n\treturn nil\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/xfrm.go", "content": "package netlink\n\nimport (\n\t\"fmt\"\n\n\t\"golang.org/x/sys/unix\"\n)\n\n// Proto is an enum representing an ipsec protocol.\ntype Proto uint8\n\nconst (\n\tXFRM_PROTO_ROUTE2 Proto = unix.IPPROTO_ROUTING\n\tXFRM_PROTO_ESP Proto = unix.IPPROTO_ESP\n\tXFRM_PROTO_AH Proto = unix.IPPROTO_AH\n\tXFRM_PROTO_HAO Proto = unix.IPPROTO_DSTOPTS\n\tXFRM_PROTO_COMP Proto = 0x6c // NOTE not defined on darwin\n\tXFRM_PROTO_IPSEC_ANY Proto = unix.IPPROTO_RAW\n)\n\nfunc (p Proto) String() string {\n\tswitch p {\n\tcase XFRM_PROTO_ROUTE2:\n\t\treturn \"route2\"\n\tcase XFRM_PROTO_ESP:\n\t\treturn \"esp\"\n\tcase XFRM_PROTO_AH:\n\t\treturn \"ah\"\n\tcase XFRM_PROTO_HAO:\n\t\treturn \"hao\"\n\tcase XFRM_PROTO_COMP:\n\t\treturn \"comp\"\n\tcase XFRM_PROTO_IPSEC_ANY:\n\t\treturn \"ipsec-any\"\n\t}\n\treturn fmt.Sprintf(\"%d\", p)\n}\n\n// Mode is an enum representing an ipsec transport.\ntype Mode uint8\n\nconst (\n\tXFRM_MODE_TRANSPORT Mode = iota\n\tXFRM_MODE_TUNNEL\n\tXFRM_MODE_ROUTEOPTIMIZATION\n\tXFRM_MODE_IN_TRIGGER\n\tXFRM_MODE_BEET\n\tXFRM_MODE_MAX\n)\n\nfunc (m Mode) String() string {\n\tswitch m {\n\tcase XFRM_MODE_TRANSPORT:\n\t\treturn \"transport\"\n\tcase XFRM_MODE_TUNNEL:\n\t\treturn \"tunnel\"\n\tcase XFRM_MODE_ROUTEOPTIMIZATION:\n\t\treturn \"ro\"\n\tcase XFRM_MODE_IN_TRIGGER:\n\t\treturn \"in_trigger\"\n\tcase XFRM_MODE_BEET:\n\t\treturn \"beet\"\n\t}\n\treturn fmt.Sprintf(\"%d\", m)\n}\n\n// XfrmMark represents the mark associated to the state or policy\ntype XfrmMark struct {\n\tValue uint32\n\tMask uint32\n}\n\nfunc (m *XfrmMark) String() string {\n\treturn fmt.Sprintf(\"(0x%x,0x%x)\", m.Value, m.Mask)\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/xfrm_monitor_linux.go", "content": "package netlink\n\nimport (\n\t\"fmt\"\n\n\t\"github.com/vishvananda/netlink/nl\"\n\t\"github.com/vishvananda/netns\"\n\t\"golang.org/x/sys/unix\"\n)\n\ntype XfrmMsg interface {\n\tType() nl.XfrmMsgType\n}\n\ntype XfrmMsgExpire struct {\n\tXfrmState *XfrmState\n\tHard bool\n}\n\nfunc (ue *XfrmMsgExpire) Type() nl.XfrmMsgType {\n\treturn nl.XFRM_MSG_EXPIRE\n}\n\nfunc parseXfrmMsgExpire(b []byte) *XfrmMsgExpire {\n\tvar e XfrmMsgExpire\n\n\tmsg := nl.DeserializeXfrmUserExpire(b)\n\te.XfrmState = xfrmStateFromXfrmUsersaInfo(&msg.XfrmUsersaInfo)\n\te.Hard = msg.Hard == 1\n\n\treturn &e\n}\n\nfunc XfrmMonitor(ch chan<- XfrmMsg, done <-chan struct{}, errorChan chan<- error,\n\ttypes ...nl.XfrmMsgType) error {\n\n\tgroups, err := xfrmMcastGroups(types)\n\tif err != nil {\n\t\treturn nil\n\t}\n\ts, err := nl.SubscribeAt(netns.None(), netns.None(), unix.NETLINK_XFRM, groups...)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\tif done != nil {\n\t\tgo func() {\n\t\t\t<-done\n\t\t\ts.Close()\n\t\t}()\n\n\t}\n\n\tgo func() {\n\t\tdefer close(ch)\n\t\tfor {\n\t\t\tmsgs, from, err := s.Receive()\n\t\t\tif err != nil {\n\t\t\t\terrorChan <- err\n\t\t\t\treturn\n\t\t\t}\n\t\t\tif from.Pid != nl.PidKernel {\n\t\t\t\terrorChan <- fmt.Errorf(\"Wrong sender portid %d, expected %d\", from.Pid, nl.PidKernel)\n\t\t\t\treturn\n\t\t\t}\n\t\t\tfor _, m := range msgs {\n\t\t\t\tswitch m.Header.Type {\n\t\t\t\tcase nl.XFRM_MSG_EXPIRE:\n\t\t\t\t\tch <- parseXfrmMsgExpire(m.Data)\n\t\t\t\tdefault:\n\t\t\t\t\terrorChan <- fmt.Errorf(\"unsupported msg type: %x\", m.Header.Type)\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}()\n\n\treturn nil\n}\n\nfunc xfrmMcastGroups(types []nl.XfrmMsgType) ([]uint, error) {\n\tgroups := make([]uint, 0)\n\n\tif len(types) == 0 {\n\t\treturn nil, fmt.Errorf(\"no xfrm msg type specified\")\n\t}\n\n\tfor _, t := range types {\n\t\tvar group uint\n\n\t\tswitch t {\n\t\tcase nl.XFRM_MSG_EXPIRE:\n\t\t\tgroup = nl.XFRMNLGRP_EXPIRE\n\t\tdefault:\n\t\t\treturn nil, fmt.Errorf(\"unsupported group: %x\", t)\n\t\t}\n\n\t\tgroups = append(groups, group)\n\t}\n\n\treturn groups, nil\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/xfrm_policy.go", "content": "package netlink\n\nimport (\n\t\"fmt\"\n\t\"net\"\n)\n\n// Dir is an enum representing an ipsec template direction.\ntype Dir uint8\n\nconst (\n\tXFRM_DIR_IN Dir = iota\n\tXFRM_DIR_OUT\n\tXFRM_DIR_FWD\n\tXFRM_SOCKET_IN\n\tXFRM_SOCKET_OUT\n\tXFRM_SOCKET_FWD\n)\n\nfunc (d Dir) String() string {\n\tswitch d {\n\tcase XFRM_DIR_IN:\n\t\treturn \"dir in\"\n\tcase XFRM_DIR_OUT:\n\t\treturn \"dir out\"\n\tcase XFRM_DIR_FWD:\n\t\treturn \"dir fwd\"\n\tcase XFRM_SOCKET_IN:\n\t\treturn \"socket in\"\n\tcase XFRM_SOCKET_OUT:\n\t\treturn \"socket out\"\n\tcase XFRM_SOCKET_FWD:\n\t\treturn \"socket fwd\"\n\t}\n\treturn fmt.Sprintf(\"socket %d\", d-XFRM_SOCKET_IN)\n}\n\n// PolicyAction is an enum representing an ipsec policy action.\ntype PolicyAction uint8\n\nconst (\n\tXFRM_POLICY_ALLOW PolicyAction = 0\n\tXFRM_POLICY_BLOCK PolicyAction = 1\n)\n\nfunc (a PolicyAction) String() string {\n\tswitch a {\n\tcase XFRM_POLICY_ALLOW:\n\t\treturn \"allow\"\n\tcase XFRM_POLICY_BLOCK:\n\t\treturn \"block\"\n\tdefault:\n\t\treturn fmt.Sprintf(\"action %d\", a)\n\t}\n}\n\n// XfrmPolicyTmpl encapsulates a rule for the base addresses of an ipsec\n// policy. These rules are matched with XfrmState to determine encryption\n// and authentication algorithms.\ntype XfrmPolicyTmpl struct {\n\tDst net.IP\n\tSrc net.IP\n\tProto Proto\n\tMode Mode\n\tSpi int\n\tReqid int\n\tOptional int\n}\n\nfunc (t XfrmPolicyTmpl) String() string {\n\treturn fmt.Sprintf(\"{Dst: %v, Src: %v, Proto: %s, Mode: %s, Spi: 0x%x, Reqid: 0x%x}\",\n\t\tt.Dst, t.Src, t.Proto, t.Mode, t.Spi, t.Reqid)\n}\n\n// XfrmPolicy represents an ipsec policy. It represents the overlay network\n// and has a list of XfrmPolicyTmpls representing the base addresses of\n// the policy.\ntype XfrmPolicy struct {\n\tDst *net.IPNet\n\tSrc *net.IPNet\n\tProto Proto\n\tDstPort int\n\tSrcPort int\n\tDir Dir\n\tPriority int\n\tIndex int\n\tAction PolicyAction\n\tIfindex int\n\tIfid int\n\tMark *XfrmMark\n\tTmpls []XfrmPolicyTmpl\n}\n\nfunc (p XfrmPolicy) String() string {\n\treturn fmt.Sprintf(\"{Dst: %v, Src: %v, Proto: %s, DstPort: %d, SrcPort: %d, Dir: %s, Priority: %d, Index: %d, Action: %s, Ifindex: %d, Ifid: %d, Mark: %s, Tmpls: %s}\",\n\t\tp.Dst, p.Src, p.Proto, p.DstPort, p.SrcPort, p.Dir, p.Priority, p.Index, p.Action, p.Ifindex, p.Ifid, p.Mark, p.Tmpls)\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/xfrm_policy_linux.go", "content": "package netlink\n\nimport (\n\t\"github.com/vishvananda/netlink/nl\"\n\t\"golang.org/x/sys/unix\"\n)\n\nfunc selFromPolicy(sel *nl.XfrmSelector, policy *XfrmPolicy) {\n\tsel.Family = uint16(nl.FAMILY_V4)\n\tif policy.Dst != nil {\n\t\tsel.Family = uint16(nl.GetIPFamily(policy.Dst.IP))\n\t\tsel.Daddr.FromIP(policy.Dst.IP)\n\t\tprefixlenD, _ := policy.Dst.Mask.Size()\n\t\tsel.PrefixlenD = uint8(prefixlenD)\n\t}\n\tif policy.Src != nil {\n\t\tsel.Saddr.FromIP(policy.Src.IP)\n\t\tprefixlenS, _ := policy.Src.Mask.Size()\n\t\tsel.PrefixlenS = uint8(prefixlenS)\n\t}\n\tsel.Proto = uint8(policy.Proto)\n\tsel.Dport = nl.Swap16(uint16(policy.DstPort))\n\tsel.Sport = nl.Swap16(uint16(policy.SrcPort))\n\tif sel.Dport != 0 {\n\t\tsel.DportMask = ^uint16(0)\n\t}\n\tif sel.Sport != 0 {\n\t\tsel.SportMask = ^uint16(0)\n\t}\n\tsel.Ifindex = int32(policy.Ifindex)\n}\n\n// XfrmPolicyAdd will add an xfrm policy to the system.\n// Equivalent to: `ip xfrm policy add $policy`\nfunc XfrmPolicyAdd(policy *XfrmPolicy) error {\n\treturn pkgHandle.XfrmPolicyAdd(policy)\n}\n\n// XfrmPolicyAdd will add an xfrm policy to the system.\n// Equivalent to: `ip xfrm policy add $policy`\nfunc (h *Handle) XfrmPolicyAdd(policy *XfrmPolicy) error {\n\treturn h.xfrmPolicyAddOrUpdate(policy, nl.XFRM_MSG_NEWPOLICY)\n}\n\n// XfrmPolicyUpdate will update an xfrm policy to the system.\n// Equivalent to: `ip xfrm policy update $policy`\nfunc XfrmPolicyUpdate(policy *XfrmPolicy) error {\n\treturn pkgHandle.XfrmPolicyUpdate(policy)\n}\n\n// XfrmPolicyUpdate will update an xfrm policy to the system.\n// Equivalent to: `ip xfrm policy update $policy`\nfunc (h *Handle) XfrmPolicyUpdate(policy *XfrmPolicy) error {\n\treturn h.xfrmPolicyAddOrUpdate(policy, nl.XFRM_MSG_UPDPOLICY)\n}\n\nfunc (h *Handle) xfrmPolicyAddOrUpdate(policy *XfrmPolicy, nlProto int) error {\n\treq := h.newNetlinkRequest(nlProto, unix.NLM_F_CREATE|unix.NLM_F_EXCL|unix.NLM_F_ACK)\n\n\tmsg := &nl.XfrmUserpolicyInfo{}\n\tselFromPolicy(&msg.Sel, policy)\n\tmsg.Priority = uint32(policy.Priority)\n\tmsg.Index = uint32(policy.Index)\n\tmsg.Dir = uint8(policy.Dir)\n\tmsg.Action = uint8(policy.Action)\n\tmsg.Lft.SoftByteLimit = nl.XFRM_INF\n\tmsg.Lft.HardByteLimit = nl.XFRM_INF\n\tmsg.Lft.SoftPacketLimit = nl.XFRM_INF\n\tmsg.Lft.HardPacketLimit = nl.XFRM_INF\n\treq.AddData(msg)\n\n\ttmplData := make([]byte, nl.SizeofXfrmUserTmpl*len(policy.Tmpls))\n\tfor i, tmpl := range policy.Tmpls {\n\t\tstart := i * nl.SizeofXfrmUserTmpl\n\t\tuserTmpl := nl.DeserializeXfrmUserTmpl(tmplData[start : start+nl.SizeofXfrmUserTmpl])\n\t\tuserTmpl.XfrmId.Daddr.FromIP(tmpl.Dst)\n\t\tuserTmpl.Saddr.FromIP(tmpl.Src)\n\t\tuserTmpl.XfrmId.Proto = uint8(tmpl.Proto)\n\t\tuserTmpl.XfrmId.Spi = nl.Swap32(uint32(tmpl.Spi))\n\t\tuserTmpl.Mode = uint8(tmpl.Mode)\n\t\tuserTmpl.Reqid = uint32(tmpl.Reqid)\n\t\tuserTmpl.Optional = uint8(tmpl.Optional)\n\t\tuserTmpl.Aalgos = ^uint32(0)\n\t\tuserTmpl.Ealgos = ^uint32(0)\n\t\tuserTmpl.Calgos = ^uint32(0)\n\t}\n\tif len(tmplData) > 0 {\n\t\ttmpls := nl.NewRtAttr(nl.XFRMA_TMPL, tmplData)\n\t\treq.AddData(tmpls)\n\t}\n\tif policy.Mark != nil {\n\t\tout := nl.NewRtAttr(nl.XFRMA_MARK, writeMark(policy.Mark))\n\t\treq.AddData(out)\n\t}\n\n\tifId := nl.NewRtAttr(nl.XFRMA_IF_ID, nl.Uint32Attr(uint32(policy.Ifid)))\n\treq.AddData(ifId)\n\n\t_, err := req.Execute(unix.NETLINK_XFRM, 0)\n\treturn err\n}\n\n// XfrmPolicyDel will delete an xfrm policy from the system. Note that\n// the Tmpls are ignored when matching the policy to delete.\n// Equivalent to: `ip xfrm policy del $policy`\nfunc XfrmPolicyDel(policy *XfrmPolicy) error {\n\treturn pkgHandle.XfrmPolicyDel(policy)\n}\n\n// XfrmPolicyDel will delete an xfrm policy from the system. Note that\n// the Tmpls are ignored when matching the policy to delete.\n// Equivalent to: `ip xfrm policy del $policy`\nfunc (h *Handle) XfrmPolicyDel(policy *XfrmPolicy) error {\n\t_, err := h.xfrmPolicyGetOrDelete(policy, nl.XFRM_MSG_DELPOLICY)\n\treturn err\n}\n\n// XfrmPolicyList gets a list of xfrm policies in the system.\n// Equivalent to: `ip xfrm policy show`.\n// The list can be filtered by ip family.\nfunc XfrmPolicyList(family int) ([]XfrmPolicy, error) {\n\treturn pkgHandle.XfrmPolicyList(family)\n}\n\n// XfrmPolicyList gets a list of xfrm policies in the system.\n// Equivalent to: `ip xfrm policy show`.\n// The list can be filtered by ip family.\nfunc (h *Handle) XfrmPolicyList(family int) ([]XfrmPolicy, error) {\n\treq := h.newNetlinkRequest(nl.XFRM_MSG_GETPOLICY, unix.NLM_F_DUMP)\n\n\tmsg := nl.NewIfInfomsg(family)\n\treq.AddData(msg)\n\n\tmsgs, err := req.Execute(unix.NETLINK_XFRM, nl.XFRM_MSG_NEWPOLICY)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tvar res []XfrmPolicy\n\tfor _, m := range msgs {\n\t\tif policy, err := parseXfrmPolicy(m, family); err == nil {\n\t\t\tres = append(res, *policy)\n\t\t} else if err == familyError {\n\t\t\tcontinue\n\t\t} else {\n\t\t\treturn nil, err\n\t\t}\n\t}\n\treturn res, nil\n}\n\n// XfrmPolicyGet gets a the policy described by the index or selector, if found.\n// Equivalent to: `ip xfrm policy get { SELECTOR | index INDEX } dir DIR [ctx CTX ] [ mark MARK [ mask MASK ] ] [ ptype PTYPE ]`.\nfunc XfrmPolicyGet(policy *XfrmPolicy) (*XfrmPolicy, error) {\n\treturn pkgHandle.XfrmPolicyGet(policy)\n}\n\n// XfrmPolicyGet gets a the policy described by the index or selector, if found.\n// Equivalent to: `ip xfrm policy get { SELECTOR | index INDEX } dir DIR [ctx CTX ] [ mark MARK [ mask MASK ] ] [ ptype PTYPE ]`.\nfunc (h *Handle) XfrmPolicyGet(policy *XfrmPolicy) (*XfrmPolicy, error) {\n\treturn h.xfrmPolicyGetOrDelete(policy, nl.XFRM_MSG_GETPOLICY)\n}\n\n// XfrmPolicyFlush will flush the policies on the system.\n// Equivalent to: `ip xfrm policy flush`\nfunc XfrmPolicyFlush() error {\n\treturn pkgHandle.XfrmPolicyFlush()\n}\n\n// XfrmPolicyFlush will flush the policies on the system.\n// Equivalent to: `ip xfrm policy flush`\nfunc (h *Handle) XfrmPolicyFlush() error {\n\treq := h.newNetlinkRequest(nl.XFRM_MSG_FLUSHPOLICY, unix.NLM_F_ACK)\n\t_, err := req.Execute(unix.NETLINK_XFRM, 0)\n\treturn err\n}\n\nfunc (h *Handle) xfrmPolicyGetOrDelete(policy *XfrmPolicy, nlProto int) (*XfrmPolicy, error) {\n\treq := h.newNetlinkRequest(nlProto, unix.NLM_F_ACK)\n\n\tmsg := &nl.XfrmUserpolicyId{}\n\tselFromPolicy(&msg.Sel, policy)\n\tmsg.Index = uint32(policy.Index)\n\tmsg.Dir = uint8(policy.Dir)\n\treq.AddData(msg)\n\n\tif policy.Mark != nil {\n\t\tout := nl.NewRtAttr(nl.XFRMA_MARK, writeMark(policy.Mark))\n\t\treq.AddData(out)\n\t}\n\n\tifId := nl.NewRtAttr(nl.XFRMA_IF_ID, nl.Uint32Attr(uint32(policy.Ifid)))\n\treq.AddData(ifId)\n\n\tresType := nl.XFRM_MSG_NEWPOLICY\n\tif nlProto == nl.XFRM_MSG_DELPOLICY {\n\t\tresType = 0\n\t}\n\n\tmsgs, err := req.Execute(unix.NETLINK_XFRM, uint16(resType))\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tif nlProto == nl.XFRM_MSG_DELPOLICY {\n\t\treturn nil, err\n\t}\n\n\treturn parseXfrmPolicy(msgs[0], FAMILY_ALL)\n}\n\nfunc parseXfrmPolicy(m []byte, family int) (*XfrmPolicy, error) {\n\tmsg := nl.DeserializeXfrmUserpolicyInfo(m)\n\n\t// This is mainly for the policy dump\n\tif family != FAMILY_ALL && family != int(msg.Sel.Family) {\n\t\treturn nil, familyError\n\t}\n\n\tvar policy XfrmPolicy\n\n\tpolicy.Dst = msg.Sel.Daddr.ToIPNet(msg.Sel.PrefixlenD)\n\tpolicy.Src = msg.Sel.Saddr.ToIPNet(msg.Sel.PrefixlenS)\n\tpolicy.Proto = Proto(msg.Sel.Proto)\n\tpolicy.DstPort = int(nl.Swap16(msg.Sel.Dport))\n\tpolicy.SrcPort = int(nl.Swap16(msg.Sel.Sport))\n\tpolicy.Ifindex = int(msg.Sel.Ifindex)\n\tpolicy.Priority = int(msg.Priority)\n\tpolicy.Index = int(msg.Index)\n\tpolicy.Dir = Dir(msg.Dir)\n\tpolicy.Action = PolicyAction(msg.Action)\n\n\tattrs, err := nl.ParseRouteAttr(m[msg.Len():])\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tfor _, attr := range attrs {\n\t\tswitch attr.Attr.Type {\n\t\tcase nl.XFRMA_TMPL:\n\t\t\tmax := len(attr.Value)\n\t\t\tfor i := 0; i < max; i += nl.SizeofXfrmUserTmpl {\n\t\t\t\tvar resTmpl XfrmPolicyTmpl\n\t\t\t\ttmpl := nl.DeserializeXfrmUserTmpl(attr.Value[i : i+nl.SizeofXfrmUserTmpl])\n\t\t\t\tresTmpl.Dst = tmpl.XfrmId.Daddr.ToIP()\n\t\t\t\tresTmpl.Src = tmpl.Saddr.ToIP()\n\t\t\t\tresTmpl.Proto = Proto(tmpl.XfrmId.Proto)\n\t\t\t\tresTmpl.Mode = Mode(tmpl.Mode)\n\t\t\t\tresTmpl.Spi = int(nl.Swap32(tmpl.XfrmId.Spi))\n\t\t\t\tresTmpl.Reqid = int(tmpl.Reqid)\n\t\t\t\tresTmpl.Optional = int(tmpl.Optional)\n\t\t\t\tpolicy.Tmpls = append(policy.Tmpls, resTmpl)\n\t\t\t}\n\t\tcase nl.XFRMA_MARK:\n\t\t\tmark := nl.DeserializeXfrmMark(attr.Value[:])\n\t\t\tpolicy.Mark = new(XfrmMark)\n\t\t\tpolicy.Mark.Value = mark.Value\n\t\t\tpolicy.Mark.Mask = mark.Mask\n\t\tcase nl.XFRMA_IF_ID:\n\t\t\tpolicy.Ifid = int(native.Uint32(attr.Value))\n\t\t}\n\t}\n\n\treturn &policy, nil\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/xfrm_state.go", "content": "package netlink\n\nimport (\n\t\"fmt\"\n\t\"net\"\n\t\"time\"\n)\n\n// XfrmStateAlgo represents the algorithm to use for the ipsec encryption.\ntype XfrmStateAlgo struct {\n\tName string\n\tKey []byte\n\tTruncateLen int // Auth only\n\tICVLen int // AEAD only\n}\n\nfunc (a XfrmStateAlgo) String() string {\n\tbase := fmt.Sprintf(\"{Name: %s, Key: 0x%x\", a.Name, a.Key)\n\tif a.TruncateLen != 0 {\n\t\tbase = fmt.Sprintf(\"%s, Truncate length: %d\", base, a.TruncateLen)\n\t}\n\tif a.ICVLen != 0 {\n\t\tbase = fmt.Sprintf(\"%s, ICV length: %d\", base, a.ICVLen)\n\t}\n\treturn fmt.Sprintf(\"%s}\", base)\n}\n\n// EncapType is an enum representing the optional packet encapsulation.\ntype EncapType uint8\n\nconst (\n\tXFRM_ENCAP_ESPINUDP_NONIKE EncapType = iota + 1\n\tXFRM_ENCAP_ESPINUDP\n)\n\nfunc (e EncapType) String() string {\n\tswitch e {\n\tcase XFRM_ENCAP_ESPINUDP_NONIKE:\n\t\treturn \"espinudp-non-ike\"\n\tcase XFRM_ENCAP_ESPINUDP:\n\t\treturn \"espinudp\"\n\t}\n\treturn \"unknown\"\n}\n\n// XfrmStateEncap represents the encapsulation to use for the ipsec encryption.\ntype XfrmStateEncap struct {\n\tType EncapType\n\tSrcPort int\n\tDstPort int\n\tOriginalAddress net.IP\n}\n\nfunc (e XfrmStateEncap) String() string {\n\treturn fmt.Sprintf(\"{Type: %s, Srcport: %d, DstPort: %d, OriginalAddress: %v}\",\n\t\te.Type, e.SrcPort, e.DstPort, e.OriginalAddress)\n}\n\n// XfrmStateLimits represents the configured limits for the state.\ntype XfrmStateLimits struct {\n\tByteSoft uint64\n\tByteHard uint64\n\tPacketSoft uint64\n\tPacketHard uint64\n\tTimeSoft uint64\n\tTimeHard uint64\n\tTimeUseSoft uint64\n\tTimeUseHard uint64\n}\n\n// XfrmStateStats represents the current number of bytes/packets\n// processed by this State, the State's installation and first use\n// time and the replay window counters.\ntype XfrmStateStats struct {\n\tReplayWindow uint32\n\tReplay uint32\n\tFailed uint32\n\tBytes uint64\n\tPackets uint64\n\tAddTime uint64\n\tUseTime uint64\n}\n\n// XfrmState represents the state of an ipsec policy. It optionally\n// contains an XfrmStateAlgo for encryption and one for authentication.\ntype XfrmState struct {\n\tDst net.IP\n\tSrc net.IP\n\tProto Proto\n\tMode Mode\n\tSpi int\n\tReqid int\n\tReplayWindow int\n\tLimits XfrmStateLimits\n\tStatistics XfrmStateStats\n\tMark *XfrmMark\n\tOutputMark *XfrmMark\n\tIfid int\n\tAuth *XfrmStateAlgo\n\tCrypt *XfrmStateAlgo\n\tAead *XfrmStateAlgo\n\tEncap *XfrmStateEncap\n\tESN bool\n}\n\nfunc (sa XfrmState) String() string {\n\treturn fmt.Sprintf(\"Dst: %v, Src: %v, Proto: %s, Mode: %s, SPI: 0x%x, ReqID: 0x%x, ReplayWindow: %d, Mark: %v, OutputMark: %v, Ifid: %d, Auth: %v, Crypt: %v, Aead: %v, Encap: %v, ESN: %t\",\n\t\tsa.Dst, sa.Src, sa.Proto, sa.Mode, sa.Spi, sa.Reqid, sa.ReplayWindow, sa.Mark, sa.OutputMark, sa.Ifid, sa.Auth, sa.Crypt, sa.Aead, sa.Encap, sa.ESN)\n}\nfunc (sa XfrmState) Print(stats bool) string {\n\tif !stats {\n\t\treturn sa.String()\n\t}\n\tat := time.Unix(int64(sa.Statistics.AddTime), 0).Format(time.UnixDate)\n\tut := \"-\"\n\tif sa.Statistics.UseTime > 0 {\n\t\tut = time.Unix(int64(sa.Statistics.UseTime), 0).Format(time.UnixDate)\n\t}\n\treturn fmt.Sprintf(\"%s, ByteSoft: %s, ByteHard: %s, PacketSoft: %s, PacketHard: %s, TimeSoft: %d, TimeHard: %d, TimeUseSoft: %d, TimeUseHard: %d, Bytes: %d, Packets: %d, \"+\n\t\t\"AddTime: %s, UseTime: %s, ReplayWindow: %d, Replay: %d, Failed: %d\",\n\t\tsa.String(), printLimit(sa.Limits.ByteSoft), printLimit(sa.Limits.ByteHard), printLimit(sa.Limits.PacketSoft), printLimit(sa.Limits.PacketHard),\n\t\tsa.Limits.TimeSoft, sa.Limits.TimeHard, sa.Limits.TimeUseSoft, sa.Limits.TimeUseHard, sa.Statistics.Bytes, sa.Statistics.Packets, at, ut,\n\t\tsa.Statistics.ReplayWindow, sa.Statistics.Replay, sa.Statistics.Failed)\n}\n\nfunc printLimit(lmt uint64) string {\n\tif lmt == ^uint64(0) {\n\t\treturn \"(INF)\"\n\t}\n\treturn fmt.Sprintf(\"%d\", lmt)\n}\n" }, { "path": "vendor/github.com/vishvananda/netlink/xfrm_state_linux.go", "content": "package netlink\n\nimport (\n\t\"fmt\"\n\t\"unsafe\"\n\n\t\"github.com/vishvananda/netlink/nl\"\n\t\"golang.org/x/sys/unix\"\n)\n\nfunc writeStateAlgo(a *XfrmStateAlgo) []byte {\n\talgo := nl.XfrmAlgo{\n\t\tAlgKeyLen: uint32(len(a.Key) * 8),\n\t\tAlgKey: a.Key,\n\t}\n\tend := len(a.Name)\n\tif end > 64 {\n\t\tend = 64\n\t}\n\tcopy(algo.AlgName[:end], a.Name)\n\treturn algo.Serialize()\n}\n\nfunc writeStateAlgoAuth(a *XfrmStateAlgo) []byte {\n\talgo := nl.XfrmAlgoAuth{\n\t\tAlgKeyLen: uint32(len(a.Key) * 8),\n\t\tAlgTruncLen: uint32(a.TruncateLen),\n\t\tAlgKey: a.Key,\n\t}\n\tend := len(a.Name)\n\tif end > 64 {\n\t\tend = 64\n\t}\n\tcopy(algo.AlgName[:end], a.Name)\n\treturn algo.Serialize()\n}\n\nfunc writeStateAlgoAead(a *XfrmStateAlgo) []byte {\n\talgo := nl.XfrmAlgoAEAD{\n\t\tAlgKeyLen: uint32(len(a.Key) * 8),\n\t\tAlgICVLen: uint32(a.ICVLen),\n\t\tAlgKey: a.Key,\n\t}\n\tend := len(a.Name)\n\tif end > 64 {\n\t\tend = 64\n\t}\n\tcopy(algo.AlgName[:end], a.Name)\n\treturn algo.Serialize()\n}\n\nfunc writeMark(m *XfrmMark) []byte {\n\tmark := &nl.XfrmMark{\n\t\tValue: m.Value,\n\t\tMask: m.Mask,\n\t}\n\tif mark.Mask == 0 {\n\t\tmark.Mask = ^uint32(0)\n\t}\n\treturn mark.Serialize()\n}\n\nfunc writeReplayEsn(replayWindow int) []byte {\n\treplayEsn := &nl.XfrmReplayStateEsn{\n\t\tOSeq: 0,\n\t\tSeq: 0,\n\t\tOSeqHi: 0,\n\t\tSeqHi: 0,\n\t\tReplayWindow: uint32(replayWindow),\n\t}\n\n\t// Linux stores the bitmap to identify the already received sequence packets in blocks of uint32 elements.\n\t// Therefore bitmap length is the minimum number of uint32 elements needed. The following is a ceiling operation.\n\tbytesPerElem := int(unsafe.Sizeof(replayEsn.BmpLen)) // Any uint32 variable is good for this\n\treplayEsn.BmpLen = uint32((replayWindow + (bytesPerElem * 8) - 1) / (bytesPerElem * 8))\n\n\treturn replayEsn.Serialize()\n}\n\n// XfrmStateAdd will add an xfrm state to the system.\n// Equivalent to: `ip xfrm state add $state`\nfunc XfrmStateAdd(state *XfrmState) error {\n\treturn pkgHandle.XfrmStateAdd(state)\n}\n\n// XfrmStateAdd will add an xfrm state to the system.\n// Equivalent to: `ip xfrm state add $state`\nfunc (h *Handle) XfrmStateAdd(state *XfrmState) error {\n\treturn h.xfrmStateAddOrUpdate(state, nl.XFRM_MSG_NEWSA)\n}\n\n// XfrmStateAllocSpi will allocate an xfrm state in the system.\n// Equivalent to: `ip xfrm state allocspi`\nfunc XfrmStateAllocSpi(state *XfrmState) (*XfrmState, error) {\n\treturn pkgHandle.xfrmStateAllocSpi(state)\n}\n\n// XfrmStateUpdate will update an xfrm state to the system.\n// Equivalent to: `ip xfrm state update $state`\nfunc XfrmStateUpdate(state *XfrmState) error {\n\treturn pkgHandle.XfrmStateUpdate(state)\n}\n\n// XfrmStateUpdate will update an xfrm state to the system.\n// Equivalent to: `ip xfrm state update $state`\nfunc (h *Handle) XfrmStateUpdate(state *XfrmState) error {\n\treturn h.xfrmStateAddOrUpdate(state, nl.XFRM_MSG_UPDSA)\n}\n\nfunc (h *Handle) xfrmStateAddOrUpdate(state *XfrmState, nlProto int) error {\n\n\t// A state with spi 0 can't be deleted so don't allow it to be set\n\tif state.Spi == 0 {\n\t\treturn fmt.Errorf(\"Spi must be set when adding xfrm state.\")\n\t}\n\treq := h.newNetlinkRequest(nlProto, unix.NLM_F_CREATE|unix.NLM_F_EXCL|unix.NLM_F_ACK)\n\n\tmsg := xfrmUsersaInfoFromXfrmState(state)\n\n\tif state.ESN {\n\t\tif state.ReplayWindow == 0 {\n\t\t\treturn fmt.Errorf(\"ESN flag set without ReplayWindow\")\n\t\t}\n\t\tmsg.Flags |= nl.XFRM_STATE_ESN\n\t\tmsg.ReplayWindow = 0\n\t}\n\n\tlimitsToLft(state.Limits, &msg.Lft)\n\treq.AddData(msg)\n\n\tif state.Auth != nil {\n\t\tout := nl.NewRtAttr(nl.XFRMA_ALG_AUTH_TRUNC, writeStateAlgoAuth(state.Auth))\n\t\treq.AddData(out)\n\t}\n\tif state.Crypt != nil {\n\t\tout := nl.NewRtAttr(nl.XFRMA_ALG_CRYPT, writeStateAlgo(state.Crypt))\n\t\treq.AddData(out)\n\t}\n\tif state.Aead != nil {\n\t\tout := nl.NewRtAttr(nl.XFRMA_ALG_AEAD, writeStateAlgoAead(state.Aead))\n\t\treq.AddData(out)\n\t}\n\tif state.Encap != nil {\n\t\tencapData := make([]byte, nl.SizeofXfrmEncapTmpl)\n\t\tencap := nl.DeserializeXfrmEncapTmpl(encapData)\n\t\tencap.EncapType = uint16(state.Encap.Type)\n\t\tencap.EncapSport = nl.Swap16(uint16(state.Encap.SrcPort))\n\t\tencap.EncapDport = nl.Swap16(uint16(state.Encap.DstPort))\n\t\tencap.EncapOa.FromIP(state.Encap.OriginalAddress)\n\t\tout := nl.NewRtAttr(nl.XFRMA_ENCAP, encapData)\n\t\treq.AddData(out)\n\t}\n\tif state.Mark != nil {\n\t\tout := nl.NewRtAttr(nl.XFRMA_MARK, writeMark(state.Mark))\n\t\treq.AddData(out)\n\t}\n\tif state.ESN {\n\t\tout := nl.NewRtAttr(nl.XFRMA_REPLAY_ESN_VAL, writeReplayEsn(state.ReplayWindow))\n\t\treq.AddData(out)\n\t}\n\tif state.OutputMark != nil {\n\t\tout := nl.NewRtAttr(nl.XFRMA_SET_MARK, nl.Uint32Attr(state.OutputMark.Value))\n\t\treq.AddData(out)\n\t\tif state.OutputMark.Mask != 0 {\n\t\t\tout = nl.NewRtAttr(nl.XFRMA_SET_MARK_MASK, nl.Uint32Attr(state.OutputMark.Mask))\n\t\t\treq.AddData(out)\n\t\t}\n\t}\n\n\tifId := nl.NewRtAttr(nl.XFRMA_IF_ID, nl.Uint32Attr(uint32(state.Ifid)))\n\treq.AddData(ifId)\n\n\t_, err := req.Execute(unix.NETLINK_XFRM, 0)\n\treturn err\n}\n\nfunc (h *Handle) xfrmStateAllocSpi(state *XfrmState) (*XfrmState, error) {\n\treq := h.newNetlinkRequest(nl.XFRM_MSG_ALLOCSPI,\n\t\tunix.NLM_F_CREATE|unix.NLM_F_EXCL|unix.NLM_F_ACK)\n\n\tmsg := &nl.XfrmUserSpiInfo{}\n\tmsg.XfrmUsersaInfo = *(xfrmUsersaInfoFromXfrmState(state))\n\t// 1-255 is reserved by IANA for future use\n\tmsg.Min = 0x100\n\tmsg.Max = 0xffffffff\n\treq.AddData(msg)\n\n\tif state.Mark != nil {\n\t\tout := nl.NewRtAttr(nl.XFRMA_MARK, writeMark(state.Mark))\n\t\treq.AddData(out)\n\t}\n\n\tmsgs, err := req.Execute(unix.NETLINK_XFRM, 0)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\treturn parseXfrmState(msgs[0], FAMILY_ALL)\n}\n\n// XfrmStateDel will delete an xfrm state from the system. Note that\n// the Algos are ignored when matching the state to delete.\n// Equivalent to: `ip xfrm state del $state`\nfunc XfrmStateDel(state *XfrmState) error {\n\treturn pkgHandle.XfrmStateDel(state)\n}\n\n// XfrmStateDel will delete an xfrm state from the system. Note that\n// the Algos are ignored when matching the state to delete.\n// Equivalent to: `ip xfrm state del $state`\nfunc (h *Handle) XfrmStateDel(state *XfrmState) error {\n\t_, err := h.xfrmStateGetOrDelete(state, nl.XFRM_MSG_DELSA)\n\treturn err\n}\n\n// XfrmStateList gets a list of xfrm states in the system.\n// Equivalent to: `ip [-4|-6] xfrm state show`.\n// The list can be filtered by ip family.\nfunc XfrmStateList(family int) ([]XfrmState, error) {\n\treturn pkgHandle.XfrmStateList(family)\n}\n\n// XfrmStateList gets a list of xfrm states in the system.\n// Equivalent to: `ip xfrm state show`.\n// The list can be filtered by ip family.\nfunc (h *Handle) XfrmStateList(family int) ([]XfrmState, error) {\n\treq := h.newNetlinkRequest(nl.XFRM_MSG_GETSA, unix.NLM_F_DUMP)\n\n\tmsgs, err := req.Execute(unix.NETLINK_XFRM, nl.XFRM_MSG_NEWSA)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tvar res []XfrmState\n\tfor _, m := range msgs {\n\t\tif state, err := parseXfrmState(m, family); err == nil {\n\t\t\tres = append(res, *state)\n\t\t} else if err == familyError {\n\t\t\tcontinue\n\t\t} else {\n\t\t\treturn nil, err\n\t\t}\n\t}\n\treturn res, nil\n}\n\n// XfrmStateGet gets the xfrm state described by the ID, if found.\n// Equivalent to: `ip xfrm state get ID [ mark MARK [ mask MASK ] ]`.\n// Only the fields which constitue the SA ID must be filled in:\n// ID := [ src ADDR ] [ dst ADDR ] [ proto XFRM-PROTO ] [ spi SPI ]\n// mark is optional\nfunc XfrmStateGet(state *XfrmState) (*XfrmState, error) {\n\treturn pkgHandle.XfrmStateGet(state)\n}\n\n// XfrmStateGet gets the xfrm state described by the ID, if found.\n// Equivalent to: `ip xfrm state get ID [ mark MARK [ mask MASK ] ]`.\n// Only the fields which constitue the SA ID must be filled in:\n// ID := [ src ADDR ] [ dst ADDR ] [ proto XFRM-PROTO ] [ spi SPI ]\n// mark is optional\nfunc (h *Handle) XfrmStateGet(state *XfrmState) (*XfrmState, error) {\n\treturn h.xfrmStateGetOrDelete(state, nl.XFRM_MSG_GETSA)\n}\n\nfunc (h *Handle) xfrmStateGetOrDelete(state *XfrmState, nlProto int) (*XfrmState, error) {\n\treq := h.newNetlinkRequest(nlProto, unix.NLM_F_ACK)\n\n\tmsg := &nl.XfrmUsersaId{}\n\tmsg.Family = uint16(nl.GetIPFamily(state.Dst))\n\tmsg.Daddr.FromIP(state.Dst)\n\tmsg.Proto = uint8(state.Proto)\n\tmsg.Spi = nl.Swap32(uint32(state.Spi))\n\treq.AddData(msg)\n\n\tif state.Mark != nil {\n\t\tout := nl.NewRtAttr(nl.XFRMA_MARK, writeMark(state.Mark))\n\t\treq.AddData(out)\n\t}\n\tif state.Src != nil {\n\t\tout := nl.NewRtAttr(nl.XFRMA_SRCADDR, state.Src.To16())\n\t\treq.AddData(out)\n\t}\n\n\tifId := nl.NewRtAttr(nl.XFRMA_IF_ID, nl.Uint32Attr(uint32(state.Ifid)))\n\treq.AddData(ifId)\n\n\tresType := nl.XFRM_MSG_NEWSA\n\tif nlProto == nl.XFRM_MSG_DELSA {\n\t\tresType = 0\n\t}\n\n\tmsgs, err := req.Execute(unix.NETLINK_XFRM, uint16(resType))\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tif nlProto == nl.XFRM_MSG_DELSA {\n\t\treturn nil, nil\n\t}\n\n\ts, err := parseXfrmState(msgs[0], FAMILY_ALL)\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\treturn s, nil\n}\n\nvar familyError = fmt.Errorf(\"family error\")\n\nfunc xfrmStateFromXfrmUsersaInfo(msg *nl.XfrmUsersaInfo) *XfrmState {\n\tvar state XfrmState\n\n\tstate.Dst = msg.Id.Daddr.ToIP()\n\tstate.Src = msg.Saddr.ToIP()\n\tstate.Proto = Proto(msg.Id.Proto)\n\tstate.Mode = Mode(msg.Mode)\n\tstate.Spi = int(nl.Swap32(msg.Id.Spi))\n\tstate.Reqid = int(msg.Reqid)\n\tstate.ReplayWindow = int(msg.ReplayWindow)\n\tlftToLimits(&msg.Lft, &state.Limits)\n\tcurToStats(&msg.Curlft, &msg.Stats, &state.Statistics)\n\n\treturn &state\n}\n\nfunc parseXfrmState(m []byte, family int) (*XfrmState, error) {\n\tmsg := nl.DeserializeXfrmUsersaInfo(m)\n\n\t// This is mainly for the state dump\n\tif family != FAMILY_ALL && family != int(msg.Family) {\n\t\treturn nil, familyError\n\t}\n\n\tstate := xfrmStateFromXfrmUsersaInfo(msg)\n\n\tattrs, err := nl.ParseRouteAttr(m[nl.SizeofXfrmUsersaInfo:])\n\tif err != nil {\n\t\treturn nil, err\n\t}\n\n\tfor _, attr := range attrs {\n\t\tswitch attr.Attr.Type {\n\t\tcase nl.XFRMA_ALG_AUTH, nl.XFRMA_ALG_CRYPT:\n\t\t\tvar resAlgo *XfrmStateAlgo\n\t\t\tif attr.Attr.Type == nl.XFRMA_ALG_AUTH {\n\t\t\t\tif state.Auth == nil {\n\t\t\t\t\tstate.Auth = new(XfrmStateAlgo)\n\t\t\t\t}\n\t\t\t\tresAlgo = state.Auth\n\t\t\t} else {\n\t\t\t\tstate.Crypt = new(XfrmStateAlgo)\n\t\t\t\tresAlgo = state.Crypt\n\t\t\t}\n\t\t\talgo := nl.DeserializeXfrmAlgo(attr.Value[:])\n\t\t\t(*resAlgo).Name = nl.BytesToString(algo.AlgName[:])\n\t\t\t(*resAlgo).Key = algo.AlgKey\n\t\tcase nl.XFRMA_ALG_AUTH_TRUNC:\n\t\t\tif state.Auth == nil {\n\t\t\t\tstate.Auth = new(XfrmStateAlgo)\n\t\t\t}\n\t\t\talgo := nl.DeserializeXfrmAlgoAuth(attr.Value[:])\n\t\t\tstate.Auth.Name = nl.BytesToString(algo.AlgName[:])\n\t\t\tstate.Auth.Key = algo.AlgKey\n\t\t\tstate.Auth.TruncateLen = int(algo.AlgTruncLen)\n\t\tcase nl.XFRMA_ALG_AEAD:\n\t\t\tstate.Aead = new(XfrmStateAlgo)\n\t\t\talgo := nl.DeserializeXfrmAlgoAEAD(attr.Value[:])\n\t\t\tstate.Aead.Name = nl.BytesToString(algo.AlgName[:])\n\t\t\tstate.Aead.Key = algo.AlgKey\n\t\t\tstate.Aead.ICVLen = int(algo.AlgICVLen)\n\t\tcase nl.XFRMA_ENCAP:\n\t\t\tencap := nl.DeserializeXfrmEncapTmpl(attr.Value[:])\n\t\t\tstate.Encap = new(XfrmStateEncap)\n\t\t\tstate.Encap.Type = EncapType(encap.EncapType)\n\t\t\tstate.Encap.SrcPort = int(nl.Swap16(encap.EncapSport))\n\t\t\tstate.Encap.DstPort = int(nl.Swap16(encap.EncapDport))\n\t\t\tstate.Encap.OriginalAddress = encap.EncapOa.ToIP()\n\t\tcase nl.XFRMA_MARK:\n\t\t\tmark := nl.DeserializeXfrmMark(attr.Value[:])\n\t\t\tstate.Mark = new(XfrmMark)\n\t\t\tstate.Mark.Value = mark.Value\n\t\t\tstate.Mark.Mask = mark.Mask\n\t\tcase nl.XFRMA_SET_MARK:\n\t\t\tif state.OutputMark == nil {\n\t\t\t\tstate.OutputMark = new(XfrmMark)\n\t\t\t}\n\t\t\tstate.OutputMark.Value = native.Uint32(attr.Value)\n\t\tcase nl.XFRMA_SET_MARK_MASK:\n\t\t\tif state.OutputMark == nil {\n\t\t\t\tstate.OutputMark = new(XfrmMark)\n\t\t\t}\n\t\t\tstate.OutputMark.Mask = native.Uint32(attr.Value)\n\t\t\tif state.OutputMark.Mask == 0xffffffff {\n\t\t\t\tstate.OutputMark.Mask = 0\n\t\t\t}\n\t\tcase nl.XFRMA_IF_ID:\n\t\t\tstate.Ifid = int(native.Uint32(attr.Value))\n\t\t}\n\t}\n\n\treturn state, nil\n}\n\n// XfrmStateFlush will flush the xfrm state on the system.\n// proto = 0 means any transformation protocols\n// Equivalent to: `ip xfrm state flush [ proto XFRM-PROTO ]`\nfunc XfrmStateFlush(proto Proto) error {\n\treturn pkgHandle.XfrmStateFlush(proto)\n}\n\n// XfrmStateFlush will flush the xfrm state on the system.\n// proto = 0 means any transformation protocols\n// Equivalent to: `ip xfrm state flush [ proto XFRM-PROTO ]`\nfunc (h *Handle) XfrmStateFlush(proto Proto) error {\n\treq := h.newNetlinkRequest(nl.XFRM_MSG_FLUSHSA, unix.NLM_F_ACK)\n\n\treq.AddData(&nl.XfrmUsersaFlush{Proto: uint8(proto)})\n\n\t_, err := req.Execute(unix.NETLINK_XFRM, 0)\n\treturn err\n}\n\nfunc limitsToLft(lmts XfrmStateLimits, lft *nl.XfrmLifetimeCfg) {\n\tif lmts.ByteSoft != 0 {\n\t\tlft.SoftByteLimit = lmts.ByteSoft\n\t} else {\n\t\tlft.SoftByteLimit = nl.XFRM_INF\n\t}\n\tif lmts.ByteHard != 0 {\n\t\tlft.HardByteLimit = lmts.ByteHard\n\t} else {\n\t\tlft.HardByteLimit = nl.XFRM_INF\n\t}\n\tif lmts.PacketSoft != 0 {\n\t\tlft.SoftPacketLimit = lmts.PacketSoft\n\t} else {\n\t\tlft.SoftPacketLimit = nl.XFRM_INF\n\t}\n\tif lmts.PacketHard != 0 {\n\t\tlft.HardPacketLimit = lmts.PacketHard\n\t} else {\n\t\tlft.HardPacketLimit = nl.XFRM_INF\n\t}\n\tlft.SoftAddExpiresSeconds = lmts.TimeSoft\n\tlft.HardAddExpiresSeconds = lmts.TimeHard\n\tlft.SoftUseExpiresSeconds = lmts.TimeUseSoft\n\tlft.HardUseExpiresSeconds = lmts.TimeUseHard\n}\n\nfunc lftToLimits(lft *nl.XfrmLifetimeCfg, lmts *XfrmStateLimits) {\n\t*lmts = *(*XfrmStateLimits)(unsafe.Pointer(lft))\n}\n\nfunc curToStats(cur *nl.XfrmLifetimeCur, wstats *nl.XfrmStats, stats *XfrmStateStats) {\n\tstats.Bytes = cur.Bytes\n\tstats.Packets = cur.Packets\n\tstats.AddTime = cur.AddTime\n\tstats.UseTime = cur.UseTime\n\tstats.ReplayWindow = wstats.ReplayWindow\n\tstats.Replay = wstats.Replay\n\tstats.Failed = wstats.IntegrityFailed\n}\n\nfunc xfrmUsersaInfoFromXfrmState(state *XfrmState) *nl.XfrmUsersaInfo {\n\tmsg := &nl.XfrmUsersaInfo{}\n\tmsg.Family = uint16(nl.GetIPFamily(state.Dst))\n\tmsg.Id.Daddr.FromIP(state.Dst)\n\tmsg.Saddr.FromIP(state.Src)\n\tmsg.Id.Proto = uint8(state.Proto)\n\tmsg.Mode = uint8(state.Mode)\n\tmsg.Id.Spi = nl.Swap32(uint32(state.Spi))\n\tmsg.Reqid = uint32(state.Reqid)\n\tmsg.ReplayWindow = uint8(state.ReplayWindow)\n\n\treturn msg\n}\n" }, { "path": "vendor/github.com/vishvananda/netns/LICENSE", "content": "\n Apache License\n Version 2.0, January 2004\n http://www.apache.org/licenses/\n\n TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION\n\n 1. Definitions.\n\n \"License\" shall mean the terms and conditions for use, reproduction,\n and distribution as defined by Sections 1 through 9 of this document.\n\n \"Licensor\" shall mean the copyright owner or entity authorized by\n the copyright owner that is granting the License.\n\n \"Legal Entity\" shall mean the union of the acting entity and all\n other entities that control, are controlled by, or are under common\n control with that entity. For the purposes of this definition,\n \"control\" means (i) the power, direct or indirect, to cause the\n direction or management of such entity, whether by contract or\n otherwise, or (ii) ownership of fifty percent (50%) or more of the\n outstanding shares, or (iii) beneficial ownership of such entity.\n\n \"You\" (or \"Your\") shall mean an individual or Legal Entity\n exercising permissions granted by this License.\n\n \"Source\" form shall mean the preferred form for making modifications,\n including but not limited to software source code, documentation\n source, and configuration files.\n\n \"Object\" form shall mean any form resulting from mechanical\n transformation or translation of a Source form, including but\n not limited to compiled object code, generated documentation,\n and conversions to other media types.\n\n \"Work\" shall mean the work of authorship, whether in Source or\n Object form, made available under the License, as indicated by a\n copyright notice that is included in or attached to the work\n (an example is provided in the Appendix below).\n\n \"Derivative Works\" shall mean any work, whether in Source or Object\n form, that is based on (or derived from) the Work and for which the\n editorial revisions, annotations, elaborations, or other modifications\n represent, as a whole, an original work of authorship. For the purposes\n of this License, Derivative Works shall not include works that remain\n separable from, or merely link (or bind by name) to the interfaces of,\n the Work and Derivative Works thereof.\n\n \"Contribution\" shall mean any work of authorship, including\n the original version of the Work and any modifications or additions\n to that Work or Derivative Works thereof, that is intentionally\n submitted to Licensor for inclusion in the Work by the copyright owner\n or by an individual or Legal Entity authorized to submit on behalf of\n the copyright owner. For the purposes of this definition, \"submitted\"\n means any form of electronic, verbal, or written communication sent\n to the Licensor or its representatives, including but not limited to\n communication on electronic mailing lists, source code control systems,\n and issue tracking systems that are managed by, or on behalf of, the\n Licensor for the purpose of discussing and improving the Work, but\n excluding communication that is conspicuously marked or otherwise\n designated in writing by the copyright owner as \"Not a Contribution.\"\n\n \"Contributor\" shall mean Licensor and any individual or Legal Entity\n on behalf of whom a Contribution has been received by Licensor and\n subsequently incorporated within the Work.\n\n 2. Grant of Copyright License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n copyright license to reproduce, prepare Derivative Works of,\n publicly display, publicly perform, sublicense, and distribute the\n Work and such Derivative Works in Source or Object form.\n\n 3. Grant of Patent License. Subject to the terms and conditions of\n this License, each Contributor hereby grants to You a perpetual,\n worldwide, non-exclusive, no-charge, royalty-free, irrevocable\n (except as stated in this section) patent license to make, have made,\n use, offer to sell, sell, import, and otherwise transfer the Work,\n where such license applies only to those patent claims licensable\n by such Contributor that are necessarily infringed by their\n Contribution(s) alone or by combination of their Contribution(s)\n with the Work to which such Contribution(s) was submitted. If You\n institute patent litigation against any entity (including a\n cross-claim or counterclaim in a lawsuit) alleging that the Work\n or a Contribution incorporated within the Work constitutes direct\n or contributory patent infringement, then any patent licenses\n granted to You under this License for that Work shall terminate\n as of the date such litigation is filed.\n\n 4. Redistribution. You may reproduce and distribute copies of the\n Work or Derivative Works thereof in any medium, with or without\n modifications, and in Source or Object form, provided that You\n meet the following conditions:\n\n (a) You must give any other recipients of the Work or\n Derivative Works a copy of this License; and\n\n (b) You must cause any modified files to carry prominent notices\n stating that You changed the files; and\n\n (c) You must retain, in the Source form of any Derivative Works\n that You distribute, all copyright, patent, trademark, and\n attribution notices from the Source form of the Work,\n excluding those notices that do not pertain to any part of\n the Derivative Works; and\n\n (d) If the Work includes a \"NOTICE\" text file as part of its\n distribution, then any Derivative Works that You distribute must\n include a readable copy of the attribution notices contained\n within such NOTICE file, excluding those notices that do not\n pertain to any part of the Derivative Works, in at least one\n of the following places: within a NOTICE text file distributed\n as part of the Derivative Works; within the Source form or\n documentation, if provided along with the Derivative Works; or,\n within a display generated by the Derivative Works, if and\n wherever such third-party notices normally appear. The contents\n of the NOTICE file are for informational purposes only and\n do not modify the License. You may add Your own attribution\n notices within Derivative Works that You distribute, alongside\n or as an addendum to the NOTICE text from the Work, provided\n that such additional attribution notices cannot be construed\n as modifying the License.\n\n You may add Your own copyright statement to Your modifications and\n may provide additional or different license terms and conditions\n for use, reproduction, or distribution of Your modifications, or\n for any such Derivative Works as a whole, provided Your use,\n reproduction, and distribution of the Work otherwise complies with\n the conditions stated in this License.\n\n 5. Submission of Contributions. Unless You explicitly state otherwise,\n any Contribution intentionally submitted for inclusion in the Work\n by You to the Licensor shall be under the terms and conditions of\n this License, without any additional terms or conditions.\n Notwithstanding the above, nothing herein shall supersede or modify\n the terms of any separate license agreement you may have executed\n with Licensor regarding such Contributions.\n\n 6. Trademarks. This License does not grant permission to use the trade\n names, trademarks, service marks, or product names of the Licensor,\n except as required for reasonable and customary use in describing the\n origin of the Work and reproducing the content of the NOTICE file.\n\n 7. Disclaimer of Warranty. Unless required by applicable law or\n agreed to in writing, Licensor provides the Work (and each\n Contributor provides its Contributions) on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or\n implied, including, without limitation, any warranties or conditions\n of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A\n PARTICULAR PURPOSE. You are solely responsible for determining the\n appropriateness of using or redistributing the Work and assume any\n risks associated with Your exercise of permissions under this License.\n\n 8. Limitation of Liability. In no event and under no legal theory,\n whether in tort (including negligence), contract, or otherwise,\n unless required by applicable law (such as deliberate and grossly\n negligent acts) or agreed to in writing, shall any Contributor be\n liable to You for damages, including any direct, indirect, special,\n incidental, or consequential damages of any character arising as a\n result of this License or out of the use or inability to use the\n Work (including but not limited to damages for loss of goodwill,\n work stoppage, computer failure or malfunction, or any and all\n other commercial damages or losses), even if such Contributor\n has been advised of the possibility of such damages.\n\n 9. Accepting Warranty or Additional Liability. While redistributing\n the Work or Derivative Works thereof, You may choose to offer,\n and charge a fee for, acceptance of support, warranty, indemnity,\n or other liability obligations and/or rights consistent with this\n License. However, in accepting such obligations, You may act only\n on Your own behalf and on Your sole responsibility, not on behalf\n of any other Contributor, and only if You agree to indemnify,\n defend, and hold each Contributor harmless for any liability\n incurred by, or claims asserted against, such Contributor by reason\n of your accepting any such warranty or additional liability.\n\n END OF TERMS AND CONDITIONS\n\n Copyright 2014 Vishvananda Ishaya.\n Copyright 2014 Docker, Inc.\n\n Licensed under the Apache License, Version 2.0 (the \"License\");\n you may not use this file except in compliance with the License.\n You may obtain a copy of the License at\n\n http://www.apache.org/licenses/LICENSE-2.0\n\n Unless required by applicable law or agreed to in writing, software\n distributed under the License is distributed on an \"AS IS\" BASIS,\n WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n See the License for the specific language governing permissions and\n limitations under the License.\n" }, { "path": "vendor/github.com/vishvananda/netns/README.md", "content": "# netns - network namespaces in go #\n\nThe netns package provides an ultra-simple interface for handling\nnetwork namespaces in go. Changing namespaces requires elevated\nprivileges, so in most cases this code needs to be run as root.\n\n## Local Build and Test ##\n\nYou can use go get command:\n\n go get github.com/vishvananda/netns\n\nTesting (requires root):\n\n sudo -E go test github.com/vishvananda/netns\n\n## Example ##\n\n```go\npackage main\n\nimport (\n \"fmt\"\n \"net\"\n \"runtime\"\n \"github.com/vishvananda/netns\"\n)\n\nfunc main() {\n // Lock the OS Thread so we don't accidentally switch namespaces\n runtime.LockOSThread()\n defer runtime.UnlockOSThread()\n\n // Save the current network namespace\n origns, _ := netns.Get()\n defer origns.Close()\n\n // Create a new network namespace\n newns, _ := netns.New()\n defer newns.Close()\n\n // Do something with the network namespace\n ifaces, _ := net.Interfaces()\n fmt.Printf(\"Interfaces: %v\\n\", ifaces)\n\n // Switch back to the original namespace\n netns.Set(origns)\n}\n\n```\n" }, { "path": "vendor/github.com/vishvananda/netns/go.mod", "content": "module github.com/vishvananda/netns\n\ngo 1.12\n\nrequire golang.org/x/sys v0.0.0-20200217220822-9197077df867\n" }, { "path": "vendor/github.com/vishvananda/netns/go.sum", "content": "golang.org/x/sys v0.0.0-20200217220822-9197077df867 h1:JoRuNIf+rpHl+VhScRQQvzbHed86tKkqwPMV34T8myw=\ngolang.org/x/sys v0.0.0-20200217220822-9197077df867/go.mod h1:h1NjWce9XRLGQEsW7wpKNCjG9DtNlClVuFLEZdDNbEs=\n" }, { "path": "vendor/github.com/vishvananda/netns/netns.go", "content": "// Package netns allows ultra-simple network namespace handling. NsHandles\n// can be retrieved and set. Note that the current namespace is thread\n// local so actions that set and reset namespaces should use LockOSThread\n// to make sure the namespace doesn't change due to a goroutine switch.\n// It is best to close NsHandles when you are done with them. This can be\n// accomplished via a `defer ns.Close()` on the handle. Changing namespaces\n// requires elevated privileges, so in most cases this code needs to be run\n// as root.\npackage netns\n\nimport (\n\t\"fmt\"\n\n\t\"golang.org/x/sys/unix\"\n)\n\n// NsHandle is a handle to a network namespace. It can be cast directly\n// to an int and used as a file descriptor.\ntype NsHandle int\n\n// Equal determines if two network handles refer to the same network\n// namespace. This is done by comparing the device and inode that the\n// file descriptors point to.\nfunc (ns NsHandle) Equal(other NsHandle) bool {\n\tif ns == other {\n\t\treturn true\n\t}\n\tvar s1, s2 unix.Stat_t\n\tif err := unix.Fstat(int(ns), &s1); err != nil {\n\t\treturn false\n\t}\n\tif err := unix.Fstat(int(other), &s2); err != nil {\n\t\treturn false\n\t}\n\treturn (s1.Dev == s2.Dev) && (s1.Ino == s2.Ino)\n}\n\n// String shows the file descriptor number and its dev and inode.\nfunc (ns NsHandle) String() string {\n\tif ns == -1 {\n\t\treturn \"NS(None)\"\n\t}\n\tvar s unix.Stat_t\n\tif err := unix.Fstat(int(ns), &s); err != nil {\n\t\treturn fmt.Sprintf(\"NS(%d: unknown)\", ns)\n\t}\n\treturn fmt.Sprintf(\"NS(%d: %d, %d)\", ns, s.Dev, s.Ino)\n}\n\n// UniqueId returns a string which uniquely identifies the namespace\n// associated with the network handle.\nfunc (ns NsHandle) UniqueId() string {\n\tif ns == -1 {\n\t\treturn \"NS(none)\"\n\t}\n\tvar s unix.Stat_t\n\tif err := unix.Fstat(int(ns), &s); err != nil {\n\t\treturn \"NS(unknown)\"\n\t}\n\treturn fmt.Sprintf(\"NS(%d:%d)\", s.Dev, s.Ino)\n}\n\n// IsOpen returns true if Close() has not been called.\nfunc (ns NsHandle) IsOpen() bool {\n\treturn ns != -1\n}\n\n// Close closes the NsHandle and resets its file descriptor to -1.\n// It is not safe to use an NsHandle after Close() is called.\nfunc (ns *NsHandle) Close() error {\n\tif err := unix.Close(int(*ns)); err != nil {\n\t\treturn err\n\t}\n\t(*ns) = -1\n\treturn nil\n}\n\n// None gets an empty (closed) NsHandle.\nfunc None() NsHandle {\n\treturn NsHandle(-1)\n}\n" }, { "path": "vendor/github.com/vishvananda/netns/netns_linux.go", "content": "// +build linux\n\npackage netns\n\nimport (\n\t\"fmt\"\n\t\"io/ioutil\"\n\t\"os\"\n\t\"path\"\n\t\"path/filepath\"\n\t\"strconv\"\n\t\"strings\"\n\t\"syscall\"\n\n\t\"golang.org/x/sys/unix\"\n)\n\n// Deprecated: use syscall pkg instead (go >= 1.5 needed).\nconst (\n\tCLONE_NEWUTS = 0x04000000 /* New utsname group? */\n\tCLONE_NEWIPC = 0x08000000 /* New ipcs */\n\tCLONE_NEWUSER = 0x10000000 /* New user namespace */\n\tCLONE_NEWPID = 0x20000000 /* New pid namespace */\n\tCLONE_NEWNET = 0x40000000 /* New network namespace */\n\tCLONE_IO = 0x80000000 /* Get io context */\n\tbindMountPath = \"/run/netns\" /* Bind mount path for named netns */\n)\n\n// Setns sets namespace using syscall. Note that this should be a method\n// in syscall but it has not been added.\nfunc Setns(ns NsHandle, nstype int) (err error) {\n\treturn unix.Setns(int(ns), nstype)\n}\n\n// Set sets the current network namespace to the namespace represented\n// by NsHandle.\nfunc Set(ns NsHandle) (err error) {\n\treturn Setns(ns, CLONE_NEWNET)\n}\n\n// New creates a new network namespace, sets it as current and returns\n// a handle to it.\nfunc New() (ns NsHandle, err error) {\n\tif err := unix.Unshare(CLONE_NEWNET); err != nil {\n\t\treturn -1, err\n\t}\n\treturn Get()\n}\n\n// NewNamed creates a new named network namespace and returns a handle to it\nfunc NewNamed(name string) (NsHandle, error) {\n\tif _, err := os.Stat(bindMountPath); os.IsNotExist(err) {\n\t\terr = os.MkdirAll(bindMountPath, 0755)\n\t\tif err != nil {\n\t\t\treturn None(), err\n\t\t}\n\t}\n\n\tnewNs, err := New()\n\tif err != nil {\n\t\treturn None(), err\n\t}\n\n\tnamedPath := path.Join(bindMountPath, name)\n\n\tf, err := os.OpenFile(namedPath, os.O_CREATE|os.O_EXCL, 0444)\n\tif err != nil {\n\t\treturn None(), err\n\t}\n\tf.Close()\n\n\tnsPath := fmt.Sprintf(\"/proc/%d/task/%d/ns/net\", os.Getpid(), syscall.Gettid())\n\terr = syscall.Mount(nsPath, namedPath, \"bind\", syscall.MS_BIND, \"\")\n\tif err != nil {\n\t\treturn None(), err\n\t}\n\n\treturn newNs, nil\n}\n\n// DeleteNamed deletes a named network namespace\nfunc DeleteNamed(name string) error {\n\tnamedPath := path.Join(bindMountPath, name)\n\n\terr := syscall.Unmount(namedPath, syscall.MNT_DETACH)\n\tif err != nil {\n\t\treturn err\n\t}\n\n\treturn os.Remove(namedPath)\n}\n\n// Get gets a handle to the current threads network namespace.\nfunc Get() (NsHandle, error) {\n\treturn GetFromThread(os.Getpid(), unix.Gettid())\n}\n\n// GetFromPath gets a handle to a network namespace\n// identified by the path\nfunc GetFromPath(path string) (NsHandle, error) {\n\tfd, err := unix.Open(path, unix.O_RDONLY|unix.O_CLOEXEC, 0)\n\tif err != nil {\n\t\treturn -1, err\n\t}\n\treturn NsHandle(fd), nil\n}\n\n// GetFromName gets a handle to a named network namespace such as one\n// created by `ip netns add`.\nfunc GetFromName(name string) (NsHandle, error) {\n\treturn GetFromPath(fmt.Sprintf(\"/var/run/netns/%s\", name))\n}\n\n// GetFromPid gets a handle to the network namespace of a given pid.\nfunc GetFromPid(pid int) (NsHandle, error) {\n\treturn GetFromPath(fmt.Sprintf(\"/proc/%d/ns/net\", pid))\n}\n\n// GetFromThread gets a handle to the network namespace of a given pid and tid.\nfunc GetFromThread(pid, tid int) (NsHandle, error) {\n\treturn GetFromPath(fmt.Sprintf(\"/proc/%d/task/%d/ns/net\", pid, tid))\n}\n\n// GetFromDocker gets a handle to the network namespace of a docker container.\n// Id is prefixed matched against the running docker containers, so a short\n// identifier can be used as long as it isn't ambiguous.\nfunc GetFromDocker(id string) (NsHandle, error) {\n\tpid, err := getPidForContainer(id)\n\tif err != nil {\n\t\treturn -1, err\n\t}\n\treturn GetFromPid(pid)\n}\n\n// borrowed from docker/utils/utils.go\nfunc findCgroupMountpoint(cgroupType string) (string, error) {\n\toutput, err := ioutil.ReadFile(\"/proc/mounts\")\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\n\t// /proc/mounts has 6 fields per line, one mount per line, e.g.\n\t// cgroup /sys/fs/cgroup/devices cgroup rw,relatime,devices 0 0\n\tfor _, line := range strings.Split(string(output), \"\\n\") {\n\t\tparts := strings.Split(line, \" \")\n\t\tif len(parts) == 6 && parts[2] == \"cgroup\" {\n\t\t\tfor _, opt := range strings.Split(parts[3], \",\") {\n\t\t\t\tif opt == cgroupType {\n\t\t\t\t\treturn parts[1], nil\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn \"\", fmt.Errorf(\"cgroup mountpoint not found for %s\", cgroupType)\n}\n\n// Returns the relative path to the cgroup docker is running in.\n// borrowed from docker/utils/utils.go\n// modified to get the docker pid instead of using /proc/self\nfunc getThisCgroup(cgroupType string) (string, error) {\n\tdockerpid, err := ioutil.ReadFile(\"/var/run/docker.pid\")\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\tresult := strings.Split(string(dockerpid), \"\\n\")\n\tif len(result) == 0 || len(result[0]) == 0 {\n\t\treturn \"\", fmt.Errorf(\"docker pid not found in /var/run/docker.pid\")\n\t}\n\tpid, err := strconv.Atoi(result[0])\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\toutput, err := ioutil.ReadFile(fmt.Sprintf(\"/proc/%d/cgroup\", pid))\n\tif err != nil {\n\t\treturn \"\", err\n\t}\n\tfor _, line := range strings.Split(string(output), \"\\n\") {\n\t\tparts := strings.Split(line, \":\")\n\t\t// any type used by docker should work\n\t\tif parts[1] == cgroupType {\n\t\t\treturn parts[2], nil\n\t\t}\n\t}\n\treturn \"\", fmt.Errorf(\"cgroup '%s' not found in /proc/%d/cgroup\", cgroupType, pid)\n}\n\n// Returns the first pid in a container.\n// borrowed from docker/utils/utils.go\n// modified to only return the first pid\n// modified to glob with id\n// modified to search for newer docker containers\nfunc getPidForContainer(id string) (int, error) {\n\tpid := 0\n\n\t// memory is chosen randomly, any cgroup used by docker works\n\tcgroupType := \"memory\"\n\n\tcgroupRoot, err := findCgroupMountpoint(cgroupType)\n\tif err != nil {\n\t\treturn pid, err\n\t}\n\n\tcgroupThis, err := getThisCgroup(cgroupType)\n\tif err != nil {\n\t\treturn pid, err\n\t}\n\n\tid += \"*\"\n\n\tattempts := []string{\n\t\tfilepath.Join(cgroupRoot, cgroupThis, id, \"tasks\"),\n\t\t// With more recent lxc versions use, cgroup will be in lxc/\n\t\tfilepath.Join(cgroupRoot, cgroupThis, \"lxc\", id, \"tasks\"),\n\t\t// With more recent docker, cgroup will be in docker/\n\t\tfilepath.Join(cgroupRoot, cgroupThis, \"docker\", id, \"tasks\"),\n\t\t// Even more recent docker versions under systemd use docker-.scope/\n\t\tfilepath.Join(cgroupRoot, \"system.slice\", \"docker-\"+id+\".scope\", \"tasks\"),\n\t\t// Even more recent docker versions under cgroup/systemd/docker//\n\t\tfilepath.Join(cgroupRoot, \"..\", \"systemd\", \"docker\", id, \"tasks\"),\n\t\t// Kubernetes with docker and CNI is even more different\n\t\tfilepath.Join(cgroupRoot, \"..\", \"systemd\", \"kubepods\", \"*\", \"pod*\", id, \"tasks\"),\n\t\t// Another flavor of containers location in recent kubernetes 1.11+\n\t\tfilepath.Join(cgroupRoot, cgroupThis, \"kubepods.slice\", \"kubepods-besteffort.slice\", \"*\", \"docker-\"+id+\".scope\", \"tasks\"),\n\t\t// When runs inside of a container with recent kubernetes 1.11+\n\t\tfilepath.Join(cgroupRoot, \"kubepods.slice\", \"kubepods-besteffort.slice\", \"*\", \"docker-\"+id+\".scope\", \"tasks\"),\n\t}\n\n\tvar filename string\n\tfor _, attempt := range attempts {\n\t\tfilenames, _ := filepath.Glob(attempt)\n\t\tif len(filenames) > 1 {\n\t\t\treturn pid, fmt.Errorf(\"Ambiguous id supplied: %v\", filenames)\n\t\t} else if len(filenames) == 1 {\n\t\t\tfilename = filenames[0]\n\t\t\tbreak\n\t\t}\n\t}\n\n\tif filename == \"\" {\n\t\treturn pid, fmt.Errorf(\"Unable to find container: %v\", id[:len(id)-1])\n\t}\n\n\toutput, err := ioutil.ReadFile(filename)\n\tif err != nil {\n\t\treturn pid, err\n\t}\n\n\tresult := strings.Split(string(output), \"\\n\")\n\tif len(result) == 0 || len(result[0]) == 0 {\n\t\treturn pid, fmt.Errorf(\"No pid found for container\")\n\t}\n\n\tpid, err = strconv.Atoi(result[0])\n\tif err != nil {\n\t\treturn pid, fmt.Errorf(\"Invalid pid '%s': %s\", result[0], err)\n\t}\n\n\treturn pid, nil\n}\n" }, { "path": "vendor/github.com/vishvananda/netns/netns_unspecified.go", "content": "// +build !linux\n\npackage netns\n\nimport (\n\t\"errors\"\n)\n\nvar (\n\tErrNotImplemented = errors.New(\"not implemented\")\n)\n\nfunc Set(ns NsHandle) (err error) {\n\treturn ErrNotImplemented\n}\n\nfunc New() (ns NsHandle, err error) {\n\treturn -1, ErrNotImplemented\n}\n\nfunc Get() (NsHandle, error) {\n\treturn -1, ErrNotImplemented\n}\n\nfunc GetFromPath(path string) (NsHandle, error) {\n\treturn -1, ErrNotImplemented\n}\n\nfunc GetFromName(name string) (NsHandle, error) {\n\treturn -1, ErrNotImplemented\n}\n\nfunc GetFromPid(pid int) (NsHandle, error) {\n\treturn -1, ErrNotImplemented\n}\n\nfunc GetFromThread(pid, tid int) (NsHandle, error) {\n\treturn -1, ErrNotImplemented\n}\n\nfunc GetFromDocker(id string) (NsHandle, error) {\n\treturn -1, ErrNotImplemented\n}\n" }, { "path": "vendor/golang.org/x/net/AUTHORS", "content": "# This source code refers to The Go Authors for copyright purposes.\n# The master list of authors is in the main Go distribution,\n# visible at http://tip.golang.org/AUTHORS.\n" }, { "path": "vendor/golang.org/x/net/CONTRIBUTORS", "content": "# This source code was written by the Go contributors.\n# The master list of contributors is in the main Go distribution,\n# visible at http://tip.golang.org/CONTRIBUTORS.\n" }, { "path": "vendor/golang.org/x/net/LICENSE", "content": "Copyright (c) 2009 The Go Authors. All rights reserved.\n\nRedistribution and use in source and binary forms, with or without\nmodification, are permitted provided that the following conditions are\nmet:\n\n * Redistributions of source code must retain the above copyright\nnotice, this list of conditions and the following disclaimer.\n * Redistributions in binary form must reproduce the above\ncopyright notice, this list of conditions and the following disclaimer\nin the documentation and/or other materials provided with the\ndistribution.\n * Neither the name of Google Inc. nor the names of its\ncontributors may be used to endorse or promote products derived from\nthis software without specific prior written permission.\n\nTHIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n\"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\nLIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\nA PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\nOWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\nSPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\nLIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\nDATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\nTHEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\nOF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n" }, { "path": "vendor/golang.org/x/net/PATENTS", "content": "Additional IP Rights Grant (Patents)\n\n\"This implementation\" means the copyrightable works distributed by\nGoogle as part of the Go project.\n\nGoogle hereby grants to You a perpetual, worldwide, non-exclusive,\nno-charge, royalty-free, irrevocable (except as stated in this section)\npatent license to make, have made, use, offer to sell, sell, import,\ntransfer and otherwise run, modify and propagate the contents of this\nimplementation of Go, where such license applies only to those patent\nclaims, both currently owned or controlled by Google and acquired in\nthe future, licensable by Google that are necessarily infringed by this\nimplementation of Go. This grant does not include claims that would be\ninfringed only as a consequence of further modification of this\nimplementation. If you or your agent or exclusive licensee institute or\norder or agree to the institution of patent litigation against any\nentity (including a cross-claim or counterclaim in a lawsuit) alleging\nthat this implementation of Go or any code incorporated within this\nimplementation of Go constitutes direct or contributory patent\ninfringement, or inducement of patent infringement, then any patent\nrights granted to you under this License for this implementation of Go\nshall terminate as of the date such litigation is filed.\n" }, { "path": "vendor/golang.org/x/net/html/atom/atom.go", "content": "// Copyright 2012 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// Package atom provides integer codes (also known as atoms) for a fixed set of\n// frequently occurring HTML strings: tag names and attribute keys such as \"p\"\n// and \"id\".\n//\n// Sharing an atom's name between all elements with the same tag can result in\n// fewer string allocations when tokenizing and parsing HTML. Integer\n// comparisons are also generally faster than string comparisons.\n//\n// The value of an atom's particular code is not guaranteed to stay the same\n// between versions of this package. Neither is any ordering guaranteed:\n// whether atom.H1 < atom.H2 may also change. The codes are not guaranteed to\n// be dense. The only guarantees are that e.g. looking up \"div\" will yield\n// atom.Div, calling atom.Div.String will return \"div\", and atom.Div != 0.\npackage atom // import \"golang.org/x/net/html/atom\"\n\n// Atom is an integer code for a string. The zero value maps to \"\".\ntype Atom uint32\n\n// String returns the atom's name.\nfunc (a Atom) String() string {\n\tstart := uint32(a >> 8)\n\tn := uint32(a & 0xff)\n\tif start+n > uint32(len(atomText)) {\n\t\treturn \"\"\n\t}\n\treturn atomText[start : start+n]\n}\n\nfunc (a Atom) string() string {\n\treturn atomText[a>>8 : a>>8+a&0xff]\n}\n\n// fnv computes the FNV hash with an arbitrary starting value h.\nfunc fnv(h uint32, s []byte) uint32 {\n\tfor i := range s {\n\t\th ^= uint32(s[i])\n\t\th *= 16777619\n\t}\n\treturn h\n}\n\nfunc match(s string, t []byte) bool {\n\tfor i, c := range t {\n\t\tif s[i] != c {\n\t\t\treturn false\n\t\t}\n\t}\n\treturn true\n}\n\n// Lookup returns the atom whose name is s. It returns zero if there is no\n// such atom. The lookup is case sensitive.\nfunc Lookup(s []byte) Atom {\n\tif len(s) == 0 || len(s) > maxAtomLen {\n\t\treturn 0\n\t}\n\th := fnv(hash0, s)\n\tif a := table[h&uint32(len(table)-1)]; int(a&0xff) == len(s) && match(a.string(), s) {\n\t\treturn a\n\t}\n\tif a := table[(h>>16)&uint32(len(table)-1)]; int(a&0xff) == len(s) && match(a.string(), s) {\n\t\treturn a\n\t}\n\treturn 0\n}\n\n// String returns a string whose contents are equal to s. In that sense, it is\n// equivalent to string(s) but may be more efficient.\nfunc String(s []byte) string {\n\tif a := Lookup(s); a != 0 {\n\t\treturn a.String()\n\t}\n\treturn string(s)\n}\n" }, { "path": "vendor/golang.org/x/net/html/atom/table.go", "content": "// Code generated by go generate gen.go; DO NOT EDIT.\n\n//go:generate go run gen.go\n\npackage atom\n\nconst (\n\tA Atom = 0x1\n\tAbbr Atom = 0x4\n\tAccept Atom = 0x1a06\n\tAcceptCharset Atom = 0x1a0e\n\tAccesskey Atom = 0x2c09\n\tAcronym Atom = 0xaa07\n\tAction Atom = 0x27206\n\tAddress Atom = 0x6f307\n\tAlign Atom = 0xb105\n\tAllowfullscreen Atom = 0x2080f\n\tAllowpaymentrequest Atom = 0xc113\n\tAllowusermedia Atom = 0xdd0e\n\tAlt Atom = 0xf303\n\tAnnotation Atom = 0x1c90a\n\tAnnotationXml Atom = 0x1c90e\n\tApplet Atom = 0x31906\n\tArea Atom = 0x35604\n\tArticle Atom = 0x3fc07\n\tAs Atom = 0x3c02\n\tAside Atom = 0x10705\n\tAsync Atom = 0xff05\n\tAudio Atom = 0x11505\n\tAutocomplete Atom = 0x2780c\n\tAutofocus Atom = 0x12109\n\tAutoplay Atom = 0x13c08\n\tB Atom = 0x101\n\tBase Atom = 0x3b04\n\tBasefont Atom = 0x3b08\n\tBdi Atom = 0xba03\n\tBdo Atom = 0x14b03\n\tBgsound Atom = 0x15e07\n\tBig Atom = 0x17003\n\tBlink Atom = 0x17305\n\tBlockquote Atom = 0x1870a\n\tBody Atom = 0x2804\n\tBr Atom = 0x202\n\tButton Atom = 0x19106\n\tCanvas Atom = 0x10306\n\tCaption Atom = 0x23107\n\tCenter Atom = 0x22006\n\tChallenge Atom = 0x29b09\n\tCharset Atom = 0x2107\n\tChecked Atom = 0x47907\n\tCite Atom = 0x19c04\n\tClass Atom = 0x56405\n\tCode Atom = 0x5c504\n\tCol Atom = 0x1ab03\n\tColgroup Atom = 0x1ab08\n\tColor Atom = 0x1bf05\n\tCols Atom = 0x1c404\n\tColspan Atom = 0x1c407\n\tCommand Atom = 0x1d707\n\tContent Atom = 0x58b07\n\tContenteditable Atom = 0x58b0f\n\tContextmenu Atom = 0x3800b\n\tControls Atom = 0x1de08\n\tCoords Atom = 0x1ea06\n\tCrossorigin Atom = 0x1fb0b\n\tData Atom = 0x4a504\n\tDatalist Atom = 0x4a508\n\tDatetime Atom = 0x2b808\n\tDd Atom = 0x2d702\n\tDefault Atom = 0x10a07\n\tDefer Atom = 0x5c705\n\tDel Atom = 0x45203\n\tDesc Atom = 0x56104\n\tDetails Atom = 0x7207\n\tDfn Atom = 0x8703\n\tDialog Atom = 0xbb06\n\tDir Atom = 0x9303\n\tDirname Atom = 0x9307\n\tDisabled Atom = 0x16408\n\tDiv Atom = 0x16b03\n\tDl Atom = 0x5e602\n\tDownload Atom = 0x46308\n\tDraggable Atom = 0x17a09\n\tDropzone Atom = 0x40508\n\tDt Atom = 0x64b02\n\tEm Atom = 0x6e02\n\tEmbed Atom = 0x6e05\n\tEnctype Atom = 0x28d07\n\tFace Atom = 0x21e04\n\tFieldset Atom = 0x22608\n\tFigcaption Atom = 0x22e0a\n\tFigure Atom = 0x24806\n\tFont Atom = 0x3f04\n\tFooter Atom = 0xf606\n\tFor Atom = 0x25403\n\tForeignObject Atom = 0x2540d\n\tForeignobject Atom = 0x2610d\n\tForm Atom = 0x26e04\n\tFormaction Atom = 0x26e0a\n\tFormenctype Atom = 0x2890b\n\tFormmethod Atom = 0x2a40a\n\tFormnovalidate Atom = 0x2ae0e\n\tFormtarget Atom = 0x2c00a\n\tFrame Atom = 0x8b05\n\tFrameset Atom = 0x8b08\n\tH1 Atom = 0x15c02\n\tH2 Atom = 0x2de02\n\tH3 Atom = 0x30d02\n\tH4 Atom = 0x34502\n\tH5 Atom = 0x34f02\n\tH6 Atom = 0x64d02\n\tHead Atom = 0x33104\n\tHeader Atom = 0x33106\n\tHeaders Atom = 0x33107\n\tHeight Atom = 0x5206\n\tHgroup Atom = 0x2ca06\n\tHidden Atom = 0x2d506\n\tHigh Atom = 0x2db04\n\tHr Atom = 0x15702\n\tHref Atom = 0x2e004\n\tHreflang Atom = 0x2e008\n\tHtml Atom = 0x5604\n\tHttpEquiv Atom = 0x2e80a\n\tI Atom = 0x601\n\tIcon Atom = 0x58a04\n\tId Atom = 0x10902\n\tIframe Atom = 0x2fc06\n\tImage Atom = 0x30205\n\tImg Atom = 0x30703\n\tInput Atom = 0x44b05\n\tInputmode Atom = 0x44b09\n\tIns Atom = 0x20403\n\tIntegrity Atom = 0x23f09\n\tIs Atom = 0x16502\n\tIsindex Atom = 0x30f07\n\tIsmap Atom = 0x31605\n\tItemid Atom = 0x38b06\n\tItemprop Atom = 0x19d08\n\tItemref Atom = 0x3cd07\n\tItemscope Atom = 0x67109\n\tItemtype Atom = 0x31f08\n\tKbd Atom = 0xb903\n\tKeygen Atom = 0x3206\n\tKeytype Atom = 0xd607\n\tKind Atom = 0x17704\n\tLabel Atom = 0x5905\n\tLang Atom = 0x2e404\n\tLegend Atom = 0x18106\n\tLi Atom = 0xb202\n\tLink Atom = 0x17404\n\tList Atom = 0x4a904\n\tListing Atom = 0x4a907\n\tLoop Atom = 0x5d04\n\tLow Atom = 0xc303\n\tMain Atom = 0x1004\n\tMalignmark Atom = 0xb00a\n\tManifest Atom = 0x6d708\n\tMap Atom = 0x31803\n\tMark Atom = 0xb604\n\tMarquee Atom = 0x32707\n\tMath Atom = 0x32e04\n\tMax Atom = 0x33d03\n\tMaxlength Atom = 0x33d09\n\tMedia Atom = 0xe605\n\tMediagroup Atom = 0xe60a\n\tMenu Atom = 0x38704\n\tMenuitem Atom = 0x38708\n\tMeta Atom = 0x4b804\n\tMeter Atom = 0x9805\n\tMethod Atom = 0x2a806\n\tMglyph Atom = 0x30806\n\tMi Atom = 0x34702\n\tMin Atom = 0x34703\n\tMinlength Atom = 0x34709\n\tMn Atom = 0x2b102\n\tMo Atom = 0xa402\n\tMs Atom = 0x67402\n\tMtext Atom = 0x35105\n\tMultiple Atom = 0x35f08\n\tMuted Atom = 0x36705\n\tName Atom = 0x9604\n\tNav Atom = 0x1303\n\tNobr Atom = 0x3704\n\tNoembed Atom = 0x6c07\n\tNoframes Atom = 0x8908\n\tNomodule Atom = 0xa208\n\tNonce Atom = 0x1a605\n\tNoscript Atom = 0x21608\n\tNovalidate Atom = 0x2b20a\n\tObject Atom = 0x26806\n\tOl Atom = 0x13702\n\tOnabort Atom = 0x19507\n\tOnafterprint Atom = 0x2360c\n\tOnautocomplete Atom = 0x2760e\n\tOnautocompleteerror Atom = 0x27613\n\tOnauxclick Atom = 0x61f0a\n\tOnbeforeprint Atom = 0x69e0d\n\tOnbeforeunload Atom = 0x6e70e\n\tOnblur Atom = 0x56d06\n\tOncancel Atom = 0x11908\n\tOncanplay Atom = 0x14d09\n\tOncanplaythrough Atom = 0x14d10\n\tOnchange Atom = 0x41b08\n\tOnclick Atom = 0x2f507\n\tOnclose Atom = 0x36c07\n\tOncontextmenu Atom = 0x37e0d\n\tOncopy Atom = 0x39106\n\tOncuechange Atom = 0x3970b\n\tOncut Atom = 0x3a205\n\tOndblclick Atom = 0x3a70a\n\tOndrag Atom = 0x3b106\n\tOndragend Atom = 0x3b109\n\tOndragenter Atom = 0x3ba0b\n\tOndragexit Atom = 0x3c50a\n\tOndragleave Atom = 0x3df0b\n\tOndragover Atom = 0x3ea0a\n\tOndragstart Atom = 0x3f40b\n\tOndrop Atom = 0x40306\n\tOndurationchange Atom = 0x41310\n\tOnemptied Atom = 0x40a09\n\tOnended Atom = 0x42307\n\tOnerror Atom = 0x42a07\n\tOnfocus Atom = 0x43107\n\tOnhashchange Atom = 0x43d0c\n\tOninput Atom = 0x44907\n\tOninvalid Atom = 0x45509\n\tOnkeydown Atom = 0x45e09\n\tOnkeypress Atom = 0x46b0a\n\tOnkeyup Atom = 0x48007\n\tOnlanguagechange Atom = 0x48d10\n\tOnload Atom = 0x49d06\n\tOnloadeddata Atom = 0x49d0c\n\tOnloadedmetadata Atom = 0x4b010\n\tOnloadend Atom = 0x4c609\n\tOnloadstart Atom = 0x4cf0b\n\tOnmessage Atom = 0x4da09\n\tOnmessageerror Atom = 0x4da0e\n\tOnmousedown Atom = 0x4e80b\n\tOnmouseenter Atom = 0x4f30c\n\tOnmouseleave Atom = 0x4ff0c\n\tOnmousemove Atom = 0x50b0b\n\tOnmouseout Atom = 0x5160a\n\tOnmouseover Atom = 0x5230b\n\tOnmouseup Atom = 0x52e09\n\tOnmousewheel Atom = 0x53c0c\n\tOnoffline Atom = 0x54809\n\tOnonline Atom = 0x55108\n\tOnpagehide Atom = 0x5590a\n\tOnpageshow Atom = 0x5730a\n\tOnpaste Atom = 0x57f07\n\tOnpause Atom = 0x59a07\n\tOnplay Atom = 0x5a406\n\tOnplaying Atom = 0x5a409\n\tOnpopstate Atom = 0x5ad0a\n\tOnprogress Atom = 0x5b70a\n\tOnratechange Atom = 0x5cc0c\n\tOnrejectionhandled Atom = 0x5d812\n\tOnreset Atom = 0x5ea07\n\tOnresize Atom = 0x5f108\n\tOnscroll Atom = 0x60008\n\tOnsecuritypolicyviolation Atom = 0x60819\n\tOnseeked Atom = 0x62908\n\tOnseeking Atom = 0x63109\n\tOnselect Atom = 0x63a08\n\tOnshow Atom = 0x64406\n\tOnsort Atom = 0x64f06\n\tOnstalled Atom = 0x65909\n\tOnstorage Atom = 0x66209\n\tOnsubmit Atom = 0x66b08\n\tOnsuspend Atom = 0x67b09\n\tOntimeupdate Atom = 0x400c\n\tOntoggle Atom = 0x68408\n\tOnunhandledrejection Atom = 0x68c14\n\tOnunload Atom = 0x6ab08\n\tOnvolumechange Atom = 0x6b30e\n\tOnwaiting Atom = 0x6c109\n\tOnwheel Atom = 0x6ca07\n\tOpen Atom = 0x1a304\n\tOptgroup Atom = 0x5f08\n\tOptimum Atom = 0x6d107\n\tOption Atom = 0x6e306\n\tOutput Atom = 0x51d06\n\tP Atom = 0xc01\n\tParam Atom = 0xc05\n\tPattern Atom = 0x6607\n\tPicture Atom = 0x7b07\n\tPing Atom = 0xef04\n\tPlaceholder Atom = 0x1310b\n\tPlaintext Atom = 0x1b209\n\tPlaysinline Atom = 0x1400b\n\tPoster Atom = 0x2cf06\n\tPre Atom = 0x47003\n\tPreload Atom = 0x48607\n\tProgress Atom = 0x5b908\n\tPrompt Atom = 0x53606\n\tPublic Atom = 0x58606\n\tQ Atom = 0xcf01\n\tRadiogroup Atom = 0x30a\n\tRb Atom = 0x3a02\n\tReadonly Atom = 0x35708\n\tReferrerpolicy Atom = 0x3d10e\n\tRel Atom = 0x48703\n\tRequired Atom = 0x24c08\n\tReversed Atom = 0x8008\n\tRows Atom = 0x9c04\n\tRowspan Atom = 0x9c07\n\tRp Atom = 0x23c02\n\tRt Atom = 0x19a02\n\tRtc Atom = 0x19a03\n\tRuby Atom = 0xfb04\n\tS Atom = 0x2501\n\tSamp Atom = 0x7804\n\tSandbox Atom = 0x12907\n\tScope Atom = 0x67505\n\tScoped Atom = 0x67506\n\tScript Atom = 0x21806\n\tSeamless Atom = 0x37108\n\tSection Atom = 0x56807\n\tSelect Atom = 0x63c06\n\tSelected Atom = 0x63c08\n\tShape Atom = 0x1e505\n\tSize Atom = 0x5f504\n\tSizes Atom = 0x5f505\n\tSlot Atom = 0x1ef04\n\tSmall Atom = 0x20605\n\tSortable Atom = 0x65108\n\tSorted Atom = 0x33706\n\tSource Atom = 0x37806\n\tSpacer Atom = 0x43706\n\tSpan Atom = 0x9f04\n\tSpellcheck Atom = 0x4740a\n\tSrc Atom = 0x5c003\n\tSrcdoc Atom = 0x5c006\n\tSrclang Atom = 0x5f907\n\tSrcset Atom = 0x6f906\n\tStart Atom = 0x3fa05\n\tStep Atom = 0x58304\n\tStrike Atom = 0xd206\n\tStrong Atom = 0x6dd06\n\tStyle Atom = 0x6ff05\n\tSub Atom = 0x66d03\n\tSummary Atom = 0x70407\n\tSup Atom = 0x70b03\n\tSvg Atom = 0x70e03\n\tSystem Atom = 0x71106\n\tTabindex Atom = 0x4be08\n\tTable Atom = 0x59505\n\tTarget Atom = 0x2c406\n\tTbody Atom = 0x2705\n\tTd Atom = 0x9202\n\tTemplate Atom = 0x71408\n\tTextarea Atom = 0x35208\n\tTfoot Atom = 0xf505\n\tTh Atom = 0x15602\n\tThead Atom = 0x33005\n\tTime Atom = 0x4204\n\tTitle Atom = 0x11005\n\tTr Atom = 0xcc02\n\tTrack Atom = 0x1ba05\n\tTranslate Atom = 0x1f209\n\tTt Atom = 0x6802\n\tType Atom = 0xd904\n\tTypemustmatch Atom = 0x2900d\n\tU Atom = 0xb01\n\tUl Atom = 0xa702\n\tUpdateviacache Atom = 0x460e\n\tUsemap Atom = 0x59e06\n\tValue Atom = 0x1505\n\tVar Atom = 0x16d03\n\tVideo Atom = 0x2f105\n\tWbr Atom = 0x57c03\n\tWidth Atom = 0x64905\n\tWorkertype Atom = 0x71c0a\n\tWrap Atom = 0x72604\n\tXmp Atom = 0x12f03\n)\n\nconst hash0 = 0x81cdf10e\n\nconst maxAtomLen = 25\n\nvar table = [1 << 9]Atom{\n\t0x1: 0xe60a, // mediagroup\n\t0x2: 0x2e404, // lang\n\t0x4: 0x2c09, // accesskey\n\t0x5: 0x8b08, // frameset\n\t0x7: 0x63a08, // onselect\n\t0x8: 0x71106, // system\n\t0xa: 0x64905, // width\n\t0xc: 0x2890b, // formenctype\n\t0xd: 0x13702, // ol\n\t0xe: 0x3970b, // oncuechange\n\t0x10: 0x14b03, // bdo\n\t0x11: 0x11505, // audio\n\t0x12: 0x17a09, // draggable\n\t0x14: 0x2f105, // video\n\t0x15: 0x2b102, // mn\n\t0x16: 0x38704, // menu\n\t0x17: 0x2cf06, // poster\n\t0x19: 0xf606, // footer\n\t0x1a: 0x2a806, // method\n\t0x1b: 0x2b808, // datetime\n\t0x1c: 0x19507, // onabort\n\t0x1d: 0x460e, // updateviacache\n\t0x1e: 0xff05, // async\n\t0x1f: 0x49d06, // onload\n\t0x21: 0x11908, // oncancel\n\t0x22: 0x62908, // onseeked\n\t0x23: 0x30205, // image\n\t0x24: 0x5d812, // onrejectionhandled\n\t0x26: 0x17404, // link\n\t0x27: 0x51d06, // output\n\t0x28: 0x33104, // head\n\t0x29: 0x4ff0c, // onmouseleave\n\t0x2a: 0x57f07, // onpaste\n\t0x2b: 0x5a409, // onplaying\n\t0x2c: 0x1c407, // colspan\n\t0x2f: 0x1bf05, // color\n\t0x30: 0x5f504, // size\n\t0x31: 0x2e80a, // http-equiv\n\t0x33: 0x601, // i\n\t0x34: 0x5590a, // onpagehide\n\t0x35: 0x68c14, // onunhandledrejection\n\t0x37: 0x42a07, // onerror\n\t0x3a: 0x3b08, // basefont\n\t0x3f: 0x1303, // nav\n\t0x40: 0x17704, // kind\n\t0x41: 0x35708, // readonly\n\t0x42: 0x30806, // mglyph\n\t0x44: 0xb202, // li\n\t0x46: 0x2d506, // hidden\n\t0x47: 0x70e03, // svg\n\t0x48: 0x58304, // step\n\t0x49: 0x23f09, // integrity\n\t0x4a: 0x58606, // public\n\t0x4c: 0x1ab03, // col\n\t0x4d: 0x1870a, // blockquote\n\t0x4e: 0x34f02, // h5\n\t0x50: 0x5b908, // progress\n\t0x51: 0x5f505, // sizes\n\t0x52: 0x34502, // h4\n\t0x56: 0x33005, // thead\n\t0x57: 0xd607, // keytype\n\t0x58: 0x5b70a, // onprogress\n\t0x59: 0x44b09, // inputmode\n\t0x5a: 0x3b109, // ondragend\n\t0x5d: 0x3a205, // oncut\n\t0x5e: 0x43706, // spacer\n\t0x5f: 0x1ab08, // colgroup\n\t0x62: 0x16502, // is\n\t0x65: 0x3c02, // as\n\t0x66: 0x54809, // onoffline\n\t0x67: 0x33706, // sorted\n\t0x69: 0x48d10, // onlanguagechange\n\t0x6c: 0x43d0c, // onhashchange\n\t0x6d: 0x9604, // name\n\t0x6e: 0xf505, // tfoot\n\t0x6f: 0x56104, // desc\n\t0x70: 0x33d03, // max\n\t0x72: 0x1ea06, // coords\n\t0x73: 0x30d02, // h3\n\t0x74: 0x6e70e, // onbeforeunload\n\t0x75: 0x9c04, // rows\n\t0x76: 0x63c06, // select\n\t0x77: 0x9805, // meter\n\t0x78: 0x38b06, // itemid\n\t0x79: 0x53c0c, // onmousewheel\n\t0x7a: 0x5c006, // srcdoc\n\t0x7d: 0x1ba05, // track\n\t0x7f: 0x31f08, // itemtype\n\t0x82: 0xa402, // mo\n\t0x83: 0x41b08, // onchange\n\t0x84: 0x33107, // headers\n\t0x85: 0x5cc0c, // onratechange\n\t0x86: 0x60819, // onsecuritypolicyviolation\n\t0x88: 0x4a508, // datalist\n\t0x89: 0x4e80b, // onmousedown\n\t0x8a: 0x1ef04, // slot\n\t0x8b: 0x4b010, // onloadedmetadata\n\t0x8c: 0x1a06, // accept\n\t0x8d: 0x26806, // object\n\t0x91: 0x6b30e, // onvolumechange\n\t0x92: 0x2107, // charset\n\t0x93: 0x27613, // onautocompleteerror\n\t0x94: 0xc113, // allowpaymentrequest\n\t0x95: 0x2804, // body\n\t0x96: 0x10a07, // default\n\t0x97: 0x63c08, // selected\n\t0x98: 0x21e04, // face\n\t0x99: 0x1e505, // shape\n\t0x9b: 0x68408, // ontoggle\n\t0x9e: 0x64b02, // dt\n\t0x9f: 0xb604, // mark\n\t0xa1: 0xb01, // u\n\t0xa4: 0x6ab08, // onunload\n\t0xa5: 0x5d04, // loop\n\t0xa6: 0x16408, // disabled\n\t0xaa: 0x42307, // onended\n\t0xab: 0xb00a, // malignmark\n\t0xad: 0x67b09, // onsuspend\n\t0xae: 0x35105, // mtext\n\t0xaf: 0x64f06, // onsort\n\t0xb0: 0x19d08, // itemprop\n\t0xb3: 0x67109, // itemscope\n\t0xb4: 0x17305, // blink\n\t0xb6: 0x3b106, // ondrag\n\t0xb7: 0xa702, // ul\n\t0xb8: 0x26e04, // form\n\t0xb9: 0x12907, // sandbox\n\t0xba: 0x8b05, // frame\n\t0xbb: 0x1505, // value\n\t0xbc: 0x66209, // onstorage\n\t0xbf: 0xaa07, // acronym\n\t0xc0: 0x19a02, // rt\n\t0xc2: 0x202, // br\n\t0xc3: 0x22608, // fieldset\n\t0xc4: 0x2900d, // typemustmatch\n\t0xc5: 0xa208, // nomodule\n\t0xc6: 0x6c07, // noembed\n\t0xc7: 0x69e0d, // onbeforeprint\n\t0xc8: 0x19106, // button\n\t0xc9: 0x2f507, // onclick\n\t0xca: 0x70407, // summary\n\t0xcd: 0xfb04, // ruby\n\t0xce: 0x56405, // class\n\t0xcf: 0x3f40b, // ondragstart\n\t0xd0: 0x23107, // caption\n\t0xd4: 0xdd0e, // allowusermedia\n\t0xd5: 0x4cf0b, // onloadstart\n\t0xd9: 0x16b03, // div\n\t0xda: 0x4a904, // list\n\t0xdb: 0x32e04, // math\n\t0xdc: 0x44b05, // input\n\t0xdf: 0x3ea0a, // ondragover\n\t0xe0: 0x2de02, // h2\n\t0xe2: 0x1b209, // plaintext\n\t0xe4: 0x4f30c, // onmouseenter\n\t0xe7: 0x47907, // checked\n\t0xe8: 0x47003, // pre\n\t0xea: 0x35f08, // multiple\n\t0xeb: 0xba03, // bdi\n\t0xec: 0x33d09, // maxlength\n\t0xed: 0xcf01, // q\n\t0xee: 0x61f0a, // onauxclick\n\t0xf0: 0x57c03, // wbr\n\t0xf2: 0x3b04, // base\n\t0xf3: 0x6e306, // option\n\t0xf5: 0x41310, // ondurationchange\n\t0xf7: 0x8908, // noframes\n\t0xf9: 0x40508, // dropzone\n\t0xfb: 0x67505, // scope\n\t0xfc: 0x8008, // reversed\n\t0xfd: 0x3ba0b, // ondragenter\n\t0xfe: 0x3fa05, // start\n\t0xff: 0x12f03, // xmp\n\t0x100: 0x5f907, // srclang\n\t0x101: 0x30703, // img\n\t0x104: 0x101, // b\n\t0x105: 0x25403, // for\n\t0x106: 0x10705, // aside\n\t0x107: 0x44907, // oninput\n\t0x108: 0x35604, // area\n\t0x109: 0x2a40a, // formmethod\n\t0x10a: 0x72604, // wrap\n\t0x10c: 0x23c02, // rp\n\t0x10d: 0x46b0a, // onkeypress\n\t0x10e: 0x6802, // tt\n\t0x110: 0x34702, // mi\n\t0x111: 0x36705, // muted\n\t0x112: 0xf303, // alt\n\t0x113: 0x5c504, // code\n\t0x114: 0x6e02, // em\n\t0x115: 0x3c50a, // ondragexit\n\t0x117: 0x9f04, // span\n\t0x119: 0x6d708, // manifest\n\t0x11a: 0x38708, // menuitem\n\t0x11b: 0x58b07, // content\n\t0x11d: 0x6c109, // onwaiting\n\t0x11f: 0x4c609, // onloadend\n\t0x121: 0x37e0d, // oncontextmenu\n\t0x123: 0x56d06, // onblur\n\t0x124: 0x3fc07, // article\n\t0x125: 0x9303, // dir\n\t0x126: 0xef04, // ping\n\t0x127: 0x24c08, // required\n\t0x128: 0x45509, // oninvalid\n\t0x129: 0xb105, // align\n\t0x12b: 0x58a04, // icon\n\t0x12c: 0x64d02, // h6\n\t0x12d: 0x1c404, // cols\n\t0x12e: 0x22e0a, // figcaption\n\t0x12f: 0x45e09, // onkeydown\n\t0x130: 0x66b08, // onsubmit\n\t0x131: 0x14d09, // oncanplay\n\t0x132: 0x70b03, // sup\n\t0x133: 0xc01, // p\n\t0x135: 0x40a09, // onemptied\n\t0x136: 0x39106, // oncopy\n\t0x137: 0x19c04, // cite\n\t0x138: 0x3a70a, // ondblclick\n\t0x13a: 0x50b0b, // onmousemove\n\t0x13c: 0x66d03, // sub\n\t0x13d: 0x48703, // rel\n\t0x13e: 0x5f08, // optgroup\n\t0x142: 0x9c07, // rowspan\n\t0x143: 0x37806, // source\n\t0x144: 0x21608, // noscript\n\t0x145: 0x1a304, // open\n\t0x146: 0x20403, // ins\n\t0x147: 0x2540d, // foreignObject\n\t0x148: 0x5ad0a, // onpopstate\n\t0x14a: 0x28d07, // enctype\n\t0x14b: 0x2760e, // onautocomplete\n\t0x14c: 0x35208, // textarea\n\t0x14e: 0x2780c, // autocomplete\n\t0x14f: 0x15702, // hr\n\t0x150: 0x1de08, // controls\n\t0x151: 0x10902, // id\n\t0x153: 0x2360c, // onafterprint\n\t0x155: 0x2610d, // foreignobject\n\t0x156: 0x32707, // marquee\n\t0x157: 0x59a07, // onpause\n\t0x158: 0x5e602, // dl\n\t0x159: 0x5206, // height\n\t0x15a: 0x34703, // min\n\t0x15b: 0x9307, // dirname\n\t0x15c: 0x1f209, // translate\n\t0x15d: 0x5604, // html\n\t0x15e: 0x34709, // minlength\n\t0x15f: 0x48607, // preload\n\t0x160: 0x71408, // template\n\t0x161: 0x3df0b, // ondragleave\n\t0x162: 0x3a02, // rb\n\t0x164: 0x5c003, // src\n\t0x165: 0x6dd06, // strong\n\t0x167: 0x7804, // samp\n\t0x168: 0x6f307, // address\n\t0x169: 0x55108, // ononline\n\t0x16b: 0x1310b, // placeholder\n\t0x16c: 0x2c406, // target\n\t0x16d: 0x20605, // small\n\t0x16e: 0x6ca07, // onwheel\n\t0x16f: 0x1c90a, // annotation\n\t0x170: 0x4740a, // spellcheck\n\t0x171: 0x7207, // details\n\t0x172: 0x10306, // canvas\n\t0x173: 0x12109, // autofocus\n\t0x174: 0xc05, // param\n\t0x176: 0x46308, // download\n\t0x177: 0x45203, // del\n\t0x178: 0x36c07, // onclose\n\t0x179: 0xb903, // kbd\n\t0x17a: 0x31906, // applet\n\t0x17b: 0x2e004, // href\n\t0x17c: 0x5f108, // onresize\n\t0x17e: 0x49d0c, // onloadeddata\n\t0x180: 0xcc02, // tr\n\t0x181: 0x2c00a, // formtarget\n\t0x182: 0x11005, // title\n\t0x183: 0x6ff05, // style\n\t0x184: 0xd206, // strike\n\t0x185: 0x59e06, // usemap\n\t0x186: 0x2fc06, // iframe\n\t0x187: 0x1004, // main\n\t0x189: 0x7b07, // picture\n\t0x18c: 0x31605, // ismap\n\t0x18e: 0x4a504, // data\n\t0x18f: 0x5905, // label\n\t0x191: 0x3d10e, // referrerpolicy\n\t0x192: 0x15602, // th\n\t0x194: 0x53606, // prompt\n\t0x195: 0x56807, // section\n\t0x197: 0x6d107, // optimum\n\t0x198: 0x2db04, // high\n\t0x199: 0x15c02, // h1\n\t0x19a: 0x65909, // onstalled\n\t0x19b: 0x16d03, // var\n\t0x19c: 0x4204, // time\n\t0x19e: 0x67402, // ms\n\t0x19f: 0x33106, // header\n\t0x1a0: 0x4da09, // onmessage\n\t0x1a1: 0x1a605, // nonce\n\t0x1a2: 0x26e0a, // formaction\n\t0x1a3: 0x22006, // center\n\t0x1a4: 0x3704, // nobr\n\t0x1a5: 0x59505, // table\n\t0x1a6: 0x4a907, // listing\n\t0x1a7: 0x18106, // legend\n\t0x1a9: 0x29b09, // challenge\n\t0x1aa: 0x24806, // figure\n\t0x1ab: 0xe605, // media\n\t0x1ae: 0xd904, // type\n\t0x1af: 0x3f04, // font\n\t0x1b0: 0x4da0e, // onmessageerror\n\t0x1b1: 0x37108, // seamless\n\t0x1b2: 0x8703, // dfn\n\t0x1b3: 0x5c705, // defer\n\t0x1b4: 0xc303, // low\n\t0x1b5: 0x19a03, // rtc\n\t0x1b6: 0x5230b, // onmouseover\n\t0x1b7: 0x2b20a, // novalidate\n\t0x1b8: 0x71c0a, // workertype\n\t0x1ba: 0x3cd07, // itemref\n\t0x1bd: 0x1, // a\n\t0x1be: 0x31803, // map\n\t0x1bf: 0x400c, // ontimeupdate\n\t0x1c0: 0x15e07, // bgsound\n\t0x1c1: 0x3206, // keygen\n\t0x1c2: 0x2705, // tbody\n\t0x1c5: 0x64406, // onshow\n\t0x1c7: 0x2501, // s\n\t0x1c8: 0x6607, // pattern\n\t0x1cc: 0x14d10, // oncanplaythrough\n\t0x1ce: 0x2d702, // dd\n\t0x1cf: 0x6f906, // srcset\n\t0x1d0: 0x17003, // big\n\t0x1d2: 0x65108, // sortable\n\t0x1d3: 0x48007, // onkeyup\n\t0x1d5: 0x5a406, // onplay\n\t0x1d7: 0x4b804, // meta\n\t0x1d8: 0x40306, // ondrop\n\t0x1da: 0x60008, // onscroll\n\t0x1db: 0x1fb0b, // crossorigin\n\t0x1dc: 0x5730a, // onpageshow\n\t0x1dd: 0x4, // abbr\n\t0x1de: 0x9202, // td\n\t0x1df: 0x58b0f, // contenteditable\n\t0x1e0: 0x27206, // action\n\t0x1e1: 0x1400b, // playsinline\n\t0x1e2: 0x43107, // onfocus\n\t0x1e3: 0x2e008, // hreflang\n\t0x1e5: 0x5160a, // onmouseout\n\t0x1e6: 0x5ea07, // onreset\n\t0x1e7: 0x13c08, // autoplay\n\t0x1e8: 0x63109, // onseeking\n\t0x1ea: 0x67506, // scoped\n\t0x1ec: 0x30a, // radiogroup\n\t0x1ee: 0x3800b, // contextmenu\n\t0x1ef: 0x52e09, // onmouseup\n\t0x1f1: 0x2ca06, // hgroup\n\t0x1f2: 0x2080f, // allowfullscreen\n\t0x1f3: 0x4be08, // tabindex\n\t0x1f6: 0x30f07, // isindex\n\t0x1f7: 0x1a0e, // accept-charset\n\t0x1f8: 0x2ae0e, // formnovalidate\n\t0x1fb: 0x1c90e, // annotation-xml\n\t0x1fc: 0x6e05, // embed\n\t0x1fd: 0x21806, // script\n\t0x1fe: 0xbb06, // dialog\n\t0x1ff: 0x1d707, // command\n}\n\nconst atomText = \"abbradiogrouparamainavalueaccept-charsetbodyaccesskeygenobrb\" +\n\t\"asefontimeupdateviacacheightmlabelooptgroupatternoembedetail\" +\n\t\"sampictureversedfnoframesetdirnameterowspanomoduleacronymali\" +\n\t\"gnmarkbdialogallowpaymentrequestrikeytypeallowusermediagroup\" +\n\t\"ingaltfooterubyasyncanvasidefaultitleaudioncancelautofocusan\" +\n\t\"dboxmplaceholderautoplaysinlinebdoncanplaythrough1bgsoundisa\" +\n\t\"bledivarbigblinkindraggablegendblockquotebuttonabortcitempro\" +\n\t\"penoncecolgrouplaintextrackcolorcolspannotation-xmlcommandco\" +\n\t\"ntrolshapecoordslotranslatecrossoriginsmallowfullscreenoscri\" +\n\t\"ptfacenterfieldsetfigcaptionafterprintegrityfigurequiredfore\" +\n\t\"ignObjectforeignobjectformactionautocompleteerrorformenctype\" +\n\t\"mustmatchallengeformmethodformnovalidatetimeformtargethgroup\" +\n\t\"osterhiddenhigh2hreflanghttp-equivideonclickiframeimageimgly\" +\n\t\"ph3isindexismappletitemtypemarqueematheadersortedmaxlength4m\" +\n\t\"inlength5mtextareadonlymultiplemutedoncloseamlessourceoncont\" +\n\t\"extmenuitemidoncopyoncuechangeoncutondblclickondragendondrag\" +\n\t\"enterondragexitemreferrerpolicyondragleaveondragoverondragst\" +\n\t\"articleondropzonemptiedondurationchangeonendedonerroronfocus\" +\n\t\"paceronhashchangeoninputmodeloninvalidonkeydownloadonkeypres\" +\n\t\"spellcheckedonkeyupreloadonlanguagechangeonloadeddatalisting\" +\n\t\"onloadedmetadatabindexonloadendonloadstartonmessageerroronmo\" +\n\t\"usedownonmouseenteronmouseleaveonmousemoveonmouseoutputonmou\" +\n\t\"seoveronmouseupromptonmousewheelonofflineononlineonpagehides\" +\n\t\"classectionbluronpageshowbronpastepublicontenteditableonpaus\" +\n\t\"emaponplayingonpopstateonprogressrcdocodeferonratechangeonre\" +\n\t\"jectionhandledonresetonresizesrclangonscrollonsecuritypolicy\" +\n\t\"violationauxclickonseekedonseekingonselectedonshowidth6onsor\" +\n\t\"tableonstalledonstorageonsubmitemscopedonsuspendontoggleonun\" +\n\t\"handledrejectionbeforeprintonunloadonvolumechangeonwaitingon\" +\n\t\"wheeloptimumanifestrongoptionbeforeunloaddressrcsetstylesumm\" +\n\t\"arysupsvgsystemplateworkertypewrap\"\n" }, { "path": "vendor/golang.org/x/net/html/charset/charset.go", "content": "// Copyright 2013 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n// Package charset provides common text encodings for HTML documents.\n//\n// The mapping from encoding labels to encodings is defined at\n// https://encoding.spec.whatwg.org/.\npackage charset // import \"golang.org/x/net/html/charset\"\n\nimport (\n\t\"bytes\"\n\t\"fmt\"\n\t\"io\"\n\t\"mime\"\n\t\"strings\"\n\t\"unicode/utf8\"\n\n\t\"golang.org/x/net/html\"\n\t\"golang.org/x/text/encoding\"\n\t\"golang.org/x/text/encoding/charmap\"\n\t\"golang.org/x/text/encoding/htmlindex\"\n\t\"golang.org/x/text/transform\"\n)\n\n// Lookup returns the encoding with the specified label, and its canonical\n// name. It returns nil and the empty string if label is not one of the\n// standard encodings for HTML. Matching is case-insensitive and ignores\n// leading and trailing whitespace. Encoders will use HTML escape sequences for\n// runes that are not supported by the character set.\nfunc Lookup(label string) (e encoding.Encoding, name string) {\n\te, err := htmlindex.Get(label)\n\tif err != nil {\n\t\treturn nil, \"\"\n\t}\n\tname, _ = htmlindex.Name(e)\n\treturn &htmlEncoding{e}, name\n}\n\ntype htmlEncoding struct{ encoding.Encoding }\n\nfunc (h *htmlEncoding) NewEncoder() *encoding.Encoder {\n\t// HTML requires a non-terminating legacy encoder. We use HTML escapes to\n\t// substitute unsupported code points.\n\treturn encoding.HTMLEscapeUnsupported(h.Encoding.NewEncoder())\n}\n\n// DetermineEncoding determines the encoding of an HTML document by examining\n// up to the first 1024 bytes of content and the declared Content-Type.\n//\n// See http://www.whatwg.org/specs/web-apps/current-work/multipage/parsing.html#determining-the-character-encoding\nfunc DetermineEncoding(content []byte, contentType string) (e encoding.Encoding, name string, certain bool) {\n\tif len(content) > 1024 {\n\t\tcontent = content[:1024]\n\t}\n\n\tfor _, b := range boms {\n\t\tif bytes.HasPrefix(content, b.bom) {\n\t\t\te, name = Lookup(b.enc)\n\t\t\treturn e, name, true\n\t\t}\n\t}\n\n\tif _, params, err := mime.ParseMediaType(contentType); err == nil {\n\t\tif cs, ok := params[\"charset\"]; ok {\n\t\t\tif e, name = Lookup(cs); e != nil {\n\t\t\t\treturn e, name, true\n\t\t\t}\n\t\t}\n\t}\n\n\tif len(content) > 0 {\n\t\te, name = prescan(content)\n\t\tif e != nil {\n\t\t\treturn e, name, false\n\t\t}\n\t}\n\n\t// Try to detect UTF-8.\n\t// First eliminate any partial rune at the end.\n\tfor i := len(content) - 1; i >= 0 && i > len(content)-4; i-- {\n\t\tb := content[i]\n\t\tif b < 0x80 {\n\t\t\tbreak\n\t\t}\n\t\tif utf8.RuneStart(b) {\n\t\t\tcontent = content[:i]\n\t\t\tbreak\n\t\t}\n\t}\n\thasHighBit := false\n\tfor _, c := range content {\n\t\tif c >= 0x80 {\n\t\t\thasHighBit = true\n\t\t\tbreak\n\t\t}\n\t}\n\tif hasHighBit && utf8.Valid(content) {\n\t\treturn encoding.Nop, \"utf-8\", false\n\t}\n\n\t// TODO: change default depending on user's locale?\n\treturn charmap.Windows1252, \"windows-1252\", false\n}\n\n// NewReader returns an io.Reader that converts the content of r to UTF-8.\n// It calls DetermineEncoding to find out what r's encoding is.\nfunc NewReader(r io.Reader, contentType string) (io.Reader, error) {\n\tpreview := make([]byte, 1024)\n\tn, err := io.ReadFull(r, preview)\n\tswitch {\n\tcase err == io.ErrUnexpectedEOF:\n\t\tpreview = preview[:n]\n\t\tr = bytes.NewReader(preview)\n\tcase err != nil:\n\t\treturn nil, err\n\tdefault:\n\t\tr = io.MultiReader(bytes.NewReader(preview), r)\n\t}\n\n\tif e, _, _ := DetermineEncoding(preview, contentType); e != encoding.Nop {\n\t\tr = transform.NewReader(r, e.NewDecoder())\n\t}\n\treturn r, nil\n}\n\n// NewReaderLabel returns a reader that converts from the specified charset to\n// UTF-8. It uses Lookup to find the encoding that corresponds to label, and\n// returns an error if Lookup returns nil. It is suitable for use as\n// encoding/xml.Decoder's CharsetReader function.\nfunc NewReaderLabel(label string, input io.Reader) (io.Reader, error) {\n\te, _ := Lookup(label)\n\tif e == nil {\n\t\treturn nil, fmt.Errorf(\"unsupported charset: %q\", label)\n\t}\n\treturn transform.NewReader(input, e.NewDecoder()), nil\n}\n\nfunc prescan(content []byte) (e encoding.Encoding, name string) {\n\tz := html.NewTokenizer(bytes.NewReader(content))\n\tfor {\n\t\tswitch z.Next() {\n\t\tcase html.ErrorToken:\n\t\t\treturn nil, \"\"\n\n\t\tcase html.StartTagToken, html.SelfClosingTagToken:\n\t\t\ttagName, hasAttr := z.TagName()\n\t\t\tif !bytes.Equal(tagName, []byte(\"meta\")) {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tattrList := make(map[string]bool)\n\t\t\tgotPragma := false\n\n\t\t\tconst (\n\t\t\t\tdontKnow = iota\n\t\t\t\tdoNeedPragma\n\t\t\t\tdoNotNeedPragma\n\t\t\t)\n\t\t\tneedPragma := dontKnow\n\n\t\t\tname = \"\"\n\t\t\te = nil\n\t\t\tfor hasAttr {\n\t\t\t\tvar key, val []byte\n\t\t\t\tkey, val, hasAttr = z.TagAttr()\n\t\t\t\tks := string(key)\n\t\t\t\tif attrList[ks] {\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t\tattrList[ks] = true\n\t\t\t\tfor i, c := range val {\n\t\t\t\t\tif 'A' <= c && c <= 'Z' {\n\t\t\t\t\t\tval[i] = c + 0x20\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tswitch ks {\n\t\t\t\tcase \"http-equiv\":\n\t\t\t\t\tif bytes.Equal(val, []byte(\"content-type\")) {\n\t\t\t\t\t\tgotPragma = true\n\t\t\t\t\t}\n\n\t\t\t\tcase \"content\":\n\t\t\t\t\tif e == nil {\n\t\t\t\t\t\tname = fromMetaElement(string(val))\n\t\t\t\t\t\tif name != \"\" {\n\t\t\t\t\t\t\te, name = Lookup(name)\n\t\t\t\t\t\t\tif e != nil {\n\t\t\t\t\t\t\t\tneedPragma = doNeedPragma\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\tcase \"charset\":\n\t\t\t\t\te, name = Lookup(string(val))\n\t\t\t\t\tneedPragma = doNotNeedPragma\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif needPragma == dontKnow || needPragma == doNeedPragma && !gotPragma {\n\t\t\t\tcontinue\n\t\t\t}\n\n\t\t\tif strings.HasPrefix(name, \"utf-16\") {\n\t\t\t\tname = \"utf-8\"\n\t\t\t\te = encoding.Nop\n\t\t\t}\n\n\t\t\tif e != nil {\n\t\t\t\treturn e, name\n\t\t\t}\n\t\t}\n\t}\n}\n\nfunc fromMetaElement(s string) string {\n\tfor s != \"\" {\n\t\tcsLoc := strings.Index(s, \"charset\")\n\t\tif csLoc == -1 {\n\t\t\treturn \"\"\n\t\t}\n\t\ts = s[csLoc+len(\"charset\"):]\n\t\ts = strings.TrimLeft(s, \" \\t\\n\\f\\r\")\n\t\tif !strings.HasPrefix(s, \"=\") {\n\t\t\tcontinue\n\t\t}\n\t\ts = s[1:]\n\t\ts = strings.TrimLeft(s, \" \\t\\n\\f\\r\")\n\t\tif s == \"\" {\n\t\t\treturn \"\"\n\t\t}\n\t\tif q := s[0]; q == '\"' || q == '\\'' {\n\t\t\ts = s[1:]\n\t\t\tcloseQuote := strings.IndexRune(s, rune(q))\n\t\t\tif closeQuote == -1 {\n\t\t\t\treturn \"\"\n\t\t\t}\n\t\t\treturn s[:closeQuote]\n\t\t}\n\n\t\tend := strings.IndexAny(s, \"; \\t\\n\\f\\r\")\n\t\tif end == -1 {\n\t\t\tend = len(s)\n\t\t}\n\t\treturn s[:end]\n\t}\n\treturn \"\"\n}\n\nvar boms = []struct {\n\tbom []byte\n\tenc string\n}{\n\t{[]byte{0xfe, 0xff}, \"utf-16be\"},\n\t{[]byte{0xff, 0xfe}, \"utf-16le\"},\n\t{[]byte{0xef, 0xbb, 0xbf}, \"utf-8\"},\n}\n" }, { "path": "vendor/golang.org/x/net/html/const.go", "content": "// Copyright 2011 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage html\n\n// Section 12.2.4.2 of the HTML5 specification says \"The following elements\n// have varying levels of special parsing rules\".\n// https://html.spec.whatwg.org/multipage/syntax.html#the-stack-of-open-elements\nvar isSpecialElementMap = map[string]bool{\n\t\"address\": true,\n\t\"applet\": true,\n\t\"area\": true,\n\t\"article\": true,\n\t\"aside\": true,\n\t\"base\": true,\n\t\"basefont\": true,\n\t\"bgsound\": true,\n\t\"blockquote\": true,\n\t\"body\": true,\n\t\"br\": true,\n\t\"button\": true,\n\t\"caption\": true,\n\t\"center\": true,\n\t\"col\": true,\n\t\"colgroup\": true,\n\t\"dd\": true,\n\t\"details\": true,\n\t\"dir\": true,\n\t\"div\": true,\n\t\"dl\": true,\n\t\"dt\": true,\n\t\"embed\": true,\n\t\"fieldset\": true,\n\t\"figcaption\": true,\n\t\"figure\": true,\n\t\"footer\": true,\n\t\"form\": true,\n\t\"frame\": true,\n\t\"frameset\": true,\n\t\"h1\": true,\n\t\"h2\": true,\n\t\"h3\": true,\n\t\"h4\": true,\n\t\"h5\": true,\n\t\"h6\": true,\n\t\"head\": true,\n\t\"header\": true,\n\t\"hgroup\": true,\n\t\"hr\": true,\n\t\"html\": true,\n\t\"iframe\": true,\n\t\"img\": true,\n\t\"input\": true,\n\t\"keygen\": true, // \"keygen\" has been removed from the spec, but are kept here for backwards compatibility.\n\t\"li\": true,\n\t\"link\": true,\n\t\"listing\": true,\n\t\"main\": true,\n\t\"marquee\": true,\n\t\"menu\": true,\n\t\"meta\": true,\n\t\"nav\": true,\n\t\"noembed\": true,\n\t\"noframes\": true,\n\t\"noscript\": true,\n\t\"object\": true,\n\t\"ol\": true,\n\t\"p\": true,\n\t\"param\": true,\n\t\"plaintext\": true,\n\t\"pre\": true,\n\t\"script\": true,\n\t\"section\": true,\n\t\"select\": true,\n\t\"source\": true,\n\t\"style\": true,\n\t\"summary\": true,\n\t\"table\": true,\n\t\"tbody\": true,\n\t\"td\": true,\n\t\"template\": true,\n\t\"textarea\": true,\n\t\"tfoot\": true,\n\t\"th\": true,\n\t\"thead\": true,\n\t\"title\": true,\n\t\"tr\": true,\n\t\"track\": true,\n\t\"ul\": true,\n\t\"wbr\": true,\n\t\"xmp\": true,\n}\n\nfunc isSpecialElement(element *Node) bool {\n\tswitch element.Namespace {\n\tcase \"\", \"html\":\n\t\treturn isSpecialElementMap[element.Data]\n\tcase \"math\":\n\t\tswitch element.Data {\n\t\tcase \"mi\", \"mo\", \"mn\", \"ms\", \"mtext\", \"annotation-xml\":\n\t\t\treturn true\n\t\t}\n\tcase \"svg\":\n\t\tswitch element.Data {\n\t\tcase \"foreignObject\", \"desc\", \"title\":\n\t\t\treturn true\n\t\t}\n\t}\n\treturn false\n}\n" }, { "path": "vendor/golang.org/x/net/html/doc.go", "content": "// Copyright 2010 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\n/*\nPackage html implements an HTML5-compliant tokenizer and parser.\n\nTokenization is done by creating a Tokenizer for an io.Reader r. It is the\ncaller's responsibility to ensure that r provides UTF-8 encoded HTML.\n\n\tz := html.NewTokenizer(r)\n\nGiven a Tokenizer z, the HTML is tokenized by repeatedly calling z.Next(),\nwhich parses the next token and returns its type, or an error:\n\n\tfor {\n\t\ttt := z.Next()\n\t\tif tt == html.ErrorToken {\n\t\t\t// ...\n\t\t\treturn ...\n\t\t}\n\t\t// Process the current token.\n\t}\n\nThere are two APIs for retrieving the current token. The high-level API is to\ncall Token; the low-level API is to call Text or TagName / TagAttr. Both APIs\nallow optionally calling Raw after Next but before Token, Text, TagName, or\nTagAttr. In EBNF notation, the valid call sequence per token is:\n\n\tNext {Raw} [ Token | Text | TagName {TagAttr} ]\n\nToken returns an independent data structure that completely describes a token.\nEntities (such as \"<\") are unescaped, tag names and attribute keys are\nlower-cased, and attributes are collected into a []Attribute. For example:\n\n\tfor {\n\t\tif z.Next() == html.ErrorToken {\n\t\t\t// Returning io.EOF indicates success.\n\t\t\treturn z.Err()\n\t\t}\n\t\temitToken(z.Token())\n\t}\n\nThe low-level API performs fewer allocations and copies, but the contents of\nthe []byte values returned by Text, TagName and TagAttr may change on the next\ncall to Next. For example, to extract an HTML page's anchor text:\n\n\tdepth := 0\n\tfor {\n\t\ttt := z.Next()\n\t\tswitch tt {\n\t\tcase html.ErrorToken:\n\t\t\treturn z.Err()\n\t\tcase html.TextToken:\n\t\t\tif depth > 0 {\n\t\t\t\t// emitBytes should copy the []byte it receives,\n\t\t\t\t// if it doesn't process it immediately.\n\t\t\t\temitBytes(z.Text())\n\t\t\t}\n\t\tcase html.StartTagToken, html.EndTagToken:\n\t\t\ttn, _ := z.TagName()\n\t\t\tif len(tn) == 1 && tn[0] == 'a' {\n\t\t\t\tif tt == html.StartTagToken {\n\t\t\t\t\tdepth++\n\t\t\t\t} else {\n\t\t\t\t\tdepth--\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\nParsing is done by calling Parse with an io.Reader, which returns the root of\nthe parse tree (the document element) as a *Node. It is the caller's\nresponsibility to ensure that the Reader provides UTF-8 encoded HTML. For\nexample, to process each anchor node in depth-first order:\n\n\tdoc, err := html.Parse(r)\n\tif err != nil {\n\t\t// ...\n\t}\n\tvar f func(*html.Node)\n\tf = func(n *html.Node) {\n\t\tif n.Type == html.ElementNode && n.Data == \"a\" {\n\t\t\t// Do something with n...\n\t\t}\n\t\tfor c := n.FirstChild; c != nil; c = c.NextSibling {\n\t\t\tf(c)\n\t\t}\n\t}\n\tf(doc)\n\nThe relevant specifications include:\nhttps://html.spec.whatwg.org/multipage/syntax.html and\nhttps://html.spec.whatwg.org/multipage/syntax.html#tokenization\n*/\npackage html // import \"golang.org/x/net/html\"\n\n// The tokenization algorithm implemented by this package is not a line-by-line\n// transliteration of the relatively verbose state-machine in the WHATWG\n// specification. A more direct approach is used instead, where the program\n// counter implies the state, such as whether it is tokenizing a tag or a text\n// node. Specification compliance is verified by checking expected and actual\n// outputs over a test suite rather than aiming for algorithmic fidelity.\n\n// TODO(nigeltao): Does a DOM API belong in this package or a separate one?\n// TODO(nigeltao): How does parsing interact with a JavaScript engine?\n" }, { "path": "vendor/golang.org/x/net/html/doctype.go", "content": "// Copyright 2011 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage html\n\nimport (\n\t\"strings\"\n)\n\n// parseDoctype parses the data from a DoctypeToken into a name,\n// public identifier, and system identifier. It returns a Node whose Type\n// is DoctypeNode, whose Data is the name, and which has attributes\n// named \"system\" and \"public\" for the two identifiers if they were present.\n// quirks is whether the document should be parsed in \"quirks mode\".\nfunc parseDoctype(s string) (n *Node, quirks bool) {\n\tn = &Node{Type: DoctypeNode}\n\n\t// Find the name.\n\tspace := strings.IndexAny(s, whitespace)\n\tif space == -1 {\n\t\tspace = len(s)\n\t}\n\tn.Data = s[:space]\n\t// The comparison to \"html\" is case-sensitive.\n\tif n.Data != \"html\" {\n\t\tquirks = true\n\t}\n\tn.Data = strings.ToLower(n.Data)\n\ts = strings.TrimLeft(s[space:], whitespace)\n\n\tif len(s) < 6 {\n\t\t// It can't start with \"PUBLIC\" or \"SYSTEM\".\n\t\t// Ignore the rest of the string.\n\t\treturn n, quirks || s != \"\"\n\t}\n\n\tkey := strings.ToLower(s[:6])\n\ts = s[6:]\n\tfor key == \"public\" || key == \"system\" {\n\t\ts = strings.TrimLeft(s, whitespace)\n\t\tif s == \"\" {\n\t\t\tbreak\n\t\t}\n\t\tquote := s[0]\n\t\tif quote != '\"' && quote != '\\'' {\n\t\t\tbreak\n\t\t}\n\t\ts = s[1:]\n\t\tq := strings.IndexRune(s, rune(quote))\n\t\tvar id string\n\t\tif q == -1 {\n\t\t\tid = s\n\t\t\ts = \"\"\n\t\t} else {\n\t\t\tid = s[:q]\n\t\t\ts = s[q+1:]\n\t\t}\n\t\tn.Attr = append(n.Attr, Attribute{Key: key, Val: id})\n\t\tif key == \"public\" {\n\t\t\tkey = \"system\"\n\t\t} else {\n\t\t\tkey = \"\"\n\t\t}\n\t}\n\n\tif key != \"\" || s != \"\" {\n\t\tquirks = true\n\t} else if len(n.Attr) > 0 {\n\t\tif n.Attr[0].Key == \"public\" {\n\t\t\tpublic := strings.ToLower(n.Attr[0].Val)\n\t\t\tswitch public {\n\t\t\tcase \"-//w3o//dtd w3 html strict 3.0//en//\", \"-/w3d/dtd html 4.0 transitional/en\", \"html\":\n\t\t\t\tquirks = true\n\t\t\tdefault:\n\t\t\t\tfor _, q := range quirkyIDs {\n\t\t\t\t\tif strings.HasPrefix(public, q) {\n\t\t\t\t\t\tquirks = true\n\t\t\t\t\t\tbreak\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t// The following two public IDs only cause quirks mode if there is no system ID.\n\t\t\tif len(n.Attr) == 1 && (strings.HasPrefix(public, \"-//w3c//dtd html 4.01 frameset//\") ||\n\t\t\t\tstrings.HasPrefix(public, \"-//w3c//dtd html 4.01 transitional//\")) {\n\t\t\t\tquirks = true\n\t\t\t}\n\t\t}\n\t\tif lastAttr := n.Attr[len(n.Attr)-1]; lastAttr.Key == \"system\" &&\n\t\t\tstrings.ToLower(lastAttr.Val) == \"http://www.ibm.com/data/dtd/v11/ibmxhtml1-transitional.dtd\" {\n\t\t\tquirks = true\n\t\t}\n\t}\n\n\treturn n, quirks\n}\n\n// quirkyIDs is a list of public doctype identifiers that cause a document\n// to be interpreted in quirks mode. The identifiers should be in lower case.\nvar quirkyIDs = []string{\n\t\"+//silmaril//dtd html pro v0r11 19970101//\",\n\t\"-//advasoft ltd//dtd html 3.0 aswedit + extensions//\",\n\t\"-//as//dtd html 3.0 aswedit + extensions//\",\n\t\"-//ietf//dtd html 2.0 level 1//\",\n\t\"-//ietf//dtd html 2.0 level 2//\",\n\t\"-//ietf//dtd html 2.0 strict level 1//\",\n\t\"-//ietf//dtd html 2.0 strict level 2//\",\n\t\"-//ietf//dtd html 2.0 strict//\",\n\t\"-//ietf//dtd html 2.0//\",\n\t\"-//ietf//dtd html 2.1e//\",\n\t\"-//ietf//dtd html 3.0//\",\n\t\"-//ietf//dtd html 3.2 final//\",\n\t\"-//ietf//dtd html 3.2//\",\n\t\"-//ietf//dtd html 3//\",\n\t\"-//ietf//dtd html level 0//\",\n\t\"-//ietf//dtd html level 1//\",\n\t\"-//ietf//dtd html level 2//\",\n\t\"-//ietf//dtd html level 3//\",\n\t\"-//ietf//dtd html strict level 0//\",\n\t\"-//ietf//dtd html strict level 1//\",\n\t\"-//ietf//dtd html strict level 2//\",\n\t\"-//ietf//dtd html strict level 3//\",\n\t\"-//ietf//dtd html strict//\",\n\t\"-//ietf//dtd html//\",\n\t\"-//metrius//dtd metrius presentational//\",\n\t\"-//microsoft//dtd internet explorer 2.0 html strict//\",\n\t\"-//microsoft//dtd internet explorer 2.0 html//\",\n\t\"-//microsoft//dtd internet explorer 2.0 tables//\",\n\t\"-//microsoft//dtd internet explorer 3.0 html strict//\",\n\t\"-//microsoft//dtd internet explorer 3.0 html//\",\n\t\"-//microsoft//dtd internet explorer 3.0 tables//\",\n\t\"-//netscape comm. corp.//dtd html//\",\n\t\"-//netscape comm. corp.//dtd strict html//\",\n\t\"-//o'reilly and associates//dtd html 2.0//\",\n\t\"-//o'reilly and associates//dtd html extended 1.0//\",\n\t\"-//o'reilly and associates//dtd html extended relaxed 1.0//\",\n\t\"-//softquad software//dtd hotmetal pro 6.0::19990601::extensions to html 4.0//\",\n\t\"-//softquad//dtd hotmetal pro 4.0::19971010::extensions to html 4.0//\",\n\t\"-//spyglass//dtd html 2.0 extended//\",\n\t\"-//sq//dtd html 2.0 hotmetal + extensions//\",\n\t\"-//sun microsystems corp.//dtd hotjava html//\",\n\t\"-//sun microsystems corp.//dtd hotjava strict html//\",\n\t\"-//w3c//dtd html 3 1995-03-24//\",\n\t\"-//w3c//dtd html 3.2 draft//\",\n\t\"-//w3c//dtd html 3.2 final//\",\n\t\"-//w3c//dtd html 3.2//\",\n\t\"-//w3c//dtd html 3.2s draft//\",\n\t\"-//w3c//dtd html 4.0 frameset//\",\n\t\"-//w3c//dtd html 4.0 transitional//\",\n\t\"-//w3c//dtd html experimental 19960712//\",\n\t\"-//w3c//dtd html experimental 970421//\",\n\t\"-//w3c//dtd w3 html//\",\n\t\"-//w3o//dtd w3 html 3.0//\",\n\t\"-//webtechs//dtd mozilla html 2.0//\",\n\t\"-//webtechs//dtd mozilla html//\",\n}\n" }, { "path": "vendor/golang.org/x/net/html/entity.go", "content": "// Copyright 2010 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage html\n\n// All entities that do not end with ';' are 6 or fewer bytes long.\nconst longestEntityWithoutSemicolon = 6\n\n// entity is a map from HTML entity names to their values. The semicolon matters:\n// https://html.spec.whatwg.org/multipage/syntax.html#named-character-references\n// lists both \"amp\" and \"amp;\" as two separate entries.\n//\n// Note that the HTML5 list is larger than the HTML4 list at\n// http://www.w3.org/TR/html4/sgml/entities.html\nvar entity = map[string]rune{\n\t\"AElig;\": '\\U000000C6',\n\t\"AMP;\": '\\U00000026',\n\t\"Aacute;\": '\\U000000C1',\n\t\"Abreve;\": '\\U00000102',\n\t\"Acirc;\": '\\U000000C2',\n\t\"Acy;\": '\\U00000410',\n\t\"Afr;\": '\\U0001D504',\n\t\"Agrave;\": '\\U000000C0',\n\t\"Alpha;\": '\\U00000391',\n\t\"Amacr;\": '\\U00000100',\n\t\"And;\": '\\U00002A53',\n\t\"Aogon;\": '\\U00000104',\n\t\"Aopf;\": '\\U0001D538',\n\t\"ApplyFunction;\": '\\U00002061',\n\t\"Aring;\": '\\U000000C5',\n\t\"Ascr;\": '\\U0001D49C',\n\t\"Assign;\": '\\U00002254',\n\t\"Atilde;\": '\\U000000C3',\n\t\"Auml;\": '\\U000000C4',\n\t\"Backslash;\": '\\U00002216',\n\t\"Barv;\": '\\U00002AE7',\n\t\"Barwed;\": '\\U00002306',\n\t\"Bcy;\": '\\U00000411',\n\t\"Because;\": '\\U00002235',\n\t\"Bernoullis;\": '\\U0000212C',\n\t\"Beta;\": '\\U00000392',\n\t\"Bfr;\": '\\U0001D505',\n\t\"Bopf;\": '\\U0001D539',\n\t\"Breve;\": '\\U000002D8',\n\t\"Bscr;\": '\\U0000212C',\n\t\"Bumpeq;\": '\\U0000224E',\n\t\"CHcy;\": '\\U00000427',\n\t\"COPY;\": '\\U000000A9',\n\t\"Cacute;\": '\\U00000106',\n\t\"Cap;\": '\\U000022D2',\n\t\"CapitalDifferentialD;\": '\\U00002145',\n\t\"Cayleys;\": '\\U0000212D',\n\t\"Ccaron;\": '\\U0000010C',\n\t\"Ccedil;\": '\\U000000C7',\n\t\"Ccirc;\": '\\U00000108',\n\t\"Cconint;\": '\\U00002230',\n\t\"Cdot;\": '\\U0000010A',\n\t\"Cedilla;\": '\\U000000B8',\n\t\"CenterDot;\": '\\U000000B7',\n\t\"Cfr;\": '\\U0000212D',\n\t\"Chi;\": '\\U000003A7',\n\t\"CircleDot;\": '\\U00002299',\n\t\"CircleMinus;\": '\\U00002296',\n\t\"CirclePlus;\": '\\U00002295',\n\t\"CircleTimes;\": '\\U00002297',\n\t\"ClockwiseContourIntegral;\": '\\U00002232',\n\t\"CloseCurlyDoubleQuote;\": '\\U0000201D',\n\t\"CloseCurlyQuote;\": '\\U00002019',\n\t\"Colon;\": '\\U00002237',\n\t\"Colone;\": '\\U00002A74',\n\t\"Congruent;\": '\\U00002261',\n\t\"Conint;\": '\\U0000222F',\n\t\"ContourIntegral;\": '\\U0000222E',\n\t\"Copf;\": '\\U00002102',\n\t\"Coproduct;\": '\\U00002210',\n\t\"CounterClockwiseContourIntegral;\": '\\U00002233',\n\t\"Cross;\": '\\U00002A2F',\n\t\"Cscr;\": '\\U0001D49E',\n\t\"Cup;\": '\\U000022D3',\n\t\"CupCap;\": '\\U0000224D',\n\t\"DD;\": '\\U00002145',\n\t\"DDotrahd;\": '\\U00002911',\n\t\"DJcy;\": '\\U00000402',\n\t\"DScy;\": '\\U00000405',\n\t\"DZcy;\": '\\U0000040F',\n\t\"Dagger;\": '\\U00002021',\n\t\"Darr;\": '\\U000021A1',\n\t\"Dashv;\": '\\U00002AE4',\n\t\"Dcaron;\": '\\U0000010E',\n\t\"Dcy;\": '\\U00000414',\n\t\"Del;\": '\\U00002207',\n\t\"Delta;\": '\\U00000394',\n\t\"Dfr;\": '\\U0001D507',\n\t\"DiacriticalAcute;\": '\\U000000B4',\n\t\"DiacriticalDot;\": '\\U000002D9',\n\t\"DiacriticalDoubleAcute;\": '\\U000002DD',\n\t\"DiacriticalGrave;\": '\\U00000060',\n\t\"DiacriticalTilde;\": '\\U000002DC',\n\t\"Diamond;\": '\\U000022C4',\n\t\"DifferentialD;\": '\\U00002146',\n\t\"Dopf;\": '\\U0001D53B',\n\t\"Dot;\": '\\U000000A8',\n\t\"DotDot;\": '\\U000020DC',\n\t\"DotEqual;\": '\\U00002250',\n\t\"DoubleContourIntegral;\": '\\U0000222F',\n\t\"DoubleDot;\": '\\U000000A8',\n\t\"DoubleDownArrow;\": '\\U000021D3',\n\t\"DoubleLeftArrow;\": '\\U000021D0',\n\t\"DoubleLeftRightArrow;\": '\\U000021D4',\n\t\"DoubleLeftTee;\": '\\U00002AE4',\n\t\"DoubleLongLeftArrow;\": '\\U000027F8',\n\t\"DoubleLongLeftRightArrow;\": '\\U000027FA',\n\t\"DoubleLongRightArrow;\": '\\U000027F9',\n\t\"DoubleRightArrow;\": '\\U000021D2',\n\t\"DoubleRightTee;\": '\\U000022A8',\n\t\"DoubleUpArrow;\": '\\U000021D1',\n\t\"DoubleUpDownArrow;\": '\\U000021D5',\n\t\"DoubleVerticalBar;\": '\\U00002225',\n\t\"DownArrow;\": '\\U00002193',\n\t\"DownArrowBar;\": '\\U00002913',\n\t\"DownArrowUpArrow;\": '\\U000021F5',\n\t\"DownBreve;\": '\\U00000311',\n\t\"DownLeftRightVector;\": '\\U00002950',\n\t\"DownLeftTeeVector;\": '\\U0000295E',\n\t\"DownLeftVector;\": '\\U000021BD',\n\t\"DownLeftVectorBar;\": '\\U00002956',\n\t\"DownRightTeeVector;\": '\\U0000295F',\n\t\"DownRightVector;\": '\\U000021C1',\n\t\"DownRightVectorBar;\": '\\U00002957',\n\t\"DownTee;\": '\\U000022A4',\n\t\"DownTeeArrow;\": '\\U000021A7',\n\t\"Downarrow;\": '\\U000021D3',\n\t\"Dscr;\": '\\U0001D49F',\n\t\"Dstrok;\": '\\U00000110',\n\t\"ENG;\": '\\U0000014A',\n\t\"ETH;\": '\\U000000D0',\n\t\"Eacute;\": '\\U000000C9',\n\t\"Ecaron;\": '\\U0000011A',\n\t\"Ecirc;\": '\\U000000CA',\n\t\"Ecy;\": '\\U0000042D',\n\t\"Edot;\": '\\U00000116',\n\t\"Efr;\": '\\U0001D508',\n\t\"Egrave;\": '\\U000000C8',\n\t\"Element;\": '\\U00002208',\n\t\"Emacr;\": '\\U00000112',\n\t\"EmptySmallSquare;\": '\\U000025FB',\n\t\"EmptyVerySmallSquare;\": '\\U000025AB',\n\t\"Eogon;\": '\\U00000118',\n\t\"Eopf;\": '\\U0001D53C',\n\t\"Epsilon;\": '\\U00000395',\n\t\"Equal;\": '\\U00002A75',\n\t\"EqualTilde;\": '\\U00002242',\n\t\"Equilibrium;\": '\\U000021CC',\n\t\"Escr;\": '\\U00002130',\n\t\"Esim;\": '\\U00002A73',\n\t\"Eta;\": '\\U00000397',\n\t\"Euml;\": '\\U000000CB',\n\t\"Exists;\": '\\U00002203',\n\t\"ExponentialE;\": '\\U00002147',\n\t\"Fcy;\": '\\U00000424',\n\t\"Ffr;\": '\\U0001D509',\n\t\"FilledSmallSquare;\": '\\U000025FC',\n\t\"FilledVerySmallSquare;\": '\\U000025AA',\n\t\"Fopf;\": '\\U0001D53D',\n\t\"ForAll;\": '\\U00002200',\n\t\"Fouriertrf;\": '\\U00002131',\n\t\"Fscr;\": '\\U00002131',\n\t\"GJcy;\": '\\U00000403',\n\t\"GT;\": '\\U0000003E',\n\t\"Gamma;\": '\\U00000393',\n\t\"Gammad;\": '\\U000003DC',\n\t\"Gbreve;\": '\\U0000011E',\n\t\"Gcedil;\": '\\U00000122',\n\t\"Gcirc;\": '\\U0000011C',\n\t\"Gcy;\": '\\U00000413',\n\t\"Gdot;\": '\\U00000120',\n\t\"Gfr;\": '\\U0001D50A',\n\t\"Gg;\": '\\U000022D9',\n\t\"Gopf;\": '\\U0001D53E',\n\t\"GreaterEqual;\": '\\U00002265',\n\t\"GreaterEqualLess;\": '\\U000022DB',\n\t\"GreaterFullEqual;\": '\\U00002267',\n\t\"GreaterGreater;\": '\\U00002AA2',\n\t\"GreaterLess;\": '\\U00002277',\n\t\"GreaterSlantEqual;\": '\\U00002A7E',\n\t\"GreaterTilde;\": '\\U00002273',\n\t\"Gscr;\": '\\U0001D4A2',\n\t\"Gt;\": '\\U0000226B',\n\t\"HARDcy;\": '\\U0000042A',\n\t\"Hacek;\": '\\U000002C7',\n\t\"Hat;\": '\\U0000005E',\n\t\"Hcirc;\": '\\U00000124',\n\t\"Hfr;\": '\\U0000210C',\n\t\"HilbertSpace;\": '\\U0000210B',\n\t\"Hopf;\": '\\U0000210D',\n\t\"HorizontalLine;\": '\\U00002500',\n\t\"Hscr;\": '\\U0000210B',\n\t\"Hstrok;\": '\\U00000126',\n\t\"HumpDownHump;\": '\\U0000224E',\n\t\"HumpEqual;\": '\\U0000224F',\n\t\"IEcy;\": '\\U00000415',\n\t\"IJlig;\": '\\U00000132',\n\t\"IOcy;\": '\\U00000401',\n\t\"Iacute;\": '\\U000000CD',\n\t\"Icirc;\": '\\U000000CE',\n\t\"Icy;\": '\\U00000418',\n\t\"Idot;\": '\\U00000130',\n\t\"Ifr;\": '\\U00002111',\n\t\"Igrave;\": '\\U000000CC',\n\t\"Im;\": '\\U00002111',\n\t\"Imacr;\": '\\U0000012A',\n\t\"ImaginaryI;\": '\\U00002148',\n\t\"Implies;\": '\\U000021D2',\n\t\"Int;\": '\\U0000222C',\n\t\"Integral;\": '\\U0000222B',\n\t\"Intersection;\": '\\U000022C2',\n\t\"InvisibleComma;\": '\\U00002063',\n\t\"InvisibleTimes;\": '\\U00002062',\n\t\"Iogon;\": '\\U0000012E',\n\t\"Iopf;\": '\\U0001D540',\n\t\"Iota;\": '\\U00000399',\n\t\"Iscr;\": '\\U00002110',\n\t\"Itilde;\": '\\U00000128',\n\t\"Iukcy;\": '\\U00000406',\n\t\"Iuml;\": '\\U000000CF',\n\t\"Jcirc;\": '\\U00000134',\n\t\"Jcy;\": '\\U00000419',\n\t\"Jfr;\": '\\U0001D50D',\n\t\"Jopf;\": '\\U0001D541',\n\t\"Jscr;\": '\\U0001D4A5',\n\t\"Jsercy;\": '\\U00000408',\n\t\"Jukcy;\": '\\U00000404',\n\t\"KHcy;\": '\\U00000425',\n\t\"KJcy;\": '\\U0000040C',\n\t\"Kappa;\": '\\U0000039A',\n\t\"Kcedil;\": '\\U00000136',\n\t\"Kcy;\": '\\U0000041A',\n\t\"Kfr;\": '\\U0001D50E',\n\t\"Kopf;\": '\\U0001D542',\n\t\"Kscr;\": '\\U0001D4A6',\n\t\"LJcy;\": '\\U00000409',\n\t\"LT;\": '\\U0000003C',\n\t\"Lacute;\": '\\U00000139',\n\t\"Lambda;\": '\\U0000039B',\n\t\"Lang;\": '\\U000027EA',\n\t\"Laplacetrf;\": '\\U00002112',\n\t\"Larr;\": '\\U0000219E',\n\t\"Lcaron;\": '\\U0000013D',\n\t\"Lcedil;\": '\\U0000013B',\n\t\"Lcy;\": '\\U0000041B',\n\t\"LeftAngleBracket;\": '\\U000027E8',\n\t\"LeftArrow;\": '\\U00002190',\n\t\"LeftArrowBar;\": '\\U000021E4',\n\t\"LeftArrowRightArrow;\": '\\U000021C6',\n\t\"LeftCeiling;\": '\\U00002308',\n\t\"LeftDoubleBracket;\": '\\U000027E6',\n\t\"LeftDownTeeVector;\": '\\U00002961',\n\t\"LeftDownVector;\": '\\U000021C3',\n\t\"LeftDownVectorBar;\": '\\U00002959',\n\t\"LeftFloor;\": '\\U0000230A',\n\t\"LeftRightArrow;\": '\\U00002194',\n\t\"LeftRightVector;\": '\\U0000294E',\n\t\"LeftTee;\": '\\U000022A3',\n\t\"LeftTeeArrow;\": '\\U000021A4',\n\t\"LeftTeeVector;\": '\\U0000295A',\n\t\"LeftTriangle;\": '\\U000022B2',\n\t\"LeftTriangleBar;\": '\\U000029CF',\n\t\"LeftTriangleEqual;\": '\\U000022B4',\n\t\"LeftUpDownVector;\": '\\U00002951',\n\t\"LeftUpTeeVector;\": '\\U00002960',\n\t\"LeftUpVector;\": '\\U000021BF',\n\t\"LeftUpVectorBar;\": '\\U00002958',\n\t\"LeftVector;\": '\\U000021BC',\n\t\"LeftVectorBar;\": '\\U00002952',\n\t\"Leftarrow;\": '\\U000021D0',\n\t\"Leftrightarrow;\": '\\U000021D4',\n\t\"LessEqualGreater;\": '\\U000022DA',\n\t\"LessFullEqual;\": '\\U00002266',\n\t\"LessGreater;\": '\\U00002276',\n\t\"LessLess;\": '\\U00002AA1',\n\t\"LessSlantEqual;\": '\\U00002A7D',\n\t\"LessTilde;\": '\\U00002272',\n\t\"Lfr;\": '\\U0001D50F',\n\t\"Ll;\": '\\U000022D8',\n\t\"Lleftarrow;\": '\\U000021DA',\n\t\"Lmidot;\": '\\U0000013F',\n\t\"LongLeftArrow;\": '\\U000027F5',\n\t\"LongLeftRightArrow;\": '\\U000027F7',\n\t\"LongRightArrow;\": '\\U000027F6',\n\t\"Longleftarrow;\": '\\U000027F8',\n\t\"Longleftrightarrow;\": '\\U000027FA',\n\t\"Longrightarrow;\": '\\U000027F9',\n\t\"Lopf;\": '\\U0001D543',\n\t\"LowerLeftArrow;\": '\\U00002199',\n\t\"LowerRightArrow;\": '\\U00002198',\n\t\"Lscr;\": '\\U00002112',\n\t\"Lsh;\": '\\U000021B0',\n\t\"Lstrok;\": '\\U00000141',\n\t\"Lt;\": '\\U0000226A',\n\t\"Map;\": '\\U00002905',\n\t\"Mcy;\": '\\U0000041C',\n\t\"MediumSpace;\": '\\U0000205F',\n\t\"Mellintrf;\": '\\U00002133',\n\t\"Mfr;\": '\\U0001D510',\n\t\"MinusPlus;\": '\\U00002213',\n\t\"Mopf;\": '\\U0001D544',\n\t\"Mscr;\": '\\U00002133',\n\t\"Mu;\": '\\U0000039C',\n\t\"NJcy;\": '\\U0000040A',\n\t\"Nacute;\": '\\U00000143',\n\t\"Ncaron;\": '\\U00000147',\n\t\"Ncedil;\": '\\U00000145',\n\t\"Ncy;\": '\\U0000041D',\n\t\"NegativeMediumSpace;\": '\\U0000200B',\n\t\"NegativeThickSpace;\": '\\U0000200B',\n\t\"NegativeThinSpace;\": '\\U0000200B',\n\t\"NegativeVeryThinSpace;\": '\\U0000200B',\n\t\"NestedGreaterGreater;\": '\\U0000226B',\n\t\"NestedLessLess;\": '\\U0000226A',\n\t\"NewLine;\": '\\U0000000A',\n\t\"Nfr;\": '\\U0001D511',\n\t\"NoBreak;\": '\\U00002060',\n\t\"NonBreakingSpace;\": '\\U000000A0',\n\t\"Nopf;\": '\\U00002115',\n\t\"Not;\": '\\U00002AEC',\n\t\"NotCongruent;\": '\\U00002262',\n\t\"NotCupCap;\": '\\U0000226D',\n\t\"NotDoubleVerticalBar;\": '\\U00002226',\n\t\"NotElement;\": '\\U00002209',\n\t\"NotEqual;\": '\\U00002260',\n\t\"NotExists;\": '\\U00002204',\n\t\"NotGreater;\": '\\U0000226F',\n\t\"NotGreaterEqual;\": '\\U00002271',\n\t\"NotGreaterLess;\": '\\U00002279',\n\t\"NotGreaterTilde;\": '\\U00002275',\n\t\"NotLeftTriangle;\": '\\U000022EA',\n\t\"NotLeftTriangleEqual;\": '\\U000022EC',\n\t\"NotLess;\": '\\U0000226E',\n\t\"NotLessEqual;\": '\\U00002270',\n\t\"NotLessGreater;\": '\\U00002278',\n\t\"NotLessTilde;\": '\\U00002274',\n\t\"NotPrecedes;\": '\\U00002280',\n\t\"NotPrecedesSlantEqual;\": '\\U000022E0',\n\t\"NotReverseElement;\": '\\U0000220C',\n\t\"NotRightTriangle;\": '\\U000022EB',\n\t\"NotRightTriangleEqual;\": '\\U000022ED',\n\t\"NotSquareSubsetEqual;\": '\\U000022E2',\n\t\"NotSquareSupersetEqual;\": '\\U000022E3',\n\t\"NotSubsetEqual;\": '\\U00002288',\n\t\"NotSucceeds;\": '\\U00002281',\n\t\"NotSucceedsSlantEqual;\": '\\U000022E1',\n\t\"NotSupersetEqual;\": '\\U00002289',\n\t\"NotTilde;\": '\\U00002241',\n\t\"NotTildeEqual;\": '\\U00002244',\n\t\"NotTildeFullEqual;\": '\\U00002247',\n\t\"NotTildeTilde;\": '\\U00002249',\n\t\"NotVerticalBar;\": '\\U00002224',\n\t\"Nscr;\": '\\U0001D4A9',\n\t\"Ntilde;\": '\\U000000D1',\n\t\"Nu;\": '\\U0000039D',\n\t\"OElig;\": '\\U00000152',\n\t\"Oacute;\": '\\U000000D3',\n\t\"Ocirc;\": '\\U000000D4',\n\t\"Ocy;\": '\\U0000041E',\n\t\"Odblac;\": '\\U00000150',\n\t\"Ofr;\": '\\U0001D512',\n\t\"Ograve;\": '\\U000000D2',\n\t\"Omacr;\": '\\U0000014C',\n\t\"Omega;\": '\\U000003A9',\n\t\"Omicron;\": '\\U0000039F',\n\t\"Oopf;\": '\\U0001D546',\n\t\"OpenCurlyDoubleQuote;\": '\\U0000201C',\n\t\"OpenCurlyQuote;\": '\\U00002018',\n\t\"Or;\": '\\U00002A54',\n\t\"Oscr;\": '\\U0001D4AA',\n\t\"Oslash;\": '\\U000000D8',\n\t\"Otilde;\": '\\U000000D5',\n\t\"Otimes;\": '\\U00002A37',\n\t\"Ouml;\": '\\U000000D6',\n\t\"OverBar;\": '\\U0000203E',\n\t\"OverBrace;\": '\\U000023DE',\n\t\"OverBracket;\": '\\U000023B4',\n\t\"OverParenthesis;\": '\\U000023DC',\n\t\"PartialD;\": '\\U00002202',\n\t\"Pcy;\": '\\U0000041F',\n\t\"Pfr;\": '\\U0001D513',\n\t\"Phi;\": '\\U000003A6',\n\t\"Pi;\": '\\U000003A0',\n\t\"PlusMinus;\": '\\U000000B1',\n\t\"Poincareplane;\": '\\U0000210C',\n\t\"Popf;\": '\\U00002119',\n\t\"Pr;\": '\\U00002ABB',\n\t\"Precedes;\": '\\U0000227A',\n\t\"PrecedesEqual;\": '\\U00002AAF',\n\t\"PrecedesSlantEqual;\": '\\U0000227C',\n\t\"PrecedesTilde;\": '\\U0000227E',\n\t\"Prime;\": '\\U00002033',\n\t\"Product;\": '\\U0000220F',\n\t\"Proportion;\": '\\U00002237',\n\t\"Proportional;\": '\\U0000221D',\n\t\"Pscr;\": '\\U0001D4AB',\n\t\"Psi;\": '\\U000003A8',\n\t\"QUOT;\": '\\U00000022',\n\t\"Qfr;\": '\\U0001D514',\n\t\"Qopf;\": '\\U0000211A',\n\t\"Qscr;\": '\\U0001D4AC',\n\t\"RBarr;\": '\\U00002910',\n\t\"REG;\": '\\U000000AE',\n\t\"Racute;\": '\\U00000154',\n\t\"Rang;\": '\\U000027EB',\n\t\"Rarr;\": '\\U000021A0',\n\t\"Rarrtl;\": '\\U00002916',\n\t\"Rcaron;\": '\\U00000158',\n\t\"Rcedil;\": '\\U00000156',\n\t\"Rcy;\": '\\U00000420',\n\t\"Re;\": '\\U0000211C',\n\t\"ReverseElement;\": '\\U0000220B',\n\t\"ReverseEquilibrium;\": '\\U000021CB',\n\t\"ReverseUpEquilibrium;\": '\\U0000296F',\n\t\"Rfr;\": '\\U0000211C',\n\t\"Rho;\": '\\U000003A1',\n\t\"RightAngleBracket;\": '\\U000027E9',\n\t\"RightArrow;\": '\\U00002192',\n\t\"RightArrowBar;\": '\\U000021E5',\n\t\"RightArrowLeftArrow;\": '\\U000021C4',\n\t\"RightCeiling;\": '\\U00002309',\n\t\"RightDoubleBracket;\": '\\U000027E7',\n\t\"RightDownTeeVector;\": '\\U0000295D',\n\t\"RightDownVector;\": '\\U000021C2',\n\t\"RightDownVectorBar;\": '\\U00002955',\n\t\"RightFloor;\": '\\U0000230B',\n\t\"RightTee;\": '\\U000022A2',\n\t\"RightTeeArrow;\": '\\U000021A6',\n\t\"RightTeeVector;\": '\\U0000295B',\n\t\"RightTriangle;\": '\\U000022B3',\n\t\"RightTriangleBar;\": '\\U000029D0',\n\t\"RightTriangleEqual;\": '\\U000022B5',\n\t\"RightUpDownVector;\": '\\U0000294F',\n\t\"RightUpTeeVector;\": '\\U0000295C',\n\t\"RightUpVector;\": '\\U000021BE',\n\t\"RightUpVectorBar;\": '\\U00002954',\n\t\"RightVector;\": '\\U000021C0',\n\t\"RightVectorBar;\": '\\U00002953',\n\t\"Rightarrow;\": '\\U000021D2',\n\t\"Ropf;\": '\\U0000211D',\n\t\"RoundImplies;\": '\\U00002970',\n\t\"Rrightarrow;\": '\\U000021DB',\n\t\"Rscr;\": '\\U0000211B',\n\t\"Rsh;\": '\\U000021B1',\n\t\"RuleDelayed;\": '\\U000029F4',\n\t\"SHCHcy;\": '\\U00000429',\n\t\"SHcy;\": '\\U00000428',\n\t\"SOFTcy;\": '\\U0000042C',\n\t\"Sacute;\": '\\U0000015A',\n\t\"Sc;\": '\\U00002ABC',\n\t\"Scaron;\": '\\U00000160',\n\t\"Scedil;\": '\\U0000015E',\n\t\"Scirc;\": '\\U0000015C',\n\t\"Scy;\": '\\U00000421',\n\t\"Sfr;\": '\\U0001D516',\n\t\"ShortDownArrow;\": '\\U00002193',\n\t\"ShortLeftArrow;\": '\\U00002190',\n\t\"ShortRightArrow;\": '\\U00002192',\n\t\"ShortUpArrow;\": '\\U00002191',\n\t\"Sigma;\": '\\U000003A3',\n\t\"SmallCircle;\": '\\U00002218',\n\t\"Sopf;\": '\\U0001D54A',\n\t\"Sqrt;\": '\\U0000221A',\n\t\"Square;\": '\\U000025A1',\n\t\"SquareIntersection;\": '\\U00002293',\n\t\"SquareSubset;\": '\\U0000228F',\n\t\"SquareSubsetEqual;\": '\\U00002291',\n\t\"SquareSuperset;\": '\\U00002290',\n\t\"SquareSupersetEqual;\": '\\U00002292',\n\t\"SquareUnion;\": '\\U00002294',\n\t\"Sscr;\": '\\U0001D4AE',\n\t\"Star;\": '\\U000022C6',\n\t\"Sub;\": '\\U000022D0',\n\t\"Subset;\": '\\U000022D0',\n\t\"SubsetEqual;\": '\\U00002286',\n\t\"Succeeds;\": '\\U0000227B',\n\t\"SucceedsEqual;\": '\\U00002AB0',\n\t\"SucceedsSlantEqual;\": '\\U0000227D',\n\t\"SucceedsTilde;\": '\\U0000227F',\n\t\"SuchThat;\": '\\U0000220B',\n\t\"Sum;\": '\\U00002211',\n\t\"Sup;\": '\\U000022D1',\n\t\"Superset;\": '\\U00002283',\n\t\"SupersetEqual;\": '\\U00002287',\n\t\"Supset;\": '\\U000022D1',\n\t\"THORN;\": '\\U000000DE',\n\t\"TRADE;\": '\\U00002122',\n\t\"TSHcy;\": '\\U0000040B',\n\t\"TScy;\": '\\U00000426',\n\t\"Tab;\": '\\U00000009',\n\t\"Tau;\": '\\U000003A4',\n\t\"Tcaron;\": '\\U00000164',\n\t\"Tcedil;\": '\\U00000162',\n\t\"Tcy;\": '\\U00000422',\n\t\"Tfr;\": '\\U0001D517',\n\t\"Therefore;\": '\\U00002234',\n\t\"Theta;\": '\\U00000398',\n\t\"ThinSpace;\": '\\U00002009',\n\t\"Tilde;\": '\\U0000223C',\n\t\"TildeEqual;\": '\\U00002243',\n\t\"TildeFullEqual;\": '\\U00002245',\n\t\"TildeTilde;\": '\\U00002248',\n\t\"Topf;\": '\\U0001D54B',\n\t\"TripleDot;\": '\\U000020DB',\n\t\"Tscr;\": '\\U0001D4AF',\n\t\"Tstrok;\": '\\U00000166',\n\t\"Uacute;\": '\\U000000DA',\n\t\"Uarr;\": '\\U0000219F',\n\t\"Uarrocir;\": '\\U00002949',\n\t\"Ubrcy;\": '\\U0000040E',\n\t\"Ubreve;\": '\\U0000016C',\n\t\"Ucirc;\": '\\U000000DB',\n\t\"Ucy;\": '\\U00000423',\n\t\"Udblac;\": '\\U00000170',\n\t\"Ufr;\": '\\U0001D518',\n\t\"Ugrave;\": '\\U000000D9',\n\t\"Umacr;\": '\\U0000016A',\n\t\"UnderBar;\": '\\U0000005F',\n\t\"UnderBrace;\": '\\U000023DF',\n\t\"UnderBracket;\": '\\U000023B5',\n\t\"UnderParenthesis;\": '\\U000023DD',\n\t\"Union;\": '\\U000022C3',\n\t\"UnionPlus;\": '\\U0000228E',\n\t\"Uogon;\": '\\U00000172',\n\t\"Uopf;\": '\\U0001D54C',\n\t\"UpArrow;\": '\\U00002191',\n\t\"UpArrowBar;\": '\\U00002912',\n\t\"UpArrowDownArrow;\": '\\U000021C5',\n\t\"UpDownArrow;\": '\\U00002195',\n\t\"UpEquilibrium;\": '\\U0000296E',\n\t\"UpTee;\": '\\U000022A5',\n\t\"UpTeeArrow;\": '\\U000021A5',\n\t\"Uparrow;\": '\\U000021D1',\n\t\"Updownarrow;\": '\\U000021D5',\n\t\"UpperLeftArrow;\": '\\U00002196',\n\t\"UpperRightArrow;\": '\\U00002197',\n\t\"Upsi;\": '\\U000003D2',\n\t\"Upsilon;\": '\\U000003A5',\n\t\"Uring;\": '\\U0000016E',\n\t\"Uscr;\": '\\U0001D4B0',\n\t\"Utilde;\": '\\U00000168',\n\t\"Uuml;\": '\\U000000DC',\n\t\"VDash;\": '\\U000022AB',\n\t\"Vbar;\": '\\U00002AEB',\n\t\"Vcy;\": '\\U00000412',\n\t\"Vdash;\": '\\U000022A9',\n\t\"Vdashl;\": '\\U00002AE6',\n\t\"Vee;\": '\\U000022C1',\n\t\"Verbar;\": '\\U00002016',\n\t\"Vert;\": '\\U00002016',\n\t\"VerticalBar;\": '\\U00002223',\n\t\"VerticalLine;\": '\\U0000007C',\n\t\"VerticalSeparator;\": '\\U00002758',\n\t\"VerticalTilde;\": '\\U00002240',\n\t\"VeryThinSpace;\": '\\U0000200A',\n\t\"Vfr;\": '\\U0001D519',\n\t\"Vopf;\": '\\U0001D54D',\n\t\"Vscr;\": '\\U0001D4B1',\n\t\"Vvdash;\": '\\U000022AA',\n\t\"Wcirc;\": '\\U00000174',\n\t\"Wedge;\": '\\U000022C0',\n\t\"Wfr;\": '\\U0001D51A',\n\t\"Wopf;\": '\\U0001D54E',\n\t\"Wscr;\": '\\U0001D4B2',\n\t\"Xfr;\": '\\U0001D51B',\n\t\"Xi;\": '\\U0000039E',\n\t\"Xopf;\": '\\U0001D54F',\n\t\"Xscr;\": '\\U0001D4B3',\n\t\"YAcy;\": '\\U0000042F',\n\t\"YIcy;\": '\\U00000407',\n\t\"YUcy;\": '\\U0000042E',\n\t\"Yacute;\": '\\U000000DD',\n\t\"Ycirc;\": '\\U00000176',\n\t\"Ycy;\": '\\U0000042B',\n\t\"Yfr;\": '\\U0001D51C',\n\t\"Yopf;\": '\\U0001D550',\n\t\"Yscr;\": '\\U0001D4B4',\n\t\"Yuml;\": '\\U00000178',\n\t\"ZHcy;\": '\\U00000416',\n\t\"Zacute;\": '\\U00000179',\n\t\"Zcaron;\": '\\U0000017D',\n\t\"Zcy;\": '\\U00000417',\n\t\"Zdot;\": '\\U0000017B',\n\t\"ZeroWidthSpace;\": '\\U0000200B',\n\t\"Zeta;\": '\\U00000396',\n\t\"Zfr;\": '\\U00002128',\n\t\"Zopf;\": '\\U00002124',\n\t\"Zscr;\": '\\U0001D4B5',\n\t\"aacute;\": '\\U000000E1',\n\t\"abreve;\": '\\U00000103',\n\t\"ac;\": '\\U0000223E',\n\t\"acd;\": '\\U0000223F',\n\t\"acirc;\": '\\U000000E2',\n\t\"acute;\": '\\U000000B4',\n\t\"acy;\": '\\U00000430',\n\t\"aelig;\": '\\U000000E6',\n\t\"af;\": '\\U00002061',\n\t\"afr;\": '\\U0001D51E',\n\t\"agrave;\": '\\U000000E0',\n\t\"alefsym;\": '\\U00002135',\n\t\"aleph;\": '\\U00002135',\n\t\"alpha;\": '\\U000003B1',\n\t\"amacr;\": '\\U00000101',\n\t\"amalg;\": '\\U00002A3F',\n\t\"amp;\": '\\U00000026',\n\t\"and;\": '\\U00002227',\n\t\"andand;\": '\\U00002A55',\n\t\"andd;\": '\\U00002A5C',\n\t\"andslope;\": '\\U00002A58',\n\t\"andv;\": '\\U00002A5A',\n\t\"ang;\": '\\U00002220',\n\t\"ange;\": '\\U000029A4',\n\t\"angle;\": '\\U00002220',\n\t\"angmsd;\": '\\U00002221',\n\t\"angmsdaa;\": '\\U000029A8',\n\t\"angmsdab;\": '\\U000029A9',\n\t\"angmsdac;\": '\\U000029AA',\n\t\"angmsdad;\": '\\U000029AB',\n\t\"angmsdae;\": '\\U000029AC',\n\t\"angmsdaf;\": '\\U000029AD',\n\t\"angmsdag;\": '\\U000029AE',\n\t\"angmsdah;\": '\\U000029AF',\n\t\"angrt;\": '\\U0000221F',\n\t\"angrtvb;\": '\\U000022BE',\n\t\"angrtvbd;\": '\\U0000299D',\n\t\"angsph;\": '\\U00002222',\n\t\"angst;\": '\\U000000C5',\n\t\"angzarr;\": '\\U0000237C',\n\t\"aogon;\": '\\U00000105',\n\t\"aopf;\": '\\U0001D552',\n\t\"ap;\": '\\U00002248',\n\t\"apE;\": '\\U00002A70',\n\t\"apacir;\": '\\U00002A6F',\n\t\"ape;\": '\\U0000224A',\n\t\"apid;\": '\\U0000224B',\n\t\"apos;\": '\\U00000027',\n\t\"approx;\": '\\U00002248',\n\t\"approxeq;\": '\\U0000224A',\n\t\"aring;\": '\\U000000E5',\n\t\"ascr;\": '\\U0001D4B6',\n\t\"ast;\": '\\U0000002A',\n\t\"asymp;\": '\\U00002248',\n\t\"asympeq;\": '\\U0000224D',\n\t\"atilde;\": '\\U000000E3',\n\t\"auml;\": '\\U000000E4',\n\t\"awconint;\": '\\U00002233',\n\t\"awint;\": '\\U00002A11',\n\t\"bNot;\": '\\U00002AED',\n\t\"backcong;\": '\\U0000224C',\n\t\"backepsilon;\": '\\U000003F6',\n\t\"backprime;\": '\\U00002035',\n\t\"backsim;\": '\\U0000223D',\n\t\"backsimeq;\": '\\U000022CD',\n\t\"barvee;\": '\\U000022BD',\n\t\"barwed;\": '\\U00002305',\n\t\"barwedge;\": '\\U00002305',\n\t\"bbrk;\": '\\U000023B5',\n\t\"bbrktbrk;\": '\\U000023B6',\n\t\"bcong;\": '\\U0000224C',\n\t\"bcy;\": '\\U00000431',\n\t\"bdquo;\": '\\U0000201E',\n\t\"becaus;\": '\\U00002235',\n\t\"because;\": '\\U00002235',\n\t\"bemptyv;\": '\\U000029B0',\n\t\"bepsi;\": '\\U000003F6',\n\t\"bernou;\": '\\U0000212C',\n\t\"beta;\": '\\U000003B2',\n\t\"beth;\": '\\U00002136',\n\t\"between;\": '\\U0000226C',\n\t\"bfr;\": '\\U0001D51F',\n\t\"bigcap;\": '\\U000022C2',\n\t\"bigcirc;\": '\\U000025EF',\n\t\"bigcup;\": '\\U000022C3',\n\t\"bigodot;\": '\\U00002A00',\n\t\"bigoplus;\": '\\U00002A01',\n\t\"bigotimes;\": '\\U00002A02',\n\t\"bigsqcup;\": '\\U00002A06',\n\t\"bigstar;\": '\\U00002605',\n\t\"bigtriangledown;\": '\\U000025BD',\n\t\"bigtriangleup;\": '\\U000025B3',\n\t\"biguplus;\": '\\U00002A04',\n\t\"bigvee;\": '\\U000022C1',\n\t\"bigwedge;\": '\\U000022C0',\n\t\"bkarow;\": '\\U0000290D',\n\t\"blacklozenge;\": '\\U000029EB',\n\t\"blacksquare;\": '\\U000025AA',\n\t\"blacktriangle;\": '\\U000025B4',\n\t\"blacktriangledown;\": '\\U000025BE',\n\t\"blacktriangleleft;\": '\\U000025C2',\n\t\"blacktriangleright;\": '\\U000025B8',\n\t\"blank;\": '\\U00002423',\n\t\"blk12;\": '\\U00002592',\n\t\"blk14;\": '\\U00002591',\n\t\"blk34;\": '\\U00002593',\n\t\"block;\": '\\U00002588',\n\t\"bnot;\": '\\U00002310',\n\t\"bopf;\": '\\U0001D553',\n\t\"bot;\": '\\U000022A5',\n\t\"bottom;\": '\\U000022A5',\n\t\"bowtie;\": '\\U000022C8',\n\t\"boxDL;\": '\\U00002557',\n\t\"boxDR;\": '\\U00002554',\n\t\"boxDl;\": '\\U00002556',\n\t\"boxDr;\": '\\U00002553',\n\t\"boxH;\": '\\U00002550',\n\t\"boxHD;\": '\\U00002566',\n\t\"boxHU;\": '\\U00002569',\n\t\"boxHd;\": '\\U00002564',\n\t\"boxHu;\": '\\U00002567',\n\t\"boxUL;\": '\\U0000255D',\n\t\"boxUR;\": '\\U0000255A',\n\t\"boxUl;\": '\\U0000255C',\n\t\"boxUr;\": '\\U00002559',\n\t\"boxV;\": '\\U00002551',\n\t\"boxVH;\": '\\U0000256C',\n\t\"boxVL;\": '\\U00002563',\n\t\"boxVR;\": '\\U00002560',\n\t\"boxVh;\": '\\U0000256B',\n\t\"boxVl;\": '\\U00002562',\n\t\"boxVr;\": '\\U0000255F',\n\t\"boxbox;\": '\\U000029C9',\n\t\"boxdL;\": '\\U00002555',\n\t\"boxdR;\": '\\U00002552',\n\t\"boxdl;\": '\\U00002510',\n\t\"boxdr;\": '\\U0000250C',\n\t\"boxh;\": '\\U00002500',\n\t\"boxhD;\": '\\U00002565',\n\t\"boxhU;\": '\\U00002568',\n\t\"boxhd;\": '\\U0000252C',\n\t\"boxhu;\": '\\U00002534',\n\t\"boxminus;\": '\\U0000229F',\n\t\"boxplus;\": '\\U0000229E',\n\t\"boxtimes;\": '\\U000022A0',\n\t\"boxuL;\": '\\U0000255B',\n\t\"boxuR;\": '\\U00002558',\n\t\"boxul;\": '\\U00002518',\n\t\"boxur;\": '\\U00002514',\n\t\"boxv;\": '\\U00002502',\n\t\"boxvH;\": '\\U0000256A',\n\t\"boxvL;\": '\\U00002561',\n\t\"boxvR;\": '\\U0000255E',\n\t\"boxvh;\": '\\U0000253C',\n\t\"boxvl;\": '\\U00002524',\n\t\"boxvr;\": '\\U0000251C',\n\t\"bprime;\": '\\U00002035',\n\t\"breve;\": '\\U000002D8',\n\t\"brvbar;\": '\\U000000A6',\n\t\"bscr;\": '\\U0001D4B7',\n\t\"bsemi;\": '\\U0000204F',\n\t\"bsim;\": '\\U0000223D',\n\t\"bsime;\": '\\U000022CD',\n\t\"bsol;\": '\\U0000005C',\n\t\"bsolb;\": '\\U000029C5',\n\t\"bsolhsub;\": '\\U000027C8',\n\t\"bull;\": '\\U00002022',\n\t\"bullet;\": '\\U00002022',\n\t\"bump;\": '\\U0000224E',\n\t\"bumpE;\": '\\U00002AAE',\n\t\"bumpe;\": '\\U0000224F',\n\t\"bumpeq;\": '\\U0000224F',\n\t\"cacute;\": '\\U00000107',\n\t\"cap;\": '\\U00002229',\n\t\"capand;\": '\\U00002A44',\n\t\"capbrcup;\": '\\U00002A49',\n\t\"capcap;\": '\\U00002A4B',\n\t\"capcup;\": '\\U00002A47',\n\t\"capdot;\": '\\U00002A40',\n\t\"caret;\": '\\U00002041',\n\t\"caron;\": '\\U000002C7',\n\t\"ccaps;\": '\\U00002A4D',\n\t\"ccaron;\": '\\U0000010D',\n\t\"ccedil;\": '\\U000000E7',\n\t\"ccirc;\": '\\U00000109',\n\t\"ccups;\": '\\U00002A4C',\n\t\"ccupssm;\": '\\U00002A50',\n\t\"cdot;\": '\\U0000010B',\n\t\"cedil;\": '\\U000000B8',\n\t\"cemptyv;\": '\\U000029B2',\n\t\"cent;\": '\\U000000A2',\n\t\"centerdot;\": '\\U000000B7',\n\t\"cfr;\": '\\U0001D520',\n\t\"chcy;\": '\\U00000447',\n\t\"check;\": '\\U00002713',\n\t\"checkmark;\": '\\U00002713',\n\t\"chi;\": '\\U000003C7',\n\t\"cir;\": '\\U000025CB',\n\t\"cirE;\": '\\U000029C3',\n\t\"circ;\": '\\U000002C6',\n\t\"circeq;\": '\\U00002257',\n\t\"circlearrowleft;\": '\\U000021BA',\n\t\"circlearrowright;\": '\\U000021BB',\n\t\"circledR;\": '\\U000000AE',\n\t\"circledS;\": '\\U000024C8',\n\t\"circledast;\": '\\U0000229B',\n\t\"circledcirc;\": '\\U0000229A',\n\t\"circleddash;\": '\\U0000229D',\n\t\"cire;\": '\\U00002257',\n\t\"cirfnint;\": '\\U00002A10',\n\t\"cirmid;\": '\\U00002AEF',\n\t\"cirscir;\": '\\U000029C2',\n\t\"clubs;\": '\\U00002663',\n\t\"clubsuit;\": '\\U00002663',\n\t\"colon;\": '\\U0000003A',\n\t\"colone;\": '\\U00002254',\n\t\"coloneq;\": '\\U00002254',\n\t\"comma;\": '\\U0000002C',\n\t\"commat;\": '\\U00000040',\n\t\"comp;\": '\\U00002201',\n\t\"compfn;\": '\\U00002218',\n\t\"complement;\": '\\U00002201',\n\t\"complexes;\": '\\U00002102',\n\t\"cong;\": '\\U00002245',\n\t\"congdot;\": '\\U00002A6D',\n\t\"conint;\": '\\U0000222E',\n\t\"copf;\": '\\U0001D554',\n\t\"coprod;\": '\\U00002210',\n\t\"copy;\": '\\U000000A9',\n\t\"copysr;\": '\\U00002117',\n\t\"crarr;\": '\\U000021B5',\n\t\"cross;\": '\\U00002717',\n\t\"cscr;\": '\\U0001D4B8',\n\t\"csub;\": '\\U00002ACF',\n\t\"csube;\": '\\U00002AD1',\n\t\"csup;\": '\\U00002AD0',\n\t\"csupe;\": '\\U00002AD2',\n\t\"ctdot;\": '\\U000022EF',\n\t\"cudarrl;\": '\\U00002938',\n\t\"cudarrr;\": '\\U00002935',\n\t\"cuepr;\": '\\U000022DE',\n\t\"cuesc;\": '\\U000022DF',\n\t\"cularr;\": '\\U000021B6',\n\t\"cularrp;\": '\\U0000293D',\n\t\"cup;\": '\\U0000222A',\n\t\"cupbrcap;\": '\\U00002A48',\n\t\"cupcap;\": '\\U00002A46',\n\t\"cupcup;\": '\\U00002A4A',\n\t\"cupdot;\": '\\U0000228D',\n\t\"cupor;\": '\\U00002A45',\n\t\"curarr;\": '\\U000021B7',\n\t\"curarrm;\": '\\U0000293C',\n\t\"curlyeqprec;\": '\\U000022DE',\n\t\"curlyeqsucc;\": '\\U000022DF',\n\t\"curlyvee;\": '\\U000022CE',\n\t\"curlywedge;\": '\\U000022CF',\n\t\"curren;\": '\\U000000A4',\n\t\"curvearrowleft;\": '\\U000021B6',\n\t\"curvearrowright;\": '\\U000021B7',\n\t\"cuvee;\": '\\U000022CE',\n\t\"cuwed;\": '\\U000022CF',\n\t\"cwconint;\": '\\U00002232',\n\t\"cwint;\": '\\U00002231',\n\t\"cylcty;\": '\\U0000232D',\n\t\"dArr;\": '\\U000021D3',\n\t\"dHar;\": '\\U00002965',\n\t\"dagger;\": '\\U00002020',\n\t\"daleth;\": '\\U00002138',\n\t\"darr;\": '\\U00002193',\n\t\"dash;\": '\\U00002010',\n\t\"dashv;\": '\\U000022A3',\n\t\"dbkarow;\": '\\U0000290F',\n\t\"dblac;\": '\\U000002DD',\n\t\"dcaron;\": '\\U0000010F',\n\t\"dcy;\": '\\U00000434',\n\t\"dd;\": '\\U00002146',\n\t\"ddagger;\": '\\U00002021',\n\t\"ddarr;\": '\\U000021CA',\n\t\"ddotseq;\": '\\U00002A77',\n\t\"deg;\": '\\U000000B0',\n\t\"delta;\": '\\U000003B4',\n\t\"demptyv;\": '\\U000029B1',\n\t\"dfisht;\": '\\U0000297F',\n\t\"dfr;\": '\\U0001D521',\n\t\"dharl;\": '\\U000021C3',\n\t\"dharr;\": '\\U000021C2',\n\t\"diam;\": '\\U000022C4',\n\t\"diamond;\": '\\U000022C4',\n\t\"diamondsuit;\": '\\U00002666',\n\t\"diams;\": '\\U00002666',\n\t\"die;\": '\\U000000A8',\n\t\"digamma;\": '\\U000003DD',\n\t\"disin;\": '\\U000022F2',\n\t\"div;\": '\\U000000F7',\n\t\"divide;\": '\\U000000F7',\n\t\"divideontimes;\": '\\U000022C7',\n\t\"divonx;\": '\\U000022C7',\n\t\"djcy;\": '\\U00000452',\n\t\"dlcorn;\": '\\U0000231E',\n\t\"dlcrop;\": '\\U0000230D',\n\t\"dollar;\": '\\U00000024',\n\t\"dopf;\": '\\U0001D555',\n\t\"dot;\": '\\U000002D9',\n\t\"doteq;\": '\\U00002250',\n\t\"doteqdot;\": '\\U00002251',\n\t\"dotminus;\": '\\U00002238',\n\t\"dotplus;\": '\\U00002214',\n\t\"dotsquare;\": '\\U000022A1',\n\t\"doublebarwedge;\": '\\U00002306',\n\t\"downarrow;\": '\\U00002193',\n\t\"downdownarrows;\": '\\U000021CA',\n\t\"downharpoonleft;\": '\\U000021C3',\n\t\"downharpoonright;\": '\\U000021C2',\n\t\"drbkarow;\": '\\U00002910',\n\t\"drcorn;\": '\\U0000231F',\n\t\"drcrop;\": '\\U0000230C',\n\t\"dscr;\": '\\U0001D4B9',\n\t\"dscy;\": '\\U00000455',\n\t\"dsol;\": '\\U000029F6',\n\t\"dstrok;\": '\\U00000111',\n\t\"dtdot;\": '\\U000022F1',\n\t\"dtri;\": '\\U000025BF',\n\t\"dtrif;\": '\\U000025BE',\n\t\"duarr;\": '\\U000021F5',\n\t\"duhar;\": '\\U0000296F',\n\t\"dwangle;\": '\\U000029A6',\n\t\"dzcy;\": '\\U0000045F',\n\t\"dzigrarr;\": '\\U000027FF',\n\t\"eDDot;\": '\\U00002A77',\n\t\"eDot;\": '\\U00002251',\n\t\"eacute;\": '\\U000000E9',\n\t\"easter;\": '\\U00002A6E',\n\t\"ecaron;\": '\\U0000011B',\n\t\"ecir;\": '\\U00002256',\n\t\"ecirc;\": '\\U000000EA',\n\t\"ecolon;\": '\\U00002255',\n\t\"ecy;\": '\\U0000044D',\n\t\"edot;\": '\\U00000117',\n\t\"ee;\": '\\U00002147',\n\t\"efDot;\": '\\U00002252',\n\t\"efr;\": '\\U0001D522',\n\t\"eg;\": '\\U00002A9A',\n\t\"egrave;\": '\\U000000E8',\n\t\"egs;\": '\\U00002A96',\n\t\"egsdot;\": '\\U00002A98',\n\t\"el;\": '\\U00002A99',\n\t\"elinters;\": '\\U000023E7',\n\t\"ell;\": '\\U00002113',\n\t\"els;\": '\\U00002A95',\n\t\"elsdot;\": '\\U00002A97',\n\t\"emacr;\": '\\U00000113',\n\t\"empty;\": '\\U00002205',\n\t\"emptyset;\": '\\U00002205',\n\t\"emptyv;\": '\\U00002205',\n\t\"emsp;\": '\\U00002003',\n\t\"emsp13;\": '\\U00002004',\n\t\"emsp14;\": '\\U00002005',\n\t\"eng;\": '\\U0000014B',\n\t\"ensp;\": '\\U00002002',\n\t\"eogon;\": '\\U00000119',\n\t\"eopf;\": '\\U0001D556',\n\t\"epar;\": '\\U000022D5',\n\t\"eparsl;\": '\\U000029E3',\n\t\"eplus;\": '\\U00002A71',\n\t\"epsi;\": '\\U000003B5',\n\t\"epsilon;\": '\\U000003B5',\n\t\"epsiv;\": '\\U000003F5',\n\t\"eqcirc;\": '\\U00002256',\n\t\"eqcolon;\": '\\U00002255',\n\t\"eqsim;\": '\\U00002242',\n\t\"eqslantgtr;\": '\\U00002A96',\n\t\"eqslantless;\": '\\U00002A95',\n\t\"equals;\": '\\U0000003D',\n\t\"equest;\": '\\U0000225F',\n\t\"equiv;\": '\\U00002261',\n\t\"equivDD;\": '\\U00002A78',\n\t\"eqvparsl;\": '\\U000029E5',\n\t\"erDot;\": '\\U00002253',\n\t\"erarr;\": '\\U00002971',\n\t\"escr;\": '\\U0000212F',\n\t\"esdot;\": '\\U00002250',\n\t\"esim;\": '\\U00002242',\n\t\"eta;\": '\\U000003B7',\n\t\"eth;\": '\\U000000F0',\n\t\"euml;\": '\\U000000EB',\n\t\"euro;\": '\\U000020AC',\n\t\"excl;\": '\\U00000021',\n\t\"exist;\": '\\U00002203',\n\t\"expectation;\": '\\U00002130',\n\t\"exponentiale;\": '\\U00002147',\n\t\"fallingdotseq;\": '\\U00002252',\n\t\"fcy;\": '\\U00000444',\n\t\"female;\": '\\U00002640',\n\t\"ffilig;\": '\\U0000FB03',\n\t\"fflig;\": '\\U0000FB00',\n\t\"ffllig;\": '\\U0000FB04',\n\t\"ffr;\": '\\U0001D523',\n\t\"filig;\": '\\U0000FB01',\n\t\"flat;\": '\\U0000266D',\n\t\"fllig;\": '\\U0000FB02',\n\t\"fltns;\": '\\U000025B1',\n\t\"fnof;\": '\\U00000192',\n\t\"fopf;\": '\\U0001D557',\n\t\"forall;\": '\\U00002200',\n\t\"fork;\": '\\U000022D4',\n\t\"forkv;\": '\\U00002AD9',\n\t\"fpartint;\": '\\U00002A0D',\n\t\"frac12;\": '\\U000000BD',\n\t\"frac13;\": '\\U00002153',\n\t\"frac14;\": '\\U000000BC',\n\t\"frac15;\": '\\U00002155',\n\t\"frac16;\": '\\U00002159',\n\t\"frac18;\": '\\U0000215B',\n\t\"frac23;\": '\\U00002154',\n\t\"frac25;\": '\\U00002156',\n\t\"frac34;\": '\\U000000BE',\n\t\"frac35;\": '\\U00002157',\n\t\"frac38;\": '\\U0000215C',\n\t\"frac45;\": '\\U00002158',\n\t\"frac56;\": '\\U0000215A',\n\t\"frac58;\": '\\U0000215D',\n\t\"frac78;\": '\\U0000215E',\n\t\"frasl;\": '\\U00002044',\n\t\"frown;\": '\\U00002322',\n\t\"fscr;\": '\\U0001D4BB',\n\t\"gE;\": '\\U00002267',\n\t\"gEl;\": '\\U00002A8C',\n\t\"gacute;\": '\\U000001F5',\n\t\"gamma;\": '\\U000003B3',\n\t\"gammad;\": '\\U000003DD',\n\t\"gap;\": '\\U00002A86',\n\t\"gbreve;\": '\\U0000011F',\n\t\"gcirc;\": '\\U0000011D',\n\t\"gcy;\": '\\U00000433',\n\t\"gdot;\": '\\U00000121',\n\t\"ge;\": '\\U00002265',\n\t\"gel;\": '\\U000022DB',\n\t\"geq;\": '\\U00002265',\n\t\"geqq;\": '\\U00002267',\n\t\"geqslant;\": '\\U00002A7E',\n\t\"ges;\": '\\U00002A7E',\n\t\"gescc;\": '\\U00002AA9',\n\t\"gesdot;\": '\\U00002A80',\n\t\"gesdoto;\": '\\U00002A82',\n\t\"gesdotol;\": '\\U00002A84',\n\t\"gesles;\": '\\U00002A94',\n\t\"gfr;\": '\\U0001D524',\n\t\"gg;\": '\\U0000226B',\n\t\"ggg;\": '\\U000022D9',\n\t\"gimel;\": '\\U00002137',\n\t\"gjcy;\": '\\U00000453',\n\t\"gl;\": '\\U00002277',\n\t\"glE;\": '\\U00002A92',\n\t\"gla;\": '\\U00002AA5',\n\t\"glj;\": '\\U00002AA4',\n\t\"gnE;\": '\\U00002269',\n\t\"gnap;\": '\\U00002A8A',\n\t\"gnapprox;\": '\\U00002A8A',\n\t\"gne;\": '\\U00002A88',\n\t\"gneq;\": '\\U00002A88',\n\t\"gneqq;\": '\\U00002269',\n\t\"gnsim;\": '\\U000022E7',\n\t\"gopf;\": '\\U0001D558',\n\t\"grave;\": '\\U00000060',\n\t\"gscr;\": '\\U0000210A',\n\t\"gsim;\": '\\U00002273',\n\t\"gsime;\": '\\U00002A8E',\n\t\"gsiml;\": '\\U00002A90',\n\t\"gt;\": '\\U0000003E',\n\t\"gtcc;\": '\\U00002AA7',\n\t\"gtcir;\": '\\U00002A7A',\n\t\"gtdot;\": '\\U000022D7',\n\t\"gtlPar;\": '\\U00002995',\n\t\"gtquest;\": '\\U00002A7C',\n\t\"gtrapprox;\": '\\U00002A86',\n\t\"gtrarr;\": '\\U00002978',\n\t\"gtrdot;\": '\\U000022D7',\n\t\"gtreqless;\": '\\U000022DB',\n\t\"gtreqqless;\": '\\U00002A8C',\n\t\"gtrless;\": '\\U00002277',\n\t\"gtrsim;\": '\\U00002273',\n\t\"hArr;\": '\\U000021D4',\n\t\"hairsp;\": '\\U0000200A',\n\t\"half;\": '\\U000000BD',\n\t\"hamilt;\": '\\U0000210B',\n\t\"hardcy;\": '\\U0000044A',\n\t\"harr;\": '\\U00002194',\n\t\"harrcir;\": '\\U00002948',\n\t\"harrw;\": '\\U000021AD',\n\t\"hbar;\": '\\U0000210F',\n\t\"hcirc;\": '\\U00000125',\n\t\"hearts;\": '\\U00002665',\n\t\"heartsuit;\": '\\U00002665',\n\t\"hellip;\": '\\U00002026',\n\t\"hercon;\": '\\U000022B9',\n\t\"hfr;\": '\\U0001D525',\n\t\"hksearow;\": '\\U00002925',\n\t\"hkswarow;\": '\\U00002926',\n\t\"hoarr;\": '\\U000021FF',\n\t\"homtht;\": '\\U0000223B',\n\t\"hookleftarrow;\": '\\U000021A9',\n\t\"hookrightarrow;\": '\\U000021AA',\n\t\"hopf;\": '\\U0001D559',\n\t\"horbar;\": '\\U00002015',\n\t\"hscr;\": '\\U0001D4BD',\n\t\"hslash;\": '\\U0000210F',\n\t\"hstrok;\": '\\U00000127',\n\t\"hybull;\": '\\U00002043',\n\t\"hyphen;\": '\\U00002010',\n\t\"iacute;\": '\\U000000ED',\n\t\"ic;\": '\\U00002063',\n\t\"icirc;\": '\\U000000EE',\n\t\"icy;\": '\\U00000438',\n\t\"iecy;\": '\\U00000435',\n\t\"iexcl;\": '\\U000000A1',\n\t\"iff;\": '\\U000021D4',\n\t\"ifr;\": '\\U0001D526',\n\t\"igrave;\": '\\U000000EC',\n\t\"ii;\": '\\U00002148',\n\t\"iiiint;\": '\\U00002A0C',\n\t\"iiint;\": '\\U0000222D',\n\t\"iinfin;\": '\\U000029DC',\n\t\"iiota;\": '\\U00002129',\n\t\"ijlig;\": '\\U00000133',\n\t\"imacr;\": '\\U0000012B',\n\t\"image;\": '\\U00002111',\n\t\"imagline;\": '\\U00002110',\n\t\"imagpart;\": '\\U00002111',\n\t\"imath;\": '\\U00000131',\n\t\"imof;\": '\\U000022B7',\n\t\"imped;\": '\\U000001B5',\n\t\"in;\": '\\U00002208',\n\t\"incare;\": '\\U00002105',\n\t\"infin;\": '\\U0000221E',\n\t\"infintie;\": '\\U000029DD',\n\t\"inodot;\": '\\U00000131',\n\t\"int;\": '\\U0000222B',\n\t\"intcal;\": '\\U000022BA',\n\t\"integers;\": '\\U00002124',\n\t\"intercal;\": '\\U000022BA',\n\t\"intlarhk;\": '\\U00002A17',\n\t\"intprod;\": '\\U00002A3C',\n\t\"iocy;\": '\\U00000451',\n\t\"iogon;\": '\\U0000012F',\n\t\"iopf;\": '\\U0001D55A',\n\t\"iota;\": '\\U000003B9',\n\t\"iprod;\": '\\U00002A3C',\n\t\"iquest;\": '\\U000000BF',\n\t\"iscr;\": '\\U0001D4BE',\n\t\"isin;\": '\\U00002208',\n\t\"isinE;\": '\\U000022F9',\n\t\"isindot;\": '\\U000022F5',\n\t\"isins;\": '\\U000022F4',\n\t\"isinsv;\": '\\U000022F3',\n\t\"isinv;\": '\\U00002208',\n\t\"it;\": '\\U00002062',\n\t\"itilde;\": '\\U00000129',\n\t\"iukcy;\": '\\U00000456',\n\t\"iuml;\": '\\U000000EF',\n\t\"jcirc;\": '\\U00000135',\n\t\"jcy;\": '\\U00000439',\n\t\"jfr;\": '\\U0001D527',\n\t\"jmath;\": '\\U00000237',\n\t\"jopf;\": '\\U0001D55B',\n\t\"jscr;\": '\\U0001D4BF',\n\t\"jsercy;\": '\\U00000458',\n\t\"jukcy;\": '\\U00000454',\n\t\"kappa;\": '\\U000003BA',\n\t\"kappav;\": '\\U000003F0',\n\t\"kcedil;\": '\\U00000137',\n\t\"kcy;\": '\\U0000043A',\n\t\"kfr;\": '\\U0001D528',\n\t\"kgreen;\": '\\U00000138',\n\t\"khcy;\": '\\U00000445',\n\t\"kjcy;\": '\\U0000045C',\n\t\"kopf;\": '\\U0001D55C',\n\t\"kscr;\": '\\U0001D4C0',\n\t\"lAarr;\": '\\U000021DA',\n\t\"lArr;\": '\\U000021D0',\n\t\"lAtail;\": '\\U0000291B',\n\t\"lBarr;\": '\\U0000290E',\n\t\"lE;\": '\\U00002266',\n\t\"lEg;\": '\\U00002A8B',\n\t\"lHar;\": '\\U00002962',\n\t\"lacute;\": '\\U0000013A',\n\t\"laemptyv;\": '\\U000029B4',\n\t\"lagran;\": '\\U00002112',\n\t\"lambda;\": '\\U000003BB',\n\t\"lang;\": '\\U000027E8',\n\t\"langd;\": '\\U00002991',\n\t\"langle;\": '\\U000027E8',\n\t\"lap;\": '\\U00002A85',\n\t\"laquo;\": '\\U000000AB',\n\t\"larr;\": '\\U00002190',\n\t\"larrb;\": '\\U000021E4',\n\t\"larrbfs;\": '\\U0000291F',\n\t\"larrfs;\": '\\U0000291D',\n\t\"larrhk;\": '\\U000021A9',\n\t\"larrlp;\": '\\U000021AB',\n\t\"larrpl;\": '\\U00002939',\n\t\"larrsim;\": '\\U00002973',\n\t\"larrtl;\": '\\U000021A2',\n\t\"lat;\": '\\U00002AAB',\n\t\"latail;\": '\\U00002919',\n\t\"late;\": '\\U00002AAD',\n\t\"lbarr;\": '\\U0000290C',\n\t\"lbbrk;\": '\\U00002772',\n\t\"lbrace;\": '\\U0000007B',\n\t\"lbrack;\": '\\U0000005B',\n\t\"lbrke;\": '\\U0000298B',\n\t\"lbrksld;\": '\\U0000298F',\n\t\"lbrkslu;\": '\\U0000298D',\n\t\"lcaron;\": '\\U0000013E',\n\t\"lcedil;\": '\\U0000013C',\n\t\"lceil;\": '\\U00002308',\n\t\"lcub;\": '\\U0000007B',\n\t\"lcy;\": '\\U0000043B',\n\t\"ldca;\": '\\U00002936',\n\t\"ldquo;\": '\\U0000201C',\n\t\"ldquor;\": '\\U0000201E',\n\t\"ldrdhar;\": '\\U00002967',\n\t\"ldrushar;\": '\\U0000294B',\n\t\"ldsh;\": '\\U000021B2',\n\t\"le;\": '\\U00002264',\n\t\"leftarrow;\": '\\U00002190',\n\t\"leftarrowtail;\": '\\U000021A2',\n\t\"leftharpoondown;\": '\\U000021BD',\n\t\"leftharpoonup;\": '\\U000021BC',\n\t\"leftleftarrows;\": '\\U000021C7',\n\t\"leftrightarrow;\": '\\U00002194',\n\t\"leftrightarrows;\": '\\U000021C6',\n\t\"leftrightharpoons;\": '\\U000021CB',\n\t\"leftrightsquigarrow;\": '\\U000021AD',\n\t\"leftthreetimes;\": '\\U000022CB',\n\t\"leg;\": '\\U000022DA',\n\t\"leq;\": '\\U00002264',\n\t\"leqq;\": '\\U00002266',\n\t\"leqslant;\": '\\U00002A7D',\n\t\"les;\": '\\U00002A7D',\n\t\"lescc;\": '\\U00002AA8',\n\t\"lesdot;\": '\\U00002A7F',\n\t\"lesdoto;\": '\\U00002A81',\n\t\"lesdotor;\": '\\U00002A83',\n\t\"lesges;\": '\\U00002A93',\n\t\"lessapprox;\": '\\U00002A85',\n\t\"lessdot;\": '\\U000022D6',\n\t\"lesseqgtr;\": '\\U000022DA',\n\t\"lesseqqgtr;\": '\\U00002A8B',\n\t\"lessgtr;\": '\\U00002276',\n\t\"lesssim;\": '\\U00002272',\n\t\"lfisht;\": '\\U0000297C',\n\t\"lfloor;\": '\\U0000230A',\n\t\"lfr;\": '\\U0001D529',\n\t\"lg;\": '\\U00002276',\n\t\"lgE;\": '\\U00002A91',\n\t\"lhard;\": '\\U000021BD',\n\t\"lharu;\": '\\U000021BC',\n\t\"lharul;\": '\\U0000296A',\n\t\"lhblk;\": '\\U00002584',\n\t\"ljcy;\": '\\U00000459',\n\t\"ll;\": '\\U0000226A',\n\t\"llarr;\": '\\U000021C7',\n\t\"llcorner;\": '\\U0000231E',\n\t\"llhard;\": '\\U0000296B',\n\t\"lltri;\": '\\U000025FA',\n\t\"lmidot;\": '\\U00000140',\n\t\"lmoust;\": '\\U000023B0',\n\t\"lmoustache;\": '\\U000023B0',\n\t\"lnE;\": '\\U00002268',\n\t\"lnap;\": '\\U00002A89',\n\t\"lnapprox;\": '\\U00002A89',\n\t\"lne;\": '\\U00002A87',\n\t\"lneq;\": '\\U00002A87',\n\t\"lneqq;\": '\\U00002268',\n\t\"lnsim;\": '\\U000022E6',\n\t\"loang;\": '\\U000027EC',\n\t\"loarr;\": '\\U000021FD',\n\t\"lobrk;\": '\\U000027E6',\n\t\"longleftarrow;\": '\\U000027F5',\n\t\"longleftrightarrow;\": '\\U000027F7',\n\t\"longmapsto;\": '\\U000027FC',\n\t\"longrightarrow;\": '\\U000027F6',\n\t\"looparrowleft;\": '\\U000021AB',\n\t\"looparrowright;\": '\\U000021AC',\n\t\"lopar;\": '\\U00002985',\n\t\"lopf;\": '\\U0001D55D',\n\t\"loplus;\": '\\U00002A2D',\n\t\"lotimes;\": '\\U00002A34',\n\t\"lowast;\": '\\U00002217',\n\t\"lowbar;\": '\\U0000005F',\n\t\"loz;\": '\\U000025CA',\n\t\"lozenge;\": '\\U000025CA',\n\t\"lozf;\": '\\U000029EB',\n\t\"lpar;\": '\\U00000028',\n\t\"lparlt;\": '\\U00002993',\n\t\"lrarr;\": '\\U000021C6',\n\t\"lrcorner;\": '\\U0000231F',\n\t\"lrhar;\": '\\U000021CB',\n\t\"lrhard;\": '\\U0000296D',\n\t\"lrm;\": '\\U0000200E',\n\t\"lrtri;\": '\\U000022BF',\n\t\"lsaquo;\": '\\U00002039',\n\t\"lscr;\": '\\U0001D4C1',\n\t\"lsh;\": '\\U000021B0',\n\t\"lsim;\": '\\U00002272',\n\t\"lsime;\": '\\U00002A8D',\n\t\"lsimg;\": '\\U00002A8F',\n\t\"lsqb;\": '\\U0000005B',\n\t\"lsquo;\": '\\U00002018',\n\t\"lsquor;\": '\\U0000201A',\n\t\"lstrok;\": '\\U00000142',\n\t\"lt;\": '\\U0000003C',\n\t\"ltcc;\": '\\U00002AA6',\n\t\"ltcir;\": '\\U00002A79',\n\t\"ltdot;\": '\\U000022D6',\n\t\"lthree;\": '\\U000022CB',\n\t\"ltimes;\": '\\U000022C9',\n\t\"ltlarr;\": '\\U00002976',\n\t\"ltquest;\": '\\U00002A7B',\n\t\"ltrPar;\": '\\U00002996',\n\t\"ltri;\": '\\U000025C3',\n\t\"ltrie;\": '\\U000022B4',\n\t\"ltrif;\": '\\U000025C2',\n\t\"lurdshar;\": '\\U0000294A',\n\t\"luruhar;\": '\\U00002966',\n\t\"mDDot;\": '\\U0000223A',\n\t\"macr;\": '\\U000000AF',\n\t\"male;\": '\\U00002642',\n\t\"malt;\": '\\U00002720',\n\t\"maltese;\": '\\U00002720',\n\t\"map;\": '\\U000021A6',\n\t\"mapsto;\": '\\U000021A6',\n\t\"mapstodown;\": '\\U000021A7',\n\t\"mapstoleft;\": '\\U000021A4',\n\t\"mapstoup;\": '\\U000021A5',\n\t\"marker;\": '\\U000025AE',\n\t\"mcomma;\": '\\U00002A29',\n\t\"mcy;\": '\\U0000043C',\n\t\"mdash;\": '\\U00002014',\n\t\"measuredangle;\": '\\U00002221',\n\t\"mfr;\": '\\U0001D52A',\n\t\"mho;\": '\\U00002127',\n\t\"micro;\": '\\U000000B5',\n\t\"mid;\": '\\U00002223',\n\t\"midast;\": '\\U0000002A',\n\t\"midcir;\": '\\U00002AF0',\n\t\"middot;\": '\\U000000B7',\n\t\"minus;\": '\\U00002212',\n\t\"minusb;\": '\\U0000229F',\n\t\"minusd;\": '\\U00002238',\n\t\"minusdu;\": '\\U00002A2A',\n\t\"mlcp;\": '\\U00002ADB',\n\t\"mldr;\": '\\U00002026',\n\t\"mnplus;\": '\\U00002213',\n\t\"models;\": '\\U000022A7',\n\t\"mopf;\": '\\U0001D55E',\n\t\"mp;\": '\\U00002213',\n\t\"mscr;\": '\\U0001D4C2',\n\t\"mstpos;\": '\\U0000223E',\n\t\"mu;\": '\\U000003BC',\n\t\"multimap;\": '\\U000022B8',\n\t\"mumap;\": '\\U000022B8',\n\t\"nLeftarrow;\": '\\U000021CD',\n\t\"nLeftrightarrow;\": '\\U000021CE',\n\t\"nRightarrow;\": '\\U000021CF',\n\t\"nVDash;\": '\\U000022AF',\n\t\"nVdash;\": '\\U000022AE',\n\t\"nabla;\": '\\U00002207',\n\t\"nacute;\": '\\U00000144',\n\t\"nap;\": '\\U00002249',\n\t\"napos;\": '\\U00000149',\n\t\"napprox;\": '\\U00002249',\n\t\"natur;\": '\\U0000266E',\n\t\"natural;\": '\\U0000266E',\n\t\"naturals;\": '\\U00002115',\n\t\"nbsp;\": '\\U000000A0',\n\t\"ncap;\": '\\U00002A43',\n\t\"ncaron;\": '\\U00000148',\n\t\"ncedil;\": '\\U00000146',\n\t\"ncong;\": '\\U00002247',\n\t\"ncup;\": '\\U00002A42',\n\t\"ncy;\": '\\U0000043D',\n\t\"ndash;\": '\\U00002013',\n\t\"ne;\": '\\U00002260',\n\t\"neArr;\": '\\U000021D7',\n\t\"nearhk;\": '\\U00002924',\n\t\"nearr;\": '\\U00002197',\n\t\"nearrow;\": '\\U00002197',\n\t\"nequiv;\": '\\U00002262',\n\t\"nesear;\": '\\U00002928',\n\t\"nexist;\": '\\U00002204',\n\t\"nexists;\": '\\U00002204',\n\t\"nfr;\": '\\U0001D52B',\n\t\"nge;\": '\\U00002271',\n\t\"ngeq;\": '\\U00002271',\n\t\"ngsim;\": '\\U00002275',\n\t\"ngt;\": '\\U0000226F',\n\t\"ngtr;\": '\\U0000226F',\n\t\"nhArr;\": '\\U000021CE',\n\t\"nharr;\": '\\U000021AE',\n\t\"nhpar;\": '\\U00002AF2',\n\t\"ni;\": '\\U0000220B',\n\t\"nis;\": '\\U000022FC',\n\t\"nisd;\": '\\U000022FA',\n\t\"niv;\": '\\U0000220B',\n\t\"njcy;\": '\\U0000045A',\n\t\"nlArr;\": '\\U000021CD',\n\t\"nlarr;\": '\\U0000219A',\n\t\"nldr;\": '\\U00002025',\n\t\"nle;\": '\\U00002270',\n\t\"nleftarrow;\": '\\U0000219A',\n\t\"nleftrightarrow;\": '\\U000021AE',\n\t\"nleq;\": '\\U00002270',\n\t\"nless;\": '\\U0000226E',\n\t\"nlsim;\": '\\U00002274',\n\t\"nlt;\": '\\U0000226E',\n\t\"nltri;\": '\\U000022EA',\n\t\"nltrie;\": '\\U000022EC',\n\t\"nmid;\": '\\U00002224',\n\t\"nopf;\": '\\U0001D55F',\n\t\"not;\": '\\U000000AC',\n\t\"notin;\": '\\U00002209',\n\t\"notinva;\": '\\U00002209',\n\t\"notinvb;\": '\\U000022F7',\n\t\"notinvc;\": '\\U000022F6',\n\t\"notni;\": '\\U0000220C',\n\t\"notniva;\": '\\U0000220C',\n\t\"notnivb;\": '\\U000022FE',\n\t\"notnivc;\": '\\U000022FD',\n\t\"npar;\": '\\U00002226',\n\t\"nparallel;\": '\\U00002226',\n\t\"npolint;\": '\\U00002A14',\n\t\"npr;\": '\\U00002280',\n\t\"nprcue;\": '\\U000022E0',\n\t\"nprec;\": '\\U00002280',\n\t\"nrArr;\": '\\U000021CF',\n\t\"nrarr;\": '\\U0000219B',\n\t\"nrightarrow;\": '\\U0000219B',\n\t\"nrtri;\": '\\U000022EB',\n\t\"nrtrie;\": '\\U000022ED',\n\t\"nsc;\": '\\U00002281',\n\t\"nsccue;\": '\\U000022E1',\n\t\"nscr;\": '\\U0001D4C3',\n\t\"nshortmid;\": '\\U00002224',\n\t\"nshortparallel;\": '\\U00002226',\n\t\"nsim;\": '\\U00002241',\n\t\"nsime;\": '\\U00002244',\n\t\"nsimeq;\": '\\U00002244',\n\t\"nsmid;\": '\\U00002224',\n\t\"nspar;\": '\\U00002226',\n\t\"nsqsube;\": '\\U000022E2',\n\t\"nsqsupe;\": '\\U000022E3',\n\t\"nsub;\": '\\U00002284',\n\t\"nsube;\": '\\U00002288',\n\t\"nsubseteq;\": '\\U00002288',\n\t\"nsucc;\": '\\U00002281',\n\t\"nsup;\": '\\U00002285',\n\t\"nsupe;\": '\\U00002289',\n\t\"nsupseteq;\": '\\U00002289',\n\t\"ntgl;\": '\\U00002279',\n\t\"ntilde;\": '\\U000000F1',\n\t\"ntlg;\": '\\U00002278',\n\t\"ntriangleleft;\": '\\U000022EA',\n\t\"ntrianglelefteq;\": '\\U000022EC',\n\t\"ntriangleright;\": '\\U000022EB',\n\t\"ntrianglerighteq;\": '\\U000022ED',\n\t\"nu;\": '\\U000003BD',\n\t\"num;\": '\\U00000023',\n\t\"numero;\": '\\U00002116',\n\t\"numsp;\": '\\U00002007',\n\t\"nvDash;\": '\\U000022AD',\n\t\"nvHarr;\": '\\U00002904',\n\t\"nvdash;\": '\\U000022AC',\n\t\"nvinfin;\": '\\U000029DE',\n\t\"nvlArr;\": '\\U00002902',\n\t\"nvrArr;\": '\\U00002903',\n\t\"nwArr;\": '\\U000021D6',\n\t\"nwarhk;\": '\\U00002923',\n\t\"nwarr;\": '\\U00002196',\n\t\"nwarrow;\": '\\U00002196',\n\t\"nwnear;\": '\\U00002927',\n\t\"oS;\": '\\U000024C8',\n\t\"oacute;\": '\\U000000F3',\n\t\"oast;\": '\\U0000229B',\n\t\"ocir;\": '\\U0000229A',\n\t\"ocirc;\": '\\U000000F4',\n\t\"ocy;\": '\\U0000043E',\n\t\"odash;\": '\\U0000229D',\n\t\"odblac;\": '\\U00000151',\n\t\"odiv;\": '\\U00002A38',\n\t\"odot;\": '\\U00002299',\n\t\"odsold;\": '\\U000029BC',\n\t\"oelig;\": '\\U00000153',\n\t\"ofcir;\": '\\U000029BF',\n\t\"ofr;\": '\\U0001D52C',\n\t\"ogon;\": '\\U000002DB',\n\t\"ograve;\": '\\U000000F2',\n\t\"ogt;\": '\\U000029C1',\n\t\"ohbar;\": '\\U000029B5',\n\t\"ohm;\": '\\U000003A9',\n\t\"oint;\": '\\U0000222E',\n\t\"olarr;\": '\\U000021BA',\n\t\"olcir;\": '\\U000029BE',\n\t\"olcross;\": '\\U000029BB',\n\t\"oline;\": '\\U0000203E',\n\t\"olt;\": '\\U000029C0',\n\t\"omacr;\": '\\U0000014D',\n\t\"omega;\": '\\U000003C9',\n\t\"omicron;\": '\\U000003BF',\n\t\"omid;\": '\\U000029B6',\n\t\"ominus;\": '\\U00002296',\n\t\"oopf;\": '\\U0001D560',\n\t\"opar;\": '\\U000029B7',\n\t\"operp;\": '\\U000029B9',\n\t\"oplus;\": '\\U00002295',\n\t\"or;\": '\\U00002228',\n\t\"orarr;\": '\\U000021BB',\n\t\"ord;\": '\\U00002A5D',\n\t\"order;\": '\\U00002134',\n\t\"orderof;\": '\\U00002134',\n\t\"ordf;\": '\\U000000AA',\n\t\"ordm;\": '\\U000000BA',\n\t\"origof;\": '\\U000022B6',\n\t\"oror;\": '\\U00002A56',\n\t\"orslope;\": '\\U00002A57',\n\t\"orv;\": '\\U00002A5B',\n\t\"oscr;\": '\\U00002134',\n\t\"oslash;\": '\\U000000F8',\n\t\"osol;\": '\\U00002298',\n\t\"otilde;\": '\\U000000F5',\n\t\"otimes;\": '\\U00002297',\n\t\"otimesas;\": '\\U00002A36',\n\t\"ouml;\": '\\U000000F6',\n\t\"ovbar;\": '\\U0000233D',\n\t\"par;\": '\\U00002225',\n\t\"para;\": '\\U000000B6',\n\t\"parallel;\": '\\U00002225',\n\t\"parsim;\": '\\U00002AF3',\n\t\"parsl;\": '\\U00002AFD',\n\t\"part;\": '\\U00002202',\n\t\"pcy;\": '\\U0000043F',\n\t\"percnt;\": '\\U00000025',\n\t\"period;\": '\\U0000002E',\n\t\"permil;\": '\\U00002030',\n\t\"perp;\": '\\U000022A5',\n\t\"pertenk;\": '\\U00002031',\n\t\"pfr;\": '\\U0001D52D',\n\t\"phi;\": '\\U000003C6',\n\t\"phiv;\": '\\U000003D5',\n\t\"phmmat;\": '\\U00002133',\n\t\"phone;\": '\\U0000260E',\n\t\"pi;\": '\\U000003C0',\n\t\"pitchfork;\": '\\U000022D4',\n\t\"piv;\": '\\U000003D6',\n\t\"planck;\": '\\U0000210F',\n\t\"planckh;\": '\\U0000210E',\n\t\"plankv;\": '\\U0000210F',\n\t\"plus;\": '\\U0000002B',\n\t\"plusacir;\": '\\U00002A23',\n\t\"plusb;\": '\\U0000229E',\n\t\"pluscir;\": '\\U00002A22',\n\t\"plusdo;\": '\\U00002214',\n\t\"plusdu;\": '\\U00002A25',\n\t\"pluse;\": '\\U00002A72',\n\t\"plusmn;\": '\\U000000B1',\n\t\"plussim;\": '\\U00002A26',\n\t\"plustwo;\": '\\U00002A27',\n\t\"pm;\": '\\U000000B1',\n\t\"pointint;\": '\\U00002A15',\n\t\"popf;\": '\\U0001D561',\n\t\"pound;\": '\\U000000A3',\n\t\"pr;\": '\\U0000227A',\n\t\"prE;\": '\\U00002AB3',\n\t\"prap;\": '\\U00002AB7',\n\t\"prcue;\": '\\U0000227C',\n\t\"pre;\": '\\U00002AAF',\n\t\"prec;\": '\\U0000227A',\n\t\"precapprox;\": '\\U00002AB7',\n\t\"preccurlyeq;\": '\\U0000227C',\n\t\"preceq;\": '\\U00002AAF',\n\t\"precnapprox;\": '\\U00002AB9',\n\t\"precneqq;\": '\\U00002AB5',\n\t\"precnsim;\": '\\U000022E8',\n\t\"precsim;\": '\\U0000227E',\n\t\"prime;\": '\\U00002032',\n\t\"primes;\": '\\U00002119',\n\t\"prnE;\": '\\U00002AB5',\n\t\"prnap;\": '\\U00002AB9',\n\t\"prnsim;\": '\\U000022E8',\n\t\"prod;\": '\\U0000220F',\n\t\"profalar;\": '\\U0000232E',\n\t\"profline;\": '\\U00002312',\n\t\"profsurf;\": '\\U00002313',\n\t\"prop;\": '\\U0000221D',\n\t\"propto;\": '\\U0000221D',\n\t\"prsim;\": '\\U0000227E',\n\t\"prurel;\": '\\U000022B0',\n\t\"pscr;\": '\\U0001D4C5',\n\t\"psi;\": '\\U000003C8',\n\t\"puncsp;\": '\\U00002008',\n\t\"qfr;\": '\\U0001D52E',\n\t\"qint;\": '\\U00002A0C',\n\t\"qopf;\": '\\U0001D562',\n\t\"qprime;\": '\\U00002057',\n\t\"qscr;\": '\\U0001D4C6',\n\t\"quaternions;\": '\\U0000210D',\n\t\"quatint;\": '\\U00002A16',\n\t\"quest;\": '\\U0000003F',\n\t\"questeq;\": '\\U0000225F',\n\t\"quot;\": '\\U00000022',\n\t\"rAarr;\": '\\U000021DB',\n\t\"rArr;\": '\\U000021D2',\n\t\"rAtail;\": '\\U0000291C',\n\t\"rBarr;\": '\\U0000290F',\n\t\"rHar;\": '\\U00002964',\n\t\"racute;\": '\\U00000155',\n\t\"radic;\": '\\U0000221A',\n\t\"raemptyv;\": '\\U000029B3',\n\t\"rang;\": '\\U000027E9',\n\t\"rangd;\": '\\U00002992',\n\t\"range;\": '\\U000029A5',\n\t\"rangle;\": '\\U000027E9',\n\t\"raquo;\": '\\U000000BB',\n\t\"rarr;\": '\\U00002192',\n\t\"rarrap;\": '\\U00002975',\n\t\"rarrb;\": '\\U000021E5',\n\t\"rarrbfs;\": '\\U00002920',\n\t\"rarrc;\": '\\U00002933',\n\t\"rarrfs;\": '\\U0000291E',\n\t\"rarrhk;\": '\\U000021AA',\n\t\"rarrlp;\": '\\U000021AC',\n\t\"rarrpl;\": '\\U00002945',\n\t\"rarrsim;\": '\\U00002974',\n\t\"rarrtl;\": '\\U000021A3',\n\t\"rarrw;\": '\\U0000219D',\n\t\"ratail;\": '\\U0000291A',\n\t\"ratio;\": '\\U00002236',\n\t\"rationals;\": '\\U0000211A',\n\t\"rbarr;\": '\\U0000290D',\n\t\"rbbrk;\": '\\U00002773',\n\t\"rbrace;\": '\\U0000007D',\n\t\"rbrack;\": '\\U0000005D',\n\t\"rbrke;\": '\\U0000298C',\n\t\"rbrksld;\": '\\U0000298E',\n\t\"rbrkslu;\": '\\U00002990',\n\t\"rcaron;\": '\\U00000159',\n\t\"rcedil;\": '\\U00000157',\n\t\"rceil;\": '\\U00002309',\n\t\"rcub;\": '\\U0000007D',\n\t\"rcy;\": '\\U00000440',\n\t\"rdca;\": '\\U00002937',\n\t\"rdldhar;\": '\\U00002969',\n\t\"rdquo;\": '\\U0000201D',\n\t\"rdquor;\": '\\U0000201D',\n\t\"rdsh;\": '\\U000021B3',\n\t\"real;\": '\\U0000211C',\n\t\"realine;\": '\\U0000211B',\n\t\"realpart;\": '\\U0000211C',\n\t\"reals;\": '\\U0000211D',\n\t\"rect;\": '\\U000025AD',\n\t\"reg;\": '\\U000000AE',\n\t\"rfisht;\": '\\U0000297D',\n\t\"rfloor;\": '\\U0000230B',\n\t\"rfr;\": '\\U0001D52F',\n\t\"rhard;\": '\\U000021C1',\n\t\"rharu;\": '\\U000021C0',\n\t\"rharul;\": '\\U0000296C',\n\t\"rho;\": '\\U000003C1',\n\t\"rhov;\": '\\U000003F1',\n\t\"rightarrow;\": '\\U00002192',\n\t\"rightarrowtail;\": '\\U000021A3',\n\t\"rightharpoondown;\": '\\U000021C1',\n\t\"rightharpoonup;\": '\\U000021C0',\n\t\"rightleftarrows;\": '\\U000021C4',\n\t\"rightleftharpoons;\": '\\U000021CC',\n\t\"rightrightarrows;\": '\\U000021C9',\n\t\"rightsquigarrow;\": '\\U0000219D',\n\t\"rightthreetimes;\": '\\U000022CC',\n\t\"ring;\": '\\U000002DA',\n\t\"risingdotseq;\": '\\U00002253',\n\t\"rlarr;\": '\\U000021C4',\n\t\"rlhar;\": '\\U000021CC',\n\t\"rlm;\": '\\U0000200F',\n\t\"rmoust;\": '\\U000023B1',\n\t\"rmoustache;\": '\\U000023B1',\n\t\"rnmid;\": '\\U00002AEE',\n\t\"roang;\": '\\U000027ED',\n\t\"roarr;\": '\\U000021FE',\n\t\"robrk;\": '\\U000027E7',\n\t\"ropar;\": '\\U00002986',\n\t\"ropf;\": '\\U0001D563',\n\t\"roplus;\": '\\U00002A2E',\n\t\"rotimes;\": '\\U00002A35',\n\t\"rpar;\": '\\U00000029',\n\t\"rpargt;\": '\\U00002994',\n\t\"rppolint;\": '\\U00002A12',\n\t\"rrarr;\": '\\U000021C9',\n\t\"rsaquo;\": '\\U0000203A',\n\t\"rscr;\": '\\U0001D4C7',\n\t\"rsh;\": '\\U000021B1',\n\t\"rsqb;\": '\\U0000005D',\n\t\"rsquo;\": '\\U00002019',\n\t\"rsquor;\": '\\U00002019',\n\t\"rthree;\": '\\U000022CC',\n\t\"rtimes;\": '\\U000022CA',\n\t\"rtri;\": '\\U000025B9',\n\t\"rtrie;\": '\\U000022B5',\n\t\"rtrif;\": '\\U000025B8',\n\t\"rtriltri;\": '\\U000029CE',\n\t\"ruluhar;\": '\\U00002968',\n\t\"rx;\": '\\U0000211E',\n\t\"sacute;\": '\\U0000015B',\n\t\"sbquo;\": '\\U0000201A',\n\t\"sc;\": '\\U0000227B',\n\t\"scE;\": '\\U00002AB4',\n\t\"scap;\": '\\U00002AB8',\n\t\"scaron;\": '\\U00000161',\n\t\"sccue;\": '\\U0000227D',\n\t\"sce;\": '\\U00002AB0',\n\t\"scedil;\": '\\U0000015F',\n\t\"scirc;\": '\\U0000015D',\n\t\"scnE;\": '\\U00002AB6',\n\t\"scnap;\": '\\U00002ABA',\n\t\"scnsim;\": '\\U000022E9',\n\t\"scpolint;\": '\\U00002A13',\n\t\"scsim;\": '\\U0000227F',\n\t\"scy;\": '\\U00000441',\n\t\"sdot;\": '\\U000022C5',\n\t\"sdotb;\": '\\U000022A1',\n\t\"sdote;\": '\\U00002A66',\n\t\"seArr;\": '\\U000021D8',\n\t\"searhk;\": '\\U00002925',\n\t\"searr;\": '\\U00002198',\n\t\"searrow;\": '\\U00002198',\n\t\"sect;\": '\\U000000A7',\n\t\"semi;\": '\\U0000003B',\n\t\"seswar;\": '\\U00002929',\n\t\"setminus;\": '\\U00002216',\n\t\"setmn;\": '\\U00002216',\n\t\"sext;\": '\\U00002736',\n\t\"sfr;\": '\\U0001D530',\n\t\"sfrown;\": '\\U00002322',\n\t\"sharp;\": '\\U0000266F',\n\t\"shchcy;\": '\\U00000449',\n\t\"shcy;\": '\\U00000448',\n\t\"shortmid;\": '\\U00002223',\n\t\"shortparallel;\": '\\U00002225',\n\t\"shy;\": '\\U000000AD',\n\t\"sigma;\": '\\U000003C3',\n\t\"sigmaf;\": '\\U000003C2',\n\t\"sigmav;\": '\\U000003C2',\n\t\"sim;\": '\\U0000223C',\n\t\"simdot;\": '\\U00002A6A',\n\t\"sime;\": '\\U00002243',\n\t\"simeq;\": '\\U00002243',\n\t\"simg;\": '\\U00002A9E',\n\t\"simgE;\": '\\U00002AA0',\n\t\"siml;\": '\\U00002A9D',\n\t\"simlE;\": '\\U00002A9F',\n\t\"simne;\": '\\U00002246',\n\t\"simplus;\": '\\U00002A24',\n\t\"simrarr;\": '\\U00002972',\n\t\"slarr;\": '\\U00002190',\n\t\"smallsetminus;\": '\\U00002216',\n\t\"smashp;\": '\\U00002A33',\n\t\"smeparsl;\": '\\U000029E4',\n\t\"smid;\": '\\U00002223',\n\t\"smile;\": '\\U00002323',\n\t\"smt;\": '\\U00002AAA',\n\t\"smte;\": '\\U00002AAC',\n\t\"softcy;\": '\\U0000044C',\n\t\"sol;\": '\\U0000002F',\n\t\"solb;\": '\\U000029C4',\n\t\"solbar;\": '\\U0000233F',\n\t\"sopf;\": '\\U0001D564',\n\t\"spades;\": '\\U00002660',\n\t\"spadesuit;\": '\\U00002660',\n\t\"spar;\": '\\U00002225',\n\t\"sqcap;\": '\\U00002293',\n\t\"sqcup;\": '\\U00002294',\n\t\"sqsub;\": '\\U0000228F',\n\t\"sqsube;\": '\\U00002291',\n\t\"sqsubset;\": '\\U0000228F',\n\t\"sqsubseteq;\": '\\U00002291',\n\t\"sqsup;\": '\\U00002290',\n\t\"sqsupe;\": '\\U00002292',\n\t\"sqsupset;\": '\\U00002290',\n\t\"sqsupseteq;\": '\\U00002292',\n\t\"squ;\": '\\U000025A1',\n\t\"square;\": '\\U000025A1',\n\t\"squarf;\": '\\U000025AA',\n\t\"squf;\": '\\U000025AA',\n\t\"srarr;\": '\\U00002192',\n\t\"sscr;\": '\\U0001D4C8',\n\t\"ssetmn;\": '\\U00002216',\n\t\"ssmile;\": '\\U00002323',\n\t\"sstarf;\": '\\U000022C6',\n\t\"star;\": '\\U00002606',\n\t\"starf;\": '\\U00002605',\n\t\"straightepsilon;\": '\\U000003F5',\n\t\"straightphi;\": '\\U000003D5',\n\t\"strns;\": '\\U000000AF',\n\t\"sub;\": '\\U00002282',\n\t\"subE;\": '\\U00002AC5',\n\t\"subdot;\": '\\U00002ABD',\n\t\"sube;\": '\\U00002286',\n\t\"subedot;\": '\\U00002AC3',\n\t\"submult;\": '\\U00002AC1',\n\t\"subnE;\": '\\U00002ACB',\n\t\"subne;\": '\\U0000228A',\n\t\"subplus;\": '\\U00002ABF',\n\t\"subrarr;\": '\\U00002979',\n\t\"subset;\": '\\U00002282',\n\t\"subseteq;\": '\\U00002286',\n\t\"subseteqq;\": '\\U00002AC5',\n\t\"subsetneq;\": '\\U0000228A',\n\t\"subsetneqq;\": '\\U00002ACB',\n\t\"subsim;\": '\\U00002AC7',\n\t\"subsub;\": '\\U00002AD5',\n\t\"subsup;\": '\\U00002AD3',\n\t\"succ;\": '\\U0000227B',\n\t\"succapprox;\": '\\U00002AB8',\n\t\"succcurlyeq;\": '\\U0000227D',\n\t\"succeq;\": '\\U00002AB0',\n\t\"succnapprox;\": '\\U00002ABA',\n\t\"succneqq;\": '\\U00002AB6',\n\t\"succnsim;\": '\\U000022E9',\n\t\"succsim;\": '\\U0000227F',\n\t\"sum;\": '\\U00002211',\n\t\"sung;\": '\\U0000266A',\n\t\"sup;\": '\\U00002283',\n\t\"sup1;\": '\\U000000B9',\n\t\"sup2;\": '\\U000000B2',\n\t\"sup3;\": '\\U000000B3',\n\t\"supE;\": '\\U00002AC6',\n\t\"supdot;\": '\\U00002ABE',\n\t\"supdsub;\": '\\U00002AD8',\n\t\"supe;\": '\\U00002287',\n\t\"supedot;\": '\\U00002AC4',\n\t\"suphsol;\": '\\U000027C9',\n\t\"suphsub;\": '\\U00002AD7',\n\t\"suplarr;\": '\\U0000297B',\n\t\"supmult;\": '\\U00002AC2',\n\t\"supnE;\": '\\U00002ACC',\n\t\"supne;\": '\\U0000228B',\n\t\"supplus;\": '\\U00002AC0',\n\t\"supset;\": '\\U00002283',\n\t\"supseteq;\": '\\U00002287',\n\t\"supseteqq;\": '\\U00002AC6',\n\t\"supsetneq;\": '\\U0000228B',\n\t\"supsetneqq;\": '\\U00002ACC',\n\t\"supsim;\": '\\U00002AC8',\n\t\"supsub;\": '\\U00002AD4',\n\t\"supsup;\": '\\U00002AD6',\n\t\"swArr;\": '\\U000021D9',\n\t\"swarhk;\": '\\U00002926',\n\t\"swarr;\": '\\U00002199',\n\t\"swarrow;\": '\\U00002199',\n\t\"swnwar;\": '\\U0000292A',\n\t\"szlig;\": '\\U000000DF',\n\t\"target;\": '\\U00002316',\n\t\"tau;\": '\\U000003C4',\n\t\"tbrk;\": '\\U000023B4',\n\t\"tcaron;\": '\\U00000165',\n\t\"tcedil;\": '\\U00000163',\n\t\"tcy;\": '\\U00000442',\n\t\"tdot;\": '\\U000020DB',\n\t\"telrec;\": '\\U00002315',\n\t\"tfr;\": '\\U0001D531',\n\t\"there4;\": '\\U00002234',\n\t\"therefore;\": '\\U00002234',\n\t\"theta;\": '\\U000003B8',\n\t\"thetasym;\": '\\U000003D1',\n\t\"thetav;\": '\\U000003D1',\n\t\"thickapprox;\": '\\U00002248',\n\t\"thicksim;\": '\\U0000223C',\n\t\"thinsp;\": '\\U00002009',\n\t\"thkap;\": '\\U00002248',\n\t\"thksim;\": '\\U0000223C',\n\t\"thorn;\": '\\U000000FE',\n\t\"tilde;\": '\\U000002DC',\n\t\"times;\": '\\U000000D7',\n\t\"timesb;\": '\\U000022A0',\n\t\"timesbar;\": '\\U00002A31',\n\t\"timesd;\": '\\U00002A30',\n\t\"tint;\": '\\U0000222D',\n\t\"toea;\": '\\U00002928',\n\t\"top;\": '\\U000022A4',\n\t\"topbot;\": '\\U00002336',\n\t\"topcir;\": '\\U00002AF1',\n\t\"topf;\": '\\U0001D565',\n\t\"topfork;\": '\\U00002ADA',\n\t\"tosa;\": '\\U00002929',\n\t\"tprime;\": '\\U00002034',\n\t\"trade;\": '\\U00002122',\n\t\"triangle;\": '\\U000025B5',\n\t\"triangledown;\": '\\U000025BF',\n\t\"triangleleft;\": '\\U000025C3',\n\t\"trianglelefteq;\": '\\U000022B4',\n\t\"triangleq;\": '\\U0000225C',\n\t\"triangleright;\": '\\U000025B9',\n\t\"trianglerighteq;\": '\\U000022B5',\n\t\"tridot;\": '\\U000025EC',\n\t\"trie;\": '\\U0000225C',\n\t\"triminus;\": '\\U00002A3A',\n\t\"triplus;\": '\\U00002A39',\n\t\"trisb;\": '\\U000029CD',\n\t\"tritime;\": '\\U00002A3B',\n\t\"trpezium;\": '\\U000023E2',\n\t\"tscr;\": '\\U0001D4C9',\n\t\"tscy;\": '\\U00000446',\n\t\"tshcy;\": '\\U0000045B',\n\t\"tstrok;\": '\\U00000167',\n\t\"twixt;\": '\\U0000226C',\n\t\"twoheadleftarrow;\": '\\U0000219E',\n\t\"twoheadrightarrow;\": '\\U000021A0',\n\t\"uArr;\": '\\U000021D1',\n\t\"uHar;\": '\\U00002963',\n\t\"uacute;\": '\\U000000FA',\n\t\"uarr;\": '\\U00002191',\n\t\"ubrcy;\": '\\U0000045E',\n\t\"ubreve;\": '\\U0000016D',\n\t\"ucirc;\": '\\U000000FB',\n\t\"ucy;\": '\\U00000443',\n\t\"udarr;\": '\\U000021C5',\n\t\"udblac;\": '\\U00000171',\n\t\"udhar;\": '\\U0000296E',\n\t\"ufisht;\": '\\U0000297E',\n\t\"ufr;\": '\\U0001D532',\n\t\"ugrave;\": '\\U000000F9',\n\t\"uharl;\": '\\U000021BF',\n\t\"uharr;\": '\\U000021BE',\n\t\"uhblk;\": '\\U00002580',\n\t\"ulcorn;\": '\\U0000231C',\n\t\"ulcorner;\": '\\U0000231C',\n\t\"ulcrop;\": '\\U0000230F',\n\t\"ultri;\": '\\U000025F8',\n\t\"umacr;\": '\\U0000016B',\n\t\"uml;\": '\\U000000A8',\n\t\"uogon;\": '\\U00000173',\n\t\"uopf;\": '\\U0001D566',\n\t\"uparrow;\": '\\U00002191',\n\t\"updownarrow;\": '\\U00002195',\n\t\"upharpoonleft;\": '\\U000021BF',\n\t\"upharpoonright;\": '\\U000021BE',\n\t\"uplus;\": '\\U0000228E',\n\t\"upsi;\": '\\U000003C5',\n\t\"upsih;\": '\\U000003D2',\n\t\"upsilon;\": '\\U000003C5',\n\t\"upuparrows;\": '\\U000021C8',\n\t\"urcorn;\": '\\U0000231D',\n\t\"urcorner;\": '\\U0000231D',\n\t\"urcrop;\": '\\U0000230E',\n\t\"uring;\": '\\U0000016F',\n\t\"urtri;\": '\\U000025F9',\n\t\"uscr;\": '\\U0001D4CA',\n\t\"utdot;\": '\\U000022F0',\n\t\"utilde;\": '\\U00000169',\n\t\"utri;\": '\\U000025B5',\n\t\"utrif;\": '\\U000025B4',\n\t\"uuarr;\": '\\U000021C8',\n\t\"uuml;\": '\\U000000FC',\n\t\"uwangle;\": '\\U000029A7',\n\t\"vArr;\": '\\U000021D5',\n\t\"vBar;\": '\\U00002AE8',\n\t\"vBarv;\": '\\U00002AE9',\n\t\"vDash;\": '\\U000022A8',\n\t\"vangrt;\": '\\U0000299C',\n\t\"varepsilon;\": '\\U000003F5',\n\t\"varkappa;\": '\\U000003F0',\n\t\"varnothing;\": '\\U00002205',\n\t\"varphi;\": '\\U000003D5',\n\t\"varpi;\": '\\U000003D6',\n\t\"varpropto;\": '\\U0000221D',\n\t\"varr;\": '\\U00002195',\n\t\"varrho;\": '\\U000003F1',\n\t\"varsigma;\": '\\U000003C2',\n\t\"vartheta;\": '\\U000003D1',\n\t\"vartriangleleft;\": '\\U000022B2',\n\t\"vartriangleright;\": '\\U000022B3',\n\t\"vcy;\": '\\U00000432',\n\t\"vdash;\": '\\U000022A2',\n\t\"vee;\": '\\U00002228',\n\t\"veebar;\": '\\U000022BB',\n\t\"veeeq;\": '\\U0000225A',\n\t\"vellip;\": '\\U000022EE',\n\t\"verbar;\": '\\U0000007C',\n\t\"vert;\": '\\U0000007C',\n\t\"vfr;\": '\\U0001D533',\n\t\"vltri;\": '\\U000022B2',\n\t\"vopf;\": '\\U0001D567',\n\t\"vprop;\": '\\U0000221D',\n\t\"vrtri;\": '\\U000022B3',\n\t\"vscr;\": '\\U0001D4CB',\n\t\"vzigzag;\": '\\U0000299A',\n\t\"wcirc;\": '\\U00000175',\n\t\"wedbar;\": '\\U00002A5F',\n\t\"wedge;\": '\\U00002227',\n\t\"wedgeq;\": '\\U00002259',\n\t\"weierp;\": '\\U00002118',\n\t\"wfr;\": '\\U0001D534',\n\t\"wopf;\": '\\U0001D568',\n\t\"wp;\": '\\U00002118',\n\t\"wr;\": '\\U00002240',\n\t\"wreath;\": '\\U00002240',\n\t\"wscr;\": '\\U0001D4CC',\n\t\"xcap;\": '\\U000022C2',\n\t\"xcirc;\": '\\U000025EF',\n\t\"xcup;\": '\\U000022C3',\n\t\"xdtri;\": '\\U000025BD',\n\t\"xfr;\": '\\U0001D535',\n\t\"xhArr;\": '\\U000027FA',\n\t\"xharr;\": '\\U000027F7',\n\t\"xi;\": '\\U000003BE',\n\t\"xlArr;\": '\\U000027F8',\n\t\"xlarr;\": '\\U000027F5',\n\t\"xmap;\": '\\U000027FC',\n\t\"xnis;\": '\\U000022FB',\n\t\"xodot;\": '\\U00002A00',\n\t\"xopf;\": '\\U0001D569',\n\t\"xoplus;\": '\\U00002A01',\n\t\"xotime;\": '\\U00002A02',\n\t\"xrArr;\": '\\U000027F9',\n\t\"xrarr;\": '\\U000027F6',\n\t\"xscr;\": '\\U0001D4CD',\n\t\"xsqcup;\": '\\U00002A06',\n\t\"xuplus;\": '\\U00002A04',\n\t\"xutri;\": '\\U000025B3',\n\t\"xvee;\": '\\U000022C1',\n\t\"xwedge;\": '\\U000022C0',\n\t\"yacute;\": '\\U000000FD',\n\t\"yacy;\": '\\U0000044F',\n\t\"ycirc;\": '\\U00000177',\n\t\"ycy;\": '\\U0000044B',\n\t\"yen;\": '\\U000000A5',\n\t\"yfr;\": '\\U0001D536',\n\t\"yicy;\": '\\U00000457',\n\t\"yopf;\": '\\U0001D56A',\n\t\"yscr;\": '\\U0001D4CE',\n\t\"yucy;\": '\\U0000044E',\n\t\"yuml;\": '\\U000000FF',\n\t\"zacute;\": '\\U0000017A',\n\t\"zcaron;\": '\\U0000017E',\n\t\"zcy;\": '\\U00000437',\n\t\"zdot;\": '\\U0000017C',\n\t\"zeetrf;\": '\\U00002128',\n\t\"zeta;\": '\\U000003B6',\n\t\"zfr;\": '\\U0001D537',\n\t\"zhcy;\": '\\U00000436',\n\t\"zigrarr;\": '\\U000021DD',\n\t\"zopf;\": '\\U0001D56B',\n\t\"zscr;\": '\\U0001D4CF',\n\t\"zwj;\": '\\U0000200D',\n\t\"zwnj;\": '\\U0000200C',\n\t\"AElig\": '\\U000000C6',\n\t\"AMP\": '\\U00000026',\n\t\"Aacute\": '\\U000000C1',\n\t\"Acirc\": '\\U000000C2',\n\t\"Agrave\": '\\U000000C0',\n\t\"Aring\": '\\U000000C5',\n\t\"Atilde\": '\\U000000C3',\n\t\"Auml\": '\\U000000C4',\n\t\"COPY\": '\\U000000A9',\n\t\"Ccedil\": '\\U000000C7',\n\t\"ETH\": '\\U000000D0',\n\t\"Eacute\": '\\U000000C9',\n\t\"Ecirc\": '\\U000000CA',\n\t\"Egrave\": '\\U000000C8',\n\t\"Euml\": '\\U000000CB',\n\t\"GT\": '\\U0000003E',\n\t\"Iacute\": '\\U000000CD',\n\t\"Icirc\": '\\U000000CE',\n\t\"Igrave\": '\\U000000CC',\n\t\"Iuml\": '\\U000000CF',\n\t\"LT\": '\\U0000003C',\n\t\"Ntilde\": '\\U000000D1',\n\t\"Oacute\": '\\U000000D3',\n\t\"Ocirc\": '\\U000000D4',\n\t\"Ograve\": '\\U000000D2',\n\t\"Oslash\": '\\U000000D8',\n\t\"Otilde\": '\\U000000D5',\n\t\"Ouml\": '\\U000000D6',\n\t\"QUOT\": '\\U00000022',\n\t\"REG\": '\\U000000AE',\n\t\"THORN\": '\\U000000DE',\n\t\"Uacute\": '\\U000000DA',\n\t\"Ucirc\": '\\U000000DB',\n\t\"Ugrave\": '\\U000000D9',\n\t\"Uuml\": '\\U000000DC',\n\t\"Yacute\": '\\U000000DD',\n\t\"aacute\": '\\U000000E1',\n\t\"acirc\": '\\U000000E2',\n\t\"acute\": '\\U000000B4',\n\t\"aelig\": '\\U000000E6',\n\t\"agrave\": '\\U000000E0',\n\t\"amp\": '\\U00000026',\n\t\"aring\": '\\U000000E5',\n\t\"atilde\": '\\U000000E3',\n\t\"auml\": '\\U000000E4',\n\t\"brvbar\": '\\U000000A6',\n\t\"ccedil\": '\\U000000E7',\n\t\"cedil\": '\\U000000B8',\n\t\"cent\": '\\U000000A2',\n\t\"copy\": '\\U000000A9',\n\t\"curren\": '\\U000000A4',\n\t\"deg\": '\\U000000B0',\n\t\"divide\": '\\U000000F7',\n\t\"eacute\": '\\U000000E9',\n\t\"ecirc\": '\\U000000EA',\n\t\"egrave\": '\\U000000E8',\n\t\"eth\": '\\U000000F0',\n\t\"euml\": '\\U000000EB',\n\t\"frac12\": '\\U000000BD',\n\t\"frac14\": '\\U000000BC',\n\t\"frac34\": '\\U000000BE',\n\t\"gt\": '\\U0000003E',\n\t\"iacute\": '\\U000000ED',\n\t\"icirc\": '\\U000000EE',\n\t\"iexcl\": '\\U000000A1',\n\t\"igrave\": '\\U000000EC',\n\t\"iquest\": '\\U000000BF',\n\t\"iuml\": '\\U000000EF',\n\t\"laquo\": '\\U000000AB',\n\t\"lt\": '\\U0000003C',\n\t\"macr\": '\\U000000AF',\n\t\"micro\": '\\U000000B5',\n\t\"middot\": '\\U000000B7',\n\t\"nbsp\": '\\U000000A0',\n\t\"not\": '\\U000000AC',\n\t\"ntilde\": '\\U000000F1',\n\t\"oacute\": '\\U000000F3',\n\t\"ocirc\": '\\U000000F4',\n\t\"ograve\": '\\U000000F2',\n\t\"ordf\": '\\U000000AA',\n\t\"ordm\": '\\U000000BA',\n\t\"oslash\": '\\U000000F8',\n\t\"otilde\": '\\U000000F5',\n\t\"ouml\": '\\U000000F6',\n\t\"para\": '\\U000000B6',\n\t\"plusmn\": '\\U000000B1',\n\t\"pound\": '\\U000000A3',\n\t\"quot\": '\\U00000022',\n\t\"raquo\": '\\U000000BB',\n\t\"reg\": '\\U000000AE',\n\t\"sect\": '\\U000000A7',\n\t\"shy\": '\\U000000AD',\n\t\"sup1\": '\\U000000B9',\n\t\"sup2\": '\\U000000B2',\n\t\"sup3\": '\\U000000B3',\n\t\"szlig\": '\\U000000DF',\n\t\"thorn\": '\\U000000FE',\n\t\"times\": '\\U000000D7',\n\t\"uacute\": '\\U000000FA',\n\t\"ucirc\": '\\U000000FB',\n\t\"ugrave\": '\\U000000F9',\n\t\"uml\": '\\U000000A8',\n\t\"uuml\": '\\U000000FC',\n\t\"yacute\": '\\U000000FD',\n\t\"yen\": '\\U000000A5',\n\t\"yuml\": '\\U000000FF',\n}\n\n// HTML entities that are two unicode codepoints.\nvar entity2 = map[string][2]rune{\n\t// TODO(nigeltao): Handle replacements that are wider than their names.\n\t// \"nLt;\": {'\\u226A', '\\u20D2'},\n\t// \"nGt;\": {'\\u226B', '\\u20D2'},\n\t\"NotEqualTilde;\": {'\\u2242', '\\u0338'},\n\t\"NotGreaterFullEqual;\": {'\\u2267', '\\u0338'},\n\t\"NotGreaterGreater;\": {'\\u226B', '\\u0338'},\n\t\"NotGreaterSlantEqual;\": {'\\u2A7E', '\\u0338'},\n\t\"NotHumpDownHump;\": {'\\u224E', '\\u0338'},\n\t\"NotHumpEqual;\": {'\\u224F', '\\u0338'},\n\t\"NotLeftTriangleBar;\": {'\\u29CF', '\\u0338'},\n\t\"NotLessLess;\": {'\\u226A', '\\u0338'},\n\t\"NotLessSlantEqual;\": {'\\u2A7D', '\\u0338'},\n\t\"NotNestedGreaterGreater;\": {'\\u2AA2', '\\u0338'},\n\t\"NotNestedLessLess;\": {'\\u2AA1', '\\u0338'},\n\t\"NotPrecedesEqual;\": {'\\u2AAF', '\\u0338'},\n\t\"NotRightTriangleBar;\": {'\\u29D0', '\\u0338'},\n\t\"NotSquareSubset;\": {'\\u228F', '\\u0338'},\n\t\"NotSquareSuperset;\": {'\\u2290', '\\u0338'},\n\t\"NotSubset;\": {'\\u2282', '\\u20D2'},\n\t\"NotSucceedsEqual;\": {'\\u2AB0', '\\u0338'},\n\t\"NotSucceedsTilde;\": {'\\u227F', '\\u0338'},\n\t\"NotSuperset;\": {'\\u2283', '\\u20D2'},\n\t\"ThickSpace;\": {'\\u205F', '\\u200A'},\n\t\"acE;\": {'\\u223E', '\\u0333'},\n\t\"bne;\": {'\\u003D', '\\u20E5'},\n\t\"bnequiv;\": {'\\u2261', '\\u20E5'},\n\t\"caps;\": {'\\u2229', '\\uFE00'},\n\t\"cups;\": {'\\u222A', '\\uFE00'},\n\t\"fjlig;\": {'\\u0066', '\\u006A'},\n\t\"gesl;\": {'\\u22DB', '\\uFE00'},\n\t\"gvertneqq;\": {'\\u2269', '\\uFE00'},\n\t\"gvnE;\": {'\\u2269', '\\uFE00'},\n\t\"lates;\": {'\\u2AAD', '\\uFE00'},\n\t\"lesg;\": {'\\u22DA', '\\uFE00'},\n\t\"lvertneqq;\": {'\\u2268', '\\uFE00'},\n\t\"lvnE;\": {'\\u2268', '\\uFE00'},\n\t\"nGg;\": {'\\u22D9', '\\u0338'},\n\t\"nGtv;\": {'\\u226B', '\\u0338'},\n\t\"nLl;\": {'\\u22D8', '\\u0338'},\n\t\"nLtv;\": {'\\u226A', '\\u0338'},\n\t\"nang;\": {'\\u2220', '\\u20D2'},\n\t\"napE;\": {'\\u2A70', '\\u0338'},\n\t\"napid;\": {'\\u224B', '\\u0338'},\n\t\"nbump;\": {'\\u224E', '\\u0338'},\n\t\"nbumpe;\": {'\\u224F', '\\u0338'},\n\t\"ncongdot;\": {'\\u2A6D', '\\u0338'},\n\t\"nedot;\": {'\\u2250', '\\u0338'},\n\t\"nesim;\": {'\\u2242', '\\u0338'},\n\t\"ngE;\": {'\\u2267', '\\u0338'},\n\t\"ngeqq;\": {'\\u2267', '\\u0338'},\n\t\"ngeqslant;\": {'\\u2A7E', '\\u0338'},\n\t\"nges;\": {'\\u2A7E', '\\u0338'},\n\t\"nlE;\": {'\\u2266', '\\u0338'},\n\t\"nleqq;\": {'\\u2266', '\\u0338'},\n\t\"nleqslant;\": {'\\u2A7D', '\\u0338'},\n\t\"nles;\": {'\\u2A7D', '\\u0338'},\n\t\"notinE;\": {'\\u22F9', '\\u0338'},\n\t\"notindot;\": {'\\u22F5', '\\u0338'},\n\t\"nparsl;\": {'\\u2AFD', '\\u20E5'},\n\t\"npart;\": {'\\u2202', '\\u0338'},\n\t\"npre;\": {'\\u2AAF', '\\u0338'},\n\t\"npreceq;\": {'\\u2AAF', '\\u0338'},\n\t\"nrarrc;\": {'\\u2933', '\\u0338'},\n\t\"nrarrw;\": {'\\u219D', '\\u0338'},\n\t\"nsce;\": {'\\u2AB0', '\\u0338'},\n\t\"nsubE;\": {'\\u2AC5', '\\u0338'},\n\t\"nsubset;\": {'\\u2282', '\\u20D2'},\n\t\"nsubseteqq;\": {'\\u2AC5', '\\u0338'},\n\t\"nsucceq;\": {'\\u2AB0', '\\u0338'},\n\t\"nsupE;\": {'\\u2AC6', '\\u0338'},\n\t\"nsupset;\": {'\\u2283', '\\u20D2'},\n\t\"nsupseteqq;\": {'\\u2AC6', '\\u0338'},\n\t\"nvap;\": {'\\u224D', '\\u20D2'},\n\t\"nvge;\": {'\\u2265', '\\u20D2'},\n\t\"nvgt;\": {'\\u003E', '\\u20D2'},\n\t\"nvle;\": {'\\u2264', '\\u20D2'},\n\t\"nvlt;\": {'\\u003C', '\\u20D2'},\n\t\"nvltrie;\": {'\\u22B4', '\\u20D2'},\n\t\"nvrtrie;\": {'\\u22B5', '\\u20D2'},\n\t\"nvsim;\": {'\\u223C', '\\u20D2'},\n\t\"race;\": {'\\u223D', '\\u0331'},\n\t\"smtes;\": {'\\u2AAC', '\\uFE00'},\n\t\"sqcaps;\": {'\\u2293', '\\uFE00'},\n\t\"sqcups;\": {'\\u2294', '\\uFE00'},\n\t\"varsubsetneq;\": {'\\u228A', '\\uFE00'},\n\t\"varsubsetneqq;\": {'\\u2ACB', '\\uFE00'},\n\t\"varsupsetneq;\": {'\\u228B', '\\uFE00'},\n\t\"varsupsetneqq;\": {'\\u2ACC', '\\uFE00'},\n\t\"vnsub;\": {'\\u2282', '\\u20D2'},\n\t\"vnsup;\": {'\\u2283', '\\u20D2'},\n\t\"vsubnE;\": {'\\u2ACB', '\\uFE00'},\n\t\"vsubne;\": {'\\u228A', '\\uFE00'},\n\t\"vsupnE;\": {'\\u2ACC', '\\uFE00'},\n\t\"vsupne;\": {'\\u228B', '\\uFE00'},\n}\n" }, { "path": "vendor/golang.org/x/net/html/escape.go", "content": "// Copyright 2010 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage html\n\nimport (\n\t\"bytes\"\n\t\"strings\"\n\t\"unicode/utf8\"\n)\n\n// These replacements permit compatibility with old numeric entities that\n// assumed Windows-1252 encoding.\n// https://html.spec.whatwg.org/multipage/syntax.html#consume-a-character-reference\nvar replacementTable = [...]rune{\n\t'\\u20AC', // First entry is what 0x80 should be replaced with.\n\t'\\u0081',\n\t'\\u201A',\n\t'\\u0192',\n\t'\\u201E',\n\t'\\u2026',\n\t'\\u2020',\n\t'\\u2021',\n\t'\\u02C6',\n\t'\\u2030',\n\t'\\u0160',\n\t'\\u2039',\n\t'\\u0152',\n\t'\\u008D',\n\t'\\u017D',\n\t'\\u008F',\n\t'\\u0090',\n\t'\\u2018',\n\t'\\u2019',\n\t'\\u201C',\n\t'\\u201D',\n\t'\\u2022',\n\t'\\u2013',\n\t'\\u2014',\n\t'\\u02DC',\n\t'\\u2122',\n\t'\\u0161',\n\t'\\u203A',\n\t'\\u0153',\n\t'\\u009D',\n\t'\\u017E',\n\t'\\u0178', // Last entry is 0x9F.\n\t// 0x00->'\\uFFFD' is handled programmatically.\n\t// 0x0D->'\\u000D' is a no-op.\n}\n\n// unescapeEntity reads an entity like \"<\" from b[src:] and writes the\n// corresponding \"<\" to b[dst:], returning the incremented dst and src cursors.\n// Precondition: b[src] == '&' && dst <= src.\n// attribute should be true if parsing an attribute value.\nfunc unescapeEntity(b []byte, dst, src int, attribute bool) (dst1, src1 int) {\n\t// https://html.spec.whatwg.org/multipage/syntax.html#consume-a-character-reference\n\n\t// i starts at 1 because we already know that s[0] == '&'.\n\ti, s := 1, b[src:]\n\n\tif len(s) <= 1 {\n\t\tb[dst] = b[src]\n\t\treturn dst + 1, src + 1\n\t}\n\n\tif s[i] == '#' {\n\t\tif len(s) <= 3 { // We need to have at least \"&#.\".\n\t\t\tb[dst] = b[src]\n\t\t\treturn dst + 1, src + 1\n\t\t}\n\t\ti++\n\t\tc := s[i]\n\t\thex := false\n\t\tif c == 'x' || c == 'X' {\n\t\t\thex = true\n\t\t\ti++\n\t\t}\n\n\t\tx := '\\x00'\n\t\tfor i < len(s) {\n\t\t\tc = s[i]\n\t\t\ti++\n\t\t\tif hex {\n\t\t\t\tif '0' <= c && c <= '9' {\n\t\t\t\t\tx = 16*x + rune(c) - '0'\n\t\t\t\t\tcontinue\n\t\t\t\t} else if 'a' <= c && c <= 'f' {\n\t\t\t\t\tx = 16*x + rune(c) - 'a' + 10\n\t\t\t\t\tcontinue\n\t\t\t\t} else if 'A' <= c && c <= 'F' {\n\t\t\t\t\tx = 16*x + rune(c) - 'A' + 10\n\t\t\t\t\tcontinue\n\t\t\t\t}\n\t\t\t} else if '0' <= c && c <= '9' {\n\t\t\t\tx = 10*x + rune(c) - '0'\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tif c != ';' {\n\t\t\t\ti--\n\t\t\t}\n\t\t\tbreak\n\t\t}\n\n\t\tif i <= 3 { // No characters matched.\n\t\t\tb[dst] = b[src]\n\t\t\treturn dst + 1, src + 1\n\t\t}\n\n\t\tif 0x80 <= x && x <= 0x9F {\n\t\t\t// Replace characters from Windows-1252 with UTF-8 equivalents.\n\t\t\tx = replacementTable[x-0x80]\n\t\t} else if x == 0 || (0xD800 <= x && x <= 0xDFFF) || x > 0x10FFFF {\n\t\t\t// Replace invalid characters with the replacement character.\n\t\t\tx = '\\uFFFD'\n\t\t}\n\n\t\treturn dst + utf8.EncodeRune(b[dst:], x), src + i\n\t}\n\n\t// Consume the maximum number of characters possible, with the\n\t// consumed characters matching one of the named references.\n\n\tfor i < len(s) {\n\t\tc := s[i]\n\t\ti++\n\t\t// Lower-cased characters are more common in entities, so we check for them first.\n\t\tif 'a' <= c && c <= 'z' || 'A' <= c && c <= 'Z' || '0' <= c && c <= '9' {\n\t\t\tcontinue\n\t\t}\n\t\tif c != ';' {\n\t\t\ti--\n\t\t}\n\t\tbreak\n\t}\n\n\tentityName := string(s[1:i])\n\tif entityName == \"\" {\n\t\t// No-op.\n\t} else if attribute && entityName[len(entityName)-1] != ';' && len(s) > i && s[i] == '=' {\n\t\t// No-op.\n\t} else if x := entity[entityName]; x != 0 {\n\t\treturn dst + utf8.EncodeRune(b[dst:], x), src + i\n\t} else if x := entity2[entityName]; x[0] != 0 {\n\t\tdst1 := dst + utf8.EncodeRune(b[dst:], x[0])\n\t\treturn dst1 + utf8.EncodeRune(b[dst1:], x[1]), src + i\n\t} else if !attribute {\n\t\tmaxLen := len(entityName) - 1\n\t\tif maxLen > longestEntityWithoutSemicolon {\n\t\t\tmaxLen = longestEntityWithoutSemicolon\n\t\t}\n\t\tfor j := maxLen; j > 1; j-- {\n\t\t\tif x := entity[entityName[:j]]; x != 0 {\n\t\t\t\treturn dst + utf8.EncodeRune(b[dst:], x), src + j + 1\n\t\t\t}\n\t\t}\n\t}\n\n\tdst1, src1 = dst+i, src+i\n\tcopy(b[dst:dst1], b[src:src1])\n\treturn dst1, src1\n}\n\n// unescape unescapes b's entities in-place, so that \"a<b\" becomes \"a\\\"\\r\"\n\nfunc escape(w writer, s string) error {\n\ti := strings.IndexAny(s, escapedChars)\n\tfor i != -1 {\n\t\tif _, err := w.WriteString(s[:i]); err != nil {\n\t\t\treturn err\n\t\t}\n\t\tvar esc string\n\t\tswitch s[i] {\n\t\tcase '&':\n\t\t\tesc = \"&\"\n\t\tcase '\\'':\n\t\t\t// \"'\" is shorter than \"'\" and apos was not in HTML until HTML5.\n\t\t\tesc = \"'\"\n\t\tcase '<':\n\t\t\tesc = \"<\"\n\t\tcase '>':\n\t\t\tesc = \">\"\n\t\tcase '\"':\n\t\t\t// \""\" is shorter than \""\".\n\t\t\tesc = \""\"\n\t\tcase '\\r':\n\t\t\tesc = \" \"\n\t\tdefault:\n\t\t\tpanic(\"unrecognized escape character\")\n\t\t}\n\t\ts = s[i+1:]\n\t\tif _, err := w.WriteString(esc); err != nil {\n\t\t\treturn err\n\t\t}\n\t\ti = strings.IndexAny(s, escapedChars)\n\t}\n\t_, err := w.WriteString(s)\n\treturn err\n}\n\n// EscapeString escapes special characters like \"<\" to become \"<\". It\n// escapes only five such characters: <, >, &, ' and \".\n// UnescapeString(EscapeString(s)) == s always holds, but the converse isn't\n// always true.\nfunc EscapeString(s string) string {\n\tif strings.IndexAny(s, escapedChars) == -1 {\n\t\treturn s\n\t}\n\tvar buf bytes.Buffer\n\tescape(&buf, s)\n\treturn buf.String()\n}\n\n// UnescapeString unescapes entities like \"<\" to become \"<\". It unescapes a\n// larger range of entities than EscapeString escapes. For example, \"á\"\n// unescapes to \"á\", as does \"á\" and \"&xE1;\".\n// UnescapeString(EscapeString(s)) == s always holds, but the converse isn't\n// always true.\nfunc UnescapeString(s string) string {\n\tfor _, c := range s {\n\t\tif c == '&' {\n\t\t\treturn string(unescape([]byte(s), false))\n\t\t}\n\t}\n\treturn s\n}\n" }, { "path": "vendor/golang.org/x/net/html/foreign.go", "content": "// Copyright 2011 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage html\n\nimport (\n\t\"strings\"\n)\n\nfunc adjustAttributeNames(aa []Attribute, nameMap map[string]string) {\n\tfor i := range aa {\n\t\tif newName, ok := nameMap[aa[i].Key]; ok {\n\t\t\taa[i].Key = newName\n\t\t}\n\t}\n}\n\nfunc adjustForeignAttributes(aa []Attribute) {\n\tfor i, a := range aa {\n\t\tif a.Key == \"\" || a.Key[0] != 'x' {\n\t\t\tcontinue\n\t\t}\n\t\tswitch a.Key {\n\t\tcase \"xlink:actuate\", \"xlink:arcrole\", \"xlink:href\", \"xlink:role\", \"xlink:show\",\n\t\t\t\"xlink:title\", \"xlink:type\", \"xml:base\", \"xml:lang\", \"xml:space\", \"xmlns:xlink\":\n\t\t\tj := strings.Index(a.Key, \":\")\n\t\t\taa[i].Namespace = a.Key[:j]\n\t\t\taa[i].Key = a.Key[j+1:]\n\t\t}\n\t}\n}\n\nfunc htmlIntegrationPoint(n *Node) bool {\n\tif n.Type != ElementNode {\n\t\treturn false\n\t}\n\tswitch n.Namespace {\n\tcase \"math\":\n\t\tif n.Data == \"annotation-xml\" {\n\t\t\tfor _, a := range n.Attr {\n\t\t\t\tif a.Key == \"encoding\" {\n\t\t\t\t\tval := strings.ToLower(a.Val)\n\t\t\t\t\tif val == \"text/html\" || val == \"application/xhtml+xml\" {\n\t\t\t\t\t\treturn true\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\tcase \"svg\":\n\t\tswitch n.Data {\n\t\tcase \"desc\", \"foreignObject\", \"title\":\n\t\t\treturn true\n\t\t}\n\t}\n\treturn false\n}\n\nfunc mathMLTextIntegrationPoint(n *Node) bool {\n\tif n.Namespace != \"math\" {\n\t\treturn false\n\t}\n\tswitch n.Data {\n\tcase \"mi\", \"mo\", \"mn\", \"ms\", \"mtext\":\n\t\treturn true\n\t}\n\treturn false\n}\n\n// Section 12.2.6.5.\nvar breakout = map[string]bool{\n\t\"b\": true,\n\t\"big\": true,\n\t\"blockquote\": true,\n\t\"body\": true,\n\t\"br\": true,\n\t\"center\": true,\n\t\"code\": true,\n\t\"dd\": true,\n\t\"div\": true,\n\t\"dl\": true,\n\t\"dt\": true,\n\t\"em\": true,\n\t\"embed\": true,\n\t\"h1\": true,\n\t\"h2\": true,\n\t\"h3\": true,\n\t\"h4\": true,\n\t\"h5\": true,\n\t\"h6\": true,\n\t\"head\": true,\n\t\"hr\": true,\n\t\"i\": true,\n\t\"img\": true,\n\t\"li\": true,\n\t\"listing\": true,\n\t\"menu\": true,\n\t\"meta\": true,\n\t\"nobr\": true,\n\t\"ol\": true,\n\t\"p\": true,\n\t\"pre\": true,\n\t\"ruby\": true,\n\t\"s\": true,\n\t\"small\": true,\n\t\"span\": true,\n\t\"strong\": true,\n\t\"strike\": true,\n\t\"sub\": true,\n\t\"sup\": true,\n\t\"table\": true,\n\t\"tt\": true,\n\t\"u\": true,\n\t\"ul\": true,\n\t\"var\": true,\n}\n\n// Section 12.2.6.5.\nvar svgTagNameAdjustments = map[string]string{\n\t\"altglyph\": \"altGlyph\",\n\t\"altglyphdef\": \"altGlyphDef\",\n\t\"altglyphitem\": \"altGlyphItem\",\n\t\"animatecolor\": \"animateColor\",\n\t\"animatemotion\": \"animateMotion\",\n\t\"animatetransform\": \"animateTransform\",\n\t\"clippath\": \"clipPath\",\n\t\"feblend\": \"feBlend\",\n\t\"fecolormatrix\": \"feColorMatrix\",\n\t\"fecomponenttransfer\": \"feComponentTransfer\",\n\t\"fecomposite\": \"feComposite\",\n\t\"feconvolvematrix\": \"feConvolveMatrix\",\n\t\"fediffuselighting\": \"feDiffuseLighting\",\n\t\"fedisplacementmap\": \"feDisplacementMap\",\n\t\"fedistantlight\": \"feDistantLight\",\n\t\"feflood\": \"feFlood\",\n\t\"fefunca\": \"feFuncA\",\n\t\"fefuncb\": \"feFuncB\",\n\t\"fefuncg\": \"feFuncG\",\n\t\"fefuncr\": \"feFuncR\",\n\t\"fegaussianblur\": \"feGaussianBlur\",\n\t\"feimage\": \"feImage\",\n\t\"femerge\": \"feMerge\",\n\t\"femergenode\": \"feMergeNode\",\n\t\"femorphology\": \"feMorphology\",\n\t\"feoffset\": \"feOffset\",\n\t\"fepointlight\": \"fePointLight\",\n\t\"fespecularlighting\": \"feSpecularLighting\",\n\t\"fespotlight\": \"feSpotLight\",\n\t\"fetile\": \"feTile\",\n\t\"feturbulence\": \"feTurbulence\",\n\t\"foreignobject\": \"foreignObject\",\n\t\"glyphref\": \"glyphRef\",\n\t\"lineargradient\": \"linearGradient\",\n\t\"radialgradient\": \"radialGradient\",\n\t\"textpath\": \"textPath\",\n}\n\n// Section 12.2.6.1\nvar mathMLAttributeAdjustments = map[string]string{\n\t\"definitionurl\": \"definitionURL\",\n}\n\nvar svgAttributeAdjustments = map[string]string{\n\t\"attributename\": \"attributeName\",\n\t\"attributetype\": \"attributeType\",\n\t\"basefrequency\": \"baseFrequency\",\n\t\"baseprofile\": \"baseProfile\",\n\t\"calcmode\": \"calcMode\",\n\t\"clippathunits\": \"clipPathUnits\",\n\t\"diffuseconstant\": \"diffuseConstant\",\n\t\"edgemode\": \"edgeMode\",\n\t\"filterunits\": \"filterUnits\",\n\t\"glyphref\": \"glyphRef\",\n\t\"gradienttransform\": \"gradientTransform\",\n\t\"gradientunits\": \"gradientUnits\",\n\t\"kernelmatrix\": \"kernelMatrix\",\n\t\"kernelunitlength\": \"kernelUnitLength\",\n\t\"keypoints\": \"keyPoints\",\n\t\"keysplines\": \"keySplines\",\n\t\"keytimes\": \"keyTimes\",\n\t\"lengthadjust\": \"lengthAdjust\",\n\t\"limitingconeangle\": \"limitingConeAngle\",\n\t\"markerheight\": \"markerHeight\",\n\t\"markerunits\": \"markerUnits\",\n\t\"markerwidth\": \"markerWidth\",\n\t\"maskcontentunits\": \"maskContentUnits\",\n\t\"maskunits\": \"maskUnits\",\n\t\"numoctaves\": \"numOctaves\",\n\t\"pathlength\": \"pathLength\",\n\t\"patterncontentunits\": \"patternContentUnits\",\n\t\"patterntransform\": \"patternTransform\",\n\t\"patternunits\": \"patternUnits\",\n\t\"pointsatx\": \"pointsAtX\",\n\t\"pointsaty\": \"pointsAtY\",\n\t\"pointsatz\": \"pointsAtZ\",\n\t\"preservealpha\": \"preserveAlpha\",\n\t\"preserveaspectratio\": \"preserveAspectRatio\",\n\t\"primitiveunits\": \"primitiveUnits\",\n\t\"refx\": \"refX\",\n\t\"refy\": \"refY\",\n\t\"repeatcount\": \"repeatCount\",\n\t\"repeatdur\": \"repeatDur\",\n\t\"requiredextensions\": \"requiredExtensions\",\n\t\"requiredfeatures\": \"requiredFeatures\",\n\t\"specularconstant\": \"specularConstant\",\n\t\"specularexponent\": \"specularExponent\",\n\t\"spreadmethod\": \"spreadMethod\",\n\t\"startoffset\": \"startOffset\",\n\t\"stddeviation\": \"stdDeviation\",\n\t\"stitchtiles\": \"stitchTiles\",\n\t\"surfacescale\": \"surfaceScale\",\n\t\"systemlanguage\": \"systemLanguage\",\n\t\"tablevalues\": \"tableValues\",\n\t\"targetx\": \"targetX\",\n\t\"targety\": \"targetY\",\n\t\"textlength\": \"textLength\",\n\t\"viewbox\": \"viewBox\",\n\t\"viewtarget\": \"viewTarget\",\n\t\"xchannelselector\": \"xChannelSelector\",\n\t\"ychannelselector\": \"yChannelSelector\",\n\t\"zoomandpan\": \"zoomAndPan\",\n}\n" }, { "path": "vendor/golang.org/x/net/html/node.go", "content": "// Copyright 2011 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage html\n\nimport (\n\t\"golang.org/x/net/html/atom\"\n)\n\n// A NodeType is the type of a Node.\ntype NodeType uint32\n\nconst (\n\tErrorNode NodeType = iota\n\tTextNode\n\tDocumentNode\n\tElementNode\n\tCommentNode\n\tDoctypeNode\n\t// RawNode nodes are not returned by the parser, but can be part of the\n\t// Node tree passed to func Render to insert raw HTML (without escaping).\n\t// If so, this package makes no guarantee that the rendered HTML is secure\n\t// (from e.g. Cross Site Scripting attacks) or well-formed.\n\tRawNode\n\tscopeMarkerNode\n)\n\n// Section 12.2.4.3 says \"The markers are inserted when entering applet,\n// object, marquee, template, td, th, and caption elements, and are used\n// to prevent formatting from \"leaking\" into applet, object, marquee,\n// template, td, th, and caption elements\".\nvar scopeMarker = Node{Type: scopeMarkerNode}\n\n// A Node consists of a NodeType and some Data (tag name for element nodes,\n// content for text) and are part of a tree of Nodes. Element nodes may also\n// have a Namespace and contain a slice of Attributes. Data is unescaped, so\n// that it looks like \"a 0 {\n\t\treturn (*s)[i-1]\n\t}\n\treturn nil\n}\n\n// index returns the index of the top-most occurrence of n in the stack, or -1\n// if n is not present.\nfunc (s *nodeStack) index(n *Node) int {\n\tfor i := len(*s) - 1; i >= 0; i-- {\n\t\tif (*s)[i] == n {\n\t\t\treturn i\n\t\t}\n\t}\n\treturn -1\n}\n\n// contains returns whether a is within s.\nfunc (s *nodeStack) contains(a atom.Atom) bool {\n\tfor _, n := range *s {\n\t\tif n.DataAtom == a && n.Namespace == \"\" {\n\t\t\treturn true\n\t\t}\n\t}\n\treturn false\n}\n\n// insert inserts a node at the given index.\nfunc (s *nodeStack) insert(i int, n *Node) {\n\t(*s) = append(*s, nil)\n\tcopy((*s)[i+1:], (*s)[i:])\n\t(*s)[i] = n\n}\n\n// remove removes a node from the stack. It is a no-op if n is not present.\nfunc (s *nodeStack) remove(n *Node) {\n\ti := s.index(n)\n\tif i == -1 {\n\t\treturn\n\t}\n\tcopy((*s)[i:], (*s)[i+1:])\n\tj := len(*s) - 1\n\t(*s)[j] = nil\n\t*s = (*s)[:j]\n}\n\ntype insertionModeStack []insertionMode\n\nfunc (s *insertionModeStack) pop() (im insertionMode) {\n\ti := len(*s)\n\tim = (*s)[i-1]\n\t*s = (*s)[:i-1]\n\treturn im\n}\n\nfunc (s *insertionModeStack) top() insertionMode {\n\tif i := len(*s); i > 0 {\n\t\treturn (*s)[i-1]\n\t}\n\treturn nil\n}\n" }, { "path": "vendor/golang.org/x/net/html/parse.go", "content": "// Copyright 2010 The Go Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style\n// license that can be found in the LICENSE file.\n\npackage html\n\nimport (\n\t\"errors\"\n\t\"fmt\"\n\t\"io\"\n\t\"strings\"\n\n\ta \"golang.org/x/net/html/atom\"\n)\n\n// A parser implements the HTML5 parsing algorithm:\n// https://html.spec.whatwg.org/multipage/syntax.html#tree-construction\ntype parser struct {\n\t// tokenizer provides the tokens for the parser.\n\ttokenizer *Tokenizer\n\t// tok is the most recently read token.\n\ttok Token\n\t// Self-closing tags like
are treated as start tags, except that\n\t// hasSelfClosingToken is set while they are being processed.\n\thasSelfClosingToken bool\n\t// doc is the document root element.\n\tdoc *Node\n\t// The stack of open elements (section 12.2.4.2) and active formatting\n\t// elements (section 12.2.4.3).\n\toe, afe nodeStack\n\t// Element pointers (section 12.2.4.4).\n\thead, form *Node\n\t// Other parsing state flags (section 12.2.4.5).\n\tscripting, framesetOK bool\n\t// The stack of template insertion modes\n\ttemplateStack insertionModeStack\n\t// im is the current insertion mode.\n\tim insertionMode\n\t// originalIM is the insertion mode to go back to after completing a text\n\t// or inTableText insertion mode.\n\toriginalIM insertionMode\n\t// fosterParenting is whether new elements should be inserted according to\n\t// the foster parenting rules (section 12.2.6.1).\n\tfosterParenting bool\n\t// quirks is whether the parser is operating in \"quirks mode.\"\n\tquirks bool\n\t// fragment is whether the parser is parsing an HTML fragment.\n\tfragment bool\n\t// context is the context element when parsing an HTML fragment\n\t// (section 12.4).\n\tcontext *Node\n}\n\nfunc (p *parser) top() *Node {\n\tif n := p.oe.top(); n != nil {\n\t\treturn n\n\t}\n\treturn p.doc\n}\n\n// Stop tags for use in popUntil. These come from section 12.2.4.2.\nvar (\n\tdefaultScopeStopTags = map[string][]a.Atom{\n\t\t\"\": {a.Applet, a.Caption, a.Html, a.Table, a.Td, a.Th, a.Marquee, a.Object, a.Template},\n\t\t\"math\": {a.AnnotationXml, a.Mi, a.Mn, a.Mo, a.Ms, a.Mtext},\n\t\t\"svg\": {a.Desc, a.ForeignObject, a.Title},\n\t}\n)\n\ntype scope int\n\nconst (\n\tdefaultScope scope = iota\n\tlistItemScope\n\tbuttonScope\n\ttableScope\n\ttableRowScope\n\ttableBodyScope\n\tselectScope\n)\n\n// popUntil pops the stack of open elements at the highest element whose tag\n// is in matchTags, provided there is no higher element in the scope's stop\n// tags (as defined in section 12.2.4.2). It returns whether or not there was\n// such an element. If there was not, popUntil leaves the stack unchanged.\n//\n// For example, the set of stop tags for table scope is: \"html\", \"table\". If\n// the stack was:\n// [\"html\", \"body\", \"font\", \"table\", \"b\", \"i\", \"u\"]\n// then popUntil(tableScope, \"font\") would return false, but\n// popUntil(tableScope, \"i\") would return true and the stack would become:\n// [\"html\", \"body\", \"font\", \"table\", \"b\"]\n//\n// If an element's tag is in both the stop tags and matchTags, then the stack\n// will be popped and the function returns true (provided, of course, there was\n// no higher element in the stack that was also in the stop tags). For example,\n// popUntil(tableScope, \"table\") returns true and leaves:\n// [\"html\", \"body\", \"font\"]\nfunc (p *parser) popUntil(s scope, matchTags ...a.Atom) bool {\n\tif i := p.indexOfElementInScope(s, matchTags...); i != -1 {\n\t\tp.oe = p.oe[:i]\n\t\treturn true\n\t}\n\treturn false\n}\n\n// indexOfElementInScope returns the index in p.oe of the highest element whose\n// tag is in matchTags that is in scope. If no matching element is in scope, it\n// returns -1.\nfunc (p *parser) indexOfElementInScope(s scope, matchTags ...a.Atom) int {\n\tfor i := len(p.oe) - 1; i >= 0; i-- {\n\t\ttagAtom := p.oe[i].DataAtom\n\t\tif p.oe[i].Namespace == \"\" {\n\t\t\tfor _, t := range matchTags {\n\t\t\t\tif t == tagAtom {\n\t\t\t\t\treturn i\n\t\t\t\t}\n\t\t\t}\n\t\t\tswitch s {\n\t\t\tcase defaultScope:\n\t\t\t\t// No-op.\n\t\t\tcase listItemScope:\n\t\t\t\tif tagAtom == a.Ol || tagAtom == a.Ul {\n\t\t\t\t\treturn -1\n\t\t\t\t}\n\t\t\tcase buttonScope:\n\t\t\t\tif tagAtom == a.Button {\n\t\t\t\t\treturn -1\n\t\t\t\t}\n\t\t\tcase tableScope:\n\t\t\t\tif tagAtom == a.Html || tagAtom == a.Table || tagAtom == a.Template {\n\t\t\t\t\treturn -1\n\t\t\t\t}\n\t\t\tcase selectScope:\n\t\t\t\tif tagAtom != a.Optgroup && tagAtom != a.Option {\n\t\t\t\t\treturn -1\n\t\t\t\t}\n\t\t\tdefault:\n\t\t\t\tpanic(\"unreachable\")\n\t\t\t}\n\t\t}\n\t\tswitch s {\n\t\tcase defaultScope, listItemScope, buttonScope:\n\t\t\tfor _, t := range defaultScopeStopTags[p.oe[i].Namespace] {\n\t\t\t\tif t == tagAtom {\n\t\t\t\t\treturn -1\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn -1\n}\n\n// elementInScope is like popUntil, except that it doesn't modify the stack of\n// open elements.\nfunc (p *parser) elementInScope(s scope, matchTags ...a.Atom) bool {\n\treturn p.indexOfElementInScope(s, matchTags...) != -1\n}\n\n// clearStackToContext pops elements off the stack of open elements until a\n// scope-defined element is found.\nfunc (p *parser) clearStackToContext(s scope) {\n\tfor i := len(p.oe) - 1; i >= 0; i-- {\n\t\ttagAtom := p.oe[i].DataAtom\n\t\tswitch s {\n\t\tcase tableScope:\n\t\t\tif tagAtom == a.Html || tagAtom == a.Table || tagAtom == a.Template {\n\t\t\t\tp.oe = p.oe[:i+1]\n\t\t\t\treturn\n\t\t\t}\n\t\tcase tableRowScope:\n\t\t\tif tagAtom == a.Html || tagAtom == a.Tr || tagAtom == a.Template {\n\t\t\t\tp.oe = p.oe[:i+1]\n\t\t\t\treturn\n\t\t\t}\n\t\tcase tableBodyScope:\n\t\t\tif tagAtom == a.Html || tagAtom == a.Tbody || tagAtom == a.Tfoot || tagAtom == a.Thead || tagAtom == a.Template {\n\t\t\t\tp.oe = p.oe[:i+1]\n\t\t\t\treturn\n\t\t\t}\n\t\tdefault:\n\t\t\tpanic(\"unreachable\")\n\t\t}\n\t}\n}\n\n// parseGenericRawTextElements implements the generic raw text element parsing\n// algorithm defined in 12.2.6.2.\n// https://html.spec.whatwg.org/multipage/parsing.html#parsing-elements-that-contain-only-text\n// TODO: Since both RAWTEXT and RCDATA states are treated as tokenizer's part\n// officially, need to make tokenizer consider both states.\nfunc (p *parser) parseGenericRawTextElement() {\n\tp.addElement()\n\tp.originalIM = p.im\n\tp.im = textIM\n}\n\n// generateImpliedEndTags pops nodes off the stack of open elements as long as\n// the top node has a tag name of dd, dt, li, optgroup, option, p, rb, rp, rt or rtc.\n// If exceptions are specified, nodes with that name will not be popped off.\nfunc (p *parser) generateImpliedEndTags(exceptions ...string) {\n\tvar i int\nloop:\n\tfor i = len(p.oe) - 1; i >= 0; i-- {\n\t\tn := p.oe[i]\n\t\tif n.Type != ElementNode {\n\t\t\tbreak\n\t\t}\n\t\tswitch n.DataAtom {\n\t\tcase a.Dd, a.Dt, a.Li, a.Optgroup, a.Option, a.P, a.Rb, a.Rp, a.Rt, a.Rtc:\n\t\t\tfor _, except := range exceptions {\n\t\t\t\tif n.Data == except {\n\t\t\t\t\tbreak loop\n\t\t\t\t}\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\tbreak\n\t}\n\n\tp.oe = p.oe[:i+1]\n}\n\n// addChild adds a child node n to the top element, and pushes n onto the stack\n// of open elements if it is an element node.\nfunc (p *parser) addChild(n *Node) {\n\tif p.shouldFosterParent() {\n\t\tp.fosterParent(n)\n\t} else {\n\t\tp.top().AppendChild(n)\n\t}\n\n\tif n.Type == ElementNode {\n\t\tp.oe = append(p.oe, n)\n\t}\n}\n\n// shouldFosterParent returns whether the next node to be added should be\n// foster parented.\nfunc (p *parser) shouldFosterParent() bool {\n\tif p.fosterParenting {\n\t\tswitch p.top().DataAtom {\n\t\tcase a.Table, a.Tbody, a.Tfoot, a.Thead, a.Tr:\n\t\t\treturn true\n\t\t}\n\t}\n\treturn false\n}\n\n// fosterParent adds a child node according to the foster parenting rules.\n// Section 12.2.6.1, \"foster parenting\".\nfunc (p *parser) fosterParent(n *Node) {\n\tvar table, parent, prev, template *Node\n\tvar i int\n\tfor i = len(p.oe) - 1; i >= 0; i-- {\n\t\tif p.oe[i].DataAtom == a.Table {\n\t\t\ttable = p.oe[i]\n\t\t\tbreak\n\t\t}\n\t}\n\n\tvar j int\n\tfor j = len(p.oe) - 1; j >= 0; j-- {\n\t\tif p.oe[j].DataAtom == a.Template {\n\t\t\ttemplate = p.oe[j]\n\t\t\tbreak\n\t\t}\n\t}\n\n\tif template != nil && (table == nil || j > i) {\n\t\ttemplate.AppendChild(n)\n\t\treturn\n\t}\n\n\tif table == nil {\n\t\t// The foster parent is the html element.\n\t\tparent = p.oe[0]\n\t} else {\n\t\tparent = table.Parent\n\t}\n\tif parent == nil {\n\t\tparent = p.oe[i-1]\n\t}\n\n\tif table != nil {\n\t\tprev = table.PrevSibling\n\t} else {\n\t\tprev = parent.LastChild\n\t}\n\tif prev != nil && prev.Type == TextNode && n.Type == TextNode {\n\t\tprev.Data += n.Data\n\t\treturn\n\t}\n\n\tparent.InsertBefore(n, table)\n}\n\n// addText adds text to the preceding node if it is a text node, or else it\n// calls addChild with a new text node.\nfunc (p *parser) addText(text string) {\n\tif text == \"\" {\n\t\treturn\n\t}\n\n\tif p.shouldFosterParent() {\n\t\tp.fosterParent(&Node{\n\t\t\tType: TextNode,\n\t\t\tData: text,\n\t\t})\n\t\treturn\n\t}\n\n\tt := p.top()\n\tif n := t.LastChild; n != nil && n.Type == TextNode {\n\t\tn.Data += text\n\t\treturn\n\t}\n\tp.addChild(&Node{\n\t\tType: TextNode,\n\t\tData: text,\n\t})\n}\n\n// addElement adds a child element based on the current token.\nfunc (p *parser) addElement() {\n\tp.addChild(&Node{\n\t\tType: ElementNode,\n\t\tDataAtom: p.tok.DataAtom,\n\t\tData: p.tok.Data,\n\t\tAttr: p.tok.Attr,\n\t})\n}\n\n// Section 12.2.4.3.\nfunc (p *parser) addFormattingElement() {\n\ttagAtom, attr := p.tok.DataAtom, p.tok.Attr\n\tp.addElement()\n\n\t// Implement the Noah's Ark clause, but with three per family instead of two.\n\tidenticalElements := 0\nfindIdenticalElements:\n\tfor i := len(p.afe) - 1; i >= 0; i-- {\n\t\tn := p.afe[i]\n\t\tif n.Type == scopeMarkerNode {\n\t\t\tbreak\n\t\t}\n\t\tif n.Type != ElementNode {\n\t\t\tcontinue\n\t\t}\n\t\tif n.Namespace != \"\" {\n\t\t\tcontinue\n\t\t}\n\t\tif n.DataAtom != tagAtom {\n\t\t\tcontinue\n\t\t}\n\t\tif len(n.Attr) != len(attr) {\n\t\t\tcontinue\n\t\t}\n\tcompareAttributes:\n\t\tfor _, t0 := range n.Attr {\n\t\t\tfor _, t1 := range attr {\n\t\t\t\tif t0.Key == t1.Key && t0.Namespace == t1.Namespace && t0.Val == t1.Val {\n\t\t\t\t\t// Found a match for this attribute, continue with the next attribute.\n\t\t\t\t\tcontinue compareAttributes\n\t\t\t\t}\n\t\t\t}\n\t\t\t// If we get here, there is no attribute that matches a.\n\t\t\t// Therefore the element is not identical to the new one.\n\t\t\tcontinue findIdenticalElements\n\t\t}\n\n\t\tidenticalElements++\n\t\tif identicalElements >= 3 {\n\t\t\tp.afe.remove(n)\n\t\t}\n\t}\n\n\tp.afe = append(p.afe, p.top())\n}\n\n// Section 12.2.4.3.\nfunc (p *parser) clearActiveFormattingElements() {\n\tfor {\n\t\tif n := p.afe.pop(); len(p.afe) == 0 || n.Type == scopeMarkerNode {\n\t\t\treturn\n\t\t}\n\t}\n}\n\n// Section 12.2.4.3.\nfunc (p *parser) reconstructActiveFormattingElements() {\n\tn := p.afe.top()\n\tif n == nil {\n\t\treturn\n\t}\n\tif n.Type == scopeMarkerNode || p.oe.index(n) != -1 {\n\t\treturn\n\t}\n\ti := len(p.afe) - 1\n\tfor n.Type != scopeMarkerNode && p.oe.index(n) == -1 {\n\t\tif i == 0 {\n\t\t\ti = -1\n\t\t\tbreak\n\t\t}\n\t\ti--\n\t\tn = p.afe[i]\n\t}\n\tfor {\n\t\ti++\n\t\tclone := p.afe[i].clone()\n\t\tp.addChild(clone)\n\t\tp.afe[i] = clone\n\t\tif i == len(p.afe)-1 {\n\t\t\tbreak\n\t\t}\n\t}\n}\n\n// Section 12.2.5.\nfunc (p *parser) acknowledgeSelfClosingTag() {\n\tp.hasSelfClosingToken = false\n}\n\n// An insertion mode (section 12.2.4.1) is the state transition function from\n// a particular state in the HTML5 parser's state machine. It updates the\n// parser's fields depending on parser.tok (where ErrorToken means EOF).\n// It returns whether the token was consumed.\ntype insertionMode func(*parser) bool\n\n// setOriginalIM sets the insertion mode to return to after completing a text or\n// inTableText insertion mode.\n// Section 12.2.4.1, \"using the rules for\".\nfunc (p *parser) setOriginalIM() {\n\tif p.originalIM != nil {\n\t\tpanic(\"html: bad parser state: originalIM was set twice\")\n\t}\n\tp.originalIM = p.im\n}\n\n// Section 12.2.4.1, \"reset the insertion mode\".\nfunc (p *parser) resetInsertionMode() {\n\tfor i := len(p.oe) - 1; i >= 0; i-- {\n\t\tn := p.oe[i]\n\t\tlast := i == 0\n\t\tif last && p.context != nil {\n\t\t\tn = p.context\n\t\t}\n\n\t\tswitch n.DataAtom {\n\t\tcase a.Select:\n\t\t\tif !last {\n\t\t\t\tfor ancestor, first := n, p.oe[0]; ancestor != first; {\n\t\t\t\t\tancestor = p.oe[p.oe.index(ancestor)-1]\n\t\t\t\t\tswitch ancestor.DataAtom {\n\t\t\t\t\tcase a.Template:\n\t\t\t\t\t\tp.im = inSelectIM\n\t\t\t\t\t\treturn\n\t\t\t\t\tcase a.Table:\n\t\t\t\t\t\tp.im = inSelectInTableIM\n\t\t\t\t\t\treturn\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tp.im = inSelectIM\n\t\tcase a.Td, a.Th:\n\t\t\t// TODO: remove this divergence from the HTML5 spec.\n\t\t\t//\n\t\t\t// See https://bugs.chromium.org/p/chromium/issues/detail?id=829668\n\t\t\tp.im = inCellIM\n\t\tcase a.Tr:\n\t\t\tp.im = inRowIM\n\t\tcase a.Tbody, a.Thead, a.Tfoot:\n\t\t\tp.im = inTableBodyIM\n\t\tcase a.Caption:\n\t\t\tp.im = inCaptionIM\n\t\tcase a.Colgroup:\n\t\t\tp.im = inColumnGroupIM\n\t\tcase a.Table:\n\t\t\tp.im = inTableIM\n\t\tcase a.Template:\n\t\t\t// TODO: remove this divergence from the HTML5 spec.\n\t\t\tif n.Namespace != \"\" {\n\t\t\t\tcontinue\n\t\t\t}\n\t\t\tp.im = p.templateStack.top()\n\t\tcase a.Head:\n\t\t\t// TODO: remove this divergence from the HTML5 spec.\n\t\t\t//\n\t\t\t// See https://bugs.chromium.org/p/chromium/issues/detail?id=829668\n\t\t\tp.im = inHeadIM\n\t\tcase a.Body:\n\t\t\tp.im = inBodyIM\n\t\tcase a.Frameset:\n\t\t\tp.im = inFramesetIM\n\t\tcase a.Html:\n\t\t\tif p.head == nil {\n\t\t\t\tp.im = beforeHeadIM\n\t\t\t} else {\n\t\t\t\tp.im = afterHeadIM\n\t\t\t}\n\t\tdefault:\n\t\t\tif last {\n\t\t\t\tp.im = inBodyIM\n\t\t\t\treturn\n\t\t\t}\n\t\t\tcontinue\n\t\t}\n\t\treturn\n\t}\n}\n\nconst whitespace = \" \\t\\r\\n\\f\"\n\n// Section 12.2.6.4.1.\nfunc initialIM(p *parser) bool {\n\tswitch p.tok.Type {\n\tcase TextToken:\n\t\tp.tok.Data = strings.TrimLeft(p.tok.Data, whitespace)\n\t\tif len(p.tok.Data) == 0 {\n\t\t\t// It was all whitespace, so ignore it.\n\t\t\treturn true\n\t\t}\n\tcase CommentToken:\n\t\tp.doc.AppendChild(&Node{\n\t\t\tType: CommentNode,\n\t\t\tData: p.tok.Data,\n\t\t})\n\t\treturn true\n\tcase DoctypeToken:\n\t\tn, quirks := parseDoctype(p.tok.Data)\n\t\tp.doc.AppendChild(n)\n\t\tp.quirks = quirks\n\t\tp.im = beforeHTMLIM\n\t\treturn true\n\t}\n\tp.quirks = true\n\tp.im = beforeHTMLIM\n\treturn false\n}\n\n// Section 12.2.6.4.2.\nfunc beforeHTMLIM(p *parser) bool {\n\tswitch p.tok.Type {\n\tcase DoctypeToken:\n\t\t// Ignore the token.\n\t\treturn true\n\tcase TextToken:\n\t\tp.tok.Data = strings.TrimLeft(p.tok.Data, whitespace)\n\t\tif len(p.tok.Data) == 0 {\n\t\t\t// It was all whitespace, so ignore it.\n\t\t\treturn true\n\t\t}\n\tcase StartTagToken:\n\t\tif p.tok.DataAtom == a.Html {\n\t\t\tp.addElement()\n\t\t\tp.im = beforeHeadIM\n\t\t\treturn true\n\t\t}\n\tcase EndTagToken:\n\t\tswitch p.tok.DataAtom {\n\t\tcase a.Head, a.Body, a.Html, a.Br:\n\t\t\tp.parseImpliedToken(StartTagToken, a.Html, a.Html.String())\n\t\t\treturn false\n\t\tdefault:\n\t\t\t// Ignore the token.\n\t\t\treturn true\n\t\t}\n\tcase CommentToken:\n\t\tp.doc.AppendChild(&Node{\n\t\t\tType: CommentNode,\n\t\t\tData: p.tok.Data,\n\t\t})\n\t\treturn true\n\t}\n\tp.parseImpliedToken(StartTagToken, a.Html, a.Html.String())\n\treturn false\n}\n\n// Section 12.2.6.4.3.\nfunc beforeHeadIM(p *parser) bool {\n\tswitch p.tok.Type {\n\tcase TextToken:\n\t\tp.tok.Data = strings.TrimLeft(p.tok.Data, whitespace)\n\t\tif len(p.tok.Data) == 0 {\n\t\t\t// It was all whitespace, so ignore it.\n\t\t\treturn true\n\t\t}\n\tcase StartTagToken:\n\t\tswitch p.tok.DataAtom {\n\t\tcase a.Head:\n\t\t\tp.addElement()\n\t\t\tp.head = p.top()\n\t\t\tp.im = inHeadIM\n\t\t\treturn true\n\t\tcase a.Html:\n\t\t\treturn inBodyIM(p)\n\t\t}\n\tcase EndTagToken:\n\t\tswitch p.tok.DataAtom {\n\t\tcase a.Head, a.Body, a.Html, a.Br:\n\t\t\tp.parseImpliedToken(StartTagToken, a.Head, a.Head.String())\n\t\t\treturn false\n\t\tdefault:\n\t\t\t// Ignore the token.\n\t\t\treturn true\n\t\t}\n\tcase CommentToken:\n\t\tp.addChild(&Node{\n\t\t\tType: CommentNode,\n\t\t\tData: p.tok.Data,\n\t\t})\n\t\treturn true\n\tcase DoctypeToken:\n\t\t// Ignore the token.\n\t\treturn true\n\t}\n\n\tp.parseImpliedToken(StartTagToken, a.Head, a.Head.String())\n\treturn false\n}\n\n// Section 12.2.6.4.4.\nfunc inHeadIM(p *parser) bool {\n\tswitch p.tok.Type {\n\tcase TextToken:\n\t\ts := strings.TrimLeft(p.tok.Data, whitespace)\n\t\tif len(s) < len(p.tok.Data) {\n\t\t\t// Add the initial whitespace to the current node.\n\t\t\tp.addText(p.tok.Data[:len(p.tok.Data)-len(s)])\n\t\t\tif s == \"\" {\n\t\t\t\treturn true\n\t\t\t}\n\t\t\tp.tok.Data = s\n\t\t}\n\tcase StartTagToken:\n\t\tswitch p.tok.DataAtom {\n\t\tcase a.Html:\n\t\t\treturn inBodyIM(p)\n\t\tcase a.Base, a.Basefont, a.Bgsound, a.Link, a.Meta:\n\t\t\tp.addElement()\n\t\t\tp.oe.pop()\n\t\t\tp.acknowledgeSelfClosingTag()\n\t\t\treturn true\n\t\tcase a.Noscript:\n\t\t\tif p.scripting {\n\t\t\t\tp.parseGenericRawTextElement()\n\t\t\t\treturn true\n\t\t\t}\n\t\t\tp.addElement()\n\t\t\tp.im = inHeadNoscriptIM\n\t\t\t// Don't let the tokenizer go into raw text mode when scripting is disabled.\n\t\t\tp.tokenizer.NextIsNotRawText()\n\t\t\treturn true\n\t\tcase a.Script, a.Title:\n\t\t\tp.addElement()\n\t\t\tp.setOriginalIM()\n\t\t\tp.im = textIM\n\t\t\treturn true\n\t\tcase a.Noframes, a.Style:\n\t\t\tp.parseGenericRawTextElement()\n\t\t\treturn true\n\t\tcase a.Head:\n\t\t\t// Ignore the token.\n\t\t\treturn true\n\t\tcase a.Template:\n\t\t\tp.addElement()\n\t\t\tp.afe = append(p.afe, &scopeMarker)\n\t\t\tp.framesetOK = false\n\t\t\tp.im = inTemplateIM\n\t\t\tp.templateStack = append(p.templateStack, inTemplateIM)\n\t\t\treturn true\n\t\t}\n\tcase EndTagToken:\n\t\tswitch p.tok.DataAtom {\n\t\tcase a.Head:\n\t\t\tp.oe.pop()\n\t\t\tp.im = afterHeadIM\n\t\t\treturn true\n\t\tcase a.Body, a.Html, a.Br:\n\t\t\tp.parseImpliedToken(EndTagToken, a.Head, a.Head.String())\n\t\t\treturn false\n\t\tcase a.Template:\n\t\t\tif !p.oe.contains(a.Template) {\n\t\t\t\treturn true\n\t\t\t}\n\t\t\t// TODO: remove this divergence from the HTML5 spec.\n\t\t\t//\n\t\t\t// See https://bugs.chromium.org/p/chromium/issues/detail?id=829668\n\t\t\tp.generateImpliedEndTags()\n\t\t\tfor i := len(p.oe) - 1; i >= 0; i-- {\n\t\t\t\tif n := p.oe[i]; n.Namespace == \"\" && n.DataAtom == a.Template {\n\t\t\t\t\tp.oe = p.oe[:i]\n\t\t\t\t\tbreak\n\t\t\t\t}\n\t\t\t}\n\t\t\tp.clearActiveFormattingElements()\n\t\t\tp.templateStack.pop()\n\t\t\tp.resetInsertionMode()\n\t\t\treturn true\n\t\tdefault:\n\t\t\t// Ignore the token.\n\t\t\treturn true\n\t\t}\n\tcase CommentToken:\n\t\tp.addChild(&Node{\n\t\t\tType: CommentNode,\n\t\t\tData: p.tok.Data,\n\t\t})\n\t\treturn true\n\tcase DoctypeToken:\n\t\t// Ignore the token.\n\t\treturn true\n\t}\n\n\tp.parseImpliedToken(EndTagToken, a.Head, a.Head.String())\n\treturn false\n}\n\n// 12.2.6.4.5.\nfunc inHeadNoscriptIM(p *parser) bool {\n\tswitch p.tok.Type {\n\tcase DoctypeToken:\n\t\t// Ignore the token.\n\t\treturn true\n\tcase StartTagToken:\n\t\tswitch p.tok.DataAtom {\n\t\tcase a.Html:\n\t\t\treturn inBodyIM(p)\n\t\tcase a.Basefont, a.Bgsound, a.Link, a.Meta, a.Noframes, a.Style:\n\t\t\treturn inHeadIM(p)\n\t\tcase a.Head:\n\t\t\t// Ignore the token.\n\t\t\treturn true\n\t\tcase a.Noscript:\n\t\t\t// Don't let the tokenizer go into raw text mode even when a