mirror of
https://github.com/anchore/syft.git
synced 2026-11-02 07:26:34 +01:00
* fix(golang): bound UPX decompression by what the input can justify A UPX block's `sz_unc` was passed straight to `make([]byte, n)`, so four bytes of attacker input spanned the full uint32 range. A ~300KB file could drive multi-GB resident memory, which Go reports as a fatal runtime OOM that no `recover` on this path can contain. Syft parses binaries out of arbitrary images, so that is reachable from any scan. Two bounds do the work, and UPX's own invariants make them exact: - all blocks together reconstruct `p_filesize`, so a running remainder caps the sum. Bounding only per-block would leave the total at (block count x original size), so the remainder is the part that actually closes it - `p_filesize` sizes the output buffer, so it is capped both absolutely and against the size of the file on disk. The absolute cap alone left a ~60 byte header able to claim 500MB; the ratio alone cannot work either, since LZMA encodes a run of N equal bytes in O(log N) and a `go:embed` of 120MB of zeros legitimately packs 209x The output buffer is also allocated on the first block that survives validation rather than up front, so a header claiming a large size with nothing decodable behind it costs nothing. Alongside that, several ways the block loop could be steered off its own buffer: - `parseELFPTLoadOffsets` bounds-checked program headers with `phStart+phentsize > len(buf)`, which overflows for a `p_offset` near 2^64 and lets an out-of-range entry through into a slice index. Switched to the subtraction form, and a `phentsize` shorter than an ELF64 program header is rejected since the reads use fixed offsets - block placement had the same overflow shape, and on failure it skipped the copy and fell through. `outputOffset` derives from the rejected offset, so a `p_offset` at the uint64 ceiling wrapped it to 0 and the next block landed on the reconstructed ELF header, still returning success. Out-of-range placement now ends the block chain, keeping the blocks already placed since those often carry `.go.buildinfo` - the UPX 2-byte LZMA header carries `lc`/`lp` as nibbles and `pb` as three bits, so they can hold values LZMA does not permit. Folded into the props byte they wrap (`lc=15, lp=15, pb=7` gives 465, which truncates to 209) and the stream mis-decodes instead of failing - blocks decode directly into a slice of the output buffer instead of a per-block buffer that is then copied, so one block no longer doubles peak memory - the block count is capped: the size budget alone still allows millions of 12-byte blocks, each spinning up an LZMA reader Verified against the `image-small-upx` fixture, a real `upx --best --lzma` binary: four blocks, max `sz_unc` equal to `p_blocksize` exactly, blocks summing to 0.68 of `p_filesize`, and a 1.96x expansion against the packed file, so every bound holds with headroom on genuine output. Note `p_blocksize` is deliberately not used as a ceiling on `sz_unc`. It adds nothing the remainder does not already cover, and real output sits at exactly `p_blocksize`, so it would run with zero headroom against a value the format does not promise. Signed-off-by: Alex Goodman <wagoodman@users.noreply.github.com> * fix(golang): report UPX binaries we cannot unpack as unknowns A packed Go binary we fail to unpack means its packages are silently missing from the SBOM. `getBuildInfo` checked the decompression error for nil and discarded it, so a rejected file surfaced only the original `buildinfo.Read` error, and that one is deliberately silenced because it is usually just "not a Go binary". `decompressUPX` now marks the cases worth reporting with `errUPXDecompress`: it got past the header and the method dispatch and still could not unpack the file. Everything else stays quiet, which matters more than it sounds. `upx` defaults to NRV2B unless `--lzma` is passed and only LZMA is implemented here, so treating any decompression failure as reportable would attach a golang-cataloger unknown to every packed non-Go binary in an image. Making the reportable case opt in rather than the quiet case a growing list also means a guard added later is silent by default. Signed-off-by: Alex Goodman <wagoodman@users.noreply.github.com> * refactor(golang): drop the vendored xcoff parser The only thing the golang cataloger read from it was `TargetMachine`, which is the same two magic bytes `getGOARCHFromBin` had already matched on to dispatch there. So a full XCOFF walk (string table, symbol table, every relocation table) ran to recover a value that was already in hand. `getGOARCHFromBin` reads those two bytes directly now. That is also strictly more correct: `xcoff.NewFile` bailed with "no symbol table" when `symptr == 0`, so a stripped XCOFF binary reported no arch at all. Fixtures move to `testdata/xcoff/`, since they are no longer a package's own testdata. Signed-off-by: Alex Goodman <wagoodman@users.noreply.github.com> * feat(internal/file): report a reader's real size behind one helper Bounds get written as "does this claim exceed what the reader actually holds", and the subtlety is that a reader's own answer cannot be trusted: an `io.SectionReader` reports the nominal length it was built with, so one constructed with `1<<63-1` will happily claim to hold 8EB. Confirming the last byte is readable is what separates a real size from a nominal one. Returns `(int64, bool)` rather than a bare size, since there are five ways to not know and collapsing them to 0 makes every caller reinvent "0 means stop bounding". The doc also names the wrapper trap: a type embedding `io.ReaderAt` as an interface promotes only `ReadAt`, so it answers no size at all however large the reader beneath it is, and a bound written against it silently does nothing. Signed-off-by: Alex Goodman <wagoodman@users.noreply.github.com> * fix(golang): bound every section a reader can expand, not just the name table `CheckSectionNameTable` bounds the one section `elf.NewFile` expands while parsing, which is enough for a caller that only parses. It is not enough for one that goes on to read sections: those are expanded lazily, so a 260KB ELF declaring a compressed `.symtab` drove 1.3GB of allocation through `goversion`, which opens the file with `debug/elf` inside its own package and cannot be routed through `elfutil.NewFile`. `CheckAllSections` is that gate, and is deliberately named as the superset so the relationship to the narrow one is structural rather than documented. Also exports `ErrDeclaredSizeExceeded`. A refusal here costs the SBOM a package, so callers report it as an unknown, and matching on an error string to decide that is not something to build a reporting policy on. A ruleguard rule now flags `buildinfo.Read` and `version.ReadExeFromReader` outside `scan_binary.go`. Both open `debug/elf` internally and are only bounded there by the wrappers that gate the reader first, which the existing rule on `elf.NewFile` could not see through. Signed-off-by: Alex Goodman <wagoodman@users.noreply.github.com> * feat(internal/spillbuf): sparse offset-addressed buffer that spills to disk For output that arrives out of order, at offsets the input itself declares: a decompressor placing extents, an archive rebuilding a file from chunks. A plain `[]byte` cannot do that without either pre-sizing to a length the input claims or growing to the furthest offset it names, and both hand a hostile input an allocation knob. The load-bearing property is that it reports only what it actually stored. `Size` is the contiguous run written from offset zero and a read past it is `io.EOF`, never the zeros an unwritten region would hand back for free. Sparse storage serving holes as real content is what lets a write offset stand in for output nothing produced, so anything sizing an allocation against this reader (`saferio` in `debug/elf` does exactly that) stays bounded by work actually done. `FirstGap` answers where the next write fits, so callers filling holes do not need the extent bookkeeping and cannot re-derive that rule wrongly, and it only reports gaps lying entirely inside `[0, within)`. The extent type is unexported for the same reason. The rest of the contract worth stating: reads and writes after `Close` fail with `os.ErrClosed` rather than looking like an empty buffer, and a write that fails leaves the buffer unchanged. Memory is bounded by the limit rather than by how much is written: filling 1MB and filling 64MB cost about the same. What lands on disk past that limit is the caller's bound to set, not this package's. Growth is geometric and capped, because sizing the tier to exactly what each write needs is quadratic once a caller streams through it in small chunks. The golang cataloger is the only consumer today, and nothing else in the tree has this shape. Signed-off-by: Alex Goodman <wagoodman@users.noreply.github.com> * fix(golang): rebuild UPX binaries through spillbuf and read the reconstruction everywhere Two amplification paths were still reachable. A 128 byte input allocated 16MB by trusting `sz_cpr` before weighing it against the bytes the file actually holds, and the reconstruction was assembled in a `[]byte` sized from the header's declared original size, so a 301KB input allocated 300MB. The reconstruction is a `spillbuf.Buffer` now, which is what makes the second one go away: blocks are placed at the offsets the file declares, nothing is pre-sized from a claim, and the reader's length is the contiguous run actually rebuilt. That last part is the invariant everything downstream leans on. A reader reporting the declared size would serve the holes between placed blocks as zeros it never stored, and a 64 byte block parked at `p_filesize-64` then made a 300KB input hand out a 64MB reader: measured, that drove 269MB through `getBuildInfo` and returned nothing, silently. Placement and storage are separate concerns. `upx.go` places blocks at the offsets the file declares and asks the buffer how much was rebuilt and where the next gap is; it knows nothing about temp files or memory limits. The remaining bounds are ratios against the input wherever they can be, since an absolute ceiling only ever drops a large legitimate binary. The one absolute left is on `p_filesize`, because padding an input is nearly free, and the LZMA dictionary is paid for in its own block's `sz_cpr`. Interface change: `scanFile` takes a context and hands back the reconstruction for each binary that turned out to be packed, and the caller owns it. Everything after the build info read (crypto settings, arch, symbols, the version scan) reads it, so a packed binary no longer reports its packages with no symbols at all. Also narrows what gets reported. This cataloger runs on every executable in an image, so reporting every `getBuildInfo` error attached an unknown to every corrupt ELF, odd PE and non-Go Mach-O slice in it. Now only four gaps, the ones that cost the SBOM something syft could have had: a packed file we could not decode (`errUPXDecompress`), a header the size bounds refused (`errUPXSizeRefused`), a reconstruction that came up short (`errUPXPartial`), and an ELF expansion `elfutil` declined (`ErrDeclaredSizeExceeded`). An unimplemented UPX method stays quiet on purpose: `upx` defaults to NRV2B and only LZMA is implemented here, so reporting it would attach an unknown to most packed non-Go binaries in an image. That filtering is a new pattern. No other cataloger picks which of its errors become unknowns, and the reason this one does is that it runs on every executable in an image rather than on files a glob already selected. Signed-off-by: Alex Goodman <wagoodman@users.noreply.github.com> * chore: ignore local spec/ planning notes `/specs` was already ignored; `/spec` is the same thing under the singular name and was not, so working notes landed in commits. Signed-off-by: Alex Goodman <wagoodman@users.noreply.github.com> * refactor(golang): name what the unpack hands back, not where it stores it the scan's signatures said `*spillbuf.Buffer` all the way down, which told every reader below the scan that it cares whether the reconstruction lives in memory or on disk. it does not. two interfaces instead, each naming only what its side actually uses: - `unpackedContents` for the consumers: `ReaderAt`, `Closer`, and a `Size` that is the contiguous run rebuilt from zero - `blockSink` for the decoder, which additionally needs `WriterAt` and `FirstGap` to place blocks this costs one thing worth flagging. `Close` on a nil `*spillbuf.Buffer` was nil-safe, so callers just deferred it; widened into an interface, a nil pointer becomes a non-nil interface and the same call panics. `closeUnpacked` absorbs that, and it is now the only way an owner releases contents. `readerFor`, `seekerFor` and `closeUnpacked` are the three places that resolve the nil. Signed-off-by: Alex Goodman <wagoodman@users.noreply.github.com> * docs(elfutil): say that CheckAllSections is the decompression-bomb gate the doc led with "bounds every section syft can drive debug/elf into decompressing", which describes the mechanism without ever naming what it is defending against. a reader landing on the call site could not tell that this is the decompression-bomb check. state the attack instead: a compressed section header declares its own decompressed size, debug/elf believes that number and allocates it on open, and nothing forces it to match what the compressed bytes actually yield. the 260KB ELF that drove 1.3GB of allocation now lives in the doc rather than only at the one call site that happened to mention it. comments only. Signed-off-by: Alex Goodman <wagoodman@users.noreply.github.com> * docs(golang): move the overflow note onto the bounds test it describes the "subtraction form" note sat above the phStart assignment with ten lines of wrap analysis between it and the `if` it was talking about, so the subtraction it names reads as missing. it is `hdrLen-phStart < phentsize`. move it onto that test and name the form it is avoiding (`phStart+phentsize > hdrLen`, which can overflow past the buffer end) so the referent is not several paragraphs away. comments only. Signed-off-by: Alex Goodman <wagoodman@users.noreply.github.com> * chore(golang): drop the internal/ README left over from xcoff that README existed to record where the vendored xcoff package came from and that Go keeps it internal, which is a provenance note worth having while third-party code sat there. dropping xcoff took the reason with it, and repurposing it to point at gotestdata just made it redundant: gotestdata has its own README covering why it is under internal/, why it is not testdata/, and what belongs in each. internal/ now holds one self-documenting directory. Signed-off-by: Alex Goodman <wagoodman@users.noreply.github.com> --------- Signed-off-by: Alex Goodman <wagoodman@users.noreply.github.com>
504 lines
16 KiB
Go
504 lines
16 KiB
Go
package golang
|
|
|
|
import (
|
|
"bytes"
|
|
"context"
|
|
"debug/macho"
|
|
"debug/pe"
|
|
"encoding/binary"
|
|
"errors"
|
|
"fmt"
|
|
"io"
|
|
"regexp"
|
|
"runtime/debug"
|
|
"slices"
|
|
"strconv"
|
|
"strings"
|
|
"sync"
|
|
"time"
|
|
|
|
"golang.org/x/mod/module"
|
|
|
|
"github.com/anchore/syft/internal"
|
|
"github.com/anchore/syft/internal/log"
|
|
"github.com/anchore/syft/syft/artifact"
|
|
"github.com/anchore/syft/syft/file"
|
|
"github.com/anchore/syft/syft/internal/elfutil"
|
|
"github.com/anchore/syft/syft/internal/unionreader"
|
|
"github.com/anchore/syft/syft/pkg"
|
|
"github.com/anchore/syft/syft/pkg/cataloger/generic"
|
|
)
|
|
|
|
const goArch = "GOARCH"
|
|
|
|
var (
|
|
// errUnrecognizedFormat is returned when a given executable file doesn't
|
|
// appear to be in a known format, or it breaks the rules of that format,
|
|
// or when there are I/O errors reading the file.
|
|
errUnrecognizedFormat = errors.New("unrecognized file format")
|
|
// devel is used to recognize the current default version when a golang main distribution is built
|
|
// https://github.com/golang/go/issues/29228 this issue has more details on the progress of being able to
|
|
// inject the correct version into the main module of the build process
|
|
|
|
knownBuildFlagPatterns = []*regexp.Regexp{
|
|
regexp.MustCompile(`(?m)\.[a-zA-Z0-9]*([rR]elease)?([gG]it)?([bB]uild)?[vV]er(sion)?=(\S+/)*(?P<version>v?\d+.\d+.\d+[-\w]*)`),
|
|
regexp.MustCompile(`(?m)\.[a-zA-Z0-9]*([tT]ag)=(\S+/)*(?P<version>v?\d+.\d+.\d+[-\w]*)`),
|
|
}
|
|
)
|
|
|
|
const devel = "(devel)"
|
|
|
|
type goBinaryCataloger struct {
|
|
licenseResolver goLicenseResolver
|
|
mainModuleVersion MainModuleVersionConfig
|
|
symbolSelector symbolSelector
|
|
|
|
// stdlibSymbols holds the standard-library function symbols discovered per binary (keyed by the
|
|
// binary's location), grouped by import path, populated during parsing and consumed by stdlibProcessor
|
|
// when it builds the synthetic "stdlib" package. Guarded by stdlibSymbolsMu because parsers run
|
|
// concurrently.
|
|
stdlibSymbols map[file.Coordinates]map[string][]string
|
|
stdlibSymbolsMu sync.Mutex
|
|
}
|
|
|
|
func newGoBinaryCataloger(opts CatalogerConfig) *goBinaryCataloger {
|
|
return &goBinaryCataloger{
|
|
licenseResolver: newGoLicenseResolver(binaryCatalogerName, opts),
|
|
mainModuleVersion: opts.MainModuleVersion,
|
|
symbolSelector: newSymbolSelector(opts.CaptureSymbols, opts.CaptureSymbolsModules),
|
|
stdlibSymbols: make(map[file.Coordinates]map[string][]string),
|
|
}
|
|
}
|
|
|
|
// recordStdlibSymbols merges the standard-library symbols discovered for a binary location (grouped by
|
|
// import path) so the stdlib processor can attach them to the synthetic stdlib package.
|
|
func (c *goBinaryCataloger) recordStdlibSymbols(coord file.Coordinates, symbols map[string][]string) {
|
|
if len(symbols) == 0 {
|
|
return
|
|
}
|
|
c.stdlibSymbolsMu.Lock()
|
|
defer c.stdlibSymbolsMu.Unlock()
|
|
existing := c.stdlibSymbols[coord]
|
|
if existing == nil {
|
|
existing = make(map[string][]string)
|
|
c.stdlibSymbols[coord] = existing
|
|
}
|
|
for path, names := range symbols {
|
|
merged := slices.Concat(existing[path], names)
|
|
slices.Sort(merged)
|
|
existing[path] = slices.Compact(merged)
|
|
}
|
|
}
|
|
|
|
// stdlibSymbolsFor returns the standard-library symbols recorded for a binary location. It returns a deep
|
|
// copy so callers cannot alias (and later mutate or race on) the map's internal state.
|
|
func (c *goBinaryCataloger) stdlibSymbolsFor(coord file.Coordinates) map[string][]string {
|
|
c.stdlibSymbolsMu.Lock()
|
|
defer c.stdlibSymbolsMu.Unlock()
|
|
return cloneSymbolGroups(c.stdlibSymbols[coord])
|
|
}
|
|
|
|
// cloneSymbolGroups returns a deep copy of a symbol group map (import path -> local symbol names), or nil
|
|
// when the input is empty.
|
|
func cloneSymbolGroups(groups map[string][]string) map[string][]string {
|
|
if len(groups) == 0 {
|
|
return nil
|
|
}
|
|
out := make(map[string][]string, len(groups))
|
|
for path, names := range groups {
|
|
out[path] = slices.Clone(names)
|
|
}
|
|
return out
|
|
}
|
|
|
|
// parseGoBinary catalogs packages found in the "buildinfo" section of a binary built by the go compiler.
|
|
func (c *goBinaryCataloger) parseGoBinary(ctx context.Context, resolver file.Resolver, _ *generic.Environment, reader file.LocationReadCloser) ([]pkg.Package, []artifact.Relationship, error) {
|
|
var pkgs []pkg.Package
|
|
|
|
unionReader, err := unionreader.GetUnionReader(reader.ReadCloser)
|
|
if err != nil {
|
|
return nil, nil, err
|
|
}
|
|
defer internal.CloseAndLogError(reader.ReadCloser, reader.RealPath)
|
|
|
|
mods, errs := scanFile(ctx, reader.Location, unionReader, c.symbolSelector.enabled())
|
|
// scanFile hands back the reconstruction for each binary that turned out to be packed. The readers
|
|
// below want it too, so ownership ends here and not inside the scan.
|
|
defer func() {
|
|
for _, mod := range mods {
|
|
closeUnpacked(mod.unpacked)
|
|
}
|
|
}()
|
|
|
|
var rels []artifact.Relationship
|
|
for _, mod := range mods {
|
|
var depPkgs []pkg.Package
|
|
mainPkg, depPkgs := c.buildGoPkgInfo(ctx, resolver, reader.Location, mod, mod.arch, seekerFor(mod.unpacked, unionReader))
|
|
if mainPkg != nil {
|
|
rels = createModuleRelationships(*mainPkg, depPkgs)
|
|
pkgs = append(pkgs, *mainPkg)
|
|
}
|
|
pkgs = append(pkgs, depPkgs...)
|
|
}
|
|
|
|
return pkgs, rels, errs
|
|
}
|
|
|
|
func createModuleRelationships(main pkg.Package, deps []pkg.Package) []artifact.Relationship {
|
|
var relationships []artifact.Relationship
|
|
|
|
for _, dep := range deps {
|
|
relationships = append(relationships, artifact.Relationship{
|
|
From: dep,
|
|
To: main,
|
|
Type: artifact.DependencyOfRelationship,
|
|
})
|
|
}
|
|
|
|
return relationships
|
|
}
|
|
|
|
// moduleEqual is used to deduplicate go modules especially the sub module may be identical to the main one
|
|
func moduleEqual(lhs, rhs *debug.Module) bool {
|
|
if lhs == rhs {
|
|
return true
|
|
}
|
|
if lhs == nil || rhs == nil {
|
|
return false
|
|
}
|
|
|
|
if lhs.Path != rhs.Path ||
|
|
lhs.Version != rhs.Version ||
|
|
lhs.Sum != rhs.Sum {
|
|
return false
|
|
}
|
|
|
|
return moduleEqual(lhs.Replace, rhs.Replace)
|
|
}
|
|
|
|
var emptyModule debug.Module
|
|
var moduleFromPartialPackageBuild = debug.Module{Path: "command-line-arguments"}
|
|
|
|
func (c *goBinaryCataloger) buildGoPkgInfo(ctx context.Context, resolver file.Resolver, location file.Location, mod *extendedBuildInfo, arch string, reader io.ReadSeeker) (*pkg.Package, []pkg.Package) {
|
|
if mod == nil {
|
|
return nil, nil
|
|
}
|
|
|
|
if missingMainModule(mod) {
|
|
mod.Main = createMainModuleFromPath(mod)
|
|
}
|
|
|
|
symbolsByModule, stdlibSymbols := moduleSymbols(mod.symbols, &mod.Main, mod.Deps)
|
|
c.recordStdlibSymbols(location.Coordinates, stdlibSymbols)
|
|
|
|
// keep only the modules the selector covers; the main module goes through the same map, so this
|
|
// incidentally decides the main module too (which is intended: it is treated like any dependency).
|
|
// unselected modules fall out entirely, so the lookups below yield nil rather than an empty map.
|
|
symbolsByModule = c.symbolSelector.filter(symbolsByModule)
|
|
|
|
var pkgs []pkg.Package
|
|
for _, dep := range mod.Deps {
|
|
if dep == nil {
|
|
continue
|
|
}
|
|
if moduleEqual(dep, &mod.Main) {
|
|
continue
|
|
}
|
|
lics := c.licenseResolver.getLicenses(ctx, resolver, dep.Path, dep.Version)
|
|
gover, experiments := getExperimentsFromVersion(mod.GoVersion)
|
|
|
|
m := newBinaryMetadata(
|
|
dep,
|
|
mod.Main.Path,
|
|
gover,
|
|
arch,
|
|
nil,
|
|
mod.cryptoSettings,
|
|
experiments,
|
|
symbolsByModule[dep.Path],
|
|
)
|
|
|
|
p := c.newGoBinaryPackage(
|
|
dep,
|
|
m,
|
|
lics,
|
|
location.WithAnnotation(pkg.EvidenceAnnotationKey, pkg.PrimaryEvidenceAnnotation),
|
|
)
|
|
if pkg.IsValid(&p) {
|
|
pkgs = append(pkgs, p)
|
|
}
|
|
}
|
|
|
|
if mod.Main == emptyModule {
|
|
return nil, pkgs
|
|
}
|
|
|
|
main := c.makeGoMainPackage(ctx, resolver, mod, arch, location, reader, symbolsByModule[mod.Main.Path])
|
|
|
|
return &main, pkgs
|
|
}
|
|
|
|
func missingMainModule(mod *extendedBuildInfo) bool {
|
|
if mod.Main == emptyModule && mod.Path != "" {
|
|
return true
|
|
}
|
|
// special case: when invoking go build with a source file and not a package (directory) then you will
|
|
// see "command-line-arguments" as the main module path... even though that's not the main module. In this
|
|
// circumstance, we should treat the main module as missing and search for it within the dependencies.
|
|
return mod.Main == moduleFromPartialPackageBuild
|
|
}
|
|
|
|
func (c *goBinaryCataloger) makeGoMainPackage(ctx context.Context, resolver file.Resolver, mod *extendedBuildInfo, arch string, location file.Location, reader io.ReadSeeker, symbols map[string][]string) pkg.Package {
|
|
gbs := getBuildSettings(mod.Settings)
|
|
lics := c.licenseResolver.getLicenses(ctx, resolver, mod.Main.Path, mod.Main.Version)
|
|
gover, experiments := getExperimentsFromVersion(mod.GoVersion)
|
|
|
|
m := newBinaryMetadata(
|
|
&mod.Main,
|
|
mod.Main.Path,
|
|
gover,
|
|
arch,
|
|
gbs,
|
|
mod.cryptoSettings,
|
|
experiments,
|
|
symbols,
|
|
)
|
|
|
|
if mod.Main.Version == devel {
|
|
version := c.findMainModuleVersion(&m, gbs, reader)
|
|
|
|
if version != "" {
|
|
// make sure version is prefixed with v as some build systems parsed
|
|
// during `findMainModuleVersion` can include incomplete semver
|
|
// vx.x.x is correct
|
|
version = ensurePrefix(version, "v")
|
|
}
|
|
mod.Main.Version = version
|
|
}
|
|
|
|
main := c.newGoBinaryPackage(
|
|
&mod.Main,
|
|
m,
|
|
lics,
|
|
location.WithAnnotation(pkg.EvidenceAnnotationKey, pkg.PrimaryEvidenceAnnotation),
|
|
)
|
|
|
|
return main
|
|
}
|
|
|
|
// this is checking for (.L)? because at least one binary seems to have \xA0L preceding the version string, but for some reason
|
|
// this is unable to be matched by the regex here as \x00\xA0L;
|
|
// the only thing that seems to work is to just look for version strings following both \x00 and \x00.L for now
|
|
var semverPattern = regexp.MustCompile(`(\x00|\x{FFFD})(.L)?(?P<version>v?(\d+\.\d+\.\d+[-\w]*[+\w]*))\x00`)
|
|
|
|
func (c *goBinaryCataloger) findMainModuleVersion(metadata *pkg.GolangBinaryBuildinfoEntry, gbs pkg.KeyValues, reader io.ReadSeeker) string {
|
|
vcsVersion, hasVersion := gbs.Get("vcs.revision")
|
|
timestamp, hasTimestamp := gbs.Get("vcs.time")
|
|
|
|
var ldflags, majorVersion, fullVersion string
|
|
if c.mainModuleVersion.FromLDFlags && metadata != nil {
|
|
// we've found a specific version from the ldflags! use it as the version.
|
|
// why not combine that with the pseudo version (e.g. v1.2.3-0.20210101000000-abcdef123456)?
|
|
// short answer: we're assuming that if a specific semver was provided in the ldflags that
|
|
// there is a matching vcs tag to match that could be referenced. This assumption could
|
|
// be incorrect in terms of the go.mod contents, but is not incorrect in terms of the logical
|
|
// version of the package.
|
|
ldflags, _ = metadata.BuildSettings.Get("-ldflags")
|
|
|
|
majorVersion, fullVersion = extractVersionFromLDFlags(ldflags, metadata.MainModule)
|
|
if fullVersion != "" {
|
|
return fullVersion
|
|
}
|
|
}
|
|
|
|
// guess the version from pattern matching in the binary (can result in false positives)
|
|
if c.mainModuleVersion.FromContents {
|
|
_, err := reader.Seek(0, io.SeekStart)
|
|
if err != nil {
|
|
log.WithFields("error", err).Trace("unable to seek to start of go binary reader")
|
|
} else {
|
|
if v := extractVersionFromContents(reader); v != "" {
|
|
return v
|
|
}
|
|
}
|
|
}
|
|
|
|
// fallback to using the go standard pseudo v0.0.0 version
|
|
if c.mainModuleVersion.FromBuildSettings && hasVersion && hasTimestamp {
|
|
version := vcsVersion
|
|
//NOTE: err is ignored, because if parsing fails
|
|
// we still use the empty Time{} struct to generate an empty date, like 00010101000000
|
|
// for consistency with the pseudo-version format: https://go.dev/ref/mod#pseudo-versions
|
|
ts, _ := time.Parse(time.RFC3339, timestamp)
|
|
if len(vcsVersion) >= 12 {
|
|
version = vcsVersion[:12]
|
|
}
|
|
|
|
return module.PseudoVersion(majorVersion, fullVersion, ts, version)
|
|
}
|
|
|
|
return ""
|
|
}
|
|
|
|
func extractVersionFromContents(reader io.Reader) string {
|
|
matchMetadata, err := internal.MatchNamedCaptureGroupsFromReader(semverPattern, reader)
|
|
if err != nil {
|
|
log.WithFields("error", err).Trace("unable to extract version from go binary reader")
|
|
return ""
|
|
}
|
|
|
|
version, ok := matchMetadata["version"]
|
|
if ok {
|
|
return version
|
|
}
|
|
return ""
|
|
}
|
|
|
|
func extractVersionFromLDFlags(ldflags string, maimModule string) (majorVersion string, fullVersion string) {
|
|
if ldflags == "" {
|
|
return "", ""
|
|
}
|
|
|
|
for _, pattern := range knownBuildFlagPatterns {
|
|
newPattern := regexp.MustCompile(fmt.Sprintf(`(main|%s\/[^\s]*)%s`, strings.ReplaceAll(maimModule, "/", "\\/"), pattern.String()))
|
|
groups := internal.MatchNamedCaptureGroups(newPattern, ldflags)
|
|
v, ok := groups["version"]
|
|
|
|
if !ok {
|
|
continue
|
|
}
|
|
|
|
fullVersion = v
|
|
if !strings.HasPrefix(v, "v") {
|
|
fullVersion = fmt.Sprintf("v%s", v)
|
|
}
|
|
components := strings.Split(v, ".")
|
|
|
|
if len(components) == 0 {
|
|
continue
|
|
}
|
|
|
|
majorVersion = strings.TrimPrefix(components[0], "v")
|
|
return majorVersion, fullVersion
|
|
}
|
|
|
|
return "", ""
|
|
}
|
|
|
|
func getGOARCH(settings []debug.BuildSetting) string {
|
|
for _, s := range settings {
|
|
if s.Key == goArch {
|
|
return s.Value
|
|
}
|
|
}
|
|
|
|
return ""
|
|
}
|
|
|
|
func getGOARCHFromBin(r io.ReaderAt) (string, error) {
|
|
// Read the first bytes of the file to identify the format, then delegate to
|
|
// a format-specific function to load segment and section headers.
|
|
ident := make([]byte, 16)
|
|
if n, err := r.ReadAt(ident, 0); n < len(ident) || err != nil {
|
|
return "", fmt.Errorf("unrecognized file format: %w", err)
|
|
}
|
|
|
|
var arch string
|
|
switch {
|
|
case bytes.HasPrefix(ident, []byte("\x7FELF")):
|
|
f, err := elfutil.NewFile(r)
|
|
if err != nil {
|
|
return "", fmt.Errorf("unrecognized file format: %w", err)
|
|
}
|
|
arch = f.Machine.String()
|
|
case bytes.HasPrefix(ident, []byte("MZ")):
|
|
f, err := pe.NewFile(r)
|
|
if err != nil {
|
|
return "", fmt.Errorf("unrecognized file format: %w", err)
|
|
}
|
|
arch = fmt.Sprintf("%d", f.Machine)
|
|
case bytes.HasPrefix(ident, []byte("\xFE\xED\xFA")) || bytes.HasPrefix(ident[1:], []byte("\xFA\xED\xFE")):
|
|
f, err := macho.NewFile(r)
|
|
if err != nil {
|
|
return "", fmt.Errorf("unrecognized file format: %w", err)
|
|
}
|
|
arch = f.Cpu.String()
|
|
case bytes.HasPrefix(ident, []byte{0x01, 0xDF}) || bytes.HasPrefix(ident, []byte{0x01, 0xF7}):
|
|
// XCOFF's target machine *is* the magic we just matched on (0737 / 0767), so there is nothing to
|
|
// parse: a full XCOFF walk would read the string table, every symbol and every relocation only to
|
|
// hand back these two bytes. Reading them directly also keeps stripped binaries working, which a
|
|
// walk does not since it needs a symbol table to get that far.
|
|
arch = strconv.Itoa(int(binary.BigEndian.Uint16(ident[:2])))
|
|
default:
|
|
return "", errUnrecognizedFormat
|
|
}
|
|
|
|
arch = strings.Replace(arch, "EM_", "", 1)
|
|
arch = strings.Replace(arch, "Cpu", "", 1)
|
|
arch = strings.ToLower(arch)
|
|
|
|
return arch, nil
|
|
}
|
|
|
|
func getBuildSettings(settings []debug.BuildSetting) pkg.KeyValues {
|
|
m := make(pkg.KeyValues, 0)
|
|
for _, s := range settings {
|
|
m = append(m, pkg.KeyValue{
|
|
Key: s.Key,
|
|
Value: s.Value,
|
|
})
|
|
}
|
|
return m
|
|
}
|
|
|
|
func getExperimentsFromVersion(version string) (string, []string) {
|
|
// See: https://github.com/anchore/grype/issues/1851
|
|
var experiments []string
|
|
version, rest, ok := strings.Cut(version, " ")
|
|
if ok {
|
|
// Assume they may add more non-version chunks in the future, so only look for "X:".
|
|
for chunk := range strings.SplitSeq(rest, " ") {
|
|
if strings.HasPrefix(rest, "X:") {
|
|
csv := strings.TrimPrefix(chunk, "X:")
|
|
experiments = append(experiments, strings.Split(csv, ",")...)
|
|
}
|
|
}
|
|
}
|
|
|
|
return version, experiments
|
|
}
|
|
|
|
func createMainModuleFromPath(existing *extendedBuildInfo) debug.Module {
|
|
// search for a main module candidate within the dependencies
|
|
var mainModuleCandidates []debug.Module
|
|
var usedIndex int
|
|
for i, dep := range existing.Deps {
|
|
if dep == nil {
|
|
continue
|
|
}
|
|
|
|
if dep.Version == devel {
|
|
usedIndex = i
|
|
mainModuleCandidates = append(mainModuleCandidates, *dep)
|
|
}
|
|
}
|
|
if len(mainModuleCandidates) == 1 {
|
|
// we need to prune the dependency from module list
|
|
existing.Deps = slices.Delete(existing.Deps, usedIndex, usedIndex+1)
|
|
return mainModuleCandidates[0]
|
|
}
|
|
|
|
// otherwise craft a main module from the path (a bit of a cop out, but allows us to have a main module)
|
|
return debug.Module{
|
|
Path: existing.Path,
|
|
Version: devel,
|
|
}
|
|
}
|
|
|
|
func ensurePrefix(s, prefix string) string {
|
|
if !strings.HasPrefix(s, prefix) {
|
|
return prefix + s
|
|
}
|
|
return s
|
|
}
|