engineering/java-topology
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

diamond-recursion deeper scan: CLEAN for pytorch/tensorflow/sklearn/ray/prefect/luigi/numpy

Browse source
This commit is contained in:
russell@unturf.com 2026-03-29 17:53:36 -04:00
parent 60cd7aa41c
commit 36b07aa1f4
7 changed files with 93 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

12
defects/numpy/numpy-diamond-recursion-CLEAN.md Normal file
View file

@ -0,0 +1,12 @@
## Diamond Recursion Scan (numpy) — CLEAN (deeper scan)
**Scan date:** 2026-03-29
**Pattern:** Recursive cycle/dependency check without visited set (CWE-407 diamond recursion, O(2^D))
### Files examined
- `numpy/f2py/crackfortran.py:_get_depend_dict` — uses `deps` dict as memoization cache; O(N²) list scan covered by numpy-0001 — CLEAN re diamond recursion
- `numpy/linalg/lapack_lite/make_lite.py:resolveAllDependencies` — iterative fixpoint with `done_this` set — CLEAN
- `numpy/f2py/crackfortran.py:traverse` — tree walker, not DAG — CLEAN
### Verdict: CLEAN — no NEW diamond recursion CWE-407; numpy-0001 covers existing list-scan issue