-
Notifications
You must be signed in to change notification settings - Fork 249
[nar info cache] Only fillNarInfoCache in perf-sensitive code path #1468
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Merged
Merged
Changes from 2 commits
Commits
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -36,7 +36,8 @@ var isNarInfoInCache = struct { | |
} | ||
|
||
// IsInBinaryCache returns true if the package is in the binary cache. | ||
// ALERT: Callers must call FillNarInfoCache before calling this function. | ||
// ALERT: Callers in a perf-sensitive code path should call FillNarInfoCache | ||
// before calling this function. | ||
func (p *Package) IsInBinaryCache() (bool, error) { | ||
|
||
if eligible, err := p.isEligibleForBinaryCache(); err != nil { | ||
|
@@ -47,41 +48,61 @@ func (p *Package) IsInBinaryCache() (bool, error) { | |
|
||
// Check if the narinfo is present in the binary cache | ||
isNarInfoInCache.lock.RLock() | ||
exists, ok := isNarInfoInCache.status[p.Raw] | ||
status, statusExists := isNarInfoInCache.status[p.Raw] | ||
isNarInfoInCache.lock.RUnlock() | ||
if !ok { | ||
return false, errors.Errorf( | ||
"narInfo cache miss: %v. Call FillNarInfoCache before invoking IsInBinaryCache", | ||
p.Raw, | ||
) | ||
if !statusExists { | ||
// Fallback to synchronously filling the nar info cache | ||
if err := p.fillNarInfoCache(); err != nil { | ||
return false, err | ||
} | ||
|
||
// Check again | ||
isNarInfoInCache.lock.RLock() | ||
status, statusExists = isNarInfoInCache.status[p.Raw] | ||
isNarInfoInCache.lock.RUnlock() | ||
if !statusExists { | ||
return false, errors.Errorf( | ||
"narInfo cache miss: %v. Should be filled by now", | ||
p.Raw, | ||
) | ||
} | ||
} | ||
return exists, nil | ||
return status, nil | ||
} | ||
|
||
// FillNarInfoCache checks the remote binary cache for the narinfo of each | ||
// package in the list, and caches the result. | ||
// Callers of IsInBinaryCache must call this function first. | ||
// Callers of IsInBinaryCache may call this function first as a perf-optimization. | ||
func FillNarInfoCache(ctx context.Context, packages ...*Package) error { | ||
if !featureflag.RemoveNixpkgs.Enabled() { | ||
return nil | ||
} | ||
|
||
eligiblePackages := []*Package{} | ||
for _, p := range packages { | ||
// NOTE: isEligibleForBinaryCache also ensures the package is | ||
// resolved in the lockfile, which must be done before the concurrent | ||
// section in this function below. | ||
isEligible, err := p.isEligibleForBinaryCache() | ||
// If the package is not eligible or there is an error in determining that, then skip it. | ||
if isEligible && err == nil { | ||
eligiblePackages = append(eligiblePackages, p) | ||
} | ||
} | ||
if len(eligiblePackages) == 0 { | ||
return nil | ||
} | ||
|
||
// Pre-compute values read in fillNarInfoCache | ||
// so they can be read from multiple go-routines without locks | ||
_, err := nix.Version() | ||
if err != nil { | ||
return err | ||
} | ||
_ = nix.System() | ||
for _, p := range packages { | ||
_, err := p.lockfile.Resolve(p.Raw) | ||
if err != nil { | ||
return err | ||
} | ||
} | ||
|
||
group, _ := errgroup.WithContext(ctx) | ||
for _, p := range packages { | ||
for _, p := range eligiblePackages { | ||
// If the package's NarInfo status is already known, skip it | ||
isNarInfoInCache.lock.RLock() | ||
_, ok := isNarInfoInCache.status[p.Raw] | ||
|
@@ -105,15 +126,11 @@ func FillNarInfoCache(ctx context.Context, packages ...*Package) error { | |
} | ||
|
||
// fillNarInfoCache fills the cache value for the narinfo of this package, | ||
// if it is eligible for the binary cache. | ||
// assuming it is eligible for the binary cache. Callers are responsible | ||
// for checking isEligibleForBinaryCache before calling this function. | ||
// | ||
// NOTE: this must be concurrency safe. | ||
func (p *Package) fillNarInfoCache() error { | ||
if eligible, err := p.isEligibleForBinaryCache(); err != nil { | ||
return err | ||
} else if !eligible { | ||
return nil | ||
} | ||
|
||
sysInfo, err := p.sysInfoIfExists() | ||
if err != nil { | ||
return err | ||
|
@@ -146,6 +163,7 @@ func (p *Package) fillNarInfoCache() error { | |
return nil | ||
} | ||
|
||
// isEligibleForBinaryCache returns true if the package is eligible for the binary cache. | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. lol, I'll improve this to be less self-referential. |
||
func (p *Package) isEligibleForBinaryCache() (bool, error) { | ||
sysInfo, err := p.sysInfoIfExists() | ||
if err != nil { | ||
|
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
For potentially simpler code. By definition,
fillNarInfoCache()
only returns a nil error if it succeeded. So you could do:Additionally, if
fillNarInfoCache
does(no need to lock because we never remove from cache)
Then this entire function could be:
(maybe rename
fillNarInfoCache
tofillNarInfoCacheIfNeeded
for clarity)There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Nope, this doesn't quite work for two reasons:
fillNarInfoCache stores the boolean of whether the value is stored or not. A false value for a key in
isNarInfoInCache
does not indicate an error.Golang maps are not safe for concurrent reads and writes, so we will need a lock.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
@savil you are correct on (1) but not on (2).
For (2), reading a
true
is only unsafe if we remove and/or change values. Since we should never remove/change values within a single command, I think this is safe and improves code readability quite a bit.For (1), we can modify
fillNarInfoCache()
to return(status, error)
. The early return continues to be safe because if something is set to true it never changes.An additional benefit of this approach is that we limit cache access to a single function.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
clarified why (2) is correct in #1473 (comment)