mirror of
https://github.com/ceph/ceph-csi.git
synced 2024-09-19 15:09:56 +00:00
rebase: bump k8s.io/kubernetes from 1.22.3 to 1.22.4
Bumps [k8s.io/kubernetes](https://github.com/kubernetes/kubernetes) from 1.22.3 to 1.22.4. - [Release notes](https://github.com/kubernetes/kubernetes/releases) - [Commits](https://github.com/kubernetes/kubernetes/compare/v1.22.3...v1.22.4) --- updated-dependencies: - dependency-name: k8s.io/kubernetes dependency-type: direct:production update-type: version-update:semver-patch ... Signed-off-by: dependabot[bot] <support@github.com>
This commit is contained in:
dependabot[bot]
mergify[bot]
parent
929e17d21b
commit
b2099eb3b1
63
go.mod
63
go.mod
@ -25,13 +25,16 @@ require (
|
|||||||
golang.org/x/crypto v0.0.0-20210711020723-a769d52b0f97
|
golang.org/x/crypto v0.0.0-20210711020723-a769d52b0f97
|
||||||
golang.org/x/sys v0.0.0-20210817190340-bfb29a6856f2
|
golang.org/x/sys v0.0.0-20210817190340-bfb29a6856f2
|
||||||
google.golang.org/grpc v1.42.0
|
google.golang.org/grpc v1.42.0
|
||||||
k8s.io/api v0.22.2
|
k8s.io/api v0.22.4
|
||||||
k8s.io/apimachinery v0.22.2
|
k8s.io/apimachinery v0.22.4
|
||||||
k8s.io/client-go v12.0.0+incompatible
|
k8s.io/client-go v12.0.0+incompatible
|
||||||
k8s.io/cloud-provider v0.22.2
|
k8s.io/cloud-provider v0.22.4
|
||||||
k8s.io/klog/v2 v2.10.0
|
k8s.io/klog/v2 v2.10.0
|
||||||
k8s.io/kubernetes v1.22.3
|
//
|
||||||
k8s.io/mount-utils v0.22.2
|
// when updating k8s.io/kubernetes, make sure to update the replace section too
|
||||||
|
//
|
||||||
|
k8s.io/kubernetes v1.22.4
|
||||||
|
k8s.io/mount-utils v0.22.4
|
||||||
k8s.io/utils v0.0.0-20210819203725-bdf08cb9a70a
|
k8s.io/utils v0.0.0-20210819203725-bdf08cb9a70a
|
||||||
sigs.k8s.io/controller-runtime v0.10.3
|
sigs.k8s.io/controller-runtime v0.10.3
|
||||||
)
|
)
|
||||||
@ -45,31 +48,31 @@ replace (
|
|||||||
//
|
//
|
||||||
// k8s.io/kubernetes depends on these k8s.io packages, but unversioned
|
// k8s.io/kubernetes depends on these k8s.io packages, but unversioned
|
||||||
//
|
//
|
||||||
k8s.io/api => k8s.io/api v0.22.2
|
k8s.io/api => k8s.io/api v0.22.4
|
||||||
k8s.io/apiextensions-apiserver => k8s.io/apiextensions-apiserver v0.22.2
|
k8s.io/apiextensions-apiserver => k8s.io/apiextensions-apiserver v0.22.4
|
||||||
k8s.io/apimachinery => k8s.io/apimachinery v0.22.2
|
k8s.io/apimachinery => k8s.io/apimachinery v0.22.4
|
||||||
k8s.io/apiserver => k8s.io/apiserver v0.22.2
|
k8s.io/apiserver => k8s.io/apiserver v0.22.4
|
||||||
k8s.io/cli-runtime => k8s.io/cli-runtime v0.22.2
|
k8s.io/cli-runtime => k8s.io/cli-runtime v0.22.4
|
||||||
k8s.io/client-go => k8s.io/client-go v0.22.2
|
k8s.io/client-go => k8s.io/client-go v0.22.4
|
||||||
k8s.io/cloud-provider => k8s.io/cloud-provider v0.22.2
|
k8s.io/cloud-provider => k8s.io/cloud-provider v0.22.4
|
||||||
k8s.io/cluster-bootstrap => k8s.io/cluster-bootstrap v0.22.2
|
k8s.io/cluster-bootstrap => k8s.io/cluster-bootstrap v0.22.4
|
||||||
k8s.io/code-generator => k8s.io/code-generator v0.22.2
|
k8s.io/code-generator => k8s.io/code-generator v0.22.4
|
||||||
k8s.io/component-base => k8s.io/component-base v0.22.2
|
k8s.io/component-base => k8s.io/component-base v0.22.4
|
||||||
k8s.io/component-helpers => k8s.io/component-helpers v0.22.2
|
k8s.io/component-helpers => k8s.io/component-helpers v0.22.4
|
||||||
k8s.io/controller-manager => k8s.io/controller-manager v0.22.2
|
k8s.io/controller-manager => k8s.io/controller-manager v0.22.4
|
||||||
k8s.io/cri-api => k8s.io/cri-api v0.22.2
|
k8s.io/cri-api => k8s.io/cri-api v0.22.4
|
||||||
k8s.io/csi-translation-lib => k8s.io/csi-translation-lib v0.22.2
|
k8s.io/csi-translation-lib => k8s.io/csi-translation-lib v0.22.4
|
||||||
k8s.io/kube-aggregator => k8s.io/kube-aggregator v0.22.2
|
k8s.io/kube-aggregator => k8s.io/kube-aggregator v0.22.4
|
||||||
k8s.io/kube-controller-manager => k8s.io/kube-controller-manager v0.22.2
|
k8s.io/kube-controller-manager => k8s.io/kube-controller-manager v0.22.4
|
||||||
k8s.io/kube-proxy => k8s.io/kube-proxy v0.22.2
|
k8s.io/kube-proxy => k8s.io/kube-proxy v0.22.4
|
||||||
k8s.io/kube-scheduler => k8s.io/kube-scheduler v0.22.2
|
k8s.io/kube-scheduler => k8s.io/kube-scheduler v0.22.4
|
||||||
k8s.io/kubectl => k8s.io/kubectl v0.22.2
|
k8s.io/kubectl => k8s.io/kubectl v0.22.4
|
||||||
k8s.io/kubelet => k8s.io/kubelet v0.22.2
|
k8s.io/kubelet => k8s.io/kubelet v0.22.4
|
||||||
k8s.io/legacy-cloud-providers => k8s.io/legacy-cloud-providers v0.22.2
|
k8s.io/legacy-cloud-providers => k8s.io/legacy-cloud-providers v0.22.4
|
||||||
k8s.io/metrics => k8s.io/metrics v0.22.2
|
k8s.io/metrics => k8s.io/metrics v0.22.4
|
||||||
k8s.io/mount-utils => k8s.io/mount-utils v0.22.2
|
k8s.io/mount-utils => k8s.io/mount-utils v0.22.4
|
||||||
k8s.io/pod-security-admission => k8s.io/pod-security-admission v0.22.2
|
k8s.io/pod-security-admission => k8s.io/pod-security-admission v0.22.4
|
||||||
k8s.io/sample-apiserver => k8s.io/sample-apiserver v0.22.2
|
k8s.io/sample-apiserver => k8s.io/sample-apiserver v0.22.4
|
||||||
// layeh.com seems to be misbehaving
|
// layeh.com seems to be misbehaving
|
||||||
layeh.com/radius => github.com/layeh/radius v0.0.0-20190322222518-890bc1058917
|
layeh.com/radius => github.com/layeh/radius v0.0.0-20190322222518-890bc1058917
|
||||||
)
|
)
|
||||||
|
|||||||
81
go.sum
81
go.sum
@ -143,6 +143,7 @@ github.com/beorn7/perks v1.0.1/go.mod h1:G2ZrVWU2WbWT9wwq4/hrbKbnv/1ERSJQ0ibhJ6r
|
|||||||
github.com/bgentry/speakeasy v0.1.0 h1:ByYyxL9InA1OWqxJqqp2A5pYHUrCiAL6K3J+LKSsQkY=
|
github.com/bgentry/speakeasy v0.1.0 h1:ByYyxL9InA1OWqxJqqp2A5pYHUrCiAL6K3J+LKSsQkY=
|
||||||
github.com/bgentry/speakeasy v0.1.0/go.mod h1:+zsyZBPWlz7T6j88CTgSN5bM796AkVf0kBD4zp0CCIs=
|
github.com/bgentry/speakeasy v0.1.0/go.mod h1:+zsyZBPWlz7T6j88CTgSN5bM796AkVf0kBD4zp0CCIs=
|
||||||
github.com/bitly/go-hostpool v0.0.0-20171023180738-a3a6125de932/go.mod h1:NOuUCSz6Q9T7+igc/hlvDOUdtWKryOrtFyIVABv/p7k=
|
github.com/bitly/go-hostpool v0.0.0-20171023180738-a3a6125de932/go.mod h1:NOuUCSz6Q9T7+igc/hlvDOUdtWKryOrtFyIVABv/p7k=
|
||||||
|
github.com/bits-and-blooms/bitset v1.2.0 h1:Kn4yilvwNtMACtf1eYDlG8H77R07mZSPbMjLyS07ChA=
|
||||||
github.com/bits-and-blooms/bitset v1.2.0/go.mod h1:gIdJ4wp64HaoK2YrL1Q5/N7Y16edYb8uY+O0FJTyyDA=
|
github.com/bits-and-blooms/bitset v1.2.0/go.mod h1:gIdJ4wp64HaoK2YrL1Q5/N7Y16edYb8uY+O0FJTyyDA=
|
||||||
github.com/bketelsen/crypt v0.0.3-0.20200106085610-5cbc8cc4026c/go.mod h1:MKsuJmJgSg28kpZDP6UIiPt0e0Oz0kqKNGyRaWEPv84=
|
github.com/bketelsen/crypt v0.0.3-0.20200106085610-5cbc8cc4026c/go.mod h1:MKsuJmJgSg28kpZDP6UIiPt0e0Oz0kqKNGyRaWEPv84=
|
||||||
github.com/blang/semver v3.5.0+incompatible/go.mod h1:kRBLl5iJ+tD4TcOOxsy/0fnwebNt5EWlYSAyrTnjyyk=
|
github.com/blang/semver v3.5.0+incompatible/go.mod h1:kRBLl5iJ+tD4TcOOxsy/0fnwebNt5EWlYSAyrTnjyyk=
|
||||||
@ -841,6 +842,7 @@ github.com/opencontainers/runc v1.0.2/go.mod h1:aTaHFFwQXuA71CiyxOdFFIorAoemI04s
|
|||||||
github.com/opencontainers/runtime-spec v1.0.2/go.mod h1:jwyrGlmzljRJv/Fgzds9SsS/C5hL+LL3ko9hs6T5lQ0=
|
github.com/opencontainers/runtime-spec v1.0.2/go.mod h1:jwyrGlmzljRJv/Fgzds9SsS/C5hL+LL3ko9hs6T5lQ0=
|
||||||
github.com/opencontainers/runtime-spec v1.0.3-0.20210326190908-1c3f411f0417/go.mod h1:jwyrGlmzljRJv/Fgzds9SsS/C5hL+LL3ko9hs6T5lQ0=
|
github.com/opencontainers/runtime-spec v1.0.3-0.20210326190908-1c3f411f0417/go.mod h1:jwyrGlmzljRJv/Fgzds9SsS/C5hL+LL3ko9hs6T5lQ0=
|
||||||
github.com/opencontainers/selinux v1.8.0/go.mod h1:RScLhm78qiWa2gbVCcGkC7tCGdgk3ogry1nUQF8Evvo=
|
github.com/opencontainers/selinux v1.8.0/go.mod h1:RScLhm78qiWa2gbVCcGkC7tCGdgk3ogry1nUQF8Evvo=
|
||||||
|
github.com/opencontainers/selinux v1.8.2 h1:c4ca10UMgRcvZ6h0K4HtS15UaVSBEaE+iln2LVpAuGc=
|
||||||
github.com/opencontainers/selinux v1.8.2/go.mod h1:MUIHuUEvKB1wtJjQdOyYRgOnLD2xAPP8dBsCoU0KuF8=
|
github.com/opencontainers/selinux v1.8.2/go.mod h1:MUIHuUEvKB1wtJjQdOyYRgOnLD2xAPP8dBsCoU0KuF8=
|
||||||
github.com/openshift/api v0.0.0-20210105115604-44119421ec6b/go.mod h1:aqU5Cq+kqKKPbDMqxo9FojgDeSpNJI7iuskjXjtojDg=
|
github.com/openshift/api v0.0.0-20210105115604-44119421ec6b/go.mod h1:aqU5Cq+kqKKPbDMqxo9FojgDeSpNJI7iuskjXjtojDg=
|
||||||
github.com/openshift/api v0.0.0-20210927171657-636513e97fda h1:VoJmrqbFDuqzjlByItbjx/HxmReK4LC+X3Jt2Wv2Ogs=
|
github.com/openshift/api v0.0.0-20210927171657-636513e97fda h1:VoJmrqbFDuqzjlByItbjx/HxmReK4LC+X3Jt2Wv2Ogs=
|
||||||
@ -1576,28 +1578,28 @@ honnef.co/go/tools v0.0.0-20190523083050-ea95bdfd59fc/go.mod h1:rf3lG4BRIbNafJWh
|
|||||||
honnef.co/go/tools v0.0.1-2019.2.3/go.mod h1:a3bituU0lyd329TUQxRnasdCoJDkEUEAqEt0JzvZhAg=
|
honnef.co/go/tools v0.0.1-2019.2.3/go.mod h1:a3bituU0lyd329TUQxRnasdCoJDkEUEAqEt0JzvZhAg=
|
||||||
honnef.co/go/tools v0.0.1-2020.1.3/go.mod h1:X/FiERA/W4tHapMX5mGpAtMSVEeEUOyHaw9vFzvIQ3k=
|
honnef.co/go/tools v0.0.1-2020.1.3/go.mod h1:X/FiERA/W4tHapMX5mGpAtMSVEeEUOyHaw9vFzvIQ3k=
|
||||||
honnef.co/go/tools v0.0.1-2020.1.4/go.mod h1:X/FiERA/W4tHapMX5mGpAtMSVEeEUOyHaw9vFzvIQ3k=
|
honnef.co/go/tools v0.0.1-2020.1.4/go.mod h1:X/FiERA/W4tHapMX5mGpAtMSVEeEUOyHaw9vFzvIQ3k=
|
||||||
k8s.io/api v0.22.2 h1:M8ZzAD0V6725Fjg53fKeTJxGsJvRbk4TEm/fexHMtfw=
|
k8s.io/api v0.22.4 h1:UvyHW0ezB2oIgHAxlYoo6UJQObYXU7awuNarwoHEOjw=
|
||||||
k8s.io/api v0.22.2/go.mod h1:y3ydYpLJAaDI+BbSe2xmGcqxiWHmWjkEeIbiwHvnPR8=
|
k8s.io/api v0.22.4/go.mod h1:Rgs+9gIGYC5laXQSZZ9JqT5NevNgoGiOdVWi1BAB3qk=
|
||||||
k8s.io/apiextensions-apiserver v0.22.2 h1:zK7qI8Ery7j2CaN23UCFaC1hj7dMiI87n01+nKuewd4=
|
k8s.io/apiextensions-apiserver v0.22.4 h1:2iGpcVyw4MnAyyXVJU2Xg6ZsbIxAOfRHo0LF5A5J0RA=
|
||||||
k8s.io/apiextensions-apiserver v0.22.2/go.mod h1:2E0Ve/isxNl7tWLSUDgi6+cmwHi5fQRdwGVCxbC+KFA=
|
k8s.io/apiextensions-apiserver v0.22.4/go.mod h1:kH9lxD8dbJ+k0ZizGET55lFgdGjO8t45fgZnCVdZEpw=
|
||||||
k8s.io/apimachinery v0.22.2 h1:ejz6y/zNma8clPVfNDLnPbleBo6MpoFy/HBiBqCouVk=
|
k8s.io/apimachinery v0.22.4 h1:9uwcvPpukBw/Ri0EUmWz+49cnFtaoiyEhQTK+xOe7Ck=
|
||||||
k8s.io/apimachinery v0.22.2/go.mod h1:O3oNtNadZdeOMxHFVxOreoznohCpy0z6mocxbZr7oJ0=
|
k8s.io/apimachinery v0.22.4/go.mod h1:yU6oA6Gnax9RrxGzVvPFFJ+mpnW6PBSqp0sx0I0HHW0=
|
||||||
k8s.io/apiserver v0.22.2 h1:TdIfZJc6YNhu2WxeAOWq1TvukHF0Sfx0+ln4XK9qnL4=
|
k8s.io/apiserver v0.22.4 h1:L+220cy+94UWmyBl1kiVTklBXrBtKsbjlPV60eL2u6s=
|
||||||
k8s.io/apiserver v0.22.2/go.mod h1:vrpMmbyjWrgdyOvZTSpsusQq5iigKNWv9o9KlDAbBHI=
|
k8s.io/apiserver v0.22.4/go.mod h1:38WmcUZiiy41A7Aty8/VorWRa8vDGqoUzDf2XYlku0E=
|
||||||
k8s.io/cli-runtime v0.22.2/go.mod h1:tkm2YeORFpbgQHEK/igqttvPTRIHFRz5kATlw53zlMI=
|
k8s.io/cli-runtime v0.22.4/go.mod h1:x35r0ERHXr/MrbR1C6MPJxQ3xKG6+hXi9m2xLzlMPZA=
|
||||||
k8s.io/client-go v0.22.2 h1:DaSQgs02aCC1QcwUdkKZWOeaVsQjYvWv8ZazcZ6JcHc=
|
k8s.io/client-go v0.22.4 h1:aAQ1Wk+I3bjCNk35YWUqbaueqrIonkfDPJSPDDe8Kfg=
|
||||||
k8s.io/client-go v0.22.2/go.mod h1:sAlhrkVDf50ZHx6z4K0S40wISNTarf1r800F+RlCF6U=
|
k8s.io/client-go v0.22.4/go.mod h1:Yzw4e5e7h1LNHA4uqnMVrpEpUs1hJOiuBsJKIlRCHDA=
|
||||||
k8s.io/cloud-provider v0.22.2 h1:CiSDHMJiOd6qgYIP8ln9ueFHFU5Ld8TDZiYNIiMNbNk=
|
k8s.io/cloud-provider v0.22.4 h1:dNCY8e7XESvDvldkX1/PHsJQWEzGyKN1xxS51GuVQuc=
|
||||||
k8s.io/cloud-provider v0.22.2/go.mod h1:HUvZkUkV6dIKgWJQgGvnFhOeEHT87ZP39ij4K0fgkAs=
|
k8s.io/cloud-provider v0.22.4/go.mod h1:lTaIKDEqJt7UPbsz9sk1Aa719ADIWuFtbh/mgq72UE8=
|
||||||
k8s.io/cluster-bootstrap v0.22.2/go.mod h1:ZkmQKprEqvrUccMnbRHISsMscA1dsQ8SffM9nHq6CgE=
|
k8s.io/cluster-bootstrap v0.22.4/go.mod h1:fTQZ6u9G6fg2LHhB8nEgZLnXIhCDSRYuLUUS5pgW8RY=
|
||||||
k8s.io/code-generator v0.22.2/go.mod h1:eV77Y09IopzeXOJzndrDyCI88UBok2h6WxAlBwpxa+o=
|
k8s.io/code-generator v0.22.4/go.mod h1:qjYl54pQ/emhkT0UxbufbREYJMWsHNNV/jSVwhYZQGw=
|
||||||
k8s.io/component-base v0.22.2 h1:vNIvE0AIrLhjX8drH0BgCNJcR4QZxMXcJzBsDplDx9M=
|
k8s.io/component-base v0.22.4 h1:7qwLJnua2ppGNZrRGDQ0vhsFebI39VGbZ4zdR5ArViI=
|
||||||
k8s.io/component-base v0.22.2/go.mod h1:5Br2QhI9OTe79p+TzPe9JKNQYvEKbq9rTJDWllunGug=
|
k8s.io/component-base v0.22.4/go.mod h1:MrSaQy4a3tFVViff8TZL6JHYSewNCLshZCwHYM58v5A=
|
||||||
k8s.io/component-helpers v0.22.2 h1:guQ9oYclE5LMydWFfAFA+u7SQgQzz2g+YgpJ5QooSyY=
|
k8s.io/component-helpers v0.22.4 h1:Pso4iXoY6aYLCYQlNkME2MSJvAXo/7lnJYsWHdC6tvE=
|
||||||
k8s.io/component-helpers v0.22.2/go.mod h1:+N61JAR9aKYSWbnLA88YcFr9K/6ISYvRNybX7QW7Rs8=
|
k8s.io/component-helpers v0.22.4/go.mod h1:A50qTyczDFbhZDifIfS2zFrHuPk9UNOWPpvNZ+3RSIs=
|
||||||
k8s.io/controller-manager v0.22.2/go.mod h1:zeDUbCc66IcMZ81U8qC5Z5pm9A8QkqD7839H8t7//yY=
|
k8s.io/controller-manager v0.22.4/go.mod h1:DcJNoo4OvXCh9KfESIrX9C9dNQj1OfQrAZrEkFbNMRw=
|
||||||
k8s.io/cri-api v0.22.2/go.mod h1:mj5DGUtElRyErU5AZ8EM0ahxbElYsaLAMTPhLPQ40Eg=
|
k8s.io/cri-api v0.22.4/go.mod h1:mj5DGUtElRyErU5AZ8EM0ahxbElYsaLAMTPhLPQ40Eg=
|
||||||
k8s.io/csi-translation-lib v0.22.2/go.mod h1:HYNFNKFADblw8nVm3eshFVWdmiccxPHN+SUmTKG3Ctk=
|
k8s.io/csi-translation-lib v0.22.4/go.mod h1:8ZHJ0R2rSiL+0OC7WEF9MTMW4+CV4YEzXDng3rogEY4=
|
||||||
k8s.io/gengo v0.0.0-20200413195148-3a45101e95ac/go.mod h1:ezvh/TsK7cY6rbqRK0oQQ8IAqLxYwwyPxAX1Pzy0ii0=
|
k8s.io/gengo v0.0.0-20200413195148-3a45101e95ac/go.mod h1:ezvh/TsK7cY6rbqRK0oQQ8IAqLxYwwyPxAX1Pzy0ii0=
|
||||||
k8s.io/gengo v0.0.0-20201214224949-b6c5ce23f027/go.mod h1:FiNAH4ZV3gBg2Kwh89tzAEV2be7d5xI0vBa/VySYy3E=
|
k8s.io/gengo v0.0.0-20201214224949-b6c5ce23f027/go.mod h1:FiNAH4ZV3gBg2Kwh89tzAEV2be7d5xI0vBa/VySYy3E=
|
||||||
k8s.io/klog v0.3.0 h1:0VPpR+sizsiivjIfIAQH/rl8tan6jvWkS7lU+0di3lE=
|
k8s.io/klog v0.3.0 h1:0VPpR+sizsiivjIfIAQH/rl8tan6jvWkS7lU+0di3lE=
|
||||||
@ -1608,25 +1610,26 @@ k8s.io/klog/v2 v2.4.0/go.mod h1:Od+F08eJP+W3HUb4pSrPpgp9DGU4GzlpG/TmITuYh/Y=
|
|||||||
k8s.io/klog/v2 v2.9.0/go.mod h1:hy9LJ/NvuK+iVyP4Ehqva4HxZG/oXyIS3n3Jmire4Ec=
|
k8s.io/klog/v2 v2.9.0/go.mod h1:hy9LJ/NvuK+iVyP4Ehqva4HxZG/oXyIS3n3Jmire4Ec=
|
||||||
k8s.io/klog/v2 v2.10.0 h1:R2HDMDJsHVTHA2n4RjwbeYXdOcBymXdX/JRb1v0VGhE=
|
k8s.io/klog/v2 v2.10.0 h1:R2HDMDJsHVTHA2n4RjwbeYXdOcBymXdX/JRb1v0VGhE=
|
||||||
k8s.io/klog/v2 v2.10.0/go.mod h1:hy9LJ/NvuK+iVyP4Ehqva4HxZG/oXyIS3n3Jmire4Ec=
|
k8s.io/klog/v2 v2.10.0/go.mod h1:hy9LJ/NvuK+iVyP4Ehqva4HxZG/oXyIS3n3Jmire4Ec=
|
||||||
k8s.io/kube-aggregator v0.22.2/go.mod h1:hsd0LEmVQSvMc0UzAwmcm/Gk3HzLp50mq/o6cu1ky2A=
|
k8s.io/kube-aggregator v0.22.4/go.mod h1:nH2L1wiG9pMqYV7P8XIMb9RbIEZPBwxz0iJqPPrtALU=
|
||||||
k8s.io/kube-controller-manager v0.22.2/go.mod h1:n8Wh6HHmB+EBy3INhucPEeyZE05qtq8ZWcBgFREYwBk=
|
k8s.io/kube-controller-manager v0.22.4/go.mod h1:BLoqqosh47s25JarHCC5ghmV24AlYp5/tRjatt/YjUY=
|
||||||
k8s.io/kube-openapi v0.0.0-20180731170545-e3762e86a74c/go.mod h1:BXM9ceUBTj2QnfH2MK1odQs778ajze1RxcmP6S8RVVc=
|
k8s.io/kube-openapi v0.0.0-20180731170545-e3762e86a74c/go.mod h1:BXM9ceUBTj2QnfH2MK1odQs778ajze1RxcmP6S8RVVc=
|
||||||
k8s.io/kube-openapi v0.0.0-20210421082810-95288971da7e h1:KLHHjkdQFomZy8+06csTWZ0m1343QqxZhR2LJ1OxCYM=
|
|
||||||
k8s.io/kube-openapi v0.0.0-20210421082810-95288971da7e/go.mod h1:vHXdDvt9+2spS2Rx9ql3I8tycm3H9FDfdUoIuKCefvw=
|
k8s.io/kube-openapi v0.0.0-20210421082810-95288971da7e/go.mod h1:vHXdDvt9+2spS2Rx9ql3I8tycm3H9FDfdUoIuKCefvw=
|
||||||
k8s.io/kube-proxy v0.22.2/go.mod h1:pk0QwfYdTsg7aC9ycMF5MFbasIxhBAPFCvfwdmNikZs=
|
k8s.io/kube-openapi v0.0.0-20211109043538-20434351676c h1:jvamsI1tn9V0S8jicyX82qaFC0H/NKxv2e5mbqsgR80=
|
||||||
k8s.io/kube-scheduler v0.22.2/go.mod h1:aaElZivB8w1u8Ki7QcwuRSL7AcVWC7xa0LzeiT8zQ7I=
|
k8s.io/kube-openapi v0.0.0-20211109043538-20434351676c/go.mod h1:vHXdDvt9+2spS2Rx9ql3I8tycm3H9FDfdUoIuKCefvw=
|
||||||
k8s.io/kubectl v0.22.2 h1:KMyYNZoBshaL3XKx04X07DtpoD4vMrdkfiN/G2Qx/PU=
|
k8s.io/kube-proxy v0.22.4/go.mod h1:TTzZmcecSHXUL/3d6P4puVrZt4h0UNhT2RmxSdmg7B0=
|
||||||
k8s.io/kubectl v0.22.2/go.mod h1:BApg2j0edxLArCOfO0ievI27EeTQqBDMNU9VQH734iQ=
|
k8s.io/kube-scheduler v0.22.4/go.mod h1:2q5YGJngwFZ/9witl/n8Dij9qf52T3nR1g6OD6+pvLM=
|
||||||
k8s.io/kubelet v0.22.2 h1:7ol5AXXxcW97dUE8W/QiPjkXu1ZuGshG5VmgDmviZsc=
|
k8s.io/kubectl v0.22.4 h1:ECUO1QWyZ70DiIKEfgBx+8i9D98uspVOwgc1APs/07w=
|
||||||
k8s.io/kubelet v0.22.2/go.mod h1:ORIRua2/wTcx5UnEvxWosu650/8fatmzbMRC7m6WjAM=
|
k8s.io/kubectl v0.22.4/go.mod h1:ok2qRT6y2Gy4+y+mniJVyUMKeBHP4OWS9Rdtf/QTM5I=
|
||||||
k8s.io/kubernetes v1.22.3 h1:/eFfR5S2Vxn0t9kcLVAZXQFloKMkklWQIf5e0hFbzlA=
|
k8s.io/kubelet v0.22.4 h1:0eaVDObhAuDCDnQJS9xqgfAP5/IWHMt6un4L/DQs0so=
|
||||||
k8s.io/kubernetes v1.22.3/go.mod h1:Snea7fgIObGgHmLbUJ3OgjGEr5bjj16iEdp5oHS6eS8=
|
k8s.io/kubelet v0.22.4/go.mod h1:9dCtyqqDnXJYF9E2mejBmDQb+flkAGFBzGgnlW/goyo=
|
||||||
k8s.io/legacy-cloud-providers v0.22.2/go.mod h1:oC6zhm9nhJ5M4VTDHzsO/4MpddZR5JqEt55zZ52JRMc=
|
k8s.io/kubernetes v1.22.4 h1:N5kU4bJEghcB2226/GH9Bca+oNcH6JTplcr9euN5ti8=
|
||||||
k8s.io/metrics v0.22.2/go.mod h1:GUcsBtpsqQD1tKFS/2wCKu4ZBowwRncLOJH1rgWs3uw=
|
k8s.io/kubernetes v1.22.4/go.mod h1:cMy6DFG4E+/jxMgxw1aWMwZqvI1AueV3HCcG9S7QNIk=
|
||||||
k8s.io/mount-utils v0.22.2 h1:w/CJq+Cofkr81Rp89UkokgEbuu8Js0LwMI/RWWEE+gs=
|
k8s.io/legacy-cloud-providers v0.22.4/go.mod h1:Kw5X3DTa1/skHsKVgcrcK9d1JVXrdQpG77kWg/JPV68=
|
||||||
k8s.io/mount-utils v0.22.2/go.mod h1:dHl6c2P60T5LHUnZxVslyly9EDCMzvhtISO5aY+Z4sk=
|
k8s.io/metrics v0.22.4/go.mod h1:6F/iwuYb1w2QDCoHkeMFLf4pwHBcYKLm4mPtVHKYrIw=
|
||||||
k8s.io/pod-security-admission v0.22.2/go.mod h1:5FK/TIw6rySU522cZVueMcS/LPPovNHbsm1I1gLfVfU=
|
k8s.io/mount-utils v0.22.4 h1:COkD8uKbphYVZXDYR4+464sZaeiYIwU5hdTyigjz0Xc=
|
||||||
k8s.io/sample-apiserver v0.22.2/go.mod h1:h+/DIV5EmuNq4vfPr5TSXy9mIBVXXlPAKQMPbjPrlFM=
|
k8s.io/mount-utils v0.22.4/go.mod h1:dHl6c2P60T5LHUnZxVslyly9EDCMzvhtISO5aY+Z4sk=
|
||||||
|
k8s.io/pod-security-admission v0.22.4/go.mod h1:R6VgmZm77Ik1qWRBBExuiUIRXR6kGQIRM/Zh5yVpYyA=
|
||||||
|
k8s.io/sample-apiserver v0.22.4/go.mod h1:QIrXoUymVFpdy0Ei5WQjOa/Ewi3Ni+5XEhG8WD/D4iI=
|
||||||
k8s.io/system-validators v1.5.0/go.mod h1:bPldcLgkIUK22ALflnsXk8pvkTEndYdNuaHH6gRrl0Q=
|
k8s.io/system-validators v1.5.0/go.mod h1:bPldcLgkIUK22ALflnsXk8pvkTEndYdNuaHH6gRrl0Q=
|
||||||
k8s.io/utils v0.0.0-20190506122338-8fab8cb257d5/go.mod h1:sZAwmy6armz5eXlNoLmJcl4F1QuKu7sr+mFQ0byX7Ew=
|
k8s.io/utils v0.0.0-20190506122338-8fab8cb257d5/go.mod h1:sZAwmy6armz5eXlNoLmJcl4F1QuKu7sr+mFQ0byX7Ew=
|
||||||
k8s.io/utils v0.0.0-20201110183641-67b214c5f920/go.mod h1:jPW/WVKK9YHAvNhRxK0md/EJ228hCsBRufyofKtW8HA=
|
k8s.io/utils v0.0.0-20201110183641-67b214c5f920/go.mod h1:jPW/WVKK9YHAvNhRxK0md/EJ228hCsBRufyofKtW8HA=
|
||||||
|
|||||||
26
vendor/github.com/bits-and-blooms/bitset/.gitignore
generated
vendored
Normal file
26
vendor/github.com/bits-and-blooms/bitset/.gitignore
generated
vendored
Normal file
@ -0,0 +1,26 @@
|
|||||||
|
# Compiled Object files, Static and Dynamic libs (Shared Objects)
|
||||||
|
*.o
|
||||||
|
*.a
|
||||||
|
*.so
|
||||||
|
|
||||||
|
# Folders
|
||||||
|
_obj
|
||||||
|
_test
|
||||||
|
|
||||||
|
# Architecture specific extensions/prefixes
|
||||||
|
*.[568vq]
|
||||||
|
[568vq].out
|
||||||
|
|
||||||
|
*.cgo1.go
|
||||||
|
*.cgo2.c
|
||||||
|
_cgo_defun.c
|
||||||
|
_cgo_gotypes.go
|
||||||
|
_cgo_export.*
|
||||||
|
|
||||||
|
_testmain.go
|
||||||
|
|
||||||
|
*.exe
|
||||||
|
*.test
|
||||||
|
*.prof
|
||||||
|
|
||||||
|
target
|
||||||
37
vendor/github.com/bits-and-blooms/bitset/.travis.yml
generated
vendored
Normal file
37
vendor/github.com/bits-and-blooms/bitset/.travis.yml
generated
vendored
Normal file
@ -0,0 +1,37 @@
|
|||||||
|
language: go
|
||||||
|
|
||||||
|
sudo: false
|
||||||
|
|
||||||
|
branches:
|
||||||
|
except:
|
||||||
|
- release
|
||||||
|
|
||||||
|
branches:
|
||||||
|
only:
|
||||||
|
- master
|
||||||
|
- travis
|
||||||
|
|
||||||
|
go:
|
||||||
|
- "1.11.x"
|
||||||
|
- tip
|
||||||
|
|
||||||
|
matrix:
|
||||||
|
allow_failures:
|
||||||
|
- go: tip
|
||||||
|
|
||||||
|
before_install:
|
||||||
|
- if [ -n "$GH_USER" ]; then git config --global github.user ${GH_USER}; fi;
|
||||||
|
- if [ -n "$GH_TOKEN" ]; then git config --global github.token ${GH_TOKEN}; fi;
|
||||||
|
- go get github.com/mattn/goveralls
|
||||||
|
|
||||||
|
before_script:
|
||||||
|
- make deps
|
||||||
|
|
||||||
|
script:
|
||||||
|
- make qa
|
||||||
|
|
||||||
|
after_failure:
|
||||||
|
- cat ./target/test/report.xml
|
||||||
|
|
||||||
|
after_success:
|
||||||
|
- if [ "$TRAVIS_GO_VERSION" = "1.11.1" ]; then $HOME/gopath/bin/goveralls -covermode=count -coverprofile=target/report/coverage.out -service=travis-ci; fi;
|
||||||
27
vendor/github.com/bits-and-blooms/bitset/LICENSE
generated
vendored
Normal file
27
vendor/github.com/bits-and-blooms/bitset/LICENSE
generated
vendored
Normal file
@ -0,0 +1,27 @@
|
|||||||
|
Copyright (c) 2014 Will Fitzgerald. All rights reserved.
|
||||||
|
|
||||||
|
Redistribution and use in source and binary forms, with or without
|
||||||
|
modification, are permitted provided that the following conditions are
|
||||||
|
met:
|
||||||
|
|
||||||
|
* Redistributions of source code must retain the above copyright
|
||||||
|
notice, this list of conditions and the following disclaimer.
|
||||||
|
* Redistributions in binary form must reproduce the above
|
||||||
|
copyright notice, this list of conditions and the following disclaimer
|
||||||
|
in the documentation and/or other materials provided with the
|
||||||
|
distribution.
|
||||||
|
* Neither the name of Google Inc. nor the names of its
|
||||||
|
contributors may be used to endorse or promote products derived from
|
||||||
|
this software without specific prior written permission.
|
||||||
|
|
||||||
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||||||
|
"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||||||
|
LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||||||
|
A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||||||
|
OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||||||
|
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||||
|
LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||||||
|
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||||||
|
THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||||||
|
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||||||
|
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||||
93
vendor/github.com/bits-and-blooms/bitset/README.md
generated
vendored
Normal file
93
vendor/github.com/bits-and-blooms/bitset/README.md
generated
vendored
Normal file
@ -0,0 +1,93 @@
|
|||||||
|
# bitset
|
||||||
|
|
||||||
|
*Go language library to map between non-negative integers and boolean values*
|
||||||
|
|
||||||
|
[](https://github.com/willf/bitset/actions?query=workflow%3ATest)
|
||||||
|
[](https://goreportcard.com/report/github.com/willf/bitset)
|
||||||
|
[](https://pkg.go.dev/github.com/bits-and-blooms/bitset?tab=doc)
|
||||||
|
|
||||||
|
|
||||||
|
## Description
|
||||||
|
|
||||||
|
Package bitset implements bitsets, a mapping between non-negative integers and boolean values.
|
||||||
|
It should be more efficient than map[uint] bool.
|
||||||
|
|
||||||
|
It provides methods for setting, clearing, flipping, and testing individual integers.
|
||||||
|
|
||||||
|
But it also provides set intersection, union, difference, complement, and symmetric operations, as well as tests to check whether any, all, or no bits are set, and querying a bitset's current length and number of positive bits.
|
||||||
|
|
||||||
|
BitSets are expanded to the size of the largest set bit; the memory allocation is approximately Max bits, where Max is the largest set bit. BitSets are never shrunk. On creation, a hint can be given for the number of bits that will be used.
|
||||||
|
|
||||||
|
Many of the methods, including Set, Clear, and Flip, return a BitSet pointer, which allows for chaining.
|
||||||
|
|
||||||
|
### Example use:
|
||||||
|
|
||||||
|
```go
|
||||||
|
package main
|
||||||
|
|
||||||
|
import (
|
||||||
|
"fmt"
|
||||||
|
"math/rand"
|
||||||
|
|
||||||
|
"github.com/bits-and-blooms/bitset"
|
||||||
|
)
|
||||||
|
|
||||||
|
func main() {
|
||||||
|
fmt.Printf("Hello from BitSet!\n")
|
||||||
|
var b bitset.BitSet
|
||||||
|
// play some Go Fish
|
||||||
|
for i := 0; i < 100; i++ {
|
||||||
|
card1 := uint(rand.Intn(52))
|
||||||
|
card2 := uint(rand.Intn(52))
|
||||||
|
b.Set(card1)
|
||||||
|
if b.Test(card2) {
|
||||||
|
fmt.Println("Go Fish!")
|
||||||
|
}
|
||||||
|
b.Clear(card1)
|
||||||
|
}
|
||||||
|
|
||||||
|
// Chaining
|
||||||
|
b.Set(10).Set(11)
|
||||||
|
|
||||||
|
for i, e := b.NextSet(0); e; i, e = b.NextSet(i + 1) {
|
||||||
|
fmt.Println("The following bit is set:", i)
|
||||||
|
}
|
||||||
|
if b.Intersection(bitset.New(100).Set(10)).Count() == 1 {
|
||||||
|
fmt.Println("Intersection works.")
|
||||||
|
} else {
|
||||||
|
fmt.Println("Intersection doesn't work???")
|
||||||
|
}
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
As an alternative to BitSets, one should check out the 'big' package, which provides a (less set-theoretical) view of bitsets.
|
||||||
|
|
||||||
|
Package documentation is at: https://pkg.go.dev/github.com/bits-and-blooms/bitset?tab=doc
|
||||||
|
|
||||||
|
## Memory Usage
|
||||||
|
|
||||||
|
The memory usage of a bitset using N bits is at least N/8 bytes. The number of bits in a bitset is at least as large as one plus the greatest bit index you have accessed. Thus it is possible to run out of memory while using a bitset. If you have lots of bits, you might prefer compressed bitsets, like the [Roaring bitmaps](http://roaringbitmap.org) and its [Go implementation](https://github.com/RoaringBitmap/roaring).
|
||||||
|
|
||||||
|
## Implementation Note
|
||||||
|
|
||||||
|
Go 1.9 introduced a native `math/bits` library. We provide backward compatibility to Go 1.7, which might be removed.
|
||||||
|
|
||||||
|
It is possible that a later version will match the `math/bits` return signature for counts (which is `int`, rather than our library's `unit64`). If so, the version will be bumped.
|
||||||
|
|
||||||
|
## Installation
|
||||||
|
|
||||||
|
```bash
|
||||||
|
go get github.com/bits-and-blooms/bitset
|
||||||
|
```
|
||||||
|
|
||||||
|
## Contributing
|
||||||
|
|
||||||
|
If you wish to contribute to this project, please branch and issue a pull request against master ("[GitHub Flow](https://guides.github.com/introduction/flow/)")
|
||||||
|
|
||||||
|
## Running all tests
|
||||||
|
|
||||||
|
Before committing the code, please check if it passes tests, has adequate coverage, etc.
|
||||||
|
```bash
|
||||||
|
go test
|
||||||
|
go test -cover
|
||||||
|
```
|
||||||
39
vendor/github.com/bits-and-blooms/bitset/azure-pipelines.yml
generated
vendored
Normal file
39
vendor/github.com/bits-and-blooms/bitset/azure-pipelines.yml
generated
vendored
Normal file
@ -0,0 +1,39 @@
|
|||||||
|
# Go
|
||||||
|
# Build your Go project.
|
||||||
|
# Add steps that test, save build artifacts, deploy, and more:
|
||||||
|
# https://docs.microsoft.com/azure/devops/pipelines/languages/go
|
||||||
|
|
||||||
|
trigger:
|
||||||
|
- master
|
||||||
|
|
||||||
|
pool:
|
||||||
|
vmImage: 'Ubuntu-16.04'
|
||||||
|
|
||||||
|
variables:
|
||||||
|
GOBIN: '$(GOPATH)/bin' # Go binaries path
|
||||||
|
GOROOT: '/usr/local/go1.11' # Go installation path
|
||||||
|
GOPATH: '$(system.defaultWorkingDirectory)/gopath' # Go workspace path
|
||||||
|
modulePath: '$(GOPATH)/src/github.com/$(build.repository.name)' # Path to the module's code
|
||||||
|
|
||||||
|
steps:
|
||||||
|
- script: |
|
||||||
|
mkdir -p '$(GOBIN)'
|
||||||
|
mkdir -p '$(GOPATH)/pkg'
|
||||||
|
mkdir -p '$(modulePath)'
|
||||||
|
shopt -s extglob
|
||||||
|
shopt -s dotglob
|
||||||
|
mv !(gopath) '$(modulePath)'
|
||||||
|
echo '##vso[task.prependpath]$(GOBIN)'
|
||||||
|
echo '##vso[task.prependpath]$(GOROOT)/bin'
|
||||||
|
displayName: 'Set up the Go workspace'
|
||||||
|
|
||||||
|
- script: |
|
||||||
|
go version
|
||||||
|
go get -v -t -d ./...
|
||||||
|
if [ -f Gopkg.toml ]; then
|
||||||
|
curl https://raw.githubusercontent.com/golang/dep/master/install.sh | sh
|
||||||
|
dep ensure
|
||||||
|
fi
|
||||||
|
go build -v .
|
||||||
|
workingDirectory: '$(modulePath)'
|
||||||
|
displayName: 'Get dependencies, then build'
|
||||||
952
vendor/github.com/bits-and-blooms/bitset/bitset.go
generated
vendored
Normal file
952
vendor/github.com/bits-and-blooms/bitset/bitset.go
generated
vendored
Normal file
@ -0,0 +1,952 @@
|
|||||||
|
/*
|
||||||
|
Package bitset implements bitsets, a mapping
|
||||||
|
between non-negative integers and boolean values. It should be more
|
||||||
|
efficient than map[uint] bool.
|
||||||
|
|
||||||
|
It provides methods for setting, clearing, flipping, and testing
|
||||||
|
individual integers.
|
||||||
|
|
||||||
|
But it also provides set intersection, union, difference,
|
||||||
|
complement, and symmetric operations, as well as tests to
|
||||||
|
check whether any, all, or no bits are set, and querying a
|
||||||
|
bitset's current length and number of positive bits.
|
||||||
|
|
||||||
|
BitSets are expanded to the size of the largest set bit; the
|
||||||
|
memory allocation is approximately Max bits, where Max is
|
||||||
|
the largest set bit. BitSets are never shrunk. On creation,
|
||||||
|
a hint can be given for the number of bits that will be used.
|
||||||
|
|
||||||
|
Many of the methods, including Set,Clear, and Flip, return
|
||||||
|
a BitSet pointer, which allows for chaining.
|
||||||
|
|
||||||
|
Example use:
|
||||||
|
|
||||||
|
import "bitset"
|
||||||
|
var b BitSet
|
||||||
|
b.Set(10).Set(11)
|
||||||
|
if b.Test(1000) {
|
||||||
|
b.Clear(1000)
|
||||||
|
}
|
||||||
|
if B.Intersection(bitset.New(100).Set(10)).Count() > 1 {
|
||||||
|
fmt.Println("Intersection works.")
|
||||||
|
}
|
||||||
|
|
||||||
|
As an alternative to BitSets, one should check out the 'big' package,
|
||||||
|
which provides a (less set-theoretical) view of bitsets.
|
||||||
|
|
||||||
|
*/
|
||||||
|
package bitset
|
||||||
|
|
||||||
|
import (
|
||||||
|
"bufio"
|
||||||
|
"bytes"
|
||||||
|
"encoding/base64"
|
||||||
|
"encoding/binary"
|
||||||
|
"encoding/json"
|
||||||
|
"errors"
|
||||||
|
"fmt"
|
||||||
|
"io"
|
||||||
|
"strconv"
|
||||||
|
)
|
||||||
|
|
||||||
|
// the wordSize of a bit set
|
||||||
|
const wordSize = uint(64)
|
||||||
|
|
||||||
|
// log2WordSize is lg(wordSize)
|
||||||
|
const log2WordSize = uint(6)
|
||||||
|
|
||||||
|
// allBits has every bit set
|
||||||
|
const allBits uint64 = 0xffffffffffffffff
|
||||||
|
|
||||||
|
// default binary BigEndian
|
||||||
|
var binaryOrder binary.ByteOrder = binary.BigEndian
|
||||||
|
|
||||||
|
// default json encoding base64.URLEncoding
|
||||||
|
var base64Encoding = base64.URLEncoding
|
||||||
|
|
||||||
|
// Base64StdEncoding Marshal/Unmarshal BitSet with base64.StdEncoding(Default: base64.URLEncoding)
|
||||||
|
func Base64StdEncoding() { base64Encoding = base64.StdEncoding }
|
||||||
|
|
||||||
|
// LittleEndian Marshal/Unmarshal Binary as Little Endian(Default: binary.BigEndian)
|
||||||
|
func LittleEndian() { binaryOrder = binary.LittleEndian }
|
||||||
|
|
||||||
|
// A BitSet is a set of bits. The zero value of a BitSet is an empty set of length 0.
|
||||||
|
type BitSet struct {
|
||||||
|
length uint
|
||||||
|
set []uint64
|
||||||
|
}
|
||||||
|
|
||||||
|
// Error is used to distinguish errors (panics) generated in this package.
|
||||||
|
type Error string
|
||||||
|
|
||||||
|
// safeSet will fixup b.set to be non-nil and return the field value
|
||||||
|
func (b *BitSet) safeSet() []uint64 {
|
||||||
|
if b.set == nil {
|
||||||
|
b.set = make([]uint64, wordsNeeded(0))
|
||||||
|
}
|
||||||
|
return b.set
|
||||||
|
}
|
||||||
|
|
||||||
|
// From is a constructor used to create a BitSet from an array of integers
|
||||||
|
func From(buf []uint64) *BitSet {
|
||||||
|
return &BitSet{uint(len(buf)) * 64, buf}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Bytes returns the bitset as array of integers
|
||||||
|
func (b *BitSet) Bytes() []uint64 {
|
||||||
|
return b.set
|
||||||
|
}
|
||||||
|
|
||||||
|
// wordsNeeded calculates the number of words needed for i bits
|
||||||
|
func wordsNeeded(i uint) int {
|
||||||
|
if i > (Cap() - wordSize + 1) {
|
||||||
|
return int(Cap() >> log2WordSize)
|
||||||
|
}
|
||||||
|
return int((i + (wordSize - 1)) >> log2WordSize)
|
||||||
|
}
|
||||||
|
|
||||||
|
// New creates a new BitSet with a hint that length bits will be required
|
||||||
|
func New(length uint) (bset *BitSet) {
|
||||||
|
defer func() {
|
||||||
|
if r := recover(); r != nil {
|
||||||
|
bset = &BitSet{
|
||||||
|
0,
|
||||||
|
make([]uint64, 0),
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}()
|
||||||
|
|
||||||
|
bset = &BitSet{
|
||||||
|
length,
|
||||||
|
make([]uint64, wordsNeeded(length)),
|
||||||
|
}
|
||||||
|
|
||||||
|
return bset
|
||||||
|
}
|
||||||
|
|
||||||
|
// Cap returns the total possible capacity, or number of bits
|
||||||
|
func Cap() uint {
|
||||||
|
return ^uint(0)
|
||||||
|
}
|
||||||
|
|
||||||
|
// Len returns the number of bits in the BitSet.
|
||||||
|
// Note the difference to method Count, see example.
|
||||||
|
func (b *BitSet) Len() uint {
|
||||||
|
return b.length
|
||||||
|
}
|
||||||
|
|
||||||
|
// extendSetMaybe adds additional words to incorporate new bits if needed
|
||||||
|
func (b *BitSet) extendSetMaybe(i uint) {
|
||||||
|
if i >= b.length { // if we need more bits, make 'em
|
||||||
|
if i >= Cap() {
|
||||||
|
panic("You are exceeding the capacity")
|
||||||
|
}
|
||||||
|
nsize := wordsNeeded(i + 1)
|
||||||
|
if b.set == nil {
|
||||||
|
b.set = make([]uint64, nsize)
|
||||||
|
} else if cap(b.set) >= nsize {
|
||||||
|
b.set = b.set[:nsize] // fast resize
|
||||||
|
} else if len(b.set) < nsize {
|
||||||
|
newset := make([]uint64, nsize, 2*nsize) // increase capacity 2x
|
||||||
|
copy(newset, b.set)
|
||||||
|
b.set = newset
|
||||||
|
}
|
||||||
|
b.length = i + 1
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Test whether bit i is set.
|
||||||
|
func (b *BitSet) Test(i uint) bool {
|
||||||
|
if i >= b.length {
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
return b.set[i>>log2WordSize]&(1<<(i&(wordSize-1))) != 0
|
||||||
|
}
|
||||||
|
|
||||||
|
// Set bit i to 1, the capacity of the bitset is automatically
|
||||||
|
// increased accordingly.
|
||||||
|
// If i>= Cap(), this function will panic.
|
||||||
|
// Warning: using a very large value for 'i'
|
||||||
|
// may lead to a memory shortage and a panic: the caller is responsible
|
||||||
|
// for providing sensible parameters in line with their memory capacity.
|
||||||
|
func (b *BitSet) Set(i uint) *BitSet {
|
||||||
|
b.extendSetMaybe(i)
|
||||||
|
b.set[i>>log2WordSize] |= 1 << (i & (wordSize - 1))
|
||||||
|
return b
|
||||||
|
}
|
||||||
|
|
||||||
|
// Clear bit i to 0
|
||||||
|
func (b *BitSet) Clear(i uint) *BitSet {
|
||||||
|
if i >= b.length {
|
||||||
|
return b
|
||||||
|
}
|
||||||
|
b.set[i>>log2WordSize] &^= 1 << (i & (wordSize - 1))
|
||||||
|
return b
|
||||||
|
}
|
||||||
|
|
||||||
|
// SetTo sets bit i to value.
|
||||||
|
// If i>= Cap(), this function will panic.
|
||||||
|
// Warning: using a very large value for 'i'
|
||||||
|
// may lead to a memory shortage and a panic: the caller is responsible
|
||||||
|
// for providing sensible parameters in line with their memory capacity.
|
||||||
|
func (b *BitSet) SetTo(i uint, value bool) *BitSet {
|
||||||
|
if value {
|
||||||
|
return b.Set(i)
|
||||||
|
}
|
||||||
|
return b.Clear(i)
|
||||||
|
}
|
||||||
|
|
||||||
|
// Flip bit at i.
|
||||||
|
// If i>= Cap(), this function will panic.
|
||||||
|
// Warning: using a very large value for 'i'
|
||||||
|
// may lead to a memory shortage and a panic: the caller is responsible
|
||||||
|
// for providing sensible parameters in line with their memory capacity.
|
||||||
|
func (b *BitSet) Flip(i uint) *BitSet {
|
||||||
|
if i >= b.length {
|
||||||
|
return b.Set(i)
|
||||||
|
}
|
||||||
|
b.set[i>>log2WordSize] ^= 1 << (i & (wordSize - 1))
|
||||||
|
return b
|
||||||
|
}
|
||||||
|
|
||||||
|
// FlipRange bit in [start, end).
|
||||||
|
// If end>= Cap(), this function will panic.
|
||||||
|
// Warning: using a very large value for 'end'
|
||||||
|
// may lead to a memory shortage and a panic: the caller is responsible
|
||||||
|
// for providing sensible parameters in line with their memory capacity.
|
||||||
|
func (b *BitSet) FlipRange(start, end uint) *BitSet {
|
||||||
|
if start >= end {
|
||||||
|
return b
|
||||||
|
}
|
||||||
|
|
||||||
|
b.extendSetMaybe(end - 1)
|
||||||
|
var startWord uint = start >> log2WordSize
|
||||||
|
var endWord uint = end >> log2WordSize
|
||||||
|
b.set[startWord] ^= ^(^uint64(0) << (start & (wordSize - 1)))
|
||||||
|
for i := startWord; i < endWord; i++ {
|
||||||
|
b.set[i] = ^b.set[i]
|
||||||
|
}
|
||||||
|
b.set[endWord] ^= ^uint64(0) >> (-end & (wordSize - 1))
|
||||||
|
return b
|
||||||
|
}
|
||||||
|
|
||||||
|
// Shrink shrinks BitSet so that the provided value is the last possible
|
||||||
|
// set value. It clears all bits > the provided index and reduces the size
|
||||||
|
// and length of the set.
|
||||||
|
//
|
||||||
|
// Note that the parameter value is not the new length in bits: it is the
|
||||||
|
// maximal value that can be stored in the bitset after the function call.
|
||||||
|
// The new length in bits is the parameter value + 1. Thus it is not possible
|
||||||
|
// to use this function to set the length to 0, the minimal value of the length
|
||||||
|
// after this function call is 1.
|
||||||
|
//
|
||||||
|
// A new slice is allocated to store the new bits, so you may see an increase in
|
||||||
|
// memory usage until the GC runs. Normally this should not be a problem, but if you
|
||||||
|
// have an extremely large BitSet its important to understand that the old BitSet will
|
||||||
|
// remain in memory until the GC frees it.
|
||||||
|
func (b *BitSet) Shrink(lastbitindex uint) *BitSet {
|
||||||
|
length := lastbitindex + 1
|
||||||
|
idx := wordsNeeded(length)
|
||||||
|
if idx > len(b.set) {
|
||||||
|
return b
|
||||||
|
}
|
||||||
|
shrunk := make([]uint64, idx)
|
||||||
|
copy(shrunk, b.set[:idx])
|
||||||
|
b.set = shrunk
|
||||||
|
b.length = length
|
||||||
|
b.set[idx-1] &= (allBits >> (uint64(64) - uint64(length&(wordSize-1))))
|
||||||
|
return b
|
||||||
|
}
|
||||||
|
|
||||||
|
// Compact shrinks BitSet to so that we preserve all set bits, while minimizing
|
||||||
|
// memory usage. Compact calls Shrink.
|
||||||
|
func (b *BitSet) Compact() *BitSet {
|
||||||
|
idx := len(b.set) - 1
|
||||||
|
for ; idx >= 0 && b.set[idx] == 0; idx-- {
|
||||||
|
}
|
||||||
|
newlength := uint((idx + 1) << log2WordSize)
|
||||||
|
if newlength >= b.length {
|
||||||
|
return b // nothing to do
|
||||||
|
}
|
||||||
|
if newlength > 0 {
|
||||||
|
return b.Shrink(newlength - 1)
|
||||||
|
}
|
||||||
|
// We preserve one word
|
||||||
|
return b.Shrink(63)
|
||||||
|
}
|
||||||
|
|
||||||
|
// InsertAt takes an index which indicates where a bit should be
|
||||||
|
// inserted. Then it shifts all the bits in the set to the left by 1, starting
|
||||||
|
// from the given index position, and sets the index position to 0.
|
||||||
|
//
|
||||||
|
// Depending on the size of your BitSet, and where you are inserting the new entry,
|
||||||
|
// this method could be extremely slow and in some cases might cause the entire BitSet
|
||||||
|
// to be recopied.
|
||||||
|
func (b *BitSet) InsertAt(idx uint) *BitSet {
|
||||||
|
insertAtElement := (idx >> log2WordSize)
|
||||||
|
|
||||||
|
// if length of set is a multiple of wordSize we need to allocate more space first
|
||||||
|
if b.isLenExactMultiple() {
|
||||||
|
b.set = append(b.set, uint64(0))
|
||||||
|
}
|
||||||
|
|
||||||
|
var i uint
|
||||||
|
for i = uint(len(b.set) - 1); i > insertAtElement; i-- {
|
||||||
|
// all elements above the position where we want to insert can simply by shifted
|
||||||
|
b.set[i] <<= 1
|
||||||
|
|
||||||
|
// we take the most significant bit of the previous element and set it as
|
||||||
|
// the least significant bit of the current element
|
||||||
|
b.set[i] |= (b.set[i-1] & 0x8000000000000000) >> 63
|
||||||
|
}
|
||||||
|
|
||||||
|
// generate a mask to extract the data that we need to shift left
|
||||||
|
// within the element where we insert a bit
|
||||||
|
dataMask := ^(uint64(1)<<uint64(idx&(wordSize-1)) - 1)
|
||||||
|
|
||||||
|
// extract that data that we'll shift
|
||||||
|
data := b.set[i] & dataMask
|
||||||
|
|
||||||
|
// set the positions of the data mask to 0 in the element where we insert
|
||||||
|
b.set[i] &= ^dataMask
|
||||||
|
|
||||||
|
// shift data mask to the left and insert its data to the slice element
|
||||||
|
b.set[i] |= data << 1
|
||||||
|
|
||||||
|
// add 1 to length of BitSet
|
||||||
|
b.length++
|
||||||
|
|
||||||
|
return b
|
||||||
|
}
|
||||||
|
|
||||||
|
// String creates a string representation of the Bitmap
|
||||||
|
func (b *BitSet) String() string {
|
||||||
|
// follows code from https://github.com/RoaringBitmap/roaring
|
||||||
|
var buffer bytes.Buffer
|
||||||
|
start := []byte("{")
|
||||||
|
buffer.Write(start)
|
||||||
|
counter := 0
|
||||||
|
i, e := b.NextSet(0)
|
||||||
|
for e {
|
||||||
|
counter = counter + 1
|
||||||
|
// to avoid exhausting the memory
|
||||||
|
if counter > 0x40000 {
|
||||||
|
buffer.WriteString("...")
|
||||||
|
break
|
||||||
|
}
|
||||||
|
buffer.WriteString(strconv.FormatInt(int64(i), 10))
|
||||||
|
i, e = b.NextSet(i + 1)
|
||||||
|
if e {
|
||||||
|
buffer.WriteString(",")
|
||||||
|
}
|
||||||
|
}
|
||||||
|
buffer.WriteString("}")
|
||||||
|
return buffer.String()
|
||||||
|
}
|
||||||
|
|
||||||
|
// DeleteAt deletes the bit at the given index position from
|
||||||
|
// within the bitset
|
||||||
|
// All the bits residing on the left of the deleted bit get
|
||||||
|
// shifted right by 1
|
||||||
|
// The running time of this operation may potentially be
|
||||||
|
// relatively slow, O(length)
|
||||||
|
func (b *BitSet) DeleteAt(i uint) *BitSet {
|
||||||
|
// the index of the slice element where we'll delete a bit
|
||||||
|
deleteAtElement := i >> log2WordSize
|
||||||
|
|
||||||
|
// generate a mask for the data that needs to be shifted right
|
||||||
|
// within that slice element that gets modified
|
||||||
|
dataMask := ^((uint64(1) << (i & (wordSize - 1))) - 1)
|
||||||
|
|
||||||
|
// extract the data that we'll shift right from the slice element
|
||||||
|
data := b.set[deleteAtElement] & dataMask
|
||||||
|
|
||||||
|
// set the masked area to 0 while leaving the rest as it is
|
||||||
|
b.set[deleteAtElement] &= ^dataMask
|
||||||
|
|
||||||
|
// shift the previously extracted data to the right and then
|
||||||
|
// set it in the previously masked area
|
||||||
|
b.set[deleteAtElement] |= (data >> 1) & dataMask
|
||||||
|
|
||||||
|
// loop over all the consecutive slice elements to copy each
|
||||||
|
// lowest bit into the highest position of the previous element,
|
||||||
|
// then shift the entire content to the right by 1
|
||||||
|
for i := int(deleteAtElement) + 1; i < len(b.set); i++ {
|
||||||
|
b.set[i-1] |= (b.set[i] & 1) << 63
|
||||||
|
b.set[i] >>= 1
|
||||||
|
}
|
||||||
|
|
||||||
|
b.length = b.length - 1
|
||||||
|
|
||||||
|
return b
|
||||||
|
}
|
||||||
|
|
||||||
|
// NextSet returns the next bit set from the specified index,
|
||||||
|
// including possibly the current index
|
||||||
|
// along with an error code (true = valid, false = no set bit found)
|
||||||
|
// for i,e := v.NextSet(0); e; i,e = v.NextSet(i + 1) {...}
|
||||||
|
//
|
||||||
|
// Users concerned with performance may want to use NextSetMany to
|
||||||
|
// retrieve several values at once.
|
||||||
|
func (b *BitSet) NextSet(i uint) (uint, bool) {
|
||||||
|
x := int(i >> log2WordSize)
|
||||||
|
if x >= len(b.set) {
|
||||||
|
return 0, false
|
||||||
|
}
|
||||||
|
w := b.set[x]
|
||||||
|
w = w >> (i & (wordSize - 1))
|
||||||
|
if w != 0 {
|
||||||
|
return i + trailingZeroes64(w), true
|
||||||
|
}
|
||||||
|
x = x + 1
|
||||||
|
for x < len(b.set) {
|
||||||
|
if b.set[x] != 0 {
|
||||||
|
return uint(x)*wordSize + trailingZeroes64(b.set[x]), true
|
||||||
|
}
|
||||||
|
x = x + 1
|
||||||
|
|
||||||
|
}
|
||||||
|
return 0, false
|
||||||
|
}
|
||||||
|
|
||||||
|
// NextSetMany returns many next bit sets from the specified index,
|
||||||
|
// including possibly the current index and up to cap(buffer).
|
||||||
|
// If the returned slice has len zero, then no more set bits were found
|
||||||
|
//
|
||||||
|
// buffer := make([]uint, 256) // this should be reused
|
||||||
|
// j := uint(0)
|
||||||
|
// j, buffer = bitmap.NextSetMany(j, buffer)
|
||||||
|
// for ; len(buffer) > 0; j, buffer = bitmap.NextSetMany(j,buffer) {
|
||||||
|
// for k := range buffer {
|
||||||
|
// do something with buffer[k]
|
||||||
|
// }
|
||||||
|
// j += 1
|
||||||
|
// }
|
||||||
|
//
|
||||||
|
//
|
||||||
|
// It is possible to retrieve all set bits as follow:
|
||||||
|
//
|
||||||
|
// indices := make([]uint, bitmap.Count())
|
||||||
|
// bitmap.NextSetMany(0, indices)
|
||||||
|
//
|
||||||
|
// However if bitmap.Count() is large, it might be preferable to
|
||||||
|
// use several calls to NextSetMany, for performance reasons.
|
||||||
|
func (b *BitSet) NextSetMany(i uint, buffer []uint) (uint, []uint) {
|
||||||
|
myanswer := buffer
|
||||||
|
capacity := cap(buffer)
|
||||||
|
x := int(i >> log2WordSize)
|
||||||
|
if x >= len(b.set) || capacity == 0 {
|
||||||
|
return 0, myanswer[:0]
|
||||||
|
}
|
||||||
|
skip := i & (wordSize - 1)
|
||||||
|
word := b.set[x] >> skip
|
||||||
|
myanswer = myanswer[:capacity]
|
||||||
|
size := int(0)
|
||||||
|
for word != 0 {
|
||||||
|
r := trailingZeroes64(word)
|
||||||
|
t := word & ((^word) + 1)
|
||||||
|
myanswer[size] = r + i
|
||||||
|
size++
|
||||||
|
if size == capacity {
|
||||||
|
goto End
|
||||||
|
}
|
||||||
|
word = word ^ t
|
||||||
|
}
|
||||||
|
x++
|
||||||
|
for idx, word := range b.set[x:] {
|
||||||
|
for word != 0 {
|
||||||
|
r := trailingZeroes64(word)
|
||||||
|
t := word & ((^word) + 1)
|
||||||
|
myanswer[size] = r + (uint(x+idx) << 6)
|
||||||
|
size++
|
||||||
|
if size == capacity {
|
||||||
|
goto End
|
||||||
|
}
|
||||||
|
word = word ^ t
|
||||||
|
}
|
||||||
|
}
|
||||||
|
End:
|
||||||
|
if size > 0 {
|
||||||
|
return myanswer[size-1], myanswer[:size]
|
||||||
|
}
|
||||||
|
return 0, myanswer[:0]
|
||||||
|
}
|
||||||
|
|
||||||
|
// NextClear returns the next clear bit from the specified index,
|
||||||
|
// including possibly the current index
|
||||||
|
// along with an error code (true = valid, false = no bit found i.e. all bits are set)
|
||||||
|
func (b *BitSet) NextClear(i uint) (uint, bool) {
|
||||||
|
x := int(i >> log2WordSize)
|
||||||
|
if x >= len(b.set) {
|
||||||
|
return 0, false
|
||||||
|
}
|
||||||
|
w := b.set[x]
|
||||||
|
w = w >> (i & (wordSize - 1))
|
||||||
|
wA := allBits >> (i & (wordSize - 1))
|
||||||
|
index := i + trailingZeroes64(^w)
|
||||||
|
if w != wA && index < b.length {
|
||||||
|
return index, true
|
||||||
|
}
|
||||||
|
x++
|
||||||
|
for x < len(b.set) {
|
||||||
|
index = uint(x)*wordSize + trailingZeroes64(^b.set[x])
|
||||||
|
if b.set[x] != allBits && index < b.length {
|
||||||
|
return index, true
|
||||||
|
}
|
||||||
|
x++
|
||||||
|
}
|
||||||
|
return 0, false
|
||||||
|
}
|
||||||
|
|
||||||
|
// ClearAll clears the entire BitSet
|
||||||
|
func (b *BitSet) ClearAll() *BitSet {
|
||||||
|
if b != nil && b.set != nil {
|
||||||
|
for i := range b.set {
|
||||||
|
b.set[i] = 0
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return b
|
||||||
|
}
|
||||||
|
|
||||||
|
// wordCount returns the number of words used in a bit set
|
||||||
|
func (b *BitSet) wordCount() int {
|
||||||
|
return len(b.set)
|
||||||
|
}
|
||||||
|
|
||||||
|
// Clone this BitSet
|
||||||
|
func (b *BitSet) Clone() *BitSet {
|
||||||
|
c := New(b.length)
|
||||||
|
if b.set != nil { // Clone should not modify current object
|
||||||
|
copy(c.set, b.set)
|
||||||
|
}
|
||||||
|
return c
|
||||||
|
}
|
||||||
|
|
||||||
|
// Copy into a destination BitSet
|
||||||
|
// Returning the size of the destination BitSet
|
||||||
|
// like array copy
|
||||||
|
func (b *BitSet) Copy(c *BitSet) (count uint) {
|
||||||
|
if c == nil {
|
||||||
|
return
|
||||||
|
}
|
||||||
|
if b.set != nil { // Copy should not modify current object
|
||||||
|
copy(c.set, b.set)
|
||||||
|
}
|
||||||
|
count = c.length
|
||||||
|
if b.length < c.length {
|
||||||
|
count = b.length
|
||||||
|
}
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
// Count (number of set bits).
|
||||||
|
// Also known as "popcount" or "population count".
|
||||||
|
func (b *BitSet) Count() uint {
|
||||||
|
if b != nil && b.set != nil {
|
||||||
|
return uint(popcntSlice(b.set))
|
||||||
|
}
|
||||||
|
return 0
|
||||||
|
}
|
||||||
|
|
||||||
|
// Equal tests the equivalence of two BitSets.
|
||||||
|
// False if they are of different sizes, otherwise true
|
||||||
|
// only if all the same bits are set
|
||||||
|
func (b *BitSet) Equal(c *BitSet) bool {
|
||||||
|
if c == nil || b == nil {
|
||||||
|
return c == b
|
||||||
|
}
|
||||||
|
if b.length != c.length {
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
if b.length == 0 { // if they have both length == 0, then could have nil set
|
||||||
|
return true
|
||||||
|
}
|
||||||
|
// testing for equality shoud not transform the bitset (no call to safeSet)
|
||||||
|
|
||||||
|
for p, v := range b.set {
|
||||||
|
if c.set[p] != v {
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return true
|
||||||
|
}
|
||||||
|
|
||||||
|
func panicIfNull(b *BitSet) {
|
||||||
|
if b == nil {
|
||||||
|
panic(Error("BitSet must not be null"))
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Difference of base set and other set
|
||||||
|
// This is the BitSet equivalent of &^ (and not)
|
||||||
|
func (b *BitSet) Difference(compare *BitSet) (result *BitSet) {
|
||||||
|
panicIfNull(b)
|
||||||
|
panicIfNull(compare)
|
||||||
|
result = b.Clone() // clone b (in case b is bigger than compare)
|
||||||
|
l := int(compare.wordCount())
|
||||||
|
if l > int(b.wordCount()) {
|
||||||
|
l = int(b.wordCount())
|
||||||
|
}
|
||||||
|
for i := 0; i < l; i++ {
|
||||||
|
result.set[i] = b.set[i] &^ compare.set[i]
|
||||||
|
}
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
// DifferenceCardinality computes the cardinality of the differnce
|
||||||
|
func (b *BitSet) DifferenceCardinality(compare *BitSet) uint {
|
||||||
|
panicIfNull(b)
|
||||||
|
panicIfNull(compare)
|
||||||
|
l := int(compare.wordCount())
|
||||||
|
if l > int(b.wordCount()) {
|
||||||
|
l = int(b.wordCount())
|
||||||
|
}
|
||||||
|
cnt := uint64(0)
|
||||||
|
cnt += popcntMaskSlice(b.set[:l], compare.set[:l])
|
||||||
|
cnt += popcntSlice(b.set[l:])
|
||||||
|
return uint(cnt)
|
||||||
|
}
|
||||||
|
|
||||||
|
// InPlaceDifference computes the difference of base set and other set
|
||||||
|
// This is the BitSet equivalent of &^ (and not)
|
||||||
|
func (b *BitSet) InPlaceDifference(compare *BitSet) {
|
||||||
|
panicIfNull(b)
|
||||||
|
panicIfNull(compare)
|
||||||
|
l := int(compare.wordCount())
|
||||||
|
if l > int(b.wordCount()) {
|
||||||
|
l = int(b.wordCount())
|
||||||
|
}
|
||||||
|
for i := 0; i < l; i++ {
|
||||||
|
b.set[i] &^= compare.set[i]
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Convenience function: return two bitsets ordered by
|
||||||
|
// increasing length. Note: neither can be nil
|
||||||
|
func sortByLength(a *BitSet, b *BitSet) (ap *BitSet, bp *BitSet) {
|
||||||
|
if a.length <= b.length {
|
||||||
|
ap, bp = a, b
|
||||||
|
} else {
|
||||||
|
ap, bp = b, a
|
||||||
|
}
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
// Intersection of base set and other set
|
||||||
|
// This is the BitSet equivalent of & (and)
|
||||||
|
func (b *BitSet) Intersection(compare *BitSet) (result *BitSet) {
|
||||||
|
panicIfNull(b)
|
||||||
|
panicIfNull(compare)
|
||||||
|
b, compare = sortByLength(b, compare)
|
||||||
|
result = New(b.length)
|
||||||
|
for i, word := range b.set {
|
||||||
|
result.set[i] = word & compare.set[i]
|
||||||
|
}
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
// IntersectionCardinality computes the cardinality of the union
|
||||||
|
func (b *BitSet) IntersectionCardinality(compare *BitSet) uint {
|
||||||
|
panicIfNull(b)
|
||||||
|
panicIfNull(compare)
|
||||||
|
b, compare = sortByLength(b, compare)
|
||||||
|
cnt := popcntAndSlice(b.set, compare.set)
|
||||||
|
return uint(cnt)
|
||||||
|
}
|
||||||
|
|
||||||
|
// InPlaceIntersection destructively computes the intersection of
|
||||||
|
// base set and the compare set.
|
||||||
|
// This is the BitSet equivalent of & (and)
|
||||||
|
func (b *BitSet) InPlaceIntersection(compare *BitSet) {
|
||||||
|
panicIfNull(b)
|
||||||
|
panicIfNull(compare)
|
||||||
|
l := int(compare.wordCount())
|
||||||
|
if l > int(b.wordCount()) {
|
||||||
|
l = int(b.wordCount())
|
||||||
|
}
|
||||||
|
for i := 0; i < l; i++ {
|
||||||
|
b.set[i] &= compare.set[i]
|
||||||
|
}
|
||||||
|
for i := l; i < len(b.set); i++ {
|
||||||
|
b.set[i] = 0
|
||||||
|
}
|
||||||
|
if compare.length > 0 {
|
||||||
|
b.extendSetMaybe(compare.length - 1)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Union of base set and other set
|
||||||
|
// This is the BitSet equivalent of | (or)
|
||||||
|
func (b *BitSet) Union(compare *BitSet) (result *BitSet) {
|
||||||
|
panicIfNull(b)
|
||||||
|
panicIfNull(compare)
|
||||||
|
b, compare = sortByLength(b, compare)
|
||||||
|
result = compare.Clone()
|
||||||
|
for i, word := range b.set {
|
||||||
|
result.set[i] = word | compare.set[i]
|
||||||
|
}
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
// UnionCardinality computes the cardinality of the uniton of the base set
|
||||||
|
// and the compare set.
|
||||||
|
func (b *BitSet) UnionCardinality(compare *BitSet) uint {
|
||||||
|
panicIfNull(b)
|
||||||
|
panicIfNull(compare)
|
||||||
|
b, compare = sortByLength(b, compare)
|
||||||
|
cnt := popcntOrSlice(b.set, compare.set)
|
||||||
|
if len(compare.set) > len(b.set) {
|
||||||
|
cnt += popcntSlice(compare.set[len(b.set):])
|
||||||
|
}
|
||||||
|
return uint(cnt)
|
||||||
|
}
|
||||||
|
|
||||||
|
// InPlaceUnion creates the destructive union of base set and compare set.
|
||||||
|
// This is the BitSet equivalent of | (or).
|
||||||
|
func (b *BitSet) InPlaceUnion(compare *BitSet) {
|
||||||
|
panicIfNull(b)
|
||||||
|
panicIfNull(compare)
|
||||||
|
l := int(compare.wordCount())
|
||||||
|
if l > int(b.wordCount()) {
|
||||||
|
l = int(b.wordCount())
|
||||||
|
}
|
||||||
|
if compare.length > 0 {
|
||||||
|
b.extendSetMaybe(compare.length - 1)
|
||||||
|
}
|
||||||
|
for i := 0; i < l; i++ {
|
||||||
|
b.set[i] |= compare.set[i]
|
||||||
|
}
|
||||||
|
if len(compare.set) > l {
|
||||||
|
for i := l; i < len(compare.set); i++ {
|
||||||
|
b.set[i] = compare.set[i]
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// SymmetricDifference of base set and other set
|
||||||
|
// This is the BitSet equivalent of ^ (xor)
|
||||||
|
func (b *BitSet) SymmetricDifference(compare *BitSet) (result *BitSet) {
|
||||||
|
panicIfNull(b)
|
||||||
|
panicIfNull(compare)
|
||||||
|
b, compare = sortByLength(b, compare)
|
||||||
|
// compare is bigger, so clone it
|
||||||
|
result = compare.Clone()
|
||||||
|
for i, word := range b.set {
|
||||||
|
result.set[i] = word ^ compare.set[i]
|
||||||
|
}
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
// SymmetricDifferenceCardinality computes the cardinality of the symmetric difference
|
||||||
|
func (b *BitSet) SymmetricDifferenceCardinality(compare *BitSet) uint {
|
||||||
|
panicIfNull(b)
|
||||||
|
panicIfNull(compare)
|
||||||
|
b, compare = sortByLength(b, compare)
|
||||||
|
cnt := popcntXorSlice(b.set, compare.set)
|
||||||
|
if len(compare.set) > len(b.set) {
|
||||||
|
cnt += popcntSlice(compare.set[len(b.set):])
|
||||||
|
}
|
||||||
|
return uint(cnt)
|
||||||
|
}
|
||||||
|
|
||||||
|
// InPlaceSymmetricDifference creates the destructive SymmetricDifference of base set and other set
|
||||||
|
// This is the BitSet equivalent of ^ (xor)
|
||||||
|
func (b *BitSet) InPlaceSymmetricDifference(compare *BitSet) {
|
||||||
|
panicIfNull(b)
|
||||||
|
panicIfNull(compare)
|
||||||
|
l := int(compare.wordCount())
|
||||||
|
if l > int(b.wordCount()) {
|
||||||
|
l = int(b.wordCount())
|
||||||
|
}
|
||||||
|
if compare.length > 0 {
|
||||||
|
b.extendSetMaybe(compare.length - 1)
|
||||||
|
}
|
||||||
|
for i := 0; i < l; i++ {
|
||||||
|
b.set[i] ^= compare.set[i]
|
||||||
|
}
|
||||||
|
if len(compare.set) > l {
|
||||||
|
for i := l; i < len(compare.set); i++ {
|
||||||
|
b.set[i] = compare.set[i]
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Is the length an exact multiple of word sizes?
|
||||||
|
func (b *BitSet) isLenExactMultiple() bool {
|
||||||
|
return b.length%wordSize == 0
|
||||||
|
}
|
||||||
|
|
||||||
|
// Clean last word by setting unused bits to 0
|
||||||
|
func (b *BitSet) cleanLastWord() {
|
||||||
|
if !b.isLenExactMultiple() {
|
||||||
|
b.set[len(b.set)-1] &= allBits >> (wordSize - b.length%wordSize)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// Complement computes the (local) complement of a biset (up to length bits)
|
||||||
|
func (b *BitSet) Complement() (result *BitSet) {
|
||||||
|
panicIfNull(b)
|
||||||
|
result = New(b.length)
|
||||||
|
for i, word := range b.set {
|
||||||
|
result.set[i] = ^word
|
||||||
|
}
|
||||||
|
result.cleanLastWord()
|
||||||
|
return
|
||||||
|
}
|
||||||
|
|
||||||
|
// All returns true if all bits are set, false otherwise. Returns true for
|
||||||
|
// empty sets.
|
||||||
|
func (b *BitSet) All() bool {
|
||||||
|
panicIfNull(b)
|
||||||
|
return b.Count() == b.length
|
||||||
|
}
|
||||||
|
|
||||||
|
// None returns true if no bit is set, false otherwise. Returns true for
|
||||||
|
// empty sets.
|
||||||
|
func (b *BitSet) None() bool {
|
||||||
|
panicIfNull(b)
|
||||||
|
if b != nil && b.set != nil {
|
||||||
|
for _, word := range b.set {
|
||||||
|
if word > 0 {
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return true
|
||||||
|
}
|
||||||
|
return true
|
||||||
|
}
|
||||||
|
|
||||||
|
// Any returns true if any bit is set, false otherwise
|
||||||
|
func (b *BitSet) Any() bool {
|
||||||
|
panicIfNull(b)
|
||||||
|
return !b.None()
|
||||||
|
}
|
||||||
|
|
||||||
|
// IsSuperSet returns true if this is a superset of the other set
|
||||||
|
func (b *BitSet) IsSuperSet(other *BitSet) bool {
|
||||||
|
for i, e := other.NextSet(0); e; i, e = other.NextSet(i + 1) {
|
||||||
|
if !b.Test(i) {
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return true
|
||||||
|
}
|
||||||
|
|
||||||
|
// IsStrictSuperSet returns true if this is a strict superset of the other set
|
||||||
|
func (b *BitSet) IsStrictSuperSet(other *BitSet) bool {
|
||||||
|
return b.Count() > other.Count() && b.IsSuperSet(other)
|
||||||
|
}
|
||||||
|
|
||||||
|
// DumpAsBits dumps a bit set as a string of bits
|
||||||
|
func (b *BitSet) DumpAsBits() string {
|
||||||
|
if b.set == nil {
|
||||||
|
return "."
|
||||||
|
}
|
||||||
|
buffer := bytes.NewBufferString("")
|
||||||
|
i := len(b.set) - 1
|
||||||
|
for ; i >= 0; i-- {
|
||||||
|
fmt.Fprintf(buffer, "%064b.", b.set[i])
|
||||||
|
}
|
||||||
|
return buffer.String()
|
||||||
|
}
|
||||||
|
|
||||||
|
// BinaryStorageSize returns the binary storage requirements
|
||||||
|
func (b *BitSet) BinaryStorageSize() int {
|
||||||
|
return binary.Size(uint64(0)) + binary.Size(b.set)
|
||||||
|
}
|
||||||
|
|
||||||
|
// WriteTo writes a BitSet to a stream
|
||||||
|
func (b *BitSet) WriteTo(stream io.Writer) (int64, error) {
|
||||||
|
length := uint64(b.length)
|
||||||
|
|
||||||
|
// Write length
|
||||||
|
err := binary.Write(stream, binaryOrder, length)
|
||||||
|
if err != nil {
|
||||||
|
return 0, err
|
||||||
|
}
|
||||||
|
|
||||||
|
// Write set
|
||||||
|
err = binary.Write(stream, binaryOrder, b.set)
|
||||||
|
return int64(b.BinaryStorageSize()), err
|
||||||
|
}
|
||||||
|
|
||||||
|
// ReadFrom reads a BitSet from a stream written using WriteTo
|
||||||
|
func (b *BitSet) ReadFrom(stream io.Reader) (int64, error) {
|
||||||
|
var length uint64
|
||||||
|
|
||||||
|
// Read length first
|
||||||
|
err := binary.Read(stream, binaryOrder, &length)
|
||||||
|
if err != nil {
|
||||||
|
return 0, err
|
||||||
|
}
|
||||||
|
newset := New(uint(length))
|
||||||
|
|
||||||
|
if uint64(newset.length) != length {
|
||||||
|
return 0, errors.New("unmarshalling error: type mismatch")
|
||||||
|
}
|
||||||
|
|
||||||
|
// Read remaining bytes as set
|
||||||
|
err = binary.Read(stream, binaryOrder, newset.set)
|
||||||
|
if err != nil {
|
||||||
|
return 0, err
|
||||||
|
}
|
||||||
|
|
||||||
|
*b = *newset
|
||||||
|
return int64(b.BinaryStorageSize()), nil
|
||||||
|
}
|
||||||
|
|
||||||
|
// MarshalBinary encodes a BitSet into a binary form and returns the result.
|
||||||
|
func (b *BitSet) MarshalBinary() ([]byte, error) {
|
||||||
|
var buf bytes.Buffer
|
||||||
|
writer := bufio.NewWriter(&buf)
|
||||||
|
|
||||||
|
_, err := b.WriteTo(writer)
|
||||||
|
if err != nil {
|
||||||
|
return []byte{}, err
|
||||||
|
}
|
||||||
|
|
||||||
|
err = writer.Flush()
|
||||||
|
|
||||||
|
return buf.Bytes(), err
|
||||||
|
}
|
||||||
|
|
||||||
|
// UnmarshalBinary decodes the binary form generated by MarshalBinary.
|
||||||
|
func (b *BitSet) UnmarshalBinary(data []byte) error {
|
||||||
|
buf := bytes.NewReader(data)
|
||||||
|
reader := bufio.NewReader(buf)
|
||||||
|
|
||||||
|
_, err := b.ReadFrom(reader)
|
||||||
|
|
||||||
|
return err
|
||||||
|
}
|
||||||
|
|
||||||
|
// MarshalJSON marshals a BitSet as a JSON structure
|
||||||
|
func (b *BitSet) MarshalJSON() ([]byte, error) {
|
||||||
|
buffer := bytes.NewBuffer(make([]byte, 0, b.BinaryStorageSize()))
|
||||||
|
_, err := b.WriteTo(buffer)
|
||||||
|
if err != nil {
|
||||||
|
return nil, err
|
||||||
|
}
|
||||||
|
|
||||||
|
// URLEncode all bytes
|
||||||
|
return json.Marshal(base64Encoding.EncodeToString(buffer.Bytes()))
|
||||||
|
}
|
||||||
|
|
||||||
|
// UnmarshalJSON unmarshals a BitSet from JSON created using MarshalJSON
|
||||||
|
func (b *BitSet) UnmarshalJSON(data []byte) error {
|
||||||
|
// Unmarshal as string
|
||||||
|
var s string
|
||||||
|
err := json.Unmarshal(data, &s)
|
||||||
|
if err != nil {
|
||||||
|
return err
|
||||||
|
}
|
||||||
|
|
||||||
|
// URLDecode string
|
||||||
|
buf, err := base64Encoding.DecodeString(s)
|
||||||
|
if err != nil {
|
||||||
|
return err
|
||||||
|
}
|
||||||
|
|
||||||
|
_, err = b.ReadFrom(bytes.NewReader(buf))
|
||||||
|
return err
|
||||||
|
}
|
||||||
3
vendor/github.com/bits-and-blooms/bitset/go.mod
generated
vendored
Normal file
3
vendor/github.com/bits-and-blooms/bitset/go.mod
generated
vendored
Normal file
@ -0,0 +1,3 @@
|
|||||||
|
module github.com/bits-and-blooms/bitset
|
||||||
|
|
||||||
|
go 1.14
|
||||||
0
vendor/github.com/bits-and-blooms/bitset/go.sum
generated
vendored
Normal file
0
vendor/github.com/bits-and-blooms/bitset/go.sum
generated
vendored
Normal file
53
vendor/github.com/bits-and-blooms/bitset/popcnt.go
generated
vendored
Normal file
53
vendor/github.com/bits-and-blooms/bitset/popcnt.go
generated
vendored
Normal file
@ -0,0 +1,53 @@
|
|||||||
|
package bitset
|
||||||
|
|
||||||
|
// bit population count, take from
|
||||||
|
// https://code.google.com/p/go/issues/detail?id=4988#c11
|
||||||
|
// credit: https://code.google.com/u/arnehormann/
|
||||||
|
func popcount(x uint64) (n uint64) {
|
||||||
|
x -= (x >> 1) & 0x5555555555555555
|
||||||
|
x = (x>>2)&0x3333333333333333 + x&0x3333333333333333
|
||||||
|
x += x >> 4
|
||||||
|
x &= 0x0f0f0f0f0f0f0f0f
|
||||||
|
x *= 0x0101010101010101
|
||||||
|
return x >> 56
|
||||||
|
}
|
||||||
|
|
||||||
|
func popcntSliceGo(s []uint64) uint64 {
|
||||||
|
cnt := uint64(0)
|
||||||
|
for _, x := range s {
|
||||||
|
cnt += popcount(x)
|
||||||
|
}
|
||||||
|
return cnt
|
||||||
|
}
|
||||||
|
|
||||||
|
func popcntMaskSliceGo(s, m []uint64) uint64 {
|
||||||
|
cnt := uint64(0)
|
||||||
|
for i := range s {
|
||||||
|
cnt += popcount(s[i] &^ m[i])
|
||||||
|
}
|
||||||
|
return cnt
|
||||||
|
}
|
||||||
|
|
||||||
|
func popcntAndSliceGo(s, m []uint64) uint64 {
|
||||||
|
cnt := uint64(0)
|
||||||
|
for i := range s {
|
||||||
|
cnt += popcount(s[i] & m[i])
|
||||||
|
}
|
||||||
|
return cnt
|
||||||
|
}
|
||||||
|
|
||||||
|
func popcntOrSliceGo(s, m []uint64) uint64 {
|
||||||
|
cnt := uint64(0)
|
||||||
|
for i := range s {
|
||||||
|
cnt += popcount(s[i] | m[i])
|
||||||
|
}
|
||||||
|
return cnt
|
||||||
|
}
|
||||||
|
|
||||||
|
func popcntXorSliceGo(s, m []uint64) uint64 {
|
||||||
|
cnt := uint64(0)
|
||||||
|
for i := range s {
|
||||||
|
cnt += popcount(s[i] ^ m[i])
|
||||||
|
}
|
||||||
|
return cnt
|
||||||
|
}
|
||||||
45
vendor/github.com/bits-and-blooms/bitset/popcnt_19.go
generated
vendored
Normal file
45
vendor/github.com/bits-and-blooms/bitset/popcnt_19.go
generated
vendored
Normal file
@ -0,0 +1,45 @@
|
|||||||
|
// +build go1.9
|
||||||
|
|
||||||
|
package bitset
|
||||||
|
|
||||||
|
import "math/bits"
|
||||||
|
|
||||||
|
func popcntSlice(s []uint64) uint64 {
|
||||||
|
var cnt int
|
||||||
|
for _, x := range s {
|
||||||
|
cnt += bits.OnesCount64(x)
|
||||||
|
}
|
||||||
|
return uint64(cnt)
|
||||||
|
}
|
||||||
|
|
||||||
|
func popcntMaskSlice(s, m []uint64) uint64 {
|
||||||
|
var cnt int
|
||||||
|
for i := range s {
|
||||||
|
cnt += bits.OnesCount64(s[i] &^ m[i])
|
||||||
|
}
|
||||||
|
return uint64(cnt)
|
||||||
|
}
|
||||||
|
|
||||||
|
func popcntAndSlice(s, m []uint64) uint64 {
|
||||||
|
var cnt int
|
||||||
|
for i := range s {
|
||||||
|
cnt += bits.OnesCount64(s[i] & m[i])
|
||||||
|
}
|
||||||
|
return uint64(cnt)
|
||||||
|
}
|
||||||
|
|
||||||
|
func popcntOrSlice(s, m []uint64) uint64 {
|
||||||
|
var cnt int
|
||||||
|
for i := range s {
|
||||||
|
cnt += bits.OnesCount64(s[i] | m[i])
|
||||||
|
}
|
||||||
|
return uint64(cnt)
|
||||||
|
}
|
||||||
|
|
||||||
|
func popcntXorSlice(s, m []uint64) uint64 {
|
||||||
|
var cnt int
|
||||||
|
for i := range s {
|
||||||
|
cnt += bits.OnesCount64(s[i] ^ m[i])
|
||||||
|
}
|
||||||
|
return uint64(cnt)
|
||||||
|
}
|
||||||
68
vendor/github.com/bits-and-blooms/bitset/popcnt_amd64.go
generated
vendored
Normal file
68
vendor/github.com/bits-and-blooms/bitset/popcnt_amd64.go
generated
vendored
Normal file
@ -0,0 +1,68 @@
|
|||||||
|
// +build !go1.9
|
||||||
|
// +build amd64,!appengine
|
||||||
|
|
||||||
|
package bitset
|
||||||
|
|
||||||
|
// *** the following functions are defined in popcnt_amd64.s
|
||||||
|
|
||||||
|
//go:noescape
|
||||||
|
|
||||||
|
func hasAsm() bool
|
||||||
|
|
||||||
|
// useAsm is a flag used to select the GO or ASM implementation of the popcnt function
|
||||||
|
var useAsm = hasAsm()
|
||||||
|
|
||||||
|
//go:noescape
|
||||||
|
|
||||||
|
func popcntSliceAsm(s []uint64) uint64
|
||||||
|
|
||||||
|
//go:noescape
|
||||||
|
|
||||||
|
func popcntMaskSliceAsm(s, m []uint64) uint64
|
||||||
|
|
||||||
|
//go:noescape
|
||||||
|
|
||||||
|
func popcntAndSliceAsm(s, m []uint64) uint64
|
||||||
|
|
||||||
|
//go:noescape
|
||||||
|
|
||||||
|
func popcntOrSliceAsm(s, m []uint64) uint64
|
||||||
|
|
||||||
|
//go:noescape
|
||||||
|
|
||||||
|
func popcntXorSliceAsm(s, m []uint64) uint64
|
||||||
|
|
||||||
|
func popcntSlice(s []uint64) uint64 {
|
||||||
|
if useAsm {
|
||||||
|
return popcntSliceAsm(s)
|
||||||
|
}
|
||||||
|
return popcntSliceGo(s)
|
||||||
|
}
|
||||||
|
|
||||||
|
func popcntMaskSlice(s, m []uint64) uint64 {
|
||||||
|
if useAsm {
|
||||||
|
return popcntMaskSliceAsm(s, m)
|
||||||
|
}
|
||||||
|
return popcntMaskSliceGo(s, m)
|
||||||
|
}
|
||||||
|
|
||||||
|
func popcntAndSlice(s, m []uint64) uint64 {
|
||||||
|
if useAsm {
|
||||||
|
return popcntAndSliceAsm(s, m)
|
||||||
|
}
|
||||||
|
return popcntAndSliceGo(s, m)
|
||||||
|
}
|
||||||
|
|
||||||
|
func popcntOrSlice(s, m []uint64) uint64 {
|
||||||
|
if useAsm {
|
||||||
|
return popcntOrSliceAsm(s, m)
|
||||||
|
}
|
||||||
|
return popcntOrSliceGo(s, m)
|
||||||
|
}
|
||||||
|
|
||||||
|
func popcntXorSlice(s, m []uint64) uint64 {
|
||||||
|
if useAsm {
|
||||||
|
return popcntXorSliceAsm(s, m)
|
||||||
|
}
|
||||||
|
return popcntXorSliceGo(s, m)
|
||||||
|
}
|
||||||
104
vendor/github.com/bits-and-blooms/bitset/popcnt_amd64.s
generated
vendored
Normal file
104
vendor/github.com/bits-and-blooms/bitset/popcnt_amd64.s
generated
vendored
Normal file
@ -0,0 +1,104 @@
|
|||||||
|
// +build !go1.9
|
||||||
|
// +build amd64,!appengine
|
||||||
|
|
||||||
|
TEXT ·hasAsm(SB),4,$0-1
|
||||||
|
MOVQ $1, AX
|
||||||
|
CPUID
|
||||||
|
SHRQ $23, CX
|
||||||
|
ANDQ $1, CX
|
||||||
|
MOVB CX, ret+0(FP)
|
||||||
|
RET
|
||||||
|
|
||||||
|
#define POPCNTQ_DX_DX BYTE $0xf3; BYTE $0x48; BYTE $0x0f; BYTE $0xb8; BYTE $0xd2
|
||||||
|
|
||||||
|
TEXT ·popcntSliceAsm(SB),4,$0-32
|
||||||
|
XORQ AX, AX
|
||||||
|
MOVQ s+0(FP), SI
|
||||||
|
MOVQ s_len+8(FP), CX
|
||||||
|
TESTQ CX, CX
|
||||||
|
JZ popcntSliceEnd
|
||||||
|
popcntSliceLoop:
|
||||||
|
BYTE $0xf3; BYTE $0x48; BYTE $0x0f; BYTE $0xb8; BYTE $0x16 // POPCNTQ (SI), DX
|
||||||
|
ADDQ DX, AX
|
||||||
|
ADDQ $8, SI
|
||||||
|
LOOP popcntSliceLoop
|
||||||
|
popcntSliceEnd:
|
||||||
|
MOVQ AX, ret+24(FP)
|
||||||
|
RET
|
||||||
|
|
||||||
|
TEXT ·popcntMaskSliceAsm(SB),4,$0-56
|
||||||
|
XORQ AX, AX
|
||||||
|
MOVQ s+0(FP), SI
|
||||||
|
MOVQ s_len+8(FP), CX
|
||||||
|
TESTQ CX, CX
|
||||||
|
JZ popcntMaskSliceEnd
|
||||||
|
MOVQ m+24(FP), DI
|
||||||
|
popcntMaskSliceLoop:
|
||||||
|
MOVQ (DI), DX
|
||||||
|
NOTQ DX
|
||||||
|
ANDQ (SI), DX
|
||||||
|
POPCNTQ_DX_DX
|
||||||
|
ADDQ DX, AX
|
||||||
|
ADDQ $8, SI
|
||||||
|
ADDQ $8, DI
|
||||||
|
LOOP popcntMaskSliceLoop
|
||||||
|
popcntMaskSliceEnd:
|
||||||
|
MOVQ AX, ret+48(FP)
|
||||||
|
RET
|
||||||
|
|
||||||
|
TEXT ·popcntAndSliceAsm(SB),4,$0-56
|
||||||
|
XORQ AX, AX
|
||||||
|
MOVQ s+0(FP), SI
|
||||||
|
MOVQ s_len+8(FP), CX
|
||||||
|
TESTQ CX, CX
|
||||||
|
JZ popcntAndSliceEnd
|
||||||
|
MOVQ m+24(FP), DI
|
||||||
|
popcntAndSliceLoop:
|
||||||
|
MOVQ (DI), DX
|
||||||
|
ANDQ (SI), DX
|
||||||
|
POPCNTQ_DX_DX
|
||||||
|
ADDQ DX, AX
|
||||||
|
ADDQ $8, SI
|
||||||
|
ADDQ $8, DI
|
||||||
|
LOOP popcntAndSliceLoop
|
||||||
|
popcntAndSliceEnd:
|
||||||
|
MOVQ AX, ret+48(FP)
|
||||||
|
RET
|
||||||
|
|
||||||
|
TEXT ·popcntOrSliceAsm(SB),4,$0-56
|
||||||
|
XORQ AX, AX
|
||||||
|
MOVQ s+0(FP), SI
|
||||||
|
MOVQ s_len+8(FP), CX
|
||||||
|
TESTQ CX, CX
|
||||||
|
JZ popcntOrSliceEnd
|
||||||
|
MOVQ m+24(FP), DI
|
||||||
|
popcntOrSliceLoop:
|
||||||
|
MOVQ (DI), DX
|
||||||
|
ORQ (SI), DX
|
||||||
|
POPCNTQ_DX_DX
|
||||||
|
ADDQ DX, AX
|
||||||
|
ADDQ $8, SI
|
||||||
|
ADDQ $8, DI
|
||||||
|
LOOP popcntOrSliceLoop
|
||||||
|
popcntOrSliceEnd:
|
||||||
|
MOVQ AX, ret+48(FP)
|
||||||
|
RET
|
||||||
|
|
||||||
|
TEXT ·popcntXorSliceAsm(SB),4,$0-56
|
||||||
|
XORQ AX, AX
|
||||||
|
MOVQ s+0(FP), SI
|
||||||
|
MOVQ s_len+8(FP), CX
|
||||||
|
TESTQ CX, CX
|
||||||
|
JZ popcntXorSliceEnd
|
||||||
|
MOVQ m+24(FP), DI
|
||||||
|
popcntXorSliceLoop:
|
||||||
|
MOVQ (DI), DX
|
||||||
|
XORQ (SI), DX
|
||||||
|
POPCNTQ_DX_DX
|
||||||
|
ADDQ DX, AX
|
||||||
|
ADDQ $8, SI
|
||||||
|
ADDQ $8, DI
|
||||||
|
LOOP popcntXorSliceLoop
|
||||||
|
popcntXorSliceEnd:
|
||||||
|
MOVQ AX, ret+48(FP)
|
||||||
|
RET
|
||||||
24
vendor/github.com/bits-and-blooms/bitset/popcnt_generic.go
generated
vendored
Normal file
24
vendor/github.com/bits-and-blooms/bitset/popcnt_generic.go
generated
vendored
Normal file
@ -0,0 +1,24 @@
|
|||||||
|
// +build !go1.9
|
||||||
|
// +build !amd64 appengine
|
||||||
|
|
||||||
|
package bitset
|
||||||
|
|
||||||
|
func popcntSlice(s []uint64) uint64 {
|
||||||
|
return popcntSliceGo(s)
|
||||||
|
}
|
||||||
|
|
||||||
|
func popcntMaskSlice(s, m []uint64) uint64 {
|
||||||
|
return popcntMaskSliceGo(s, m)
|
||||||
|
}
|
||||||
|
|
||||||
|
func popcntAndSlice(s, m []uint64) uint64 {
|
||||||
|
return popcntAndSliceGo(s, m)
|
||||||
|
}
|
||||||
|
|
||||||
|
func popcntOrSlice(s, m []uint64) uint64 {
|
||||||
|
return popcntOrSliceGo(s, m)
|
||||||
|
}
|
||||||
|
|
||||||
|
func popcntXorSlice(s, m []uint64) uint64 {
|
||||||
|
return popcntXorSliceGo(s, m)
|
||||||
|
}
|
||||||
14
vendor/github.com/bits-and-blooms/bitset/trailing_zeros_18.go
generated
vendored
Normal file
14
vendor/github.com/bits-and-blooms/bitset/trailing_zeros_18.go
generated
vendored
Normal file
@ -0,0 +1,14 @@
|
|||||||
|
// +build !go1.9
|
||||||
|
|
||||||
|
package bitset
|
||||||
|
|
||||||
|
var deBruijn = [...]byte{
|
||||||
|
0, 1, 56, 2, 57, 49, 28, 3, 61, 58, 42, 50, 38, 29, 17, 4,
|
||||||
|
62, 47, 59, 36, 45, 43, 51, 22, 53, 39, 33, 30, 24, 18, 12, 5,
|
||||||
|
63, 55, 48, 27, 60, 41, 37, 16, 46, 35, 44, 21, 52, 32, 23, 11,
|
||||||
|
54, 26, 40, 15, 34, 20, 31, 10, 25, 14, 19, 9, 13, 8, 7, 6,
|
||||||
|
}
|
||||||
|
|
||||||
|
func trailingZeroes64(v uint64) uint {
|
||||||
|
return uint(deBruijn[((v&-v)*0x03f79d71b4ca8b09)>>58])
|
||||||
|
}
|
||||||
9
vendor/github.com/bits-and-blooms/bitset/trailing_zeros_19.go
generated
vendored
Normal file
9
vendor/github.com/bits-and-blooms/bitset/trailing_zeros_19.go
generated
vendored
Normal file
@ -0,0 +1,9 @@
|
|||||||
|
// +build go1.9
|
||||||
|
|
||||||
|
package bitset
|
||||||
|
|
||||||
|
import "math/bits"
|
||||||
|
|
||||||
|
func trailingZeroes64(v uint64) uint {
|
||||||
|
return uint(bits.TrailingZeros64(v))
|
||||||
|
}
|
||||||
201
vendor/github.com/opencontainers/selinux/LICENSE
generated
vendored
Normal file
201
vendor/github.com/opencontainers/selinux/LICENSE
generated
vendored
Normal file
@ -0,0 +1,201 @@
|
|||||||
|
Apache License
|
||||||
|
Version 2.0, January 2004
|
||||||
|
http://www.apache.org/licenses/
|
||||||
|
|
||||||
|
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
|
||||||
|
|
||||||
|
1. Definitions.
|
||||||
|
|
||||||
|
"License" shall mean the terms and conditions for use, reproduction,
|
||||||
|
and distribution as defined by Sections 1 through 9 of this document.
|
||||||
|
|
||||||
|
"Licensor" shall mean the copyright owner or entity authorized by
|
||||||
|
the copyright owner that is granting the License.
|
||||||
|
|
||||||
|
"Legal Entity" shall mean the union of the acting entity and all
|
||||||
|
other entities that control, are controlled by, or are under common
|
||||||
|
control with that entity. For the purposes of this definition,
|
||||||
|
"control" means (i) the power, direct or indirect, to cause the
|
||||||
|
direction or management of such entity, whether by contract or
|
||||||
|
otherwise, or (ii) ownership of fifty percent (50%) or more of the
|
||||||
|
outstanding shares, or (iii) beneficial ownership of such entity.
|
||||||
|
|
||||||
|
"You" (or "Your") shall mean an individual or Legal Entity
|
||||||
|
exercising permissions granted by this License.
|
||||||
|
|
||||||
|
"Source" form shall mean the preferred form for making modifications,
|
||||||
|
including but not limited to software source code, documentation
|
||||||
|
source, and configuration files.
|
||||||
|
|
||||||
|
"Object" form shall mean any form resulting from mechanical
|
||||||
|
transformation or translation of a Source form, including but
|
||||||
|
not limited to compiled object code, generated documentation,
|
||||||
|
and conversions to other media types.
|
||||||
|
|
||||||
|
"Work" shall mean the work of authorship, whether in Source or
|
||||||
|
Object form, made available under the License, as indicated by a
|
||||||
|
copyright notice that is included in or attached to the work
|
||||||
|
(an example is provided in the Appendix below).
|
||||||
|
|
||||||
|
"Derivative Works" shall mean any work, whether in Source or Object
|
||||||
|
form, that is based on (or derived from) the Work and for which the
|
||||||
|
editorial revisions, annotations, elaborations, or other modifications
|
||||||
|
represent, as a whole, an original work of authorship. For the purposes
|
||||||
|
of this License, Derivative Works shall not include works that remain
|
||||||
|
separable from, or merely link (or bind by name) to the interfaces of,
|
||||||
|
the Work and Derivative Works thereof.
|
||||||
|
|
||||||
|
"Contribution" shall mean any work of authorship, including
|
||||||
|
the original version of the Work and any modifications or additions
|
||||||
|
to that Work or Derivative Works thereof, that is intentionally
|
||||||
|
submitted to Licensor for inclusion in the Work by the copyright owner
|
||||||
|
or by an individual or Legal Entity authorized to submit on behalf of
|
||||||
|
the copyright owner. For the purposes of this definition, "submitted"
|
||||||
|
means any form of electronic, verbal, or written communication sent
|
||||||
|
to the Licensor or its representatives, including but not limited to
|
||||||
|
communication on electronic mailing lists, source code control systems,
|
||||||
|
and issue tracking systems that are managed by, or on behalf of, the
|
||||||
|
Licensor for the purpose of discussing and improving the Work, but
|
||||||
|
excluding communication that is conspicuously marked or otherwise
|
||||||
|
designated in writing by the copyright owner as "Not a Contribution."
|
||||||
|
|
||||||
|
"Contributor" shall mean Licensor and any individual or Legal Entity
|
||||||
|
on behalf of whom a Contribution has been received by Licensor and
|
||||||
|
subsequently incorporated within the Work.
|
||||||
|
|
||||||
|
2. Grant of Copyright License. Subject to the terms and conditions of
|
||||||
|
this License, each Contributor hereby grants to You a perpetual,
|
||||||
|
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
||||||
|
copyright license to reproduce, prepare Derivative Works of,
|
||||||
|
publicly display, publicly perform, sublicense, and distribute the
|
||||||
|
Work and such Derivative Works in Source or Object form.
|
||||||
|
|
||||||
|
3. Grant of Patent License. Subject to the terms and conditions of
|
||||||
|
this License, each Contributor hereby grants to You a perpetual,
|
||||||
|
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
||||||
|
(except as stated in this section) patent license to make, have made,
|
||||||
|
use, offer to sell, sell, import, and otherwise transfer the Work,
|
||||||
|
where such license applies only to those patent claims licensable
|
||||||
|
by such Contributor that are necessarily infringed by their
|
||||||
|
Contribution(s) alone or by combination of their Contribution(s)
|
||||||
|
with the Work to which such Contribution(s) was submitted. If You
|
||||||
|
institute patent litigation against any entity (including a
|
||||||
|
cross-claim or counterclaim in a lawsuit) alleging that the Work
|
||||||
|
or a Contribution incorporated within the Work constitutes direct
|
||||||
|
or contributory patent infringement, then any patent licenses
|
||||||
|
granted to You under this License for that Work shall terminate
|
||||||
|
as of the date such litigation is filed.
|
||||||
|
|
||||||
|
4. Redistribution. You may reproduce and distribute copies of the
|
||||||
|
Work or Derivative Works thereof in any medium, with or without
|
||||||
|
modifications, and in Source or Object form, provided that You
|
||||||
|
meet the following conditions:
|
||||||
|
|
||||||
|
(a) You must give any other recipients of the Work or
|
||||||
|
Derivative Works a copy of this License; and
|
||||||
|
|
||||||
|
(b) You must cause any modified files to carry prominent notices
|
||||||
|
stating that You changed the files; and
|
||||||
|
|
||||||
|
(c) You must retain, in the Source form of any Derivative Works
|
||||||
|
that You distribute, all copyright, patent, trademark, and
|
||||||
|
attribution notices from the Source form of the Work,
|
||||||
|
excluding those notices that do not pertain to any part of
|
||||||
|
the Derivative Works; and
|
||||||
|
|
||||||
|
(d) If the Work includes a "NOTICE" text file as part of its
|
||||||
|
distribution, then any Derivative Works that You distribute must
|
||||||
|
include a readable copy of the attribution notices contained
|
||||||
|
within such NOTICE file, excluding those notices that do not
|
||||||
|
pertain to any part of the Derivative Works, in at least one
|
||||||
|
of the following places: within a NOTICE text file distributed
|
||||||
|
as part of the Derivative Works; within the Source form or
|
||||||
|
documentation, if provided along with the Derivative Works; or,
|
||||||
|
within a display generated by the Derivative Works, if and
|
||||||
|
wherever such third-party notices normally appear. The contents
|
||||||
|
of the NOTICE file are for informational purposes only and
|
||||||
|
do not modify the License. You may add Your own attribution
|
||||||
|
notices within Derivative Works that You distribute, alongside
|
||||||
|
or as an addendum to the NOTICE text from the Work, provided
|
||||||
|
that such additional attribution notices cannot be construed
|
||||||
|
as modifying the License.
|
||||||
|
|
||||||
|
You may add Your own copyright statement to Your modifications and
|
||||||
|
may provide additional or different license terms and conditions
|
||||||
|
for use, reproduction, or distribution of Your modifications, or
|
||||||
|
for any such Derivative Works as a whole, provided Your use,
|
||||||
|
reproduction, and distribution of the Work otherwise complies with
|
||||||
|
the conditions stated in this License.
|
||||||
|
|
||||||
|
5. Submission of Contributions. Unless You explicitly state otherwise,
|
||||||
|
any Contribution intentionally submitted for inclusion in the Work
|
||||||
|
by You to the Licensor shall be under the terms and conditions of
|
||||||
|
this License, without any additional terms or conditions.
|
||||||
|
Notwithstanding the above, nothing herein shall supersede or modify
|
||||||
|
the terms of any separate license agreement you may have executed
|
||||||
|
with Licensor regarding such Contributions.
|
||||||
|
|
||||||
|
6. Trademarks. This License does not grant permission to use the trade
|
||||||
|
names, trademarks, service marks, or product names of the Licensor,
|
||||||
|
except as required for reasonable and customary use in describing the
|
||||||
|
origin of the Work and reproducing the content of the NOTICE file.
|
||||||
|
|
||||||
|
7. Disclaimer of Warranty. Unless required by applicable law or
|
||||||
|
agreed to in writing, Licensor provides the Work (and each
|
||||||
|
Contributor provides its Contributions) on an "AS IS" BASIS,
|
||||||
|
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
|
||||||
|
implied, including, without limitation, any warranties or conditions
|
||||||
|
of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
|
||||||
|
PARTICULAR PURPOSE. You are solely responsible for determining the
|
||||||
|
appropriateness of using or redistributing the Work and assume any
|
||||||
|
risks associated with Your exercise of permissions under this License.
|
||||||
|
|
||||||
|
8. Limitation of Liability. In no event and under no legal theory,
|
||||||
|
whether in tort (including negligence), contract, or otherwise,
|
||||||
|
unless required by applicable law (such as deliberate and grossly
|
||||||
|
negligent acts) or agreed to in writing, shall any Contributor be
|
||||||
|
liable to You for damages, including any direct, indirect, special,
|
||||||
|
incidental, or consequential damages of any character arising as a
|
||||||
|
result of this License or out of the use or inability to use the
|
||||||
|
Work (including but not limited to damages for loss of goodwill,
|
||||||
|
work stoppage, computer failure or malfunction, or any and all
|
||||||
|
other commercial damages or losses), even if such Contributor
|
||||||
|
has been advised of the possibility of such damages.
|
||||||
|
|
||||||
|
9. Accepting Warranty or Additional Liability. While redistributing
|
||||||
|
the Work or Derivative Works thereof, You may choose to offer,
|
||||||
|
and charge a fee for, acceptance of support, warranty, indemnity,
|
||||||
|
or other liability obligations and/or rights consistent with this
|
||||||
|
License. However, in accepting such obligations, You may act only
|
||||||
|
on Your own behalf and on Your sole responsibility, not on behalf
|
||||||
|
of any other Contributor, and only if You agree to indemnify,
|
||||||
|
defend, and hold each Contributor harmless for any liability
|
||||||
|
incurred by, or claims asserted against, such Contributor by reason
|
||||||
|
of your accepting any such warranty or additional liability.
|
||||||
|
|
||||||
|
END OF TERMS AND CONDITIONS
|
||||||
|
|
||||||
|
APPENDIX: How to apply the Apache License to your work.
|
||||||
|
|
||||||
|
To apply the Apache License to your work, attach the following
|
||||||
|
boilerplate notice, with the fields enclosed by brackets "{}"
|
||||||
|
replaced with your own identifying information. (Don't include
|
||||||
|
the brackets!) The text should be enclosed in the appropriate
|
||||||
|
comment syntax for the file format. We also recommend that a
|
||||||
|
file or class name and description of purpose be included on the
|
||||||
|
same "printed page" as the copyright notice for easier
|
||||||
|
identification within third-party archives.
|
||||||
|
|
||||||
|
Copyright {yyyy} {name of copyright owner}
|
||||||
|
|
||||||
|
Licensed under the Apache License, Version 2.0 (the "License");
|
||||||
|
you may not use this file except in compliance with the License.
|
||||||
|
You may obtain a copy of the License at
|
||||||
|
|
||||||
|
http://www.apache.org/licenses/LICENSE-2.0
|
||||||
|
|
||||||
|
Unless required by applicable law or agreed to in writing, software
|
||||||
|
distributed under the License is distributed on an "AS IS" BASIS,
|
||||||
|
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||||
|
See the License for the specific language governing permissions and
|
||||||
|
limitations under the License.
|
||||||
14
vendor/github.com/opencontainers/selinux/go-selinux/doc.go
generated
vendored
Normal file
14
vendor/github.com/opencontainers/selinux/go-selinux/doc.go
generated
vendored
Normal file
@ -0,0 +1,14 @@
|
|||||||
|
/*
|
||||||
|
Package selinux provides a high-level interface for interacting with selinux.
|
||||||
|
|
||||||
|
Usage:
|
||||||
|
|
||||||
|
import "github.com/opencontainers/selinux/go-selinux"
|
||||||
|
|
||||||
|
// Ensure that selinux is enforcing mode.
|
||||||
|
if selinux.EnforceMode() != selinux.Enforcing {
|
||||||
|
selinux.SetEnforceMode(selinux.Enforcing)
|
||||||
|
}
|
||||||
|
|
||||||
|
*/
|
||||||
|
package selinux
|
||||||
284
vendor/github.com/opencontainers/selinux/go-selinux/selinux.go
generated
vendored
Normal file
284
vendor/github.com/opencontainers/selinux/go-selinux/selinux.go
generated
vendored
Normal file
@ -0,0 +1,284 @@
|
|||||||
|
package selinux
|
||||||
|
|
||||||
|
import (
|
||||||
|
"github.com/pkg/errors"
|
||||||
|
)
|
||||||
|
|
||||||
|
const (
|
||||||
|
// Enforcing constant indicate SELinux is in enforcing mode
|
||||||
|
Enforcing = 1
|
||||||
|
// Permissive constant to indicate SELinux is in permissive mode
|
||||||
|
Permissive = 0
|
||||||
|
// Disabled constant to indicate SELinux is disabled
|
||||||
|
Disabled = -1
|
||||||
|
// maxCategory is the maximum number of categories used within containers
|
||||||
|
maxCategory = 1024
|
||||||
|
// DefaultCategoryRange is the upper bound on the category range
|
||||||
|
DefaultCategoryRange = uint32(maxCategory)
|
||||||
|
)
|
||||||
|
|
||||||
|
var (
|
||||||
|
// ErrMCSAlreadyExists is returned when trying to allocate a duplicate MCS.
|
||||||
|
ErrMCSAlreadyExists = errors.New("MCS label already exists")
|
||||||
|
// ErrEmptyPath is returned when an empty path has been specified.
|
||||||
|
ErrEmptyPath = errors.New("empty path")
|
||||||
|
|
||||||
|
// InvalidLabel is returned when an invalid label is specified.
|
||||||
|
InvalidLabel = errors.New("Invalid Label")
|
||||||
|
|
||||||
|
// ErrIncomparable is returned two levels are not comparable
|
||||||
|
ErrIncomparable = errors.New("incomparable levels")
|
||||||
|
// ErrLevelSyntax is returned when a sensitivity or category do not have correct syntax in a level
|
||||||
|
ErrLevelSyntax = errors.New("invalid level syntax")
|
||||||
|
|
||||||
|
// ErrContextMissing is returned if a requested context is not found in a file.
|
||||||
|
ErrContextMissing = errors.New("context does not have a match")
|
||||||
|
// ErrVerifierNil is returned when a context verifier function is nil.
|
||||||
|
ErrVerifierNil = errors.New("verifier function is nil")
|
||||||
|
|
||||||
|
// CategoryRange allows the upper bound on the category range to be adjusted
|
||||||
|
CategoryRange = DefaultCategoryRange
|
||||||
|
)
|
||||||
|
|
||||||
|
// Context is a representation of the SELinux label broken into 4 parts
|
||||||
|
type Context map[string]string
|
||||||
|
|
||||||
|
// SetDisabled disables SELinux support for the package
|
||||||
|
func SetDisabled() {
|
||||||
|
setDisabled()
|
||||||
|
}
|
||||||
|
|
||||||
|
// GetEnabled returns whether SELinux is currently enabled.
|
||||||
|
func GetEnabled() bool {
|
||||||
|
return getEnabled()
|
||||||
|
}
|
||||||
|
|
||||||
|
// ClassIndex returns the int index for an object class in the loaded policy,
|
||||||
|
// or -1 and an error
|
||||||
|
func ClassIndex(class string) (int, error) {
|
||||||
|
return classIndex(class)
|
||||||
|
}
|
||||||
|
|
||||||
|
// SetFileLabel sets the SELinux label for this path or returns an error.
|
||||||
|
func SetFileLabel(fpath string, label string) error {
|
||||||
|
return setFileLabel(fpath, label)
|
||||||
|
}
|
||||||
|
|
||||||
|
// FileLabel returns the SELinux label for this path or returns an error.
|
||||||
|
func FileLabel(fpath string) (string, error) {
|
||||||
|
return fileLabel(fpath)
|
||||||
|
}
|
||||||
|
|
||||||
|
// SetFSCreateLabel tells the kernel what label to use for all file system objects
|
||||||
|
// created by this task.
|
||||||
|
// Set the label to an empty string to return to the default label. Calls to SetFSCreateLabel
|
||||||
|
// should be wrapped in runtime.LockOSThread()/runtime.UnlockOSThread() until file system
|
||||||
|
// objects created by this task are finished to guarantee another goroutine does not migrate
|
||||||
|
// to the current thread before execution is complete.
|
||||||
|
func SetFSCreateLabel(label string) error {
|
||||||
|
return setFSCreateLabel(label)
|
||||||
|
}
|
||||||
|
|
||||||
|
// FSCreateLabel returns the default label the kernel which the kernel is using
|
||||||
|
// for file system objects created by this task. "" indicates default.
|
||||||
|
func FSCreateLabel() (string, error) {
|
||||||
|
return fsCreateLabel()
|
||||||
|
}
|
||||||
|
|
||||||
|
// CurrentLabel returns the SELinux label of the current process thread, or an error.
|
||||||
|
func CurrentLabel() (string, error) {
|
||||||
|
return currentLabel()
|
||||||
|
}
|
||||||
|
|
||||||
|
// PidLabel returns the SELinux label of the given pid, or an error.
|
||||||
|
func PidLabel(pid int) (string, error) {
|
||||||
|
return pidLabel(pid)
|
||||||
|
}
|
||||||
|
|
||||||
|
// ExecLabel returns the SELinux label that the kernel will use for any programs
|
||||||
|
// that are executed by the current process thread, or an error.
|
||||||
|
func ExecLabel() (string, error) {
|
||||||
|
return execLabel()
|
||||||
|
}
|
||||||
|
|
||||||
|
// CanonicalizeContext takes a context string and writes it to the kernel
|
||||||
|
// the function then returns the context that the kernel will use. Use this
|
||||||
|
// function to check if two contexts are equivalent
|
||||||
|
func CanonicalizeContext(val string) (string, error) {
|
||||||
|
return canonicalizeContext(val)
|
||||||
|
}
|
||||||
|
|
||||||
|
// ComputeCreateContext requests the type transition from source to target for
|
||||||
|
// class from the kernel.
|
||||||
|
func ComputeCreateContext(source string, target string, class string) (string, error) {
|
||||||
|
return computeCreateContext(source, target, class)
|
||||||
|
}
|
||||||
|
|
||||||
|
// CalculateGlbLub computes the glb (greatest lower bound) and lub (least upper bound)
|
||||||
|
// of a source and target range.
|
||||||
|
// The glblub is calculated as the greater of the low sensitivities and
|
||||||
|
// the lower of the high sensitivities and the and of each category bitset.
|
||||||
|
func CalculateGlbLub(sourceRange, targetRange string) (string, error) {
|
||||||
|
return calculateGlbLub(sourceRange, targetRange)
|
||||||
|
}
|
||||||
|
|
||||||
|
// SetExecLabel sets the SELinux label that the kernel will use for any programs
|
||||||
|
// that are executed by the current process thread, or an error. Calls to SetExecLabel
|
||||||
|
// should be wrapped in runtime.LockOSThread()/runtime.UnlockOSThread() until execution
|
||||||
|
// of the program is finished to guarantee another goroutine does not migrate to the current
|
||||||
|
// thread before execution is complete.
|
||||||
|
func SetExecLabel(label string) error {
|
||||||
|
return setExecLabel(label)
|
||||||
|
}
|
||||||
|
|
||||||
|
// SetTaskLabel sets the SELinux label for the current thread, or an error.
|
||||||
|
// This requires the dyntransition permission. Calls to SetTaskLabel should
|
||||||
|
// be wrapped in runtime.LockOSThread()/runtime.UnlockOSThread() to guarantee
|
||||||
|
// the current thread does not run in a new mislabeled thread.
|
||||||
|
func SetTaskLabel(label string) error {
|
||||||
|
return setTaskLabel(label)
|
||||||
|
}
|
||||||
|
|
||||||
|
// SetSocketLabel takes a process label and tells the kernel to assign the
|
||||||
|
// label to the next socket that gets created. Calls to SetSocketLabel
|
||||||
|
// should be wrapped in runtime.LockOSThread()/runtime.UnlockOSThread() until
|
||||||
|
// the the socket is created to guarantee another goroutine does not migrate
|
||||||
|
// to the current thread before execution is complete.
|
||||||
|
func SetSocketLabel(label string) error {
|
||||||
|
return setSocketLabel(label)
|
||||||
|
}
|
||||||
|
|
||||||
|
// SocketLabel retrieves the current socket label setting
|
||||||
|
func SocketLabel() (string, error) {
|
||||||
|
return socketLabel()
|
||||||
|
}
|
||||||
|
|
||||||
|
// PeerLabel retrieves the label of the client on the other side of a socket
|
||||||
|
func PeerLabel(fd uintptr) (string, error) {
|
||||||
|
return peerLabel(fd)
|
||||||
|
}
|
||||||
|
|
||||||
|
// SetKeyLabel takes a process label and tells the kernel to assign the
|
||||||
|
// label to the next kernel keyring that gets created. Calls to SetKeyLabel
|
||||||
|
// should be wrapped in runtime.LockOSThread()/runtime.UnlockOSThread() until
|
||||||
|
// the kernel keyring is created to guarantee another goroutine does not migrate
|
||||||
|
// to the current thread before execution is complete.
|
||||||
|
func SetKeyLabel(label string) error {
|
||||||
|
return setKeyLabel(label)
|
||||||
|
}
|
||||||
|
|
||||||
|
// KeyLabel retrieves the current kernel keyring label setting
|
||||||
|
func KeyLabel() (string, error) {
|
||||||
|
return keyLabel()
|
||||||
|
}
|
||||||
|
|
||||||
|
// Get returns the Context as a string
|
||||||
|
func (c Context) Get() string {
|
||||||
|
return c.get()
|
||||||
|
}
|
||||||
|
|
||||||
|
// NewContext creates a new Context struct from the specified label
|
||||||
|
func NewContext(label string) (Context, error) {
|
||||||
|
return newContext(label)
|
||||||
|
}
|
||||||
|
|
||||||
|
// ClearLabels clears all reserved labels
|
||||||
|
func ClearLabels() {
|
||||||
|
clearLabels()
|
||||||
|
}
|
||||||
|
|
||||||
|
// ReserveLabel reserves the MLS/MCS level component of the specified label
|
||||||
|
func ReserveLabel(label string) {
|
||||||
|
reserveLabel(label)
|
||||||
|
}
|
||||||
|
|
||||||
|
// EnforceMode returns the current SELinux mode Enforcing, Permissive, Disabled
|
||||||
|
func EnforceMode() int {
|
||||||
|
return enforceMode()
|
||||||
|
}
|
||||||
|
|
||||||
|
// SetEnforceMode sets the current SELinux mode Enforcing, Permissive.
|
||||||
|
// Disabled is not valid, since this needs to be set at boot time.
|
||||||
|
func SetEnforceMode(mode int) error {
|
||||||
|
return setEnforceMode(mode)
|
||||||
|
}
|
||||||
|
|
||||||
|
// DefaultEnforceMode returns the systems default SELinux mode Enforcing,
|
||||||
|
// Permissive or Disabled. Note this is is just the default at boot time.
|
||||||
|
// EnforceMode tells you the systems current mode.
|
||||||
|
func DefaultEnforceMode() int {
|
||||||
|
return defaultEnforceMode()
|
||||||
|
}
|
||||||
|
|
||||||
|
// ReleaseLabel un-reserves the MLS/MCS Level field of the specified label,
|
||||||
|
// allowing it to be used by another process.
|
||||||
|
func ReleaseLabel(label string) {
|
||||||
|
releaseLabel(label)
|
||||||
|
}
|
||||||
|
|
||||||
|
// ROFileLabel returns the specified SELinux readonly file label
|
||||||
|
func ROFileLabel() string {
|
||||||
|
return roFileLabel()
|
||||||
|
}
|
||||||
|
|
||||||
|
// KVMContainerLabels returns the default processLabel and mountLabel to be used
|
||||||
|
// for kvm containers by the calling process.
|
||||||
|
func KVMContainerLabels() (string, string) {
|
||||||
|
return kvmContainerLabels()
|
||||||
|
}
|
||||||
|
|
||||||
|
// InitContainerLabels returns the default processLabel and file labels to be
|
||||||
|
// used for containers running an init system like systemd by the calling process.
|
||||||
|
func InitContainerLabels() (string, string) {
|
||||||
|
return initContainerLabels()
|
||||||
|
}
|
||||||
|
|
||||||
|
// ContainerLabels returns an allocated processLabel and fileLabel to be used for
|
||||||
|
// container labeling by the calling process.
|
||||||
|
func ContainerLabels() (processLabel string, fileLabel string) {
|
||||||
|
return containerLabels()
|
||||||
|
}
|
||||||
|
|
||||||
|
// SecurityCheckContext validates that the SELinux label is understood by the kernel
|
||||||
|
func SecurityCheckContext(val string) error {
|
||||||
|
return securityCheckContext(val)
|
||||||
|
}
|
||||||
|
|
||||||
|
// CopyLevel returns a label with the MLS/MCS level from src label replaced on
|
||||||
|
// the dest label.
|
||||||
|
func CopyLevel(src, dest string) (string, error) {
|
||||||
|
return copyLevel(src, dest)
|
||||||
|
}
|
||||||
|
|
||||||
|
// Chcon changes the fpath file object to the SELinux label label.
|
||||||
|
// If fpath is a directory and recurse is true, then Chcon walks the
|
||||||
|
// directory tree setting the label.
|
||||||
|
func Chcon(fpath string, label string, recurse bool) error {
|
||||||
|
return chcon(fpath, label, recurse)
|
||||||
|
}
|
||||||
|
|
||||||
|
// DupSecOpt takes an SELinux process label and returns security options that
|
||||||
|
// can be used to set the SELinux Type and Level for future container processes.
|
||||||
|
func DupSecOpt(src string) ([]string, error) {
|
||||||
|
return dupSecOpt(src)
|
||||||
|
}
|
||||||
|
|
||||||
|
// DisableSecOpt returns a security opt that can be used to disable SELinux
|
||||||
|
// labeling support for future container processes.
|
||||||
|
func DisableSecOpt() []string {
|
||||||
|
return disableSecOpt()
|
||||||
|
}
|
||||||
|
|
||||||
|
// GetDefaultContextWithLevel gets a single context for the specified SELinux user
|
||||||
|
// identity that is reachable from the specified scon context. The context is based
|
||||||
|
// on the per-user /etc/selinux/{SELINUXTYPE}/contexts/users/<username> if it exists,
|
||||||
|
// and falls back to the global /etc/selinux/{SELINUXTYPE}/contexts/default_contexts
|
||||||
|
// file.
|
||||||
|
func GetDefaultContextWithLevel(user, level, scon string) (string, error) {
|
||||||
|
return getDefaultContextWithLevel(user, level, scon)
|
||||||
|
}
|
||||||
|
|
||||||
|
// PrivContainerMountLabel returns mount label for privileged containers
|
||||||
|
func PrivContainerMountLabel() string {
|
||||||
|
return privContainerMountLabel
|
||||||
|
}
|
||||||
1212
vendor/github.com/opencontainers/selinux/go-selinux/selinux_linux.go
generated
vendored
Normal file
1212
vendor/github.com/opencontainers/selinux/go-selinux/selinux_linux.go
generated
vendored
Normal file
File diff suppressed because it is too large
Load Diff
154
vendor/github.com/opencontainers/selinux/go-selinux/selinux_stub.go
generated
vendored
Normal file
154
vendor/github.com/opencontainers/selinux/go-selinux/selinux_stub.go
generated
vendored
Normal file
@ -0,0 +1,154 @@
|
|||||||
|
// +build !linux
|
||||||
|
|
||||||
|
package selinux
|
||||||
|
|
||||||
|
const privContainerMountLabel = ""
|
||||||
|
|
||||||
|
func setDisabled() {
|
||||||
|
}
|
||||||
|
|
||||||
|
func getEnabled() bool {
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
|
||||||
|
func classIndex(class string) (int, error) {
|
||||||
|
return -1, nil
|
||||||
|
}
|
||||||
|
|
||||||
|
func setFileLabel(fpath string, label string) error {
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
|
||||||
|
func fileLabel(fpath string) (string, error) {
|
||||||
|
return "", nil
|
||||||
|
}
|
||||||
|
|
||||||
|
func setFSCreateLabel(label string) error {
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
|
||||||
|
func fsCreateLabel() (string, error) {
|
||||||
|
return "", nil
|
||||||
|
}
|
||||||
|
|
||||||
|
func currentLabel() (string, error) {
|
||||||
|
return "", nil
|
||||||
|
}
|
||||||
|
|
||||||
|
func pidLabel(pid int) (string, error) {
|
||||||
|
return "", nil
|
||||||
|
}
|
||||||
|
|
||||||
|
func execLabel() (string, error) {
|
||||||
|
return "", nil
|
||||||
|
}
|
||||||
|
|
||||||
|
func canonicalizeContext(val string) (string, error) {
|
||||||
|
return "", nil
|
||||||
|
}
|
||||||
|
|
||||||
|
func computeCreateContext(source string, target string, class string) (string, error) {
|
||||||
|
return "", nil
|
||||||
|
}
|
||||||
|
|
||||||
|
func calculateGlbLub(sourceRange, targetRange string) (string, error) {
|
||||||
|
return "", nil
|
||||||
|
}
|
||||||
|
|
||||||
|
func setExecLabel(label string) error {
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
|
||||||
|
func setTaskLabel(label string) error {
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
|
||||||
|
func setSocketLabel(label string) error {
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
|
||||||
|
func socketLabel() (string, error) {
|
||||||
|
return "", nil
|
||||||
|
}
|
||||||
|
|
||||||
|
func peerLabel(fd uintptr) (string, error) {
|
||||||
|
return "", nil
|
||||||
|
}
|
||||||
|
|
||||||
|
func setKeyLabel(label string) error {
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
|
||||||
|
func keyLabel() (string, error) {
|
||||||
|
return "", nil
|
||||||
|
}
|
||||||
|
|
||||||
|
func (c Context) get() string {
|
||||||
|
return ""
|
||||||
|
}
|
||||||
|
|
||||||
|
func newContext(label string) (Context, error) {
|
||||||
|
c := make(Context)
|
||||||
|
return c, nil
|
||||||
|
}
|
||||||
|
|
||||||
|
func clearLabels() {
|
||||||
|
}
|
||||||
|
|
||||||
|
func reserveLabel(label string) {
|
||||||
|
}
|
||||||
|
|
||||||
|
func enforceMode() int {
|
||||||
|
return Disabled
|
||||||
|
}
|
||||||
|
|
||||||
|
func setEnforceMode(mode int) error {
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
|
||||||
|
func defaultEnforceMode() int {
|
||||||
|
return Disabled
|
||||||
|
}
|
||||||
|
|
||||||
|
func releaseLabel(label string) {
|
||||||
|
}
|
||||||
|
|
||||||
|
func roFileLabel() string {
|
||||||
|
return ""
|
||||||
|
}
|
||||||
|
|
||||||
|
func kvmContainerLabels() (string, string) {
|
||||||
|
return "", ""
|
||||||
|
}
|
||||||
|
|
||||||
|
func initContainerLabels() (string, string) {
|
||||||
|
return "", ""
|
||||||
|
}
|
||||||
|
|
||||||
|
func containerLabels() (processLabel string, fileLabel string) {
|
||||||
|
return "", ""
|
||||||
|
}
|
||||||
|
|
||||||
|
func securityCheckContext(val string) error {
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
|
||||||
|
func copyLevel(src, dest string) (string, error) {
|
||||||
|
return "", nil
|
||||||
|
}
|
||||||
|
|
||||||
|
func chcon(fpath string, label string, recurse bool) error {
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
|
||||||
|
func dupSecOpt(src string) ([]string, error) {
|
||||||
|
return nil, nil
|
||||||
|
}
|
||||||
|
|
||||||
|
func disableSecOpt() []string {
|
||||||
|
return []string{"disable"}
|
||||||
|
}
|
||||||
|
|
||||||
|
func getDefaultContextWithLevel(user, level, scon string) (string, error) {
|
||||||
|
return "", nil
|
||||||
|
}
|
||||||
38
vendor/github.com/opencontainers/selinux/go-selinux/xattrs_linux.go
generated
vendored
Normal file
38
vendor/github.com/opencontainers/selinux/go-selinux/xattrs_linux.go
generated
vendored
Normal file
@ -0,0 +1,38 @@
|
|||||||
|
package selinux
|
||||||
|
|
||||||
|
import (
|
||||||
|
"golang.org/x/sys/unix"
|
||||||
|
)
|
||||||
|
|
||||||
|
// lgetxattr returns a []byte slice containing the value of
|
||||||
|
// an extended attribute attr set for path.
|
||||||
|
func lgetxattr(path, attr string) ([]byte, error) {
|
||||||
|
// Start with a 128 length byte array
|
||||||
|
dest := make([]byte, 128)
|
||||||
|
sz, errno := doLgetxattr(path, attr, dest)
|
||||||
|
for errno == unix.ERANGE {
|
||||||
|
// Buffer too small, use zero-sized buffer to get the actual size
|
||||||
|
sz, errno = doLgetxattr(path, attr, []byte{})
|
||||||
|
if errno != nil {
|
||||||
|
return nil, errno
|
||||||
|
}
|
||||||
|
|
||||||
|
dest = make([]byte, sz)
|
||||||
|
sz, errno = doLgetxattr(path, attr, dest)
|
||||||
|
}
|
||||||
|
if errno != nil {
|
||||||
|
return nil, errno
|
||||||
|
}
|
||||||
|
|
||||||
|
return dest[:sz], nil
|
||||||
|
}
|
||||||
|
|
||||||
|
// doLgetxattr is a wrapper that retries on EINTR
|
||||||
|
func doLgetxattr(path, attr string, dest []byte) (int, error) {
|
||||||
|
for {
|
||||||
|
sz, err := unix.Lgetxattr(path, attr, dest)
|
||||||
|
if err != unix.EINTR {
|
||||||
|
return sz, err
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
42
vendor/github.com/opencontainers/selinux/pkg/pwalk/README.md
generated
vendored
Normal file
42
vendor/github.com/opencontainers/selinux/pkg/pwalk/README.md
generated
vendored
Normal file
@ -0,0 +1,42 @@
|
|||||||
|
## pwalk: parallel implementation of filepath.Walk
|
||||||
|
|
||||||
|
This is a wrapper for [filepath.Walk](https://pkg.go.dev/path/filepath?tab=doc#Walk)
|
||||||
|
which may speed it up by calling multiple callback functions (WalkFunc) in parallel,
|
||||||
|
utilizing goroutines.
|
||||||
|
|
||||||
|
By default, it utilizes 2\*runtime.NumCPU() goroutines for callbacks.
|
||||||
|
This can be changed by using WalkN function which has the additional
|
||||||
|
parameter, specifying the number of goroutines (concurrency).
|
||||||
|
|
||||||
|
### Caveats
|
||||||
|
|
||||||
|
Please note the following limitations of this code:
|
||||||
|
|
||||||
|
* Unlike filepath.Walk, the order of calls is non-deterministic;
|
||||||
|
|
||||||
|
* Only primitive error handling is supported:
|
||||||
|
|
||||||
|
* filepath.SkipDir is not supported;
|
||||||
|
|
||||||
|
* no errors are ever passed to WalkFunc;
|
||||||
|
|
||||||
|
* once any error is returned from any WalkFunc instance, no more new calls
|
||||||
|
to WalkFunc are made, and the error is returned to the caller of Walk;
|
||||||
|
|
||||||
|
* if more than one walkFunc instance will return an error, only one
|
||||||
|
of such errors will be propagated and returned by Walk, others
|
||||||
|
will be silently discarded.
|
||||||
|
|
||||||
|
### Documentation
|
||||||
|
|
||||||
|
For the official documentation, see
|
||||||
|
https://pkg.go.dev/github.com/opencontainers/selinux/pkg/pwalk?tab=doc
|
||||||
|
|
||||||
|
### Benchmarks
|
||||||
|
|
||||||
|
For a WalkFunc that consists solely of the return statement, this
|
||||||
|
implementation is about 10% slower than the standard library's
|
||||||
|
filepath.Walk.
|
||||||
|
|
||||||
|
Otherwise (if a WalkFunc is doing something) this is usually faster,
|
||||||
|
except when the WalkN(..., 1) is used.
|
||||||
104
vendor/github.com/opencontainers/selinux/pkg/pwalk/pwalk.go
generated
vendored
Normal file
104
vendor/github.com/opencontainers/selinux/pkg/pwalk/pwalk.go
generated
vendored
Normal file
@ -0,0 +1,104 @@
|
|||||||
|
package pwalk
|
||||||
|
|
||||||
|
import (
|
||||||
|
"os"
|
||||||
|
"path/filepath"
|
||||||
|
"runtime"
|
||||||
|
"sync"
|
||||||
|
|
||||||
|
"github.com/pkg/errors"
|
||||||
|
)
|
||||||
|
|
||||||
|
type WalkFunc = filepath.WalkFunc
|
||||||
|
|
||||||
|
// Walk is a wrapper for filepath.Walk which can call multiple walkFn
|
||||||
|
// in parallel, allowing to handle each item concurrently. A maximum of
|
||||||
|
// twice the runtime.NumCPU() walkFn will be called at any one time.
|
||||||
|
// If you want to change the maximum, use WalkN instead.
|
||||||
|
//
|
||||||
|
// The order of calls is non-deterministic.
|
||||||
|
//
|
||||||
|
// Note that this implementation only supports primitive error handling:
|
||||||
|
//
|
||||||
|
// - no errors are ever passed to WalkFn;
|
||||||
|
//
|
||||||
|
// - once a walkFn returns any error, all further processing stops
|
||||||
|
// and the error is returned to the caller of Walk;
|
||||||
|
//
|
||||||
|
// - filepath.SkipDir is not supported;
|
||||||
|
//
|
||||||
|
// - if more than one walkFn instance will return an error, only one
|
||||||
|
// of such errors will be propagated and returned by Walk, others
|
||||||
|
// will be silently discarded.
|
||||||
|
func Walk(root string, walkFn WalkFunc) error {
|
||||||
|
return WalkN(root, walkFn, runtime.NumCPU()*2)
|
||||||
|
}
|
||||||
|
|
||||||
|
// WalkN is a wrapper for filepath.Walk which can call multiple walkFn
|
||||||
|
// in parallel, allowing to handle each item concurrently. A maximum of
|
||||||
|
// num walkFn will be called at any one time.
|
||||||
|
//
|
||||||
|
// Please see Walk documentation for caveats of using this function.
|
||||||
|
func WalkN(root string, walkFn WalkFunc, num int) error {
|
||||||
|
// make sure limit is sensible
|
||||||
|
if num < 1 {
|
||||||
|
return errors.Errorf("walk(%q): num must be > 0", root)
|
||||||
|
}
|
||||||
|
|
||||||
|
files := make(chan *walkArgs, 2*num)
|
||||||
|
errCh := make(chan error, 1) // get the first error, ignore others
|
||||||
|
|
||||||
|
// Start walking a tree asap
|
||||||
|
var (
|
||||||
|
err error
|
||||||
|
wg sync.WaitGroup
|
||||||
|
)
|
||||||
|
wg.Add(1)
|
||||||
|
go func() {
|
||||||
|
err = filepath.Walk(root, func(p string, info os.FileInfo, err error) error {
|
||||||
|
if err != nil {
|
||||||
|
close(files)
|
||||||
|
return err
|
||||||
|
}
|
||||||
|
// add a file to the queue unless a callback sent an error
|
||||||
|
select {
|
||||||
|
case e := <-errCh:
|
||||||
|
close(files)
|
||||||
|
return e
|
||||||
|
default:
|
||||||
|
files <- &walkArgs{path: p, info: &info}
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
})
|
||||||
|
if err == nil {
|
||||||
|
close(files)
|
||||||
|
}
|
||||||
|
wg.Done()
|
||||||
|
}()
|
||||||
|
|
||||||
|
wg.Add(num)
|
||||||
|
for i := 0; i < num; i++ {
|
||||||
|
go func() {
|
||||||
|
for file := range files {
|
||||||
|
if e := walkFn(file.path, *file.info, nil); e != nil {
|
||||||
|
select {
|
||||||
|
case errCh <- e: // sent ok
|
||||||
|
default: // buffer full
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
wg.Done()
|
||||||
|
}()
|
||||||
|
}
|
||||||
|
|
||||||
|
wg.Wait()
|
||||||
|
|
||||||
|
return err
|
||||||
|
}
|
||||||
|
|
||||||
|
// walkArgs holds the arguments that were passed to the Walk or WalkLimit
|
||||||
|
// functions.
|
||||||
|
type walkArgs struct {
|
||||||
|
path string
|
||||||
|
info *os.FileInfo
|
||||||
|
}
|
||||||
10
vendor/k8s.io/apiserver/pkg/server/egressselector/egress_selector.go
generated
vendored
10
vendor/k8s.io/apiserver/pkg/server/egressselector/egress_selector.go
generated
vendored
@ -362,6 +362,16 @@ func NewEgressSelector(config *apiserver.EgressSelectorConfiguration) (*EgressSe
|
|||||||
return cs, nil
|
return cs, nil
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// NewEgressSelectorWithMap returns a EgressSelector with the supplied EgressType to DialFunc map.
|
||||||
|
func NewEgressSelectorWithMap(m map[EgressType]utilnet.DialFunc) *EgressSelector {
|
||||||
|
if m == nil {
|
||||||
|
m = make(map[EgressType]utilnet.DialFunc)
|
||||||
|
}
|
||||||
|
return &EgressSelector{
|
||||||
|
egressToDialer: m,
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
// Lookup gets the dialer function for the network context.
|
// Lookup gets the dialer function for the network context.
|
||||||
// This is configured for the Kubernetes API Server at startup.
|
// This is configured for the Kubernetes API Server at startup.
|
||||||
func (cs *EgressSelector) Lookup(networkContext NetworkContext) (utilnet.DialFunc, error) {
|
func (cs *EgressSelector) Lookup(networkContext NetworkContext) (utilnet.DialFunc, error) {
|
||||||
|
|||||||
2
vendor/k8s.io/client-go/tools/clientcmd/api/v1/conversion.go
generated
vendored
2
vendor/k8s.io/client-go/tools/clientcmd/api/v1/conversion.go
generated
vendored
@ -165,7 +165,7 @@ func Convert_Map_string_To_runtime_Object_To_Slice_v1_NamedExtension(in *map[str
|
|||||||
newExtension := (*in)[key]
|
newExtension := (*in)[key]
|
||||||
oldExtension := runtime.RawExtension{}
|
oldExtension := runtime.RawExtension{}
|
||||||
if err := runtime.Convert_runtime_Object_To_runtime_RawExtension(&newExtension, &oldExtension, s); err != nil {
|
if err := runtime.Convert_runtime_Object_To_runtime_RawExtension(&newExtension, &oldExtension, s); err != nil {
|
||||||
return nil
|
return err
|
||||||
}
|
}
|
||||||
namedExtension := NamedExtension{key, oldExtension}
|
namedExtension := NamedExtension{key, oldExtension}
|
||||||
*out = append(*out, namedExtension)
|
*out = append(*out, namedExtension)
|
||||||
|
|||||||
26
vendor/k8s.io/cloud-provider/go.mod
generated
vendored
26
vendor/k8s.io/cloud-provider/go.mod
generated
vendored
@ -9,21 +9,23 @@ require (
|
|||||||
github.com/spf13/cobra v1.1.3
|
github.com/spf13/cobra v1.1.3
|
||||||
github.com/spf13/pflag v1.0.5
|
github.com/spf13/pflag v1.0.5
|
||||||
github.com/stretchr/testify v1.7.0
|
github.com/stretchr/testify v1.7.0
|
||||||
k8s.io/api v0.22.2
|
k8s.io/api v0.22.4
|
||||||
k8s.io/apimachinery v0.22.2
|
k8s.io/apimachinery v0.22.4
|
||||||
k8s.io/apiserver v0.22.2
|
k8s.io/apiserver v0.22.4
|
||||||
k8s.io/client-go v0.22.2
|
k8s.io/client-go v0.22.4
|
||||||
k8s.io/component-base v0.22.2
|
k8s.io/component-base v0.22.4
|
||||||
k8s.io/controller-manager v0.22.2
|
k8s.io/controller-manager v0.22.4
|
||||||
k8s.io/klog/v2 v2.9.0
|
k8s.io/klog/v2 v2.9.0
|
||||||
k8s.io/utils v0.0.0-20210819203725-bdf08cb9a70a
|
k8s.io/utils v0.0.0-20210819203725-bdf08cb9a70a
|
||||||
)
|
)
|
||||||
|
|
||||||
replace (
|
replace (
|
||||||
k8s.io/api => k8s.io/api v0.22.2
|
k8s.io/api => k8s.io/api v0.22.4
|
||||||
k8s.io/apimachinery => k8s.io/apimachinery v0.22.2
|
k8s.io/apimachinery => k8s.io/apimachinery v0.22.4
|
||||||
k8s.io/apiserver => k8s.io/apiserver v0.22.2
|
k8s.io/apiserver => k8s.io/apiserver v0.22.4
|
||||||
k8s.io/client-go => k8s.io/client-go v0.22.2
|
k8s.io/client-go => k8s.io/client-go v0.22.4
|
||||||
k8s.io/component-base => k8s.io/component-base v0.22.2
|
k8s.io/component-base => k8s.io/component-base v0.22.4
|
||||||
k8s.io/controller-manager => k8s.io/controller-manager v0.22.2
|
k8s.io/controller-manager => k8s.io/controller-manager v0.22.4
|
||||||
)
|
)
|
||||||
|
|
||||||
|
replace k8s.io/component-helpers => k8s.io/component-helpers v0.22.4
|
||||||
|
|||||||
28
vendor/k8s.io/cloud-provider/go.sum
generated
vendored
28
vendor/k8s.io/cloud-provider/go.sum
generated
vendored
@ -776,24 +776,24 @@ honnef.co/go/tools v0.0.0-20190418001031-e561f6794a2a/go.mod h1:rf3lG4BRIbNafJWh
|
|||||||
honnef.co/go/tools v0.0.0-20190523083050-ea95bdfd59fc/go.mod h1:rf3lG4BRIbNafJWhAfAdb/ePZxsR/4RtNHQocxwk9r4=
|
honnef.co/go/tools v0.0.0-20190523083050-ea95bdfd59fc/go.mod h1:rf3lG4BRIbNafJWhAfAdb/ePZxsR/4RtNHQocxwk9r4=
|
||||||
honnef.co/go/tools v0.0.1-2019.2.3/go.mod h1:a3bituU0lyd329TUQxRnasdCoJDkEUEAqEt0JzvZhAg=
|
honnef.co/go/tools v0.0.1-2019.2.3/go.mod h1:a3bituU0lyd329TUQxRnasdCoJDkEUEAqEt0JzvZhAg=
|
||||||
honnef.co/go/tools v0.0.1-2020.1.3/go.mod h1:X/FiERA/W4tHapMX5mGpAtMSVEeEUOyHaw9vFzvIQ3k=
|
honnef.co/go/tools v0.0.1-2020.1.3/go.mod h1:X/FiERA/W4tHapMX5mGpAtMSVEeEUOyHaw9vFzvIQ3k=
|
||||||
k8s.io/api v0.22.2 h1:M8ZzAD0V6725Fjg53fKeTJxGsJvRbk4TEm/fexHMtfw=
|
k8s.io/api v0.22.4 h1:UvyHW0ezB2oIgHAxlYoo6UJQObYXU7awuNarwoHEOjw=
|
||||||
k8s.io/api v0.22.2/go.mod h1:y3ydYpLJAaDI+BbSe2xmGcqxiWHmWjkEeIbiwHvnPR8=
|
k8s.io/api v0.22.4/go.mod h1:Rgs+9gIGYC5laXQSZZ9JqT5NevNgoGiOdVWi1BAB3qk=
|
||||||
k8s.io/apimachinery v0.22.2 h1:ejz6y/zNma8clPVfNDLnPbleBo6MpoFy/HBiBqCouVk=
|
k8s.io/apimachinery v0.22.4 h1:9uwcvPpukBw/Ri0EUmWz+49cnFtaoiyEhQTK+xOe7Ck=
|
||||||
k8s.io/apimachinery v0.22.2/go.mod h1:O3oNtNadZdeOMxHFVxOreoznohCpy0z6mocxbZr7oJ0=
|
k8s.io/apimachinery v0.22.4/go.mod h1:yU6oA6Gnax9RrxGzVvPFFJ+mpnW6PBSqp0sx0I0HHW0=
|
||||||
k8s.io/apiserver v0.22.2 h1:TdIfZJc6YNhu2WxeAOWq1TvukHF0Sfx0+ln4XK9qnL4=
|
k8s.io/apiserver v0.22.4 h1:L+220cy+94UWmyBl1kiVTklBXrBtKsbjlPV60eL2u6s=
|
||||||
k8s.io/apiserver v0.22.2/go.mod h1:vrpMmbyjWrgdyOvZTSpsusQq5iigKNWv9o9KlDAbBHI=
|
k8s.io/apiserver v0.22.4/go.mod h1:38WmcUZiiy41A7Aty8/VorWRa8vDGqoUzDf2XYlku0E=
|
||||||
k8s.io/client-go v0.22.2 h1:DaSQgs02aCC1QcwUdkKZWOeaVsQjYvWv8ZazcZ6JcHc=
|
k8s.io/client-go v0.22.4 h1:aAQ1Wk+I3bjCNk35YWUqbaueqrIonkfDPJSPDDe8Kfg=
|
||||||
k8s.io/client-go v0.22.2/go.mod h1:sAlhrkVDf50ZHx6z4K0S40wISNTarf1r800F+RlCF6U=
|
k8s.io/client-go v0.22.4/go.mod h1:Yzw4e5e7h1LNHA4uqnMVrpEpUs1hJOiuBsJKIlRCHDA=
|
||||||
k8s.io/component-base v0.22.2 h1:vNIvE0AIrLhjX8drH0BgCNJcR4QZxMXcJzBsDplDx9M=
|
k8s.io/component-base v0.22.4 h1:7qwLJnua2ppGNZrRGDQ0vhsFebI39VGbZ4zdR5ArViI=
|
||||||
k8s.io/component-base v0.22.2/go.mod h1:5Br2QhI9OTe79p+TzPe9JKNQYvEKbq9rTJDWllunGug=
|
k8s.io/component-base v0.22.4/go.mod h1:MrSaQy4a3tFVViff8TZL6JHYSewNCLshZCwHYM58v5A=
|
||||||
k8s.io/controller-manager v0.22.2 h1:4JbMHSia+Ys80FAMW35mlkbNG+IBGemPOk0wWDkiWYo=
|
k8s.io/controller-manager v0.22.4 h1:4Iyn0IaDa3M7CJlkFp/ASdXtxeDDi9N63o0xNf+/sy4=
|
||||||
k8s.io/controller-manager v0.22.2/go.mod h1:zeDUbCc66IcMZ81U8qC5Z5pm9A8QkqD7839H8t7//yY=
|
k8s.io/controller-manager v0.22.4/go.mod h1:DcJNoo4OvXCh9KfESIrX9C9dNQj1OfQrAZrEkFbNMRw=
|
||||||
k8s.io/gengo v0.0.0-20200413195148-3a45101e95ac/go.mod h1:ezvh/TsK7cY6rbqRK0oQQ8IAqLxYwwyPxAX1Pzy0ii0=
|
k8s.io/gengo v0.0.0-20200413195148-3a45101e95ac/go.mod h1:ezvh/TsK7cY6rbqRK0oQQ8IAqLxYwwyPxAX1Pzy0ii0=
|
||||||
k8s.io/klog/v2 v2.0.0/go.mod h1:PBfzABfn139FHAV07az/IF9Wp1bkk3vpT2XSJ76fSDE=
|
k8s.io/klog/v2 v2.0.0/go.mod h1:PBfzABfn139FHAV07az/IF9Wp1bkk3vpT2XSJ76fSDE=
|
||||||
k8s.io/klog/v2 v2.9.0 h1:D7HV+n1V57XeZ0m6tdRkfknthUaM06VFbWldOFh8kzM=
|
k8s.io/klog/v2 v2.9.0 h1:D7HV+n1V57XeZ0m6tdRkfknthUaM06VFbWldOFh8kzM=
|
||||||
k8s.io/klog/v2 v2.9.0/go.mod h1:hy9LJ/NvuK+iVyP4Ehqva4HxZG/oXyIS3n3Jmire4Ec=
|
k8s.io/klog/v2 v2.9.0/go.mod h1:hy9LJ/NvuK+iVyP4Ehqva4HxZG/oXyIS3n3Jmire4Ec=
|
||||||
k8s.io/kube-openapi v0.0.0-20210421082810-95288971da7e h1:KLHHjkdQFomZy8+06csTWZ0m1343QqxZhR2LJ1OxCYM=
|
k8s.io/kube-openapi v0.0.0-20211109043538-20434351676c h1:jvamsI1tn9V0S8jicyX82qaFC0H/NKxv2e5mbqsgR80=
|
||||||
k8s.io/kube-openapi v0.0.0-20210421082810-95288971da7e/go.mod h1:vHXdDvt9+2spS2Rx9ql3I8tycm3H9FDfdUoIuKCefvw=
|
k8s.io/kube-openapi v0.0.0-20211109043538-20434351676c/go.mod h1:vHXdDvt9+2spS2Rx9ql3I8tycm3H9FDfdUoIuKCefvw=
|
||||||
k8s.io/utils v0.0.0-20210819203725-bdf08cb9a70a h1:8dYfu/Fc9Gz2rNJKB9IQRGgQOh2clmRzNIPPY1xLY5g=
|
k8s.io/utils v0.0.0-20210819203725-bdf08cb9a70a h1:8dYfu/Fc9Gz2rNJKB9IQRGgQOh2clmRzNIPPY1xLY5g=
|
||||||
k8s.io/utils v0.0.0-20210819203725-bdf08cb9a70a/go.mod h1:jPW/WVKK9YHAvNhRxK0md/EJ228hCsBRufyofKtW8HA=
|
k8s.io/utils v0.0.0-20210819203725-bdf08cb9a70a/go.mod h1:jPW/WVKK9YHAvNhRxK0md/EJ228hCsBRufyofKtW8HA=
|
||||||
rsc.io/binaryregexp v0.2.0/go.mod h1:qTv7/COck+e2FymRvadv62gMdZztPaShugOCi3I+8D8=
|
rsc.io/binaryregexp v0.2.0/go.mod h1:qTv7/COck+e2FymRvadv62gMdZztPaShugOCi3I+8D8=
|
||||||
|
|||||||
4
vendor/k8s.io/component-base/metrics/options.go
generated
vendored
4
vendor/k8s.io/component-base/metrics/options.go
generated
vendored
@ -58,8 +58,8 @@ func (o *Options) Validate() []error {
|
|||||||
|
|
||||||
// AddFlags adds flags for exposing component metrics.
|
// AddFlags adds flags for exposing component metrics.
|
||||||
func (o *Options) AddFlags(fs *pflag.FlagSet) {
|
func (o *Options) AddFlags(fs *pflag.FlagSet) {
|
||||||
if o != nil {
|
if o == nil {
|
||||||
o = NewOptions()
|
return
|
||||||
}
|
}
|
||||||
fs.StringVar(&o.ShowHiddenMetricsForVersion, "show-hidden-metrics-for-version", o.ShowHiddenMetricsForVersion,
|
fs.StringVar(&o.ShowHiddenMetricsForVersion, "show-hidden-metrics-for-version", o.ShowHiddenMetricsForVersion,
|
||||||
"The previous version for which you want to show hidden metrics. "+
|
"The previous version for which you want to show hidden metrics. "+
|
||||||
|
|||||||
19
vendor/k8s.io/kubernetes/pkg/util/selinux/doc.go
generated
vendored
Normal file
19
vendor/k8s.io/kubernetes/pkg/util/selinux/doc.go
generated
vendored
Normal file
@ -0,0 +1,19 @@
|
|||||||
|
/*
|
||||||
|
Copyright 2015 The Kubernetes Authors.
|
||||||
|
|
||||||
|
Licensed under the Apache License, Version 2.0 (the "License");
|
||||||
|
you may not use this file except in compliance with the License.
|
||||||
|
You may obtain a copy of the License at
|
||||||
|
|
||||||
|
http://www.apache.org/licenses/LICENSE-2.0
|
||||||
|
|
||||||
|
Unless required by applicable law or agreed to in writing, software
|
||||||
|
distributed under the License is distributed on an "AS IS" BASIS,
|
||||||
|
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||||
|
See the License for the specific language governing permissions and
|
||||||
|
limitations under the License.
|
||||||
|
*/
|
||||||
|
|
||||||
|
// Package selinux contains wrapper functions for the libcontainer SELinux
|
||||||
|
// package. A NOP implementation is provided for non-linux platforms.
|
||||||
|
package selinux // import "k8s.io/kubernetes/pkg/util/selinux"
|
||||||
39
vendor/k8s.io/kubernetes/pkg/util/selinux/selinux.go
generated
vendored
Normal file
39
vendor/k8s.io/kubernetes/pkg/util/selinux/selinux.go
generated
vendored
Normal file
@ -0,0 +1,39 @@
|
|||||||
|
/*
|
||||||
|
Copyright 2014 The Kubernetes Authors.
|
||||||
|
|
||||||
|
Licensed under the Apache License, Version 2.0 (the "License");
|
||||||
|
you may not use this file except in compliance with the License.
|
||||||
|
You may obtain a copy of the License at
|
||||||
|
|
||||||
|
http://www.apache.org/licenses/LICENSE-2.0
|
||||||
|
|
||||||
|
Unless required by applicable law or agreed to in writing, software
|
||||||
|
distributed under the License is distributed on an "AS IS" BASIS,
|
||||||
|
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||||
|
See the License for the specific language governing permissions and
|
||||||
|
limitations under the License.
|
||||||
|
*/
|
||||||
|
|
||||||
|
package selinux
|
||||||
|
|
||||||
|
// Note: the libcontainer SELinux package is only built for Linux, so it is
|
||||||
|
// necessary to have a NOP wrapper which is built for non-Linux platforms to
|
||||||
|
// allow code that links to this package not to differentiate its own methods
|
||||||
|
// for Linux and non-Linux platforms.
|
||||||
|
//
|
||||||
|
// SELinuxRunner wraps certain libcontainer SELinux calls. For more
|
||||||
|
// information, see:
|
||||||
|
//
|
||||||
|
// https://github.com/opencontainers/runc/blob/master/libcontainer/selinux/selinux.go
|
||||||
|
type SELinuxRunner interface {
|
||||||
|
// Getfilecon returns the SELinux context for the given path or returns an
|
||||||
|
// error.
|
||||||
|
Getfilecon(path string) (string, error)
|
||||||
|
}
|
||||||
|
|
||||||
|
// NewSELinuxRunner returns a new SELinuxRunner appropriate for the platform.
|
||||||
|
// On Linux, all methods short-circuit and return NOP values if SELinux is
|
||||||
|
// disabled. On non-Linux platforms, a NOP implementation is returned.
|
||||||
|
func NewSELinuxRunner() SELinuxRunner {
|
||||||
|
return &realSELinuxRunner{}
|
||||||
|
}
|
||||||
57
vendor/k8s.io/kubernetes/pkg/util/selinux/selinux_linux.go
generated
vendored
Normal file
57
vendor/k8s.io/kubernetes/pkg/util/selinux/selinux_linux.go
generated
vendored
Normal file
@ -0,0 +1,57 @@
|
|||||||
|
// +build linux
|
||||||
|
|
||||||
|
/*
|
||||||
|
Copyright 2014 The Kubernetes Authors.
|
||||||
|
|
||||||
|
Licensed under the Apache License, Version 2.0 (the "License");
|
||||||
|
you may not use this file except in compliance with the License.
|
||||||
|
You may obtain a copy of the License at
|
||||||
|
|
||||||
|
http://www.apache.org/licenses/LICENSE-2.0
|
||||||
|
|
||||||
|
Unless required by applicable law or agreed to in writing, software
|
||||||
|
distributed under the License is distributed on an "AS IS" BASIS,
|
||||||
|
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||||
|
See the License for the specific language governing permissions and
|
||||||
|
limitations under the License.
|
||||||
|
*/
|
||||||
|
|
||||||
|
package selinux
|
||||||
|
|
||||||
|
import (
|
||||||
|
selinux "github.com/opencontainers/selinux/go-selinux"
|
||||||
|
)
|
||||||
|
|
||||||
|
// SELinuxEnabled returns whether SELinux is enabled on the system. SELinux
|
||||||
|
// has a tri-state:
|
||||||
|
//
|
||||||
|
// 1. disabled: SELinux Kernel modules not loaded, SELinux policy is not
|
||||||
|
// checked during Kernel MAC checks
|
||||||
|
// 2. enforcing: Enabled; SELinux policy violations are denied and logged
|
||||||
|
// in the audit log
|
||||||
|
// 3. permissive: Enabled, but SELinux policy violations are permitted and
|
||||||
|
// logged in the audit log
|
||||||
|
//
|
||||||
|
// SELinuxEnabled returns true if SELinux is enforcing or permissive, and
|
||||||
|
// false if it is disabled.
|
||||||
|
func SELinuxEnabled() bool {
|
||||||
|
return selinux.GetEnabled()
|
||||||
|
}
|
||||||
|
|
||||||
|
// realSELinuxRunner is the real implementation of SELinuxRunner interface for
|
||||||
|
// Linux.
|
||||||
|
type realSELinuxRunner struct{}
|
||||||
|
|
||||||
|
var _ SELinuxRunner = &realSELinuxRunner{}
|
||||||
|
|
||||||
|
func (_ *realSELinuxRunner) Getfilecon(path string) (string, error) {
|
||||||
|
if !SELinuxEnabled() {
|
||||||
|
return "", nil
|
||||||
|
}
|
||||||
|
return selinux.FileLabel(path)
|
||||||
|
}
|
||||||
|
|
||||||
|
// SetFileLabel applies the SELinux label on the path or returns an error.
|
||||||
|
func SetFileLabel(path string, label string) error {
|
||||||
|
return selinux.SetFileLabel(path, label)
|
||||||
|
}
|
||||||
38
vendor/k8s.io/kubernetes/pkg/util/selinux/selinux_unsupported.go
generated
vendored
Normal file
38
vendor/k8s.io/kubernetes/pkg/util/selinux/selinux_unsupported.go
generated
vendored
Normal file
@ -0,0 +1,38 @@
|
|||||||
|
// +build !linux
|
||||||
|
|
||||||
|
/*
|
||||||
|
Copyright 2014 The Kubernetes Authors.
|
||||||
|
|
||||||
|
Licensed under the Apache License, Version 2.0 (the "License");
|
||||||
|
you may not use this file except in compliance with the License.
|
||||||
|
You may obtain a copy of the License at
|
||||||
|
|
||||||
|
http://www.apache.org/licenses/LICENSE-2.0
|
||||||
|
|
||||||
|
Unless required by applicable law or agreed to in writing, software
|
||||||
|
distributed under the License is distributed on an "AS IS" BASIS,
|
||||||
|
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||||
|
See the License for the specific language governing permissions and
|
||||||
|
limitations under the License.
|
||||||
|
*/
|
||||||
|
|
||||||
|
package selinux
|
||||||
|
|
||||||
|
// SELinuxEnabled always returns false on non-linux platforms.
|
||||||
|
func SELinuxEnabled() bool {
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
|
||||||
|
// realSELinuxRunner is the NOP implementation of the SELinuxRunner interface.
|
||||||
|
type realSELinuxRunner struct{}
|
||||||
|
|
||||||
|
var _ SELinuxRunner = &realSELinuxRunner{}
|
||||||
|
|
||||||
|
func (_ *realSELinuxRunner) Getfilecon(path string) (string, error) {
|
||||||
|
return "", nil
|
||||||
|
}
|
||||||
|
|
||||||
|
// FileLabel returns the SELinux label for this path or returns an error.
|
||||||
|
func SetFileLabel(path string, label string) error {
|
||||||
|
return nil
|
||||||
|
}
|
||||||
2
vendor/k8s.io/kubernetes/pkg/volume/util/hostutil/fake_hostutil.go
generated
vendored
2
vendor/k8s.io/kubernetes/pkg/volume/util/hostutil/fake_hostutil.go
generated
vendored
@ -108,7 +108,7 @@ func (hu *FakeHostUtil) GetOwner(pathname string) (int64, int64, error) {
|
|||||||
// GetSELinuxSupport tests if pathname is on a mount that supports SELinux.
|
// GetSELinuxSupport tests if pathname is on a mount that supports SELinux.
|
||||||
// Not implemented for testing
|
// Not implemented for testing
|
||||||
func (hu *FakeHostUtil) GetSELinuxSupport(pathname string) (bool, error) {
|
func (hu *FakeHostUtil) GetSELinuxSupport(pathname string) (bool, error) {
|
||||||
return false, errors.New("GetSELinuxSupport not implemented")
|
return false, nil
|
||||||
}
|
}
|
||||||
|
|
||||||
// GetMode returns permissions of pathname.
|
// GetMode returns permissions of pathname.
|
||||||
|
|||||||
13
vendor/k8s.io/kubernetes/pkg/volume/util/hostutil/hostutil_linux.go
generated
vendored
13
vendor/k8s.io/kubernetes/pkg/volume/util/hostutil/hostutil_linux.go
generated
vendored
@ -28,6 +28,7 @@ import (
|
|||||||
|
|
||||||
"golang.org/x/sys/unix"
|
"golang.org/x/sys/unix"
|
||||||
"k8s.io/klog/v2"
|
"k8s.io/klog/v2"
|
||||||
|
"k8s.io/kubernetes/pkg/util/selinux"
|
||||||
"k8s.io/mount-utils"
|
"k8s.io/mount-utils"
|
||||||
utilpath "k8s.io/utils/path"
|
utilpath "k8s.io/utils/path"
|
||||||
)
|
)
|
||||||
@ -229,8 +230,16 @@ func DoMakeRShared(path string, mountInfoFilename string) error {
|
|||||||
return nil
|
return nil
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// selinux.SELinuxEnabled implementation for unit tests
|
||||||
|
type seLinuxEnabledFunc func() bool
|
||||||
|
|
||||||
// GetSELinux is common implementation of GetSELinuxSupport on Linux.
|
// GetSELinux is common implementation of GetSELinuxSupport on Linux.
|
||||||
func GetSELinux(path string, mountInfoFilename string) (bool, error) {
|
func GetSELinux(path string, mountInfoFilename string, selinuxEnabled seLinuxEnabledFunc) (bool, error) {
|
||||||
|
// Skip /proc/mounts parsing if SELinux is disabled.
|
||||||
|
if !selinuxEnabled() {
|
||||||
|
return false, nil
|
||||||
|
}
|
||||||
|
|
||||||
info, err := findMountInfo(path, mountInfoFilename)
|
info, err := findMountInfo(path, mountInfoFilename)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return false, err
|
return false, err
|
||||||
@ -253,7 +262,7 @@ func GetSELinux(path string, mountInfoFilename string) (bool, error) {
|
|||||||
// GetSELinuxSupport returns true if given path is on a mount that supports
|
// GetSELinuxSupport returns true if given path is on a mount that supports
|
||||||
// SELinux.
|
// SELinux.
|
||||||
func (hu *HostUtil) GetSELinuxSupport(pathname string) (bool, error) {
|
func (hu *HostUtil) GetSELinuxSupport(pathname string) (bool, error) {
|
||||||
return GetSELinux(pathname, procMountInfoPath)
|
return GetSELinux(pathname, procMountInfoPath, selinux.SELinuxEnabled)
|
||||||
}
|
}
|
||||||
|
|
||||||
// GetOwner returns the integer ID for the user and group of the given path
|
// GetOwner returns the integer ID for the user and group of the given path
|
||||||
|
|||||||
26
vendor/k8s.io/kubernetes/pkg/volume/util/subpath/subpath_linux.go
generated
vendored
26
vendor/k8s.io/kubernetes/pkg/volume/util/subpath/subpath_linux.go
generated
vendored
@ -29,7 +29,6 @@ import (
|
|||||||
|
|
||||||
"golang.org/x/sys/unix"
|
"golang.org/x/sys/unix"
|
||||||
"k8s.io/klog/v2"
|
"k8s.io/klog/v2"
|
||||||
"k8s.io/kubernetes/pkg/volume/util/hostutil"
|
|
||||||
"k8s.io/mount-utils"
|
"k8s.io/mount-utils"
|
||||||
)
|
)
|
||||||
|
|
||||||
@ -109,12 +108,12 @@ func prepareSubpathTarget(mounter mount.Interface, subpath Subpath) (bool, strin
|
|||||||
notMount = true
|
notMount = true
|
||||||
}
|
}
|
||||||
if !notMount {
|
if !notMount {
|
||||||
linuxHostUtil := hostutil.NewHostUtil()
|
// It's already mounted, so check if it's bind-mounted to the same path
|
||||||
mntInfo, err := linuxHostUtil.FindMountInfo(bindPathTarget)
|
samePath, err := checkSubPathFileEqual(subpath, bindPathTarget)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
return false, "", fmt.Errorf("error calling findMountInfo for %s: %s", bindPathTarget, err)
|
return false, "", fmt.Errorf("error checking subpath mount info for %s: %s", bindPathTarget, err)
|
||||||
}
|
}
|
||||||
if mntInfo.Root != subpath.Path {
|
if !samePath {
|
||||||
// It's already mounted but not what we want, unmount it
|
// It's already mounted but not what we want, unmount it
|
||||||
if err = mounter.Unmount(bindPathTarget); err != nil {
|
if err = mounter.Unmount(bindPathTarget); err != nil {
|
||||||
return false, "", fmt.Errorf("error ummounting %s: %s", bindPathTarget, err)
|
return false, "", fmt.Errorf("error ummounting %s: %s", bindPathTarget, err)
|
||||||
@ -155,6 +154,23 @@ func prepareSubpathTarget(mounter mount.Interface, subpath Subpath) (bool, strin
|
|||||||
return false, bindPathTarget, nil
|
return false, bindPathTarget, nil
|
||||||
}
|
}
|
||||||
|
|
||||||
|
func checkSubPathFileEqual(subpath Subpath, bindMountTarget string) (bool, error) {
|
||||||
|
s, err := os.Lstat(subpath.Path)
|
||||||
|
if err != nil {
|
||||||
|
return false, fmt.Errorf("stat %s failed: %s", subpath.Path, err)
|
||||||
|
}
|
||||||
|
|
||||||
|
t, err := os.Lstat(bindMountTarget)
|
||||||
|
if err != nil {
|
||||||
|
return false, fmt.Errorf("lstat %s failed: %s", bindMountTarget, err)
|
||||||
|
}
|
||||||
|
|
||||||
|
if !os.SameFile(s, t) {
|
||||||
|
return false, nil
|
||||||
|
}
|
||||||
|
return true, nil
|
||||||
|
}
|
||||||
|
|
||||||
func getSubpathBindTarget(subpath Subpath) string {
|
func getSubpathBindTarget(subpath Subpath) string {
|
||||||
// containerName is DNS label, i.e. safe as a directory name.
|
// containerName is DNS label, i.e. safe as a directory name.
|
||||||
return filepath.Join(subpath.PodDir, containerSubPathDirectoryName, subpath.VolumeName, subpath.ContainerName, strconv.Itoa(subpath.VolumeMountIndex))
|
return filepath.Join(subpath.PodDir, containerSubPathDirectoryName, subpath.VolumeName, subpath.ContainerName, strconv.Itoa(subpath.VolumeMountIndex))
|
||||||
|
|||||||
10
vendor/k8s.io/kubernetes/test/e2e/framework/volume/fixtures.go
generated
vendored
10
vendor/k8s.io/kubernetes/test/e2e/framework/volume/fixtures.go
generated
vendored
@ -368,6 +368,16 @@ func runVolumeTesterPod(client clientset.Interface, timeouts *framework.TimeoutC
|
|||||||
var gracePeriod int64 = 1
|
var gracePeriod int64 = 1
|
||||||
var command string
|
var command string
|
||||||
|
|
||||||
|
/**
|
||||||
|
This condition fixes running storage e2e tests in SELinux environment.
|
||||||
|
HostPath Volume Plugin creates a directory within /tmp on host machine, to be mounted as volume.
|
||||||
|
Inject-pod writes content to the volume, and a client-pod tries the read the contents and verify.
|
||||||
|
When SELinux is enabled on the host, client-pod can not read the content, with permission denied.
|
||||||
|
Invoking client-pod as privileged, so that it can access the volume content, even when SELinux is enabled on the host.
|
||||||
|
*/
|
||||||
|
if config.Prefix == "hostpathsymlink" || config.Prefix == "hostpath" {
|
||||||
|
privileged = true
|
||||||
|
}
|
||||||
command = "while true ; do sleep 2; done "
|
command = "while true ; do sleep 2; done "
|
||||||
seLinuxOptions := &v1.SELinuxOptions{Level: "s0:c0,c1"}
|
seLinuxOptions := &v1.SELinuxOptions{Level: "s0:c0,c1"}
|
||||||
clientPod := &v1.Pod{
|
clientPod := &v1.Pod{
|
||||||
|
|||||||
2
vendor/k8s.io/kubernetes/test/utils/image/manifest.go
generated
vendored
2
vendor/k8s.io/kubernetes/test/utils/image/manifest.go
generated
vendored
@ -214,7 +214,7 @@ func initImageConfigs(list RegistryList) (map[int]Config, map[int]Config) {
|
|||||||
configs[CheckMetadataConcealment] = Config{list.PromoterE2eRegistry, "metadata-concealment", "1.6"}
|
configs[CheckMetadataConcealment] = Config{list.PromoterE2eRegistry, "metadata-concealment", "1.6"}
|
||||||
configs[CudaVectorAdd] = Config{list.PromoterE2eRegistry, "cuda-vector-add", "1.0"}
|
configs[CudaVectorAdd] = Config{list.PromoterE2eRegistry, "cuda-vector-add", "1.0"}
|
||||||
configs[CudaVectorAdd2] = Config{list.PromoterE2eRegistry, "cuda-vector-add", "2.2"}
|
configs[CudaVectorAdd2] = Config{list.PromoterE2eRegistry, "cuda-vector-add", "2.2"}
|
||||||
configs[DebianIptables] = Config{list.BuildImageRegistry, "debian-iptables", "buster-v1.6.5"}
|
configs[DebianIptables] = Config{list.BuildImageRegistry, "debian-iptables", "buster-v1.6.7"}
|
||||||
configs[EchoServer] = Config{list.PromoterE2eRegistry, "echoserver", "2.3"}
|
configs[EchoServer] = Config{list.PromoterE2eRegistry, "echoserver", "2.3"}
|
||||||
configs[Etcd] = Config{list.GcEtcdRegistry, "etcd", "3.4.13-0"}
|
configs[Etcd] = Config{list.GcEtcdRegistry, "etcd", "3.4.13-0"}
|
||||||
configs[GlusterDynamicProvisioner] = Config{list.PromoterE2eRegistry, "glusterdynamic-provisioner", "v1.0"}
|
configs[GlusterDynamicProvisioner] = Config{list.PromoterE2eRegistry, "glusterdynamic-provisioner", "v1.0"}
|
||||||
|
|||||||
10
vendor/k8s.io/mount-utils/mount_helper_windows.go
generated
vendored
10
vendor/k8s.io/mount-utils/mount_helper_windows.go
generated
vendored
@ -84,15 +84,9 @@ func NormalizeWindowsPath(path string) string {
|
|||||||
|
|
||||||
// ValidateDiskNumber : disk number should be a number in [0, 99]
|
// ValidateDiskNumber : disk number should be a number in [0, 99]
|
||||||
func ValidateDiskNumber(disk string) error {
|
func ValidateDiskNumber(disk string) error {
|
||||||
diskNum, err := strconv.Atoi(disk)
|
if _, err := strconv.Atoi(disk); err != nil {
|
||||||
if err != nil {
|
return fmt.Errorf("wrong disk number format: %q, err: %v", disk, err)
|
||||||
return fmt.Errorf("wrong disk number format: %q, err:%v", disk, err)
|
|
||||||
}
|
}
|
||||||
|
|
||||||
if diskNum < 0 || diskNum > 99 {
|
|
||||||
return fmt.Errorf("disk number out of range: %q", disk)
|
|
||||||
}
|
|
||||||
|
|
||||||
return nil
|
return nil
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
80
vendor/modules.txt
vendored
80
vendor/modules.txt
vendored
@ -49,6 +49,8 @@ github.com/aws/aws-sdk-go/service/sts
|
|||||||
github.com/aws/aws-sdk-go/service/sts/stsiface
|
github.com/aws/aws-sdk-go/service/sts/stsiface
|
||||||
# github.com/beorn7/perks v1.0.1
|
# github.com/beorn7/perks v1.0.1
|
||||||
github.com/beorn7/perks/quantile
|
github.com/beorn7/perks/quantile
|
||||||
|
# github.com/bits-and-blooms/bitset v1.2.0
|
||||||
|
github.com/bits-and-blooms/bitset
|
||||||
# github.com/blang/semver v3.5.1+incompatible
|
# github.com/blang/semver v3.5.1+incompatible
|
||||||
github.com/blang/semver
|
github.com/blang/semver
|
||||||
# github.com/cenkalti/backoff/v3 v3.0.0
|
# github.com/cenkalti/backoff/v3 v3.0.0
|
||||||
@ -309,6 +311,9 @@ github.com/opencontainers/go-digest
|
|||||||
# github.com/opencontainers/runc v1.0.2
|
# github.com/opencontainers/runc v1.0.2
|
||||||
github.com/opencontainers/runc/libcontainer/apparmor
|
github.com/opencontainers/runc/libcontainer/apparmor
|
||||||
github.com/opencontainers/runc/libcontainer/utils
|
github.com/opencontainers/runc/libcontainer/utils
|
||||||
|
# github.com/opencontainers/selinux v1.8.2
|
||||||
|
github.com/opencontainers/selinux/go-selinux
|
||||||
|
github.com/opencontainers/selinux/pkg/pwalk
|
||||||
# github.com/openshift/api v0.0.0-20210927171657-636513e97fda
|
# github.com/openshift/api v0.0.0-20210927171657-636513e97fda
|
||||||
github.com/openshift/api/security/v1
|
github.com/openshift/api/security/v1
|
||||||
# github.com/pborman/uuid v1.2.1
|
# github.com/pborman/uuid v1.2.1
|
||||||
@ -585,7 +590,7 @@ gopkg.in/tomb.v1
|
|||||||
gopkg.in/yaml.v2
|
gopkg.in/yaml.v2
|
||||||
# gopkg.in/yaml.v3 v3.0.0-20210107192922-496545a6307b
|
# gopkg.in/yaml.v3 v3.0.0-20210107192922-496545a6307b
|
||||||
gopkg.in/yaml.v3
|
gopkg.in/yaml.v3
|
||||||
# k8s.io/api v0.22.2 => k8s.io/api v0.22.2
|
# k8s.io/api v0.22.4 => k8s.io/api v0.22.4
|
||||||
## explicit
|
## explicit
|
||||||
k8s.io/api/admission/v1
|
k8s.io/api/admission/v1
|
||||||
k8s.io/api/admission/v1beta1
|
k8s.io/api/admission/v1beta1
|
||||||
@ -632,7 +637,7 @@ k8s.io/api/scheduling/v1beta1
|
|||||||
k8s.io/api/storage/v1
|
k8s.io/api/storage/v1
|
||||||
k8s.io/api/storage/v1alpha1
|
k8s.io/api/storage/v1alpha1
|
||||||
k8s.io/api/storage/v1beta1
|
k8s.io/api/storage/v1beta1
|
||||||
# k8s.io/apimachinery v0.22.2 => k8s.io/apimachinery v0.22.2
|
# k8s.io/apimachinery v0.22.4 => k8s.io/apimachinery v0.22.4
|
||||||
## explicit
|
## explicit
|
||||||
k8s.io/apimachinery/pkg/api/equality
|
k8s.io/apimachinery/pkg/api/equality
|
||||||
k8s.io/apimachinery/pkg/api/errors
|
k8s.io/apimachinery/pkg/api/errors
|
||||||
@ -689,7 +694,7 @@ k8s.io/apimachinery/pkg/watch
|
|||||||
k8s.io/apimachinery/third_party/forked/golang/json
|
k8s.io/apimachinery/third_party/forked/golang/json
|
||||||
k8s.io/apimachinery/third_party/forked/golang/netutil
|
k8s.io/apimachinery/third_party/forked/golang/netutil
|
||||||
k8s.io/apimachinery/third_party/forked/golang/reflect
|
k8s.io/apimachinery/third_party/forked/golang/reflect
|
||||||
# k8s.io/apiserver v0.22.2 => k8s.io/apiserver v0.22.2
|
# k8s.io/apiserver v0.22.4 => k8s.io/apiserver v0.22.4
|
||||||
k8s.io/apiserver/pkg/admission
|
k8s.io/apiserver/pkg/admission
|
||||||
k8s.io/apiserver/pkg/admission/configuration
|
k8s.io/apiserver/pkg/admission/configuration
|
||||||
k8s.io/apiserver/pkg/admission/initializer
|
k8s.io/apiserver/pkg/admission/initializer
|
||||||
@ -729,7 +734,7 @@ k8s.io/apiserver/pkg/util/feature
|
|||||||
k8s.io/apiserver/pkg/util/webhook
|
k8s.io/apiserver/pkg/util/webhook
|
||||||
k8s.io/apiserver/pkg/util/x509metrics
|
k8s.io/apiserver/pkg/util/x509metrics
|
||||||
k8s.io/apiserver/pkg/warning
|
k8s.io/apiserver/pkg/warning
|
||||||
# k8s.io/client-go v12.0.0+incompatible => k8s.io/client-go v0.22.2
|
# k8s.io/client-go v12.0.0+incompatible => k8s.io/client-go v0.22.4
|
||||||
## explicit
|
## explicit
|
||||||
k8s.io/client-go/applyconfigurations/admissionregistration/v1
|
k8s.io/client-go/applyconfigurations/admissionregistration/v1
|
||||||
k8s.io/client-go/applyconfigurations/admissionregistration/v1beta1
|
k8s.io/client-go/applyconfigurations/admissionregistration/v1beta1
|
||||||
@ -964,12 +969,12 @@ k8s.io/client-go/util/homedir
|
|||||||
k8s.io/client-go/util/keyutil
|
k8s.io/client-go/util/keyutil
|
||||||
k8s.io/client-go/util/retry
|
k8s.io/client-go/util/retry
|
||||||
k8s.io/client-go/util/workqueue
|
k8s.io/client-go/util/workqueue
|
||||||
# k8s.io/cloud-provider v0.22.2 => k8s.io/cloud-provider v0.22.2
|
# k8s.io/cloud-provider v0.22.4 => k8s.io/cloud-provider v0.22.4
|
||||||
## explicit
|
## explicit
|
||||||
k8s.io/cloud-provider
|
k8s.io/cloud-provider
|
||||||
k8s.io/cloud-provider/volume
|
k8s.io/cloud-provider/volume
|
||||||
k8s.io/cloud-provider/volume/helpers
|
k8s.io/cloud-provider/volume/helpers
|
||||||
# k8s.io/component-base v0.22.2 => k8s.io/component-base v0.22.2
|
# k8s.io/component-base v0.22.4 => k8s.io/component-base v0.22.4
|
||||||
k8s.io/component-base/cli/flag
|
k8s.io/component-base/cli/flag
|
||||||
k8s.io/component-base/config
|
k8s.io/component-base/config
|
||||||
k8s.io/component-base/config/v1alpha1
|
k8s.io/component-base/config/v1alpha1
|
||||||
@ -979,20 +984,20 @@ k8s.io/component-base/metrics/legacyregistry
|
|||||||
k8s.io/component-base/metrics/testutil
|
k8s.io/component-base/metrics/testutil
|
||||||
k8s.io/component-base/traces
|
k8s.io/component-base/traces
|
||||||
k8s.io/component-base/version
|
k8s.io/component-base/version
|
||||||
# k8s.io/component-helpers v0.22.2 => k8s.io/component-helpers v0.22.2
|
# k8s.io/component-helpers v0.22.4 => k8s.io/component-helpers v0.22.4
|
||||||
k8s.io/component-helpers/scheduling/corev1
|
k8s.io/component-helpers/scheduling/corev1
|
||||||
k8s.io/component-helpers/scheduling/corev1/nodeaffinity
|
k8s.io/component-helpers/scheduling/corev1/nodeaffinity
|
||||||
# k8s.io/klog/v2 v2.10.0
|
# k8s.io/klog/v2 v2.10.0
|
||||||
## explicit
|
## explicit
|
||||||
k8s.io/klog/v2
|
k8s.io/klog/v2
|
||||||
# k8s.io/kube-openapi v0.0.0-20210421082810-95288971da7e
|
# k8s.io/kube-openapi v0.0.0-20211109043538-20434351676c
|
||||||
k8s.io/kube-openapi/pkg/util/proto
|
k8s.io/kube-openapi/pkg/util/proto
|
||||||
# k8s.io/kubectl v0.0.0 => k8s.io/kubectl v0.22.2
|
# k8s.io/kubectl v0.0.0 => k8s.io/kubectl v0.22.4
|
||||||
k8s.io/kubectl/pkg/scale
|
k8s.io/kubectl/pkg/scale
|
||||||
k8s.io/kubectl/pkg/util/podutils
|
k8s.io/kubectl/pkg/util/podutils
|
||||||
# k8s.io/kubelet v0.0.0 => k8s.io/kubelet v0.22.2
|
# k8s.io/kubelet v0.0.0 => k8s.io/kubelet v0.22.4
|
||||||
k8s.io/kubelet/pkg/apis/stats/v1alpha1
|
k8s.io/kubelet/pkg/apis/stats/v1alpha1
|
||||||
# k8s.io/kubernetes v1.22.3
|
# k8s.io/kubernetes v1.22.4
|
||||||
## explicit
|
## explicit
|
||||||
k8s.io/kubernetes/pkg/api/legacyscheme
|
k8s.io/kubernetes/pkg/api/legacyscheme
|
||||||
k8s.io/kubernetes/pkg/api/service
|
k8s.io/kubernetes/pkg/api/service
|
||||||
@ -1025,6 +1030,7 @@ k8s.io/kubernetes/pkg/security/apparmor
|
|||||||
k8s.io/kubernetes/pkg/util/hash
|
k8s.io/kubernetes/pkg/util/hash
|
||||||
k8s.io/kubernetes/pkg/util/labels
|
k8s.io/kubernetes/pkg/util/labels
|
||||||
k8s.io/kubernetes/pkg/util/parsers
|
k8s.io/kubernetes/pkg/util/parsers
|
||||||
|
k8s.io/kubernetes/pkg/util/selinux
|
||||||
k8s.io/kubernetes/pkg/util/sysctl
|
k8s.io/kubernetes/pkg/util/sysctl
|
||||||
k8s.io/kubernetes/pkg/util/taints
|
k8s.io/kubernetes/pkg/util/taints
|
||||||
k8s.io/kubernetes/pkg/volume
|
k8s.io/kubernetes/pkg/volume
|
||||||
@ -1054,7 +1060,7 @@ k8s.io/kubernetes/test/e2e/storage/podlogs
|
|||||||
k8s.io/kubernetes/test/e2e/storage/utils
|
k8s.io/kubernetes/test/e2e/storage/utils
|
||||||
k8s.io/kubernetes/test/utils
|
k8s.io/kubernetes/test/utils
|
||||||
k8s.io/kubernetes/test/utils/image
|
k8s.io/kubernetes/test/utils/image
|
||||||
# k8s.io/mount-utils v0.22.2 => k8s.io/mount-utils v0.22.2
|
# k8s.io/mount-utils v0.22.4 => k8s.io/mount-utils v0.22.4
|
||||||
## explicit
|
## explicit
|
||||||
k8s.io/mount-utils
|
k8s.io/mount-utils
|
||||||
# k8s.io/utils v0.0.0-20210819203725-bdf08cb9a70a
|
# k8s.io/utils v0.0.0-20210819203725-bdf08cb9a70a
|
||||||
@ -1124,29 +1130,29 @@ sigs.k8s.io/yaml
|
|||||||
# github.com/golang/protobuf => github.com/golang/protobuf v1.4.3
|
# github.com/golang/protobuf => github.com/golang/protobuf v1.4.3
|
||||||
# github.com/portworx/sched-ops => github.com/portworx/sched-ops v0.20.4-openstorage-rc3
|
# github.com/portworx/sched-ops => github.com/portworx/sched-ops v0.20.4-openstorage-rc3
|
||||||
# gomodules.xyz/jsonpatch/v2 => github.com/gomodules/jsonpatch/v2 v2.2.0
|
# gomodules.xyz/jsonpatch/v2 => github.com/gomodules/jsonpatch/v2 v2.2.0
|
||||||
# k8s.io/api => k8s.io/api v0.22.2
|
# k8s.io/api => k8s.io/api v0.22.4
|
||||||
# k8s.io/apiextensions-apiserver => k8s.io/apiextensions-apiserver v0.22.2
|
# k8s.io/apiextensions-apiserver => k8s.io/apiextensions-apiserver v0.22.4
|
||||||
# k8s.io/apimachinery => k8s.io/apimachinery v0.22.2
|
# k8s.io/apimachinery => k8s.io/apimachinery v0.22.4
|
||||||
# k8s.io/apiserver => k8s.io/apiserver v0.22.2
|
# k8s.io/apiserver => k8s.io/apiserver v0.22.4
|
||||||
# k8s.io/cli-runtime => k8s.io/cli-runtime v0.22.2
|
# k8s.io/cli-runtime => k8s.io/cli-runtime v0.22.4
|
||||||
# k8s.io/client-go => k8s.io/client-go v0.22.2
|
# k8s.io/client-go => k8s.io/client-go v0.22.4
|
||||||
# k8s.io/cloud-provider => k8s.io/cloud-provider v0.22.2
|
# k8s.io/cloud-provider => k8s.io/cloud-provider v0.22.4
|
||||||
# k8s.io/cluster-bootstrap => k8s.io/cluster-bootstrap v0.22.2
|
# k8s.io/cluster-bootstrap => k8s.io/cluster-bootstrap v0.22.4
|
||||||
# k8s.io/code-generator => k8s.io/code-generator v0.22.2
|
# k8s.io/code-generator => k8s.io/code-generator v0.22.4
|
||||||
# k8s.io/component-base => k8s.io/component-base v0.22.2
|
# k8s.io/component-base => k8s.io/component-base v0.22.4
|
||||||
# k8s.io/component-helpers => k8s.io/component-helpers v0.22.2
|
# k8s.io/component-helpers => k8s.io/component-helpers v0.22.4
|
||||||
# k8s.io/controller-manager => k8s.io/controller-manager v0.22.2
|
# k8s.io/controller-manager => k8s.io/controller-manager v0.22.4
|
||||||
# k8s.io/cri-api => k8s.io/cri-api v0.22.2
|
# k8s.io/cri-api => k8s.io/cri-api v0.22.4
|
||||||
# k8s.io/csi-translation-lib => k8s.io/csi-translation-lib v0.22.2
|
# k8s.io/csi-translation-lib => k8s.io/csi-translation-lib v0.22.4
|
||||||
# k8s.io/kube-aggregator => k8s.io/kube-aggregator v0.22.2
|
# k8s.io/kube-aggregator => k8s.io/kube-aggregator v0.22.4
|
||||||
# k8s.io/kube-controller-manager => k8s.io/kube-controller-manager v0.22.2
|
# k8s.io/kube-controller-manager => k8s.io/kube-controller-manager v0.22.4
|
||||||
# k8s.io/kube-proxy => k8s.io/kube-proxy v0.22.2
|
# k8s.io/kube-proxy => k8s.io/kube-proxy v0.22.4
|
||||||
# k8s.io/kube-scheduler => k8s.io/kube-scheduler v0.22.2
|
# k8s.io/kube-scheduler => k8s.io/kube-scheduler v0.22.4
|
||||||
# k8s.io/kubectl => k8s.io/kubectl v0.22.2
|
# k8s.io/kubectl => k8s.io/kubectl v0.22.4
|
||||||
# k8s.io/kubelet => k8s.io/kubelet v0.22.2
|
# k8s.io/kubelet => k8s.io/kubelet v0.22.4
|
||||||
# k8s.io/legacy-cloud-providers => k8s.io/legacy-cloud-providers v0.22.2
|
# k8s.io/legacy-cloud-providers => k8s.io/legacy-cloud-providers v0.22.4
|
||||||
# k8s.io/metrics => k8s.io/metrics v0.22.2
|
# k8s.io/metrics => k8s.io/metrics v0.22.4
|
||||||
# k8s.io/mount-utils => k8s.io/mount-utils v0.22.2
|
# k8s.io/mount-utils => k8s.io/mount-utils v0.22.4
|
||||||
# k8s.io/pod-security-admission => k8s.io/pod-security-admission v0.22.2
|
# k8s.io/pod-security-admission => k8s.io/pod-security-admission v0.22.4
|
||||||
# k8s.io/sample-apiserver => k8s.io/sample-apiserver v0.22.2
|
# k8s.io/sample-apiserver => k8s.io/sample-apiserver v0.22.4
|
||||||
# layeh.com/radius => github.com/layeh/radius v0.0.0-20190322222518-890bc1058917
|
# layeh.com/radius => github.com/layeh/radius v0.0.0-20190322222518-890bc1058917
|
||||||
|
|||||||
Loading…
Reference in New Issue
Block a user