| Commit message (Collapse) | Author | Age |
|
|
|
|
|
|
|
|
|
|
| |
discover that it no longer has certain deps.
In the common case, where a node's deps do not change in the end, this reduces lock contention and CPU.
The downside of this is that we now create a set of the previous reverse deps during each evaluation of a node. We don't store this set in order to conserve memory, so we pay for it in CPU. We will probably only construct it two or three times (most SkyFunctions don't have so many groups), so the cost shouldn't be so high, but we can try to mitigate if it shows up in profiling.
--
MOS_MIGRATED_REVID=122566267
|
|
|
|
|
|
|
| |
conversion is unnecessary and wasteful. In the remaining cases, the set conversion can be explicit.
--
MOS_MIGRATED_REVID=122294939
|
|
|
|
|
|
|
| |
allowing for future work that may want to access a particular group in the GroupedList without advancing the iterator.
--
MOS_MIGRATED_REVID=120933039
|
|
|
|
|
|
|
| |
node don't have access to its dependencies ("grandparents don't know grandchildren", or vice versa, depending on your point of view), changes to a node's dependencies can't affect downstream nodes.
--
MOS_MIGRATED_REVID=114143894
|
|
|
|
|
|
|
| |
Reduces garbage.
--
MOS_MIGRATED_REVID=109914243
|
|
|
|
|
|
|
|
|
| |
Also, in GroupedList, short-circuit expensive group equality check
with a reference check, saving time and garbage when groups are the
same object.
--
MOS_MIGRATED_REVID=109795332
|
|
|
|
|
|
|
| |
Reduces garbage.
--
MOS_MIGRATED_REVID=108977813
|
|
|
|
|
|
|
| |
Reduces garbage and wasted work
--
MOS_MIGRATED_REVID=108566164
|
|
|
|
|
|
|
| |
isolated from implementation details.
--
MOS_MIGRATED_REVID=108523104
|
|
|
|
|
|
|
| |
for the purpose of change pruning.
--
MOS_MIGRATED_REVID=108203369
|
|
|
|
|
| |
--
MOS_MIGRATED_REVID=106004898
|
|
|
|
|
|
|
|
|
|
|
| |
not all done during invalidation, repeated adding/removing means that we are consolidating more often, negating the benefit of delayed removals. To work around this, delay adds as well until we consolidate and verify the integrity of our data.
Since there is no well-defined point that a consolidation should trigger for a done node, we delay until our pending list is as large as the done list. We can tweak this if necessary for a memory/performance tradeoff.
The alternative to this that I could think of is giving up our strong integrity checks, which I'm not a fan of.
--
MOS_MIGRATED_REVID=105095886
|
|
|
|
|
|
|
| |
The value getting checked was the same as the value it was compared to.
--
MOS_MIGRATED_REVID=104144544
|
|
|
|
|
|
|
|
|
|
|
| |
The headers were modified with
`find . -type f -exec 'sed' '-Ei' 's|Copyright 201([45]) Google|Copyright 201\1 The Bazel Authors|' '{}' ';'`
And manual edit for not Google owned copyright. Because of the nature of ijar, I did not modified the header of file owned by Alan Donovan.
The list of authors were extracted from the git log. It is missing older Google contributors that can be added on-demand.
--
MOS_MIGRATED_REVID=103938715
|
|
|
|
|
|
|
| |
avoid mutating the deps of nodes that are still going to be deps after evaluation is finished.
--
MOS_MIGRATED_REVID=103659429
|
|
|
|
|
|
|
|
|
| |
not the iterator has more elements is a perfectly good signal.
Also put the reference hash code into the string representation for use in debugging.
--
MOS_MIGRATED_REVID=102264568
|
|
|
|
|
| |
--
MOS_MIGRATED_REVID=99747336
|
|
|
|
|
|
|
| |
MoreObjects#toStringHelper
--
MOS_MIGRATED_REVID=98383075
|
|
|
|
|
| |
--
MOS_MIGRATED_REVID=94910185
|
|
|
|
|
|
|
| |
needed. Also clean up some lint warnings/unresolved references.
--
MOS_MIGRATED_REVID=92380618
|
|
|
|
|
|
|
| |
serializable; alternative graph implementations no longer need these.
--
MOS_MIGRATED_REVID=88003503
|
|
|
|
|
| |
--
MOS_MIGRATED_REVID=87009938
|
|
|
|
|
| |
--
MOS_MIGRATED_REVID=85946859
|
|
|
|
|
| |
--
MOS_MIGRATED_REVID=85945243
|
|
--
MOE_MIGRATED_REVID=85702957
|