GH-116380: Speed up glob.glob() by removing some system calls

[barneygale]

Speed up glob.glob() and glob.iglob() by reducing the number of system calls made.

This unifies the implementations of globbing in the glob and pathlib modules.

Depends on

• GH-117586: Speed up pathlib.Path.glob() by working with strings #117589
• GH-115060: Speed up pathlib.Path.glob() by not scanning literal parts #117732

Filtered recursive walk

Expanding a recursive ** segment entails walking the entire directory tree, and so any subsequent pattern segments (except special segments) can be evaluated by filtering the expanded paths through a regex. For example, glob.glob("foo/**/*.py", recursive=True) recursively walks foo/ with os.scandir(), and then filters paths through a regex based on "**/*.py, with no further filesystem access needed.

This solves #104269 as a side-effect.

Tracking path existence

We store a flag alongside each path indicating whether the path is guaranteed to exist. As we process the pattern:

• Certain special pattern segments ("", "." and "..") leave the flag unchanged
• Literal pattern segments (e.g. foo/bar) set the flag to false
• Wildcard pattern segments (e.g. */*.py) set the flag to true (because children are found via os.scandir())
• Recursive pattern segments (e.g. **) leave the flag unchanged for the root path, and set it to true for descendants discovered via os.scandir().

If the flag is false at the end, we call lstat() on each path to filter out missing paths.

Minor speed-ups

We:

• Exclude paths that don't match a non-terminal non-recursive wildcard pattern prior to calling is_dir().
• Use a stack rather than recursion to implement recursive wildcards.
  • Addresses Change shutil.rmtree and os.walk to support very deep hierarchies #89727 for the glob module.
• Pre-compile regular expressions and pre-join literal pattern segments.
• Convert to/from bytes (a minor use-case) in iglob() rather than supporting bytes throughout. This particularly simplifies the code needed to handle relative bytes paths with dir_fd.
• Avoid calling os.path.join(); instead we keep paths in a normalized form and append trailing slashes when needed.
• Avoid calling os.path.normcase(); instead we use case-insensitive regex matching.

Implementation notes

Much of this functionality is already present in pathlib's implementation of globbing. The specific additions we make are:

1. Support for dir_fd
2. Support for include_hidden
3. Support for generating paths relative to root_dir

Results

Speedups via python -m timeit -s "from glob import glob" "glob(pattern, recursive=True, include_hidden=True)" from CPython source directory on Linux:

pattern	speedup
Lib/*	1.48x
Lib/*/	1.82x
Lib/*.py	1.15x
Lib/**	4.98x
Lib/**/	1.31x
Lib/**/*	1.82x
Lib/**/**	14.9x
Lib/**/*/	2.25x
Lib/**/*.py	1.81x
Lib/**/__init__.py	1.08x
Lib/**/*/*.py	2.38x
Lib/**/*/__init__.py	1.19x

• Issue: Speed up glob.glob() by reducing number of system calls made #116380

[barneygale]

Needs a fix for #116377 to land.

[gpshead]

Nice work!

[serhiy-storchaka]

Please do not hurry to merge. This is an old code. The main advantage of the initial code was its simplicity, but since then it was complicated by adding new features and optimizations. In particularly the use of os.scandir() instead of os.listdir() significantly improved performance. The new implementation should be benchmarked with different test cases: deep and wide threes, files and directories domination.

[barneygale]

Thanks Serhiy! We use os.scandir() if either:

1. We're expanding a recursive wildcard (we need to distinguish directories in order to recurse)
2. We're expanding a non-final non-recursive wildcard (we need to select only directories)

If neither of these are true, then we don't need to stat() the children, and so os.listdir() is actually a little faster I think. But I will test this on a few machines to be sure!

edit: to further illustrate what I mean, here's where os.listdir() is used:

	non-recursive part	recursive part
non-terminal part	os.scandir()	os.scandir()
terminal part	os.listdir() <--	os.scandir()

[barneygale]

The new implementation should be benchmarked with different test cases: deep and wide threes, files and directories domination.

I've been looking into this! The randomfiletree project is helpful - it can repeatedly walk a tree and create child files/folders according to a gaussian distribution, which seems to me like a good approximation for an average "shallow and wide" filesystem structure, including tweaking for file or folder distribution.

It's difficult to produce "deep and narrow" trees this way, as the file/folder probability would need to change with the depth (I think?). I've been considering writing a tree generator that works this way, e.g.:

• At depth==0, generate 100 subdirectories
• At 0 < depth < 50, generate 1 subdirectory
• At depth==50, generate 100 files

... but is that overly arbitrary? Is there a better way? Or do I just need to come up with a bunch of test cases along those lines?

[barneygale]

A test of 100 nested directories named "deep" from my Linux machine:

pattern	speedup
deep/**	3.86x
deep/**/	4.03x
deep/**/*	4.92x
deep/**/*/	4.93x

[barneygale]

@picnixz to address some of your comments on using map() rather than looping and yield: I did this so that calling close() on the iglob(dir_fd=blah) generator causes os.close() to be called on all open file descriptors, which seems to work with a stack of for loops but not map(). But I didn't add a test case - I'll do that now :)

[picnixz]

That's... an interesting functionality I wasn't aware of :) If someone could explain to me the reason I'd be happy. Anyway, let's keep your loops.

[picnixz]

The journey was a bit long but I have nothing else to say here! Thank you, as always, for addressing my nitpicking comments and considering my suggestions!

I'd be more comfortable if @serhiy-storchaka can have a final look at it just to see whether I've missed some logic.

[barneygale]

Thank you very much for the thorough review. Your comments were very helpful as ever, thank you for being patient.