summaryrefslogtreecommitdiff
path: root/docs
diff options
context:
space:
mode:
authorCampbell Jones <serebit@archlinux.org>2024-08-09 23:30:28 -0400
committerEli Schwartz <eschwartz93@gmail.com>2025-02-19 14:01:56 -0500
commitdf79a515715ab5af963ba26376601b3bfff30a43 (patch)
treeb51240b93f39f4a71013db291880e41f697a82c1 /docs
parent1b54239a88261cbb679a342162d72632cd6b8093 (diff)
downloadmeson-df79a515715ab5af963ba26376601b3bfff30a43.tar.gz
build: Optimize transitive link dep resolution
In large repositories, transitive link dependency resolution using the current recursive algorithm can result in enough duplicate calls to cause the full system memory space to be used up. This commit simplifies link dep resolution by converting the currently used recursive algorithm to an iterative one that avoids performing work more than once. If a target's direct dependencies have already been processed, that target will not be processed again. These changes result in multiple orders of magnitude of improvements to dep resolution time and memory usage in the worst case. Co-authored-by: Xavier Claessens <xavier.claessens@collabora.com>
Diffstat (limited to 'docs')
0 files changed, 0 insertions, 0 deletions