mirror of
https://github.com/hanzoai/forge.git
synced 2026-10-30 15:00:39 +00:00
Source files keep their SPDX-License-Identifier and Hanzo copyright line; the Gitea, Gogs and LFS Test Server copyrights they used to repeat now live once in NOTICE, alongside LICENSE. The header lint accepts any copyright line above the SPDX line, so it no longer demands an upstream one. Co-authored-by: Hanzo Dev <[email protected]>
74 lines
1.8 KiB
Go
74 lines
1.8 KiB
Go
// Copyright 2026 Hanzo AI, Inc. All rights reserved.
|
|
// SPDX-License-Identifier: MIT
|
|
|
|
package git
|
|
|
|
import (
|
|
"bytes"
|
|
"io"
|
|
)
|
|
|
|
// ParseTreeEntries parses the output of a `git ls-tree -l` command.
|
|
func ParseTreeEntries(data []byte) ([]*TreeEntry, error) {
|
|
return parseTreeEntries(data, nil)
|
|
}
|
|
|
|
// parseTreeEntries FIXME this function's design is not right, it should not make the caller read all data into memory
|
|
func parseTreeEntries(data []byte, ptree *Tree) ([]*TreeEntry, error) {
|
|
entries := make([]*TreeEntry, 0, bytes.Count(data, []byte{'\n'})+1)
|
|
for pos := 0; pos < len(data); {
|
|
posEnd := bytes.IndexByte(data[pos:], '\n')
|
|
if posEnd == -1 {
|
|
posEnd = len(data)
|
|
} else {
|
|
posEnd += pos
|
|
}
|
|
|
|
line := data[pos:posEnd]
|
|
lsTreeLine, err := parseLsTreeLine(line)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
entry := &TreeEntry{
|
|
ptree: ptree,
|
|
ID: lsTreeLine.ID,
|
|
entryMode: lsTreeLine.EntryMode,
|
|
name: lsTreeLine.Name,
|
|
size: lsTreeLine.Size.Value(),
|
|
sized: lsTreeLine.Size.Has(),
|
|
}
|
|
pos = posEnd + 1
|
|
entries = append(entries, entry)
|
|
}
|
|
return entries, nil
|
|
}
|
|
|
|
var _ = catBatchParseTreeEntries // bypass "unused" lint because it is only used by "nogogit"
|
|
|
|
func catBatchParseTreeEntries(objectFormat ObjectFormat, ptree *Tree, rd BufferedReader, sz int64) ([]*TreeEntry, error) {
|
|
entries := make([]*TreeEntry, 0, 10)
|
|
|
|
loop:
|
|
for sz > 0 {
|
|
mode, fname, objID, count, err := ParseCatFileTreeLine(objectFormat, rd)
|
|
if err != nil {
|
|
if err == io.EOF {
|
|
break loop
|
|
}
|
|
return nil, err
|
|
}
|
|
sz -= int64(count)
|
|
entry := new(TreeEntry)
|
|
entry.ptree = ptree
|
|
entry.entryMode = mode
|
|
entry.ID = objID
|
|
entry.name = fname
|
|
entries = append(entries, entry)
|
|
}
|
|
if _, err := rd.Discard(1); err != nil {
|
|
return entries, err
|
|
}
|
|
|
|
return entries, nil
|
|
}
|