mirror of
https://github.com/tinygo-org/net.git
synced 2026-07-26 08:18:39 +00:00
35e809e0e5
Backport upstream Go standard library changes to TinyGo's net package. Unmodified files (18) replaced directly from Go 1.26.2 source. Modified files (22) merged via 3-way diff, preserving all TinyGo netdev adaptations, TINYGO markers, and embedded-device constraints. Notable upstream changes included: - net/http: cookie handling improvements, fs enhancements, reverse proxy updates, chunked encoding fixes - net/http: ServeMux routing and pattern matching updates - net: IP parsing and MAC address handling improvements - Various doc link syntax modernization (e.g. [Dial], [Buffers]) TinyGo-only files (netdev.go, tlssock.go) unchanged. All TINYGO comment markers preserved.
270 lines
7.4 KiB
Go
270 lines
7.4 KiB
Go
// TINYGO: The following is copied and modified from Go 1.26.2 official implementation.
|
|
|
|
// TINYGO: Removed trace stuff
|
|
|
|
// Copyright 2010 The Go Authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style
|
|
// license that can be found in the LICENSE file.
|
|
|
|
package http
|
|
|
|
import (
|
|
"io"
|
|
"net/http/internal/ascii"
|
|
"net/textproto"
|
|
"slices"
|
|
"strings"
|
|
"sync"
|
|
"time"
|
|
|
|
"golang.org/x/net/http/httpguts"
|
|
)
|
|
|
|
// A Header represents the key-value pairs in an HTTP header.
|
|
//
|
|
// The keys should be in canonical form, as returned by
|
|
// [CanonicalHeaderKey].
|
|
type Header map[string][]string
|
|
|
|
// Add adds the key, value pair to the header.
|
|
// It appends to any existing values associated with key.
|
|
// The key is case insensitive; it is canonicalized by
|
|
// [CanonicalHeaderKey].
|
|
func (h Header) Add(key, value string) {
|
|
textproto.MIMEHeader(h).Add(key, value)
|
|
}
|
|
|
|
// Set sets the header entries associated with key to the
|
|
// single element value. It replaces any existing values
|
|
// associated with key. The key is case insensitive; it is
|
|
// canonicalized by [textproto.CanonicalMIMEHeaderKey].
|
|
// To use non-canonical keys, assign to the map directly.
|
|
func (h Header) Set(key, value string) {
|
|
textproto.MIMEHeader(h).Set(key, value)
|
|
}
|
|
|
|
// Get gets the first value associated with the given key. If
|
|
// there are no values associated with the key, Get returns "".
|
|
// It is case insensitive; [textproto.CanonicalMIMEHeaderKey] is
|
|
// used to canonicalize the provided key. Get assumes that all
|
|
// keys are stored in canonical form. To use non-canonical keys,
|
|
// access the map directly.
|
|
func (h Header) Get(key string) string {
|
|
return textproto.MIMEHeader(h).Get(key)
|
|
}
|
|
|
|
// Values returns all values associated with the given key.
|
|
// It is case insensitive; [textproto.CanonicalMIMEHeaderKey] is
|
|
// used to canonicalize the provided key. To use non-canonical
|
|
// keys, access the map directly.
|
|
// The returned slice is not a copy.
|
|
func (h Header) Values(key string) []string {
|
|
return textproto.MIMEHeader(h).Values(key)
|
|
}
|
|
|
|
// get is like Get, but key must already be in CanonicalHeaderKey form.
|
|
func (h Header) get(key string) string {
|
|
if v := h[key]; len(v) > 0 {
|
|
return v[0]
|
|
}
|
|
return ""
|
|
}
|
|
|
|
// has reports whether h has the provided key defined, even if it's
|
|
// set to 0-length slice.
|
|
func (h Header) has(key string) bool {
|
|
_, ok := h[key]
|
|
return ok
|
|
}
|
|
|
|
// Del deletes the values associated with key.
|
|
// The key is case insensitive; it is canonicalized by
|
|
// [CanonicalHeaderKey].
|
|
func (h Header) Del(key string) {
|
|
textproto.MIMEHeader(h).Del(key)
|
|
}
|
|
|
|
// Write writes a header in wire format.
|
|
func (h Header) Write(w io.Writer) error {
|
|
return h.write(w)
|
|
}
|
|
|
|
func (h Header) write(w io.Writer) error {
|
|
return h.writeSubset(w, nil)
|
|
}
|
|
|
|
// Clone returns a copy of h or nil if h is nil.
|
|
func (h Header) Clone() Header {
|
|
if h == nil {
|
|
return nil
|
|
}
|
|
|
|
// Find total number of values.
|
|
nv := 0
|
|
for _, vv := range h {
|
|
nv += len(vv)
|
|
}
|
|
sv := make([]string, nv) // shared backing array for headers' values
|
|
h2 := make(Header, len(h))
|
|
for k, vv := range h {
|
|
if vv == nil {
|
|
// Preserve nil values. ReverseProxy distinguishes
|
|
// between nil and zero-length header values.
|
|
h2[k] = nil
|
|
continue
|
|
}
|
|
n := copy(sv, vv)
|
|
h2[k] = sv[:n:n]
|
|
sv = sv[n:]
|
|
}
|
|
return h2
|
|
}
|
|
|
|
var timeFormats = []string{
|
|
TimeFormat,
|
|
time.RFC850,
|
|
time.ANSIC,
|
|
}
|
|
|
|
// ParseTime parses a time header (such as the Date: header),
|
|
// trying each of the three formats allowed by HTTP/1.1:
|
|
// [TimeFormat], [time.RFC850], and [time.ANSIC].
|
|
func ParseTime(text string) (t time.Time, err error) {
|
|
for _, layout := range timeFormats {
|
|
t, err = time.Parse(layout, text)
|
|
if err == nil {
|
|
return
|
|
}
|
|
}
|
|
return
|
|
}
|
|
|
|
var headerNewlineToSpace = strings.NewReplacer("\n", " ", "\r", " ")
|
|
|
|
// stringWriter implements WriteString on a Writer.
|
|
type stringWriter struct {
|
|
w io.Writer
|
|
}
|
|
|
|
func (w stringWriter) WriteString(s string) (n int, err error) {
|
|
return w.w.Write([]byte(s))
|
|
}
|
|
|
|
type keyValues struct {
|
|
key string
|
|
values []string
|
|
}
|
|
|
|
// headerSorter contains a slice of keyValues sorted by keyValues.key.
|
|
type headerSorter struct {
|
|
kvs []keyValues
|
|
}
|
|
|
|
var headerSorterPool = sync.Pool{
|
|
New: func() any { return new(headerSorter) },
|
|
}
|
|
|
|
// sortedKeyValues returns h's keys sorted in the returned kvs
|
|
// slice. The headerSorter used to sort is also returned, for possible
|
|
// return to headerSorterCache.
|
|
func (h Header) sortedKeyValues(exclude map[string]bool) (kvs []keyValues, hs *headerSorter) {
|
|
hs = headerSorterPool.Get().(*headerSorter)
|
|
if cap(hs.kvs) < len(h) {
|
|
hs.kvs = make([]keyValues, 0, len(h))
|
|
}
|
|
kvs = hs.kvs[:0]
|
|
for k, vv := range h {
|
|
if !exclude[k] {
|
|
kvs = append(kvs, keyValues{k, vv})
|
|
}
|
|
}
|
|
hs.kvs = kvs
|
|
slices.SortFunc(hs.kvs, func(a, b keyValues) int { return strings.Compare(a.key, b.key) })
|
|
return kvs, hs
|
|
}
|
|
|
|
// WriteSubset writes a header in wire format.
|
|
// If exclude is not nil, keys where exclude[key] == true are not written.
|
|
// Keys are not canonicalized before checking the exclude map.
|
|
func (h Header) WriteSubset(w io.Writer, exclude map[string]bool) error {
|
|
return h.writeSubset(w, exclude)
|
|
}
|
|
|
|
func (h Header) writeSubset(w io.Writer, exclude map[string]bool) error {
|
|
ws, ok := w.(io.StringWriter)
|
|
if !ok {
|
|
ws = stringWriter{w}
|
|
}
|
|
kvs, sorter := h.sortedKeyValues(exclude)
|
|
for _, kv := range kvs {
|
|
if !httpguts.ValidHeaderFieldName(kv.key) {
|
|
// This could be an error. In the common case of
|
|
// writing response headers, however, we have no good
|
|
// way to provide the error back to the server
|
|
// handler, so just drop invalid headers instead.
|
|
continue
|
|
}
|
|
for _, v := range kv.values {
|
|
v = headerNewlineToSpace.Replace(v)
|
|
v = textproto.TrimString(v)
|
|
for _, s := range []string{kv.key, ": ", v, "\r\n"} {
|
|
if _, err := ws.WriteString(s); err != nil {
|
|
headerSorterPool.Put(sorter)
|
|
return err
|
|
}
|
|
}
|
|
}
|
|
}
|
|
headerSorterPool.Put(sorter)
|
|
return nil
|
|
}
|
|
|
|
// CanonicalHeaderKey returns the canonical format of the
|
|
// header key s. The canonicalization converts the first
|
|
// letter and any letter following a hyphen to upper case;
|
|
// the rest are converted to lowercase. For example, the
|
|
// canonical key for "accept-encoding" is "Accept-Encoding".
|
|
// If s contains a space or invalid header field bytes, it is
|
|
// returned without modifications.
|
|
func CanonicalHeaderKey(s string) string { return textproto.CanonicalMIMEHeaderKey(s) }
|
|
|
|
// hasToken reports whether token appears with v, ASCII
|
|
// case-insensitive, with space or comma boundaries.
|
|
// token must be all lowercase.
|
|
// v may contain mixed cased.
|
|
func hasToken(v, token string) bool {
|
|
if len(token) > len(v) || token == "" {
|
|
return false
|
|
}
|
|
if v == token {
|
|
return true
|
|
}
|
|
for sp := 0; sp <= len(v)-len(token); sp++ {
|
|
// Check that first character is good.
|
|
// The token is ASCII, so checking only a single byte
|
|
// is sufficient. We skip this potential starting
|
|
// position if both the first byte and its potential
|
|
// ASCII uppercase equivalent (b|0x20) don't match.
|
|
// False positives ('^' => '~') are caught by EqualFold.
|
|
if b := v[sp]; b != token[0] && b|0x20 != token[0] {
|
|
continue
|
|
}
|
|
// Check that start pos is on a valid token boundary.
|
|
if sp > 0 && !isTokenBoundary(v[sp-1]) {
|
|
continue
|
|
}
|
|
// Check that end pos is on a valid token boundary.
|
|
if endPos := sp + len(token); endPos != len(v) && !isTokenBoundary(v[endPos]) {
|
|
continue
|
|
}
|
|
if ascii.EqualFold(v[sp:sp+len(token)], token) {
|
|
return true
|
|
}
|
|
}
|
|
return false
|
|
}
|
|
|
|
func isTokenBoundary(b byte) bool {
|
|
return b == ' ' || b == ',' || b == '\t'
|
|
}
|