Initial QSfera import
This commit is contained in:
Курнат Андрей
+201
@@ -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.
|
||||
+73
@@ -0,0 +1,73 @@
|
||||
# xml-roundtrip-validator
|
||||
|
||||
The Go module `github.com/mattermost/xml-roundtrip-validator` implements mitigations for multiple security issues in Go's `encoding/xml`. Applications that use `encoding/xml` for security-critical operations, such as XML signature validation and SAML, may use the `Validate` and `ValidateAll` functions to avoid impact from malicious XML inputs.
|
||||
|
||||
## Usage
|
||||
|
||||
### Validate
|
||||
|
||||
```Go
|
||||
import (
|
||||
"strings"
|
||||
|
||||
xrv "github.com/mattermost/xml-roundtrip-validator"
|
||||
)
|
||||
|
||||
func DoStuffWithXML(input string) {
|
||||
if err := xrv.Validate(strings.NewReader(input)); err != nil {
|
||||
panic(err)
|
||||
}
|
||||
// validation succeeded, input is safe
|
||||
actuallyDoStuffWithXML(input)
|
||||
}
|
||||
```
|
||||
|
||||
### ValidateAll
|
||||
|
||||
```Go
|
||||
import (
|
||||
"strings"
|
||||
|
||||
xrv "github.com/mattermost/xml-roundtrip-validator"
|
||||
)
|
||||
|
||||
func DoStuffWithXML(input string) {
|
||||
if errs := xrv.ValidateAll(strings.NewReader(input)); len(errs) != 0 {
|
||||
for err := range errs {
|
||||
// here you can log each error individually if you like
|
||||
}
|
||||
return
|
||||
}
|
||||
// validation succeeded, input is safe
|
||||
actuallyDoStuffWithXML(input)
|
||||
}
|
||||
```
|
||||
|
||||
### CLI
|
||||
|
||||
Compiling:
|
||||
|
||||
```
|
||||
$ go build cmd/xrv.go
|
||||
```
|
||||
|
||||
Running:
|
||||
|
||||
```
|
||||
$ ./xrv good.xml
|
||||
Document validated without errors
|
||||
$ ./xrv bad.xml
|
||||
validator: in token starting at 2:5: roundtrip error: expected {{ :Element} []}, observed {{ Element} []}
|
||||
$ ./xrv -all bad.xml
|
||||
validator: in token starting at 2:5: roundtrip error: expected {{ :Element} []}, observed {{ Element} []}
|
||||
validator: in token starting at 3:5: roundtrip error: expected {{ Element} [{{ :attr} z}]}, observed {{ Element} [{{ attr} z}]}
|
||||
```
|
||||
|
||||
## Go vulnerabilities addressed
|
||||
|
||||
Descriptions of the Go vulnerabilities addressed by this module can be found in the advisories directory. Specifically, the issues addressed are:
|
||||
|
||||
- [Element namespace prefix instability](./advisories/unstable-elements.md)
|
||||
- [Attribute namespace prefix instability](./advisories/unstable-attributes.md)
|
||||
- [Directive comment instability](./advisories/unstable-directives.md)
|
||||
- Any other similar roundtrip issues we may not know about
|
||||
+25
@@ -0,0 +1,25 @@
|
||||
Security
|
||||
========
|
||||
|
||||
Safety and data security is of the utmost priority for the Mattermost community. If you are a security researcher and have discovered a security vulnerability in our codebase, we would appreciate your help in disclosing it to us in a responsible manner.
|
||||
|
||||
Reporting security issues
|
||||
-------------------------
|
||||
|
||||
**Please do not use GitHub issues for security-sensitive communication.**
|
||||
|
||||
Security issues in the community test server, any of the open source codebases maintained by Mattermost, or any of our commercial offerings should be reported via email to [responsibledisclosure@mattermost.com](mailto:responsibledisclosure@mattermost.com). Mattermost is committed to working together with researchers and keeping them updated throughout the patching process. Researchers who responsibly report valid security issues will be publicly credited for their efforts (if they so choose).
|
||||
|
||||
For a more detailed description of the disclosure process and a list of researchers who have previously contributed to the disclosure program, see [Report a Security Vulnerability](https://mattermost.com/security-vulnerability-report/) on the Mattermost website.
|
||||
|
||||
Security updates
|
||||
----------------
|
||||
|
||||
Mattermost has a mandatory upgrade policy, and updates are only provided for the latest 3 releases and the current Extended Support Release (ESR). Critical updates are delivered as dot releases. Details on security updates are announced 30 days after the availability of the update.
|
||||
|
||||
For more details about the security content of past releases, see the [Security Updates](https://mattermost.com/security-updates/) page on the Mattermost website. For timely notifications about new security updates, subscribe to the [Security Bulletins Mailing List](https://about.mattermost.com/security-bulletin).
|
||||
|
||||
Contributing to this policy
|
||||
---------------------------
|
||||
|
||||
If you have feedback or suggestions on improving this policy document, please [create an issue](https://github.com/mattermost/mattermost-server/issues/new).
|
||||
+292
@@ -0,0 +1,292 @@
|
||||
package validator
|
||||
|
||||
import (
|
||||
"bytes"
|
||||
"encoding/xml"
|
||||
"errors"
|
||||
"fmt"
|
||||
"io"
|
||||
)
|
||||
|
||||
// XMLRoundtripError is returned when a round-trip token doesn't match the original
|
||||
type XMLRoundtripError struct {
|
||||
Expected, Observed xml.Token
|
||||
Overflow []byte
|
||||
}
|
||||
|
||||
func (err XMLRoundtripError) Error() string {
|
||||
if len(err.Overflow) == 0 {
|
||||
return fmt.Sprintf("roundtrip error: expected %v, observed %v", err.Expected, err.Observed)
|
||||
}
|
||||
return fmt.Sprintf("roundtrip error: unexpected overflow after token: %s", err.Overflow)
|
||||
}
|
||||
|
||||
// XMLValidationError is returned when validating an XML document fails
|
||||
type XMLValidationError struct {
|
||||
Start, End, Line, Column int64
|
||||
err error
|
||||
}
|
||||
|
||||
func (err XMLValidationError) Error() string {
|
||||
return fmt.Sprintf("validator: in token starting at %d:%d: %s", err.Line, err.Column, err.err.Error())
|
||||
}
|
||||
|
||||
func (err XMLValidationError) Unwrap() error {
|
||||
return err.err
|
||||
}
|
||||
|
||||
// Validate makes sure the given XML bytes survive round trips through encoding/xml without mutations
|
||||
func Validate(xmlReader io.Reader) error {
|
||||
xmlBuffer := &bytes.Buffer{}
|
||||
xmlReader = &byteReader{io.TeeReader(xmlReader, xmlBuffer)}
|
||||
decoder := xml.NewDecoder(xmlReader)
|
||||
decoder.Strict = false
|
||||
decoder.CharsetReader = func(charset string, input io.Reader) (io.Reader, error) { return input, nil }
|
||||
offset := int64(0)
|
||||
for {
|
||||
token, err := decoder.RawToken()
|
||||
if err == io.EOF {
|
||||
return nil
|
||||
} else if err != nil {
|
||||
return err
|
||||
}
|
||||
if err := CheckToken(token); err != nil {
|
||||
xmlBytes := xmlBuffer.Bytes()
|
||||
line := bytes.Count(xmlBytes[0:offset], []byte{'\n'}) + 1
|
||||
lineStart := int64(bytes.LastIndexByte(xmlBytes[0:offset], '\n')) + 1
|
||||
column := offset - lineStart + 1
|
||||
return XMLValidationError{
|
||||
Start: offset,
|
||||
End: decoder.InputOffset(),
|
||||
Line: int64(line),
|
||||
Column: column,
|
||||
err: err,
|
||||
}
|
||||
}
|
||||
offset = decoder.InputOffset()
|
||||
}
|
||||
}
|
||||
|
||||
// ValidateAll is like Validate, but instead of returning after the first error,
|
||||
// it accumulates errors and validates the entire document
|
||||
func ValidateAll(xmlReader io.Reader) []error {
|
||||
xmlBuffer := &bytes.Buffer{}
|
||||
xmlReader = io.TeeReader(xmlReader, xmlBuffer)
|
||||
errs := []error{}
|
||||
offset := int64(0)
|
||||
line := int64(1)
|
||||
column := int64(1)
|
||||
for {
|
||||
err := Validate(xmlReader)
|
||||
if err == nil {
|
||||
// reached the end with no additional errors
|
||||
break
|
||||
}
|
||||
validationError := XMLValidationError{}
|
||||
if errors.As(err, &validationError) {
|
||||
// validation errors contain line numbers and offsets, but
|
||||
// these offsets are based on the offset where Validate
|
||||
// was called, so they need to be adjusted to accordingly
|
||||
validationError.Start += offset
|
||||
validationError.End += offset
|
||||
if validationError.Line == 1 {
|
||||
validationError.Column += column - 1
|
||||
}
|
||||
validationError.Line += line - 1
|
||||
errs = append(errs, validationError)
|
||||
xmlBytes := xmlBuffer.Bytes()
|
||||
offset += int64(len(xmlBytes))
|
||||
newLines := int64(bytes.Count(xmlBytes, []byte("\n")))
|
||||
line += newLines
|
||||
if newLines > 0 {
|
||||
column = int64(len(xmlBytes) - bytes.LastIndex(xmlBytes, []byte("\n")))
|
||||
} else {
|
||||
column += int64(len(xmlBytes))
|
||||
}
|
||||
xmlBuffer.Reset()
|
||||
} else {
|
||||
// this was not a validation error, but likely
|
||||
// completely unparseable XML instead; no point
|
||||
// in trying to continue
|
||||
errs = append(errs, err)
|
||||
break
|
||||
}
|
||||
}
|
||||
return errs
|
||||
}
|
||||
|
||||
// bufio implements a ByteReader but we explicitly don't want any buffering
|
||||
type byteReader struct {
|
||||
r io.Reader
|
||||
}
|
||||
|
||||
func (r *byteReader) ReadByte() (byte, error) {
|
||||
var p [1]byte
|
||||
n, err := r.r.Read(p[:])
|
||||
|
||||
// The doc for the io.ByteReader interface states:
|
||||
// If ReadByte returns an error, no input byte was consumed, and the returned byte value is undefined.
|
||||
// So if a byte is actually extracted from the reader, and we want to return it, we mustn't return the error.
|
||||
if n > 0 {
|
||||
// this byteReader is only used in the context of the Validate() function,
|
||||
// we deliberately choose to completely ignore the error in this case.
|
||||
// return the byte extracted from the reader
|
||||
return p[0], nil
|
||||
}
|
||||
|
||||
return 0, err
|
||||
}
|
||||
|
||||
func (r *byteReader) Read(p []byte) (int, error) {
|
||||
return r.r.Read(p)
|
||||
}
|
||||
|
||||
// CheckToken computes a round trip for a given xml.Token and returns an
|
||||
// error if the newly calculated token differs from the original
|
||||
func CheckToken(before xml.Token) error {
|
||||
buffer := &bytes.Buffer{}
|
||||
encoder := xml.NewEncoder(buffer)
|
||||
|
||||
switch t := before.(type) {
|
||||
case xml.EndElement:
|
||||
// xml.Encoder expects matching StartElements for all EndElements
|
||||
if err := encoder.EncodeToken(xml.StartElement{Name: t.Name}); err != nil {
|
||||
return err
|
||||
}
|
||||
}
|
||||
|
||||
if err := encoder.EncodeToken(before); err != nil {
|
||||
return err
|
||||
}
|
||||
if err := encoder.Flush(); err != nil {
|
||||
return err
|
||||
}
|
||||
encoded := buffer.Bytes()
|
||||
decoder := xml.NewDecoder(bytes.NewReader(encoded))
|
||||
decoder.CharsetReader = func(charset string, input io.Reader) (io.Reader, error) { return input, nil }
|
||||
|
||||
switch before.(type) {
|
||||
case xml.EndElement:
|
||||
// throw away the StartElement we added above
|
||||
if _, err := decoder.RawToken(); err != nil {
|
||||
return err
|
||||
}
|
||||
}
|
||||
|
||||
after, err := decoder.RawToken()
|
||||
if err != nil {
|
||||
return err
|
||||
}
|
||||
|
||||
if !tokenEquals(before, after) {
|
||||
return XMLRoundtripError{before, after, nil}
|
||||
}
|
||||
offset := decoder.InputOffset()
|
||||
if offset != int64(len(encoded)) {
|
||||
// this is likely unreachable, but just in case
|
||||
return XMLRoundtripError{before, after, encoded[offset:]}
|
||||
}
|
||||
return nil
|
||||
}
|
||||
|
||||
func tokenEquals(before, after xml.Token) bool {
|
||||
switch t1 := before.(type) {
|
||||
|
||||
case xml.CharData:
|
||||
t2, ok := after.(xml.CharData)
|
||||
if !ok {
|
||||
return false
|
||||
}
|
||||
return bytes.Equal(t1, t2)
|
||||
|
||||
case xml.Comment:
|
||||
t2, ok := after.(xml.Comment)
|
||||
if !ok {
|
||||
return false
|
||||
}
|
||||
return bytes.Equal(t1, t2)
|
||||
|
||||
case xml.Directive:
|
||||
t2, ok := after.(xml.Directive)
|
||||
if !ok {
|
||||
return false
|
||||
}
|
||||
return bytes.Equal(t1, t2)
|
||||
|
||||
case xml.EndElement:
|
||||
t2, ok := after.(xml.EndElement)
|
||||
if !ok {
|
||||
return false
|
||||
}
|
||||
// local name should equal; namespace prefixes get erased
|
||||
return t1.Name.Local == t2.Name.Local && t2.Name.Space == ""
|
||||
|
||||
case xml.ProcInst:
|
||||
t2, ok := after.(xml.ProcInst)
|
||||
if !ok {
|
||||
return false
|
||||
}
|
||||
return t1.Target == t2.Target && bytes.Equal(t1.Inst, t2.Inst)
|
||||
|
||||
case xml.StartElement:
|
||||
t2, ok := after.(xml.StartElement)
|
||||
if !ok {
|
||||
return false
|
||||
}
|
||||
// encoding/xml messes up namespace prefixes on both tag and attribute names;
|
||||
// they need adjusting to make the comparison possible
|
||||
fixNamespacePrefixes(&t1, &t2)
|
||||
if t1.Name != t2.Name {
|
||||
return false
|
||||
}
|
||||
if len(t1.Attr) != len(t2.Attr) {
|
||||
return false
|
||||
}
|
||||
// after the call to fixNamespacePrefixes, all attributes should match;
|
||||
// ordering is preserved
|
||||
for i, attr := range t1.Attr {
|
||||
if attr != t2.Attr[i] {
|
||||
return false
|
||||
}
|
||||
}
|
||||
return true
|
||||
}
|
||||
return false
|
||||
}
|
||||
|
||||
func fixNamespacePrefixes(before, after *xml.StartElement) {
|
||||
// if the after token has more attributes than the before token,
|
||||
// the round trip likely introduced new xmlns attributes
|
||||
if len(after.Attr) > len(before.Attr) {
|
||||
|
||||
// handle erased tag prefixes; the corresponding xmlns attribute is always the first one
|
||||
if (before.Name.Space != "" && after.Name.Space == "" && after.Attr[0].Name == xml.Name{Local: "xmlns"}) {
|
||||
after.Name.Space = after.Attr[0].Value
|
||||
after.Attr = after.Attr[1:]
|
||||
}
|
||||
|
||||
// handle attribute prefixes; the xmlns attribute always comes immediately before the prefixed attribute
|
||||
for len(after.Attr) > len(before.Attr) && len(after.Attr) > 1 {
|
||||
var xmlns *xml.Attr
|
||||
i := 1
|
||||
for ; i < len(after.Attr); i++ {
|
||||
if after.Attr[i-1].Name.Space == "xmlns" && after.Attr[i-1].Name.Local == after.Attr[i].Name.Space {
|
||||
xmlns = &after.Attr[i-1]
|
||||
break
|
||||
}
|
||||
}
|
||||
if xmlns == nil {
|
||||
break
|
||||
}
|
||||
prefix := xmlns.Name.Local
|
||||
space := xmlns.Value
|
||||
copy(after.Attr[i-1:], after.Attr[i:])
|
||||
after.Attr = after.Attr[:len(after.Attr)-1]
|
||||
for j := range after.Attr {
|
||||
if after.Attr[j].Name.Space == prefix {
|
||||
after.Attr[j].Name.Space = space
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user